Generation of permutations with nearest-neighbour interconnected switches

Proceedings of Third International Conference on Electronics, Circuits, and Systems Pub Date : 1996-10-13 DOI:10.1109/ICECS.1996.582878

J. Giglmayr, Jens Güther

引用次数: 0

Abstract

The generation of arbitrary permutations (/spl equiv/rearrangeable-nonblocking interconnections) by 2-D multistage architectures with nearest-neighbours interconnected switches is analysed. Two different networks are presented and their relationship is shown by means of a transformation.

查看原文本刊更多论文

具有最近邻互连开关的排列生成

分析了具有最近邻互连开关的二维多级结构产生任意排列(/spl等/可重排无阻塞互连)的问题。提出了两种不同的网络，并用变换的方法来表示它们之间的关系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of Third International Conference on Electronics, Circuits, and Systems

自引率

0.00%

发文量