arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.09401cs.ITcs.CCmath.IT
收藏

空间调制的最佳低复杂度解码器

Optimum Low-Complexity Decoder for Spatial Modulation

Ibrahim Al-Nahhal, Ertugrul Basar, Octavia A. Dobre, Salama Ikki

摘要:

本文提出并分析了一种新的低复杂度的空间调制检测算法--最大长度的最小距离(minimum-distance of maximum-length,m-M)算法。提出的m-M算法是一种智能搜索方法,适用于SM树搜索解码器。针对三种不同的情况研究了m-M算法的行为:i)接收机侧的完美信道状态信息(CSIR),ii)固定信道估计误差方差的不完美CSIR,以及iii)可变信道估计误差方差的不完美CSIR。此外,m-M算法的复杂度被认为是一个随机变量,这是仔细分析的所有情况下,使用概率工具。基于球形解码器(SD)和排序概念的组合,m-M算法保证找到最大似然(ML)解决方案,与SM-ML和现有的SM-SD算法相比,解码复杂度显著降低;与SM-ML解码器相比,它可以在完美CSIR和不完美CSIR的最坏情况下分别降低高达94%和85%的复杂度。蒙特卡罗模拟结果提供支持我们的研究结果,以及派生的分析复杂性降低表达式。

英文摘要:

In this paper, a novel low-complexity detection algorithm for spatial modulation (SM), referred to as the minimum-distance of maximum-length (m-M) algorithm, is proposed and analyzed. The proposed m-M algorithm is a smart searching method that is applied for the SM tree-search decoders. The behavior of the m-M algorithm is studied for three different scenarios: i) perfect channel state information at the receiver side (CSIR), ii) imperfect CSIR of a fixed channel estimation error variance, and iii) imperfect CSIR of a variable channel estimation error variance. Moreover, the complexity of the m-M algorithm is considered as a random variable, which is carefully analyzed for all scenarios, using probabilistic tools. Based on a combination of the sphere decoder (SD) and ordering concepts, the m-M algorithm guarantees to find the maximum-likelihood (ML) solution with a significant reduction in the decoding complexity compared to SM-ML and existing SM-SD algorithms; it can reduce the complexity up to 94% and 85% in the perfect CSIR and the worst scenario of imperfect CSIR, respectively, compared to the SM-ML decoder. Monte Carlo simulation results are provided to support our findings as well as the derived analytical complexity reduction expressions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑