Code design for discrete memoryless interference channels
buir.contributor.author | Dabirnia, Mehdi | |
buir.contributor.author | Duman, Tolga M. | |
dc.citation.epage | 3380 | en_US |
dc.citation.issueNumber | 8 | en_US |
dc.citation.spage | 3368 | en_US |
dc.citation.volumeNumber | 66 | en_US |
dc.contributor.author | Dabirnia, Mehdi | en_US |
dc.contributor.author | Tanc, A. K. | en_US |
dc.contributor.author | Sharifi S. | en_US |
dc.contributor.author | Duman, Tolga M. | en_US |
dc.date.accessioned | 2019-02-21T16:05:27Z | en_US |
dc.date.available | 2019-02-21T16:05:27Z | en_US |
dc.date.issued | 2018 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description.abstract | 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 parity-check (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. | en_US |
dc.description.sponsorship | Manuscript received September 6, 2017; revised February 8, 2018; accepted March 6, 2018. Date of publication March 19, 2018; date of current version August 14, 2018. This work was supported in part by the Turkish Scientific and Technological Research Council of Turkey under Grant 114E601, in part by the National Science Foundation under Grant NSF-CCF 1117174, and in part by the European Commission under Grant MC-CIG PCIG12-GA-2012-334213. An early version of this work was presented at the IEEE International Symposium on Information Theory, Hong Kong, June 2015. Part of this paper is based on the Ph.D. thesis of M. Dabirnia completed at Bilkent University [1]. The associate editor coordinating the review of this paper and approving it for publication was R. Thobaben. (Corresponding author: Tolga M. Duman.) M. Dabirnia was with the Department of Electrical and Electronics Engineering, Bilkent University, 06800 Ankara, Turkey. He is now with the Department of Information and Communication Technologies, Universitat Pompeu Fabra, 08018 Barcelona, Spain (e-mail: mehdi.dabirnia@upf.edu). | en_US |
dc.identifier.doi | 10.1109/TCOMM.2018.2817233 | en_US |
dc.identifier.eissn | 1558-0857 | en_US |
dc.identifier.issn | 0090-6778 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/50253 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.relation.isversionof | https://doi.org/10.1109/TCOMM.2018.2817233 | en_US |
dc.relation.project | Bilkent Üniversitesi - National Science Foundation, NSF: NSF-CCF 1117174 - IEEE Foundation, IEEE - European Commission, EC: MC-CIG PCIG12-GA-2012-334213 - 114E601 | en_US |
dc.source.title | IEEE Transactions on Communications | en_US |
dc.subject | Concatenated codes | en_US |
dc.subject | Discrete memoryless interference channels | en_US |
dc.subject | Low-density parity-check codes | en_US |
dc.subject | Nonlinear trellis codes | en_US |
dc.subject | Stability condition | en_US |
dc.title | Code design for discrete memoryless interference channels | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Code_Design_for_Discrete_Memoryless_Interference_Channels.pdf
- Size:
- 2.25 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version