It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

On the capacity of a cellular CDMA system

Information Theory and Reliable Communication

Random matrix theory has found many applications in physics, statistics and engineering since its inception. Although early developments were motivated by practical experimental problems, random matrices are now used in fields as diverse as Riemann hypothesis, stochastic differential equations, condensed matter physics, statistical physics, chaotic systems, numerical linear algebra, neural networks, multivariate statistics, information theory, signal processing and small-world networks. This article provides a tutorial on random matrices which provides an overview of the theory and brings together in one source the most significant results recently obtained. Furthermore, the application of random matrix theory to the fundamental limits of wireless communication channels is described in depth.

/pdf/random-matrix-theory-and-wireless-communications-lhkk3xrf4v.pdf

Random Matrix Theory and Wireless Communications

Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications industry to achieve near-capacity on a single-antenna Gaussian or fading channel with low complexity. We show how these iterative techniques can also be used to achieve near-capacity on a multiple-antenna system where the receiver knows the channel. Combining iterative processing with multiple-antenna channels is particularly challenging because the channel capacities can be a factor of ten or more higher than their single-antenna counterparts. Using a "list" version of the sphere decoder, we provide a simple method to iteratively detect and decode any linear space-time mapping combined with any channel code that can be decoded using so-called "soft" inputs and outputs. We exemplify our technique by directly transmitting symbols that are coded with a channel code; we show that iterative processing with even this simple scheme can achieve near-capacity. We consider both simple convolutional and powerful turbo channel codes and show that excellent performance at very high data rates can be attained with either. We compare our simulation results with Shannon capacity limits for ergodic multiple-antenna channel.

http://www.ece.ualberta.ca/~hcdc/Library/StCommClass/HocTen01.pdf

Achieving near-capacity on a multiple-antenna channel

Zehavi (1992) showed that the performance of coded modulation over a Rayleigh fading channel can be improved by bit-wise interleaving the encoder output and by using an appropriate soft-decision metric as an input to a Viterbi decoder. The goal of this paper is to present in a comprehensive fashion the theory underlying bit-interleaved coded modulation, to provide tools for evaluating its performance, and to give guidelines for its design.

/pdf/bit-interleaved-coded-modulation-2ld6uk564f.pdf

Bit-Interleaved Coded Modulation

Iterative decoding algorithms for spectrally efficient modulation have become a vital field of research in digital communications. We show how iterative demapping reduces the bit error rate in conventional communication systems applying multilevel modulation combined with simple channel coding. For this the soft demapping has to be modified in order to accept a priori information. The system can be regarded as a serially concatenated iterative decoding scheme whereby the inner decoder is replaced by the soft demapping device. A design rule based on mutual information to find the 'best' mapping is proposed. Numerical results are presented for 4-PAM and 16-QAM examples.

Iterative demapping and decoding for multilevel modulation

The authors present an iterative decoding scheme which is particularly suited for quadrature phase shift keying (QPSK) modulation with anti-Gray mapping. At the receiver, a soft demapper accepting a priori information and a convolutional decoder are applied in a serial concatenation. Numerical results are presented for QPSK in additive white Gaussian noise and Rayleigh-fading channels. The iterated system applying anti-Gray mapping outperforms the conventional system using Gray mapping after only one iteration.

Iterative demapping for QPSK modulation

We present a novel quaternary optical-modulation scheme based on the combination of amplitude and phase modulation. The modulator has a simple structure and can be realized by using standard components. We present two simple receivers, each one using photodiodes for direct detection. The performance of the modulation scheme is investigated.

Quaternary optical ASK-DPSK and receivers with direct detection

We propose and analyze a generalized spatial mod- ulation scheme, where depending on the bits to be transmitted a certain data symbol as well as a certain beamforming vector is chosen. The receiver then has to estimate both the used beamforming vector and the transmitted data symbol for being able to reconstruct the originally transmitted bit sequence. We analyze our scheme theoretically by deriving a very tight upper bound on the average bit error rate (BER) for arbitrary symbol constellations and beamforming codebooks in correlated Rayleigh fading channels. Based on this bound, we determine a design criterion for optimizing the used beamforming codebook in presence of spatial correlation at the transmitter-side. Simulation results are shown to be in excellent agreement with our analytical calculated BERs and they illustrate the significant performance gains that can be obtained with our generalized scheme compared to conventional spatial modulation.

BER Analysis and Optimization of Generalized Spatial Modulation in Correlated Fading Channels

In this paper we present a novel and computationally efficient waterfilling algorithm for multiuser OFDM. This algorithm is based on the multiuser waterfilling theorem and determines the subcarrier allocation for a multiple access OFDM system. This approach maximizes the total bitrate under the constraints of user-individual power budgets. Once the subcarrier allocation has been established, the bit and power allocation for each user can be determined with a single-user bitloading algorithm, for which several implementations can be found in the literature. The presented iterative algorithm performs well, also with a high number of subchannels.

Joachim Speidel

Papers

Iterative demapping and decoding for multilevel modulation

Iterative demapping for QPSK modulation

Quaternary optical ASK-DPSK and receivers with direct detection

BER Analysis and Optimization of Generalized Spatial Modulation in Correlated Fading Channels

An efficient waterfilling algorithm for multiple access OFDM