Efficient Network Folding Techniques for Routing Permutations in VLSI

Hussein Alnuweiri, Sadiq M. Sait

Research output: Contribution to journalArticle

Abstract

Network folding is a technique for realizing permutations on N elements using interconnection networks with M input (and output) terminals, where M < N. A major motivation for network folding is the severely limited number of I/O pins in microelectronic packages, such as VLSI chips or multichip module (MCM) packages. Cost overhead and performance degradation due to off-chip communication as well as long on-chip wires may render implementing otherwise good designs infeasible or inefficient. In this paper, an efficient and systematic methodology is proposed for designing folded permutation networks that can route the class of bit-permute-complement (BPC) permutations. In particular, it is shown that any folded BPC permutation network can be constructed using only two stages of uniform-size transpose networks. This results in highly modular structures for BPC networks. The methodology trades off speed (time), with I/O and chip-area.

Original languageEnglish
Pages (from-to)254-263
Number of pages10
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume3
Issue number2
DOIs
Publication statusPublished - 1 Jan 1995
Externally publishedYes

Fingerprint

Multichip modules
Microelectronics
Wire
Degradation
Communication
Costs

Keywords

  • area-time tradeoffs
  • BPC permutations
  • I/O reduction
  • I/O-time tradeoffs
  • network folding
  • permutation routing
  • VLSI interconnection

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Efficient Network Folding Techniques for Routing Permutations in VLSI. / Alnuweiri, Hussein; Sait, Sadiq M.

In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 3, No. 2, 01.01.1995, p. 254-263.

Research output: Contribution to journalArticle

@article{6227cea00d7e408b885f9acb8d59d643,
title = "Efficient Network Folding Techniques for Routing Permutations in VLSI",
abstract = "Network folding is a technique for realizing permutations on N elements using interconnection networks with M input (and output) terminals, where M < N. A major motivation for network folding is the severely limited number of I/O pins in microelectronic packages, such as VLSI chips or multichip module (MCM) packages. Cost overhead and performance degradation due to off-chip communication as well as long on-chip wires may render implementing otherwise good designs infeasible or inefficient. In this paper, an efficient and systematic methodology is proposed for designing folded permutation networks that can route the class of bit-permute-complement (BPC) permutations. In particular, it is shown that any folded BPC permutation network can be constructed using only two stages of uniform-size transpose networks. This results in highly modular structures for BPC networks. The methodology trades off speed (time), with I/O and chip-area.",
keywords = "area-time tradeoffs, BPC permutations, I/O reduction, I/O-time tradeoffs, network folding, permutation routing, VLSI interconnection",
author = "Hussein Alnuweiri and Sait, {Sadiq M.}",
year = "1995",
month = "1",
day = "1",
doi = "10.1109/92.386225",
language = "English",
volume = "3",
pages = "254--263",
journal = "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
issn = "1063-8210",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Efficient Network Folding Techniques for Routing Permutations in VLSI

AU - Alnuweiri, Hussein

AU - Sait, Sadiq M.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - Network folding is a technique for realizing permutations on N elements using interconnection networks with M input (and output) terminals, where M < N. A major motivation for network folding is the severely limited number of I/O pins in microelectronic packages, such as VLSI chips or multichip module (MCM) packages. Cost overhead and performance degradation due to off-chip communication as well as long on-chip wires may render implementing otherwise good designs infeasible or inefficient. In this paper, an efficient and systematic methodology is proposed for designing folded permutation networks that can route the class of bit-permute-complement (BPC) permutations. In particular, it is shown that any folded BPC permutation network can be constructed using only two stages of uniform-size transpose networks. This results in highly modular structures for BPC networks. The methodology trades off speed (time), with I/O and chip-area.

AB - Network folding is a technique for realizing permutations on N elements using interconnection networks with M input (and output) terminals, where M < N. A major motivation for network folding is the severely limited number of I/O pins in microelectronic packages, such as VLSI chips or multichip module (MCM) packages. Cost overhead and performance degradation due to off-chip communication as well as long on-chip wires may render implementing otherwise good designs infeasible or inefficient. In this paper, an efficient and systematic methodology is proposed for designing folded permutation networks that can route the class of bit-permute-complement (BPC) permutations. In particular, it is shown that any folded BPC permutation network can be constructed using only two stages of uniform-size transpose networks. This results in highly modular structures for BPC networks. The methodology trades off speed (time), with I/O and chip-area.

KW - area-time tradeoffs

KW - BPC permutations

KW - I/O reduction

KW - I/O-time tradeoffs

KW - network folding

KW - permutation routing

KW - VLSI interconnection

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

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

U2 - 10.1109/92.386225

DO - 10.1109/92.386225

M3 - Article

VL - 3

SP - 254

EP - 263

JO - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

JF - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

SN - 1063-8210

IS - 2

ER -