Low-Complexity Rotators for the FFT Using Base-3 Signed Stages
2012 (English)In: APCCAS 2012 : 2012 IEEE Asia Pacific Conference on Circuits and Systems, Piscataway, N.J., USA: IEEE , 2012, 519-522 p.Conference paper (Refereed)
Rotations by angles that are fractions of the unit circle find applications in e.g. fast Fourier transform (FFT) architectures. In this work we propose a new rotator that consists of a series of stages. Each stage calculates a micro-rotation by an angle corresponding to a power-of-three fractional parts. Using a continuous powers-of-three range, it is possible to carry out all rotations required. In addition, the proposed rotators are compared to previous approaches, based of shift-and-add algorithms, showing improvements in accuracy and number of adders.
Place, publisher, year, edition, pages
Piscataway, N.J., USA: IEEE , 2012. 519-522 p.
FFT, cascaded, complex, twiddle, rotator, multiplierless, base 3
National CategorySignal Processing
IdentifiersURN: urn:nbn:se:liu:diva-84303DOI: 10.1109/APCCAS.2012.6419086ISI: 000316598900131ISBN: 978-1-4577-1728-4OAI: oai:DiVA.org:liu-84303DiVA: diva2:558647
IEEE Asia Pacific Conference on Circuits and Systems 2012, 2-5 December, Kaohsiung, Taiwan
Paper for special session.2012-10-152012-10-042015-03-11Bibliographically approved