论文部分内容阅读
最近提出的并行级联卷积码（Ｔｕｒｂｏ－ｃｏｄｅ），以其惊人的性能，引起了国际上的广泛重视。介绍了Ｔｕｒｂｏ码的编、译码原理，特别讨论了适用于Ｔｕｒｂｏ码译码的最大后验概率（ＭＡＰ）和最大对数后验概率（Ｍａｘ－ｌｏｇ－ＭＡＰ）译码算法，在ＡＷＧＮ信道中，对两种算法的比特差错率（ＢＥＲ）进行了比较。ＭＡＰ算法对Ｔｕｒｂｏ码是最优的，但硬件实现难度大。Ｍａｘ－ｌｏｇ－ＭＡＰ算法性能比ＭＡＰ略有下降，但运算量大为减小，应用性强。
Recently proposed parallel concatenated convolutional code (Turbo-code), with its amazing performance, has attracted widespread international attention. The principle of coding and decoding of Turbo codes is introduced. In particular, the maximum a-posteriori (MAP) and maximum-log-MAP decoding algorithms applicable to Turbo decoding are discussed. In the AWGN channel , The bit error rate (BER) of the two algorithms is compared. MAP algorithm is the best for turbo codes, but the hardware is difficult to implement. The performance of Max-log-MAP algorithm is slightly lower than that of MAP, but the amount of operation is greatly reduced and the application is strong.