.png){kind=icon}
返回
Binary-Tree Encoding for Uniform Binary Sources in Index Modulation Systems
.png){kind=icon}
OA
AI
DOI：10.1109/JSTSP.2019.2914531.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of designing bit-to-pattern mappings and power allocation schemes for orthogonal frequency-division multiplexing (OFDM) systems that employ subcarrier index modulation (IM) is considered. We assume that the binary source conveys a stream of independent, uniformly distributed bits to the pattern mapper, which introduces a constraint on the pattern transmission probability distribution that can be quantified using a binary tree formalism. Under this constraint, we undertake the task of maximizing the achievable rate subject to the availability of channel knowledge at the transmitter. The optimization variables are the pattern probability distribution (i.e., the bit-to-pattern mapping) and the transmit powers allocated to active subcarriers. To solve the problem, we first consider the relaxed problem where pattern probabilities are allowed to take any values in the interval [0, 1] subject to a sum probability constraint. We develop (approximately) optimal solutions to the relaxed problem by using new bounds and asymptotic results, and then use a novel heuristic algorithm to project the relaxed solution onto a point in the feasible set of the constrained problem. Numerical analysis shows that this approach is capable of achieving the maximum mutual information for the relaxed problem in low- and high-SNR regimes and offers noticeable benefits in terms of achievable rate relative to a conventional OFDM-IM benchmark.
Keyword:
OFDM
index modulation
binary tree
mutual information
achievable rate
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.9K
被引数:
1.1W
机构
引用论文
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
OAAI
.png){kind=icon}
OAAI分享收藏
查看更多内容