No description available.

No description available.

No description available.

International Telemetering Conference Proceedings / October 17-20, 1988 / Riviera Hotel, Las Vegas, Nevada / With more complex vehicle designs, the frequency and number of measurements contained in telemetry data streams has dramatically increased. One way of improving the use of bandwidth is to change the sample rate, quantity, or type of measurements dynamically. A telemetry front end must be programmable to handle different formats. In a front end that decommutates and routes measurements, a decom list is a control program, which defines the location, size, orientation, and identity of the measurements. To deal with dynamic format changes, a telemetry front end must be able to switch between decom lists. A practical approach to decom list switching must address the needs of error avoidance, packet switching, and the location of switching keys in any portion of the format. Switching between formats should not be restricted to a preprogrammed sequence, but should allow multiple destinations from a particular decom list. A practical and flexible implementation of decom list switching is detailed along with an explanation of how this implementation solves a variety of decommutation problems.

published_or_final_version / abstract / Computer Science / Doctoral / Doctor of Philosophy

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

Lam Wan. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (p. 139-145). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

Leung, Yiu-Wing. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references (leaves 150-157). / Acknowledgments / Abstract / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Broadband Video Services --- p.1 / Chapter 1.3 --- Videoconference Services --- p.7 / Chapter 1.4 --- Videoconference Systems --- p.8 / Chapter 1.5 --- Chapter Summary and Thesis Organization --- p.18 / Chapter Chapter 2 --- Efficient Algorithms for Multiple Destinations Routing --- p.20 / Chapter 2.1 --- Background --- p.20 / Chapter 2.2 --- Integer Programming Formulation of the MDR Problem --- p.26 / Chapter 2.3 --- Heuristics for Multiple Destinations Routing --- p.27 / Chapter 2.4 --- Performance Comparisons --- p.40 / Chapter 2.5 --- Chapter Summary --- p.50 / Chapter Chapter 3 --- Connection Optimization for Two Types of Videoconferences --- p.51 / Chapter 3.1 --- Background --- p.51 / Chapter 3.2 --- The Videoconference Services --- p.52 / Chapter 3.3 --- Connection Optimization --- p.54 / Chapter 3.4 --- Performance Analysis --- p.62 / Chapter 3.5 --- Chapter Summary --- p.80 / Chapter Chapter 4 --- A TDM-based Multibus Packet Switch --- p.81 / Chapter 4.1 --- Background --- p.81 / Chapter 4.2 --- Architecture of the Multibus Switch --- p.89 / Chapter 4.3 --- Operation of the Multibus Switch --- p.93 / Chapter 4.4 --- Performance Analysis --- p.95 / Chapter 4.5 --- Numerical Results --- p.106 / Chapter 4.6 --- Discussions --- p.109 / Chapter 4.7 --- Chapter Summary --- p.113 / Chapter Chapter 5 --- A Modular Shared Media Video Switch --- p.114 / Chapter 5.1 --- System Architecture and Operation --- p.114 / Chapter 5.2 --- Slot Assignment for Point-to-Point Transmissions --- p.129 / Chapter 5.3 --- Slot Assignment for Point-to-Multipoint Transmissions --- p.132 / Chapter 5.4 --- Network Design Example --- p.136 / Chapter 5.5 --- Chapter Summary --- p.143 / Appendix --- p.144 / Chapter Chapter 6 --- Conclusions --- p.147 / References --- p.150

by Cheng Sze Wan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 72-[76]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Traffic Scheduling in Input-buffered Switches .。 --- p.3 / Chapter 1.3 --- Organization of Thesis --- p.7 / Chapter 2 --- Principle of Enchanced PIM Algorithm --- p.8 / Chapter 2.1 --- Introduction --- p.8 / Chapter 2.1.1 --- Switch Model --- p.9 / Chapter 2.2 --- Enhanced Parallel Iterative Matching Algorithm (EPIM) --- p.10 / Chapter 2.2.1 --- Motivation --- p.10 / Chapter 2.2.2 --- Algorithm --- p.12 / Chapter 2.3 --- Performance Evaluation --- p.16 / Chapter 2.3.1 --- Simulation --- p.16 / Chapter 2.3.2 --- Delay Analysis --- p.18 / Chapter 3 --- Providing Bandwidth Guarantee in Input-Buffered Switches --- p.25 / Chapter 3.1 --- Introduction --- p.25 / Chapter 3.2 --- Bandwidth Reservation in Static Scheduling Algorithm --- p.26 / Chapter 3.3 --- Incorporation of Dynamic and Static Scheduling Algorithms .。 --- p.32 / Chapter 3.4 --- Simulation --- p.34 / Chapter 3.4.1 --- Switch Model --- p.35 / Chapter 3.4.2 --- Simulation Results --- p.36 / Chapter 3.5 --- Comparison with Existing Schemes --- p.42 / Chapter 3.5.1 --- Statistical Matching --- p.42 / Chapter 3.5.2 --- Weighted Probabilistic Iterative Matching --- p.45 / Chapter 4 --- EPIM and Cross-Path Switch --- p.50 / Chapter 4.1 --- Introduction --- p.50 / Chapter 4.2 --- Concept of Cross-Path Switching --- p.51 / Chapter 4.2.1 --- Principle --- p.51 / Chapter 4.2.2 --- Supporting Performance Guarantee in Cross-Path Switch --- p.52 / Chapter 4.3 --- Implication of EPIM on Cross-Path switch --- p.55 / Chapter 4.3.1 --- Problem Re-definition --- p.55 / Chapter 4.3.2 --- Scheduling in Input Modules with EPIM --- p.58 / Chapter 4.4 --- Simulation --- p.63 / Chapter 5 --- Conclusion --- p.70 / Bibliography --- p.72