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

Huang et al., 2016 - Google Patents

A high-parallelism memory-based FFT processor with high SQNR and novel addressing scheme

Huang et al., 2016

Document ID
5354535475322062852
Author
Huang S
Chen S
Publication year
Publication venue
2016 IEEE International Symposium on Circuits and Systems (ISCAS)

External Links

Snippet

This paper presents an area-efficient memory-based FFT processor for long FFT lengths. To achieve high throughput, radix-4 2 FFT algorithm is adopted to reduce number of FFT stages. For low-complexity realization of the main butterfly processing element, a folded-by …
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
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0844—Multiple simultaneous or quasi-simultaneous cache accessing
    • G06F12/0846—Cache with multiple tag or data arrays being simultaneously accessible
    • 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/80—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • G06F15/8007—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors single instruction multiple data [SIMD] multiprocessors
    • 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
    • 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
    • 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/5009—Computer-aided design using simulation
    • 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
    • G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode
    • G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
    • 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
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Luo et al. Efficient memory-addressing algorithms for FFT processor design
Chen et al. Continuous-flow parallel bit-reversal circuit for MDF and MDC FFT architectures
Xia et al. A memory-based FFT processor design with generalized efficient conflict-free address schemes
Mu et al. Scalable and conflict-free NTT hardware accelerator design: Methodology, proof, and implementation
Xiao et al. An efficient FFT engine with reduced addressing logic
Hussain et al. Designing fast fourier transform accelerators for orthogonal frequency-division multiplexing systems
Huang et al. A high-parallelism memory-based FFT processor with high SQNR and novel addressing scheme
US11614945B2 (en) Apparatus and method of a scalable and reconfigurable fast fourier transform
Sung Memory-efficient and high-speed split-radix FFT/IFFT processor based on pipelined CORDIC rotations
Kala et al. High throughput, low latency, memory optimized 64K point FFT architecture using novel radix-4 butterfly unit
Yang et al. A High-Throughput and Flexible Architecture Based on a Reconfigurable Mixed-Radix FFT With Twiddle Factor Compression and Conflict-Free Access
Chang Design of an 8192-point sequential I/O FFT chip
Kaya et al. A novel addressing algorithm of radix-2 FFT using single-bank dual-port memory
Xiao et al. Low-cost reconfigurable VLSI architecture for fast fourier transform
Kumar et al. Implementation of Area Efficient Pipelined R2 2 SDF FFT Architecture
Hazarika et al. Low-complexity continuous-flow memory-based FFT architectures for real-valued signals
Wang et al. An area-and energy-efficient hybrid architecture for floating-point FFT computations
Kallapu et al. DRRA-based Reconfigurable Architecture for Mixed-Radix FFT
Yu et al. Efficient FFT Implementation on a CGRA
Alsuhli et al. Area and Power Efficient FFT/IFFT Processor for FALCON Post-Quantum Cryptography
Wang et al. A Parallel Radix-2 k FFT Processor using Single-Port Merged-Bank Memory
More et al. FPGA implementation of FFT processor using vedic algorithm
Lin et al. Design of a High-Throughput and Area-Efficient Ultra-Long FFT Processor
Patil et al. An area efficient and low power implementation of 2048 point FFT/IFFT processor for mobile WiMAX
Jinhe et al. An efficient implementation of fft based on cgra