{"title":"构造πA格的译码算法","authors":"Yu-Chih Huang, K. Narayanan","doi":"10.1109/ICT.2015.7124693","DOIUrl":null,"url":null,"abstract":"This paper revisits the Construction π<sub>A</sub> lattices recently proposed by Huang and Narayanan. This lattice construction is a generalization of the famous Construction A to the multilevel coding setting which preserves most of the structures of Construction A. Decoding algorithms of the Construction π<sub>A</sub> lattices are then studied. Two low complexity decoders are proposed to take advantage of the additional structure of the Construction π<sub>A</sub> lattices.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"48 9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On decoding algorithms for construction πA lattices\",\"authors\":\"Yu-Chih Huang, K. Narayanan\",\"doi\":\"10.1109/ICT.2015.7124693\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper revisits the Construction π<sub>A</sub> lattices recently proposed by Huang and Narayanan. This lattice construction is a generalization of the famous Construction A to the multilevel coding setting which preserves most of the structures of Construction A. Decoding algorithms of the Construction π<sub>A</sub> lattices are then studied. Two low complexity decoders are proposed to take advantage of the additional structure of the Construction π<sub>A</sub> lattices.\",\"PeriodicalId\":375669,\"journal\":{\"name\":\"2015 22nd International Conference on Telecommunications (ICT)\",\"volume\":\"48 9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 22nd International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2015.7124693\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 22nd International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2015.7124693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On decoding algorithms for construction πA lattices
This paper revisits the Construction πA lattices recently proposed by Huang and Narayanan. This lattice construction is a generalization of the famous Construction A to the multilevel coding setting which preserves most of the structures of Construction A. Decoding algorithms of the Construction πA lattices are then studied. Two low complexity decoders are proposed to take advantage of the additional structure of the Construction πA lattices.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
