Nothing Special   »   [go: up one dir, main page]

Falkowski, 1994 - Google Patents

Properties and ways of calculation of multi-polarity generalized Walsh transforms

Falkowski, 1994

Document ID
12162489643114947926
Author
Falkowski B
Publication year
Publication venue
IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

External Links

Snippet

A new formulation of the multi-polarity generalized Walsh transform has been introduced. The formulation allows a uniform representation of Boolean functions by a set of orthogonal and generalized Walsh spectral coefficients. Forward and inverse transformation kernels …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
    • H03H17/00—Networks using digital techniques
    • H03H17/02—Frequency selective networks
    • H03H17/0223—Computation saving measures; Accelerating measures
    • H03H17/0225—Measures concerning the multipliers
    • H03H17/0226—Measures concerning the multipliers comprising look-up tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models

Similar Documents

Publication Publication Date Title
Stanković et al. The Haar wavelet transform: its status and achievements
Karpovsky et al. Spectral logic and its applications for the design of digital devices
Agaian et al. Binary polynomial transforms and non-linear digital filters
Falkowski Properties and ways of calculation of multi-polarity generalized Walsh transforms
Rushdi et al. Derivation of a scalable solution for the problem of factoring an n-bit integer
Arambepola Discrete Fourier transform processor based on the prime-factor algorithm
Thornton et al. Transformations amongst the Walsh, Haar, arithmetic and Reed-Muller spectral domains
Falkowski Recursive relationships, fast transforms, generalisations and VLSI iterative architecture for Gray code ordered Walsh functions
Pekmestzi et al. Long unsigned number systolic serial multipliers and squarers
Li et al. Case studies of logical computation on stochastic bit streams
Mertzios Parallel modeling and structure of nonlinear Volterra discrete systems
Stankovic Some remarks on terminology in spectral techniques for logic design: Walsh transform and Hadamard matrices
Salehi et al. Efficient Hardware Implementation of Discrete Wavelet Transform Based on Stochastic Computing
Ersoy A two-stage representation of DFT and its applications
Kekre et al. Unified fast algorithm for most commonly used transforms using mixed radix and kronecker product
Falkowski et al. Walsh Type Transforms for Completely and Incompletely Specified Multiple-Valued Input Binary Functions.
Ramírez et al. Implementation of RNS-based distributed arithmetic discrete wavelet transform architectures using field-programmable logic
Rushdi On computing the spectral coefficients of a switching function
Bespalov Discrete Chrestenson transform
Falkowski An algorithm for the calculation of generalized Walsh transform of Boolean functions
Falkowski Generalized multi-polarity Haar transform
Falkowski et al. Fastest classes of linearly independent transforms over GF (3) and their properties
Adhami et al. Fast Fourier transformation based on number theoretic transforms
Schafer et al. A fast computer implementation of adding and arithmetic multi-polarity transforms for logic design
Rushdi et al. A Scalable Hardware Circuit for Factoring an n-bit Integer: Analytic and Computational Perspectives