基于正交空时分组码的酉空时码设计

A Unitary Space-Time Code Based on Orthogonal Space-Time Block Code

提出了一种基于正交空时分组码构造酉空时码的方案,证明了所设计的酉空时码可以获得满分集.同原有方案相比,所提方案的优点是其码率较高,缺点是解码复杂度较原方案高.针对该缺点,提出了一种次优解码算法,该算法的复杂度同原方案几乎相同.Monte-Carlo仿真实验表明,在相同的频谱效率下,对同一误码率本文方案所需信噪比比原方案低5dB;同时,对同一误码率本文的次优解码算法同最优解码算法相比信噪比损失约1dB.

Based on orthogonal space-time block code, a scheme for constructing unitary space-time code is proposed. The conclusion that the proposed scheme can achieve full diversity is proved. Compared with original scheme, the advantage of proposed scheme is its higher code rate. However, the disadvantage of proposed scheme is its high complexity needed for decoding. In view of high complexity of the optimum decoding algorithm a suboptimal decoding algorithm is employed. The complexity of suboptimal algorithm is almost the same as the fast decoding algorithm of original scheme. Monte-Carlo simulation shows that the required SNR of the proposed scheme is reduced by 5dB relative to original scheme at the same BER and spectrum efficiency. Meanwhile, simulation results indicate that the SNR of the suboptimal algorithm loses about ldB compared to that of the optimum algorithm.