by Vincent Wing-Shing Tse. / Thesis submitted in: December 1997. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 62-[64]). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Principles of Multirate Circuit Switching in Quantized Clos Network --- p.10 / Chapter 2.1 --- Formulation of Multirate Circuit Switching --- p.11 / Chapter 2.2 --- Call Level Routing in Quantized Clos Network --- p.12 / Chapter 2.3 --- Cell Level Routing in Quantized Clos Network --- p.16 / Chapter 2.3.1 --- Traffic Behavior in ATM Network --- p.17 / Chapter 2.3.2 --- Time Division Multiplexing in Multirate Circuit Switching and Cell-level Switching in ATM Network --- p.19 / Chapter 2.3.3 --- Cell Transmission Scheduling --- p.20 / Chapter 2.3.4 --- Capacity Allocation and Route Assignment at Cell-level --- p.29 / Chapter 3 --- Performance Evaluation of Different Implementation Schemes --- p.31 / Chapter 3.1 --- Global Control and Distributed Switching --- p.32 / Chapter 3.2 --- Implementation Schemes of Quantized Clos Network --- p.33 / Chapter 3.2.1 --- Classification of Switch Modules --- p.33 / Chapter 3.2.2 --- Bufferless Switch Modules Construction Scheme --- p.38 / Chapter 3.2.3 --- Buffered Switch Modules Construction Scheme --- p.42 / Chapter 3.3 --- Complexity Comparison --- p.44 / Chapter 3.4 --- Delay Performance of The Two Implementation Schemes --- p.47 / Chapter 3.4.1 --- Assumption --- p.47 / Chapter 3.4.2 --- Simulation Result --- p.50 / Chapter 4 --- Conclusions --- p.59 / Bibliography --- p.62

Finally, we extend the threshold optimization algorithm to solve a more general N-state distributed estimation problem. We combine multiple observations of a signal process via the maximum function for decision-making and find out that the optimal decision function can be implemented by means of thresholds under suitable technical conditions. We propose here a training sequence based algorithm for threshold adjustment. The algorithm is a variation of the Kiefer-Wolfowitz algorithm with expending truncations and randomized differences. Convergence of this algorithm is also established. / Prior to timing jitter robust receiver design, a measurement campaign was carried out on indoor UWB signal propagation in order to characterize the UWB indoor channel and provide a simulation platform. Channel parameters are analyzed based on measurement data, including path loss, RMS delay spread, amplitude distribution and correlation properties. / Ultra-wideband (UWB) technique has been the subject of extensive research in recent years due to its unique capabilities and potential applications, particularly in short-range multiple access wireless communications. Despite of many advantages over traditional narrow band systems, UWB impulse radio is sensitive to timing jitter effect. In this thesis, we devote to design a high speed UWB receiver which is robust under timing jitter. The basic idea is that the received signal is over-sampled within the sampling window and its maximum value or maximum absolute value is selected as the decision variable and to be compared with a threshold. A main advantage of this scheme is that its performance will not degrade if the timing jitter is shorter than half of the window length. Therefore, the proposed scheme is robust against timing jitter and no precise synchronization between the transmitter and receiver is required. However, how to determine the optimal threshold value is a critical issue for this new scheme. In this thesis, we propose a simple stochastic approximation (SA) approach to adjust the threshold recursively. The approach is based on a version of SA known as the Kiefer-Wolfowitz (KW) algorithm with expanding truncations and randomized differences. Corresponding to two different decision-making structures, two SA algorithms are presented and their convergence properties are analyzed, respectively. The proposed algorithms are effective in threshold optimization and the convergence rate is fast, as demonstrated by the numerical results. / Li Qiang. / "June 2005." / Adviser: Wing Shing Wong. / Source: Dissertation Abstracts International, Volume: 67-01, Section: B, page: 0440. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (p. 133-138). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

by Kin-Yu Cheung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 64-[68]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Multistage Interconnection Architectures --- p.2 / Chapter 1.2 --- Interconnection Topologies --- p.4 / Chapter 1.3 --- Design of Switch Module-An Example of Multichannel Switch --- p.7 / Chapter 1.4 --- Organization --- p.8 / Chapter 1.5 --- Publication --- p.9 / Chapter 2 --- BMSN and SpiderNet: Two Large Scale ATM Switches --- p.13 / Chapter 2.1 --- Introduction --- p.13 / Chapter 2.2 --- Architecture --- p.14 / Chapter 2.2.1 --- Topology --- p.14 / Chapter 2.2.2 --- Switch Modules --- p.15 / Chapter 2.3 --- Routing --- p.17 / Chapter 2.3.1 --- VP/VC Routing --- p.18 / Chapter 2.3.2 --- VP/VC Routing Control --- p.22 / Chapter 2.3.3 --- Cell Routing --- p.23 / Chapter 2.3.4 --- Alternate Path Routing for Fault Tolerance --- p.24 / Chapter 2.4 --- SpiderNet --- p.25 / Chapter 2.5 --- Performance and Discussion --- p.26 / Chapter 2.5.1 --- BMSN vs SpiderNet --- p.26 / Chapter 2.5.2 --- Network Capacity --- p.29 / Chapter 2.6 --- Concluding Remarks --- p.30 / Chapter 3 --- Multichannel ATM Switching --- p.39 / Chapter 3.1 --- Introduction --- p.39 / Chapter 3.2 --- Switch Design --- p.40 / Chapter 3.3 --- Channel Allocation Algorithms --- p.41 / Chapter 3.3.1 --- VC-Based String Round Robin (VCB-SRR) Algorithm --- p.41 / Chapter 3.3.2 --- Implementation of the VCB-SRR Algorithm --- p.43 / Chapter 3.3.3 --- Channel Group Based Round Robin (CGB-RR) Algorithm --- p.50 / Chapter 3.3.4 --- Implementation of the CGB-RR Algorithm --- p.51 / Chapter 3.4 --- Performance and Discussion --- p.53 / Chapter 3.5 --- Concluding Remarks --- p.57 / Chapter 4 --- Conclusion --- p.62 / Bibliography --- p.64

by Wai-Hung Kwok. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Preliminaries - Routing in Classical Circuit Switching Clos Net- work --- p.9 / Chapter 2.1 --- Formulation of route assignment as bipartite multigraph coloring problem --- p.10 / Chapter 2.1.1 --- Definitions --- p.10 / Chapter 2.1.2 --- Problem formulation --- p.11 / Chapter 2.2 --- Edge-coloring of bipartite graph --- p.12 / Chapter 2.3 --- Routing algorithm - Paull's matrix --- p.15 / Chapter 3 --- Principle of Routing Algorithm --- p.18 / Chapter 3.1 --- Definitions --- p.18 / Chapter 3.1.1 --- Bandwidth quantization --- p.18 / Chapter 3.1.2 --- Connection splitting --- p.20 / Chapter 3.2 --- Non-blocking conditions --- p.20 / Chapter 3.2.1 --- Rearrangeably non-blocking condition --- p.21 / Chapter 3.2.2 --- Strictly non-blocking condition --- p.22 / Chapter 3.3 --- Formulation of route assignment as weighted bipartite multigraph coloring problem --- p.23 / Chapter 3.4 --- Edge-coloring of weighted bipartite multigraph with edge splitting --- p.25 / Chapter 3.4.1 --- Procedures --- p.25 / Chapter 3.4.2 --- Example --- p.27 / Chapter 3.4.3 --- Validity of the color rearrangement procedure --- p.29 / Chapter 4 --- Routing Algorithm --- p.32 / Chapter 4.1 --- Capacity allocation matrix --- p.32 / Chapter 4.2 --- Connection setup --- p.34 / Chapter 4.2.1 --- Non-splitting stage --- p.35 / Chapter 4.2.2 --- Splitting stage --- p.36 / Chapter 4.2.3 --- Recursive rearrangement stage --- p.37 / Chapter 4.3 --- Connection release --- p.40 / Chapter 4.4 --- Realization of route assignment in packet level --- p.42 / Chapter 5 --- Performance Studies --- p.45 / Chapter 5.1 --- External blocking probability --- p.45 / Chapter 5.1.1 --- Reduced load approximation --- p.46 / Chapter 5.1.2 --- Comparison of external blocking probabilities --- p.48 / Chapter 5.2 --- Connection splitting probability --- p.50 / Chapter 5.3 --- Recursive rearrangement probability --- p.50 / Chapter 6 --- Conclusions --- p.52

Thesis (M.S.)--Brigham Young University. Dept. of Electrical and Computer Engineering, 2006. / Includes bibliographical references (p. 53-54).

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 72-82). Available also in a digital version from Dissertation Abstracts.

Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 148-159). Available also in a digital version from Dissertation Abstracts.

Includes bibliographical references (p. 124-131).

Thesis (Ph. D.)--University of Washington, 2002. / Vita. Includes bibliographical references (p. 91-100).