Abstract
Coherent systems such as the chaos-shift-keying (CSK) system studied in the previous chapter are theoretically better than their non-coherent counterparts in terms of performance in additive white Gaussian noise (AWGN) channels. However, as practical techniques for robust chaos synchronization are not yet available for the required signal-to-noise conditions, the requirement of the receivers to reproduce replicas of chaotic carriers remains a major technical barrier to the practical implementation of coherent systems. Without the need for chaos synchronization, non-coherent systems therefore represent more practical forms of systems, despite their less favorable performance. In this chapter we focus on non-coherent chaos-based communication systems. In general, non-coherent detection can take a variety of forms, but its basic principle is to make use of some distinguishable properties of the transmitted signals, which can be some generic deterministic properties (e.g., return-map based detection [Tse et al. (2001)] and maximum-likelihood method [Kisel et al. (2001)]), or fabricated by a suitable bit arrangement (e.g., differential CSK (DCSK) [Kolumbán et al. (1996)]). In particular, we investigate in depth in this chapter, using the discrete-time baseband model described in Sect. 2.6, the DCSK system under single-user and multi-user environments. Broadly we may classify the implementation of multiple access into two types, namely, time-delay-based [Kolumbán et al. (1997c); Kennedy et al. (1998)] and permutation-based [Lau et al. (2002a)] implementations. In this chapter we present the analysis and performance evaluation of these two types of multiple access as applied to DCSK systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Note that the frame configuration described here is a particular example from a multitude of possible configurations. For a given number of users, the frame configuration can be optimized so as to minimize the size of buffers required in the transmitters and receivers.
System performance can be simulated using the empirical system model without making simplifying assumptions of the chaotic maps or the forms of the various mean, variance and co-variance terms. Simulations performed in this way can be considered as “brute-force” simulations, and they provide true system performance for comparison and verification purposes. See also p. 52.
The permutation matrix is defined as a square matrix whose elements are either “0” or “1”, with each row and column containing exactly one “1” [Stewart (1998)].
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lau, F.C.M., Tse, C.K. (2003). Performance Analysis Methods for Non-Coherent Differential Chaos-Shift-Keying Systems. In: Chaos-Based Digital Communication Systems. Signals and Communication Technology. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05183-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-05183-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05616-1
Online ISBN: 978-3-662-05183-2
eBook Packages: Springer Book Archive