Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/57346
Title: | Secure digital communication using chaotic symbolic dynamics | Authors: | Kurian, A.P. Puthusserypady, S. |
Issue Date: | Mar-2006 | Citation: | Kurian, A.P.,Puthusserypady, S. (2006-03). Secure digital communication using chaotic symbolic dynamics. Turkish Journal of Electrical Engineering and Computer Sciences 14 (1) : 195-207. ScholarBank@NUS Repository. | Abstract: | One of the major hurdles in implementing chaotic communication schemes is the synchronization of chaotic systems. For the last two decades, numerous contributions of varying successes have been made by researchers from different disciplines for the synchronization of chaotic systems. Symbolic dynamics based synchronization method is shown to be capable of providing high quality synchronization (HQS), which is essential for reliable communication. In this work, using this method, a secure digital communication system is proposed. The well known piece - wise linear 1 - D map such as tent map and Bernoulli shift map are used for this study. Since the information is dynamically encoded to the system, higher level of encryption can be obtained. Using numerical simulations, the performance of the proposed scheme is compared with that of the binary phase shift keying (BPSK) and chaotic shift keying (CSK) schemes. The theoretical expression for the bit error rate is derived for the new system and it is numerically evaluated for AWGN and frequency selective channels. The Results indicate that the proposed scheme yield similar performances as that of the BPSK system at high signal to noise ratios (SNRs). © TÜBİTAK. | Source Title: | Turkish Journal of Electrical Engineering and Computer Sciences | URI: | http://scholarbank.nus.edu.sg/handle/10635/57346 | ISSN: | 13000632 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.