.png){kind=icon}
返回
Fast Approximation Algorithms for Symmetric Constellation Subset Selection
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2012.032712.100228.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Adaptive-modulation transceivers have been widely used in wireless communications nowadays. The tradeoff between symbol error rate and data rate can be tuned by adjusting the constellation size. In this paper, we propose a constellation subset selection (CSS) approach and design the novel efficient approximation algorithms to tackle the CSS problems. The approximation ratios for these algorithms are derived. The theoretical studies on how to control the target symbol error rate by selecting an appropriate parameter K are also presented. Monte Carlo simulation results show that our CSS scheme really can reach below the target error probability.
Keyword:
Constellation subset selection
approximation algorithms
symbol error rate bounds
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏On the SNR penalty of MPSK with hybrid selection/maximal ratio combining over i.i.d. Rayleigh fading channels在i.d上使用混合选择/最大比率组合的MPSK的SNR惩罚。瑞利衰落信道
PREAI
分享收藏
Virtual branch analysis of symbol error probability for hybrid selection/maximal-ratio combining in Rayleigh fading瑞利衰落中混合选择/最大比合并的符号错误概率的虚拟分支分析
PREAI
分享收藏
查看更多内容