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

Mohan et al., 2022 - Google Patents

Implementation of N-Point FFT/IFFT processor based on Radix-2 Using FPGA

Mohan et al., 2022

Document ID
12687549270443194380
Author
Mohan K
Naresh K
Ganesh C
Reddy V
Kishore K
Publication year
Publication venue
2022 International Conference on Recent Trends in Microelectronics, Automation, Computing and Communications Systems (ICMACC)

External Links

Snippet

A Fast Fourier Transform is an efficient algorithm to compute the discrete Fourier Transform (DFT). It is one of the finest operations in the area of digital signal and image processing. The operation requires a high computational module ie,(N 2 complex multiplications and …
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
    • 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/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/499—Denomination or exception handling, e.g. rounding, overflow
    • 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
    • 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
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • 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
    • G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
    • G06F2207/3804—Details
    • 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
    • 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
    • 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
    • G06F11/00—Error detection; Error correction; Monitoring
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G06F2217/78—Power analysis and optimization

Similar Documents

Publication Publication Date Title
US20070266070A1 (en) Split-radix FFT/IFFT processor
Zhong et al. A power-scalable reconfigurable FFT/IFFT IC based on a multi-processor ring
Xia et al. A memory-based FFT processor design with generalized efficient conflict-free address schemes
Huang et al. CORDIC based fast radix-2 DCT algorithm
Ingemarsson et al. Efficient FPGA mapping of pipeline SDF FFT cores
Ingemarsson et al. SFF—The single-stream FPGA-optimized feedforward FFT hardware architecture
CN112231626A (en) FFT processor
Sung Memory-efficient and high-speed split-radix FFT/IFFT processor based on pipelined CORDIC rotations
Singh et al. Design of radix 2 butterfly structure using vedic multiplier and CLA on xilinx
Mohan et al. Implementation of N-Point FFT/IFFT processor based on Radix-2 Using FPGA
Langemeyer et al. A FPGA architecture for real-time processing of variable-length FFTs
Lin et al. The split-radix fast Fourier transforms with radix-4 butterfly units
Cui-xiang et al. Some new parallel fast Fourier transform algorithms
Wang et al. Design of pipelined FFT processor based on FPGA
Takala et al. Butterfly unit supporting radix-4 and radix-2 FFT
Mukherjee et al. A novel architecture of area efficient FFT algorithm for FPGA implementation
Kallapu et al. DRRA-based Reconfigurable Architecture for Mixed-Radix FFT
Chouhan et al. FPGA Implementation of High Performance and Energy Efficient Radix-4 based FFT
Alsuhli et al. Area and Power Efficient FFT/IFFT Processor for FALCON Post-Quantum Cryptography
Vergara et al. A 195K FFT/s (256-points) high performance FFT/IFFT processor for OFDM applications
Patil et al. An area efficient and low power implementation of 2048 point FFT/IFFT processor for mobile WiMAX
More et al. FPGA implementation of FFT processor using vedic algorithm
Suleiman et al. A family of scalable FFT architectures and an implementation of 1024-point radix-2 FFT for real-time communications
Kumar et al. Hardware Implementation of 64-Bits Data by Radix-8 FFT/IFFT for High Speed Applications
Niharika et al. Implementation of radix-4 butterfly structure to prevent arithmetic overflow