{"title":"最坏情况译码复杂度为0 (m2)的黄金码降维","authors":"S. Kahraman, M. Çelebi","doi":"10.1109/ISWCS.2011.6125384","DOIUrl":null,"url":null,"abstract":"In this paper we introduce an efficient decoding method which is based on the dimensionality reduction of the sphere decoder search tree for the golden code. A codeword of the golden code has four independent m-QAM data symbols, hence, the required complexity of the exhaustive-search decoder is m4. An efficient implementation of the maximum-likelihood decoder for the golden code with a worst-case complexity is known to be proportional to m2.5. Our motivation is for an efficient decoder with a worst-case complexity of no more than m2.5. In this purpose, we show that our proposed method has m2 complexity in the worst-case with a loss of only 1 dB with respect to optimal decoding.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Dimensionality reduction for the golden code with worst-case decoding complexity of O(m2)\",\"authors\":\"S. Kahraman, M. Çelebi\",\"doi\":\"10.1109/ISWCS.2011.6125384\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce an efficient decoding method which is based on the dimensionality reduction of the sphere decoder search tree for the golden code. A codeword of the golden code has four independent m-QAM data symbols, hence, the required complexity of the exhaustive-search decoder is m4. An efficient implementation of the maximum-likelihood decoder for the golden code with a worst-case complexity is known to be proportional to m2.5. Our motivation is for an efficient decoder with a worst-case complexity of no more than m2.5. In this purpose, we show that our proposed method has m2 complexity in the worst-case with a loss of only 1 dB with respect to optimal decoding.\",\"PeriodicalId\":414065,\"journal\":{\"name\":\"2011 8th International Symposium on Wireless Communication Systems\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 8th International Symposium on Wireless Communication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2011.6125384\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 8th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2011.6125384","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dimensionality reduction for the golden code with worst-case decoding complexity of O(m2)
In this paper we introduce an efficient decoding method which is based on the dimensionality reduction of the sphere decoder search tree for the golden code. A codeword of the golden code has four independent m-QAM data symbols, hence, the required complexity of the exhaustive-search decoder is m4. An efficient implementation of the maximum-likelihood decoder for the golden code with a worst-case complexity is known to be proportional to m2.5. Our motivation is for an efficient decoder with a worst-case complexity of no more than m2.5. In this purpose, we show that our proposed method has m2 complexity in the worst-case with a loss of only 1 dB with respect to optimal decoding.