A Case Where Interference Does Not Affect the Channel Dispersion

In 1975, Carleial presented a special case of an interference channel, called the very strong interference regime, in which the interference does not reduce the capacity of the constituent point-to-point Gaussian channels. In this paper, we show that in the strictly very strong interference regime, the dispersions are similarly unaffected. More precisely, in this paper, we characterize the second-order coding rates of the Gaussian interference channel in the strictly very strong interference regime. In other words, we characterize the speed of convergence of rates of optimal block codes toward a boundary point of the (rectangular) capacity region. These second-order coding rates are expressed in terms of the average probability of error and variances of appropriately defined information densities which coincide with the dispersion of the (single-user) Gaussian channel. This allows us to conclude that the dispersions are unaffected by interference in this channel model.

[1]  Yuval Kochman,et al.  The dispersion of joint source-channel coding , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Mehul Motani,et al.  On the dispersions of the discrete memoryless interference channel , 2013, 2013 IEEE International Symposium on Information Theory.

[3]  Te Sun Han,et al.  Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources , 2012, 2013 IEEE International Symposium on Information Theory.

[4]  Sergio Verdú,et al.  Fixed-Length Lossy Compression in the Finite Blocklength Regime , 2011, IEEE Transactions on Information Theory.

[5]  Vincent Y. F. Tan,et al.  Second-order asymptotics for the gaussian MAC with degraded message sets , 2013, 2014 IEEE International Symposium on Information Theory.

[6]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[7]  Mehul Motani,et al.  On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.

[8]  Aydano B. Carleial,et al.  A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[9]  Masahito Hayashi,et al.  General formulas for capacity of classical-quantum channels , 2003, IEEE Transactions on Information Theory.

[10]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[11]  Rabi Bhattacharya,et al.  An Exposition of Götze's Estimation of the Rate of Convergence in the Multivariate Central Limit Theorem , 2010 .

[12]  Sergio Verdú,et al.  Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics , 2014, IEEE Transactions on Information Theory.

[13]  Masahito Hayashi,et al.  Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness , 2005, IEEE Transactions on Information Theory.

[14]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[15]  Mérouane Debbah,et al.  A random matrix approach to the finite blocklength regime of MIMO fading channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[16]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[17]  Vincent Yan Fu Tan,et al.  ε-Capacities and Second-Order Coding Rates for Channels with General State , 2013, ArXiv.

[18]  Vincent Yan Fu Tan,et al.  The third-order term in the normal approximation for the AWGN channel , 2014, 2014 IEEE International Symposium on Information Theory.

[19]  Giuseppe Durisi,et al.  Quasi-static SIMO fading channels at finite blocklength , 2013, 2013 IEEE International Symposium on Information Theory.

[20]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[21]  R. Ahlswede.  An elementary proof of the strong converse theorem for the multiple-access channel , 1982 .

[22]  T. MacRobert.  Higher Transcendental Functions , 1955, Nature.

[23]  U. Erez,et al.  A note on the dispersion of network problems , 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel.

[24]  Larry Wasserman,et al.  All of Statistics: A Concise Course in Statistical Inference , 2004 .

[25]  Yuval Kochman,et al.  The Dispersion of Lossy Source Coding , 2011, 2011 Data Compression Conference.

[26]  Ken-ichi Yoshihara,et al.  Simple proofs for the strong converse theorems in some channels , 1964 .

[27]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[28]  F. Götze.  On the Rate of Convergence in the Multivariate CLT , 1991 .

[29]  Vincent Yan Fu Tan,et al.  Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information , 2013, IEEE Transactions on Information Theory.

[30]  Vincent Y. F. Tan,et al.  On the dispersions of three network information theory problems , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[31]  Masahito Hayashi,et al.  Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.

[32]  V. Bentkus.  On the dependence of the Berry–Esseen bound on dimension , 2003 .

[33]  Pierre Moulin,et al.  Finite blocklength coding for multiple access channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[34]  A. V. Prokhorov.  Inequalities for Bessel Functions of a Purely Imaginary Argument , 1968 .

[35]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[36]  J. Nicholas Laneman,et al.  A Finite-Blocklength Perspective on Gaussian Multi-Access Channels , 2013, ArXiv.

[37]  Vincent Yan Fu Tan,et al.  A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels , 2012, IEEE Transactions on Information Theory.

[38]  Vincent Yan Fu Tan,et al.  Second-Order Coding Rates for Channels With State , 2014, IEEE Transactions on Information Theory.

[39]  Mehul Motani,et al.  Second-order asymptotics for the Gaussian interference channel with strictly very strong interference , 2014, 2014 IEEE International Symposium on Information Theory.

[40]  J. Nicholas Laneman,et al.  Simpler achievable rate regions for multiaccess with finite blocklength , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[41]  Albert Guillén i Fàbregas,et al.  Second-order rate region of constant-composition codes for the multiple-access channel , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[42]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[43]  H. Vincent Poor,et al.  Dispersion of the Gilbert-Elliott Channel , 2009, IEEE Transactions on Information Theory.

[44]  Vincent Yan Fu Tan,et al.  A tight upper bound for the third-order asymptotics of discrete memoryless channels , 2013, 2013 IEEE International Symposium on Information Theory.

[45]  Amiel Feinstein,et al.  A new basic theorem of information theory , 1954, Trans. IRE Prof. Group Inf. Theory.

[46]  Sergio Verdú,et al.  Lossy Joint Source-Channel Coding in the Finite Blocklength Regime , 2012, IEEE Transactions on Information Theory.

[47]  Oliver Kosut,et al.  Universal fixed-to-variable source coding in the finite blocklength regime , 2013, 2013 IEEE International Symposium on Information Theory.

[48]  J. Nicholas Laneman,et al.  A Second-Order Achievable Rate Region for Gaussian Multi-Access Channels via a Central Limit Theorem for Functions , 2015, IEEE Transactions on Information Theory.

[49]  Pierluigi Falco,et al.  Critical exponents of the two dimensional Coulomb gas at the Berezinskii-Kosterlitz-Thouless transition , 2013, 1311.2237.

[50]  M. Feder,et al.  Finite blocklength coding for channels with side information at the receiver , 2010, 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel.