The effects of time-delay spread on unequalized TCM in a portableradio environment

This paper studies the effects of time-delay spread on trellis-coded modulation (TCM) in portable radio channels, where equalization is not employed to mitigate frequency-selective fading. The average irreducible bit error rate (BER) of three different TCM schemes are analytically formulated first and then numerically evaluated by simulation. The results for a delay spread lower than 0.2 of the symbol period indicate that the performance of TCM schemes with interleaving/deinterleaving is much better than that of QPSK, and better TCM schemes for flat fading also give better performance under low delay spread. Analytical results indicate that a good TCM scheme in frequency-selective fading channels should have both a large Euclidean distance and a high degree of built-in time diversity. If higher time-delay spread is encountered, TCM does not have advantages over QPSK. We also compare TCM performance with and without diversity. It is found that diversity greatly improves the performance under low delay spread, while the diversity gain quickly diminishes as the RMS delay spread approaches 0.2 of the symbol period     

Effects of time delay spread on constantpower constant-symbol-rate adaptive qam

Average throughput and bit error rate (BER) are derived for constant-power adaptive quadrature amplitude modulation over frequency selective fading channels corrupted by ISI and Gaussian noise. Effects of time delay spread on average throughput are studied under different BER constraints. Results show that useful performance can be achieved without diversity or equalisation     

Error performance of MPSK trellis-coded modulation overnonindependent Rician fading channels

This paper presents new upper bounds on the pairwise error probability (PEP) of trellis-coded modulation (TCM) schemes over nonindependent Rician fading channels. Cases considered are coherent and pilot-tone-aided detection and differential detection of trellis-coded multilevel phase-shift keying (TC-MPSK) systems. The average bit-error probability P_b can be approximated by truncating the union bound. This method does not necessarily lead to an upper bound on P_b, and, hence, the approximation must be used with simulation results. In addition, for Rayleigh fading channels with an exponential autocovariance function, bounds resembling those for memoryless channels have been derived. The bounds are substantially more accurate than Chernoff bounds and hence allow for accurate estimation of system performance when the assumption of ideal interleaving is relaxed     

Multiple trellis coded frequency and phase modulation

Multiple trellis coded modulation of constant envelope frequency and phase modulated signal sets (MTCM/FPM) is investigated for performance on the additive white Gaussian noise (AWGN) channel and on the one-sided normal, Rayleigh and Rician fading channels. The Nakagami- m fading model is used as an alternative to the Rician fading model to calculate the error probability upper bound for trellis-coded schemes on the fading channel. The likeliness and the disparity between the upper bounds to the error probability for the two fading models are discussed. The design criteria for the one-sided normal fading channel, modeled by the Nakagami-m distribution, are observed to be the same as those for the Rayleigh-fading channel. For the MTCM/FPM schemes, it is demonstrated that the set partitioning designed to maximize symbol diversity (optimum for fading channels) is optimum for performance on the AWGN channel as well. The MTCM/FPM schemes demonstrate improved performance over MTCM/MPSK schemes and TCM/FPM schemes on the AWGN channel and the fading channel     

On the performance of error control coding with diversity formobile channels

Upper bounds on the bit error probability are applied to evaluate the error performance of coded systems over non-interleaved and partially interleaved Rician fading mobile channels. The correlation between successive received symbols is exploited to bound the error performance. The bound allows useful evaluation of coding gains on realistic communication systems without going into lengthy computer simulations. By further defining the maximum energy degradation factors, compact upper bounds are expressed in a similar way as on the fully interleaved or memoryless channels. The maximum energy degradation factors are computed for a wide variety of mobile channel conditions. These factors give an interesting evaluation of the fading conditions and may be used to design coded communication systems on mobile channels. Furthermore, independent space or frequency diversity may be taken into account in these bounds and it is shown that the energy degradation due to correlation is independent of this added independent diversity     

A New Union Bound on the Error Probability of Binary Coded OFDM Systems in Wireless Environments

Orthogonal Frequency Division Multiplexing (OFDM) systems are commonly used to mitigate frequency-selective multipath fading and provide high-speed data transmission. In this paper, we derive new union bounds on the error probability of a coded OFDM system in wireless environments. In particular, we consider convolutionally coded OFDM systems employing single and multiple transmit antennas over correlated block fading (CBF) channels with perfect channel state information (CSI). Results show that the new union bound is tight to simulation results. In addition, the bound accurately captures the effect of the correlation between sub-carriers channels. It is shown that as the channel becomes more frequency-selective, the performance get better due to the increased frequency diversity. Moreover, the bound also captures the effect of multi-antenna as space diversity. The proposed bounds can be applied for coded OFDM systems employing different coding schemes over different channel models.     

Performance of binary FSK communications over frequency-selectiveRayleigh fading channels

The performance of binary frequency-shift-keyed communications over frequency-selective wide-sense-stationary uncorrelated-scattering Rayleigh fading channels is discussed. Previous analyses of FSK communications over frequency-selective channels have considered the average probability of error for specific models for the fading channel and typically assume that the two FSK signals are orthogonal. A technique for obtaining bounds on the average error probability for FSK in terms of one or two parameters obtainable from multipath spread or frequency correlation functions channel measurements is described     

Kalman filter‐based channel estimation and ICI suppression for high‐mobility OFDM systems

The use of orthogonal frequency division multiplexing (OFDM) in frequency‐selective fading environments has been well explored. However, OFDM is more prone to time‐selective fading compared with single‐carrier systems. Rapid time variations destroy the subcarrier orthogonality and introduce inter‐carrier interference (ICI). Besides this, obtaining reliable channel estimates for receiver equalization is a non‐trivial task in rapidly fading systems. Our work addresses the problem of channel estimation and ICI suppression by viewing the system as a state‐space model. The Kalman filter is employed to estimate the channel; this is followed by a time‐domain ICI mitigation filter that maximizes the signal‐to‐interference plus noise ratio (SINR) at the receiver. This method is seen to provide good estimation performance apart from significant SINR gain with low training overhead. Suitable bounds on the performance of the system are described; bit error rate (BER) performance over a time‐invariant Rayleigh fading channel serves as the lower bound, whereas BER performance over a doubly selective system with ICI as the dominant impairment provides the upper bound. Copyright © 2008 John Wiley & Sons, Ltd.     

A Cyclic Shift Relaying Scheme for Asynchronous Two-way Relay Networks

Perfect time synchronization among multiple relay nodes is quite difficult to realize in distributed relay networks. In this paper, we proposed a cyclic prefix (CP) assisted cyclic shift relaying (CFR) scheme for asynchronous two-way amplify-and-forward (AF) relay networks over flat fading channels. In the proposed scheme, a CP is inserted at the two source nodes to combat the asynchronous delays. Each relay amplifies the received mixed asynchronous signals after CP removal, and a cyclic delay is introduced to further improve the system performance. With the CP and the cyclic delay, the multiple flat fading relay channels are transformed into a multipath fading channel. As a result, low complexity frequency domain equalizers, such as zero-forcing and minimum mean square error (MMSE) equalizer, can be used to recover the transmit signal. Furthermore, the performance of the proposed CFR scheme with MMSE equalizer is analyzed and closed-form expression for the lower bound of uncoded bit error rate (BER) performance is derived. Based upon this lower bound, we also investigate the power allocation among the sources and the relays to improve the system performance. Finally, extensive numerical results are provided to show the BER and frame error rate performance of the proposed CFR scheme.     

Performance evaluation of spatially multiplexed MIMO systems with subset antenna transmission in interference limited environments

Transmit antenna selection in spatially multiplexed multiple-input multiple-output (MIMO) systems is a low complexity low-rate feedback technique, which involves transmission of a reduced number of streams from the maximum possible to improve the error rate performance of linear receivers. It has been shown to be effective in enhancing the performance of single-user interference-free point-to-point MIMO systems. However, performance of transmit antenna selection techniques in interference-limited environments and over frequency selective channels is less well understood. In this paper, we investigate the performance of transmit antenna selection in spatially multiplexed MIMO systems in the presence of co-channel interference. We propose a transmission technique for the downlink of a cellular MIMO system that employs transmit antenna selection to minimize the effect of co-channel interference from surrounding cells. Several transmit antenna selection algorithms are proposed and their performance is evaluated in both frequency flat and frequency selective channels. Various antenna selection algorithms proposed in the literature for single user MIMO links are extended to a cellular scenario, where each user experiences co-channel interference from the other cells (intercell interference) in the system. For frequency selective channels, we consider orthogonal frequency division multiplexing (OFDM) with MIMO. We propose a selection algorithm that maximizes the average output SINR over all subcarriers. A method to quantify selection gain in frequency selective channel is discussed. The effect of delay spread on the selection gain is studied by simulating practical fading environments with different delay spreads. The effect of the variable signal constellation sizes and the number of transmitted streams on the bit error rate (BER) performance of the proposed system is also investigated in conjunction with the transmit antenna selection. Simulation results show that for low to moderate interference power, significant improvement in the system performance is achievable with the use of transmit antenna selection algorithms. Even though the gain due to selection in frequency selective channels is reduced compared to that in flat fading channels due to the inherent frequency diversity, the performance improvement is significant when the system is interference limited. The performance improvement due to reduced number of transmit streams at larger signal constellation sizes is found to be more significant in spatially correlated scenarios, and the gain due to selection is found to be reduced with the increased delay spread. It is found that employing transmit antenna selection algorithms in conjunction with adaptation of the number of transmitted streams and the signal constellation sizes can significantly improve the performance of MIMO systems with co-channel interference.     

Performance bounds for space-time trellis codes

We derive the union bound for space-time trellis codes over quasi-static fading channels. We first observe that the standard approach for evaluating the union bound yields very loose, in fact divergent, bounds over the quasi-static fading channel. We then develop a method for obtaining a tight bound on the error probability. We derive the union bound by performing expurgation of the standard union bound. In addition, we limit the conditional union bound before averaging over the fading process. We demonstrate that this approach provides a tight bound on the error probability of space-time codes. The bounds can be used for the case when the fading coefficients among different transmit/receive antenna pairs are correlated as well. We present several examples of the bounds to illustrate their usefulness.     

Field test measurement for 128 kbit/s QPSK signal transmission and delay time spread in 1.5 GHz-band land mobile radio

High-speed digital signal transmission is a promising new field of communication services. In land mobile radio communication, transmission quality severely suffers from frequency selective fading under multipath radiowave transmission environments. Field test measurement results for 128 kbit/s QPSK signal transmission and delay time spread in the Tokyo metropolitan area are presented. The two-branch diversity reception method was adopted to combat fading. Bit error rate (BER) performance is obtained as a function of delay time spread.<>     

Pairwise error probability of space-time codes in frequency selective Rician channels

In this letter, we investigate the performance of space-time codes in frequency selective correlated Rician channels. An exact expression has been derived for the pairwise error probability (PEP) of space-time trellis codes over frequency selective Rician fading channel, which is in the form of a single finite range integral. We also obtain a closed form expression for the PEP when the signal matrices are drawn from some special design and the performance upper bound.     

Performance evaluation and analysis of space-time coding in unequalized multipath fading links

This paper investigates the use of space-time (ST) coding for high-speed data transmission, as well as studies the effect of time delay spread on such scheme over unequalized fading channels. Using a random variable decomposition technique, we present an analytical model and obtain an approximate bound of the pairwise-error probability for ST coded systems over multipath and time-dispersive fading channels. It is shown that the presence of multipath does not reduce the diversity gain provided by the original design criteria, which is adopted to construct specific ST codes in quasi-static flat fading, but the coding gain diminishes due to the effect of multipath fading.     

Exponential-type bounds on the generalized Marcum Q-function withapplication to error probability analysis over fading channels

Strict upper and lower bounds of exponential-type are derived for the generalized (mth order) Marcum Q-function which enable simple evaluation of a tight upper bound on the average bit-error probability performance of a wide class of noncoherent and differentially coherent communication systems operating over generalized fading channels. For the case of frequency selective fading with arbitrary statistics per independent fading path, the resulting upper hound on performance is expressed in the form of a product of moment generating functions of the instantaneous power random variables that characterize these paths     

Tight bounds on the error probability of coded modulation schemesin Rayleigh fading channels

This paper presents a tight upper bound on the bit error performance of coded modulation schemes in Rayleigh fading channels. Upper and lower bounds on the pairwise error probability are first derived. The upper bound is then expressed in a product form to be used with the transfer function bounding technique. This upper bound has the same simplicity as the union-Chernoff bound while providing closer results to the exact expression. Examples for the case of four-state and eight-state TCM 8PSK schemes are also given to illustrate the tightness and the application of this upper bound     

On the performance of peaky capacity-achieving signaling on multipath fading channels

We analyze the error probability of peaky signaling on bandlimited multipath fading channels, the signaling strategy that achieves the capacity of such channels in the limit of infinite bandwidth under an average power constraint. We first derive an upper bound for general fading, then specialize to the case of Rayleigh fading, where we obtain upper and lower bounds that are exponentially tight and, therefore, yield the reliability function. These bounds constitute a strong coding theorem for the channel, as they not only delimit the range of achievable rates, but also give us a relationship among the error probability, data rate, bandwidth, peakiness, and fading parameters, such as the coherence time. They can be used to compare peaky signaling systems to other large bandwidth systems over fading channels, such as ultra-wideband radio and wideband code-division multiple access. We find that the error probability decreases slowly with the bandwidth W; under Rayleigh fading, the error probability varies roughly as W/sup -/spl alpha//, where /spl alpha/>0. With parameters typical of indoor wireless situations, we study the behavior of the upper and lower bounds on the error probability and the reliability function numerically.     

Performance analysis of coded modulation with generalized selection combining in Rayleigh fading

We consider coded modulation with generalized selection combining (GSC) for bandwidth-efficient-coded modulation over Rayleigh fading channels. Our results show that reception diversity with generalized selection combining can conveniently trade off system complexity versus performance. We provide a number of new results by calculating the cutoff rate, and by deriving analytical upper bounds on symbol-interleaved trellis-coded modulation (TCM) and bit-interleaved-coded modulation (BICM) with GSC. All are verified by simulation. We show that our new bounds on TCM with GSC, which includes maximum ratio combining and selection combining as special cases, are tighter than the previously derived bounds. A new asymptotic analysis on the pairwise error probability, which can be used as a guideline for designing coded modulation over GSC channels, is also given. Finally, we show that BICM with iterative decoding (BICM-ID) can achieve significant coding gain over conventional coded modulation in a multiple-receiving-antenna channel.     

On improved bounds on the decoding error probability of block codesover interleaved fading channels, with applications to turbo-like codes

We derive here improved upper bounds on the decoding error probability of block codes which are transmitted over fully interleaved Rician fading channels, coherently detected and maximum-likelihood (ML) decoded. We assume that the fading coefficients during each symbol are statistically independent (due to a perfect channel interleaver), and that perfect estimates of these fading coefficients are provided to the receiver. The improved upper bounds on the block and bit error probabilities are derived for fully interleaved fading channels with various orders of space diversity, and are found by generalizing some previously introduced upper bounds for the binary-input additive white Gaussian nose (AWGN) channel. The advantage of these bounds over the ubiquitous union bound is demonstrated for some ensembles of turbo codes and low-density parity-check (LDPC) codes, and it is especially pronounced in a portion of the rate region exceeding the cutoff rate. Our generalization of the Duman and Salehi bound (Duman and Salehi 1998, Duman 1998) which is based on certain variations of Gallager's (1965) bounding technique, is demonstrated to be the tightest reported upper bound. We therefore apply it to calculate numerically upper bounds on the thresholds of some ensembles of turbo-like codes, referring to the optimal ML decoding. For certain ensembles of uniformly interleaved turbo codes, the upper bounds derived here also indicate good match with computer simulation results of efficient iterative decoding algorithms     

Bayesian techniques for equalization of rapidly fading frequency selective channels

This paper applies the Bayesian conditional decision feedback estimator (BCDFE) to rapidly fading frequency selective channels. The BCDFE is a model-based deconvolution algorithm which jointly estimates the transmitted data and channel parameters. The BCDFE smoothly transitions between trained and blind operation and consequently provides robust performance in rapidly fading channels. We provide a brief derivation of the BCDFE and characterize the performance on the land mobile radio channel. We assess the BCDFE's principle design characteristics and the resulting performance in both transient and steady-state operation. The effects of delay spread, Doppler spread, and cochannel interference on the bit error probability performance are also presented. The BCDFE demonstrates many of the desirable characteristics of an equalizer for mobile radio.