JOURNAL ARTICLE
On Rearrangeable Three-Stage Connecting Networks
Year: 1962 Journal: Bell System Technical Journal Vol: 41 (5)Pages: 1481-1492 Publisher: Institute of Electrical and Electronics Engineers
Abstract
A class of three-stage connecting networks proven rearrangeable by D. Slepian is considered. Bounds on the number of calls that must be moved are obtained by some simple new methods.
Keywords:
Simple (philosophy) Stage (stratigraphy) Class (philosophy) Computer science Mathematics Artificial intelligence Geology
Metrics
191
Cited By
2.81
FWCI (Field Weighted Citation Impact)
7
Refs
0.93
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Cellular Automata and Applications
Physical Sciences → Computer Science → Computational Theory and Mathematics
Interconnection Networks and Systems
Physical Sciences → Computer Science → Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Rearrangeable three-stage Clos connecting networks
Journal: Mathematical Proceedings of the Cambridge Philosophical Society Year: 1964 Vol: 60 (4)Pages: 939-948
JOURNAL ARTICLE
Three-Stage Rearrangeable Connecting Networks in the Thermodynamic Limit: Number of Needed Reswitchings
Ernesto BonomiJean Luc LuttonMarc Feix
Journal: IRE Transactions on Communications Systems Year: 1983 Vol: 31 (1)Pages: 110-113
JOURNAL ARTICLE
On rearrangeable multirate three-stage Clos networks
Journal: Theoretical Computer Science Year: 2006 Vol: 372 (1)Pages: 103-107
JOURNAL ARTICLE
Optimal Rearrangeable Multistage Connecting Networks
Journal: Bell System Technical Journal Year: 1964 Vol: 43 (4)Pages: 1641-1656