{"title":"球解码与m算法的结合","authors":"Jianping Zheng, B. Bai, Xinmei Wang","doi":"10.1109/ITW2.2006.323782","DOIUrl":null,"url":null,"abstract":"The sequence detection problem for fading channels in multiple-input multiple-output (MIMO) wireless systems is investigated. The sphere decoding (SD) algorithm provides an exact maximum-likelihood (ML) solution, while has expected worst-case complexity which is exponential in the number of symbols jointly detected. On the other hand, the M-algorithm (MA) is a suboptimal solution. Its complexity is linear in the product of the list number and the number of symbols jointly detected. We combined the sphere-constrained search strategy of SD with the M-constrained search principle of the MA. The resulting algorithms can achieve good performance in term of bit error rate (BER) while lower complexity","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"4 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Combining Sphere Decoding with M-Algorithm\",\"authors\":\"Jianping Zheng, B. Bai, Xinmei Wang\",\"doi\":\"10.1109/ITW2.2006.323782\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The sequence detection problem for fading channels in multiple-input multiple-output (MIMO) wireless systems is investigated. The sphere decoding (SD) algorithm provides an exact maximum-likelihood (ML) solution, while has expected worst-case complexity which is exponential in the number of symbols jointly detected. On the other hand, the M-algorithm (MA) is a suboptimal solution. Its complexity is linear in the product of the list number and the number of symbols jointly detected. We combined the sphere-constrained search strategy of SD with the M-constrained search principle of the MA. The resulting algorithms can achieve good performance in term of bit error rate (BER) while lower complexity\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"4 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323782\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The sequence detection problem for fading channels in multiple-input multiple-output (MIMO) wireless systems is investigated. The sphere decoding (SD) algorithm provides an exact maximum-likelihood (ML) solution, while has expected worst-case complexity which is exponential in the number of symbols jointly detected. On the other hand, the M-algorithm (MA) is a suboptimal solution. Its complexity is linear in the product of the list number and the number of symbols jointly detected. We combined the sphere-constrained search strategy of SD with the M-constrained search principle of the MA. The resulting algorithms can achieve good performance in term of bit error rate (BER) while lower complexity
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
