Query：
学者姓名：鲍学文
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
In this paper, the notion of crosstalk-free rearrangeability (CF-rearrangeability) of multistage interconnection networks (MINs) is formally defined. Using the concept of line digraphs from graph theory, we show that the problem of crosstalk-free routing on any bit permutation network (BPN) is always equivalent to the classical permutation routing problem on a BPN of smaller size and with fewer stages. We also show the CF-rearrangeability and minimality (in stage number) of three families of BPNs, including the dilated Benes network. Some necessary conditions for a BPN to be CF-rearrangeable are given, and a brief discussion of CF-rearrangeable networks with dilation in time or space is included.
Keyword ：
bit permutation network bit permutation network crosstalk-free crosstalk-free multistage interconnection network multistage interconnection network rearrangeability rearrangeability
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Bao, Xuewen , Li, Qiao . Crosstalk-free rearrangeable multistage interconnection networks [J]. | TAIWANESE JOURNAL OF MATHEMATICS , 2006 , 10 (5) : 1225-1243 . |
| MLA | Bao, Xuewen 等. "Crosstalk-free rearrangeable multistage interconnection networks" . | TAIWANESE JOURNAL OF MATHEMATICS 10 . 5 (2006) : 1225-1243 . |
| APA | Bao, Xuewen , Li, Qiao . Crosstalk-free rearrangeable multistage interconnection networks . | TAIWANESE JOURNAL OF MATHEMATICS , 2006 , 10 (5) , 1225-1243 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
