Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2013.6620548
DC FieldValue
dc.titleOn the dispersions of the discrete memoryless interference channel
dc.contributor.authorLe, S.-Q.
dc.contributor.authorTan, V.Y.F.
dc.contributor.authorMotani, M.
dc.date.accessioned2014-06-19T03:21:18Z
dc.date.available2014-06-19T03:21:18Z
dc.date.issued2013
dc.identifier.citationLe, S.-Q.,Tan, V.Y.F.,Motani, M. (2013). On the dispersions of the discrete memoryless interference channel. IEEE International Symposium on Information Theory - Proceedings : 1859-1863. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ISIT.2013.6620548" target="_blank">https://doi.org/10.1109/ISIT.2013.6620548</a>
dc.identifier.isbn9781479904464
dc.identifier.issn21578095
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/71225
dc.description.abstractIn this work, achievable dispersions for the discrete memoryless interference channel (DM-IC) are derived. In other words, we characterize the backoff from the Han-Kobayashi (HK) achievable region, the largest inner bound known to date for the DM-IC. In addition, we also characterize the backoff from Sato's region in the strictly very strong interference regime, and the backoff from Costa and El Gamal's region in the strong interference regime. To do so, Feinstein's lemma is first generalized to be applicable to the interference channel. Making use of the generalized Feinstein's lemma, it is found that the dispersions for the DM-IC can be represented by the information variances of eight information densities when HK message splitting is involved, and of six information densities for another encoding strategy. We also derive an outer bound that leverages on a known dispersion result for channels with random state by Ingber-Feder. It is shown that for the strictly very strong interference regime, the inner and outer bound have similar algebraic forms. © 2013 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISIT.2013.6620548
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/ISIT.2013.6620548
dc.description.sourcetitleIEEE International Symposium on Information Theory - Proceedings
dc.description.page1859-1863
dc.description.codenPISTF
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.