Performance of space-time codes for a large number of antennas

We study the asymptotic behavior of space-time codes when the number of transmit and receive antennas grows to infinity. Specifically, we determine the behavior of pairwise error probabilities with maximum-likelihood (ML) decoding and with three types of receiver interfaces: the ML interface, the linear zero-forcing (ZF) interface, and the linear minimum-mean-square-error (MMSE) interface. Two situations are studied: when the number of receiving antennas grows to infinity while the number of transmitting antennas is finite, and when both numbers grow to infinity but their ratio remains constant. We show that with ML or linear interfaces the asymptotic performance of space-time codes is determined by the Euclidean distances between codewords. Moreover, with the two linear interfaces examined here the number r of receive antennas must be much larger than the number t of transmit antennas to avoid a sizeable loss of performance; on the other hand, when r ≫ t, the performance of these linear interfaces comes close to that of ML. The dependence of error probabilities on Euclidean distance is valid for intermediate signal-to-noise ratios (SNRs) even when the number of antennas is small. Simulations validate our theoretical findings, and show how asymptotic results may be substantially valid even in a nonasymptotic regime: thus, even for few antennas, off-the-shelf codes may outperform space-time codes designed ad hoc     

Automatic suppression of narrow-band interference indirect-sequence spread-spectrum systems

This paper addresses the problem of narrow-band interference (NBI) cancellation in direct-sequence spread-spectrum systems. The proposed procedure amounts to a preliminary nonlinear processing, wherein, upon projection of the received signal onto a Fourier basis, a number of samples having the largest modula are excluded from further processing. The structure of the optimum detector operating on censored observations is obtained, showing that the optimum detector performs matched filtering on the censored data. The performance assessment demonstrates that this receiver is able to suppress narrow-band interferers, no matter what their structure, provided that the censoring depth is properly chosen. A blind version of such a receiver is presented also, and a comparative performance assessment demonstrates that, unlike other suppression procedures, the proposed system allows suppression of NBI with no prior knowledge on its structure     

Design of reduced-rank MMSE multiuser detectors using random matrix methods

Reduced-rank minimum mean-squared error (MMSE) multiuser detectors using asymptotic weights have been shown to reduce receiver complexity while maintaining good performance in long-sequence code-division multiple-access (CDMA) systems. In this paper, we consider the design of reduced-rank MMSE receivers in a general framework which includes fading, single and multiantenna receivers, as well as direct-sequence CDMA (DS-CDMA) and multicarrier CDMA (both uplink and downlink). In all these cases, random matrix results are used to obtain explicit expressions for the asymptotic eigenvalue moments of the interference autocorrelation matrix and for the asymptotic weights used in the reduced-rank receiver.     

Multiple-antenna capacity in the low-power regime

This paper provides analytical characterizations of the impact on the multiple-antenna capacity of several important features that fall outside the standard multiple-antenna model, namely: (i) antenna correlation, (ii) Ricean factors, (iii) polarization diversity, and (iv) out-of-cell interference; all in the regime of low signal-to-noise ratio. The interplay of rate, bandwidth, and power is analyzed in the region of energy per bit close to its minimum value. The analysis yields practical design lessons for arbitrary number of antennas in the transmit and receive arrays.     

Time-varying narrow-band interference rejection in asynchronousmultiuser DS/CDMA systems over frequency-selective fading channels

In this paper, we handle the problem of joint suppression of multiple-access interference (MAI) and narrowband interference (NBI) in fading, dispersive channels. The detectors we consider are linear, one-shot structures, which allow for possible window enlargement and signal-space oversampling to improve performance. We focus on both zero-forcing and minimum-mean square-error design strategies, showing that the presence of NBI generally requires a time-varying processing of the observables, no matter what the optimization criterion. A thorough performance assessment of the proposed detectors is also presented, either through analytical formulas or through computer simulations. We finally deal with the problem of blind suppression of both MAI and NBI, introducing batch-estimation procedures to be implemented offline, which require very little and sometimes no prior knowledge as to the interference structure     

Partially blind adaptive MMSE interference rejection inasynchronous DS/CDMA networks over frequency-selective fading channels

In this work, the problem of joint suppression of multiple-access and narrow-band interference (NBI) for an asynchronous direct-sequence code-division multiple-access (CDMA) system operating on a frequency-selective fading channel is addressed. The receiver structure we consider can be deemed as a two-stage one: the first stage consists of a bank of minimum mean-square-error (MMSE) filters, each keyed to a given replica of the useful signal, and aimed at suppressing the overall interference; the second stage, assuming knowledge of the fading channel coefficients realizations, combines the MMSE filters outputs according to a maximal-ratio combining rule. Due to the presence of the NBI, the resulting structure is in general time-varying, and becomes periodically time-varying if the NBI bit-rate has a rational ratio to that of the CDMA system. Moreover, enlarging the observation window beyond the signaling interval and oversampling the signal space may yield a noticeable performance improvement. For the relevant case that the said ratio is rational, a new cyclic blind recursive least squares (RLS)-based algorithm is introduced, capable of tracking the periodically time-varying receiver structure, and allowing adaptive interference cancellation with a moderate complexity increase. We also come up with a closed-form expression for the conditional bit-error rate (BER), which is useful both to evaluate semi-analytical methods to assess the unconditional BER and to derive bounds on the system near-far resistance. The results indicate that the receiver achieves very satisfactory performance in comparison to previously known structures. Computer simulations also demonstrate that the cyclic blind RLS algorithm exhibits quite fast convergence dynamics     

A generalized minimum-mean-output-energy strategy for CDMA systemswith improper MAI

It has been shown that in a direct-sequence/code-division multiple-access (DS/CDMA) system employing binary phase-shift keying (BPSK) modulation the baseband equivalent of the CDMA multiplex is, under very mild assumptions, an improper complex random process, i.e., it has a nonzero pseudoautocorrelation function. The problem of linear multiuser detection for asynchronous DS/CDMA systems with improper multiaccess interference (MAI) is considered. A new mean-output-energy (MOE) cost function is introduced, whose constrained minimization leads to two new linear multiuser detectors, exploiting the information contained in the pseudoautocorrelation of the observables, and which generalize the classical decorrelating and minimum mean-square error (MMSE) receivers. The problem of blind adaptive receiver implementation based on subspace tracking is also tackled. Finally, the superiority of the new detectors with respect to the classical linear detection structures present in the literature is demonstrated through both theoretical considerations and computer simulations     

Spectral efficiency of multicarrier CDMA

We analyze the spectral efficiency (sum-rate per subcarrier) of randomly spread synchronous multicarrier code-division multiple access (MC-CDMA) subject to frequency-selective fading in the asymptotic regime of number of users and bandwidth going to infinity with a constant ratio. Both uplink and downlink are considered, either conditioned on the subcarrier fading coefficients (for nonergodic channels) or unconditioned thereon (for ergodic channels). The following receivers are analyzed: a) jointly optimum receiver, b) linear minimum mean-square error (MMSE) receiver, c) decorrelator, and d) single-user matched filter.     

Designing space-time codes for large number of receiving antennas

It is shown that when the number of receiving antennas is large, space-time codes designed under a Euclidean-distance criterion are also good for quasi-static Rayleigh fading channels     

Impact of antenna correlation on the capacity of multiantenna channels

This paper applies random matrix theory to obtain analytical characterizations of the capacity of correlated multiantenna channels. The analysis is not restricted to the popular separable correlation model, but rather it embraces a more general representation that subsumes most of the channel models that have been treated in the literature. For arbitrary signal-to-noise ratios (SNR), the characterization is conducted in the regime of large numbers of antennas. For the low- and high-SNR regions, in turn, we uncover compact capacity expansions that are valid for arbitrary numbers of antennas and that shed insight on how antenna correlation impacts the tradeoffs among power, bandwidth, and rate.