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

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

一种改进的Turbo codes译码方法

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

Turbo Codes的抗远近效应性能分析

一种崭新的信道编码技术ＴｕｒｂｏＣｏｄｅｓ（ＴＣ）以其优越的纠错性能很快在通信领域得到实际应用。本文讨论了这一技术在ＣＤＭＡ系统中的应用。由于采用了这种前向差错控制（ＦＥＣ）信道编码技术，使得ＣＤＭＡ系统具有了较好的抗远近效应性能。

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.

Turbo-codes与卷积码在异步DS-CDMA中的性能比较

本文讨论了turbo-codes在异步DS-CDMA系统中的应用。比较了码速率为R=1/2,约束长度为K=5,生成多项式为(37,21)的turbo-codes与R=1/3,K=9,生成多项式为(557,663,711)的卷积码在多径衰落信道下使用非相干M-ary正交调制时的性能。提出了一种在CDMA系统中turbo-codes译码器如何计算分支转移概率的方法。结果表明如果整个系统使用相同扩频增益,则使用turbo-codes(与卷积码相比)可提高系统容量。

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.

Performance analysis of Turbo-Codes in communication channels with impulsive noise

Performance of Turbo-Codes in communication channels with impulsive noise is analyzed. First, mathematical model of impulsive noise is presented because it has non-Gaussian nature and is found in many wireless channels due to impulsive phenomena of radio-frequency interference. Then, with linear Log-MAP decoding algorithm for its low complexity, Turbo-Codes are adopted and analyzed in such communication channels. To confirm the performance of the proposed method, simulations on both static and fully interleaved flat Rayleigh fading channels with impulsive noise have been carried out. It is shown that Turbo-Codes have a better performance than the conventional methods （e.g. convolutionally coded system）.

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.

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.

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.

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.

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.

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.

On Cross-Layer Design of AMC Based on Rate Compatible Punctured Turbo Codes

This paper extends the work on cross-layer design which combines adaptive modulation and coding at the physical layer and hybrid automatic repeat request protocol at the data link layer. By contrast with previous works on this topic, the present development and the performance analysis as well, is based on rate compatible punctured turbo codes. Rate compatibility provides incremental redundancy in transmission of parity bits for error correction at the data link layer. Turbo coding and iterative decoding gives lower packet error rate values in low signal-to-noise ratio regions of the adaptive modulation and coding (AMC) schemes. Thus, the applied cross-layer design results in AMC schemes can achieve better spectral efficiency than convolutional one while it retains the QoS requirements at the application layer. Numerical results in terms of spectral efficiency for both turbo and convolutional rate compatible punctured codes are presented. For a more comprehensive presentation, the performance of rate compatible LDPC is contrasted with turbo case as well as the performance complexity is discussed for each of the above codes.

Data Combination over Physical Layer Using Network Coding with PUM Turbo Codes

The Base Station (BS) or access point is the building block of wireless networks, so, we propose exploiting it together with the Network Coding (NC) principle. NC suffers from the complexity of the decoding processes, i.e., complicated Jordan Gaussian Elimination (JGE) processes. So, this paper proposes a deterministic NC algorithm to reduce the number of sequential network decoding steps, and hence minimizing the complexity of JGE process resulting to better time delay and processing time. We propose an algorithm that combines higher number of the transmitted packets resulting to better data-rate but worse Bet Error Rate (BER). However, using such strong Forward error correction channel code, which is Partial Unit Memory Turbo Code (PUMTC) results to minimize the losses in the BER to a very acceptable lever, in fact, in Decode-and-Forward (DF) BS, the BER can be regarded as minimum. Simulation results, for both Amplify-and-Forward (AF) and DF BS schemes using PUMTC based on (8, 4, 3, 8) component codes, confirm that using PUMTC mitigates the problem of noise aggregation resulting from applying NC in the proposed schemes.

Turbo Codes―A New PCCC Design

Coding techniques have always been a major area of scientific interest. Due to this interest, many coding schemes were invented. Eventually, their implementation in various systems contributed in the evolvement of Wireless Communications. A breakthrough was definitely Turbo coding. Particularly, the concept of joining two or more convolutional encoders in parallel (PCCC) or in serial (SCCC), along with the iterative decoding technique, literally raised the expectations of the anticipated BER performance. In fact, Concatenated Convolutional Codes clearly outperform convolutional codes. Moreover, various systems, either under development or either for future use, will have high standards. The previous systems should present exceptional tolerance of noise effects and consequently a low overall number of received errors. For this purpose a new PCCC design was developed. The system’s performance analysis, using an AWGN channel, showed better results for various iterations compared to other schemes such as typical PCCC, SCCC and finally a Convolutional encoder with a Viterbi decoder.

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.

一种MFSK信号的软解调Turbo译码算法

为了提高短波通信中多进制频移键控(Multiple Frequency Shift Keying,MFSK)信号的传输性能,提出了一种适用于MFSK信号的软解调Turbo译码算法。利用快速傅里叶变换(Fast Fourier Transform,FFT)计算MFSK调制频率对应的信号幅值,并结合增强型Turbo码结构,编码时将MFSK信号调制频率与Turbo编码状态形成映射关系,译码时利用软解调信号幅值直接计算对数分支度量,减少了比特似然信息计算的误差。仿真结果表明,相比于常规软比特解调译码算法,所提算法提高了MFSK信号软解调Turbo译码算法的误比特率(Bit Error Rate,BER)性能。