Dimensionality reduction for the golden code with worst-case decoding complexity of O(m2)

S. Kahraman, M. Çelebi
{"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}
引用次数: 12

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最坏情况译码复杂度为0 (m2)的黄金码降维
本文介绍了一种基于球解码器搜索树降维的高效黄金码解码方法。黄金码的一个码字有四个独立的m-QAM数据符号,因此,穷举搜索解码器所需的复杂度为m4。已知具有最坏情况复杂度的黄金码的最大似然解码器的有效实现与m2.5成正比。我们的动机是开发一种最坏情况复杂度不超过m2.5的高效解码器。为此,我们证明了我们提出的方法在最坏情况下具有m2复杂度,相对于最佳解码仅损失1 dB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transmit precoding scheme for ICI suppression and path diversity in FS-OFDM A simple analytical model for Robust Header Compression in correlated wireless links CORELA: A cooperative relaying enhanced link adaptation algorithm for IEEE 802.11 WLANs Interference alignment, carrier pairing, and lattice decoding Asymptotic performance of dual-hop non-regenerative cooperative systems with or without direct path
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1