{"title":"On dispersion of modulo lattice additive noise channels","authors":"Jinjing Jiang, Tie Liu","doi":"10.1109/ISWCS.2011.6125346","DOIUrl":null,"url":null,"abstract":"Modulo lattice additive noise (MLAN) channels appear in the analysis of structured lattice codes with lattice decoding for Costa's dirty-paper channel and the additive white Gaussian noise (AWGN) channel. Building on the recent result on the optimal density of an infinite constellation over an AWGN channel, in this paper, it is shown that with a proper choice of the shaping lattice and the scaling parameter, the dispersion of the MLAN channel is asymptotically the same as that of the (zero-interference) AWGN channel at the same signal-to-noise ratio.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 8th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2011.6125346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Modulo lattice additive noise (MLAN) channels appear in the analysis of structured lattice codes with lattice decoding for Costa's dirty-paper channel and the additive white Gaussian noise (AWGN) channel. Building on the recent result on the optimal density of an infinite constellation over an AWGN channel, in this paper, it is shown that with a proper choice of the shaping lattice and the scaling parameter, the dispersion of the MLAN channel is asymptotically the same as that of the (zero-interference) AWGN channel at the same signal-to-noise ratio.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
