LDPC code design for binary-input binary-output Z interference channels

Shari, Shahrouz; Tanc, A. Korhan; Duman, Tolga M.

doi:10.1109/isit.2015.7282622

Cited by 2 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 shows the optimized rate pairs achieved for different input distributions. As noticed, there is a significant improvement over the results of the previous work in [35]. This improvement is obtained by increasing the memory of the trellis, using multiple check node degrees for LDPC codes, and removing the inner trellis based code for the cases of uniform input distribution.…”

Section: A Example 1: One-sided or Interferencementioning

confidence: 73%

Code Design for Discrete Memoryless Interference Channels

Dabirnia

Tanc

Sharifi

et al. 2018

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

We study the design of explicit and implementable codes for the two-user discrete memoryless interference channels (DMICs). We consider Han-Kobayashi (HK) type encoding where both public and private messages are used and propose coding techniques utilizing a serial concatenation of a nonlinear trellis code (NLTC) with an outer low-density paritycheck (LDPC) code. Since exact analytical treatment of the BCJR decoder for the inner trellis-based code appears infeasible, we analytically investigate the iterative decoding process in the asymptotic regime where the probability of decoding error tends to zero. Based on this approximate analysis, we derive a stability condition for this type of a concatenated coding scheme for the first time in the literature. Furthermore, we use an extrinsic information transfer analysis to design the outer LDPC code while fixing the inner NLTC, and utilize the derived stability condition to accelerate the design process and to avoid code ensembles that potentially produce high error floors. Via numerical examples, we demonstrate that our designed codes achieve rate pairs close the optimal boundary of the HK subregion, which cannot be obtained without the use of nonlinear codes. Also, we verify that the estimated thresholds of the designed codes via finite block length simulations and show that our designs significantly outperform the point-to-point optimal codes, hence demonstrating the need for designs specifically tailored for DMICs. Index Terms-Discrete memoryless interference channels, nonlinear trellis codes, low-density parity-check codes, concatenated codes, stability condition. I. INTRODUCTION A N interference channel (IC) is a communication medium shared by several sender-receiver pairs. Transmission of Manuscript

show abstract

Section: A Example 1: One-sided or Interferencementioning

confidence: 73%

Code Design for Discrete Memoryless Interference Channels

Dabirnia

Tanc

Sharifi

et al. 2018

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

Polar Coding Strategies for the Interference Channel With Partial-Joint Decoding

Zheng

Ling

Chen

et al. 2019

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Existing polar coding schemes for the two-user interference channel follow the original idea of Han and Kobayashi, in which component messages are encoded independently and then mapped by some deterministic functions (i.e., homogeneous superposition coding). In this paper, we propose a new polar coding scheme for the interference channel based on the heterogeneous superposition coding approach of Chong, Motani and Garg. We prove that fully-joint decoding (the receivers simultaneously decode both senders' common messages and the intended sender's private message) in the Han-Kobayashi strategy can be simplified to two types of partially-joint decoding, which are friendly to polar coding with practical decoding algorithms. The proposed coding scheme requires less auxiliary random variables and no deterministic functions, and can be efficiently constructed. Further, we extend this result to interference networks and show that the proposed partially-joint decoding scheme is a general method for designing heterogeneous superposition polar coding schemes in interference networks.

show abstract

LDPC code design for binary-input binary-output Z interference channels

Cited by 2 publications

References 22 publications

Code Design for Discrete Memoryless Interference Channels

Code Design for Discrete Memoryless Interference Channels

Polar Coding Strategies for the Interference Channel With Partial-Joint Decoding

Contact Info

Product

Resources

About