[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Selesnick et al., 1996 - Google Patents

Automatic generation of prime length FFT programs

Selesnick et al., 1996

View PDF
Document ID
5157269025430495496
Author
Selesnick I
Burrus C
Publication year
Publication venue
IEEE Transactions on Signal Processing

External Links

Snippet

Describes a set of programs for circular convolution and prime length fast Fourier transforms (FFTs) that are relatively short, possess great structure, share many computational procedures, and cover a large variety of lengths. The programs make clear the structure of …
Continue reading at citeseerx.ist.psu.edu (PDF) (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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30389—Query formulation
    • 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
    • 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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • 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/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • 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
    • G06F7/72—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 using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • 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/0211—Frequency selective networks using specific transformation algorithms, e.g. WALSH functions, Fermat transforms, Mersenne transforms, polynomial transforms, Hilbert transforms
    • H03H17/0213—Frequency domain filters using Fourier transforms

Similar Documents

Publication Publication Date Title
Vishwanath et al. VLSI architectures for the discrete wavelet transform
Burrus et al. Convolution algorithms
Lu Algorithms for discrete Fourier transform and convolution
Silvester et al. Efficient techniques for finite element analysis of electric machines
Wold et al. Pipeline and parallel-pipeline FFT processors for VLSI implementations
Selesnick et al. Automatic generation of prime length FFT programs
Selesnick et al. Fast convolution and filtering
Stankovic et al. Fourier analysis on finite groups with applications in signal processing and system design
Schroeppel A two counter machine cannot calculate 2N
AU579621B2 (en) Computer and method for discrete transforms
Evangelista et al. Frequency-warped filter banks and wavelet transforms: A discrete-time approach via Laguerre expansion
Lebrun et al. Gröbner bases and wavelet design
Lee et al. An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations
Marino et al. A parallel implementation of the 2-D discrete wavelet transform without interprocessor communications
Chang et al. A high speed VLSI architecture of discrete wavelet transform for MPEG-4
Mehendale et al. Area-delay tradeoff in distributed arithmetic based implementation of FIR filters
Fridman et al. Synthesis of regular very large scale integration (VLSI) architectures for the 1D discrete wavelet transform
Lu et al. FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
Perera Architectures for multiplierless fast Fourier transform hardware implementation in VLSI
Bhattacharya et al. Some historical notes on number theoretic transform
Tseng A systolic array programming language
Polyak et al. Filters and filter banks for periodic signals, the Zak transform, and fast wavelet decomposition
Zergainoh et al. Implementation and performance of composite fast FIR filtering algorithms
Daher et al. Fast algorithm for optimal design of block digital filters based on circulant matrices
Pavu et al. An algorithm for accelerating GHM Multiwavelet transformation on FPGA