.png){kind=icon}
.png){kind=icon}
Return
Bandwidth-efficient turbo trellis-coded modulation using punctured component codes
.png){kind=icon}
PRE
AI
DOI：10.1109/49.661109.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
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
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W
Organization
No organization information available