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.

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.

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

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.

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

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.

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.

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.

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

Understanding turbo codes: A signal processing study

In this paper,we study turbo codes from the digital signal processing point of view by defining turbo codes over the complex field.It is known that iterative decoding and interleaving between concatenated parallel codes are two key elements that make turbo codes perform significantly better than the conventional error control codes.This is analytically illustrated in this paper.We show that the decoded noise mean power in the iterative decoding decreases when the number of iterations increases,as long as the interleaving decorrelates the noise after each iterative decoding step.An analytic decreasing rate and the limit of the decoded noise mean power are given.The limit of the decoded noise mean power of the iterative decoding of a turbo code with two parallel codes with their rates less than 1/2 is one third of the noise power before the decoding,which can not be achieved by any non-turbo codes with the same rate.From this study,the role of designing a good interleaver can also be clearly seen.

Parallel Implementation of the CCSDS Turbo Decoder on GPU

This paper presents a software turbo decoder on graphics processing units(GPU).Unlike previous works,the proposed decoding architecture for turbo codes mainly focuses on the Consultative Committee for Space Data Systems(CCSDS)standard.However,the information frame lengths of the CCSDS turbo codes are not suitable for flexible sub-frame parallelism design.To mitigate this issue,we propose a padding method that inserts several bits before the information frame header.To obtain low-latency performance and high resource utilization,two-level intra-frame parallelisms and an efficient data structure are considered.The presented Max-Log-Map decoder can be adopted to decode the Long Term Evolution(LTE)turbo codes with only small modifications.The proposed CCSDS turbo decoder at 10 iterations on NVIDIA RTX3070 achieves about 150 Mbps and 50Mbps throughputs for the code rates 1/6 and 1/2,respectively.

Research on the transmission performance of turbo codes in DDO-OFDM system

A direct detection optical orthogonal frequency division multiplexing(DDO-OFDM)system using turbo codes is built,and the transmission performance comparison between coded system and uncoded system is analyzed.Three decoding algorithms,which are Log-maximum a posteriori(MAP),Max-Log-MAP and threshold Max-Log-MAP,are used in the turbo coded system.By comparing three decoding algorithms,the system using Max-Log-MAP algorithm has the best bit error rate(BER)performance.At the transmission distance of 240 km,the uncoded system with transmission rate of 30 Gbit/s can get the BER performance at the degree of 8.93×10-3 with optical signal to noise ratio(OSNR)of24 d B,while the turbo coded system with transmission rate of 50 Gbit/s can achieve it within OSNR of 20 d B.

Improving the Structure of Multiple Dimension Turbo Codes Using Multiple Identical Component Encoders

In this paper,we propose an improved structure for M-dimension ( M ≥ 2)turbo codes using M identical component encoders. The presented structure only applies single recursive convolutional encoder to encode M interleaved versions of infor-mation sequence and single tail sequence to operate termination. For the commonly used two-dimension (M = 2) turbo codes,two cascade soft input soft output (SISO) decoders are detailed to de-code the corresponding codes. With the two cascade SISO decod-ers,this coding structure obviously outperforms traditional turbo codes at high code rates,especially,about 0.3 dB gain can be ob-tained at code rate 0.9 in additive white Gaussian noise channel with quadrature phase shift keying modulation. This makes the proposed coding structure very attractive for future radio commu-nication systems with high throughput requirements.

HIHO Decoding Algorithms of Turbo Product Codes for High Rate Optical Communications

This paper presents a new Hard-Input Hard-Output (HIHO) iterative decoding algorithm for Turbo Product Codes (TPC), and especially describes the BCH-TPC codes aiming to alleviate error propagation and lower error floor. This algorithm mainly emp hasizes a decision mechanism for bit-flips, which thoroughly evaluates four different aspects of the decoding process, properly weighs and combines their respective reliability measures, and then employs the combined measure to make a judgment with regard to whether any particular bit should be flipped or not. Simulations result in a very steep Bit Error Rate (BER) curve indicating that a high-level net coding gain can be expected with a reasonable complexity. The simplicity and effectiveness of this HIHO decoding algorithm makes it a p romising candidate for the application in future high-speed fiber optical communications.

Performance analysis of coded OFDM systems using a novel class of LDPC codes

A new method of constructing regular low-density parity-check (LDPC) codes was proposed. And the novel class of LDPC codes was applied in a coded orthogonal frequency division multiplexing (OFDM) system. This method extended the class of LDPC codes which could be constructed from shifted identity matrices. The method could avoid short cycles in Tanner graphs with simple inequation in the construction of shifting identity matrices, which made the girth of Tanner graphs 8. Because of the quasicyclic structure and the inherent block configuration of parity-check matrices, the encoders and the decoders were practically feasible. They were linear-time encodable and decodable. The LDPC codes proposed had various code rates, ranging from low to high. They performed excellently with iterative decoding and demonstrate better performance than other regular LDPC codes in OFDM systems.

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-TCM Performance under AWGN and Rayleigh Fading Channels

A simple algorithm for Turbo TCM decoding was given in this paper. With this algorithm, Turbo TCM can easily be used to real systems with various code rates and modulations of QPSK, 8PSK, 16QAM or 64QAM. The bit error ratio performance was studied under AWGN and fading channels. The simulation results were also given in this paper.

APPLICATION OF NEURAL NETWORK INVERSE CONTROL SYSTEM IN TURBO DECODING

Adaptive inverse control system can improve the performance of turbo decoding,and modeling turbo decoder is one of the most important technologies. A neural network model for the inverse model of turbo decoding is proposed in this paper. Compared with linear filter with its revi-sion,the general relationship between the input and output of the inverse model of turbo decoding system can be established exactly by Nonlinear Auto-Regressive eXogeneous input (NARX) filter. Combined with linear inverse system,it has simpler structure and costs less computation,thus can satisfy the demand of real-time turbo decoding. Simulation results show that neural network in-verse control system can improve the performance of turbo decoding further than other linear con-trol system.