Sankaran et al., 2020 - Google Patents

Design and implementation of 1024 point pipelined radix 4 FFT processor on FPGA for biomedical signal processing applications

Sankaran et al., 2020

Document ID
1485647712762321420
Author
Sankaran A
Reddy M
Arunkumar K
Bhaskar M
Publication year
Publication venue
2020 IEEE International Symposium on Smart Electronic Systems (iSES)(Formerly iNiS)

External Links

Snippet

Fourier Transform form is essential for signal processing applications such as Biomedical Signal Processing, Speech Processing, Radar signal processing etc. The Fast Fourier Transform (FFT) is chosen as the first choice for time domain to frequency domain …
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
    • 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
    • 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/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
    • 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/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
    • 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
    • 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

Similar Documents

Publication Publication Date Title
US6366936B1 (en) Pipelined fast fourier transform (FFT) processor having convergent block floating point (CBFP) algorithm
Garrido et al. A 4096-point radix-4 memory-based FFT using DSP slices
CN101231632A (en) The Method of Using FPGA to Process Floating Point FFT
CN112231626A (en) FFT processor
US20140330880A1 (en) Methods and devices for multi-granularity parallel fft butterfly computation
Sona et al. Vedic multiplier implementation in VLSI
Carranza et al. Fast and scalable computation of the forward and inverse discrete periodic radon transform
Cetin et al. An integrated 256-point complex FFT processor for real-time spectrum analysis and measurement
Khatua et al. VLSI architecture of DCT-based harmonic wavelet transform for time–frequency analysis
Sankaran et al. Design and implementation of 1024 point pipelined radix 4 FFT processor on FPGA for biomedical signal processing applications
Zhou et al. Design and implementation of a 1024-point high-speed FFT processor based on the FPGA
Singh et al. Design of radix 2 butterfly structure using vedic multiplier and CLA on xilinx
Revanna et al. A scalable FFT processor architecture for OFDM based communication systems
Mohan et al. Implementation of N-Point FFT/IFFT processor based on Radix-2 Using FPGA
Wang et al. Design of pipelined FFT processor based on FPGA
Takala et al. Butterfly unit supporting radix-4 and radix-2 FFT
Kallapu et al. DRRA-based reconfigurable architecture for mixed-radix FFT
Mohammadnia et al. Minimizing the error: a study of the implementation of an integer split-radix FFT on an FPGA for medical imaging
Hassan et al. FPGA Implementation of Parallel Fast Fourier Transform
Mookherjee et al. Hardware implementation of the Hirschman optimal transform
Ranganathan et al. Efficient hardware implementation of scalable FFT using configurable Radix-4/2
More et al. FPGA implementation of FFT processor using vedic algorithm
Dawwd et al. Reduced area and low power implementation of FFT/IFFT processor
Lau et al. A FPGA-based library for on-line signal processing
Melnyk et al. FFT Processor IP Cores synthesis on the base of configurable pipeline architecture