A Three-Stage One-Sided Rearrangeable Polygonal Switching Network

Authors:
Mao-Hsu Yen;Sao-Jie Chen;Sanko H. Lan
Affiliations:
China Institute of Technology, Taipei, Taiwan;National Taiwan Univ. , Taipei, Taiwan;Univ. of Science and Technology, Taipei, Taiwan
Venue:
IEEE Transactions on Computers
Year:
2001

Citing 4
Cited 6

On a Class of Rearrangeable Networks

IEEE Transactions on Computers
Universal switch modules for FPGA design

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Universal switch blocks for three-dimensional FPGA design

FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
Generic Universal Switch Blocks

IEEE Transactions on Computers

Crossbar based design schemes for switch boxes and programmable interconnection networks

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Decomposition Design Theory and Methodology for Arbitrary-Shaped Switch Boxes

IEEE Transactions on Computers
An edge ordering problem of regular hypergraphs

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Design automation for reconfigurable interconnection networks

ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Analyzing permutation capability of multistage interconnection networks with colored Petri nets

Information Sciences: an International Journal
A generic three-sided rearrangeable switching network for polygonal FPGA design

VLSI Design

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper proposes a three-stage rearrangeable polygonal switching network (PSN) for interconnecting one-sided input-output terminals. In comparing our PSN with a three-stage one-sided Clos switching network of the same size and with the same number of switches, we prove that rearrangeability of a PSN is better than that of a Clos switching network. Also, the switches efficiency of PSN is explored.