+

Valencia et al., 2019 - Google Patents

Compact and high‐throughput parameterisable architectures for memory‐based FFT algorithms

Valencia et al., 2019

View PDF @Full View
Document ID
17354629383862507611
Author
Valencia D
Alimohammad A
Publication year
Publication venue
IET Circuits, Devices & Systems

External Links

Snippet

Designers must carefully choose the best‐suited fast Fourier transform (FFT) algorithm among various available techniques for the custom implementation that meets their design requirements, such as throughput, latency, and area. This article, to the best of authors' …
Continue reading at ietresearch.onlinelibrary.wiley.com (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/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/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
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30634—Querying
    • 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
    • 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
    • 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
    • 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/20—Handling natural language data
    • 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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • 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

Similar Documents

Publication Publication Date Title
Mu et al. Scalable and conflict-free NTT hardware accelerator design: Methodology, proof, and implementation
Lee et al. Balanced binary-tree decomposition for area-efficient pipelined FFT processing
Zhong et al. A power-scalable reconfigurable FFT/IFFT IC based on a multi-processor ring
Qureshi et al. Unified architecture for 2, 3, 4, 5, and 7‐point DFTs based on Winograd Fourier transform algorithm
Ingemarsson et al. Efficient FPGA mapping of pipeline SDF FFT cores
Ferreira et al. Low‐power fast Fourier transform hardware architecture combining a split‐radix butterfly and efficient adder compressors
Godi et al. Design optimisation of multiplier‐free parallel pipelined FFT on field programmable gate array
Kwong et al. A high performance split-radix FFT with constant geometry architecture
Singh et al. Design of radix 2 butterfly structure using vedic multiplier and CLA on xilinx
Bhagat et al. High‐throughput and compact FFT architectures using the Good–Thomas and Winograd algorithms
Xiao et al. VLSI design of low‐cost and high‐precision fixed‐point reconfigurable FFT processors
Valencia et al. Compact and high‐throughput parameterisable architectures for memory‐based FFT algorithms
Sung et al. Low-power and high-speed CORDIC-based split-radix FFT processor for OFDM systems
Wang et al. Design of pipelined FFT processor based on FPGA
Wang et al. A generator of memory-based, runtime-reconfigurable 2 N 3 M 5 K FFT engines
Gilan et al. Optimized power and speed of Split-Radix, Radix-4 and Radix-2 FFT structures
Prots' ko Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions
Nguyen et al. An FPGA-based implementation of a pipelined FFT processor for high-speed signal processing applications
Kallapu et al. DRRA-based reconfigurable architecture for mixed-radix FFT
Hazarika et al. Energy efficient VLSI architecture of real‐valued serial pipelined FFT
More et al. FPGA implementation of FFT processor using vedic algorithm
Hassan et al. FPGA Implementation of Parallel Fast Fourier Transform
Lau et al. A FPGA-based library for on-line signal processing
Patil et al. An area efficient and low power implementation of 2048 point FFT/IFFT processor for mobile WiMAX
Krishnegowda et al. Design and Synthesis of a 256-Point Radix-2 DIT FFT Core with Design Ware Library using Fixed-Point Number Representation
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载