Implementing the Han-Kobayashi scheme using low density parity check codes over Gaussian interference channels

Simple item page
dc.citation.epage350en_US
dc.citation.issueNumber2en_US
dc.citation.spage337en_US
dc.citation.volumeNumber63en_US
dc.contributor.authorSharifi S.en_US
dc.contributor.authorTanc, A. K.en_US
dc.contributor.authorDuman, T. M.en_US
dc.date.accessioned2016-02-08T10:01:57Z
dc.date.available2016-02-08T10:01:57Z
dc.date.issued2015en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractWe focus on Gaussian interference channels (GICs) and study the Han-Kobayashi coding strategy for the two-user case with the objective of designing implementable (explicit) channel codes. Specifically, low-density parity-check 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 channel adapters are used to prove that log-likelihood-ratios 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. © 1972-2012 IEEE.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:01:57Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2015en
dc.identifier.doi10.1109/TCOMM.2014.2385856en_US
dc.identifier.issn0090-6778
dc.identifier.urihttp://hdl.handle.net/11693/22580
dc.language.isoEnglishen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TCOMM.2014.2385856en_US
dc.source.titleIEEE Transactions on Communicationsen_US
dc.subjectCode designen_US
dc.subjectGaussian interference channelsen_US
dc.subjectIterative joint decodingen_US
dc.subjectLow - density parity - check codesen_US
dc.subjectAlgorithmsen_US
dc.subjectData communication systemsen_US
dc.subjectDecodingen_US
dc.subjectGaussian distributionen_US
dc.subjectIterative decodingen_US
dc.subjectIterative methodsen_US
dc.subjectOptimizationen_US
dc.subjectPerturbation techniquesen_US
dc.subjectRandom processesen_US
dc.subjectSatellite communication systemsen_US
dc.subjectSignal encodingen_US
dc.subjectSignal interferenceen_US
dc.subjectTurbo codesen_US
dc.subjectCode designsen_US
dc.subjectGaussian interference channelsen_US
dc.subjectHan - Kobayashi codingen_US
dc.subjectLow - density parity-check (LDPC) codesen_US
dc.subjectCodes (symbols)en_US
dc.titleImplementing the Han-Kobayashi scheme using low density parity check codes over Gaussian interference channelsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Implementing the han-kobayashi scheme using low density parity check codes over gaussian interference channels.pdf
Size:
1.28 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering