arrow
Return

Bandwidth-efficient turbo trellis-coded modulation using punctured component codes

delete1998-01-01
delete359
PRE
AI
P
Patrick Robertson *
T
Thomas Wörz
DOI:10.1109/49.661109delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
We present a bandwidth-efficient channel coding scheme that has an overall structure similar to binary turbo codes, but employs trellis-coded modulation (TCM) codes (including multidimensional codes) as component codes. The combination of turbo codes with powerful bandwidth-efficient component codes leads to a straightforward encoder structure, and allows iterative decoding in analogy to the binary turbo decoder. However, certain special conditions may need to be met at the encoder, and the iterative decoder needs to be adapted to the decoding of the component TCM codes, The scheme has been investigated for 8-PSK, 16-QAM, and 64-QAM modulation schemes with varying overall bandwidth efficiencies. A simple code choice based on the minimal distance of the punctured component code has also been performed. The interset distances of the partitioning tree can be used to fis the number of coded and uncoded bits, We derive the symbol-by-symbol MAP component decoder operating in the log domain, and apply methods of reducing decoder complexity, Simulation results are presented and compare the scheme with traditional TCM as well as turbo codes with Gray mapping, The results shown that the novel scheme is very powerful, yet of modest complexity since simple component codes are used.
Keywords:
decoding
iterative methods
trellis-coded modulation

Journal

IEEE Journal on Selected Areas in Communications cover
IEEE Journal on Selected Areas in Communications
IF:
17.2
Papers:
6.4K
Citations:
3.1W

Organization

No organization information available
Cited Papers

Cited Papers

errShare
errSave
Organic physically unclonable function on flexible substrate operable at 2 V for IoT/IoE security applications
err2017-12-01
err0
errOAAI
errKazunori Kuribara; Yohei Hori; Toshihiro Katashita; Kazuaki Kakita; Yasuhiro Tanaka; Manabu Yoshida
errShare
errSave
researcher View more