Performance of parallel and serial concatenated codes on fading channels

The performance of parallel and serial concatenated codes on frequency-nonselective fading channels is considered. The analytical average upper bounds of the code performance over Rician channels with independent fading are derived. Furthermore, the log-likelihood ratios and extrinsic information for maximum a posteriori (MAP) probability and soft-output Viterbi algorithm (SOVA) decoding methods on fading channels are developed. The derived upper bounds are evaluated and compared to the simulated bit-error rates over independent fading channels. The performance of parallel and serial codes with MAP and SOVA iterative decoding methods, with and without channel state information, is evaluated by simulation over independent and correlated fading channels. It is shown that, on correlated fading channels, the serial concatenated codes perform better than parallel concatenated codes. Furthermore, it has been demonstrated that the SOVA decoder has almost the same performance as the MAP decoder if ideal channel state information is used on correlated Rayleigh fading channels.     

Metric of TCM decoder robust to error propagation indecision-feedback equaliser for fading ISI channels

When TCM is used in frequency selective fading channels. A simple receiver can be used that consists of a decision-feedback equaliser, deinterleaver, and decoder. In this receiver, error propagation of the decision-feedback equaliser significantly degrades the TCM system performance. A metric calculation scheme of TCM decoder robust to error propagation in decision-feedback equalisers is proposed. Computer simulation shows the usefulness of the proposed scheme     

Concatenated coding with inner trellis codes for fading channels

It is known that concatenated coding can significantly enhance the performance of digital communication systems operating over fading channels when compared to uncoded or single-coded systems. The price to be paid for such an improvement, however, is a substantial increase in the required bandwidth. In this paper, we consider the use of a concatenation scheme in which the inner code is a trellis-coded modulation (TCM) system. The analysis is carried out for two different outer codes: a binary Golay code and a non-binary Reed-Solomon code. Results obtained for the Rayleigh and Rician fading channels through analytical bounds indicate that the use of this system does provide a significant reduction in the bit error probability, a fact that is also verified through computer simulation. Unlike a traditional concatenated system, the proposed method achieves the coding gain while maintaining acceptable bandwidth efficiency.     

Trellis-coded dpsk with multiple-symbol viterbi decoding over mobile satellite channel at K and L bands

Mobile satellite communication systems at K_a/K band (30/20 GHz) are attractive because of their large bandwidth availability and potentiality to support smaller earth-stations and satellite antennas compared with L-band (1·6/1·5 GHz) systems. In this paper, multiple-symbol Viterbi decoding and dual-space equal-gain diversity reception for trellis-coded differential M-ary phase-shift-keying (DPSK) modulation are investigated as two mitigation techniques for severe channel impairments expected from a land mobile satellite communication channel at K band and, for comparison purposes, at L band. The multiple-symbol Viterbi decoder (MSVD) is a modified Viterbi decoder with inputs from multiple differential detectors. The channel is modelled as Rayleigh distributed multipath fading with a lognormally distributed line-of-sight (LOS) component due to shadowing. Four trellis-coded modulation (TCM) schemes are studied. The dependency of the system performance improvement on the decoder structure, the TCM scheme, and the system RF frequency band is presented.     

Concatenated space-time block coding with trellis coded modulation in fading channels

Trellis coded modulation (TCM) is a bandwidth efficient transmission scheme that can achieve high coding gain by integrating coding and modulation. This paper presents an analytical expression for the error event probability of concatenated space-time block coding with TCM which reveals some dominant factors affecting the system performance over slow fading channels when perfect interleavers are used. This leads to establishing the design criteria for constructing the optimal trellis codes of such a concatenated system over slow flat fading channels. Through simulation, significant performance improvement is shown to be obtained by concatenating the interleaved streams of these codes with space-time block codes over fading channels. Simulation results also demonstrate that these trellis codes have better error performance than traditional codes designed for single-antenna Gaussian or fading channels. Performance results over quasi-static fading channels without interleaving are also compared in this paper. Furthermore, it is shown that concatenated space-time block coding with TCM (with/without interleaving) outperforms space-time trellis codes under the same spectral efficiency, trellis complexity, and signal constellation.     

DSD (double soft decision) concatenated FEC scheme in mobilesatellite communication systems

In order to realize a higher-code-gain forward error correction scheme in mobile satellite communication systems, a novel concatenated coding scheme employing soft decision decoding for not only inner codes but also outer codes (double soft decision, or DSD, concatenated forward error correction scheme) is proposed. Soft-decision outer decoding can improve the bit error probability of inner decoded data. In this scheme, likelihood information from an inner Viterbi decoder is used in the decoding of outer codes. A technique using the path memory circuit status 1.0 ratio for likelihood information is proposed, and is shown to be the most reliable even though it requires the simplest hardware among the alternative methods. A computer simulation clarifies that the DSD scheme improves Pe performance to one-third of that of the conventional hard-decision outer decoding. Moreover, to reduce the interleaving delay time in fading channels or inner decoded data of concatenated codes, a parallel forward error correction scheme is proposed     

On the performance of rate 1/2 convolutional codes with QPSK onRician fading channels

Consideration is given to the bit error probability performance of rate 1/2 convolutional codes in conjunction with quaternary phase shift keying (QPSK) modulation and maximum-likelihood Viterbi decoding on fully interleaved Rician fading channels. Applying the generating function union bounding approach, an asymptotically tight analytic upper bound on the bit error probability performance is developed under the assumption of using the Viterbi decoder with perfect fading amplitude measurement. Bit error probability performance of constraint length K=3-7 codes with QPSK is numerically evaluated using the developed bound. Tightness of the bound is examined by means of computer simulation. The influence of perfect amplitude measurement on the performance of the Viterbi decoder is observed. A performance comparison with rate 1/2 codes with binary phase shift keying (BPSK) is provided     

一种M-FSK信号的能量度量Viterbi软译码算法性能分析

Viterbi译码算法广泛应用于无线数字通信系统,一般采用比特对数似然信息(LLR)作为译码器的输入。针对M-FSK信号,该文提出一种采用信号解调得到的M维能量信息,直接作为译码器分支度量值,并给出了相应的Viterbi译码算法。在加性高斯白噪声(AWGN)和瑞利(Rayleigh)衰落信道下对所提算法的BER性能进行了理论推导,得到了闭合表达式。通过仿真验证了理论推导的正确性,与常规Viterbi算法相比,所提算法避免了比特LLR和分支度量值的计算,降低了算法复杂度和减少了信息损失,提高了M-FSK信号软解调Viterbi译码算法的BER性能,是一种更适用于工程实现的M-FSK信号的Viterbi译码算法。     

Modification of branch metric calculation to improve iterative SOVA decoding of turbo codes

It is known that the performance of a SOVA (soft output Viterbi algorithm) turbo decoder can be improved, as the extrinsic information that is produced at its output is over-optimistic. A new parameter associated with the branch metrics calculation in the standard Viterbi algorithm is introduced that affects the turbo code performance. Different parameter values show a simulation improvement in the AWGN channel as well as in an uncorrelated Rayleigh fading channel. By choosing the best value of this parameter, a coding gain improvement of 0.25 dB at BER of 10/sup -5/ is achieved compared to existing schemes.     

A simple remedy for the exaggerated extrinsic information produced by the SOVA algorithm

In this paper, we propose a novel and simple approach for dealing with the exaggerated extrinsic information produced by the soft-output Viterbi algorithm (SOVA). The proposed remedy is based on mathematical analysis and it involves using two attenuators, one applied to the immediate output of the SOVA and another applied to the extrinsic information before it is passed to the other decoder (assuming iterative decoding). The use of these attenuators aims at reducing the inherent strong correlation between the intrinsic information (input to the SOVA) and extrinsic information (output of the SOVA). We examine the modified SOVA (MSOVA) on additive white Gaussian noise (AWGN) and flat fading channels for parallel concatenated codes (PCCs) and serial concatenated codes (SCCs). We show that the MSOVA provides substantial performance improvements over both channels. For example, it provides improvements of about 0.8 to 1.0 dB at P/sub b/ = 10/sup -5/ in AWGN, and about 1.4 to 2.0 dB at P/sub b/ = 10/sup -5/ on fading channels. We also show that there are cases where the MSOVA is superior to the a posteriori probability (APP) algorithm. With this motivation, we extend the proposed modification to the APP algorithm with favorable results. We demonstrate that the modified APP (MAPP) provides performance improvements between 0.3 to 0.6 dB at P/sub b/ = 10/sup -5/ relative to the APP. We lastly mention that the proposed modifications, while they provide considerable performance improvements, keep the complexity of these decoders almost the same, which is remarkable.     

A coded 16 QAM scheme for fast fading mobile radio channels

An adaptive Viterbi algorithm, derived from a dynamic estimate of the fading channel is used for the decoding of a convolutional coded 16 QAM system in a mobile environment. The estimates are obtained by a sequence of known pilot symbols embedded in the data stream, and perform compensation for Rayleigh fading. The likelihood criterion in the Viterbi decoder is also modified by these channel estimates through a metric weighting function. We demonstrate through computer simulations, that our new technique achieves a BER improvement of 7-10 dB at P_e =10^-3 in a fast flat Rayleigh fading environment compared to an uncoded system. The BER performance of our new technique in a co-channel interference (CCI) controlled environment is also studied, and the results show that it may achieve a 40% to 85% improvement in capacity over the standard modem scheme for the new US digital cellular system, π/4-QPSK     

Burst error statistics of simulated Viterbi decoded BPSK on fadingand scintillating channels

The author presents and analyzes burst error statistics of a soft-decision Viterbi decoder when the transmitted signal is encoded with the 313 (3, 1/2) or 31123 (5, 1/2) convolutional codes, modulated via coherent binary phase-shift keying (BPSK) for the additive white Gaussian noise (AWGN) channel, and subjected to slow and nonselective scintillation/fading modeled by the Nakagami-m distribution. These statistics were generated by Monte-Carlo simulations, and presented in terms of burst error length average and quantile (90 and 99%) statistics versus SNR (E_b/N₀) parameterized by the fading intensity parameter m. The results indicate how Viterbi decoder burst error statistics vary with the fading/scintillation intensity m for Nakagami-m channels, and, consequently, provide information important to the design of interleaved or noninterleaved concatenated coding schemes for such channel environments     

Super-orthogonal differential space-time trellis coding and decoding

In this paper, a differential space-time trellis-coded scheme based on super-orthogonal space-time trellis codes (SOSTTCs) is proposed. It achieves full diversity and provides an improved coding gain. Based on the per-survivor processing (PSP) technique, a low-complexity suboptimal differential decoder is developed. In slow fading channels, it can approach the performance of SOSTTC with coherent decoding. Furthermore, in time-varying channels, a bank of recursive least square (RLS) type channel predictors are incorporated into the Viterbi decoder to track the channel variance and the RLS predictors do not need training data and channel statistics. The performance analysis is given. Simulation results are presented to illustrate our analytical results and they show that our scheme can achieve a good performance in both slow fading and time-varying fading channels with modest complexity.     

Combining PSA fading estimation techniques for TCM and diversity reception in Rician fading channels

In this paper, a novel pilot‐symbol‐aided (PSA) technique is proposed for fading estimation in the land mobile satellite fading channels. The proposed technique combines the fading estimates obtained from a bandwidth‐efficient technique and a conventional technique according to the signal‐to‐noise ratios (SNRs) of the fading estimates. To enhance the transmission quality, trellis‐coded modulation (TCM) and diversity reception are employed in the system, and the combined estimates are subsequently used to correct the channel fading effects, to weight the signals from different diversity branches, and to provide channel state information to the Viterbi decoder. Monte Carlo computer simulation has been used to study the bit‐error‐rate (BER) performance of the proposed technique on trellis‐coded 16‐ary quadrature amplitude modulation in the frequency non‐selective Rician fading channels. Results have shown that the proposed PSA technique requires a very low bandwidth redundancy to provide satisfactory BER performance at low SNRs, and thus is suitable for use with TCM and diversity reception to achieve both bandwidth and power‐efficient transmission. Copyright © 2002 John Wiley & Sons, Ltd.     

A New Concatenated Coding SystemUsing Multilevel Inner Codes

ＡＮｅｗＣｏｎｃａｔｅｎａｔｅｄＣｏｄｉｎｇＳｙｓｔｅｍＵｓｉｎｇＭｕｌｔｉｌｅｖｅｌＩｎｎｅｒＣｏｄｅｓＷａｎｇＤｕａｎｙｉＡＮＤＹｕｅＧｕａｎｇｘｉｎ（ＤｅｐａｒｔｍｅｎｔｏｆＴｅｌｅｃｏｍｍｕｎｉｃａｔｉｏｎＥｎｇｉｎｅｅｒｉｎｇ，Ｂｅｉｊｉｎ...     

Performance analysis of Viterbi decoder using channel stateinformation in COFDM system

This paper relates to the application method of channel state information (CSI) to the Viterbi (maximum likelihood) decoder in the digital terrestrial television broadcasting system. The proposed Viterbi decoder uses the CSI derived from the pilots inserted in the transmitter of the COFDM (coded orthogonal frequency division multiplexing) system. The CSI is calculated by interpolation using the pilots in the receiver. The active real (I) and imaginary (Q) data after equalization are transferred to the branch metric calculation block that decides the euclidean distance for soft decision decoding and also the estimated CSI values are transferred to the same block. After calculating the euclidean distance for the soft decision decoding, the euclidean distance of the branch metric is multiplied by CSI. To do so, new branch metric values that consider each carrier state information are obtained. We simulated this method in Rayleigh fading defined in the ETSI standard. From the simulation, this method has better performance of about 0.15 dB to 0.7 dB and 2.2 dB to 2.9 dB in the Rayleigh channel than that of conventional soft decision Viterbi decoding with or without a bit interleaver where the constellation is QPSK, l6-QAM and 64-QAM     

Concatenated coding schemes and interleaving techniques over Rayleigh fading ionospheric channels

In this paper the performance of a concatenated coding scheme is evaluated over a slow Rayleigh fading HF ionospheric link with additive white Gaussian noise (AWGN). Well‐known Ungerboeck TCM techniques onto an 8‐PSK signal set are used as inner codes and Reed–Solomon block codes as outer codes. The coded/modulated signal is further differentially encoded before transmission to combat random phase changes. Block interleaving techniques are necessary to randomise long bursts of errors caused by the fading channel. The performance of the proposed concatenated coding system is investigated for various Doppler spreads. Significant coding gains are achieved over uncoded, diversity or other conventionally coded systems with a small bandwidth expansion. Finally the interesting effects of interleaving on the behaviour of the proposed systems are analysed. Copyright © 2001 John Wiley & Sons, Ltd.     

Analysis and performance of bidirectional decoding of convolutionalcodes over fading channels

The performance of suboptimal convolutional decoding over fading channels is explored. The suboptimal decoding algorithm used is the bidirectional algorithm. By estimating a “decoder weight spectrum” for the decoder, an “equivalent free distance” may be observed. Furthermore, by using this “decoder weight spectrum”, useful estimations of the error probabilities are obtained and compared to computer-simulation results in the case of very slow and very fast fading. The resultant curves are shown to be very tightly related. Computer-simulation results are also shown for various signal-to-noise ratios, normalized Doppler spreads, and frame length on three typical fading channels: the Rayleigh fading channel with exponential and Bessel autocorrelation functions and the Rician fading channel with exponential autocorrelation function. We show that considerable gains (up to 4 dB) can be obtained with respect to a similar-complexity Viterbi decoder at a frame error probability P_e =10^-3 and a slightly smaller gain (up to 1.8 dB) at a bit error probability P_b=10^-5     

Performance bounds for trellis-coded modulation on time-dispersivechannels

The performance of trellis-coded modulation (TCM) on additive white Gaussian noise channels is well understood, and tight analytical bounds exist on the probability of the Viterbi decoder making a decision error. When a channel is also time-dispersive, the performance of TCM systems has been studied mainly by simulation. However, simulation is limited to symbol error probabilities greater than 10^-6 and is not a particularly useful tool for designing codes. Tight analytical bounds on the error probability of TCM on time-dispersive channels are required for a more thorough study of performance. Moreover, the design of good codes and optimum metrics for time-dispersive channels requires tight analytical bounds. In this paper we derive analytical upper bounds, which, although requiring numerical techniques for tractable evaluation, are tight for a wide range of time-dispersive channel conditions. The bounds are based on a union bound of error events that leads to a summation of pairwise error probabilities, which are themselves upper bounded     

Decoding of trellis-encoded signals in the presence of intersymbolinterference and noise

A novel receiver for data-transmission systems using trellis-coded modulation is investigated. It comprises a whitened-matched filter and a trellis decoder which combines the previously separated functions of equalization and trellis-coded modulation (TCM) decoding. TCM encoder, transmission channel, and whitened-matched filter are modeled by a single finite-state machine with combined intersymbol interference and code states. Using ISI-state truncation techniques and the set-partitioning principles inherent in TCM, a systematic method is then developed for reducing the state complexity of the corresponding ISI and code trellis. A modified branch metric is used for canceling those ISI terms which are not represented by the trellis states. The approach leads to a family of Viterbi decoders which offer a tradeoff between decoding complexity and performance. An adaptive version of the proposed receiver is discussed, and an efficient structure for reduced-state decoding is given. Simulation results are presented for channels with severe amplitude and phase distortion. It is shown that the proposed receiver achieves a significant gain in noise margin over a conventional receiver which uses separate linear equalization and TCM decoding