Joint space-time algebraically-interleaved turbo-like Coded Incoherent MIMO systems with optimal and suboptimal MAP probability decoders

A. Rahimian, F. Mehran, R. Maunder
{"title":"Joint space-time algebraically-interleaved turbo-like Coded Incoherent MIMO systems with optimal and suboptimal MAP probability decoders","authors":"A. Rahimian, F. Mehran, R. Maunder","doi":"10.1109/ICEIEC.2013.6835440","DOIUrl":null,"url":null,"abstract":"The outstanding coding gains and also the practical complexities of the turbo-coded communication systems, heavily depend on the iterative soft-decision decoding algorithm used for the soft-input/-output component decoders. The goal of this paper is to address the investigation on the energy gaps of the enhanced channel coding entity of [1], when original and also approximated logarithmic-based iterative MAP algorithms are employed for the iterative near maximum-likelihood (ML) decoding. As far as the large decoding delays of the turbo and turbo-like code structures constitute a major disadvantage for these types of channel-codes, the previously introduced high-performance channel-codes of [1] are developed for the original and also approximated iterative BCJR-MAP turbo decoders to enable the higher level of selection flexibility in error-rate versus computational complexity tradeoff. We examine the required energy per bit Eb and the noise power spectral density N0 ratio to attain the BER ≈ 10-4 - 10-5 for the differentially encoded phase-shift keying (D-PSK) MIMO Rayleigh fading channels.","PeriodicalId":419767,"journal":{"name":"2013 IEEE 4th International Conference on Electronics Information and Emergency Communication","volume":"50 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 4th International Conference on Electronics Information and Emergency Communication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEIEC.2013.6835440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The outstanding coding gains and also the practical complexities of the turbo-coded communication systems, heavily depend on the iterative soft-decision decoding algorithm used for the soft-input/-output component decoders. The goal of this paper is to address the investigation on the energy gaps of the enhanced channel coding entity of [1], when original and also approximated logarithmic-based iterative MAP algorithms are employed for the iterative near maximum-likelihood (ML) decoding. As far as the large decoding delays of the turbo and turbo-like code structures constitute a major disadvantage for these types of channel-codes, the previously introduced high-performance channel-codes of [1] are developed for the original and also approximated iterative BCJR-MAP turbo decoders to enable the higher level of selection flexibility in error-rate versus computational complexity tradeoff. We examine the required energy per bit Eb and the noise power spectral density N0 ratio to attain the BER ≈ 10-4 - 10-5 for the differentially encoded phase-shift keying (D-PSK) MIMO Rayleigh fading channels.
具有最优和次最优MAP概率解码器的联合空时代数交织类涡轮编码非相干MIMO系统
涡轮编码通信系统的显著编码增益和实际复杂性在很大程度上取决于用于软输入/输出分量解码器的迭代软判决译码算法。本文的目标是研究[1]的增强信道编码实体在使用原始的和近似的基于对数的迭代MAP算法进行迭代近最大似然(ML)解码时的能量间隙问题。由于涡轮和类涡轮码结构的大解码延迟是这些类型的信道码的主要缺点,我们为原始的和近似迭代的bcjb - map涡轮解码器开发了先前介绍的高性能信道码[1],以便在错误率和计算复杂性权衡方面实现更高水平的选择灵活性。我们研究了差分编码相移键控(D-PSK) MIMO瑞利衰落信道达到BER≈10-4 - 10-5所需的每比特能量Eb和噪声功率谱密度N0比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信