不同信源条件下卷积码的Viterbi和BCJR两种译码方案的比较

研究了在AWGN信道下，当信源为等概和非等概分布的数据信源以及图像信源时，Viterbi和BCJR算法的性能。在计算机仿真和比较分析的基础上，进一步探讨了BCJR算法在卷积码译码中的应用条件。     

Turbo码译码中的BCJR算法

BCJR算法是在Turbo码的译码中广泛使用的一种重要算法。对BCJR算法进行了详细的推导,并简要讨论了其在Turbo码译码中的一些实现问题。实践及理论研究证明,BCJR算法对于Turbo码译码性能的提高具有相当重要的意义。     

高吞吐量低资源占用的累积码译码器

由于相邻节点间存在数据依赖关系,基于最小误符号率(Bahl Cocke Jelinek Raviv,BCJR)算法的累积码译码器无法进行多个节点的并行计算。为了提高译码器吞吐量,研究提高BCJR算法并行度的方法,通过将累积码分段,并在不同分段间传递上一次迭代的信息,属于不同分段的多个节点可以并行计算,使译码器的吞吐量得到有效提高,而且相对于不分段译码,分段译码性能也几乎无损。同时,提出一种面向硬件实现的信息更新流程,基于该流程,累积码译码器降低了30%的资源占用。     

Low complexity Chase-2 decoding of concatenated codes

The concatenated codes are widely used in current communication systems, such as satellite communication systems and WiMAX system. The objective of this study was to present a low complexity iterative soft decoding algorithm for concatenated codes. The concatenation was between a Reed-Solomon (RS) code and recursive systematic convolutional (RSC) code. The reduction in computational complexity was achieved by simplifying the Chase-2 decoder for RS codes with limited usage of test patterns. The processing of soft information between inner and outer decoders was also discussed. Simulation results showed that the proposed algorithm could achieve a good trade-off between complexity and performance.     

New parallel interference cancellation for convolutionally coded CDMA systems

Based on BCJR algorithm proposed by Bahl et a/and linear soft decision feedback, a reduced-complexity parallel interference cancellation (simplified PIC) for convolutionally coded DS CDMA systems is proposed. By computer simulation, we compare the simplified PIC with the exact PIC. Itshows that the simplified PIC can achieve the performanceclose to the exact PIC if the mean values of coded symbols arelinearly computed in terms of the sum of initial a prior loglikelihood rate (LLR) and updated a prior LLR, while a significant performance loss will occur if the mean values of coded symbols are linearly computed in terms of the updated aprior LLR only. Meanwhile, we also compare the simplifiedPIC with MF receiver and conventional PICs. The simulationresults show that the simplified PIC dominantly outperformsthe MF receiver and conventional PICs, at signal-noise rate(SNR) of 7 dB, for example, the bit error rate is about 10 4for the simplified PIC, which is far below that of matchedfilter receiver and conventional PIC.     

迭代接收机中软译码算法的低复杂度实现

Max-Log-MAP算法因其更适于迭代处理已成为解决低信噪比条件下信号接收问题中的常用译码算法.提出一种新颖的性能/复杂度折衷策略来解决算法的实用化问题.新算法的巧妙之处在于利用MAP算法中误比特率最小的特点,通过简单的全局路径对比实现状态缩减;分析译码软输出对接收机迭代性能的影响,提出大噪声环境下的可靠度放大策略以改善性能.仿真结果表明,该算法在信噪比小于5dB时,能够十分逼近 Log-MAP 的误码性能,同时其实现复杂度只为Max-Log-MAP算法的40%～50%.     

高吞吐量低资源占用的累积码译码器

由于相邻节点间存在数据依赖关系,基于最小误符号率(Bahl Cocke Jelinek Raviv,BCJR)算法的累积码译码器无法进行多个节点的并行计算.为了提高译码器吞吐量,研究提高BCJR算法并行度的方法,通过将累积码分段,并在不同分段间传递上一次迭代的信息,属于不同分段的多个节点可以并行计算,使译码器的吞吐量得...