Loading...
Loading...

Go to the content (press return)

Radix-R FFT and IFFT factorizations for parallel implementation

Author
Marti, P.; Reig, R.; Parisi, V.
Type of activity
Journal article
Journal
Advances in soft computing
Date of publication
2009
Volume
50
First page
152
Last page
160
DOI
https://doi.org/10.1007/978-3-540-85863-8_19 Open in new window
Repository
http://hdl.handle.net/2117/12876 Open in new window
URL
http://www.springerlink.com/content/88250nln708t1322/ Open in new window
Abstract
Two radix-R regular interconnection pattern families of factorizations for both the FFT and the IFFT -also known as parallel or Pease factorizations- are reformulated and presented. Number R is any power of 2 and N, the size of the transform, any power of R. The first radix-2 parallel FFT algorithm -one of the two known radix-2 topologies- was proposed by Pease. Other authors extended the Pease parallel algorithm to different radix and other particular solutions were also reported. The presented...
Citation
Marti, P.; Reig, R.; Parisi, V. Radix-R FFT and IFFT factorizations for parallel implementation. "Advances in soft computing", 2009, vol. 50, p. 152-160.
Group of research
AHA - Advanced Hardware Architectures
SARTI - Technological Development Center for Remote Acquisition and Data Processing System

Participants