Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

低差错平底特性的非规则LDPC码的设计

介绍了非规则LDPC码的发展并给出了其优势及缺点，重点论述用ACE算法来构造非规则LDPC码从而降低其差错平底特性。对降低非规则LDPC码的差错平底特性的其它方法提出了展望。     

The Minimum PAPR Code for OFDM Systems

In this letter, a block code that minimizes the peak‐to‐average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals is proposed. It is shown that peak envelope power is invariant to cyclic shift and codeword inversion. The systematic encoding rule for the proposed code is composed of searching for a seed codeword, shifting the register elements, and determining codeword inversion. This eliminates the look‐up table for one‐to‐one correspondence between the source and the coded data. Computer simulation confirms that OFDM systems with the proposed code always have the minimum PAPR.     

一种改善Turbo乘积编码OFDM系统性能的新方法

本文提出一种利用对译码器软信息限幅来改善多径衰落信道中Turbo乘积编码OFDM(TPC-OFDM)系统性能的新方法。通过对不同多径衰落信道中QPSK映射和16QAM映射的TPC-OFDM系统性能的数值仿真，结果表明在10^-5误比特率下，这种新方法比传统的迭代译码大约有6～10dB的改进，对严重多径环境下TPC-OFDM系统的错误平底也有明显的改进。     

线性分组码的神经网络译码

介绍了神经网络与线性分组码之间的关系，并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性，然后以(7，4，3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。     

迫零对Turbo码的性能影响

从距离谱的角度对迫零在Turbo码中的作用进行了理论分析。通过仿真，研究了迫零对Turbo码性能的影响。仿真结果表明，Turbo码编码器迫零处理有助于改善Turbo码的性能。     

广义准正则格形码距离谱的计算

本文讨论了格形码距离谱的计算问题，定义了度量空间意义下的广义准正则格形码，对具有Ｉｍａｉ与Ｈｉｒａｋａｗａ［２］和Ｕｎｇｅｒｂｏｅｃｋ［３］定义的典型的时不变网格结构的广义准正则格形码，证明了其距离谱可用全零信息序列对应的码字进行计算。在理论上推广了Ｍ．Ｒｏｕａｎｃｅ与Ｄ．Ｊ．Ｃｏｓｔｅｌｏ的结果，解决了非平方欧几里德度量意义下一类ＴＣＭ信号序列的距离谱计算问题     

Two new decoding algorithms for Reed-Solomon codes

The subject of decoding Reed-Solomon codes is considered. By reformulating the Berlekamp and Welch key equation and introducing new versions of this key equation, two new decoding algorithms for Reed-Solomon codes will be presented. The two new decoding algorithms are significant for three reasons. Firstly the new equations and algorithms represent a novel approach to the extensively researched problem of decoding Reed-Solomon codes. Secondly the algorithms have algorithmic and implementation complexity comparable to existing decoding algorithms, and as such present a viable solution for decoding Reed-Solomon codes. Thirdly the new ideas presented suggest a direction for future research. The first algorithm uses the extended Euclidean algorithm and is very efficient for a systolic VLSI implementation. The second decoding algorithm presented is similar in nature to the original decoding algorithm of Peterson except that the syndromes do not need to be computed and the remainders are used directly. It has a regular structure and will be efficient for implementation only for correcting a small number of errors. A systolic design for computing the Lagrange interpolation of a polynomial, which is needed for the first decoding algorithm, is also presented.This research was supported by a grant from the Canadian Institute for Telecommunications Research under the NCE program of the Government of Canada     

Skeleton chain coding for Chinese characters

The compression of Chinese characters is very important for Chinese office automation and desktop publishing. In this paper, various methods are used to compress 13,051 Chinese characters losslessly by coding their skeleton points. The skeleton points are composed of isolated points and curves. To trace every point in a curve once and consecutively is a NP problem. Therefore, we use contour path following and revisiting algorithms to trace skeleton curves with chain codes. The remaining isolated skeleton points are encoded by an Elias code. Our coding method has a better compression rate than that of conventional skeleton coding.