scholarly journals Efficient error correcting scheme for chaos shift keying signals

Author(s):  
Hikmat N. Abdullah ◽  
Thamir R. Saeed ◽  
Asaad H. Sahar

An effective error-correction scheme based on normalized correlation for a non coherent chaos communication system with no redundancy bits is proposed in this paper. A modified logistic map is used in the proposed scheme for generating two sequences, one for every data bit value, in a manner that the initial value of the next chaotic sequence is set by the second value of the present chaotic sequence of the similar symbol. This arrangement, thus, has the creation of successive chaotic sequences with identical chaotic dynamics for error correction purpose. The detection symbol is performed prior to correction, on the basis of the suboptimal receiver which anchors on the computation of the shortest distance existing between the received sequence and the modified logistic map’s chaotic trajectory. The results of the simulation reveal noticeable Eb/No improvement by the proposed scheme over the prior to the error- correcting scheme with the improvement increasing whenever there is increase in the number of sequence N. Prior to the error-correcting scheme when N=8, a gain of 1.3 dB is accomplished in E<sub>b</sub>/N<sub>o</sub> at 10<sup>-3 </sup>bit error probability. On the basis of normalized correlation, the most efficient point in our proposed error correction scheme is the absence of any redundant bits needed with minimum delay procedure, in contrast to earlier method that was based on suboptimal method detection and correction. Such performance would render the scheme good candidate for applications requiring high rates of data transmission.

Author(s):  
Kehui Sun

Chaos is characterized by aperiodic, wideband, random-like, and ergodicity. Chaotic secure communication has become one of the hot topics in nonlinear dynamics since the early 1990s exploiting the technique of chaos synchronization. As distinguished by the type of information being carried, chaos-based communication systems can be categorized into analogy and digital, including four popular techniques such as Chaos Masking, Chaos Shift Keying, Chaos Modulation, and Chaos Spreading Spectrum. In this chapter, the principles of these schemes and their modifications are analyzed by theoretical analysis as well as dynamic simulation. In addition, chaos-based cryptography is a new approach to encrypt information. After analyzing the performances of chaotic sequence and designing an effective chaotic sequence generator, the authors briefly presented the principle of two classes of chaotic encryption schemes, chaotic sequence encryption and chaotic data stream encryption.


2003 ◽  
Vol 13 (05) ◽  
pp. 1329-1335 ◽  
Author(s):  
FRANCIS C. M. LAU ◽  
CHI K. TSE

Recently, an optimal noncoherent detection technique for chaos-shift-keying digital communication system has been proposed. The computational intensity required, however, increases exponentially with the spreading factor. In this Letter, we propose an approximate-optimal detection technique, whose computational effort increases only linearly with the spreading factor. In particular, we use the chaotic sequences generated by a skew tent map as an example to illustrate the approximate-optimal detection method. The bit error performance of the proposed detector is evaluated by computer simulations and the results are compared with those obtained using the optimal detector.


2000 ◽  
Vol 10 (04) ◽  
pp. 719-735 ◽  
Author(s):  
MARTIN HASLER ◽  
THOMAS SCHIMMING

The problem of transmitting digital information using chaotic signals over a channel with Gaussian white noise perturbation is introduced rigorously. It is shown that discrete time base-band chaotic communication systems with discrete time Gaussian white noise in the channel are sufficiently general in this context. The optimal receiver is given explicitly in terms of conditional probabilities. For the example of chaos shift keying using iterations of the tent map, the optimal classifier is constructed explicitly. Finally, it is shown how previously published methods, in particular those based on chaos synchronization, fit into this framework.


2021 ◽  
Vol 1804 (1) ◽  
pp. 012088
Author(s):  
Salsabeel S. Hasan ◽  
Zahir M. Hussain

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Nizar Al Bassam ◽  
Oday Jerew

A new chaotic scheme named Flipped Chaotic On-Off Keying (FCOOK) is proposed for binary transmission. In FCOOK, the low correlation value between the stationary signal and its mirrored version is utilized. Transmitted signal for binary 1 is a chaotic segment added to its time flipped (mirrored) version within one bit duration, while in binary 0, no transmission takes place within the same bit duration. The proposed scheme is compared with the standard chaotic systems: Differential Chaos Shift Keying (DCSK) and Correlation Delay Shift Keying (CDSK). The Bit Error Rate (BER) of FCOOK is studied analytically based on Gaussian approximation method. Results show that the BER performance of FCOOK outperforms DCSK and CDSK in AWGN channel environment and with variousEb/Nolevels. Additionally, FCOOK offers a double bit rate compared with the standard DCSK.


Sign in / Sign up

Export Citation Format

Share Document