TY - GEN
T1 - On LDPC codes for Gaussian interference channels
AU - Sharifi, Shahrouz
AU - Tanc, A. Korhan
AU - Duman, Tolga M.
PY - 2014
Y1 - 2014
N2 - In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is proposed which adopts a random perturbation technique via tracking the average mutual information. The degree distribution optimization and convergence threshold computation are carried out for strong and weak interference channels, employing binary phase-shift keying (BPSK). Under strong interference, it is observed that optimized codes operate close to the capacity boundary. For the case of weak interference, it is shown that via the newly designed codes, a nontrivial rate pair is achievable, which is not attainable by single user codes with time-sharing. Performance of the designed LDPC codes are also studied for finite block lengths through simulations of specific codes picked from the optimized degree distributions.
AB - In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is proposed which adopts a random perturbation technique via tracking the average mutual information. The degree distribution optimization and convergence threshold computation are carried out for strong and weak interference channels, employing binary phase-shift keying (BPSK). Under strong interference, it is observed that optimized codes operate close to the capacity boundary. For the case of weak interference, it is shown that via the newly designed codes, a nontrivial rate pair is achievable, which is not attainable by single user codes with time-sharing. Performance of the designed LDPC codes are also studied for finite block lengths through simulations of specific codes picked from the optimized degree distributions.
UR - http://www.scopus.com/inward/record.url?scp=84906541167&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84906541167&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6875182
DO - 10.1109/ISIT.2014.6875182
M3 - Conference contribution
AN - SCOPUS:84906541167
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1992
EP - 1996
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
Y2 - 29 June 2014 through 4 July 2014
ER -