点阵球解码技术辅助分组数据传输系统的最优检测

M. Albreem, M. Salleh
{"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}
引用次数: 3

摘要

穷举搜索解码技术的复杂度随着传输数据量的增加呈指数级增长。本文提出了性能最优、复杂度较低的点阵球译码技术。条件数相对较小的线性系统是条件良好的,因此误差不会显著放大。本文采用信道矩阵的标准正交基,因此条件数为最小值1。该技术在极大降低复杂度的同时,实现了显著的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信