Split Vector-Radix-2/8 2-D Fast Fourier Transform
Journal
IEEE Signal Processing Letters
Journal Volume
11
Journal Issue
5
Pages
459-462
Date Issued
2004-05
Date
2004-05
Author(s)
Chen, Wei-Yu
DOI
246246/200611150121924
Abstract
This letter presents an efficient split vector-radix-2/8 fast Fourier transform (FFT) algorithm. The split vector-radix-2/8 FFT algorithm saves 14% real multiplications and has much lower arithmetic complexity than the split vector-radix-2/4 FFT algorithm. Moreover, this algorithm reduces 25% data loads and stores compared with the split vector-radix-2/4 FFT algorithm.
Subjects
Split-radix-2/4
split-radix-2/8
two-dimensional
(2-D) fast Fourier transform (FFT)
(2-D) fast Fourier transform (FFT)
vector-radix
Other Subjects
Algorithms; Computational complexity; Fast Fourier transforms; Two dimensional; Vectors; Arithmetic complexity; Split vector radix; Signal processing
Publisher
Taipei:National Taiwan University Dept Elect Engn
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
5267.pdf
Size
448.93 KB
Format
Adobe PDF
Checksum
(MD5):8a707ea13e16858ffa21c62f4552b218