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)$.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0721105-190844 |
| Date | 21 July 2005 |
| Creators | Huang, Yi-Ming |
| Contributors | none, S. C. Liaw, D. J. Guan, Li-Da Tong |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721105-190844 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0023 seconds