Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
檔案
- 000170030400001.pdf (193.7 KB, Adobe PDF)
日期
2001-08-01
類型
系所
期刊名稱
NETWORKS
卷期與頁次
第 38 卷第 1 期,頁 1–5
DOI
ISSN
0028-3045
語言
英文
摘要
A bit permutation network is an s-stage interconnection network composed of d(n-1) d x d crossbar switches in each stage. This class of networks includes most of the multistage interconnection networks. Recently, Chang et al, [Networks 33 (1999), 261-267] showed that an s-stage d-nary bit permutation network N with d(n) inputs (outputs) can be characterized by an (s - 1)-vector (k(1),..., k(s-1)), where k(1) is an element of {1, ..., n - 1}. In this paper, we give a simple (but not trivial) formula to determine the characteristic vector of a new network G(N)(+), which is, approximately, the line digraph of N. We use this formula to obtain relations between some well-studied bit permutation networks. (C) 2001 John Wiley & Sons, Inc.