Deconstructing multiantenna fading channels

Accurate and tractable channel modeling is critical to realizing the full potential of antenna arrays in wireless communications. Current approaches represent two extremes: idealized statistical models representing a rich scattering environment and parameterized physical models that describe realistic scattering environments via the angles and gains associated with different propagation paths. However, simple rules that capture the effects of scattering characteristics on channel capacity and diversity are difficult to infer from existing models. We propose an intermediate virtual channel representation that captures the essence of physical modeling and provides a simple geometric interpretation of the scattering environment. The virtual representation corresponds to a fixed coordinate transformation via spatial basis functions defined by fixed virtual angles. We show that in an uncorrelated scattering environment, the elements of the channel matrix form a segment of a stationary process and that the virtual channel coefficients are approximately uncorrelated samples of the underlying spectral representation. For any scattering environment, the virtual channel matrix clearly reveals the two key factors affecting capacity: the number of parallel channels and the level of diversity. The concepts of spatial zooming and aliasing are introduced to provide a transparent interpretation of the effect of antenna spacing on channel statistics and capacity. Numerical results are presented to illustrate various aspects of the virtual framework.     

An adaptive multiantenna transceiver for slowly flat fading channels

The paper proposes an adaptive multiantenna transceiver for narrowband reception. Blind channel tracking algorithms are developed to track the eigen directions of the channel directly instead of the channel itself. Two algorithms are proposed to track the column space of the channel at the receiver, based on the received data. One of the algorithms is free of any division operation, which is more favorable in practice. For the row space of the channel, two approaches are proposed as well. The first approach requires periodic feedback of the demodulated signal from the receiver back to the transmitter where it can make use of its knowledge on the prior transmitted symbols to estimate the row space. In the second approach, the estimation is done at the receiver based on the detected symbols, and the estimated row space is sent back to the transmitter. Adaptive resource allocation is also incorporated into the design.     

The ALOHA systems in shadowed mobile radio channels with slow orfast fading

The influence of receiver capture on the performance of the ALOHA protocol in the presence of shadowing is investigated. The combined effect of Rayleigh fading, log-normal shadowing, and spatial distribution of mobile users is also studied. It is shown that shadowing is similar to fading and near/far phenomena, in that it makes the capture effect possible and provides ALOHA systems with substantial improvements in throughput. It is also confirmed that the superimposed Rayleigh fading, log-normal shadowing, and spatial distribution can further enhance the capture effect, resulting in a ALOHA system with higher throughput. The fast fading effect in ALOHA systems is explored. A very fast fading case is examined which may be considered to be equivalent to interleaving in slow fading. It is found that an ALOHA system under fast fading conditions also benefits from the capture results in higher throughput     

Optimizing the transmit power for slow fading channels

We consider the design of power-adaptive systems for minimizing the average bit-error rate over flat fading channels. Channel state information, obtained through estimation at the receiver, is sent to the transmitter over a feedback channel, where it is used to optimally adapt the transmit power. We consider finite-state optimal policies to reflect the limitations of the feedback channel. We develop an iterative algorithm that determines the optimal finite-state power control policy given the probability density function (PDF) of the fading. Next, we present a discretized formulation of the problem and obtain a suboptimal solution via standard dynamic programming techniques. The discretization of the problem enables us to obtain a suboptimal policy for arbitrary fading channels for which the analytic expression of the fading probability density function is not available. Simulation results are used to draw conclusions regarding the effects of limited feedback channel capacity, delay and number of states on the bit-error rate performance of the proposed policies under slow and moderate fading conditions     

Performance of M-ary PSK signals in slow Rayleigh fading channels

The error rate performance of M-ary coherent phase shift keyed signals and M-ary differential phase shift keyed signals in slow Rayleigh fading channels is analysed. Closed-form expressions for the symbol error rate are presented. The coherent PSK signals are 3 dB stronger than the differential PSK signals at high SNR for given M in a Rayleigh fading environment.<>     

Improved space-time convolutional codes for quasi-static slow fading channels

Space-time convolutional codes, that provide maximum diversity and coding gain, are produced for cases with PSK modulation and various numbers of states and antennas. The codes are found using a new approach introduced previously in a companion paper. The new approach provides an efficient method that allows a search for optimum codes for many practical problems. The new approach also provides a simple method for augmenting the criteria of maximum diversity and coding gain with a new measure which is shown to be extremely useful for evaluating code performance without extensive simulations. To validate the approach, an extensive set of simulation results are presented comparing the codes designed here to many other previously proposed space-time convolutional codes. The comparisons, given in terms of frame error rate (FER), indicate that our new method provides codes which yield excellent performance. The approach is especially useful for finding a handful of good codes. Selection among these codes can be made with a limited number of simulations for FER.     

适用于慢衰落信道的联合最大似然序列估计

为了克服移动通信中存在的多径衰落效应,基于Viterbi算法的最大似然序列估计需要不断跟踪信道参数的变化.在建立有限带宽信号的多径衰落信道传输模型的基础上,提出了一种适合于慢衰落信道特性的降阶联合信道跟踪与最大似然均衡算法D-PSP.该方法根据信道特性选择不同的降阶维数N,在保证数据正确接收率的条件下,不同程度的有效减小PSP算法的计算时间和存储空间.     

相关衰落下多天线 LS-CDMA信道容量

对相关多径信道下不同扩频地址码的多天线CDMA系统的信道容量进行了研究,在研究中分别采用了在多码检测和多用户检测联合检测算法.在多码检测的情况下,李道本教授发明的LS码多天线CDMA系统比Walsh码和Gold码的多天线系统有更大的系统容量,后两者在大的信噪比(20dB)时候均有平台效应;在采用多用户检测时它们的容量几乎相同.由于具有零相关窗特性,对于LS码而言这两种方法是等效的.当发射天线数目等于接收天线数目时,系统的容量和天线数目呈线性关系.     

Improved MUSIC algorithm for the code-timing estimation of DS-CDMA multipath-fading channels in multiantenna systems

A multiple-signal-classification (MUSIC) approach of estimating the code timings of a desired user is considered for direct-sequence code-division multiple-access (DS-CDMA) multipath-fading channels when exploiting multiple receive antennas with either spatially uncorrelated or fully correlated fading. The acquisition performance of the conventional MUSIC timing estimator employing a single antenna is not good for the small size of observation windows and low signal-to-noise ratios (SNRs). Multiple antennas allow for rapid acquisition and lowers the range of detectable SNR. An efficient and improved MUSIC algorithm of estimating the multipath timings of a desired user for DS-CDMA systems is presented. In multipath-fading channels, the solution of the proposed algorithm is based on successively optimizing the cost function for increasing numbers of multipath delays, which does not require a multidimensional search for multidelay paths. Furthermore, the estimate of code timing at each path is obtained by finding the zeros of second-order polynomials, which is computationally efficient. The proposed MUSIC algorithm significantly improves the acquisition performance of conventional MUSIC algorithm in the presence of multipath time-varying Rayleigh-fading channels with arbitrary time delays. The acquisition performance of multiple antennas-based MUSIC timing estimators is much better than that of a single-antenna-based timing estimator. The Crame/spl acute/r-Rao bound for the code-timing estimator based on multiple antennas is presented.     

LMMSE detection for DS-CDMA systems in fading channels

The linear minimum mean-squared-error (LMMSE) criterion can be used to obtain near-far resistant receivers in direct-sequence code-division multiple-access systems. The standard version of the LMMSE receiver (postcombining LMMSE) minimizes the mean-squared error between the filter output and the true transmitted data sequence. Since the detector depends on the channel coefficients of all users, it cannot be implemented adaptively in fading channels due to severe tracking problems. A modified criterion for deriving LMMSE receivers (precombining LMMSE) in fading channels is presented. The precombining LMMSE receiver is independent of the users' complex channel coefficients, and it effectively converts the time-varying Rayleigh fading channel to an equivalent fixed additive white Gaussian noise channel from the point of view of updating the detector. The performance of the LMMSE receivers in fading channels is studied via computer simulations and numerical analysis. The results show that the postcombining LMMSE receiver has potentially larger capacity, but it cannot be used in fast fading channels. The precombining LMMSE receiver has slightly worse capacity than the postcombining LMMSE receiver, but remarkably larger capacity than the conventional RAKE receiver at the signal-to-noise ratios of practical interest     

Variable-data-rate systems applicable to fading satellite channels

To maintain communication over fading satellite channels, either the transmission rate and system bandwidth have to be reduced or the equivalent isotropic radiated power (EIRP) of the satellite has to be increased. In the letter methods are proposed for changing the transmission rate without changing the filters, and the performance of these methods is evaluated.     

Performance of MIMO-BICM with parallel interference canceller on slow fading channels

The performance of a MIMO-BICM system with a convolutional code and an iterative PIC-DSC receiver is analysed with limit-before-averaging and average-before-summation bounding techniques. Good matching between the bound and the simulation and that the LBA bound is tighter than the ABS bound for a system with small antenna number is shown     

Performance of coded systems over fading dispersive channels

The authors consider a number of topics concerned with coding schemes over fading dispersive channels. They begin with comparing the performance of the energy receiver with the optimum and envelope receivers. Different coding schemes are used to improve the performance. The effect of channel spread on the performance of single-state Reed-Solomon (RS) codes is investigated. Channel information (CI) is discussed as a means for further improvement. The simple erasure criterion used is suboptimal, but gives a measure of the gain that can be achieved by using CI. Of special interest is the use of a concatenated coding technique for forming codes of large distance. Concatenated codes using short RS codes with CI as inner codes and RS outer codes are compared. It has been shown that the improvement obtained by concatenation is significant for overspread channels. This is attributed to the implicit diversity introduced by the channel. Furthermore, a concatenated system using convolutional codes as inner codes performs better than the system using RS inner codes     

Multiuser receivers for CDMA systems in Rayleigh fading channels

Multiuser demodulation in relatively fast fading channels is analyzed. The optimal maximum likelihood sequence detection (MLSD) receiver is derived and a general suboptimal receiver to approximate the MLSD is proposed. The performance of the parallel interference cancellation (PIC) and decorrelating receivers is compared. The PIC receiver is demonstrated to achieve better performance in known channels than the decorrelating receiver, but it is observed to be more sensitive to the channel coefficient estimation errors than the decorrelator. At high channel loads the PIC receiver suffers from bit error rate (BER) saturation, whereas the decorrelating receiver does not. The performance of data-aided (DA) and decision-directed (DD) multiuser channel estimation is also compared. DA channel estimation is shown to be more robust than DD channel estimation, which may suffer from BER saturation caused by hangups at high signal-to-noise ratios (SNRs). The impact of channel estimation filter impulse response on the BER is studied by comparing optimal and suboptimal channel estimation filters. The implementation complexity of the decorrelating and PIC receivers is compared in terms of required floating point operations and clock cycles in a practical communication scenario. It is observed that the PIC receiver is only moderately more complex to implement than the conventional matched filter bank receiver, whereas the decorrelating receiver is significantly more complex     

Decision-directed coherent detection in multicarrier systems onRayleigh fading channels

Novel coherent detectors for DQPSK and π/4-DQPSK on Rayleigh fading channels are presented. The detectors are based on decision feedback and minimum mean-square error (MMSE) channel estimation. The proposed detectors may be used in both single carrier and multicarrier systems. Analytical results in the form of expressions for channel estimation error variance and bit error probability, both with and without diversity, are derived. The MMSE-based detector has a significantly lower irreducible bit error probability floor compared to a conventional differential detector. For most practical applications, the error floor of the MMSE-based detector is negligible. Simulated results are presented to verify the analysis and justify the approximations made     

Analysis of time-frequency duality of MC and DS CDMA for multiantenna systems on highly time-varying and wide-band channels

Direct sequence (DS) and multicarrier (MC) are code-division multiple-access (CDMA) schemes based on single-carrier and MC modulations, respectively. While in DS CDMA, spreading is performed by increasing the transmission rate, or in the time domain, in MC CDMA, spreading is performed using several subcarriers, or in the frequency domain. In this paper, it is shown that MC and DS CDMA are time-frequency dual systems. Their analysis in time- and frequency-dispersive multiple-input multiple-output channels revealed that they can be described equally in terms of dual-channel functions, therefore exhibiting the same performance on dual channels. Furthermore, the duality property is used to derive matched filters for highly time-variant and wide-band channels. Finally, other issues involved in the comparison of DS and MC, namely spreading-sequence design and multiuser detection, are addressed.     

Latency and networking aspects of adaptive modems over slow indoorsRayleigh fading channels

Adaptive modulation exploits the time-variant channel capacity fluctuation of fading channels using a range of different modem modes. Specifically, no information is transmitted when the instantaneous channel signal-to-noise ratio (SNR) is low, and, hence, during this period the data must be buffered, which results in delay or latency, When the instantaneous channel quality improves, 2-, 4-, 16-, and 64-level modem modes are invoked, which allows the transmission buffer to be emptied. It is shown that channel capacity gains are achieved at the cost of some latency penalty. The latency is quantified in this treatise and mitigated by frequency hopping or statistical multiplexing. The latency is increased when either the mobile speed or the channel SNR are reduced, since both of these result in prolonged low instantaneous SNR intervals. It is demonstrated that as a result of the proposed measures, typically more than 4-dB SNR reduction is achieved by the proposed adaptive modems in comparison to the conventional benchmark modems employed     

Outage probability of diversity systems over generalized fading channels

Outage probability is an important performance measure of communication systems operating over fading channels. Relying on a simple and accurate algorithm for the numerical inversion of the Laplace transforms of cumulative distribution functions, we develop a moment generating function-based numerical technique for the outage probability evaluation of maximal-ratio combining (MRC) and postdetection equal-gain combining (EGC) in generalized fading channels for which the fading in each diversity path need not be independent, identically distributed, nor even distributed according to the same family of distributions. The method is then extended to coherent EGC but only for the case of Nakagami-m fading channels. The mathematical formalism is illustrated by applying the method to some selected numerical examples of interest showing the impact of the power delay profile and the fading correlation on the outage probability of MRC and EGC systems.     

Nakagami信道的中断容量分析

本文讨论了Nakagami-m衰落信道系统的中断容量性能,在发射端未知信道信息,接收端的信道估计存在误差时,给出了计算中断容量上界和下界的表达式,它们是接收端的估计误差和信道参数的函数,仿真结果表明随着估计误差的增大中断容量的上界和下界同时降低,但是中断容量的下界随着信道参数的增大而增大,上界随着信道参数的增大而减小。     

Optimum scheduling for smart antenna systems in Rayleigh fading channels

Optimum and suboptimum scheduling schemes are proposed in the uplink of array antenna systems. We assume that once a user is permitted to transmit the data, the user transmits the data using the maximum power, and adjusts the transmission bit rate so that the energy-per-bit-to-interference-plus-noise-density ratio should be equal or higher than a threshold. In this system model, we consider an optimization problem: How many and which users should be selected to transmit their data at a time in order to maximize the throughput? Based on the analysis on the complexity of the optimum scheme, we propose another optimum scheme having reduced complexity. To reduce the complexity further, we also propose three suboptimum scheduling schemes by limiting the number of users simultaneously transmitting, by choosing the users with higher channel gains, and by partitioning a cell into multiple parts. In circular and linear arrays, the performance results of all the proposed schemes are presented and compared.