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标准中,该技术有着重要的地位。对空时分组码及相关知识进行了介绍,并对可变速率的空时分组码设计进行了探讨,最后展望了空时分组码技术的应用前景。     

一种二元域上的快速计算哈希函数

论文从映射的角度,将哈希函数分为三类:严格哈希函数、计算哈希函数和实用哈希函数。在此基础上,根据二元域上二次方程x2 x c=0的部分不可解的性质,构造了一种计算哈希函数,它满足单向性和一一对应性,同时具有运算速度快的优点。     

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.     

规则RA码在混合信道上的高斯估计

将高斯估计方法运用到规则重复累积（RA）码在具有加性白色高斯噪声和删除干扰的混合信道上的性能分析中．导出了RA码在该信道上概率密度进化的递归等式和误码率的解析表达式。仿真结果验证了解析结果的正确性。因此解析结果可以直接用来预测RA码在混合信道上的性能。     

低差错平底特性的非规则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系统的错误平底也有明显的改进。