A NEW TIME DOMAIN, MULTISTAGE PERMUTATION ALGORITHM

被引：15

作者：

RAMANAN, SV

JORDAN, HF

SAUER, JR

机构：

[1] Optoelectronic Computing Systems Center, University of Colorado at Boulder, Boulder, CO

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 01期

关键词：

D O I：

10.1109/18.50385

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

It is shown that a frame of N time slots can be arbitrarily permuted with 21og2 N- 1 controlled exchange switches with associated delay elements. This is an improvement over previously known interconnection networks that require 0(N) exchange elements. The proof utilizes the recursive algorithm of Benes and the time interchange properties of a particular configuration of a single exchange element. © 1990 IEEE

引用

页码：171 / 173

页数：3

共 22 条

[1]

ACAMPORA AS, 1987, AT T TECH J NOV, P21

[2]

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

[3] ILLIAC 4 COMPUTER [J].

BARNES, GH ;

BROWN, RM ;

KATO, M ;

KUCK, DJ ;

SLOTNICK, DL ;

STOKES, RA .

IEEE TRANSACTIONS ON COMPUTERS, 1968, C 17 (08) :746-&

[4]

BATCHER KE, 1968 SPRING JOINT CO, V32, P307

[5]

BENES VE, 1965, MATH THEORY CONNECTI

[6] A STUDY OF NON-BLOCKING SWITCHING NETWORKS [J].

CLOS, C .

BELL SYSTEM TECHNICAL JOURNAL, 1953, 32 (02) :406-424

[7]

GAJSKI D, 1983, 1983 P INT C PAR PRO, P524

[8]

GOKE LR, 1973, 1ST P ANN S COMP ARC, P21

[9]

HEURING VP, 1988, 8801A U COL CTR OPT

[10]

JOEL AE, 1968, BELL SYST TECH J, V67, P813

← 1 2 3 →