LOOPING ALGORITHM EXTENDED TO BASE 2T REARRANGEABLE SWITCHING NETWORKS

被引：36

作者：

ANDRESEN, S ^{[1
]}

机构：

[1] UNIV TRONDHEIM,NORWEGIAN INST TECHNOL,N-7034 TRONDHEIM,NORWAY

来源：

关键词：

D O I：

10.1109/TCOM.1977.1093753

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：1057 / 1063

页数：7

共 10 条

[1]

ANDRESEN S, 1972, IEEE T COMMUN, V20, P838

[2]

BENES VE, MATHEMATICAL THEORY, pCH3

[3]

HALL M, 1956, AM MATH MONTHLY, V63, P716

[4]

JOEL AE, 1968, BELL SYSTEM TECH MAY, P813

[5] SHUFFLE-EXCHANGE NETWORK WITH SIMPLIFIED CONTROL [J].

LANG, T ;

STONE, HS .

[6]

MIRSKY L, 1971, MATHEMATICS SCI ENGI, V75

[7]

NEIMAN VI, 1969, ANN TELECOMMUNICATIO, P234

[8] CLASS OF REARRANGEABLE SWITCHING NETWORKS .1. CONTROL ALGORITHM [J].

OPFERMAN, DC ;

TSAOWU, NT .

BELL SYSTEM TECHNICAL JOURNAL, 1971, 50 (05) :1579-+

[9] DECOMPOSITION OF PERMUTATION NETWORKS [J].

RAMANUJAM, HR .

[10]

TSAOWU NT, 1975, IEEE T COMMUNICATION, V22, P737