一种高效的酉空时信号译码算法

    Efficient Decoding Algorithm for Unitary Space-time Modulation

    • 摘要: 针对系统产生的酉空时码,提出一种高效的译码算法.接收机计算连续产生的L/2+W(L为星座点数目,W为窗长)个星座点与接收信号的内积范数,将L/2+W个内积范数每隔W的范数值相加,得到L/2个和值;从所得到的和值中搜索极大值,通过该极大值的位置可以将搜索范围降低至3个星座点,最后比较这3个星座点便可搜索到全局最优解.所提算法可以有效地降低最大似然(maximum likelihood,ML)算法的搜索空间,窗长W越小搜索空间降低越多.计算机仿真结果表明,针对给定的星座点,当窗长L为4时,所提算法将ML算法的搜索空间降低一半,而信噪比损失只有2 dB左右.

       

      Abstract: An efficient decoding algorithm for the unitary space-time modulation is presented for the constellations created by a systematic method.First,the receiver calculates the inner products between the received signal and L/2+W (L is the number of constellations and W is the length of the window) constellations created successively.Second,the L/2 sums can be achieved by adding the L/2+W inner products every W ones,and the maximal one can be searched out.Based on the location of the maximal sum,the searching space of the maximum likelihood (ML) algorithm can be reduced to three constellations.Finally,the optimal constellation from the three constellations can be achieved.The proposed algorithm can significantly reduce the searching space of the ML algorithm.The smaller the value of W,the more the searching space can be reduced.Computer simulation results show that for the unitary constellations,the performance of the proposed algorithm can approach the performance as that of the ML algorithm at signal-to-noise ratio penalty of about 2.0 dB with a half of complexity of ML.

       

    /

    返回文章
    返回