{"title":"点阵球解码技术辅助分组数据传输系统的最优检测","authors":"M. Albreem, M. Salleh","doi":"10.1109/CyberC.2012.75","DOIUrl":null,"url":null,"abstract":"The complexity of exhaustive search decoding technique grows exponentially with size of transmitted data. This paper proposes lattice sphere decoding technique with optimum performance and lower complexity. A linear system with a relatively small condition number is well-conditioned, so errors are not amplified significantly. In this paper, orthonormal basis of channel matrix has been used, hence the condition number is 1 which is the minimum. The proposed technique achieves significant performance improvement with huge complexity reduction.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Lattice Sphere Decoding Technique Assisted Optimum Detection for Block Data Transmission Systems\",\"authors\":\"M. Albreem, M. Salleh\",\"doi\":\"10.1109/CyberC.2012.75\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The complexity of exhaustive search decoding technique grows exponentially with size of transmitted data. This paper proposes lattice sphere decoding technique with optimum performance and lower complexity. A linear system with a relatively small condition number is well-conditioned, so errors are not amplified significantly. In this paper, orthonormal basis of channel matrix has been used, hence the condition number is 1 which is the minimum. The proposed technique achieves significant performance improvement with huge complexity reduction.\",\"PeriodicalId\":416468,\"journal\":{\"name\":\"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberC.2012.75\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2012.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Lattice Sphere Decoding Technique Assisted Optimum Detection for Block Data Transmission Systems
The complexity of exhaustive search decoding technique grows exponentially with size of transmitted data. This paper proposes lattice sphere decoding technique with optimum performance and lower complexity. A linear system with a relatively small condition number is well-conditioned, so errors are not amplified significantly. In this paper, orthonormal basis of channel matrix has been used, hence the condition number is 1 which is the minimum. The proposed technique achieves significant performance improvement with huge complexity reduction.