Sciweavers

29 search results - page 1 / 6
» Parallel FFT Algorithms on Network-on-Chips
Sort
View
ITNG
2008
IEEE
13 years 11 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh
ICASSP
2009
IEEE
13 years 8 months ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel
HPCC
2007
Springer
13 years 11 months ago
Adaptive Computation of Self Sorting In-Place FFTs on Hierarchical Memory Architectures
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
13 years 10 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman