MIMO系统统计剪枝Schnorr-Euchner球面解码器

Junil Ahn, Heung-no Lee, Kiseon Kim
{"title":"MIMO系统统计剪枝Schnorr-Euchner球面解码器","authors":"Junil Ahn, Heung-no Lee, Kiseon Kim","doi":"10.1109/ISWCS.2009.5285307","DOIUrl":null,"url":null,"abstract":"A near-maximum-likelihood (ML) detection algorithm for spatially multiplexed multiple-input multiple-output (MIMO) systems has been considered. The sphere decoder (SD) is one of the promising techniques to solve the ML problem. However the SD has a loose necessary condition for pruning branches, and it becomes impractical in large dimensional systems. We propose a Schnorr-Euchner SD with statistical pruning (SP-SESD) in order to further reduce complexity with small performance degradation. Squared statistical constraint radius (SCR) and expected partial path metric from unvisited levels are defined from statistics of noises, and two pruning conditions are jointly applied to search tree for detection efficiency. A flexible trade-off between bit error rate (BER) and complexity can be supported by selecting two pruning probabilities in the proposed scheme, and hence one can design various MIMO detectors according to system demands. Simulation results show the proposed SP-SESD requires lower computational complexity than any statistical pruning approaches, although performance degradation is negligible. The proposed algorithm is effective for MIMO systems with any number of antennas.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Schnorr-Euchner sphere decoder with statistical pruning for MIMO systems\",\"authors\":\"Junil Ahn, Heung-no Lee, Kiseon Kim\",\"doi\":\"10.1109/ISWCS.2009.5285307\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A near-maximum-likelihood (ML) detection algorithm for spatially multiplexed multiple-input multiple-output (MIMO) systems has been considered. The sphere decoder (SD) is one of the promising techniques to solve the ML problem. However the SD has a loose necessary condition for pruning branches, and it becomes impractical in large dimensional systems. We propose a Schnorr-Euchner SD with statistical pruning (SP-SESD) in order to further reduce complexity with small performance degradation. Squared statistical constraint radius (SCR) and expected partial path metric from unvisited levels are defined from statistics of noises, and two pruning conditions are jointly applied to search tree for detection efficiency. A flexible trade-off between bit error rate (BER) and complexity can be supported by selecting two pruning probabilities in the proposed scheme, and hence one can design various MIMO detectors according to system demands. Simulation results show the proposed SP-SESD requires lower computational complexity than any statistical pruning approaches, although performance degradation is negligible. The proposed algorithm is effective for MIMO systems with any number of antennas.\",\"PeriodicalId\":344018,\"journal\":{\"name\":\"2009 6th International Symposium on Wireless Communication Systems\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 6th International Symposium on Wireless Communication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2009.5285307\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 6th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2009.5285307","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

研究了空间复用多输入多输出(MIMO)系统的近最大似然(ML)检测算法。球面解码器(SD)是解决机器学习问题的一种很有前途的技术。然而,该方法对分支剪枝的必要条件不严格,在大维系统中变得不实用。我们提出了一种带有统计剪枝的Schnorr-Euchner SD (SP-SESD),以进一步降低复杂性和较小的性能下降。根据噪声统计定义了未访问层的统计约束半径平方(SCR)和期望部分路径度量,并将两种剪枝条件联合应用于搜索树中以提高检测效率。通过选择两种剪枝概率,可以灵活地权衡误码率和复杂度,因此可以根据系统需求设计各种MIMO检测器。仿真结果表明,尽管性能下降可以忽略不计,但SP-SESD的计算复杂度比任何统计剪枝方法都要低。该算法适用于具有任意天线数量的MIMO系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Schnorr-Euchner sphere decoder with statistical pruning for MIMO systems
A near-maximum-likelihood (ML) detection algorithm for spatially multiplexed multiple-input multiple-output (MIMO) systems has been considered. The sphere decoder (SD) is one of the promising techniques to solve the ML problem. However the SD has a loose necessary condition for pruning branches, and it becomes impractical in large dimensional systems. We propose a Schnorr-Euchner SD with statistical pruning (SP-SESD) in order to further reduce complexity with small performance degradation. Squared statistical constraint radius (SCR) and expected partial path metric from unvisited levels are defined from statistics of noises, and two pruning conditions are jointly applied to search tree for detection efficiency. A flexible trade-off between bit error rate (BER) and complexity can be supported by selecting two pruning probabilities in the proposed scheme, and hence one can design various MIMO detectors according to system demands. Simulation results show the proposed SP-SESD requires lower computational complexity than any statistical pruning approaches, although performance degradation is negligible. The proposed algorithm is effective for MIMO systems with any number of antennas.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信