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

Suleiman et al., 2008 - Google Patents

A family of scalable FFT architectures and an implementation of 1024-point radix-2 FFT for real-time communications

Suleiman et al., 2008

View PDF
Document ID
9167888795577087875
Author
Suleiman A
Saleh H
Hussein A
Akopian D
Publication year
Publication venue
2008 IEEE International Conference on Computer Design

External Links

Snippet

The paper presents a family of architectures for FFT implementation based on the decomposition of the perfect shuffle permutation, which can be designed with variable number of processing elements. This provides designers with a trade-off choice of speed vs …
Continue reading at www.researchgate.net (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/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/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • 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/5045—Circuit design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored programme computers
    • G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
    • 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/544—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 for evaluating functions by calculation
    • G06F7/5443—Sum of products
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application

Similar Documents

Publication Publication Date Title
Jia et al. A new VLSI-oriented FFT algorithm and implementation
Wang et al. A combined SDC-SDF architecture for normal I/O pipelined radix-2 FFT
He et al. A new approach to pipeline FFT processor
Uzun et al. FPGA implementations of fast Fourier transforms for real-time signal and image processing
Hemmert et al. An analysis of the double-precision floating-point FFT on FPGAs
Ingemarsson et al. Efficient FPGA mapping of pipeline SDF FFT cores
Ingemarsson et al. SFF—The single-stream FPGA-optimized feedforward FFT hardware architecture
Chen et al. Energy efficient parameterized FFT architecture
Chen et al. Energy-efficient architecture for stride permutation on streaming data
Hsiao et al. Efficient VLSI implementations of fast multiplierless approximated DCT using parameterized hardware modules for silicon intellectual property design
Suleiman et al. A family of scalable FFT architectures and an implementation of 1024-point radix-2 FFT for real-time communications
Takala et al. Butterfly unit supporting radix-4 and radix-2 FFT
Wang et al. Design of pipelined FFT processor based on FPGA
Chang Design of an 8192-point sequential I/O FFT chip
Netto et al. A high throughput configurable FFT processor for WLAN and WiMax protocols
Ajmal et al. FPGA based area optimized parallel pipelined radix-2 2 feed forward FFT architecture
Hazarika et al. Low-complexity continuous-flow memory-based FFT architectures for real-valued signals
Patil et al. An area efficient and low power implementation of 2048 point FFT/IFFT processor for mobile WiMAX
Hsiao et al. Design of low-cost and high-throughput linear arrays for DFT computations: Algorithms, architectures, and implementations
Kallapu et al. DRRA-based Reconfigurable Architecture for Mixed-Radix FFT
More et al. FPGA implementation of FFT processor using vedic algorithm
Hazarika et al. Energy efficient VLSI architecture of real‐valued serial pipelined FFT
Mohan et al. Implementation of N-Point FFT/IFFT processor based on Radix-2 Using FPGA
Suleiman et al. Scalable FFT architecture vs. multiple pipeline FFT architectures—Hardware implementation and cost
Takala et al. Scalable interconnection networks for partial column array processor architectures