Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation

被引:56
|
作者
Fragouli, C [1 ]
Wesel, RD [1 ]
机构
[1] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90095 USA
基金
美国国家科学基金会;
关键词
concatenated coding; convolutional codes; interleaved coding; trellis-coded modulation; turbo codes;
D O I
10.1109/26.911450
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. The constituent encoders are optimized for symbol-wise effective free distance, and each has an infinite symbol-wise impulse response. We identify the canonical structures for the constituent encoder search space. In many cases of practical interest, the optimal structure for these constituent encoders connects the memory elements in a single row. This single row generally applies to turbo-code constituent encoders for parallel concatenation and is not restricted to symbol interleaving. To lower the error floor, a new semi-random interleaver design criteria and a construction method extends the spread-interleaver concept introduced by Divsalar and Pollara. Simulation results show that the proposed system employing symbol interleaving can converge at a lower signal-to-noise ratio than previously reported systems. We report simulation results between 0.5 and 0.6 dB from constrained capacity for rates of 2 and 4 bits/s/Hz.
引用
收藏
页码:425 / 435
页数:11
相关论文
共 50 条
  • [21] Constellation Shaping Using Turbo Trellis-Coded Modulation
    Bassou, Abdesselam
    Djebbari, Ali
    Benaissa, Mohamed
    2012 6TH INTERNATIONAL CONFERENCE ON SCIENCES OF ELECTRONICS, TECHNOLOGIES OF INFORMATION AND TELECOMMUNICATIONS (SETIT), 2012, : 263 - 268
  • [22] Triple Parallel Concatenated Trellis Coded Modulation
    Matsumine, Toshiki
    Ochiai, Hideki
    2017 IEEE 28TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2017,
  • [23] Performance evaluation method of bit-interleaved turbo trellis-coded modulation and its optimization
    Fajar, Novianto
    Ogiwara, Haruo
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2004, E87-A (06) : 1583 - 1590
  • [24] Performance evaluation method of bit-interleaved turbo trellis-coded modulation and its optimization
    Fajar, N
    Ogiwara, H
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (06): : 1583 - 1590
  • [25] Performance bounds for serially-concatenated trellis-coded modulation
    Ho, M
    THIRTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 1998, : 1364 - 1368
  • [26] Iterative decoding of serially concatenated punctured trellis-coded modulation
    Ogiwara, H
    Bajo, VB
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999, E82A (10) : 2089 - 2095
  • [27] Combination of turbo equalisation and Turbo Trellis-coded modulation with low complexity
    Yang, P.
    Ge, J.-H.
    IET COMMUNICATIONS, 2007, 1 (04) : 772 - 775
  • [28] Improved Frey Chaotic Digital Encoder for Trellis-Coded Modulation
    Vladeanu, Calin
    El Assad, Safwan
    Carlach, Jean-Claude
    Quere, Raymond
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2009, 56 (06) : 509 - 513
  • [29] VLSI-implementation issues of Turbo Trellis-coded Modulation
    Kienle, F
    Kreiselmaier, G
    Wehn, N
    2003 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL II, PROCEEDINGS: SPEECH II; INDUSTRY TECHNOLOGY TRACKS; DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS; NEURAL NETWORKS FOR SIGNAL PROCESSING, 2003, : 633 - 636
  • [30] Turbo Trellis-Coded Modulation with time varying mixed mapping
    Onggosanusi, EN
    Gatherer, A
    Dabak, AG
    IEEE 54TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2001, VOLS 1-4, PROCEEDINGS, 2001, : 2409 - 2413