DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures

DOI10.1109/TC.2017.2677427zbMATH Open1374.94766OpenAlexW2594538975MaRDI QIDQ4589520FDOQ4589520

Authors: Diego F. G. Coelho, Nilanka Rajapaksha, Gihan J. Mendis, Arjuna Madanayake, Renato J. Cintra, Vassil S. Dimitrov 

Publication date: 10 November 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2017.2677427

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Numerical methods for discrete and fast Fourier transforms (65T50) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

This page was built for publication: DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589520)