A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes

Ying Li, Hongmei Xie, Xudong Guo, Xinmei Wang
{"title":"A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes","authors":"Ying Li, Hongmei Xie, Xudong Guo, Xinmei Wang","doi":"10.1109/AINA.2008.64","DOIUrl":null,"url":null,"abstract":"To reduce the detection complexity of the space-time bit-interleaved coded modulation(ST-BICM) scheme, a turbo type iterative receiver structure consisting of a new group Gaussian approximation(GGA) algorithm and an a posteriori probability(APP) decoder is presented. When calculating the log-likelihood ratio(LLR) of the i-th transmitted symbol, the GGA algorithm first divide the N transmitted signals into two groups, a detecting group consisting of G signals with the i-th transmitted signal included, and an interfering group consisting of the other N-G signals. Taking the superposition of the N-G signals as a Gaussian random variable, the GGA algorithm implements the maximum a posteriori(MAP) detection to obtain the LLR of the signal transmitted from antenna i. At high SNR values or if the receiver has more than two replicas of each transmitted signal, the GGA detection exhibits a good performance as well as low decoding complexity.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2008.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To reduce the detection complexity of the space-time bit-interleaved coded modulation(ST-BICM) scheme, a turbo type iterative receiver structure consisting of a new group Gaussian approximation(GGA) algorithm and an a posteriori probability(APP) decoder is presented. When calculating the log-likelihood ratio(LLR) of the i-th transmitted symbol, the GGA algorithm first divide the N transmitted signals into two groups, a detecting group consisting of G signals with the i-th transmitted signal included, and an interfering group consisting of the other N-G signals. Taking the superposition of the N-G signals as a Gaussian random variable, the GGA algorithm implements the maximum a posteriori(MAP) detection to obtain the LLR of the signal transmitted from antenna i. At high SNR values or if the receiver has more than two replicas of each transmitted signal, the GGA detection exhibits a good performance as well as low decoding complexity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的空时位交织编码调制方案的低复杂度迭代检测方法
为了降低空时位交织编码调制(ST-BICM)方案的检测复杂度,提出了一种由新的群高斯近似(GGA)算法和后验概率(APP)解码器组成的turbo型迭代接收结构。GGA算法在计算第i个发送信号的对数似然比(LLR)时,首先将N个发送信号分为两组,检测组由包含第i个发送信号的G个信号组成,干扰组由其他N-G个信号组成。GGA算法将N-G信号的叠加作为高斯随机变量,实现最大后验(MAP)检测以获得从天线i发射的信号的LLR。在高信噪比值或接收机对每个发射信号有两个以上副本时,GGA检测表现出良好的性能和较低的解码复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
STAMP: Towards A Scalable Topology Announcement and Management Protocol Analysis of Packet Relaying Models and Incentive Strategies in Wireless Ad Hoc Networks with Game Theory Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch Near Optimal Broadcasting in Optimal Triple Loop Graphs
×
引用
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