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

Ayinala et al., 2013 - Google Patents

FFT architectures for real-valued signals based on radix-$2^{3} $ and radix-$2^{4} $ algorithms

Ayinala et al., 2013

Document ID
17567228027138469166
Author
Ayinala M
Parhi K
Publication year
Publication venue
IEEE Transactions on Circuits and Systems I: Regular Papers

External Links

Snippet

This paper presents a novel approach to develop pipelined fast Fourier transform (FFT) architectures for real-valued signals. The proposed methodology is based on modifying the flow graph of the FFT algorithm such that it has both real and complex datapaths. The …
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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2647—Arrangements specific to the receiver
    • 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
    • G06F1/16—Constructional details or arrangements

Similar Documents

Publication Publication Date Title
Ayinala et al. FFT architectures for real-valued signals based on radix-$2^{3} $ and radix-$2^{4} $ algorithms
Garrido et al. A pipelined FFT architecture for real-valued signals
Ayinala et al. Pipelined parallel FFT architectures via folding transformation
Garrido et al. Pipelined radix-$2^{k} $ feedforward FFT architectures
Yang et al. Power and area minimization of reconfigurable FFT processors: A 3GPP-LTE example
Parhi et al. Low-complexity Welch power spectral density computation
Chang et al. On the fixed-point accuracy analysis of FFT algorithms
Saeed et al. Efficient FPGA implementation of FFT/IFFT processor
Garrido et al. Feedforward FFT hardware architectures based on rotator allocation
Boopal et al. A reconfigurable FFT architecture for variable-length and multi-streaming OFDM standards
US20120041996A1 (en) Parallel pipelined systems for computing the fast fourier transform
Hsu et al. A 128-point multi-path SC FFT architecture
Kim et al. High speed eight-parallel mixed-radix FFT processor for OFDM systems
Arioua et al. VHDL implementation of an optimized 8-point FFT/IFFT processor in pipeline architecture for OFDM systems
Chang et al. An OFDM-specified lossless FFT architecture
Mookherjee et al. A low power radix-2 FFT accelerator for FPGA
CN101937332B (en) Multiplexing Method of Multipliers in Multiple FFT Processor Based on Radix-24 Algorithm
Qureshi et al. Low-complexity reconfigurable complex constant multiplication for FFTs
CN100390782C (en) A real-time fast Fourier transform circuit
Kim et al. Novel shared multiplier scheduling scheme for area-efficient FFT/IFFT processors
Lee et al. Modified sdf architecture for mixed dif/dit fft
Xiao et al. Low-cost reconfigurable VLSI architecture for fast fourier transform
Ayinala et al. Parallel-pipelined radix-2 2 FFT architecture for real valued signals
KR102301144B1 (en) Device for processing short time fourier transform of low complexity and method thereof
Hung et al. A low power and variable-length FFT processor design for flexible MIMO OFDM systems