This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Three-Stage One-Sided Rearrangeable Polygonal Switching Network
November 2001 (vol. 50 no. 11)
pp. 1291-1294

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.

[1] C. Clos, “A Study of Nonblocking Switching Networks,” Bell Systems Technical J., vol. 22, pp. 406-424, Mar. 1953.
[2] V.E. Benes, “On Rearrangeable Three-Stage Connecting Networks,” Bell Systems Technical J., vol. 41, no. 5, pp. 1481-1492, Sept. 1962.
[3] P.K. Chan and M. Schlag, “Architecture Tradeoffs in Field Programmable Device-Based Computing Systems,” Proc. IEEE Workshop FPGAs for Custom Computing Machines, pp. 152-161, 1993.
[4] Y.-M. Yeh, T.-Y. Feng, "On a Class of Rearrangeable Networks," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,361-1,379, Nov. 1992.
[5] C. Mitchell and P. Wild, “One-Stage One-Sided Rearrangeable Switching Networks,” IEEE Trans. Comm., vol. 37, no. 1, pp. 52-56, Jan. 1989.
[6] A. Varma and S. Chalasani, “Reduction of Crosspoints in One-Sided Crosspoint Switching Networks,” Proc. Eighth Ann. Joint Conf. IEEE Computer and Comm. Soc. Technology: Emerging or Converging (INFOCOM '89), vol. 3, pp. 943-952, 1989.
[7] J. Gordon and S. Srikanthan, “Single Sided Switching Network,” Electronics Letters, vol. 26, no. 4, pp. 248-250, Feb. 1990.
[8] Y.-W. Chang, D.F. Wong, and C.K. Wong, “Universal Switch Modules for FPGA Design,” ACM Trans. Design Automation of Electronic Systems, vol. 1, no. 1, pp. 80-101, Jan. 1996.
[9] G.M. Wu, M. Shyu, and Y.W. Chang, “Universal Switch Blocks for Three-Dimensional FPGA Design,” Proc. 1999 ACM Int'l Symp. Field Programmable Gate Arrays (FPGA-99), Feb. 1999.
[10] M. Shyu, G.M. Wu, Y.D. Chang, and Y.W. Chang, “Generic Universal Switch Blocks,” IEEE Trans. Computers, vol. 49, no. 4, pp. 348-359, Apr. 2000.
[11] M.H. Yen, M.C. Shie, and S.H. Lan, “Polygonal Routing Network for FPGA/FPIC,” Proc. 1999 Int'l Symp. VLSI Technology, Systems, and Applications (VLSI-TSA), pp. 104-107, 1999.
[12] M.H. Yen, S.J. Chen, and S.H. Lan, “Symmetric and Programmable Multi-Chip Module for Rapid Prototyping System,” Proc. 1999 IEEE Workshop Signal Processing Systems (SiPS 99) Design and Implementation, pp. 301-310, 1999.
[13] M.H. Yen, S.J. Chen, and S.H. Lan, “Symmetric and Programmable Multi-Chip Module for Low-Power Prototyping System,” VLSI Design, An Int'l J. Custom-Chip Design, Simulation, and Testing, (to appear).

Index Terms:
Rearrangeable, switching network, polygonal switching network.
Citation:
Mao-Hsu Yen, Sao-Jie Chen, Sanko H. Lan, "A Three-Stage One-Sided Rearrangeable Polygonal Switching Network," IEEE Transactions on Computers, vol. 50, no. 11, pp. 1291-1294, Nov. 2001, doi:10.1109/12.966502
Usage of this product signifies your acceptance of the Terms of Use.