Chaotic electronics in telecommunications /
"At the code level, discrete-time chaotic systems can be used to generate spreading codes for DS-SS systems. At the signal level, continuous-time chaotic systems can be used to generate wideband carriers for digital modulation schemes. The potential of chaos engineering is now recognized worldw...
| Corporate Author: | |
|---|---|
| Other Authors: | , , |
| Format: | eBook |
| Language: | English |
| Published: |
Boca Raton :
CRC Press,
©2000.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of Contents:
- Cover; Half Title; Title Page; Contents; 1 Introduction; 1.1 Motivation; 1.2 What is chaos?; 1.3 Outline of the book; I: CHAOS AT CODE LEVEL; 2 Introduction to DS-CDMA; 2.1 Introduction; 2.2 Spread Spectrum Concept; 2.2.1 Frequency Hopping; 2.2.2 Time Hopping; 2.2.3 Direct Sequence; 2.2.4 Final Remarks; 2.3 Spreading Codes and Environments; 2.3.1 Short and Long Sequences; 2.3.2 Chip Waveform; 2.3.3 Near Far Problem, Soft Degradation and Voice Activity Factor; 2.3.4 From SIR to bit error probability: the Standard Gaussian Approximation; 2.4 Synchronization; 2.4.1 Serial Search
- 2.4.2 Parallel Search2.5 Advanced Topics on DS-CDMA; 2.5.1 Serial Canceller; 2.5.2 Parallel Canceller; 3 Chaos-based Asynchronous DS-CDMA systems; 3.1 Introduction; 3.2 Channels and System Model; 3.2.1 Transmission over a selective fading channel; 3.2.2 System with non-Selective Channel; 3.3 Sequences generation with chaotic maps; 3.3.1 The Perron-Frobenius Operator: a tool for studying chaos with densities; 3.3.2 Correlations of quantized chaotic trajectories; 3.3.3 Specialization to Piecewise Affine Markov maps; 3.3.4 The Case of (n, t)-Tailed Shifts; 3.3.5 Application to DS-CDMA systems
- 3.4 Performance over a non-selective channel3.4.1 Numerical results; 3.4.2 Nearly optimal performance over a non-selective channel; 3.5 Performance over a selective fading channel; 3.5.1 Numerical results; 3.6 Conclusion; 4 Information Sources Using Chaotic Dynamics; 4.1 Introduction; 4.2 Information Sources and Markov Chains; 4.2.1 A Model for a Communication System; 4.2.2 Kalman's Markov Map and Markov Information Sources; 4.3 How to Generate Sequences of Random Variables; 4.3.1 Bernoulli Shift and Rademacher Function; 4.3.2 EDP and CSP; 4.3.3 Design of Sequences of p-Ar yRandom Variables
- 4.3.4 Correlational Properties of Sequences of Real-Valued Random Variables4.4 Applications to Communication Systems; 4.4.1 Stream cipher system; 4.4.2 Image Transmission Using SS Techniques; 4.4.3 Interference Properties; 4.5 Concluding Remarks; II: CHAOS AT SIGNAL LEVEL; 5 Overview of Digital Communications; 5.1 Introduction; 5.2 Basic structure of a digital communications system; 5.2.1 Minimum requirements for a channel model; 5.2.2 Performance measures; 5.2.3 Factors affecting the choice of modulation scheme; 5.3 Modulation and demodulation: the basis function approach
- 5.3.1 Orthonormal basis functions5.3.2 Signal set generation; 5.3.3 Recovery of the signal vector by correlation; 5.3.4 Orthonormal basis functions for bandwidth efficiency; 5.4 Detection of a single symbol in noise: basic receiver configurations; 5.4.1 Correlation and matched filter receivers; 5.4.2 Coherent and noncoherent receivers; 5.5 Example: BPSK modulation with coherent detection; 5.6 The role of synchronization in digital communications; 5.6.1 Carrier recovery and timing recovery; 5.6.2 Advantages and disadvantages of synchronization; 5.7 Summary; 6 Chaotic Modulation Schemes