A Parallel Architecture for the Self-Sorting FFT Algorithm

The self-sorting (SS) algorithm is a highly efficient version of the fast Fourier transform (FFT), because, unlike the generally used algorithms, it does not require shuffling the sequence to be transformed (digit reversal), In this work, we propose a parallel architecture that implements the SS rad...

Full description

Saved in:
Bibliographic Details
Published inJournal of parallel and distributed computing Vol. 31; no. 1; pp. 88 - 97
Main Authors Arguello, F., Bruguera, J.D., Zapata, E.L.
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 15.11.1995
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Software engineering
Theoretical computing
System architecture
Modular design
Parallel system
Fast Fourier transformation
Interconnected power system
Processing time
Queue
Data flow
Sorting
Online AccessGet full text
ISSN0743-7315
1096-0848
DOI10.1006/jpdc.1995.1147

Cover

More Information
Summary:The self-sorting (SS) algorithm is a highly efficient version of the fast Fourier transform (FFT), because, unlike the generally used algorithms, it does not require shuffling the sequence to be transformed (digit reversal), In this work, we propose a parallel architecture that implements the SS radix r ( r ≥ 2) algorithm. The data flow of the algorithm is decomposed, in a natural way, into two sections that are implemented by means of FIFO queues located in the processors and an interprocessor connection network (perfect unshuffle). The resulting design is regular and modular, and, whenever possible, presents constant geometry. The total processing time required is nN/ rQ cycles for a transform of size N = r n computed using Q = r q processors. Consequently, there are no cycle losses.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.1995.1147