{"title":"基于短表检测和度量相结合的近容量性能软输出球解码","authors":"Jinhong Wu, B. Vojcic","doi":"10.1109/CISS.2009.5054776","DOIUrl":null,"url":null,"abstract":"We introduce a low complexity iterative soft output sphere decoding algorithm for coded transmissions over multiple antenna channels. Before the iterative detection and decoding starts, a modified hard decision sphere decoder produces a short (base) list of vectors with maximum likelihood metrics. In subsequent iterative soft detections, two competing lists with a small number of vectors are further generated for each coded bit, by utilizing the base list vectors and a priori information from the channel decoder. The corresponding likelihood metrics of the vectors in each competing list are combined to produce soft detection output that approximates the optimal maximum a posteriori (MAP) solution. The performance improves as the base list size increases and a short list (hence a low number of competing vectors) can provide near-capacity performance after a few iterations. Compared with existing methods that adopt the max-log approximation and select only a single best competing vector, the proposed algorithm approaches the optimal performance better with significantly lower complexity requirements.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"2017 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Near-capacity performance soft output sphere decoding based on short list detection and metrics combining\",\"authors\":\"Jinhong Wu, B. Vojcic\",\"doi\":\"10.1109/CISS.2009.5054776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a low complexity iterative soft output sphere decoding algorithm for coded transmissions over multiple antenna channels. Before the iterative detection and decoding starts, a modified hard decision sphere decoder produces a short (base) list of vectors with maximum likelihood metrics. In subsequent iterative soft detections, two competing lists with a small number of vectors are further generated for each coded bit, by utilizing the base list vectors and a priori information from the channel decoder. The corresponding likelihood metrics of the vectors in each competing list are combined to produce soft detection output that approximates the optimal maximum a posteriori (MAP) solution. The performance improves as the base list size increases and a short list (hence a low number of competing vectors) can provide near-capacity performance after a few iterations. Compared with existing methods that adopt the max-log approximation and select only a single best competing vector, the proposed algorithm approaches the optimal performance better with significantly lower complexity requirements.\",\"PeriodicalId\":433796,\"journal\":{\"name\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"volume\":\"2017 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2009.5054776\",\"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 43rd Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2009.5054776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Near-capacity performance soft output sphere decoding based on short list detection and metrics combining
We introduce a low complexity iterative soft output sphere decoding algorithm for coded transmissions over multiple antenna channels. Before the iterative detection and decoding starts, a modified hard decision sphere decoder produces a short (base) list of vectors with maximum likelihood metrics. In subsequent iterative soft detections, two competing lists with a small number of vectors are further generated for each coded bit, by utilizing the base list vectors and a priori information from the channel decoder. The corresponding likelihood metrics of the vectors in each competing list are combined to produce soft detection output that approximates the optimal maximum a posteriori (MAP) solution. The performance improves as the base list size increases and a short list (hence a low number of competing vectors) can provide near-capacity performance after a few iterations. Compared with existing methods that adopt the max-log approximation and select only a single best competing vector, the proposed algorithm approaches the optimal performance better with significantly lower complexity requirements.