On LDPC codes for Gaussian interference channels

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

doi:10.1109/isit.2014.6875182

Cited by 5 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6], authors have used the Han-Kobayashi's scheme in order to design low-density parity-check (LDPC) codes. The authors have used techniques such as EXIT Charts and were able to achieve very good performance under all interference regimes using joint decoding schemes.…”

Section: Introductionmentioning

confidence: 99%

Achieving the Sum-Rate for Symmetric Gaussian Interference Channels Using LDPC Codes

Channel¹,

Ldpc²,

regions.³

2016

Anais De XXXIV Simpósio Brasileiro De Telecomunicações

View full text Add to dashboard Cite

In this paper, we resort to results presented in the Costa's paper [1], and employ LDPC (low-density parity-check) codes to investigate the achievable sum-rates for the Gaussian Interference Channel (GIC). We assume a symmetric GIC and the same power for both users. A different decoding scheme is employed for each interference region. For the weak interference region, user's interference is treated as noise. For the moderate interference region, we use nonnaive time division multiplexing (TDM) approach. For the strong interference region, joint decoding is employed and finally, for the very strong interference region, the SIC (successive interference cancellation) method is used. Numerical simulations have been performed to show that the gap between the Han and Kobayashi limit and the achievable sum-rate is very small.

show abstract

Section: Introductionmentioning

confidence: 99%

Achieving the Sum-Rate for Symmetric Gaussian Interference Channels Using LDPC Codes

Channel¹,

Ldpc²,

regions.³

2016

Anais De XXXIV Simpósio Brasileiro De Telecomunicações

View full text Add to dashboard Cite

show abstract

“…[10]). We adopt finite constellations for transmission as Gaussian codebooks cannot be used due to practical transmission constraints such as synchronization, encoding, and decoding limitations.…”

Section: Introductionmentioning

confidence: 99%

Implementing the Han–Kobayashi Scheme Using Low Density Parity Check Codes Over Gaussian Interference Channels

Sharifi

Tanc

Duman

2015

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

We focus on Gaussian interference channels (GICs) and study the Han-Kobayashi (HK) coding strategy for the twouser case with the objective of designing implementable (explicit) channel codes. Specifically, low-density parity-check (LDPC) codes are adopted for use over the channel, their benefits are studied and suitable codes are designed. Iterative joint decoding is used at the receivers, where independent and identically distributed (i.i.d.) channel adapters are used to prove that loglikelihood-ratios (LLRs) exchanged among the nodes of the Tanner graph enjoy symmetry when BPSK or QPSK with Gray coding is employed. This property is exploited in the proposed code optimization algorithm adopting a random perturbation technique. Code optimization and convergence threshold computations are carried out for different GICs employing finite constellations by tracking the average mutual information. Furthermore, stability conditions for the admissible degree distributions under strong and weak interference levels are determined. Via examples, it is observed that the optimized codes using BPSK or QPSK with Gray coding operate close to the capacity boundary for strong interference. For the case of weak interference, it is shown that nontrivial rate pairs are achievable via the newly designed codes which are not possible by single user codes with time-sharing. Performance of the designed codes is also studied for finite block lengths through simulations of specific codes picked with the optimized degree distributions with random constructions, where, for one instance, the results are compared with those of some structured designs.

show abstract

Short block length trellis‐based codes for interference channels

et al. 2018

Self Cite

View full text Add to dashboard Cite

In this study, the authors consider Gaussian interference channels and fading interference channels, and design short block length codes based on trellis-based constructions. For both joint maximum likelihood (JML) decoding and single user minimum distance decoding, they obtain error-rate bounds to assess the code performance. Then they employ the obtained bounds for code design and present several design examples. For the case of quasi-static fading, they note that while the simple version of the derived bound is not sufficiently tight for code search purposes, one can obtain a tight performance bound with a higher complexity that can be used for a theoretical performance investigation. For the Gaussian case under JML decoding, they show that the newly designed codes provide significant improvements over point-to-point (P2P) trellis-based codes and off-the-shelf low density parity check codes. They also demonstrate that, for the case of independent and identically distributed fading, the best codes obtained by performing code search are P2P optimal ones, which is also verified by simulation results.

show abstract

On LDPC codes for Gaussian interference channels

Cited by 5 publications

References 13 publications

Achieving the Sum-Rate for Symmetric Gaussian Interference Channels Using LDPC Codes

Achieving the Sum-Rate for Symmetric Gaussian Interference Channels Using LDPC Codes

Implementing the Han–Kobayashi Scheme Using Low Density Parity Check Codes Over Gaussian Interference Channels

Short block length trellis‐based codes for interference channels

Contact Info

Product

Resources

About