Performance Evaluation of Non-redundant Error Correcting Scheme Using Logistic Chaotic Map

Abstract

In this paper an efficient error-correcting scheme based on logistic chaotic map for non-coherent chaos communication system without redundancy is presented and its performance is evaluated. The scheme uses one chaotic generator to generate two sequences one for each data bit value in a way that the end of the current chaotic sequence sets the initial value of the next sequence of the same symbol. With this arrangement, successive chaotic sequences having the same chaotic dynamics are created for the purpose of error correction. A suboptimal detection algorithm based on shortest distance calculation between the received sequence and the chaotic trajectories over nth-dimension is used for detecting the transmitted symbol and performing the errors-correction. The simulation results show that the scheme offers improvement in Eb/N0 over the method before the error-correcting scheme and this improvement is increased as the trajectory dimension is increased. At bit-error probability of 10?3, a gain of 0.5 dB is obtained in Eb/No over the method before the error-correcting scheme when the dimension is 4. The power point in the scheme is that error correction is based on chaotic dynamics and no redundant bits are needed. This would make the scheme a good candidate for applications that require high data transmission rates.