共查询到19条相似文献,搜索用时 93 毫秒
1.
现有的空间调制系统球形译码(Sphere-Decoding,SD)检测算法虽然能够较大地降低最大似然(Maximum-Likelihood,ML)检测算法的计算复杂度,但由于其更新半径比较松散、收敛较慢,计算复杂度降低的水平仍十分有限,尤其是在高阶调制系统下.针对上述问题,采用统计分布的思想对现有算法更新半径中的冗余项进行估计,提出了两种改进的球形译码检测算法.理论分析与仿真结果表明,改进算法在达到最优检测性能的同时,极大地降低了传统球形译码的计算复杂度,具有较好的理论和实际应用意义. 相似文献
2.
根据逐级QAM(Quadrature Amplitude Modulation)调制方案提出了广义干扰抵消的思想,并根据STBC(Space-TimeBlock Coding)系统传统的最大似然(ML)译码算法,提出了一种基于逐级解调思想的低复杂度STBC译码方法。在分别采用64QAM和256QAM调制方式下,新的译码算法比传统的ML译码算法的复杂度分别降低了90%和97%以上。同时,用理论和仿真结果证明了该译码方法达到了ML的译码性能。因而,这种新的译码方法在没有性能损失的前提下降低了译码的复杂度。 相似文献
3.
联合ML和OSIC的VBLAST解码算法 总被引:1,自引:0,他引:1
使用多个发射天线和多个接收天线可以获得巨大的通信容量。作为MIMO系统的一种实现方案,VBLAST可以获得很高的频谱利用率。传统的VBLAST译码算法OSIC(Ordered Successive Interference Cancellation)在其译码性能上和最大似然ML(Maximum Likelihood)译码差距较大,而ML,的复杂度是随着发射天线数呈指数增加的。因此,本文针对VBLAST的译码,折中考虑VBLAST的解码复杂度和解码性能,提出了联合ML,和OSIC的两种改进的VBLAST解码算法:ML_OSIC和OSIC_ML。当选取用ML译码的符号数适中时,可以在远低于ML的复杂度基础上获得远好于OSIC的译码性能。 相似文献
4.
针对准正交重叠Alamouti码(Overlapped Alamouti Code,OAC)采用最大似然(maximum likelihood,ML)接收机检测时译码复杂度高的缺点,提出了一种ML译码优化算法。利用等价信道矩阵具有部分正交性的特点,将等价信道矩阵拆分成2个相互正交的子等价信道矩阵,使得在检测每个符号分组时可分别检测2个较短分组,从而降低了ML接收机的译码复杂度。改进算法保持了与ML译码相近的误码率性能,而运算量大幅度降低,从而克服了ML译码复杂度高的缺点。 相似文献
5.
6.
7.
针对广义空间调制( GSM)系统接收端最大似然( ML)检测算法计算复杂度极高的缺点,提出了一种基于压缩感知( CS)信号重构理论的低复杂度信号检测算法。首先,在多输入多输出( MI-MO)信道模型下,通过改进正交匹配追踪( OMP)算法,得到一个激活天线索引备选集;然后,利用ML算法在该备选集中进行遍历搜索,检测出激活天线索引和星座调制符号。仿真结果表明所提算法的检测性能接近于ML算法,且复杂度约为ML算法的2%。因此,所提算法在保证检测性能的同时也大大降低了计算复杂度,实现了检测性能与复杂度之间的平衡。 相似文献
8.
部分判决的OSIC:一种改进的VBLAST解码算法 总被引:2,自引:0,他引:2
VBLAST的传统译码算法:排序连续干扰抵消OSIC(Ordered Successive Interference-Cancellation),与最优译码算法:最大似然(Maximum Likelihood,ML)比较,虽然降低了复杂度,但其译码性能却相差较远。该文提出了一种改进的OSIC的译码算法:部分判决的排序干扰抵消算法(PartialDecision OSIC)。该算法在各层的判决中增加候选判决符号,并且在最后一层的判决中使用了最大似然检测,从而提高了译码的性能。从仿真结果可以看出,该算法比传统的VBLAST译码算法性能有较大的提高。 相似文献
9.
10.
11.
12.
13.
14.
In this paper, we propose a new two-stage (TS) structure for computationally efficient maximum-likelihood decoding (MLD) of linear block codes. With this structure, near optimal MLD performance can be achieved at low complexity through TS processing. The first stage of processing estimates a minimum sufficient set (MSS) of candidate codewords that contains the optimal codeword, while the second stage performs optimal or suboptimal decoding search within the estimated MSS of small size. Based on the new structure, we propose a decoding algorithm that systematically trades off between the decoding complexity and the bounded block error rate performance. A low-complexity complementary decoding algorithm is developed to estimate the MSS, followed by an ordered algebraic decoding (OAD) algorithm to achieve flexible system design. Since the size of the MSS changes with the signal-to-noise ratio, the overall decoding complexity adaptively scales with the quality of the communication link. Theoretical analysis is provided to evaluate the potential complexity reduction enabled by the proposed decoding structure. 相似文献
15.
16.
17.
Changlong Xu Ying-Chang Liang Wing Seng Leon 《Wireless Communications, IEEE Transactions on》2008,7(1):43-47
In this letter, we propose a low complexity algorithm for extended turbo product codes by considering both the encoding and decoding aspects. For the encoding part, a new encoding scheme is presented for which the operations of looking up and fetching error patterns are no longer necessary, and thus the lookup table can be omitted. For the decoder, a new algorithm is proposed to extract the extrinsic information and reduce the redundancy. This new algorithm can reduce decoding complexity greatly and enhance the performance of the decoder. Simulation results are presented to show the effectiveness of the proposed scheme. 相似文献
18.
In order to reduce the high complexity of the successive cancellation list (SCL) algorithm for polar codes, a simplified SCL decoding algorithm based on critical sets (CS-SCL decoding algorithm) is proposed. The algorithm firstly constructs the critical sets according to the channel characteristics of the polar codes as well as comprehensively considering both the minimum Hamming weight (MHW) of the information bits and the channel reliability. The information bits within the critical sets and the path splitting are still performed by the SCL decoding algorithm while the information bits outside the critical sets are directly performed by the hard decision. Thus, the number of path ordering, copying, and deleting can be reduced during decoding. Furthermore, the computational complexity of the SCL decoding can also be reduced. Simulation results demonstrate that the decoding complexity of the proposed CS-SCL decoding algorithm, compared with the conventional SCL decoding algorithm, is reduced by at least 70%, while compared with the simplified SCL (PS-SS-SCL) algorithm which constructs the critical set with the first and second information bits of the Rate-1 nodes, its decoding complexity can also be reduced. Moreover, the loss of the error correction performance for the proposed CS-SCL decoding algorithm is minor. Therefore, the proposed CS-SCL algorithm is effective and can provide a reasonable tradeoff between the decoding performance and complexity for the decoding algorithm of polar codes. 相似文献