Multiplierless implementation of rotators and FFTs

DOI10.1155/ASP.2005.2903zbMath1127.94324OpenAlexW2153069353WikidataQ59148820 ScholiaQ59148820MaRDI QIDQ2502864

Malcolm D. Macleod

Publication date: 13 September 2006

Published in: EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/asp.2005.2903

zbMATH Keywords

VLSIFFT implementationmultiplierless designrotator implementation

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

Fast discrete Fourier transform computations using the reduced adder graph technique

This page was built for publication: Multiplierless implementation of rotators and FFTs