Optimal VLSI Networks for Multidimensional Transforms

Research output: Contribution to journalArticle

3 Citations (Scopus)

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

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

Fingerprint

Discrete Fourier transforms
Mathematical transformations

Keywords

  • 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

Optimal VLSI Networks for Multidimensional Transforms. / Alnuweiri, Hussein.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 5, No. 7, 01.01.1994, p. 763-769.

Research output: Contribution to journalArticle

@article{1a38096255e44946af5e595b6a436642,
title = "Optimal VLSI Networks for Multidimensional Transforms",
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 input—output pins per chip.",
keywords = "area-time tradeoffs, discrete, folded index-rotation networks, Fourier transform, multidimensional transforms, Parallel processing, shuffle permutations, VLSI computations",
author = "Hussein Alnuweiri",
year = "1994",
month = "1",
day = "1",
doi = "10.1109/71.296321",
language = "English",
volume = "5",
pages = "763--769",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "7",

}

TY - JOUR

T1 - Optimal VLSI Networks for Multidimensional Transforms

AU - Alnuweiri, Hussein

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

KW - area-time tradeoffs

KW - discrete

KW - folded index-rotation networks

KW - Fourier transform

KW - multidimensional transforms

KW - Parallel processing

KW - shuffle permutations

KW - VLSI computations

UR - http://www.scopus.com/inward/record.url?scp=0028462452&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028462452&partnerID=8YFLogxK

U2 - 10.1109/71.296321

DO - 10.1109/71.296321

M3 - Article

VL - 5

SP - 763

EP - 769

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 7

ER -