+

Hazarika et al., 2019 - Google Patents

Energy efficient VLSI architecture of real‐valued serial pipelined FFT

Hazarika et al., 2019

View HTML @Full View
Document ID
14397722459202213377
Author
Hazarika J
Khan M
Ahamed S
Nemade H
Publication year
Publication venue
IET Computers & Digital Techniques

External Links

Snippet

This study presents an energy‐efficient serial pipelined architecture of fast Fourier transform (FFT) to process real‐valued signals. A new data mapping scheme is presented to obtain a normal order input–output without the requirement of a post‐processing stage. It facilitates …
Continue reading at ietresearch.onlinelibrary.wiley.com (HTML) (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
    • 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/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/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • 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/4806—Computations with complex numbers
    • 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
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • 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
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Zhang et al. Highly efficient architecture of NewHope-NIST on FPGA using low-complexity NTT/INTT
Mu et al. Scalable and conflict-free NTT hardware accelerator design: Methodology, proof, and implementation
Khan et al. High-speed and low-latency ECC processor implementation over GF ($2^{m}) $ on FPGA
Li et al. MeNTT: A compact and efficient processing-in-memory number theoretic transform (NTT) accelerator
Zhong et al. A power-scalable reconfigurable FFT/IFFT IC based on a multi-processor ring
Zhou et al. Pipeline FFT architectures optimized for FPGAs
Ingemarsson et al. Efficient FPGA mapping of pipeline SDF FFT cores
Pan et al. Efficient digit‐serial modular multiplication algorithm on FPGA
Ferreira et al. Low‐power fast Fourier transform hardware architecture combining a split‐radix butterfly and efficient adder compressors
Kavitha et al. An efficient FPGA architecture for reconfigurable FFT processor incorporating an integration of an improved CORDIC and radix-2r algorithm
Hazarika et al. Low‐complexity, energy‐efficient fully parallel split‐radix FFT architecture
Lee et al. Design of low energy, high performance synchronous and asynchronous 64-point FFT
Pitkänen et al. Low-power application-specific processor for FFT computations
Fonseca et al. Design of power efficient butterflies from Radix-2 DIT FFT using adder compressors with a new XOR gate topology
Hazarika et al. Energy efficient VLSI architecture of real‐valued serial pipelined FFT
Xiao et al. VLSI design of low‐cost and high‐precision fixed‐point reconfigurable FFT processors
CN100390782C (en) A real-time fast Fourier transform circuit
Badar et al. High speed FFT processor design using radix− 4 pipelined architecture
Garcia et al. VLSI configurable delay commutator for a pipeline split radix FFT architecture
Joshi et al. Distributed arithmetic based split-radix FFT
Wang et al. An area-and energy-efficient hybrid architecture for floating-point FFT computations
Wang et al. A generator of memory-based, runtime-reconfigurable 2 N 3 M 5 K FFT engines
Ferizi et al. Design and implementation of a fixed-point radix-4 FFT optimized for local positioning in wireless sensor networks
Nguyen et al. An FPGA-based implementation of a pipelined FFT processor for high-speed signal processing applications
TWI423046B (en) Recursive modified discrete cosine transform and inverse discrete cosine transform system with a computing kernel of rdft
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载