Single Convolutional Code Research Articles

Performance analysis of concatenated BCH and convolutional coded OFDM system

ABSTRACT Orthogonal Frequency Division Multiplexing (OFDM) is a widely used technique for wireless communications. But uncoded OFDM is not sufficient by itself, that is why channel coding is included to increase the system performance. In this study, concatenated Bose Chaudhuri Hocquenghem (BCH) and Convolutional Coded (CC) OFDM system is investigated for multipath fading channel with Additive White Gaussian Noise (AWGN). The simulation results show that the proposed concatenated code needs lower Signal-to-Noise Ratio (SNR) when compared with single BCH code, single convolutional code and even with other concatenated systems. Throughout the simulations BCH coding is performed with 128, 256, 512 Fast Fourier Transform (FFT) lengths; whereas convolutional coding is performed with 1/2, 1/3 coding rates. Furthermore, interleavers are added to the system to prevent the burst errors that occur over the channel. With the proposed system, the best result is obtained by using BCH(511,340) and CC(3,1,7) concatenation which is 8.2 dB SNR value for 10−3 Bit Error Rate (BER). This result is very close to ideal AWGN channel value, which is 8 dB for 10−3 BER.

Performance Evaluation of Concatenate Coding for Body Area Network Applications

In digital communications, since it is of importance that the receiving data is identical to the transmitted data, the error correcting code is one good solution to maintaining the information accuracy between the transmitter and the receiver. This research paper proposes the application of the error correcting code to Wireless Body Area Network (WBAN). The error correcting code in this research work is the concatenate code of the Reed-Solomon code (RS) and the convolutional code (CC). Information data in WBAN with the Rician channel condition is modulated with the Binary Phase Shift Keying (BPSK) scheme. In addition, the path loss of WBAN is examined. The Additive White Gaussian Noise (AWGN) and Rayleigh fading channels are employed for comparison purposes to illustrate the effects on bit error performance of different channel environments. The RS code is an outer code while the convolutional code an inner code. The findings show that the concatenate code performs better than the single codes, i.e. RS and CC. At BER 10-3, the concatenate code {RS(255,223)+CC(171,133)} is better than either RS(255,223) at 5dB or CC(171,133) at 1.5dB. If the inner code is changed to CC(7,5) at BER 10-3, the performance is reduced by approximately 0.6dB. Thus, the coding complexity can be tailored according to the desired error correcting capability.

Multidimensional Mappings for Iteratively Decoded BICM on Multiple-Antenna Channels

Multidimensional binary mappings for bit-interleaved coded modulations (BICMs) on ergodic multiple-antenna channels with iterative decoding are presented. After derivation of a closed-form expression for the pairwise error probability under ideal maximum-likelihood (ML) decoding, the design criterion for mapping optimization is established from the ML performance of the ideally interleaved channel. It coincides with the figure of merit derived from the genie condition when the iterative receiver converges to perfect a priori information. Multidimensional mapping constructions that exhibit high signal-to-noise ratio (SNR) gains without increasing the complexity of the a posteriori probability (APP) detection are proposed. They allow for a reduced decoding complexity as they achieve near turbo code performance with a single convolutional code.

Comparison of convolutional and turbo codes for OFDM with antenna diversity in high-bit-rate wireless applications

This letter presents simulation results for the application of turbo coding to an OFDM system with diversity. First, results are presented for convolutional and Reed-Solomon codes. It is shown that even with short constraint lengths, convolutional codes have the potential to outperform Reed-Solomon codes, provided that sufficient precision is used in the soft decoder. We then evaluate the performance of turbo codes under slow fading conditions and study the effects of varying codeword size. Increasing codeword size theoretically provides better interleaving between the two component codes. However, this advantage is less clear when the fading rate is significantly lower than the symbol rate, which is typical of the high-data-rate systems considered here. Under such conditions, the advantage of using two component convolutional codes in turbo codes is limited. A single convolutional code with a long constraint length may be a better choice.

Turbo decoding for partial response channels

The partial response channel can be viewed as a rate-1 encoder in which the output alphabet differs from the input alphabet. In serially concatenated coding schemes, the partial response channel can serve as the inner encoder. Previous work on the application of turbo decoding techniques to partial response channels has focused on using a parallel concatenation of convolutional encoders as the outer code and the partial response channel as the inner code. This system requires three a posteriori probability (APP) detectors-one matched to the channel and two matched to the constituent encoders. A simplified system is presented that uses as its outer code a single convolutional code and as its inner code the partial response channel. The simplified system requires only two APP detectors, offering significant savings in complexity and computation time. This single convolutional code system is shown to perform as well as the more complicated system, offering substantial gains over uncoded systems. Simulation results for three magnetic recording channel models are presented: a partial response channel with additive white Gaussian noise, an equalized Lorentzian channel model, and a media noise model called the microtrack model. Since the use of an outer Reed-Solomon code is anticipated in an actual system, the burst-error statistics are investigated. System performance with various interleaver designs and precoders is also investigated.

Turbo decoding for partial response channels using spinstand data

The partial response channel can be viewed as a rate-1 encoder in which the output alphabet differs from the input alphabet. In serially concatenated coding schemes, the partial response channel can serve as the inner encoder. Recent works on the application of turbo decoding techniques to partial response channels have used channel models to investigate system performance. While the models provided some insight into the performance of turbo decoding techniques, performance in a real system, with electronic and signal-dependent media noise, remained unknown. This paper will demonstrate the performance of turbo decoding techniques using real and modeled spinstand data. A simple serial concatenation system will be presented that uses as its outer code a single convolutional code and as its inner code the partial response channel. Significant gains will be shown over QMTR coded systems.

On turbo encodedBicm

The superior performance of the binary turbo codes has stimulated vigorous efforts in generating bandwidth efficient modulation schemes adhering to these codes. Several approaches for the integration of turbo-coding and modulation have emerged in recent years but none seem to dominate. In the bit interleaved coded modulation (Bicm) scheme is used to achieve high bandwidth and power efficiency, while separating coding and modulation. As is now well known, theBicm scheme achieves capacity remarkably close to the constellation channel capacity. The turbo-Bicm scheme enjoys high coding diversity (well suited for fading channels), high flexibility as well as design and implementation simplicity, while maintaining good power efficiency. The system comprises one standard turbo code, an interleaver, a mapper and a modulator at the transmitter, corresponding to a demodulator, a de-interleaver and a turbo decoder at the receiver. A modified system, which improves on performance by incorporating the demodulation in the iterative decoding procedure, is investigated, and some performance gain is demonstrated, especially for low rate codes. Information theoretic arguments for the somewhat minor potential improvement in performance are detailed. The preferred mapper and interleaver for this system are considered. Extending previous works, for higher level modulations, we analyze a system including a convolutional code, an interleaver, a differential encoder (De), a mapper and a modulator at the transmitter. As for theBpsk modulation, the serial concatenation of a convolutional code withDe outperforms the single convolutional code. The serial concatenation withDe approach is analyzed also for a turbo code, where it is found to fail in achieving performance improvement. Several structures for the serial concatenation withDe are examined. These results are substantiated through the ‘spectral thinning’ phenomena of the weight distribution of the convolutional and turbocodes.

P/sup 2/ codes: pragmatic trellis codes utilizing punctured convolutional codes

A single convolutional code of fixed rate can be punctured to form a class of higher rate convolutional codes. The authors extend this pragmatic approach to the case where the core of the trellis decoder is a Viterbi decoder for a punctured version of the de facto standard, rate 1/2 convolutional code. >