A new systolic architecture for pipeline prime factor DFT-algorithm
The paper shows how a rectangular array of N=N/sub 1spl times/N/sub 2/ processing elements (PE), where N/sub 1/ and N/sub 2/ are relatively prime, can be used do carry out efficient two-dimensional systolic implementation of N-point DFT, offering highly attractive throughput rates in relation to oth...
Saved in:
| Published in | Great Lakes 4th Symposium on VLSI: Design Automation of High Performance VLSI Systems pp. 40 - 45 |
|---|---|
| Main Author | |
| Format | Conference Proceeding |
| Language | English Japanese |
| Published |
IEEE Comput. Soc. Press
17.12.2002
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 0818656107 9780818656101 |
| DOI | 10.1109/GLSV.1994.289998 |
Cover
| Summary: | The paper shows how a rectangular array of N=N/sub 1spl times/N/sub 2/ processing elements (PE), where N/sub 1/ and N/sub 2/ are relatively prime, can be used do carry out efficient two-dimensional systolic implementation of N-point DFT, offering highly attractive throughput rates in relation to other N-processor solutions, such as the conventional linear systolic array. The systematic approach allows one to choose, among all possible systolic processors for the 2D-DFT algorithm, an optimal design which has the minimum number of locally connected PE's, good coordination between the processes of computation and communication, a small number of I/O pins, the minimum possible time of processing and the minimum amount of input data.< > |
|---|---|
| ISBN: | 0818656107 9780818656101 |
| DOI: | 10.1109/GLSV.1994.289998 |