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 degradationdue to off chip communication as well as long on chip wires may render implementing otherwise good designs infeasible or inefficient and systematic methodology is proposed for designing folded permutation networks that can be route the class of bit-permute-complement (BPC) permutations. In particulaer, is is shown that any folded BPC permutation network can be contructed 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.