Title
DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures.
Abstract
A joint numerical representation based on both Gaussian and Eisenstein integers is proposed. This Gauss-Eisenstein representation maps complex numbers into four-tuples of integers with arbitrarily high precision. The representation furnishes the computation of the 3-, 6-, and 12-point discrete Fourier transform (DFT) at any desired accuracy. The associated fast algorithms based on the Gauss-Eisens...
Year
DOI
Venue
2017
10.1109/TC.2017.2677427
IEEE Transactions on Computers
Keywords
Field
DocType
Discrete Fourier transforms,Signal processing algorithms,Computer architecture,Encoding,Decoding,Algorithm design and analysis,Digital signal processing
Integer,Digital signal processing,Computer science,Parallel computing,Algorithm,Fast Fourier transform,Eisenstein integer,Virtex,Discrete Fourier transform,Quantization (signal processing),Clock rate
Journal
Volume
Issue
ISSN
66
8
0018-9340
Citations 
PageRank 
References 
1
0.38
17
Authors
6
Name
Order
Citations
PageRank
Diego F. G. Coelho153.19
Renato J. Cintra221826.82
Nilanka Rajapaksha3233.98
Gihan J. Mendis4433.35
Arjuna Madanayake524253.31
Vassil S. Dimitrov627431.85