Mutual information based rate adaptation for MIMO-OFDM systems with finite signal alphabets

C. Bockelmann, D. Wübben, K. Kammeyer
{"title":"Mutual information based rate adaptation for MIMO-OFDM systems with finite signal alphabets","authors":"C. Bockelmann, D. Wübben, K. Kammeyer","doi":"10.1109/WSA.2008.4475538","DOIUrl":null,"url":null,"abstract":"We consider a single user MIMO-OFDM system where spatial multiplexing is applied and formulate rate allocation algorithms to adapt the used modulation alphabet on a per subcarrier basis. As a means to consider the system behavior including the channel code regarding bit or frame error rate (BER, FER) versus normalized average mutual information (NAMI) of an OFDM symbol for several M-QAM alphabets is investigated. To this end an approximation to the mutual information of MIMO systems with M-QAM signal alphabets is derived and compared to channel decomposition approaches to find a complexity/accuracy trade-off. Based on the mutual information results two algorithms using this channel knowledge are introduced. On the one hand, the error rates can be optimized assuming a fixed rate requirement and on the other hand the achieved transmission rate can be optimized under a BER/FER constraint. In both cases a NAMI threshold derived from the simulated system behavior for a specific channel code is used to adapt the allocated modulation alphabets via a greedy algorithm to achieve the target NAMI within an error margin.","PeriodicalId":255495,"journal":{"name":"2008 International ITG Workshop on Smart Antennas","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International ITG Workshop on Smart Antennas","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSA.2008.4475538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

We consider a single user MIMO-OFDM system where spatial multiplexing is applied and formulate rate allocation algorithms to adapt the used modulation alphabet on a per subcarrier basis. As a means to consider the system behavior including the channel code regarding bit or frame error rate (BER, FER) versus normalized average mutual information (NAMI) of an OFDM symbol for several M-QAM alphabets is investigated. To this end an approximation to the mutual information of MIMO systems with M-QAM signal alphabets is derived and compared to channel decomposition approaches to find a complexity/accuracy trade-off. Based on the mutual information results two algorithms using this channel knowledge are introduced. On the one hand, the error rates can be optimized assuming a fixed rate requirement and on the other hand the achieved transmission rate can be optimized under a BER/FER constraint. In both cases a NAMI threshold derived from the simulated system behavior for a specific channel code is used to adapt the allocated modulation alphabets via a greedy algorithm to achieve the target NAMI within an error margin.
基于互信息的有限字母MIMO-OFDM系统速率自适应
我们考虑了一个单用户MIMO-OFDM系统,其中应用了空间复用,并制定了速率分配算法,以适应每个子载波基础上使用的调制字母表。作为考虑系统行为的一种手段,包括信道码的比特或帧误码率(BER, FER)与若干M-QAM字母的OFDM符号的归一化平均互信息(NAMI)。为此,导出了具有M-QAM信号字母表的MIMO系统互信息的近似,并与信道分解方法进行了比较,以找到复杂性/精度的权衡。在互信息结果的基础上,介绍了利用该信道知识的两种算法。一方面可以在固定速率要求下优化误码率,另一方面可以在BER/FER约束下优化实现的传输速率。在这两种情况下,NAMI阈值都是从模拟的系统行为中获得的,用于特定信道代码,通过贪婪算法调整分配的调制字母,以在误差范围内实现目标NAMI。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信