A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

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.     

无线通信中的空时分组码

空时分组码技术结合信道编码、调制和天线分集技术,当发送天线一定时,他的解码复杂度正比于发送速率,在3G标准中,该技术有着重要的地位。对空时分组码及相关知识进行了介绍,并对可变速率的空时分组码设计进行了探讨,最后展望了空时分组码技术的应用前景。     

分组密码算法芯片验证

介绍了分组密码算法芯片验证的流程、内容和方法,详细介绍了分组密码算法芯片的验证技术——测试基准。     

Belief-Propagation-Approximated Decoding of Low-Density Parity-Check Codes

In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.