Multilayer turbo space-time codes

This letter describes a multilayer turbo space-time coding scheme. Based on a carefully designed power allocation strategy, performance reasonably close to the theoretical limits can be achieved at a rate of two bits per channel use with very low complexity.     

Full rate space-time turbo codes

This paper proposes a class of full space diversity full rate space-time turbo codes. Both parallel concatenated and serially concatenated codes are designed. A rank theory proposed by the authors earlier is employed to check the full space diversity of the codes. The simulations show that the space-time turbo codes can take full advantage of space diversity and time diversity if they are available in the channels. We also study the robustness of performance of both turbo codes and trellis codes in space-time correlated fading channels     

Assembled space-time turbo trellis codes

A novel full rate space-time turbo trellis code, referred to as an assembled space-time turbo trellis code (ASTTTC), is presented in this paper. For this scheme, input information binary sequences are first encoded using two parallel concatenated convolutional encoders. The encoder outputs are split into four parallel streams and each of them is modulated by a QPSK modulator. The modulated symbols are assembled by a predefined linear function rather than punctured as in the standard schemes. This results in a lower code rate and a higher coding gain over time-varying fading channels. An extended two-dimensional (2-D) log-MAP (maximum a posteriori probability) decoding algorithm, which simultaneously calculates two a posteriori probabilities (APP), is developed to decode the proposed scheme. Simulation results show that, under the same conditions, the proposed code considerably outperforms the conventional space-time turbo codes over time-varying fading channels.     

Enhanced space-time block coded systems by concatenating turbo product codes

The BER performance of a turbo product code (TPC) based space-time block coding (STBC) wireless system has been investigated. With the proposed system, both the good error correcting capability of TPC and the concurrent large diversity gain characteristic of STBC can be achieved. The BER upper bound has been derived taking BPSK modulation as an example. The simulation results show that the proposed system with the concatenated codes outperforms the one with only TPC or STBC and other reported schemes that concatenate STBC with convolutional Turbo codes or trellis codes.     

Differential detection of turbo codes for Rayleigh fast-fadingchannels

The performance of turbo codes using differentially detected quadrature phase-shift keying (QPSK) signals transmitted over Rayleigh fast-fading channels is investigated. So far in the open technical literature dealing with turbo codes only slow fading has been considered. Our research has shown that the use of a simple differential detector in conjunction with turbo codes can generally outperform convolutional codes in terms of the bit-and block-error rates for fading rates with a BT product up to 0.1. However, to achieve significant performance improvements, large block sizes must be employed, particularly at slower fading rates     

基于空时分组编码的差分检测方法

利用正交设计原理提出了通用的差分空时分组码(GDSTBC，general differential space-time block code)。与已有的差分调制方法相比，GDSTBC对信号星图无任何限制，因而可利用幅度和相位同时携带信息提高频谱效率。基于最大似然准则，给出了平坦。Rayleigh衰落信道下的非相干译码器。我们将证明：在高信噪比下，GDSTBC能够以线性复杂度和满天线分集恢复数据符号；在PSK调制方式下，没有信道估计时性能下降3dB；Ganesan基于PSK星图的差分空时分组码、Xia基于APSK星图的差分空时调制技术都可看成GDSTBC的特例。     

Doubly iterative decoding of space-time turbo codes with a large number of antennas

We examine the performance of a reduced-complexity doubly iterative decoder for space-time turbo codes on a quasi-static fading channel. The decoder works by using preliminary soft values of the coded symbols, obtained after a limited number of turbo iterations, to reduce the spatial interference from the received signal. Then, new turbo iterations are performed to improve on the quality of the soft values, and so on. Using a number of approximations, we obtain a receiver interface that achieves a good tradeoff between performance and complexity, and allows the use of turbo space-time codes for a large number of transmit and receive antennas.     

Symbol-based turbo codes

We present a new turbo-coding method which parses the input block into n-bit symbols and interleaves on a symbol-by-symbol basis. This is used in conjunction with different modulation techniques to take advantage of tradeoffs between bit error rate performance, code-rate, spectral efficiency, and decoder complexity. The structure of the encoder and decoder of these codes, which We call symbol-based turbo codes, are outlined. The bit error rate performance of a few specific codes are examined. A discussion on decoder complexity is also included. Symbol-based turbo codes are good candidates for low delay transmission of speech and data in spread spectrum communication systems     

Time-varying turbo codes

Turbo codes typically utilize time-invariant component codes whose total encoder memory is no greater than 4. In this letter, turbo codes with time-varying component codes are studied via EXIT analysis, distance spectrum analysis and simulation. Turbo codes with time-varying component codes and memory 6 are shown to have similar performance in the waterfall region and superior performance in the error floor region when compared to both the original memory 4 Berrou turbo code and the memory 8 big numerator-little denominator turbo codes.     

Nonsystematic turbo codes

In this paper, we introduce the concept of nonsystematic turbo codes and compare them with classical systematic turbo codes. Nonsystematic turbo codes can achieve lower error floors than systematic turbo codes because of their superior effective free distance properties. Moreover, they can achieve comparable performance in the waterfall region if the nonsystematic constituent encoder has a low-weight feedforward inverse. A uniform interleaver analysis is used to show that rate R=1/3 turbo codes using nonsystematic constituent encoders have larger effective free distances than when systematic constituent encoders are used. Also, mutual information-based transfer characteristics and extrinsic information transfer charts are used to show that rate R=1/3 turbo codes with nonsystematic constituent encoders having low-weight feedforward inverses achieve convergence thresholds comparable to those achieved with systematic constituent encoders. Catastrophic encoders, which do not possess a feedforward inverse, are shown to be capable of achieving low convergence thresholds by doping the code with a small fraction of systematic bits. Finally, we give tables of good nonsystematic turbo codes and present simulation results comparing the performance of systematic and nonsystematic turbo codes.     

Stream-oriented turbo codes

This work considers the design and performance of a stream-oriented approach to turbo codes which avoids the need for data framing. The stream paradigm applies to both serial and parallel turbo codes using continuous, free-running constituent encoders along with continuous, periodic interleavers. A stream-oriented turbo code based on parallel concatenated convolutional codes (PCCC) is considered and interleaver design criteria are developed for both block and nonblock periodic interleavers. Specifically, several nonblock interleavers, including convolutional interleavers, are considered. Interleaver design rules are verified using simulations where it is shown that nonblock interleavers with small-to-moderate delay and small synchronization ambiguity can outperform block interleavers of comparable delay. For large-delay designs, nonblock interleavers are found which perform within 0.8 dB of the capacity limit with a synchronization ambiguity of N=11     

Power allocation and code construction for space-time turbo trellis codes with partial CSI feedback

Conventional space-time turbo trellis coding (STTuTC) schemes allocate transmit power equally to the available antennas. This is not optimal if channel state information (CSI) is available at the transmitter. A STTuTC scheme is considered with partial CSI knowledge that optimally allocates power to the transmit antennas. This scheme is referred to as STTuTC with dynamic transmit power allocation (STTuTC/DTPA). The optimum four-state constituent code and power allocation are presented. Simulation results show that the STTuTC/DTPA scheme with the new code outperforms conventional STTuTC schemes.     

Khatri-Rao space-time codes

Space-time (ST) coding techniques exploit the spatial diversity afforded by multiple transmit and receive antennas to achieve reliable transmission in scattering-rich environments. ST block codes are capable of realizing full diversity and spatial coding gains at relatively low rates; ST trellis codes can achieve better rate-diversity tradeoffs at the cost of high complexity. On the other hand, V-BLAST supports high rates but has no built-in spatial coding and does not work well with fewer receive than transmit antennas. We propose a novel linear block coding scheme based on the Khatri-Rao matrix product. The proposed scheme offers flexibility for achieving full-rate or full-diversity, or a desired rate-diversity tradeoff, and it can handle any transmit/receive antenna configuration or signal constellation. The proposed codes are shown to have numerous desirable properties, including guaranteed unique linear decodability, built-in blind channel identifiability, and efficient near-maximum likelihood decoding.     

Distance-based-decoding of block turbo codes

List-based algorithms for. decoding block turbo Codes (BTC) have gained popularity due to their low computational complexity. The normal way to calculate the soft outputs involves searching for a decision code word D and a competing codeword B. In addition, a scaling factor /spl alpha/ and an estimated reliability value /spl beta/ are used. In this letter, we present a new approach that does not require /spl alpha/ and /spl beta/. Soft outputs are generated based on the Euclidean distance property of decision code words. By using the new algorithm, we achieve better error performance with even less complexity-for certain BTCs.     

Analysis of three-dimensional turbo codes

Our paper presents a detailed study of the three-dimensional turbo code (3D TC). This code which combines both parallel and serial concatenation is derived from the classical TC by concatenating a rate-1 post-encoder at its output. The 3D TC provides very low error rates for a wide range of block lengths and coding rates, at the expense of an increase in complexity and a loss in convergence. This paper deals with the performance improvement of the 3D TC. First, we optimize the distance spectrum of the 3D TC by means of the adoption of a non regular post-encoding pattern. This allows us to increase the minimum hamming distance (MHD) and thereby to improve the performance at very low error rates. Then, we propose a time varying construction of the post-encoded parity in order to reduce the observable loss of convergence at high error rates. Performance comparisons are made between the 3GPP2 standardized TC and the corresponding 3D code. The different improvement stages are illustrated with simulation results, asymptotical bounds, and EXIT charts.     

Performance of hybrid turbo codes

The authors present the latest results on turbo codes which are built from a serial concatenation between a block code (BCH) and a recursive systematic convolutional code. The performance on a Gaussian channel with QPSK modulation is evaluated     

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     

VLSI architectures for turbo codes

A great interest has been gained in recent years by a new error-correcting code technique, known as “turbo coding”, which has been proven to offer performance closer to the Shannon's limit than traditional concatenated codes. In this paper, several very large scale integration (VLSI) architectures suitable for turbo decoder implementation are proposed and compared in terms of complexity and performance; the impact on the VLSI complexity of system parameters like the state number, number of iterations, and code rate are evaluated for the different solutions. The results of this architectural study have then been exploited for the design of a specific decoder, implementing a serial concatenation scheme with 2/3 and 3/4 codes; the designed circuit occupies 35 mm², supports a 2 Mb/s data rate, and for a bit error probability of 10^-6, yields a coding gain larger than 7 dB, with ten iterations     

Concatenated parity and turbo codes

Turbo codes have an error floor that is caused by low-weight error events. Here, it is shown that a concatenated code with a simple rectangular parity-check outer code and a turbo inner code can significantly reduce the error floor. It is also shown that in several situations, the concatenated parity-check and turbo code performs significantly better than a turbo code alone