{"title":"球面解码器在迭代空间复用MIMO接收机中的性能","authors":"Ming Zhao, Zhenning Shi, Mark C. Reed","doi":"10.1109/TURBOCODING.2008.4658682","DOIUrl":null,"url":null,"abstract":"Pohst and Schnorr-Euchner (SE) are two popular sphere decoders (SD) to perform near maximum likelihood (ML) detection in Spatial Multiplexing multiple-input-multiple-output (MIMO) system. Recent work [1] showed Pohst and SE are two variants of the well known stack sequential decoding and proposed modification to each strategy to shown significant complexity reduction but with near ML performance. This paper proposed modified Pohst and SE algorithms by taking into account the a priori information to estimate the maximum a posteriori (MAP) probability of the received symbol sequence. Simulation results show that significant performance gain can be achieved from iterative MAP approach and complexity reduction can be obtained for SE enumeration strategy with minor performance loss compared to Phost enumeration algorithm.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The performance of sphere decoders for iterative Spatial Multiplexing MIMO receiver\",\"authors\":\"Ming Zhao, Zhenning Shi, Mark C. Reed\",\"doi\":\"10.1109/TURBOCODING.2008.4658682\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pohst and Schnorr-Euchner (SE) are two popular sphere decoders (SD) to perform near maximum likelihood (ML) detection in Spatial Multiplexing multiple-input-multiple-output (MIMO) system. Recent work [1] showed Pohst and SE are two variants of the well known stack sequential decoding and proposed modification to each strategy to shown significant complexity reduction but with near ML performance. This paper proposed modified Pohst and SE algorithms by taking into account the a priori information to estimate the maximum a posteriori (MAP) probability of the received symbol sequence. Simulation results show that significant performance gain can be achieved from iterative MAP approach and complexity reduction can be obtained for SE enumeration strategy with minor performance loss compared to Phost enumeration algorithm.\",\"PeriodicalId\":284046,\"journal\":{\"name\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TURBOCODING.2008.4658682\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 5th International Symposium on Turbo Codes and Related Topics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TURBOCODING.2008.4658682","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The performance of sphere decoders for iterative Spatial Multiplexing MIMO receiver
Pohst and Schnorr-Euchner (SE) are two popular sphere decoders (SD) to perform near maximum likelihood (ML) detection in Spatial Multiplexing multiple-input-multiple-output (MIMO) system. Recent work [1] showed Pohst and SE are two variants of the well known stack sequential decoding and proposed modification to each strategy to shown significant complexity reduction but with near ML performance. This paper proposed modified Pohst and SE algorithms by taking into account the a priori information to estimate the maximum a posteriori (MAP) probability of the received symbol sequence. Simulation results show that significant performance gain can be achieved from iterative MAP approach and complexity reduction can be obtained for SE enumeration strategy with minor performance loss compared to Phost enumeration algorithm.