Nested turbo codes for the costa problem

Sun, Yong and Uppal, Momin and Liveris, Angelos D. and Cheng, Samuel and Stankovic, Vladimir and Xiong, Zixiang (2008) Nested turbo codes for the costa problem. IEEE Transactions on Communications, 56 (3). pp. 388-399. ISSN 0090-6778 (https://doi.org/10.1109/TCOMM.2008.050101)

[thumbnail of nested_turbo.pdf]
Preview
 PDF. Filename: nested_turbo.pdf
Accepted Author Manuscript
Download (441kB)| Preview

Abstract

Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has lately become a very active research area. In this paper, we first offer code design guidelines in terms of source- channel coding for algebraic binning. We then address practical code design based on nested lattice codes and propose nested turbo codes using turbo-like trellis-coded quantization (TCQ) for source coding and turbo trellis-coded modulation (TTCM) for channel coding. Compared to TCQ, turbo-like TCQ offers structural similarity between the source and channel coding components, leading to more efficient nesting with TTCM and better source coding performance. Due to the difference in effective dimensionality between turbo-like TCQ and TTCM, there is a performance tradeoff between these two components when they are nested together, meaning that the performance of turbo-like TCQ worsens as the TTCM code becomes stronger and vice versa. Optimization of this performance tradeoff leads to our code design that outperforms existing TCQ/TCM and TCQ/TTCM constructions and exhibits a gap of 0.94, 1.42 and 2.65 dB to the Costa capacity at 2.0, 1.0, and 0.5 bits/sample, respectively.

ORCID iDs

Sun, Yong, Uppal, Momin, Liveris, Angelos D., Cheng, Samuel, Stankovic, Vladimir ORCID logoORCID: https://orcid.org/0000-0002-1075-2420 and Xiong, Zixiang;
CORE (COnnecting REpositories)