The Community for Technology Leaders
Green Image
Issue No. 07 - July (1994 vol. 5)
ISSN: 1045-9219
pp: 763-769
<p>This paper presents a new class of AT/sup 2/-optimal networks for computing themultidimensional discrete Fourier transform. Although optimal networks have beenproposed previously, the networks proposed in this paper are based on a newmethodology for mapping large K-shuffle networks, K/spl ges/2, onto smaller areanetworks that maintain the optimality of the DFT network. Such networks are used toperform the index-rotation operations needed by the multidimensional computation. Theresulting networks have simple regular layouts, and can be easily partitioned among several chips in order to reduce the number of input-output pins per chip.</p>
Index TermsVLSI; fast Fourier transforms; circuit analysis computing; minimisation of switching nets; optimal VLSI networks; multidimensional transforms; AT/sup 2/-optimal networks; discrete Fourier transform; mapping large K-shuffle networks; index-rotation operations; regular layouts
H.M. Alnuweiri, "Optimal VLSI Networks for Multidimensional Transforms", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 763-769, July 1994, doi:10.1109/71.296321
102 ms
(Ver 3.1 (10032016))