By Topic

A modification to a decomposition algorithm of Gordon and Srikanthan

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hwang, F.K. ; AT&T Bell Labs., Murray Hill, NJ, USA

Recently, J. Gordon and S. Srikanthan (1990) gave a new approach to route a rearrangeable three-stage Clos network. However, their algorithm was suspected to be incomplete by Y.K. Chiu and W.C. Siu (1991), and by H.Y. Lee and J.D. Carpinelli (1994). We show that a modification of their algorithm assures a correct routing

Published in:

Computers, IEEE Transactions on  (Volume:46 ,  Issue: 8 )