OPTIMAL VLSI NETWORKS FOR MULTIDIMENSIONAL TRANSFORMS Academic Article

abstract

• This short note presents a new class of AT2optimal networks for computing the multidimensional Discrete Fourier Transform. Although optimal networks have been proposed previously, the networks proposed in this short note are based on a new methodology for mapping large A-shuffle networks, K 2, onto smaller area networks that maintain the optimality of the DFT network. Such networks are used to perform the index-rotation operations needed by the multidimensional computation. The resulting networks have simple regular layouts, and can be easily partitioned among several chips in order to reduce the number of inputoutput pins per chip. 1994 IEEE

authors

• Alnuweiri, Hussein

published proceedings

• IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

author list (cited authors)

• ALNUWEIRI, H. M.

citation count

• 3

complete list of authors

• ALNUWEIRI, HM

publication date

• July 1994

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Parallel and Distributed Systems  Journal

keywords

• Area-time Tradeoffs
• Discrete Fourier Transform
• Folded Index-rotation Networks
• Multidimensional Transforms
• Parallel Processing
• Shuffle Permutations
• Vlsi Computations

Digital Object Identifier (DOI)

• 10.1109/71.296321

start page

• 763

end page

• 769

volume

• 5

issue

• 7

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2F71.296321