KBturbo码中交织器的设计

已知比特(KB,Known Bits)turbo码是采用将KB周期性的插入到信息比特中,不显著增加系统复杂程度而较大提高turbo码译码性能。但因为一般采用了随机交织器,所以在引入KB方法时,产生了不等差错保护的问题。这个问题可以通过采用KB交织器,将KB在交织器中均匀分配来解决。仿真证实,以伪随机交织器和S随机交织器为基础的KB交织器可以显著提高系统性能。而且采用KB turbo码可以方便地实现速率适配,满足第三代移动通信系统的要求。     

基于短帧交织的Turbo码编码器研究

本文分析了Turbo码编码器及其输出码字的组成原理,基于使输出码字最小汉明重量最大化和使最小汉明重量输出码字出现的概率最小化的原则,结合结构化交织器和随机交织器的优点,提出了一种伪随机的结构化反块交织器,并进一步提出了采用双伪随机反块交织器的Turbo码编码器方案.该方案有效的增大了Turbo码输出码字的最小汉明距离,同时避免了Turbo码边缘效应且具有伪随机性,因此,可有效的提高系统的纠错性能.仿真实验结果显示,该方案在短帧传输的条件下有着最佳的综合性能.特别是在信噪比高时,采用该方案与采用其它交织器的Turbo码方案相比,在提高系统的可靠性上具有明显的优势.     

比特交织Turbo编码调制的8PSK符号映射

基于对Turbo编码器输出的系统比特和校验比特的不等错误保护(UEP),提出了一种新的比特交织Turbo编码调制(BITCM)的8PSK符号映射方案,即对于码率为1/3的Turbo码,校验比特映射到8PSK星座点中具有较好传输性能的比特位置上,而系统比特映射到较差传输性能的比特位置上。实现新映射方案的关键是比特交织器的设计。仿真结果表明,新的映射方案在AWGN信道下,误码率为10-3时,可获得大于0.2dB的信噪比增益,而这一增益的获得并没有牺牲频谱效率和增加系统的复杂性。     

Turbo码交织器的等差错保护研究

Turbo码具有近Shannon限的突出纠错能力,是一种高性能的信道编码。文中分析了一般交织器的设计规则和进行Turbo码编码时存在的等差错保护问题。在此基础上,针对分组交织器提出了沿交织矩阵主对角线循环的信息写入机制,对于s 随机交织器增加了随机索引地址生成的约束条件,最终得到了两种具有等差错保护功能的Turbo码交织器。仿真结果表明,改进的交织器明显改善了Turbo码的误比特率性能。     

直升机卫星通信系统中Turbo码外交织器设计与仿真

在直升机卫星通信系统(HSCS)中,如何克服由于旋翼遮挡导致的系统性能恶化是一个亟需解决的关键问题。旋翼遮挡相当于对码字信息的成片删除,通过分析删余Turbo码中删余矩阵的设计准则,首先对Turbo码的编码结构进行改进,并提出了一种适用于直升机旋翼遮挡环境下的交织器。它满足以下特性:将删除均匀分散在整个码字序列中,变突发错误为随机错误;码字中每个信息位与其对应的2比特校验位中最多只删1位;与被删比特组相邻的两个比特组保留;删除部分中以信息位-校验位1-校验位2的模式循环,这些特性保证了删除信息的可靠恢复。最后对不同遮挡比例下新型交织器与传统交织器进行仿真比较,结果表明采用新型交织器改善了数据传输的误码率(BER)性能,提高了HSCS系统的可靠性。     

衰落信道中结合短帧交织的Turbo码的研究

Turbo码作为信道编码方案,可以获得较高的误比特性能,而交织器的设计是影响Turbo码性能的关键环节。在码的重量分析的基础上,借用稀疏矩阵概念,对S型随机交织器进行改进,提出了一种短帧交织器的设计原则,它可以减少低重量码的数量,从而提高Turbo码的性能。     

短Turbo码的交织器设计

介绍了一种短Turbo码交织器的设计方法 ,给出了一个短交织器的设计例子 ,其仿真结果表明 ,这种交织器对于短Turbo码很有效。在Turbo码帧长度处于 10 0到 10 0 0时 ,与Turbo码使用块交织和伪随机交织相比 ,误码性能有了大幅度的提高。     

Turbo码的一种并行译码方案及相应的并行结构交织器研究

Turbo码基于MAP算法译码的递推计算所引入高的译码延迟限制了Turbo码在高速率数据传输中的应用。为了解决这个问题,该文提供了一种降低译码延迟的并行译码方法。并行处理方案的实现必须通过适当的交织以避免两个译码器对外信息读写的数据冲突。该文在分析了任意无冲突交织方式可能性的存在之后,给出了设计任意地适用于并行处理方案的S随机交织器的方法。仿真验证了并行译码方案的误比特性能。     

基于Henon混沌模型的随机交织器设计

本文对Turbo码中的关键组成部分-交织器作了分析，阐明了交织器在Turbo码中的重要作用；提出了一种基于Henon混沌模型的随机交织器设计方法，通过仿真实验，本文设计的交织器整体性能优于CDMA2000标准中Turbo码交织器性能，在高斯信道下，纠错性能平均改善0.15dB。     

Turbo码随机交织器的设计与实现

Turbo码中交织器性能的优劣将直接影响到Turbo码的译码性能.在分析交织器的设计准则和类型的基础上,利用m序列的遍历性,设计了一种基于m序列的随机交织器,并给出了基于FPGA的硬件实现方案.仿真结果表明,该随机交织器在实现输入数据随机分布方面性能优异,并降低了Turbo码的译码延迟.     

Combined turbo codes and interleaver design

The impact of the distance spectrum and interleaver structure on the bit error probability of turbo codes is considered. A new turbo code design method for Gaussian channels is presented. The proposed method combines a search for good component codes with interleaver design. The optimal distance spectrum is used as the design criterion to construct good turbo component codes at low signal-to-noise ratios (SNRs). In addition, an interleaver design method is proposed. This design improves the code performance at high SNR. Search for good component codes at low SNR is combined with a code matched interleaver design. This results in new turbo codes with a superior error performance relative to the best known codes at both low and high SNR. The performance is verified by both analysis and simulation     

AMR的信道编码设计及其DSP实现

对于超短波移动通信系统中AMR语音业务的传输，提出了基于码率兼容的删余卷积码和码率兼容的删余Turbo码这2种可变的不等差错保护信道编码方案。通过设计最优的删余方案和合适的速率匹配方法，这2种不等差错保护方案都可达到类内不等保护的目的，将对具有不同重要性的信源比特的作更精确不等保护。并基于DSP芯片TMS320C6416实时实现了这2种方案对AMR语音的不等差错保护。实验结果表明，这种方法具有合理的系统复杂度和很短的处理延时，适合于语音业务的应用。     

Turbo codes-based image transmission for channels with multiple types of distortion

Product codes are generally used for progressive image transmission when random errors and packet loss (or burst errors) co-exist. However, the optimal rate allocation considering both component codes gives rise to high-optimization complexity. In addition, the decoding performance may be degraded quickly when the channel varies beyond the design point. In this paper, we propose a new unequal error protection (UEP) scheme for progressive image transmission by using rate-compatible punctured Turbo codes (RCPT) and cyclic redundancy check (CRC) codes only. By sophisticatedly interleaving each coded frame, the packet loss can be converted into randomly punctured bits in a Turbo code. Therefore, error control in noisy channels with different types of errors is equivalent to dealing with random bit errors only, with reduced turbo code rates. A genetic algorithm-based method is presented to further reduce the optimization complexity. This proposed method not only gives a better performance than product codes in given channel conditions but is also more robust to the channel variation. Finally, to break down the error floor of turbo decoding, we further extend the above RCPT/CRC protection to a product code scheme by adding a Reed-Solomon (RS) code across the frames. The associated rate allocation is discussed and further improvement is demonstrated.     

Turbo-coded optical direct-detection CDMA system with PPMmodulation

The performance of an optical code division multiple access (CDMA) system with turbo coding is analyzed and simulated. Turbo codes are parallel concatenated convolutional codes (PCCCs) in which the information bits are first encoded by a recursive systematic convolutional code, and then, after passing through an interleaver, are encoded by a second systematic convolutional encoder. Turbo coding is superimposed on an intensity-modulated optical channel with pulse-position modulation (PPM) and direct detection of the received optical signal, and the performance is evaluated in terms of an upper bound on bit error probability. From the simulation results, it is seen that turbo coding offers considerable coding gain over other methods, with reasonable encoding/decoding complexity. Also, it is demonstrated that, for a fixed code rate, the performance of the optical CDMA system can be substantially improved by increasing the interleaver length and the number of iterations. Serially concatenated convolutional codes (SCCCs) are also considered, and are shown to perform comparably to PCCC in general and better than PCCCs for the case of large signal photocounts. The results in this paper can be applied, for example, to indoor optical wireless LANs     

Design and analysis of turbo codes on Rayleigh fading channels

The performance and design of turbo codes using coherent BPSK signaling on the Rayleigh fading channel is considered. In low signal-to-noise regions, performance analysis uses simulations of typical turbo coding systems. For higher signal-to-noise regions beyond simulation capabilities, an average upper bound is used in which the average is over all possible interleaving schemes. Fully interleaved and exponentially correlated Rayleigh channels are explored. Furthermore, the design issues relevant to turbo codes are examined for the correlated fading channel. Turbo interleaver design criteria are developed and architectural modifications are proposed for improved performance     

A novel bit mapping scheme for high-order polar coded modulation systems

In order to improve the spectrum efficiency of the high-order polar coded modulation systems, the polar code is used as the component code of the bit-interleave coded modulation (BICM) system, a novel bit mapping scheme is proposed considering of the channel polarization and successive cancellation (SC) decoding principle of polar codes as well as the unequal protection of equivalent channels by modulator. In this scheme, the frozen bits on the unreliable split channel are allocated to the equivalent channel with the low protection of the modulator, while the equivalent channels with the high protection are used to transmit the information bits. Thus, the error-correcting performance of polar codes is improved. Compared with some bit mapping schemes, the proposed bit mapping scheme only needs to divide and choose the parameters of the split channels reliability measurement, the complexity does not increase obviously, and simulation results show that the proposed scheme has the better performance under the quadrature amplitude modulation (QAM) modulation based on the Gray mapping.     

Interleaver design for turbo codes

The performance of a turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the information input data and the soft output of each decoder corresponding to its parity bits. This paper describes a new interleaver design for turbo codes with short block length based on these two criteria. A deterministic interleaver suitable for turbo codes is also described. Simulation results compare the new interleaver design to different existing interleavers