Performance of trellis-coded modulation for equalized multipathfading ISI channels

The performance of TCM on equalized multipath fading ISI channels with different equalization schemes is examined. Trellis codes that are effective for AWGN channels and flat fading channels with interleaving are evaluated for equalized multipath fading channels. For joint MLSE equalization and decoding the equivalent uncoded system outperforms all the trellis-coded systems that are examined. Trellis codes that are designed for flat fading channels with interleaving perform well if interleaving is used and an MLSE equalizer is used before deinterleaving. An effective interleaver-deinterleaver is identified that allows joint DDFSE equalization and decoding to be used without the need for equalization before decoding     

采用预判决信息的LDPC码编码调制方案性能研究

低密度奇偶校验(LDPC)码是Turbo码以外另一种性能接近香农限的好码.本文将LDPC码与比特交织编码调制(BICM)相结合,首先给出了在不使用传统解调器与译码器之间迭代的情况下8PSK调制方案在AWGN信道和Rayleigh衰落信道中的性能(简称为无迭代方案).然后提出了一种新的接收端解决方案:首先对接收符号进行预判决,判决信息被用来调整解调器,从而在一定程度上弥补了不使用解调器与译码器之间迭代所造成的性能损失,并且相对于无迭代方案接收端复杂度几乎没有变化,但性能却有所提高.这说明原有比特度量产生方法并不是最佳的,该文使用预判决信息的方案给出了一个改善的思路.通过仿真结果可以得到结论:使用本文所提出的方案在AWGN信道和Rayleigh衰落信道中都可以在不增加复杂度的情况下提高性能.     

Performance comparison of different decoding strategies for abandwidth-efficient block-coded scheme on mobile radio channels

The performance of bandwidth-efficient Reed-Solomon (RS)-coded MPSK schemes is evaluated on a shadowed Rician fading channel using different decoding strategies, namely, errors-only, errors-and-erasures, and soft-decision decoding. The lower bounds of the bit error probability are found for errors-only and for errors-and-erasures decoding. For the soft-decision decoding the upper bound of the bit error rate is derived. The error bounds are calculated and examined by simulation for some RS-coded MPSK schemes on a shadowed Rician channel. It is shown that their performance is significantly improved compared to uncoded QPSK. The amount of improvement depends on the signal-to-noise ratio (SNR), the decoding strategy, and the degree of shadowing. A comparison between different decoding techniques, for one of the RS-coded schemes, for different degrees of shadowing shows that the use of channel measurement information in the decoding process is more effective for heavy shadowed channels     

Forward Error Correction Coding for Fading Compensation in Mobile Satellite Channels

Fading in mobile satellite communications severely degrades the performance of data transmission. The channel is modeled with nonfrequency selective Rice and Rayleigh fading. Also, stored channel simulation is used for hardware data transmission. FEC coding with Viterbi decoding of convolutional codes, and Berlekamp-Massey decoding of Reed-Solomon codes, are used to compensate for the fading. In addition to interleaving, channel state and erasure information improve the performance of the decoder. The BER after decoding is calculated for specific codes on several channels and for different transmission schemes. Using very simple channel state and erasure information gives 2-7 dB additional coding gain. These gains have been verified by hardware data transmission on synthetic fading channels and stored mobile satellite channels.     

频率选择性衰落下一种基于迭代干扰抵消的空时分组码译码算法

针对频率选择性衰落下空时分组码的正交性由于多径干扰而遭到严重破坏,提出一种基于迭代干扰抵消的最大似然序列估计(MLSE)译码方案;并结合最大比合并方法对所提方案进行改进和提高,以进一步降低计算复杂度。这些方案能很好地弥补通常空时分组码在频率选择性衰落下译码时的不足,它们不仅能抵消正交性没有破坏的在偶次项上的多径干扰,还能抵消正交性受到破坏的在奇次项上的多径干扰;有着非常好的性能。而且与直接对长序列信号进行MLSE译码相比,有着非常低的译码复杂度;从而以低复杂度实现了较好的空时分组码译码性能。     

衰落信道下多级编码方案的软判决译码

研究Rayleigh衰落信道下,软判决译码对三种不同映射方案多级编码系统性能的影响.基于信道容量规则,构造卷积码为分量码的8ASK多级编码系统,在多阶段译码中提出利用信道状态信息的软判决支路度量计算公式,并探讨系统的误码传播特性,研究结果可为衰落信道编码调制方案的最佳设计度量提供参考.     

Performance of truncated type-II hybrid ARQ schemes with noisyfeedback over block fading channels

This paper considers truncated type-II hybrid automatic repeat-request (ARQ) schemes with noisy feedback over block fading channels. With these ARQ techniques, the number of retransmissions is limited, and, similar to forward error correction (FEC), error-free delivery of data packets cannot be guaranteed. Bounds on the average number of transmissions, the average coding rate as well as the reliability of the schemes are derived using random coding techniques, and the performance is compared with FEC. The random coding bounds reveal the achievable performance with block codes and maximum-likelihood soft-decision decoding. Union upper bounds and simulation results show that over block fading channels, these bounds can be closely approached with simple terminated convolutional codes and soft-decision Viterbi decoding. Truncated type-II hybrid ARQ and the corresponding FEC schemes have the same probability of packet erasure; however, the truncated ARQ schemes offer a trade-off between the average coding rate and the probability of undetected error. Truncated ARQ schemes have significantly higher average coding rates than FEC at high and medium signal-to-noise ratio even with noisy feedback. Truncated ARQ can be viewed as adaptive FEC that adapts to the instantaneous channel conditions     

Multilevel coded CPFSK systems for AWGN and fading channels

In this paper, we introduce multilevel coded continuous-phase frequency-shift keying (CPFSK) systems for both additive white Gaussian noise and fading channels based on multilevel coding and multistage decoding techniques. These schemes are designed under the constraint M⩾2P for M-ary CPFSK with modulation index J/P. In order to maintain the phase continuity property after multilevel coding, we use some specific set partitioning rules. We construct examples to show that the proposed systems outperform the corresponding conventional one-level schemes. For the fading case, we consider an ideal fading channel where adjacent fading symbols are assumed to be independent and a correlated fading channel where bit interleavers are needed at each coding level. The computer simulation results show that the proposed systems have bit-error performance and decoder complexity advantages over the corresponding reference codes taken from the literature. It is also shown that there is only a slight degradation on the bit-error performance for correlated fading, compared to the ideal fading case     

Nakagami衰落信道中差分空时分组码误比特率分析

研究差分空时分组码在Nakagami衰落信道下的性能.在介绍2发1收差分空时分组码编译码方案的基础上,得出Nakagami信道下差分空时分组码的误比特率.仿真结果与理论计算值一致,证明了所推导误比特率计算表达式的正确性.     

Serial Concatenation of Space‐Time and Recursive Convolutional Codes

We propose a new serial concatenation scheme for space‐time and recursive convolutional codes, in which a space‐time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi‐static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.     

Performance analysis of orthogonal space-time block codes in spatially correlated MIMO Nakagami fading channels

Orthogonal space-time block coding (STBC) is an open-loop transmit diversity scheme that decouples the multiple-input multiple-output (MIMO) channel, thereby reducing the space-time decoding into a scalar detection process. This characteristic of STBC makes it a powerful tool, achieving full diversity over MIMO fading channels, and requiring little computational cost for both the encoding and decoding processes. In this paper, we exploit the single-input single-output equivalency of STBC in order to analyze its performance over nonselective Nakagami fading channels in the presence of spatial fading correlation. More specifically, we derive exact closed-form expressions for the outage probability and ergodic capacity of STBC, when the latter is employed over spatially correlated MIMO Nakagami fading channels. Moreover, we derive the exact symbol error probability of coherent M-PSK and M-QAM, when these modulation schemes are used along with STBC over such fading channels. The derived formulae are then used to assess the robustness of STBC to spatial correlation by considering general MIMO correlation models and analyzing their effects on the outage probability, ergodic capacity, and symbol error probability achieved by STBC.     

Approaching the Outage Probability of the Amplify-and-Forward Relay Fading Channel

We study coding techniques for the single-relay non-orthogonal amplify-and-forward half-duplex relay fading channel. Unlike the multiple-antenna case, we show that 2times2 rotations induce large gains in outage probability with no increase in decoding complexity under iterative probabilistic decoding. We compare rotated and unrotated turbo-coded schemes and show that they both perform close to their corresponding outage limits.     

Erased-Chase decoding for RS-coded MPSK signaling over a Rayleigh fading channel

In this paper, a novel dual-metric, the maximum and minimum Squared Euclidean Distance Increment （SEDI） Brought by changing the hard decision symbol, is introduced to measure the reliability of the received M-ary Phase Shift Keying （MPSK） symbols over a Rayleigh fading channel. Based on the dual-metric, a Chase-type soft decoding algorithm, which is called erased-Chase algorithm, is developed for Reed-Solomon （RS） coded MPSK schemes. The proposed algorithm treats the unreliable symbols with small maximum SEDI as erasures, and tests the non-erased unreliable symbols with small minimum SEDI as the Chase-2 algorithm does. By introducing optimality test into the decoding procedure, much more reduction in the decoding complexity can be achieved. Simulation results of the RS（63, 42, 22）-coded 8-PSK scheme over a Rayleigh fading channel show that the proposed algorithm provides a very efficient tradeoff between the decoding complexity and the error performance. Finally, an adaptive scheme for the number of erasures is introduced into the decoding algorithm.     

Correction of extrinsic information for iterative decoding in a serially concatenated multiuser DS-CDMA system

The system under study is a coded asynchronous DS-CDMA system with orthogonal modulation in time-varying Rayleigh fading multipath channels. Information bits are convolutionally encoded, block interleaved, and mapped to M-ary orthogonal Walsh codes, where the last step is essentially a process of block coding. This paper aims at tackling the problem of joint iterative decoding of this serially concatenated inner block code and outer convolutional code and estimating frequency-selective fading channels in multiuser environments. The (logarithm) maximum a posteriori probability, (Log)-MAP criterion is used to derive the iterative decoding schemes. In our system, the soft output from inner block decoder is used as a priori information for the outer decoder. The soft output from outer convolutional decoder is used for two purposes. First, it may be fed back to the inner decoder as extrinsic information for the systematic bits of the Walsh codeword. Secondly, it is utilized for channel estimation and multiuser detection (MUD). We also show that the inner decoding can be accomplished without extrinsic information, and in some cases, e.g., when the system is heavily loaded, yields better performance than the decoding with unprocessed extrinsic information. This implies the need for correcting the extrinsic information obtained from outer decoder. Different schemes are examined and compared numerically, and it is shown that iterative decoding with properly corrected extrinsic information or with non-extrinsic/extrinsic adaptation enables the system to operate reliably in the presence of severe multiuser interference, especially when the inner decoding is assisted by decision directed channel estimation and interference cancellation techniques.     

一种高效的联合编码调制分集——迭代接收方案

本文研究了加入迭代解调译码的比特交织编码调制方案,并通过联合编码调制分集扩展此方案。BICM-ID通过信号空间分集增加分集数,并选择最优旋转角度使性能上进一步取得了明显增益。     

MAP decoding of convolutional codes using reciprocal dual codes

A new symbol-by-symbol maximum a posteriori (MAP) decoding algorithm for high-rate convolutional codes using reciprocal dual convolutional codes is presented. The advantage of this approach is a reduction of the computational complexity since the number of codewords to consider is decreased for codes of rate greater than 1/2. The discussed algorithms fulfil all requirements for iterative (“turbo”) decoding schemes. Simulation results are presented for high-rate parallel concatenated convolutional codes (“turbo” codes) using an AWGN channel or a perfectly interleaved Rayleigh fading channel. It is shown that iterative decoding of high-rate codes results in high-gain, moderate-complexity coding     

Multiaccess fading channels. II. Delay-limited capacities

For pt.I see ibid., vol.44, no.7, p.2796-815 (1998). In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the time-varying nature of the environment. We consider the problem of optimal resource allocation from an information-theoretic point of view. We focus on the multiaccess fading channel with Gaussian noise, and define two notions of capacity depending on whether the traffic is delay-sensitive or not. In the present paper, we introduce a notion of delay-limited capacity which is the maximum rate achievable with delay independent of how slow the fading is. We characterize the delay-limited capacity region of the multiaccess fading channel and the associated optimal resource allocation schemes. We show that successive decoding is optimal, and the optimal decoding order and power allocation can be found explicitly as a function of the fading states; this is a consequence of an underlying polymatroid structure that we exploit     

BEM-based SISO detection of orthogonal space-time block codes over frequency flat-fading channels

The expectation-maximization algorithm for maximum a posteriori (MAP) estimation of a random vector is applied to the problem of detection of orthogonal space-time block codes over time-selective Rayleigh fading channels. This results in a soft-in soft-out detection algorithm suitable for iterative detection/decoding schemes. Simulation results show that the error performance of the proposed detection algorithm is very close to that of a MAP detector endowed with an ideal knowledge of the channel state if the fading rate is not too fast.     

Analysis and optimization of wavelet-coded communication systems

Since its advent, wavelet coding has been recognized as a promising technique for wireless transmission systems, especially due to its low decoding complexity and good performance over multipath fading. However, this technique requires unusual modulation schemes in order to be fully exploited. A BER analysis of wavelet-coded transmission systems over Rayleigh fading channels is presented in this work. This analysis is used in the design of novel signal constellations for wavelet-coded systems by means of numerical performance optimization. Numerical results obtained from analysis and simulations show that the wavelet-coded systems derived herein have very good performance characteristics over fading channels.     

Modulation and coding for mobile radio communications: channelswith correlated Rice fading and Doppler frequency shift

We discuss the relative performance of coherent phase-shift keying (PSK), differential PSK (DPSK), and double differential PSK (DDPSK) modulation schemes over a mobile radio channel in which transmission is affected by additive noise, a constant carrier phase offset, a constant Doppler frequency shift, and correlated Rice fading. We first compare the performance of these schemes to assess the amount of degradation caused on each one of them by fading. Among our findings, we observe that DDPSK turns out to be less sensitive to the effects of correlated fading than the other two schemes and that in these conditions interleaving may not be beneficial. We then consider the introduction of trellis-coded modulation (TCM). The system we advocate as offering the best tradeoff between performance and complexity with the channel model assumed here includes double-differential encoding, differential detection, an open-loop Doppler phase tracking circuit, and differential decoding in addition to a simple TCM scheme