Optimal VLSI Networks for Multidimensional Transforms

Research output: Contribution to journalArticle

3 Citations (Scopus)


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 input—output pins per chip.

Original languageEnglish
Pages (from-to)763-769
Number of pages7
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number7
Publication statusPublished - 1 Jan 1994
Externally publishedYes



  • area-time tradeoffs
  • discrete
  • folded index-rotation networks
  • Fourier transform
  • multidimensional transforms
  • Parallel processing
  • shuffle permutations
  • VLSI computations

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this