This website requires JavaScript.

Permutation Matrix Modulation

Rahmat Faddli SiregarNandana RajathevaMatti Latva-Aho
摘要
We propose a novel scheme that allows MIMO system to modulate a set ofpermutation matrices to send more information bits, extending our initial workon the topic. This system is called Permutation Matrix Modulation (PMM). Thebasic idea is to employ a permutation matrix as a precoder and treat it as amodulated symbol. We continue the evolution of index modulation in MIMO byadopting all-antenna activation and obtaining a set of unique symbols fromaltering the positions of the antenna transmit power. We provide the analysisof the achievable rate of PMM under Gaussian Mixture Model (GMM) distributionand evaluate the numerical results by comparing it with the other existingsystems. The result shows that PMM outperforms the existing systems under afair parameter setting. We also present a way to attain the optimal achievablerate of PMM by solving a maximization problem via interior-point method. A lowcomplexity detection scheme based on zero-forcing (ZF) is proposed, and maximumlikelihood (ML) detection is discussed. We demonstrate the trade-off betweensimulation of the symbol error rate (SER) and the computational complexitywhere ZF performs worse in the SER simulation but requires much lesscomputational complexity than ML.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?
0
被引用
笔记
问答