{"title":"低密度点阵码","authors":"N. Sommer, M. Feder, O. Shalvi","doi":"10.1109/ISIT.2006.261680","DOIUrl":null,"url":null,"abstract":"Low density lattice codes (LDLC) are novel lattice codes that can approach the capacity of the additive white Gaussian noise (AWGN) channel and be decoded efficiently. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. The fact that H is sparse is utilized to develop a linear-time iterative decoding scheme which attains, as demonstrated by simulations, good error performance within ~ 0.5 dB from capacity at block length of n = 100,000 symbols. The paper also discusses convergence results and implementation considerations","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":"70 1","pages":"88-92"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"187","resultStr":"{\"title\":\"Low Density Lattice Codes\",\"authors\":\"N. Sommer, M. Feder, O. Shalvi\",\"doi\":\"10.1109/ISIT.2006.261680\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Low density lattice codes (LDLC) are novel lattice codes that can approach the capacity of the additive white Gaussian noise (AWGN) channel and be decoded efficiently. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. The fact that H is sparse is utilized to develop a linear-time iterative decoding scheme which attains, as demonstrated by simulations, good error performance within ~ 0.5 dB from capacity at block length of n = 100,000 symbols. The paper also discusses convergence results and implementation considerations\",\"PeriodicalId\":92224,\"journal\":{\"name\":\"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications\",\"volume\":\"70 1\",\"pages\":\"88-92\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"187\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261680\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261680","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 187
摘要
低密度点阵码(LDLC)是一种接近加性高斯白噪声(AWGN)信道容量并能有效解码的新型点阵码。在LDLC中,码字x直接在n维欧氏空间上作为对应的整数消息向量b的线性变换生成,即x = Gb,其中H = G -1被限制为稀疏。利用H是稀疏的这一事实,开发了一种线性时间迭代解码方案,如仿真所示,在块长度为n = 100,000个符号的容量下,该方案在~ 0.5 dB内具有良好的误差性能。本文还讨论了收敛结果和实现注意事项
Low density lattice codes (LDLC) are novel lattice codes that can approach the capacity of the additive white Gaussian noise (AWGN) channel and be decoded efficiently. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. The fact that H is sparse is utilized to develop a linear-time iterative decoding scheme which attains, as demonstrated by simulations, good error performance within ~ 0.5 dB from capacity at block length of n = 100,000 symbols. The paper also discusses convergence results and implementation considerations