29 search results - page 2 / 6 » Parallel FFT Algorithms on Network-on-Chips |
PC
1998
13 years 7 months ago
1998
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
DAC
1996
ACM
13 years 12 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
FMSD
2002
13 years 7 months ago
2002
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
PACT
2009
Springer
14 years 2 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
IPPS
1996
IEEE
14 years 40 min ago
1996
IEEE
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...