Return to search

The Rearrangeability of Banyan-type Networks

In the thesis, we study the rearrangeability of the Banyan-type
network with crosstalk constraint. Let $x$, $p$ and $c$ be
nonnegative integers with $0leq x,cleq n$ and $n,pgeq 1$.
$B_{n}(x,p,c)$ is the Banyan-type network with, $2^{n+1}$
inputs, $2^{n+1}$ outputs, $x$ extra-stages, and each connection
containing at most $c$ crosstalk switch elements. We give the
necessary and sufficient conditions for rearrangeable
Banyan-type networks $B_{n}(x,p,c)$.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0721105-190844
Date21 July 2005
CreatorsHuang, Yi-Ming
Contributorsnone, S. C. Liaw, D. J. Guan, Li-Da Tong
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721105-190844
Rightswithheld, Copyright information available at source archive

Page generated in 0.0023 seconds