Turbo Code Simulation in W-CDMA System

Turbo code has drawn more and more attractions for high data rate transmission these years especially in W CDMA and CDMA2000 of the third generation mobile communications systems. In this paper, the simulation performance of turbo code under Rayleigh fading channel and additive white Gaussian channels are depicted. Comparison with the performance of convolutional code are made respect to different parameters, such as pilot length, interleaver size, frame length, mobile velocity and data rate, etc. Faithful results are drawn out.

一种改进的Turbo codes译码方法

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

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

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

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. Key words interleaver - Turbo codes - genetic algorithm CLC number TN 911. 22 Foundation item: Supported by the National Natural Science Foundation of China (60372057) and the Key Open Laboratory on Information Science and Engineering of Railway Transportation Ministry of Beijing Jiaotong University of China (KLISAE-0103)Biography: Tan Ying (1963-), female, Associate professor, Ph. D, research direction: error control coding, analysis and design of wireless communication system.

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.

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 im provement 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.

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

The multilevel modulation techniques nf 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.

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.

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

timizing 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 degrada- tions 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

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.

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.

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 interleaver design has become a serious problem in the paraUelization 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 interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.

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.

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.

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.

Adaptive Decoding Algorithm Based on Multiplicity of Candidate Sequences for Block Turbo Codes

It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.

Dual Adaptive Turbo Coded Modulation for Integrated Multimedia Service Transmission

This paper proposes a cross-layer dual adaptive coded modulation architecture using turbo codes for mobile multimedia communication, which adapts to both the varying channel characteristics and the QoS of various multimedia services simultancously to increase the average system throughput substantially. A pragmatic channeladaptive turbo coded modulation schcme, which comes within 2.5 dB of the Shannon limit, is optimally designed, and then a QoS-adaptive scheme is superimposed to build the dual adaptive architecture. Simulation results show that the novel dual adaption reduces the gap from the fading channel capacity to 2 dB when assuming different services occur in equal probability and the service duration follows exponential distribution.

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.

A channel- and QoS-adaptive turbo coded modulation architecture for mobile multimedia communication

This paper proposed a cross-layer dual adaptive coded modulation architecture using turbo codes for mobile muhimedia communication, which simultaneously adapted to both the varying channel characteristics and the quality of service （QoS） of various mobile multimedia services to increase the average system throughput substantially. A pragmatic channel-adaptive turbo coded modulation scheme, which comes within 2.5dB of the Shannon limit, was optimally designed, and then a QoS-adaptive scheme was superimposed to build the dual adaptive architecture. Simulation results show that the novel dual adaption reduces the difference with the fading channel capacity to 2dB when assuming different services occur in equal probability and the service duration follows the exponential distribution.

APPLICATION OF TURBO CODES IN HIGH-SPEED REAL-TIME CHANNEL

The time delay of Turbo codes due to its iterative decoding is the main bottleneck of its application in real-time channel. However, the time delay can be greatly shortened through the adoption of parallel decod-ing algorithm, dividing the received bits into several sub-blocks and processing in parallel. This letter mainly discusses the applicability of turbo codes in high-speed real-time channel through the study of a parallel turbo decoding algorithm based on 3GPP-proposed turbo encoder and interleaver in various channel. Simulation re-sult shows that, by choosing an appropriate sub-block length, the time delay can be obviously shortened with-out degrading the performance and increasing hardware complexity, and furthermore indicates the applicability of Turbo codes in high-speed real-time channel.