{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:18:39Z","timestamp":1760523519288,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T00:00:00Z","timestamp":1497312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"China NSF","award":["61601131","61401177"],"award-info":[{"award-number":["61601131","61401177"]}]},{"name":"Guangdong NSF","award":["2016A030313727","2016A030308008","2014A030310183"],"award-info":[{"award-number":["2016A030313727","2016A030308008","2014A030310183"]}]},{"DOI":"10.13039\/501100012243","name":"Foundation for Distinguished Young Talents in Higher Education of Guangdong","doi-asserted-by":"publisher","award":["2015KQNCX086"],"award-info":[{"award-number":["2015KQNCX086"]}],"id":[{"id":"10.13039\/501100012243","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Project of Guangzhou","award":["201510010193"],"award-info":[{"award-number":["201510010193"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, a general formula for the capacity region of a general interference channel with two pairs of users is derived, which reveals that the capacity region is the union of a family of rectangles. In the region, each rectangle is determined by a pair of spectral inf-mutual information rates. The presented formula provides us with useful insights into the interference channels in spite of the difficulty of computing it. Specially, when the inputs are discrete, ergodic Markov processes and the channel is stationary memoryless, the formula can be evaluated by the BCJR (Bahl-Cocke-Jelinek-Raviv) algorithm. Also the formula suggests that considering the structure of the interference processes contributes to obtaining tighter inner bounds than the simplest one (obtained by treating the interference as noise). This is verified numerically by calculating the mutual information rates for Gaussian interference channels with embedded convolutional codes. Moreover, we present a coding scheme to approach the theoretical achievable rate pairs. Numerical results show that the decoding gains can be achieved by considering the structure of the interference.<\/jats:p>","DOI":"10.3390\/e19060270","type":"journal-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T03:19:32Z","timestamp":1497410372000},"page":"270","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Information-Spectrum Approach to the Capacity Region of the Interference Channel"],"prefix":"10.3390","volume":"19","author":[{"given":"Lei","family":"Lin","sequence":"first","affiliation":[{"name":"School of Mathematics and Systems Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1503-8063","authenticated-orcid":false,"given":"Chulong","family":"Liang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, City University of Hong Kong, Hong Kong 999077, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiujie","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Jinan University, Guangzhou 510632, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[{"name":"State Laboratory of ISN, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,6,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TIT.1978.1055812","article-title":"Interference channels","volume":"24","author":"Carleial","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","first-page":"611","article-title":"Two-way communication channels","volume":"Volume 1","author":"Neyman","year":"1961","journal-title":"Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1214\/aop\/1176996549","article-title":"The capacity region of a channel with two senders and two receivers","volume":"2","author":"Ahlswede","year":"1974","journal-title":"Ann. Probab."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TIT.1975.1055432","article-title":"A case where interference does not reduce capacity","volume":"21","author":"Carleial","year":"1975","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/TIT.1981.1056307","article-title":"A new achievable rate region for the interference channel","volume":"27","author":"Han","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TIT.1982.1056466","article-title":"The capacity region of a class of deterministic interference channels","volume":"28","author":"Costa","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TIT.1987.1057340","article-title":"The capacity region of the discrete memoryless interference channel with strong interference","volume":"33","author":"Costa","year":"1987","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/TIT.2004.825249","article-title":"Outer bounds on the capacity of Gaussian interference channels","volume":"50","author":"Kramer","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/TIT.1977.1055710","article-title":"Two-user communication channels","volume":"23","author":"Sato","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/TIT.1983.1056697","article-title":"Outer bounds on the capacity of interference channels","volume":"29","author":"Carleial","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TIT.1978.1055920","article-title":"On degraded Gaussian two-user channels","volume":"24","author":"Sato","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1109\/TIT.1985.1057085","article-title":"On the Gaussian interference channel","volume":"31","author":"Costa","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","unstructured":"Kramer, G. (2006, January 22\u201324). Review of rate regions for interference channels. Proceedings of the 2006 IEEE International Zurich Seminar on Communications (IZS), Zurich, Switzerland."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3188","DOI":"10.1109\/TIT.2008.924720","article-title":"On the Han-Kobayashi region for the interference channel","volume":"54","author":"Chong","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5534","DOI":"10.1109\/TIT.2008.2006447","article-title":"Gaussian interference channel capacity to within one bit","volume":"54","author":"Etkin","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","unstructured":"Huang, X., Ma, X., Lin, L., and Bai, B. (August, January 31). Accessible Capacity of Secondary Users over the Gaussian Interference Channel. Proceedings of the IEEE International Symposium on Information Theory, St. Petersburg, Russia."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4722","DOI":"10.1109\/TIT.2014.2328584","article-title":"Accessible Capacity of Secondary Users","volume":"60","author":"Huang","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2582","DOI":"10.1109\/TIT.2011.2119230","article-title":"Interference Networks with Point-to-Point Codes","volume":"57","author":"Baccelli","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","unstructured":"Moshksar, K., Ghasemi, A., and Khandani, A.K. (August, January 31). An Alternative To Decoding Interference or Treating Interference As Gaussian Noise. Proceedings of the IEEE International Symposium on Information Theory, St. Petersburg, Russia."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/18.256486","article-title":"Approximation theory of output statistics","volume":"39","author":"Han","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Han, T.S. (2003). Information-Spectrum Methods in Information Theory, Springer.","DOI":"10.1007\/978-3-662-12066-8"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1109\/18.335960","article-title":"A general formula for channel capacity","volume":"40","author":"Han","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2773","DOI":"10.1109\/18.737512","article-title":"An information-spectrum approach to capacity theorems for the general multiple-access channel","volume":"44","author":"Han","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Lin, L., Ma, X., Huang, X., and Bai, B. (2012, January 1\u20136). An information spectrum approach to the capacity region of general interference channel. Proceedings of the IEEE International Symposium on Information Theory, Cambridge, MA, USA.","DOI":"10.1109\/ISIT.2012.6283914"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TIT.2009.2034892","article-title":"Error Exponents of Optimum Decoding for the Interference Channel","volume":"56","author":"Etkin","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","unstructured":"Kav\u010di\u0107, A. (2001, January 25\u201329). On the capacity of Markov sources over noisy channels. Proceedings of the IEEE 2001 Global Telecommunications Conference, San Antonio, TX, USA."},{"key":"ref_27","unstructured":"Arnold, D.M., and Loeliger, H.A. (2001, January 11\u201314). On the information rate of binary-input channels with memory. Proceedings of the IEEE International Conference on Communications, Helsinki, Finland."},{"key":"ref_28","unstructured":"Pfister, H.D., Soriaga, J.B., and Siegel, P.H. (2001, January 25\u201329). On the achievable information rates of finite state ISI channels. Proceedings of the IEEE Global Telecommunications Conference, San Antonio, TX, USA."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","article-title":"Optimal decoding of linear codes for minimizing symbol error rate","volume":"20","author":"Bahl","year":"1974","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_30","unstructured":"Cover, T.M., and Thomas, J.A. (1991). Elements of Information Theory, John Wiley & Sons."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Ma, X., Zhao, S., Zhang, K., and Bai, B. (2011, January 16\u201320). Kite codes over Groups. Proceedings of the IEEE Information Theory Workshop, Paraty, Brazil.","DOI":"10.1109\/ITW.2011.6089507"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhang, K., Ma, X., Zhao, S., Bai, B., and Zhang, X. (2012, January 1\u20136). A New Ensemble of Rate-Compatible LDPC Codes. Proceedings of the IEEE International Symposium on Information Theory, Cambridge, MA, USA.","DOI":"10.1109\/ISIT.2012.6283974"},{"key":"ref_33","first-page":"513","article-title":"Codes and iterative decoding on general graphs","volume":"6","author":"Wiberg","year":"1995","journal-title":"Eur. Trans. Commun."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/18.910572","article-title":"Factor graphs and the sum-product algorithm","volume":"47","author":"Kschischang","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/18.910573","article-title":"Codes on graphs: Normal realizations","volume":"47","author":"Forney","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/TCOMM.2011.092011.110082","article-title":"Low Complexity X-EMS Algorithms for Nonbinary LDPC Codes","volume":"60","author":"Ma","year":"2012","journal-title":"IEEE Trans. Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/6\/270\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:38:57Z","timestamp":1760207937000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/6\/270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,13]]},"references-count":36,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2017,6]]}},"alternative-id":["e19060270"],"URL":"https:\/\/doi.org\/10.3390\/e19060270","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2017,6,13]]}}}