On beamforming with finite rate feedback in multiple-antenna systems

We study a multiple-antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t-1)2/sup -B/t-1/, where B is the number of feedback bits and t is the number of transmit antennas. The geometrical bounding technique, used in the proof of the lower bound, also leads to a design criterion for good beamformers, whose outage performance approaches the lower bound. The design criterion minimizes the maximum inner product between any two beamforming vectors in the beamformer codebook, and is equivalent to the problem of designing unitary space-time codes under certain conditions. Finally, we show that good beamformers are good packings of two-dimensional subspaces in a 2t-dimensional real Grassmannian manifold with chordal distance as the metric.     

Joint signaling strategies for approaching the capacity oftwisted-pair channels

A technique is presented for jointly optimizing the signaling in the two directions of transmission on a twisted-pair communications channel. It is then applied to twisted-pair channel models with monotonic channel response and crosstalk transfer functions. While the signaling strategy presented in this paper can achieve only a lower bound on the true channel capacity, it is a significant improvement over existing signaling schemes. In particular, in contrast with existing schemes, the maximum information rate for the joint signaling strategy increases without bound as the signal-to-noise ratio (SNR) approaches infinity. It is also shown through numerical results that the proposed signaling strategy generalizes naturally to more practical nonmonotonic twisted-pair channel models incorporating bridge taps and other nonidealities. Finally, the form of the optimal signaling strategy suggests a relatively straightforward implementation using multicarrier modulation     

Performance of DS/SSMA Communications in Impulsive Channels--Part I: Linear Correlation Receivers

The performance of digital linear correlation receivers is studied in a multiuser environment. There are assumed to be two types of sources interfering with data transmission: multiple-access interference, and additive channel noise which is attributed to impulsive noise sources in the environment. The contribution of multiple-access interference is examined by consideringKasynchronous users transmitting simultaneously over a linear channel using the binary PSK direct-sequence spreadspectrum multiple-access (DS/SSMA) technique. Alternatively, the effects of the non-Gaussian impulsive channel in such a system are studied by modeling the samples of noise after front-end filtering. Errorprobability performance under these conditions is compared to that for additive white Gaussian noise (AWGN) channels. Due to computational complexity, exact analysis is limited here to systems utilizing short spreading sequences. Computationally simple methods are proposed for approximating the average error probability when the length of the signature sequences is large. Furthermore, some asymptotic results are obtained for the case of infinitely long sequences. In all cases, performance variation is examined as the shape of the noise density varies with SNR held constant. The results of this analysis indicate that the presence of impulsive noise can cause significant performance degradation over that predicted from an AWGN model, even when the total noise power does not increase.     

User cooperation diversity. Part I. System description

Mobile users' data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial diversity, in which diversity gains are achieved via the cooperation of mobile users. Part I describes the user cooperation strategy, while Part II (see ibid., p.1939-48) focuses on implementation issues and performance analysis. Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.     

Finite memory-length linear multiuser detection for asynchronousCDMA communications

Decorrelating, linear, minimum mean-squared error (LMMSE), and noise-whitening multiuser detectors for code-division multiple-access systems (CDMA) are ideally infinite memory-length (referred to as IIR) detectors. To obtain practical detectors, which have low implementation complexity and are suitable for CDMA systems with time-variant system parameters (e.g., the number of users, the delays of users, and the signature waveforms), linear finite-memory-length (referred to as FIR) multiuser detectors are studied in this paper. They are obtained by truncating the IIR detectors or by finding optimal FIR detectors. The signature waveforms are not restricted to be time-invariant (periodic over symbol interval). Thus, linear multiuser detection is generalized to systems with spreading sequences longer than the symbol interval. Conditions for the stability of the truncated detectors are discussed. Stable truncated detectors are shown to be near-far resistant if the received powers are upper bounded, and if the memory length is large enough (but finite). Numerical examples demonstrate that moderate memory lengths are sufficient to obtain the performance of the IIR detectors even with a severe near-far problem     

Multistage detection in asynchronous code-division multiple-accesscommunications

A multiuser detection strategy for coherent demodulation in an asynchronous code-division multiple-access system is proposed and analyzed. The resulting detectors process the sufficient statistics by means of a multistage algorithm based on a scheme for annihilating successive multiple-access interference. An efficient real-time implementation of the multistage algorithm with a fixed decoding delay is obtained and shown to require a computational complexity per symbol which is linear in the number of users K. Hence, the multistage detector contrasts with the optimum demodulator, which is based on a dynamic programming algorithm, has a variable decoding delay, and has a software complexity per symbol that is exponential in K. An exact expression is obtained and used to compute the probability of error is obtained for the two-stage detector, showing that the two-stage receiver is particularly well suited for near-far situations, approaching performance of single-user communications as the interfering signals become stronger. The near-far problem is therefore alleviated. Significant performance gains over the conventional receiver are obtained even for relatively high-bandwidth-efficiency situations     

Spreading and power allocation for multiple antenna transmission using decorrelating receivers

We propose a new scheme for multiple antenna transmission in the context of spread-spectrum signaling. The new scheme consists of using shifted Gold sequences to modulate independent information on the multiple antennas. We show that this strategy of using multiphase spreading (MPS) on different antennas greatly improves the throughput over currently known spread-spectrum multiple-antenna methods. We also find the optimal power allocation strategy among multiple transmit antennas for a fixed rate of channel state information, which might be provided via a feedback link, at the transmitter. We demonstrate the differences in optimal power distribution for maximizing capacity and minimizing probability of outage. When the transmission from the two antennas uses orthogonal spreading, we find that optimizing the power does not give much gain over the equal power transmission. However, when the transmissions are not orthogonal as in the case of MPS, then allocating power to maximize throughput gives considerable gain over equal power transmission. We also consider the effect of imperfections in the feedback channel on the optimal power allocation and show that our power allocation scheme is robust to feedback errors.     

Delay-bounded packet scheduling of bursty traffic over wireless channels

In this paper, we study minimal power transmission of bursty sources over wireless channels with constraints on mean queuing delay. The power minimizing schedulers adapt power and rate of transmission based on the queue and channel state. We show that packet scheduling based on queue state can be used to trade queuing delay with transmission power, even on additive white Gaussian noise (AWGN) channels. Our extensive simulations show that small increases in average delay can lead to substantial savings in transmission power, thereby providing another avenue for mobile devices to save on battery power. We propose a low-complexity scheduler that has near-optimal performance. We also construct a variable-rate quadrature amplitude modulation (QAM)-based transmission scheme to show the benefits of the proposed formulation in a practical communication system. Power optimal schedulers with absolute packet delay constraints are also studied and their performance is evaluated via simulations.     

Time-selective signaling and reception for communication overmultipath fading channels

The mobile wireless channel affords inherent diversity to combat the effects of fading. Existing code-division multiple-access systems, by virtue of spread-spectrum signaling and RAKE reception, exploit only part of the channel diversity via multipath combination. Moreover, their performance degrades under fast fading commonly encountered in mobile scenarios. In this paper, we develop new signaling and reception techniques that maximally exploit channel diversity via joint multipath-Doppler processing. Our approach is based on a canonical representation of the wireless channel, which leads to a time-frequency generalization of the RAKE receiver for diversity processing. Our signaling scheme facilitates joint multipath-Doppler diversity by spreading the symbol waveform beyond the intersymbol duration to make the channel time-selective. A variety of detection schemes are developed to account for the intersymbol interference (ISI) due to overlapping symbols. However, our results indicate that the effects of ISI are virtually negligible due to the excellent correlation properties of the pseudorandom codes. Performance analysis also shows that relatively small Doppler spreads can yield significant diversity gains. The inherently higher level of diversity achieved by time-selective signaling brings the fading channel closer to an additive white Gaussian noise channel, thereby facilitating the use of powerful existing coding techniques for Gaussian channels     

Code Designs for Cooperative Communication

The goal of this article is to discuss the implementation of two cooperative protocols - decode-and-forward (DF) and estimate-and-forward (EF). In each case, the starting point is an information theoretic random coding scheme, which motivates a practical code construction. Low-density parity check (LDPC) codes are used as components in both protocols. In DF relaying, the problem boils down to a search for multi-rate LDPC codes that simultaneously perform well for the source-relay and the source- destination links. On the other hand, in EF relaying, the challenge is to design an efficient quantizer for forming a compressed estimate at the relay. The performance of each scheme is comparable to theoretical limits.