ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada / This paper introduced a fast scanning and waiting acquisition method for a DS/FH receiver used in the telemetry field. Mathematic model of the hybrid DS/FH system’s acquisition process is given and discussed. The average acquisition time expression using this method and generalized average acquisition time formula is derived also. The validity of the proposed algorithm is verified after simulation. In the circumstances of Additive Gauss White Noise for the channel, simulation result at Ec/N0= -15dB shows that the average acquisition time is decreased almost 4 times than that of waiting and searching method.

International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, Nevada / This paper proposes a problem that the error tolerance property of spread spectrum sequence influences the performance of spread spectrum system. Then the relation is analyzed between the error tolerance property and the correlation property of binary sequence when correlation detection is proceeded, and the theoretical limitation of error tolerance is given. Finally, we investigate the relationship between the determination of the output decision threshold of correlation, the probability of correlation peak detection and the error tolerance of the spread spectrum sequence.

International Telemetering Conference Proceedings / October 22-25, 2001 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Based on the fact that two topological conjugacy chaotic maps have identical dynamical behaviors, this paper proposes a method generating spreadspectrum sequences by creating chaotic maps topological conjugacy to Kent- Map, and analyses the correlation properties of the chaotic spread-spectrum sequences. The results of simulation verified the correctness of the theoretical analysis.

by Tsan-Fai Ho. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 64-68). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Review on spread spectrum communications --- p.1 / Chapter 1.2 --- The spread spectrum techniques --- p.2 / Chapter 1.2.1 --- Direct Sequence (DS) Systems --- p.2 / Chapter 1.2.2 --- Frequency Hopping (FH) Systems --- p.2 / Chapter 1.2.3 --- Time Hopping (TH) Systems --- p.4 / Chapter 1.2.4 --- Hybrid Systems --- p.4 / Chapter 1.3 --- Existing Applications of the spread spectrum systems --- p.5 / Chapter 1.4 --- Organization of the thesis --- p.6 / Chapter 2 --- The Concept of Duality --- p.7 / Chapter 2.1 --- Multi-Carrier Systems - An Overview --- p.7 / Chapter 2.2 --- Orthogonal Frequency Division Multiplexing --- p.8 / Chapter 2.2.1 --- Bandwidth Efficiency --- p.9 / Chapter 2.2.2 --- Spectral Efficiency --- p.10 / Chapter 2.2.3 --- Effects of fading --- p.11 / Chapter 2.3 --- Applications of OFDM in multiple access --- p.13 / Chapter 2.3.1 --- ST-CDMA --- p.13 / Chapter 2.3.2 --- MC-DS-CDMA --- p.14 / Chapter 2.3.3 --- OFDM-CDMA --- p.15 / Chapter 2.4 --- Duality - Time-Frequency Interrelation --- p.16 / Chapter 3 --- Performance of Multi-Carrier CDMA System --- p.17 / Chapter 3.1 --- System Model --- p.17 / Chapter 3.2 --- Performance Analysis --- p.20 / Chapter 3.2.1 --- Gaussian Channel --- p.20 / Chapter 3.2.2 --- Fading Channel --- p.24 / Chapter 3.3 --- Performance with Pulse Shape --- p.33 / Chapter 3.4 --- Appendix --- p.34 / Chapter 4 --- Signal Design Criteria for MC-CDMA System --- p.36 / Chapter 4.1 --- Existence of Signal Distortion --- p.37 / Chapter 4.2 --- Measures of the Signal Envelope Fluctuation --- p.38 / Chapter 4.3 --- Complementary Sequences --- p.41 / Chapter 4.4 --- Crest Factors --- p.42 / Chapter 4.4.1 --- Time-limited Pulse --- p.43 / Chapter 4.4.2 --- Ideally Band-Limited Pulses --- p.43 / Chapter 4.4.3 --- Shaped Pulses --- p.45 / Chapter 4.5 --- Spectrally Efficient Complementary (SEC) Sequences --- p.48 / Chapter 4.6 --- Construction of Spectrally Efficient Complementary(SEC) Sequences --- p.50 / Chapter 4.7 --- Generalized Multiphase Spectrally Efficient Complementary Sequences --- p.55 / Chapter 5 --- Summary and Future Extensions --- p.58 / Chapter 5.1 --- Summary of the Results --- p.58 / Chapter 5.2 --- Topics for Future Research --- p.59 / Appendix / Chapter A --- Exhaustive search of MPSEC sequences --- p.61 / Chapter B --- Papers derived from this thesis --- p.63 / Bibliography --- p.64

Li, Kin Fai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 95-99). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction / Motivation --- p.1 / Chapter 2 --- Literature Review --- p.7 / Chapter 2.1 --- Introduction --- p.7 / Chapter 2.2 --- Dynamic Spectrum Access Networks --- p.8 / Chapter 2.3 --- Reliability --- p.10 / Chapter 2.3.1 --- Reliability in Wireless Networks --- p.10 / Chapter 2.3.2 --- Reliability in Wireline Networks --- p.11 / Chapter 2.4 --- Capacity Planning in Wireless Mesh Networks --- p.14 / Chapter 2.4.1 --- Interference Model --- p.14 / Chapter 2.4.2 --- Link Capacity Constraint --- p.15 / Chapter 2.4.3 --- Feasible Path --- p.16 / Chapter 2.4.4 --- Optimal Capacity Allocation in DSA Net- works and Wireless Mesh Networks --- p.16 / Chapter 2.5 --- Chapter Summary --- p.18 / Chapter 3 --- Lifetime Aware Routing without Backup --- p.19 / Chapter 3.1 --- Introduction --- p.19 / Chapter 3.2 --- System Model --- p.20 / Chapter 3.3 --- Lifetime Distribution of a Path without Backup Protection --- p.22 / Chapter 3.3.1 --- Exact Lifetime Distribution --- p.23 / Chapter 3.3.2 --- The Chain Approximation --- p.24 / Chapter 3.4 --- Route Selection without Backup Protection --- p.26 / Chapter 3.4.1 --- NP-Hardness of Finding Maximum Lifetime Path --- p.26 / Chapter 3.4.2 --- The Minimum Weight Algorithm --- p.28 / Chapter 3.4.3 --- Greedy Algorithm --- p.28 / Chapter 3.4.4 --- GACA - The Greedy Algorithm using the Chain Approximation --- p.32 / Chapter 3.5 --- Simulation Results --- p.33 / Chapter 3.5.1 --- Tightness of the Chain Approximation Bound for Vulnerable Area --- p.33 / Chapter 3.5.2 --- Comparison between Greedy and GACA using Guaranteed Lifetime --- p.36 / Chapter 3.5.3 --- Factors impacting the performance of GACA --- p.37 / Chapter 3.6 --- Chapter Summary --- p.43 / Chapter 4 --- Prolonging Path Lifetime with Backup Channel --- p.44 / Chapter 4.1 --- Introduction --- p.44 / Chapter 4.2 --- Non-Shared Backup Protection --- p.45 / Chapter 4.2.1 --- Lifetime of a Path with Non-Shared Backup --- p.45 / Chapter 4.2.2 --- Route Selection for paths with Non-Shared Backup --- p.46 / Chapter 4.3 --- Shared Backup Protection --- p.47 / Chapter 4.3.1 --- Sharing of Backup Capacity --- p.48 / Chapter 4.3.2 --- Lifetime of a Path with Shared Backup --- p.48 / Chapter 4.3.3 --- Route Selection for paths with Shared Backup --- p.50 / Chapter 4.4 --- Simulation Results --- p.50 / Chapter 4.4.1 --- Tightness of Failure Probability Upper Bound for Backup Protection --- p.51 / Chapter 4.4.2 --- Comparison between the Shared Backup and Non Shared Backup schemes --- p.53 / Chapter 4.5 --- Chapter Summary --- p.54 / Chapter 5 --- Finding Capacity-Feasible Routes --- p.55 / Chapter 5.1 --- Introduction --- p.55 / Chapter 5.2 --- Constructing an Edge graph --- p.56 / Chapter 5.3 --- Checking Capacity Feasibility under each Protec- tion Scheme --- p.58 / Chapter 5.3.1 --- No Backup Protection --- p.59 / Chapter 5.3.2 --- Non-Shared Backup Protection --- p.59 / Chapter 5.3.3 --- Shared Backup Protection --- p.60 / Chapter 5.4 --- Chapter Summary --- p.62 / Chapter 6 --- Performance Evaluations and Adaptive Protec- tion --- p.63 / Chapter 6.1 --- Introduction --- p.63 / Chapter 6.2 --- Tradeoffs between Route Selection Algorithms --- p.64 / Chapter 6.3 --- Adaptive Protection --- p.66 / Chapter 6.3.1 --- Route Selection for Adaptive Protection --- p.67 / Chapter 6.3.2 --- Finding a Capacity-Feasible Path for Adaptive Protection --- p.68 / Chapter 6.4 --- Comparison between No Protection and Adaptive Protection --- p.69 / Chapter 6.5 --- Chapter Summary --- p.71 / Chapter 7 --- Restoration Capacity Planning and Channel Assignment --- p.72 / Chapter 7.1 --- Introduction --- p.72 / Chapter 7.2 --- System Model --- p.74 / Chapter 7.2.1 --- Channel Assignment Model --- p.74 / Chapter 7.2.2 --- Presence of Primary Users --- p.75 / Chapter 7.2.3 --- Link Flow Rates --- p.76 / Chapter 7.2.4 --- Problem Formulation --- p.77 / Chapter 7.3 --- Simulation Results --- p.79 / Chapter 7.3.1 --- "Comparison between ""Shared Backup"" and “No Restore Plan"" using Guarantee Percentage and Reduced Capacity" --- p.80 / Chapter 7.3.2 --- Comparison using Traffic Demand Scaling Factor g and Guarantee Fraction p --- p.81 / Chapter 7.3.3 --- Comparison between Optimal Channel Assignment and Random Channel Assignment --- p.84 / Chapter 7.4 --- Chapter Summary --- p.86 / Chapter 8 --- Conclusion and Future Works --- p.87 / Chapter A --- Proof of Theorem (3.1) in Chapter3 --- p.90 / Chapter B --- Proof of Theorem (4.1) in Chapter4 --- p.92 / Bibliography --- p.95

No description available.

Thesis (Ph. D.)--University of Queensland, 2001. / Includes bibliographical references.

No description available.

No description available.

Thesis (Ph.D.)--University of South Australia, 1996.