一种改进的Turbo codes译码方法

Turbo码是一种目前研究比较多的纠错码,译码端采用了基于软判决信息输入/输出的反馈迭代结构,译码的迭代是其具有优越纠错性能的关键,也是造成其时延的问题所在,该文提出一种自适应选择迭代次数的方法,实验表明该方法能够在译码结果收敛时自动停止迭代,避免大量无谓的计算,同时保证译码的准确性。

基于SPIHT图象压缩编码的Turbo codes编码

针对信源与信道编码的特点 ,提出了结合SPIHT(setpartitioninginhierarchicaltrees)算法和改进的TurboCodes的信源与信道联合编码方案 .这一方案充分考虑了SPIHT算法和TurboCodes的特性 ,根据信源编码后数据在重建时的重要程度 ,进行不同等纠错保护的信道编码 .实验表明 ,论文的方法能够使误码率与码长达到一个较好的平衡 。

CDMA系统中的Turbo Code仿真(英文)

在第三代移动通信系统W CDMA和CDMA2 0 0 0中 ,turbocode在高速数据传输业务方面已倍受青睐 .本文给出了turbocode在瑞利衰落信道和加性高斯白噪信道下的性能仿真结果 ,并在各种不同条件下与卷积码的性能进行了比较 .得到了较为可信的仿真结果 .

Log Likelihood Ratio-Based Relaying for Distributed Turbo Codes

A distributed turbo codes( DTC) scheme with log likelihood ratio( LLR)-based threshold at the relay for a two-hop relay networks is proposed. Different from traditional DTC schemes,the retransmission scheme at the relay,where imperfect decoding occurs,is considered in the proposed scheme. By employing a LLR-based threshold at the relay in the proposed scheme,the reliability of decoder-LLRs can be measured. As a result,only reliable symbols will be forwarded to the destination and a maximum ratio combiner( MRC) is used to combine signals received from both the source and the relay. In order to obtain the optimal threshold at the relay,an equivalent model of decoderLLRs is investigated,so as to derive the expression of the bit error probability( BEP) of the proposed scheme under binary phase shift keying( BPSK) modulation. Simulation results demonstrate that the proposed scheme can effectively mitigate error propagation at the relay and also outperforms other existing methods.

Turbo Codes with Hybrid Interleaving Mode

In the investigation of turbo codes, either random interleavers or structured interleavers are used. Combined two kinds of interleavers in one turbo encoder, a hybrid interleaving mode is proposed in this paper. Computer simulations show that the performance of turbo codes with the hybrid interleaving mode is better than that with the typical interleaving mode.

Interleaver Design Method for Turbo Codes Based on Genetic Algorithm

This paper describes a new interleaver construction technique for turbo code. The technique searches as much as possible pseudo\|random interleaving patterns under a certain condition using genetic algorithms(GAs). The new interleavers have the superiority of the S\|random interleavers and this interleaver construction technique can reduce the time taken to generate pseudo\|random interleaving patterns under a certain condition. The results obtained indicate that the new interleavers yield an equal to or better performance than the S-random interleavers. Compared to the S-random interleaver, this design requires a lower level of computational complexity.

NEW ITERATIVE SUPER-TRELLIS DECODING WITH SOURCE A PRIORI INFORMATION FOR VLCS WITH TURBO CODES

A novel Joint Source and Channel Decoding (JSCD) scheme for Variable Length Codes (VLCs) concatenated with turbo codes utilizing a new super-trellis decoding algorithm is presented in this letter. The basic idea of our decoding algorithm is that source a priori information with the form of bit transition probabilities corresponding to the VLC tree can be derived directly from sub-state transitions in new composite-state represented super-trellis. A Maximum Likelihood (ML) decoding algorithm for VLC sequence estimations based on the proposed super-trellis is also described. Simu-lation results show that the new iterative decoding scheme can obtain obvious encoding gain especially for Reversible Variable Length Codes (RVLCs),when compared with the classical separated turbo decoding and the previous joint decoding not considering source statistical characteristics.

DIFFERENTIAL AMPLITUDE PHASE SHIFT KEYING: A NEW MODULATION METHOD FOR TURBO CODE IN DIGITAL RADIO BROADCASTING

The multilevel modulation techniques of M-Differential Amplitude Phase Shift Keying (DAPSK) have been proposed in combination with Turbo code scheme for digital radio broadcasting bands below 30 MHz radio channel. Comparison of this modulation method with channel coding in an Additive White Gaussian Noise (AWGN) and multi-path fading channels has been presented. The analysis provides an iterative decoding of the Turbo code.

An Improved S-Random Interleaver Design for Turbo Code Based on Chaos Model

A new method to design interleaver based on Henon chaos model is presented. The designed interleaver is with rather random behavior. Experimental results show that the proposed S-henon interleaver make a magnitude of improvement in bit error rate (BER) performance by 0.4 dB compared with the S-random interleaver for AWGN channel respectively. The S-henon interleaver may be adapted to 3G mobile communication systems.

Improving the BER performance of turbo codes with short frame size based on union bound

In order to improve the bit error rate(BER) performance of turbo codes with short frame size at a wide range of signal to noise ratio(SNR),a new method by optimizing the bit energy is proposed.At first,a formula derived from the Union Bound is introduced.It describes the relations between the bit error rate distribution and the minimum weight distribution.And then,by mathematically optimizing the formula,the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region.At last,an adjustable parameter is employed to compensate the degradations of BER at low and moderate SNR regions.Case studies indicate that the improvements of BER for turbo codes with short frame size are significant at a wide range of SNR.

Optimization of Mapping Rule of Bit-Interleaved Turbo Coded Modulation with 16QAM

Optimization of mapping rule of bit-interleaved Turbo coded modulation with 16 quadrature amplitude modulation (QAM) is investigated based on different impacts of various encoded bits sequence on Turbo decoding performance. Furthermore, bit-interleaved in-phase and quadrature phase (I-Q) Turbo coded modulation scheme are designed similarly with I-Q trellis coded modulation (TCM). Through performance evaluation and analysis, it can be seen that the novel mapping rule outperforms traditional one and the I-Q Turbo coded modulation can not achieve good performance as expected. Therefore, there is not obvious advantage in using I-Q method in bit-interleaved Turbo coded modulation.

Henon CSK Secure Communication System Using Chaotic Turbo Codes

In this paper, the authors design a novel chaotic secure communication system, which has high security and good error correcting capability. Firstly, the Henon Chaos Shift Keying (CSK) modulation block is presented. Secondly, chaotic turbo encoder/decoder (hard decision) is introduced. Thirdly, this chaotic secure communication system, which comprises the Henon CSK modulation block and chaotic turbo encoder in a serially concatenated form, is shown. Furthermore, a novel two step encryption scheme is proposed, which is based on the chaotic turbo encoded Henon CSK secure communication system.

A Self-Terminated Interleaver Design for Turbo Codes

Turbo codes can achieve excellent performance at low signal-to-noise ratio (SNR), but the performance can be severely degraded if no trellis termination is employed. This paper proved that if trellis termination bits were appended to RSC1, trellis of RSC2 could be terminated by designing the interleaver properly, consequently, derived the designing condition of such self-terminated interleaver (STI). Then we presented an algorithm of implementing a kind of STI, which could terminate RSC2 as well on condition that the RSC1 was terminated. We verified the performance of STI for turbo codes by simulation, and the simulation results showed that turbo codes with STI outperformed interleavers that could not terminate RSC2 as well.

A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings

It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free inter-leaver design has become a serious problem in the parallelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that inter-leavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the interleaver length N, which, also called maximum contention-free interleavers.

Puncturing Period on the Performance of Punctured Turbo Codes

Puncturing is the predominant strategy to construct high code rate turbo codes. Puncturing period is a crucial parameter influencing the performance of punctured turbo codes (PTC). Here we developed a new puncturing scheme of turbo codes, with which the puncturing period on the performance of PTC is studied. Consequently, suggestions on selecting the puncturing period are proposed.

OPTIMAL PUNCTURING OF TURBO CODES BASED ON ADS CRITERION

Puncturing is the predominant strategy to construct high code rate turbo codes. Puncturing tables are crucial to the performance of punctured turbo codes(PTC). This paper developed a new searching algorithm of optimal puncturing tables based on average distance spectrum(ADS) criterion. Consequently, some optimal puncturing tables were presented as the searching results. Finally, it presented the performance comparison among some optimal and bad puncturing tables by simulation.

Pragmatic Approach to Adaptive Turbo Coded Modulation

This paper presents a pragmatic adaptive scheme for TuCM over slowly fading channels. The adaptive scheme employs a single turbo coded modulator composed of a variable-rate turbo encoder and a variable-rate variable-power MQAM for all fading regions, so it has an acceptable complexity to implement. The optimal adaptive TuCM scheme is determined subject to various system constraints. Simulations have been performed to measure the performance of the scheme for different parameters. It is shown that adopting both the turbo coded modulator and the transmit power achieves a performance within 2.5 dB of the fading channel capacity.

Performance analysis of adaptive turbo coded modulation with time delay

The method of data fitting is applied to obtain the BER expression for turbo coded modulation, and a fitting mathematical model is proposed, which resolves the problem that there is no exact BER expression for turbo coded modulation in performance analysis. With the time delay consideration, the performance of BER of adaptive turbo coded modulation is analyzed and simulated. The results show that adaptive turbo coded modulation is very sensitive to time delay. In order to meet the target BER requirement, the total time delay should be less than 0 001/f D.

On the Performance of Punctured Turbo Codes

Currently puncturing is the predominant strategy to construct high code rate turbo codes. The puncturing period and puncturing patterns, which have important effect on the performance of punctured turbo codes (PTC), yet have not received complete investigations, are addressed in this paper. Proposes on selecting puncturing period and puncturing patterns are presented. Since puncturing will alter the distance spectrum of turbo codes, the performance of PTC needs further consideration. We derive an analytical upper bound for PTC, based on the assumption of uniform puncturing defined in this paper. Finally, we present some numeric results on the performance of PTC.