The Rearrangeability of Banyan-type Networks
碩士 === 國立中山大學 === 應用數學系研究所 === 93 === 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...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/79267403666150043326 |
Summary: | 碩士 === 國立中山大學 === 應用數學系研究所 === 93 === 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)$.
|
---|