Technical Program

Paper Detail

Paper Title Compress-and-Forward via Multilevel Coding
Paper IdentifierTH2.R5.4
Authors Heping Wan, University of Texas at Dallas, United States; Anders Høst-Madsen, University of Hawaii, United States; Aria Nosratinia, University of Texas at Dallas, United States
Session Caching for Networks
Location Saint Victor, Level 3
Session Time Thursday, 11 July, 11:40 - 13:00
Presentation Time Thursday, 11 July, 12:40 - 13:00
Manuscript  Click here to download the manuscript
Abstract We investigate the performance of discrete (coded) modulations in the full-duplex compress-and-forward relay channel using multilevel coding. We numerically analyze the rates assigned to component binary codes of all levels. LDPC codes are used as the component binary codes to provide error protection. The compression at the relay is done via a scalar quantizer whose output is mapped to a codeword through LDPC codes. A compound Tanner graphical model and information exchange algorithm are described for the joint decoding of both messages sent from the source and relay. Simulation results show that the performance of the proposed system based on multilevel coding is better than that based on BICM, and is separated from the SNR threshold of the known compress-and-forward achievable rate by two factors consisting approximately of the sum of the shaping gain (due to the scalar quantization) and the separation of the LDPC code implementation from AWGN capacity.