Improving the Performance of Chaos-Based Modulations Via Serial Concatenation

被引:13
作者
Escribano, Francisco J. [1 ]
Lopez, Luis [2 ]
Sanjuan, Miguel A. F. [3 ]
机构
[1] Univ Alcala de Henares, Escuela Politecn Super, Dept Teoria Senal & Comunicac, Alcala De Henares 28805, Spain
[2] Univ Rey Juan Carlos, Dept Sistemas Telemat & Computac, Mostoles 28933, Spain
[3] Univ Rey Juan Carlos, Dept Fis, Mostoles 28933, Spain
关键词
Channel coding; chaos; concatenated coding; fading channels; modulation coding; SYMBOLIC DYNAMICS; CODES; COMMUNICATION; SYSTEMS; PARALLEL; DESIGN;
D O I
10.1109/TCSI.2009.2019408
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a serially concatenated system with an outer convolutional channel encoder and an inner chaos-based coded modulator. With the help of the principles of symbolic dynamics, the chaotic modulation can be described in terms of a trellis. Owing to this, we show that the resulting system can be designed and analyzed following developments made for serially concatenated channel codes (SCCCs) or bit-interleaved coded-modulation systems. We show how the iterative decoding algorithm used in this concatenated framework can be analyzed through the well-known extrinsic information transfer chart device and how the bit error rate can be bounded using the transfer function of the convolutional channel encoder. Comparison with a related SCCC system in both additive white Gaussian noise and frequency-nonselective fading channels shows that this kind of chaos-based systems keeps the potential advantages of coded-modulation-based systems. We are thus confident that the principles shown here can lead to the design of competitive chaotic discrete communication systems.
引用
收藏
页码:448 / 459
页数:12
相关论文
共 40 条
[1]   Accumulate-repeat-accumulate codes [J].
Abbasfar, Aliazam ;
Divsalar, Dariush ;
Yao, Kung .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (04) :692-702
[2]  
ANDERSSON H, 1998, THESIS LINKOPING U L
[3]   Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding [J].
Benedetto, S ;
Divsalar, D ;
Montorsi, G ;
Pollara, F .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :909-926
[4]   Fading channels: Information-theoretic and communications aspects [J].
Biglieri, E ;
Proakis, J ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2619-2692
[5]   Bit-interleaved coded modulation [J].
Caire, G ;
Taricco, G ;
Biglieri, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :927-946
[6]   EXIT charts for turbo trellis-coded modulation [J].
Chen, HJ ;
Haimovich, A .
IEEE COMMUNICATIONS LETTERS, 2004, 8 (11) :668-670
[7]   Chaos-based spreading in DS-UWB sensor networks increases available bit rate [J].
Cimatti, Giampaolo ;
Rovatti, Riccardo ;
Setti, Gianluca .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2007, 54 (06) :1327-1339
[8]   Exploiting symbolic dynamics in chaos coded communications with maximum a posteriori algorithm [J].
Escribano, F. J. ;
Lopez, L. ;
Sanjuan, M. A. F. .
ELECTRONICS LETTERS, 2006, 42 (17) :984-986
[9]   Evaluation of channel coding and decoding algorithms using discrete chaotic maps [J].
Escribano, FJ ;
López, L ;
Sanjuán, MAF .
CHAOS, 2006, 16 (01)
[10]  
ESCRIBANO FJ, 2008, P 2 INT SCS C HAMM T, P1