Tampere University of Technology

TUTCRIS Research Portal

New Identical Radix-2^k Fast Fourier Transform Algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Details

Original languageEnglish
Title of host publicationIEEE International Workshop on Signal Processing Systems
PublisherIEEE
ISBN (Electronic)978-1-5090-3361-4
DOIs
Publication statusPublished - 2016
Publication typeA4 Article in a conference publication
EventIEEE International Workshop on Signal Processing Systems -
Duration: 1 Jan 1900 → …

Publication series

Name
ISSN (Electronic)2374-7390

Conference

ConferenceIEEE International Workshop on Signal Processing Systems
Period1/01/00 → …

Abstract

The radix-2k fast Fourier transform (FFT) algorithm is used to achieve at the same time both a radix-2 butterfly and a reduced number of twiddle factor multiplication. In this paper we present a new identical radix-2^k FFT algorithms, which has same number of butterfly and twiddle factor multiplication. The difference is only in twiddle factor stage location in signal flow graph (SFG). Further, analyze these algorithms and is shown that the round-off noise of identical radix-22, radix-23, and radix-24 FFT algorithms at output is reduced 27%, 8%, 3% respectively.

Publication forum classification

Field of science, Statistics Finland

Downloads statistics

No data available