An overview of MIMO communications - a key to gigabit wireless
---
paper_title: Space-Time Block Codes from Orthogonal Designs

paper_content:

We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.
---
paper_title: Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels

paper_content:

Transmitter diversity wireless communication systems over Rayleigh fading channels using pilot symbol assisted modulation (PSAM) are studied. Unlike conventional transmitter diversity systems with PSAM that estimate the superimposed fading process, we are able to estimate each individual fading process corresponding to the multiple transmitters by using appropriately designed pilot symbol sequences. With such sequences, special coded modulation schemes can then be designed to access the diversity provided by the multiple transmitters without having to use an interleaver or expand the signal bandwidth. The code matrix notion is introduced for the coded modulation scheme, and its design criteria are also established. In addition to the reduction in receiver complexity, simulation results are compared to, and shown to be superior to, that of an intentional frequency offset system over a wide range of system parameters.
---
paper_title: On the capacity of OFDM-based spatial multiplexing systems

paper_content:

This paper deals with the capacity behavior of wireless orthogonal frequency-division multiplexing (OFDM)-based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown at the transmitter and perfectly known at the receiver. Introducing a physically motivated multiple-input multiple-output (MIMO) broad-band fading channel model, we study the influence of physical parameters such as the amount of delay spread, cluster angle spread, and total angle spread, and system parameters such as the number of antennas and antenna spacing on ergodic capacity and outage capacity. We find that, in the MIMO case, unlike the single-input single-output (SISO) case, delay spread channels may provide advantages over flat fading channels not only in terms of outage capacity but also in terms of ergodic capacity. Therefore, MIMO delay spread channels will in general provide both higher diversity gain and higher multiplexing gain than MIMO flat fading channels
---
paper_title: A Simple Transmit Diversity Technique for Wireless Communications

paper_content:

This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the scheme may easily be generalized to two transmit antennas and receive antennas to provide a diversity order of 2. The new scheme does not require any bandwidth expansion any feedback from the receiver to the transmitter and its computation complexity is similar to MRRC.
---
paper_title: Space-Time Block Codes from Orthogonal Designs

paper_content:

We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.
---
paper_title: Space-time codes for high data rate wireless communication: Performance criterion and code construction

paper_content:

We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2-3 dB of the outage capacity for these channels using only 64 state encoders.
---
paper_title: On the capacity of OFDM-based spatial multiplexing systems

paper_content:

This paper deals with the capacity behavior of wireless orthogonal frequency-division multiplexing (OFDM)-based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown at the transmitter and perfectly known at the receiver. Introducing a physically motivated multiple-input multiple-output (MIMO) broad-band fading channel model, we study the influence of physical parameters such as the amount of delay spread, cluster angle spread, and total angle spread, and system parameters such as the number of antennas and antenna spacing on ergodic capacity and outage capacity. We find that, in the MIMO case, unlike the single-input single-output (SISO) case, delay spread channels may provide advantages over flat fading channels not only in terms of outage capacity but also in terms of ergodic capacity. Therefore, MIMO delay spread channels will in general provide both higher diversity gain and higher multiplexing gain than MIMO flat fading channels
---
paper_title: Measurement and characterization of broadband MIMO fixed wireless channels at 2.5 GHz

paper_content:

We study the channel typical for cellular broadband fixed wireless applications. A measurement system for a two-element-transmit by two-element-receive antenna configuration was built, Measurements were conducted in a suburban environment with dual antenna polarization and transmit separation. We present results on K-factor, cross-polarization discrimination (XPD) and Doppler spectrum. Our results address the influence of distance and antenna height for K-factor and XPD. We also comment on the properties of a fixed wireless channel and describe its Doppler spectrum.
---
paper_title: Introduction to Space-Time Wireless Communications

paper_content:

Wireless networks are under constant pressure to provide ever-higher data rates to increasing numbers of users with greater reliability. This book is an accessible introduction to every fundamental aspect of space-time wireless communications. Space-time processing technology is a powerful tool for improving system performance that already features in the UMTS and CDMA2000 mobile standards. The ideal volume for graduate students and professionals, it features homework problems and other supporting material on a companion website.
---
paper_title: Spectral efficiency of wireless systems with multiple transmit and receive antennas

paper_content:

Recent information-theory results have shown the enormous capacity potential of wireless techniques that use transmit and receive antenna arrays. As a result, a number of layered space-time (BLAST) architectures have been proposed wherein multiple data streams are transmitted in parallel and separated at the receiver on account of their distinct spatial signatures. While extremely promising, all analysis of BLAST to date were restricted to the context of a single-user link. In this paper, the system-level benefit of using BLAST in multicell scenarios is evaluated in comparison with other directive- and adaptive-array techniques.
---
paper_title: Multiple-input - multiple-output measurements and modeling in Manhattan

paper_content:

Narrowband multiple-input-multiple-output (MIMO) measurements using 16 transmitters and 16 receivers at 2.11 GHz were carried out in Manhattan. High capacities were found for full, as well as smaller array configurations, all within 80% of the fully scattering channel capacity. Correlation model parameters are derived from data. Spatial MIMO channel capacity statistics are found to be well represented by the separate transmitter and receiver correlation matrices, with a median relative error in capacity of 3%, in contrast with the 18% median relative error observed by assuming the antennas to be uncorrelated. A reduced parameter model, consisting of 4 parameters, has been developed to statistically represent the channel correlation matrices. These correlation matrices are, in turn, used to generate H matrices with capacities that are consistent within a few percent of those measured in New York. The spatial channel model reported allows simulations of H matrices for arbitrary antenna configurations. These channel matrices may be used to test receiver algorithms in system performance studies. These results may also be used for antenna array design, as the decay of mobile antenna correlation with antenna separation has been reported here. An important finding for the base transmitter array was that the antennas were largely uncorrelated even at antenna separations as small as two wavelengths.
---
paper_title: On the capacity of OFDM-based spatial multiplexing systems

paper_content:

This paper deals with the capacity behavior of wireless orthogonal frequency-division multiplexing (OFDM)-based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown at the transmitter and perfectly known at the receiver. Introducing a physically motivated multiple-input multiple-output (MIMO) broad-band fading channel model, we study the influence of physical parameters such as the amount of delay spread, cluster angle spread, and total angle spread, and system parameters such as the number of antennas and antenna spacing on ergodic capacity and outage capacity. We find that, in the MIMO case, unlike the single-input single-output (SISO) case, delay spread channels may provide advantages over flat fading channels not only in terms of outage capacity but also in terms of ergodic capacity. Therefore, MIMO delay spread channels will in general provide both higher diversity gain and higher multiplexing gain than MIMO flat fading channels
---
paper_title: Elements of Information Theory

paper_content:

Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Preview of the Book. 2. Entropy, Relative Entropy, and Mutual Information. 2.1 Entropy. 2.2 Joint Entropy and Conditional Entropy. 2.3 Relative Entropy and Mutual Information. 2.4 Relationship Between Entropy and Mutual Information. 2.5 Chain Rules for Entropy, Relative Entropy, and Mutual Information. 2.6 Jensen's Inequality and Its Consequences. 2.7 Log Sum Inequality and Its Applications. 2.8 Data-Processing Inequality. 2.9 Sufficient Statistics. 2.10 Fano's Inequality. Summary. Problems. Historical Notes. 3. Asymptotic Equipartition Property. 3.1 Asymptotic Equipartition Property Theorem. 3.2 Consequences of the AEP: Data Compression. 3.3 High-Probability Sets and the Typical Set. Summary. Problems. Historical Notes. 4. Entropy Rates of a Stochastic Process. 4.1 Markov Chains. 4.2 Entropy Rate. 4.3 Example: Entropy Rate of a Random Walk on a Weighted Graph. 4.4 Second Law of Thermodynamics. 4.5 Functions of Markov Chains. Summary. Problems. Historical Notes. 5. Data Compression. 5.1 Examples of Codes. 5.2 Kraft Inequality. 5.3 Optimal Codes. 5.4 Bounds on the Optimal Code Length. 5.5 Kraft Inequality for Uniquely Decodable Codes. 5.6 Huffman Codes. 5.7 Some Comments on Huffman Codes. 5.8 Optimality of Huffman Codes. 5.9 Shannon-Fano-Elias Coding. 5.10 Competitive Optimality of the Shannon Code. 5.11 Generation of Discrete Distributions from Fair Coins. Summary. Problems. Historical Notes. 6. Gambling and Data Compression. 6.1 The Horse Race. 6.2 Gambling and Side Information. 6.3 Dependent Horse Races and Entropy Rate. 6.4 The Entropy of English. 6.5 Data Compression and Gambling. 6.6 Gambling Estimate of the Entropy of English. Summary. Problems. Historical Notes. 7. Channel Capacity. 7.1 Examples of Channel Capacity. 7.2 Symmetric Channels. 7.3 Properties of Channel Capacity. 7.4 Preview of the Channel Coding Theorem. 7.5 Definitions. 7.6 Jointly Typical Sequences. 7.7 Channel Coding Theorem. 7.8 Zero-Error Codes. 7.9 Fano's Inequality and the Converse to the Coding Theorem. 7.10 Equality in the Converse to the Channel Coding Theorem. 7.11 Hamming Codes. 7.12 Feedback Capacity. 7.13 Source-Channel Separation Theorem. Summary. Problems. Historical Notes. 8. Differential Entropy. 8.1 Definitions. 8.2 AEP for Continuous Random Variables. 8.3 Relation of Differential Entropy to Discrete Entropy. 8.4 Joint and Conditional Differential Entropy. 8.5 Relative Entropy and Mutual Information. 8.6 Properties of Differential Entropy, Relative Entropy, and Mutual Information. Summary. Problems. Historical Notes. 9. Gaussian Channel. 9.1 Gaussian Channel: Definitions. 9.2 Converse to the Coding Theorem for Gaussian Channels. 9.3 Bandlimited Channels. 9.4 Parallel Gaussian Channels. 9.5 Channels with Colored Gaussian Noise. 9.6 Gaussian Channels with Feedback. Summary. Problems. Historical Notes. 10. Rate Distortion Theory. 10.1 Quantization. 10.2 Definitions. 10.3 Calculation of the Rate Distortion Function. 10.4 Converse to the Rate Distortion Theorem. 10.5 Achievability of the Rate Distortion Function. 10.6 Strongly Typical Sequences and Rate Distortion. 10.7 Characterization of the Rate Distortion Function. 10.8 Computation of Channel Capacity and the Rate Distortion Function. Summary. Problems. Historical Notes. 11. Information Theory and Statistics. 11.1 Method of Types. 11.2 Law of Large Numbers. 11.3 Universal Source Coding. 11.4 Large Deviation Theory. 11.5 Examples of Sanov's Theorem. 11.6 Conditional Limit Theorem. 11.7 Hypothesis Testing. 11.8 Chernoff-Stein Lemma. 11.9 Chernoff Information. 11.10 Fisher Information and the Cram-er-Rao Inequality. Summary. Problems. Historical Notes. 12. Maximum Entropy. 12.1 Maximum Entropy Distributions. 12.2 Examples. 12.3 Anomalous Maximum Entropy Problem. 12.4 Spectrum Estimation. 12.5 Entropy Rates of a Gaussian Process. 12.6 Burg's Maximum Entropy Theorem. Summary. Problems. Historical Notes. 13. Universal Source Coding. 13.1 Universal Codes and Channel Capacity. 13.2 Universal Coding for Binary Sequences. 13.3 Arithmetic Coding. 13.4 Lempel-Ziv Coding. 13.5 Optimality of Lempel-Ziv Algorithms. Compression. Summary. Problems. Historical Notes. 14. Kolmogorov Complexity. 14.1 Models of Computation. 14.2 Kolmogorov Complexity: Definitions and Examples. 14.3 Kolmogorov Complexity and Entropy. 14.4 Kolmogorov Complexity of Integers. 14.5 Algorithmically Random and Incompressible Sequences. 14.6 Universal Probability. 14.7 Kolmogorov complexity. 14.9 Universal Gambling. 14.10 Occam's Razor. 14.11 Kolmogorov Complexity and Universal Probability. 14.12 Kolmogorov Sufficient Statistic. 14.13 Minimum Description Length Principle. Summary. Problems. Historical Notes. 15. Network Information Theory. 15.1 Gaussian Multiple-User Channels. 15.2 Jointly Typical Sequences. 15.3 Multiple-Access Channel. 15.4 Encoding of Correlated Sources. 15.5 Duality Between Slepian-Wolf Encoding and Multiple-Access Channels. 15.6 Broadcast Channel. 15.7 Relay Channel. 15.8 Source Coding with Side Information. 15.9 Rate Distortion with Side Information. 15.10 General Multiterminal Networks. Summary. Problems. Historical Notes. 16. Information Theory and Portfolio Theory. 16.1 The Stock Market: Some Definitions. 16.2 Kuhn-Tucker Characterization of the Log-Optimal Portfolio. 16.3 Asymptotic Optimality of the Log-Optimal Portfolio. 16.4 Side Information and the Growth Rate. 16.5 Investment in Stationary Markets. 16.6 Competitive Optimality of the Log-Optimal Portfolio. 16.7 Universal Portfolios. 16.8 Shannon-McMillan-Breiman Theorem (General AEP). Summary. Problems. Historical Notes. 17. Inequalities in Information Theory. 17.1 Basic Inequalities of Information Theory. 17.2 Differential Entropy. 17.3 Bounds on Entropy and Relative Entropy. 17.4 Inequalities for Types. 17.5 Combinatorial Bounds on Entropy. 17.6 Entropy Rates of Subsets. 17.7 Entropy and Fisher Information. 17.8 Entropy Power Inequality and Brunn-Minkowski Inequality. 17.9 Inequalities for Determinants. 17.10 Inequalities for Ratios of Determinants. Summary. Problems. Historical Notes. Bibliography. List of Symbols. Index.
---
paper_title: On limits of wireless communications in a fading environment when using multiple antennas

paper_content:

This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver. ::: ::: We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon‘s classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts to 5.5 bits/symbol/dimension. Standard approaches such as selection and optimum combining are seen to be deficient when compared to what will ultimately be possible. New codecs need to be invented to realize a hefty portion of the great capacity promised.
---
paper_title: Outdoor MIMO Wireless Channels: Models and Performance Prediction

paper_content:

We present a new model for multiple-input-multiple-output (MIMO) outdoor wireless fading channels and their capacity performance. The proposed model is more general and realistic than the usual independent and identically distributed (i.i.d.) model, and allows us to investigate the behavior of channel capacity as a function of the scattering radii at transmitter and receiver, distance between the transmit and receive arrays, and antenna beamwidths and spacing. We show how the MIMO capacity is governed by spatial fading correlation and the condition number of the channel matrix through specific sets of propagation parameters. The proposed model explains the existence of "pinhole" channels which exhibit low spatial fading correlation at both ends of the link but still have poor rank properties, and hence, low ergodic capacity. In fact, the model suggests the existence of a more general family of channels spanning continuously from full rank i.i.d. to low-rank pinhole cases. We suggest guidelines for predicting high rank (and hence, high ergodic capacity) in MIMO channels, and show that even at long ranges, high channel rank can easily be sustained under mild scattering conditions. Finally, we validate our results by simulations using ray tracing techniques. Connections with basic antenna theory are made.
---
paper_title: Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading

paper_content:

We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flat-fading environment. The propagation coefficients between pairs of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T/spl middot/M complex transmitted signals. We prove that there is no point in making the number of transmitter antennas greater than the length of the coherence interval: the capacity for M>T is equal to the capacity for M=T. Capacity is achieved when the T/spl times/M transmitted signal matrix is equal to the product of two statistically independent matrices: a T/spl times/T isotropically distributed unitary matrix times a certain T/spl times/M random matrix that is diagonal, real, and nonnegative. This result enables us to determine capacity for many interesting cases. We conclude that, for a fixed number of antennas, as the length of the coherence interval increases, the capacity approaches the capacity obtained as if the receiver knew the propagation coefficients.
---
paper_title: Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel

paper_content:

We study the capacity of multiple-antenna fading channels. We focus on the scenario where the fading coefficients vary quickly; thus an accurate estimation of the coefficients is generally not available to either the transmitter or the receiver. We use a noncoherent block fading model proposed by Marzetta and Hochwald (see ibid. vol.45, p.139-57, 1999). The model does not assume any channel side information at the receiver or at the transmitter, but assumes that the coefficients remain constant for a coherence interval of length T symbol periods. We compute the asymptotic capacity of this channel at high signal-to-noise ratio (SNR) in terms of the coherence time T, the number of transmit antennas M, and the number of receive antennas N. While the capacity gain of the coherent multiple antenna channel is min{M, N} bits per second per Hertz for every 3-dB increase in SNR, the corresponding gain for the noncoherent channel turns out to be M* (1 - M*/T) bits per second per Hertz, where M*=min{M, N, [T/2]}. The capacity expression has a geometric interpretation as sphere packing in the Grassmann manifold.
---
paper_title: Measurement and characterization of broadband MIMO fixed wireless channels at 2.5 GHz

paper_content:

We study the channel typical for cellular broadband fixed wireless applications. A measurement system for a two-element-transmit by two-element-receive antenna configuration was built, Measurements were conducted in a suburban environment with dual antenna polarization and transmit separation. We present results on K-factor, cross-polarization discrimination (XPD) and Doppler spectrum. Our results address the influence of distance and antenna height for K-factor and XPD. We also comment on the properties of a fixed wireless channel and describe its Doppler spectrum.
---
paper_title: Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading

paper_content:

Motivated by information-theoretic considerations, we propose a signaling scheme, unitary space-time modulation, for multiple-antenna communication links. This modulation is ideally suited for Rayleigh fast-fading environments, since it does not require the receiver to know or learn the propagation coefficients. Unitary space-time modulation uses constellations of T/spl times/M space-time signals (/spl Phi//sub i/, l=1, ..., L), where T represents the coherence interval during which the fading is approximately constant, and M<T is the number of transmitter antennas. The columns of each /spl Phi//sub i/ are orthonormal. When the receiver does not know the propagation coefficients, which between pairs of transmitter and receiver antennas are modeled as statistically independent, this modulation performs very well either when the signal-to-noise ratio (SNR) is high or when T/spl Gt/M. We design some multiple-antenna signal constellations and simulate their effectiveness as measured by bit-error probability with maximum-likelihood decoding. We demonstrate that two antennas have a 6-dB diversity gain over one antenna at 15-dB SNR.
---
paper_title: Fading Channels: Information-Theoretic and Communications Aspects

paper_content:

In this paper we review the most peculiar and interesting information-theoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information theory of fading channels, by emphasizing capacity as the most important performance measure. Both single-user and multiuser transmission are examined. Further, we describe how the structure of fading channels impacts code design, and finally overview equalization of fading multipath channels.
---
paper_title: Information theoretic considerations for cellular mobile radio

paper_content:

We present some information-theoretic considerations used to determine upper bounds on the information rates that can be reliably transmitted over a two-ray propagation path mobile radio channel model, operating in a time division multiplex access (TDMA) regime, under given decoding delay constraints. The sense in which reliability is measured is addressed, and in the interesting eases where the decoding delay constraint plays a significant role, the maximal achievable rate (capacity), is specified in terms of capacity versus outage. In this case, no coding capacity in the strict Shannon sense exists. Simple schemes for time and space diversity are examined, and their potential benefits are illuminated from an information-theoretic stand point. In our presentation, we chose to specialize to the TDMA protocol for the sake of clarity and convenience. Our main arguments and results extend directly to certain variants of other multiple access protocols such as code division multiple access (CDMA) and frequency division multiple access (FDMA), provided that no fast feedback from the receiver to the transmitter is available. >
---
paper_title: On the capacity of OFDM-based spatial multiplexing systems

paper_content:

This paper deals with the capacity behavior of wireless orthogonal frequency-division multiplexing (OFDM)-based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown at the transmitter and perfectly known at the receiver. Introducing a physically motivated multiple-input multiple-output (MIMO) broad-band fading channel model, we study the influence of physical parameters such as the amount of delay spread, cluster angle spread, and total angle spread, and system parameters such as the number of antennas and antenna spacing on ergodic capacity and outage capacity. We find that, in the MIMO case, unlike the single-input single-output (SISO) case, delay spread channels may provide advantages over flat fading channels not only in terms of outage capacity but also in terms of ergodic capacity. Therefore, MIMO delay spread channels will in general provide both higher diversity gain and higher multiplexing gain than MIMO flat fading channels
---
paper_title: Multiple-input - multiple-output measurements and modeling in Manhattan

paper_content:

Narrowband multiple-input-multiple-output (MIMO) measurements using 16 transmitters and 16 receivers at 2.11 GHz were carried out in Manhattan. High capacities were found for full, as well as smaller array configurations, all within 80% of the fully scattering channel capacity. Correlation model parameters are derived from data. Spatial MIMO channel capacity statistics are found to be well represented by the separate transmitter and receiver correlation matrices, with a median relative error in capacity of 3%, in contrast with the 18% median relative error observed by assuming the antennas to be uncorrelated. A reduced parameter model, consisting of 4 parameters, has been developed to statistically represent the channel correlation matrices. These correlation matrices are, in turn, used to generate H matrices with capacities that are consistent within a few percent of those measured in New York. The spatial channel model reported allows simulations of H matrices for arbitrary antenna configurations. These channel matrices may be used to test receiver algorithms in system performance studies. These results may also be used for antenna array design, as the decay of mobile antenna correlation with antenna separation has been reported here. An important finding for the base transmitter array was that the antennas were largely uncorrelated even at antenna separations as small as two wavelengths.
---
paper_title: Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels

paper_content:

Transmitter diversity wireless communication systems over Rayleigh fading channels using pilot symbol assisted modulation (PSAM) are studied. Unlike conventional transmitter diversity systems with PSAM that estimate the superimposed fading process, we are able to estimate each individual fading process corresponding to the multiple transmitters by using appropriately designed pilot symbol sequences. With such sequences, special coded modulation schemes can then be designed to access the diversity provided by the multiple transmitters without having to use an interleaver or expand the signal bandwidth. The code matrix notion is introduced for the coded modulation scheme, and its design criteria are also established. In addition to the reduction in receiver complexity, simulation results are compared to, and shown to be superior to, that of an intentional frequency offset system over a wide range of system parameters.
---
paper_title: Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading

paper_content:

We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flat-fading environment. The propagation coefficients between pairs of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T/spl middot/M complex transmitted signals. We prove that there is no point in making the number of transmitter antennas greater than the length of the coherence interval: the capacity for M>T is equal to the capacity for M=T. Capacity is achieved when the T/spl times/M transmitted signal matrix is equal to the product of two statistically independent matrices: a T/spl times/T isotropically distributed unitary matrix times a certain T/spl times/M random matrix that is diagonal, real, and nonnegative. This result enables us to determine capacity for many interesting cases. We conclude that, for a fixed number of antennas, as the length of the coherence interval increases, the capacity approaches the capacity obtained as if the receiver knew the propagation coefficients.
---
paper_title: Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading

paper_content:

Motivated by information-theoretic considerations, we propose a signaling scheme, unitary space-time modulation, for multiple-antenna communication links. This modulation is ideally suited for Rayleigh fast-fading environments, since it does not require the receiver to know or learn the propagation coefficients. Unitary space-time modulation uses constellations of T/spl times/M space-time signals (/spl Phi//sub i/, l=1, ..., L), where T represents the coherence interval during which the fading is approximately constant, and M<T is the number of transmitter antennas. The columns of each /spl Phi//sub i/ are orthonormal. When the receiver does not know the propagation coefficients, which between pairs of transmitter and receiver antennas are modeled as statistically independent, this modulation performs very well either when the signal-to-noise ratio (SNR) is high or when T/spl Gt/M. We design some multiple-antenna signal constellations and simulate their effectiveness as measured by bit-error probability with maximum-likelihood decoding. We demonstrate that two antennas have a 6-dB diversity gain over one antenna at 15-dB SNR.
---
paper_title: Introduction to Space-Time Wireless Communications

paper_content:

Wireless networks are under constant pressure to provide ever-higher data rates to increasing numbers of users with greater reliability. This book is an accessible introduction to every fundamental aspect of space-time wireless communications. Space-time processing technology is a powerful tool for improving system performance that already features in the UMTS and CDMA2000 mobile standards. The ideal volume for graduate students and professionals, it features homework problems and other supporting material on a companion website.
---
paper_title: Systematic design of unitary space-time constellations

paper_content:

We propose a systematic method for creating constellations of unitary space-time signals for multiple-antenna communication links. Unitary space-time signals, which are orthonormal in time across the antennas, have been shown to be well-tailored to a Rayleigh fading channel where neither the transmitter nor the receiver knows the fading coefficients. The signals can achieve low probability of error by exploiting multiple-antenna diversity. Because the fading coefficients are not known, the criterion for creating and evaluating the constellation is nonstandard and differs markedly from the familiar maximum-Euclidean-distance norm. Our construction begins with the first signal in the constellation-an oblong complex-valued matrix whose columns are orthonormal-and systematically produces the remaining signals by successively rotating this signal in a high-dimensional complex space. This construction easily produces large constellations of high-dimensional signals. We demonstrate its efficacy through examples involving one, two, and three transmitter antennas.
---
paper_title: Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity

paper_content:

We propose two signaling schemes that exploit the availability of multiple (N) antennas at the transmitter to provide diversity benefit to the receiver. This is typical of cellular radio systems where a mobile is equipped with only one antenna while the base station is equipped with multiple antennas. We further assume that the mobile-to-base and base-to-mobile channel variations are statistically independent and that the base station has no knowledge of the base-to-mobile channel characteristics. In the first scheme, a channel code of lengthN and minimum Hamming distanced ::: min≤N is used to encode a group ofK information bits. Channel code symbolc ::: ::: i ::: is transmitted with thei th antenna. At the receiver, a maximum likelihood decoder for the channel code provides a diversity ofd ::: min as long as each transmitted code symbol is subjected to independent fading. This can be achieved by spacing the transmit antennas several wavelengths apart. The second scheme introduces deliberate resolvable multipath distortion by transmitting the data-bearing signal with antenna 1, andN−1 delayed versions of it with antennas 2 throughN. The delays are unique to each antenna and are chosen to be multiples of the symbol interval. At the receiver, a maximum likelihood sequence estimator resolves the multipath in an optimal manner to realize a diversity benefit ofN. Both schemes can suppress co-channel interference. We provide code constructions and simulation results for scheme 1 to demonstrate its merit. We derive the receiver structure and provide a bound on the error probability for scheme 2 which we show to be tight, by means of simulations, for the nontrivial and perhaps the most interesting caseN=2 antennas. The second scheme is backward-compatible with two of the proposed digital cellular system standards, viz., GSM for Europe and IS-54 for North America.
---
paper_title: A Simple Transmit Diversity Technique for Wireless Communications

paper_content:

This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the scheme may easily be generalized to two transmit antennas and receive antennas to provide a diversity order of 2. The new scheme does not require any bandwidth expansion any feedback from the receiver to the transmitter and its computation complexity is similar to MRRC.
---
paper_title: Space-frequency coded broadband OFDM systems

paper_content:

Space-time coding for fading channels is a communication technique that realizes the diversity benefits of multiple transmit antennas. Previous work in this area has focused on the narrowband flat fading case where spatial diversity only is available. We investigate the use of space-time coding in OFDM-based broadband systems where both spatial and frequency diversity are available. We consider a strategy which basically consists of coding across OFDM tones and is therefore called space-frequency coding. For a spatial broadband channel model taking into account physical propagation parameters and antenna spacing, we derive the design criteria for space-frequency codes and we show that space-time codes designed to achieve full spatial diversity in the narrowband case will in general not achieve full space-frequency diversity. Specifically, we show that the Alamouti (see IEEE J. Sel. Areas Comm., vol.16, p.1451-58, 1998) scheme across tones fails to exploit frequency diversity. For a given set of propagation parameters and given antenna spacing, we establish the maximum achievable diversity order. Finally, we provide simulation results studying the influence of delay spread, propagation parameters, and antenna spacing on the performance of space-frequency codes.
---
paper_title: On limits of wireless communications in a fading environment when using multiple antennas

paper_content:

This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver. ::: ::: We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon‘s classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts to 5.5 bits/symbol/dimension. Standard approaches such as selection and optimum combining are seen to be deficient when compared to what will ultimately be possible. New codecs need to be invented to realize a hefty portion of the great capacity promised.
---
paper_title: Space-Time Block Codes from Orthogonal Designs

paper_content:

We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.
---
paper_title: Space-time codes for high data rate wireless communication: Performance criterion and code construction

paper_content:

We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2-3 dB of the outage capacity for these channels using only 64 state encoders.
---
paper_title: Impact of the propagation environment on the performance of space-frequency coded MIMO-OFDM

paper_content:

Previous work on space-frequency coded multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) has been restricted to idealistic propagation conditions. In this paper, using a broadband MIMO channel model taking into account Ricean K-factor, transmit and receive angle spread, and antenna spacing, we study the impact of the propagation environment on the performance of space-frequency coded MIMO-OFDM. For a given space-frequency code, we quantify the achievable diversity order and coding gain as a function of the propagation parameters. We find that while the presence of spatial receive correlation affects all space-frequency codes equally, spatial fading correlation at the transmit array can result in widely varying performance losses. High-rate space-frequency codes such as spatial multiplexing are typically significantly more affected by transmit correlation than low-rate codes such as space-frequency block codes. We show that in the MIMO Ricean case the presence of frequency-selectivity typically results in improved performance compared to the frequency-flat case.
---
paper_title: Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas

paper_content:

This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver. Inventing a codec architecture that can realize a significant portion of the great capacity promised by information theory is essential to a standout long-term position in highly competitive arenas like fixed and indoor wireless. Use (n T , n R ) to express the number of antenna elements at the transmitter and receiver. An (n, n) analysis shows that despite the n received waves interfering randomly, capacity grows linearly with n and is enormous. With n = 8 at 1% outage and 21-dB average SNR at each receiving element, 42 b/s/Hz is achieved. The capacity is more than 40 times that of a (1, 1) system at the same total radiated transmitter power and bandwidth. Moreover, in some applications, n could be much larger than 8. In striving for significant fractions of such huge capacities, the question arises: Can one construct an (n, n) system whose capacity scales linearly with n, using as building blocks n separately coded one-dimensional (1-D) subsystems of equal capacity? With the aim of leveraging the already highly developed 1-D codec technology, this paper reports just such an invention. In this new architecture, signals are layered in space and time as suggested by a tight capacity bound.
---
paper_title: Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity

paper_content:

We propose two signaling schemes that exploit the availability of multiple (N) antennas at the transmitter to provide diversity benefit to the receiver. This is typical of cellular radio systems where a mobile is equipped with only one antenna while the base station is equipped with multiple antennas. We further assume that the mobile-to-base and base-to-mobile channel variations are statistically independent and that the base station has no knowledge of the base-to-mobile channel characteristics. In the first scheme, a channel code of lengthN and minimum Hamming distanced ::: min≤N is used to encode a group ofK information bits. Channel code symbolc ::: ::: i ::: is transmitted with thei th antenna. At the receiver, a maximum likelihood decoder for the channel code provides a diversity ofd ::: min as long as each transmitted code symbol is subjected to independent fading. This can be achieved by spacing the transmit antennas several wavelengths apart. The second scheme introduces deliberate resolvable multipath distortion by transmitting the data-bearing signal with antenna 1, andN−1 delayed versions of it with antennas 2 throughN. The delays are unique to each antenna and are chosen to be multiples of the symbol interval. At the receiver, a maximum likelihood sequence estimator resolves the multipath in an optimal manner to realize a diversity benefit ofN. Both schemes can suppress co-channel interference. We provide code constructions and simulation results for scheme 1 to demonstrate its merit. We derive the receiver structure and provide a bound on the error probability for scheme 2 which we show to be tight, by means of simulations, for the nontrivial and perhaps the most interesting caseN=2 antennas. The second scheme is backward-compatible with two of the proposed digital cellular system standards, viz., GSM for Europe and IS-54 for North America.
---
paper_title: Space-time block coding for channels with intersymbol interference

paper_content:

Abstract Stoica, P., and Lindskog, E., Space–Time Block Coding for Channels with Intersymbol Interference, Digital Signal Processing 12 (2002) 616–627 The downlink of many wireless communication systems can be a MISO channel. An important problem for a MISO channel is how to code across space and time to obtain the same ML receiver as for the corresponding SIMO channel. For flat fading channels, space–time block coding (STBC) is a recent breakthrough solution to this problem. In Lindskog and Paulraj (in Proceedings of ICC'2000, NewOrleans, LA, June 18–22, 2000), STBC has been generalized to channels with intersymbol interference (ISI) for the case of two transmit antennas and one receive antenna. In this paper we first revisit the generalized STBC scheme of Lindskog and Paulraj and show that it has the same appealing properties as the standard STBC for flat fading channels. Then we go on to present an extension of this scheme to ISI channels with any number of transmit and receive antennas.
---
paper_title: Space-Time Block Codes from Orthogonal Designs

paper_content:

We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.
---
paper_title: Space-time codes for high data rate wireless communication: Performance criterion and code construction

paper_content:

We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2-3 dB of the outage capacity for these channels using only 64 state encoders.
---
paper_title: Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading

paper_content:

We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flat-fading environment. The propagation coefficients between pairs of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T/spl middot/M complex transmitted signals. We prove that there is no point in making the number of transmitter antennas greater than the length of the coherence interval: the capacity for M>T is equal to the capacity for M=T. Capacity is achieved when the T/spl times/M transmitted signal matrix is equal to the product of two statistically independent matrices: a T/spl times/T isotropically distributed unitary matrix times a certain T/spl times/M random matrix that is diagonal, real, and nonnegative. This result enables us to determine capacity for many interesting cases. We conclude that, for a fixed number of antennas, as the length of the coherence interval increases, the capacity approaches the capacity obtained as if the receiver knew the propagation coefficients.
---
paper_title: Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture

paper_content:

The signal detection algorithm of the vertical BLAST (Bell Laboratories Layered Space-Time) wireless communications architecture is briefly described. Using this joint space-time approach, spectral efficiencies ranging from 20-40 bit/s/Hz have been demonstrated in the laboratory under flat fading conditions at indoor fading rates. Early results are presented.
---
paper_title: Fading Channels: Information-Theoretic and Communications Aspects

paper_content:

In this paper we review the most peculiar and interesting information-theoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information theory of fading channels, by emphasizing capacity as the most important performance measure. Both single-user and multiuser transmission are examined. Further, we describe how the structure of fading channels impacts code design, and finally overview equalization of fading multipath channels.
---
paper_title: The impact of antenna diversity on the capacity of wireless communication systems

paper_content:

For a broad class of interference-dominated wireless systems including mobile, personal communications, and wireless PBX/LAN networks, the authors show that a significant increase in system capacity can be achieved by the use of spatial diversity (multiple antennas), and optimum combining. This is explained by the following observation: for independent flat-Rayleigh fading wireless systems with N mutually interfering users, they demonstrate that with K+N antennas, N-1 interferers can be nulled out and K+1 path diversity improvement can be achieved by each of the N users. Monte Carlo evaluations show that these results also hold with frequency-selective fading when optimum equalization is used at the receiver. Thus an N-fold increase in user capacity can be achieved, allowing for modular growth and improved performance by increasing the number of antennas. The interferers can also be users in other cells, users in other radio systems, or even other types of radiating devices, and thus interference cancellation also allows radio systems to operate in high interference environments. As an example of the potential system gain, the authors show that with 2 or 3 antennas the capacity of the mobile radio system IS-54 can be doubled, and with 5 antennas a 7-fold capacity increase (frequency reuse in every cell) can be achieved. >
---
paper_title: Elements of Information Theory

paper_content:

Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Preview of the Book. 2. Entropy, Relative Entropy, and Mutual Information. 2.1 Entropy. 2.2 Joint Entropy and Conditional Entropy. 2.3 Relative Entropy and Mutual Information. 2.4 Relationship Between Entropy and Mutual Information. 2.5 Chain Rules for Entropy, Relative Entropy, and Mutual Information. 2.6 Jensen's Inequality and Its Consequences. 2.7 Log Sum Inequality and Its Applications. 2.8 Data-Processing Inequality. 2.9 Sufficient Statistics. 2.10 Fano's Inequality. Summary. Problems. Historical Notes. 3. Asymptotic Equipartition Property. 3.1 Asymptotic Equipartition Property Theorem. 3.2 Consequences of the AEP: Data Compression. 3.3 High-Probability Sets and the Typical Set. Summary. Problems. Historical Notes. 4. Entropy Rates of a Stochastic Process. 4.1 Markov Chains. 4.2 Entropy Rate. 4.3 Example: Entropy Rate of a Random Walk on a Weighted Graph. 4.4 Second Law of Thermodynamics. 4.5 Functions of Markov Chains. Summary. Problems. Historical Notes. 5. Data Compression. 5.1 Examples of Codes. 5.2 Kraft Inequality. 5.3 Optimal Codes. 5.4 Bounds on the Optimal Code Length. 5.5 Kraft Inequality for Uniquely Decodable Codes. 5.6 Huffman Codes. 5.7 Some Comments on Huffman Codes. 5.8 Optimality of Huffman Codes. 5.9 Shannon-Fano-Elias Coding. 5.10 Competitive Optimality of the Shannon Code. 5.11 Generation of Discrete Distributions from Fair Coins. Summary. Problems. Historical Notes. 6. Gambling and Data Compression. 6.1 The Horse Race. 6.2 Gambling and Side Information. 6.3 Dependent Horse Races and Entropy Rate. 6.4 The Entropy of English. 6.5 Data Compression and Gambling. 6.6 Gambling Estimate of the Entropy of English. Summary. Problems. Historical Notes. 7. Channel Capacity. 7.1 Examples of Channel Capacity. 7.2 Symmetric Channels. 7.3 Properties of Channel Capacity. 7.4 Preview of the Channel Coding Theorem. 7.5 Definitions. 7.6 Jointly Typical Sequences. 7.7 Channel Coding Theorem. 7.8 Zero-Error Codes. 7.9 Fano's Inequality and the Converse to the Coding Theorem. 7.10 Equality in the Converse to the Channel Coding Theorem. 7.11 Hamming Codes. 7.12 Feedback Capacity. 7.13 Source-Channel Separation Theorem. Summary. Problems. Historical Notes. 8. Differential Entropy. 8.1 Definitions. 8.2 AEP for Continuous Random Variables. 8.3 Relation of Differential Entropy to Discrete Entropy. 8.4 Joint and Conditional Differential Entropy. 8.5 Relative Entropy and Mutual Information. 8.6 Properties of Differential Entropy, Relative Entropy, and Mutual Information. Summary. Problems. Historical Notes. 9. Gaussian Channel. 9.1 Gaussian Channel: Definitions. 9.2 Converse to the Coding Theorem for Gaussian Channels. 9.3 Bandlimited Channels. 9.4 Parallel Gaussian Channels. 9.5 Channels with Colored Gaussian Noise. 9.6 Gaussian Channels with Feedback. Summary. Problems. Historical Notes. 10. Rate Distortion Theory. 10.1 Quantization. 10.2 Definitions. 10.3 Calculation of the Rate Distortion Function. 10.4 Converse to the Rate Distortion Theorem. 10.5 Achievability of the Rate Distortion Function. 10.6 Strongly Typical Sequences and Rate Distortion. 10.7 Characterization of the Rate Distortion Function. 10.8 Computation of Channel Capacity and the Rate Distortion Function. Summary. Problems. Historical Notes. 11. Information Theory and Statistics. 11.1 Method of Types. 11.2 Law of Large Numbers. 11.3 Universal Source Coding. 11.4 Large Deviation Theory. 11.5 Examples of Sanov's Theorem. 11.6 Conditional Limit Theorem. 11.7 Hypothesis Testing. 11.8 Chernoff-Stein Lemma. 11.9 Chernoff Information. 11.10 Fisher Information and the Cram-er-Rao Inequality. Summary. Problems. Historical Notes. 12. Maximum Entropy. 12.1 Maximum Entropy Distributions. 12.2 Examples. 12.3 Anomalous Maximum Entropy Problem. 12.4 Spectrum Estimation. 12.5 Entropy Rates of a Gaussian Process. 12.6 Burg's Maximum Entropy Theorem. Summary. Problems. Historical Notes. 13. Universal Source Coding. 13.1 Universal Codes and Channel Capacity. 13.2 Universal Coding for Binary Sequences. 13.3 Arithmetic Coding. 13.4 Lempel-Ziv Coding. 13.5 Optimality of Lempel-Ziv Algorithms. Compression. Summary. Problems. Historical Notes. 14. Kolmogorov Complexity. 14.1 Models of Computation. 14.2 Kolmogorov Complexity: Definitions and Examples. 14.3 Kolmogorov Complexity and Entropy. 14.4 Kolmogorov Complexity of Integers. 14.5 Algorithmically Random and Incompressible Sequences. 14.6 Universal Probability. 14.7 Kolmogorov complexity. 14.9 Universal Gambling. 14.10 Occam's Razor. 14.11 Kolmogorov Complexity and Universal Probability. 14.12 Kolmogorov Sufficient Statistic. 14.13 Minimum Description Length Principle. Summary. Problems. Historical Notes. 15. Network Information Theory. 15.1 Gaussian Multiple-User Channels. 15.2 Jointly Typical Sequences. 15.3 Multiple-Access Channel. 15.4 Encoding of Correlated Sources. 15.5 Duality Between Slepian-Wolf Encoding and Multiple-Access Channels. 15.6 Broadcast Channel. 15.7 Relay Channel. 15.8 Source Coding with Side Information. 15.9 Rate Distortion with Side Information. 15.10 General Multiterminal Networks. Summary. Problems. Historical Notes. 16. Information Theory and Portfolio Theory. 16.1 The Stock Market: Some Definitions. 16.2 Kuhn-Tucker Characterization of the Log-Optimal Portfolio. 16.3 Asymptotic Optimality of the Log-Optimal Portfolio. 16.4 Side Information and the Growth Rate. 16.5 Investment in Stationary Markets. 16.6 Competitive Optimality of the Log-Optimal Portfolio. 16.7 Universal Portfolios. 16.8 Shannon-McMillan-Breiman Theorem (General AEP). Summary. Problems. Historical Notes. 17. Inequalities in Information Theory. 17.1 Basic Inequalities of Information Theory. 17.2 Differential Entropy. 17.3 Bounds on Entropy and Relative Entropy. 17.4 Inequalities for Types. 17.5 Combinatorial Bounds on Entropy. 17.6 Entropy Rates of Subsets. 17.7 Entropy and Fisher Information. 17.8 Entropy Power Inequality and Brunn-Minkowski Inequality. 17.9 Inequalities for Determinants. 17.10 Inequalities for Ratios of Determinants. Summary. Problems. Historical Notes. Bibliography. List of Symbols. Index.
---
paper_title: Performance analysis of the V-BLAST algorithm: an analytical approach

paper_content:

An analytical approach to the performance analysis of the V-BLAST (vertical Bell Labs layered space-time) algorithm is presented. The approach is based on the analytical model of the Gramm-Schmidt process. Closed-form analytical expressions of the vector signal at the i-th processing step and its power are presented. A rigorous proof is given that the diversity order at the i-th step (without optimal ordering) is (n-m+i), where n and m are the number of receiver and transmitter antennas respectively. It is shown that the optimal ordering is based on the least correlation criterion and that the after-processing signal power is determined by the channel correlation matrices in a fashion similar to the channel capacity.
---
paper_title: On performance of the zero forcing receiver in presence of transmit correlation

paper_content:

Spatial multiplexing (SM) is an emerging spatial signaling technique that achieves high spectral efficiency in MIMO wireless communication links. We study the performance of the zero forcing receiver (used to recover the transmitted data stream) in flat fading channels with transmit correlation. The results for interference rejection in i.i.d. environments presented by Salz, Winters and Gitlin (1994) may be interpreted in a MIMO single user context to conclude that the zero forcing receiver achieves M /sub r/ -M/sub t/ + 1 order diversity on each stream. We provide an alternative derivation based on Wishart matrix analysis for the same result. In addition our formulation allows the inclusion of transmit correlation in the channel. We show that the SNR on each decoded strewn is a weighted Chi-squared variable with 2(M/sub r/ $M/sub t/ + 1) degrees of freedom. The weight characterizes the degradation in SNR and is accurately quantified by the corresponding diagonal element of the inverse of the transmit correlation matrix.
---
paper_title: On limits of wireless communications in a fading environment when using multiple antennas

paper_content:

This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver. ::: ::: We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon‘s classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable. The 19 bits/cycle for n = 4 amounts to 4.75 bits/symbol/dimension while 88 bits/cycle for n = 16 amounts to 5.5 bits/symbol/dimension. Standard approaches such as selection and optimum combining are seen to be deficient when compared to what will ultimately be possible. New codecs need to be invented to realize a hefty portion of the great capacity promised.
---
paper_title: On the expected complexity of sphere decoding

paper_content:

The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficient and given vector are comprised of real numbers, arises in many applications: communications, cryptography, GPS, to name a few. The problem is equivalent to finding the closest lattice point to a given point and is known to be NP-hard. In communications applications, however, the given vector is not arbitrary, but rather is an unknown lattice point that has been perturbed by an additive noise vector whose statistical properties are known. Therefore in this paper, rather than dwell on the worst-case complexity of the integer-least-squares problem, we study its expected complexity, averaged over the noise and over the lattice. For the "sphere decoding" algorithm of Fincke and Pohst (1995) we find a closed-form expression for the expected complexity and show that for a wide range of noise variances the expected complexity is polynomial, in fact often sub-cubic. Since many communications systems operate at noise levels for which the expected complexity turns out to be polynomial, this suggests that maximum-likelihood decoding, which was hitherto thought to be computationally intractable, can in fact be implemented in real-time-a result with many practical implications.
---
paper_title: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis

paper_content:

The standard methods for calculating vectors of short length in a lattice use a reduction procedure followed by enumerating all vectors of Z'.. in a suitable box. However, it suffices to consider those x E Z'" which lie in a suitable ellipsoid having a much smaller volume than the box. We show in this paper that searching through that ellipsoid is in many cases much more efficient. If combined with an appropriate reduction procedure our method allows to do computations in lattices of much higher dimensions. Several randomly constructed numerical examples illustrate the superiority of our new method over the known ones.
---
paper_title: V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel

paper_content:

Information theory research has shown that the rich-scattering wireless channel is capable of enormous theoretical capacities if the multipath is properly exploited. In this paper, we describe a wireless communication architecture known as vertical BLAST (Bell Laboratories Layered Space-Time) or V-BLAST, which has been implemented in real-time in the laboratory. Using our laboratory prototype, we have demonstrated spectral efficiencies of 20-40 bps/Hz in an indoor propagation environment at realistic SNRs and error rates. To the best of our knowledge, wireless spectral efficiencies of this magnitude are unprecedented and are furthermore unattainable using traditional techniques.
---
paper_title: Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel

paper_content:

We study the capacity of multiple-antenna fading channels. We focus on the scenario where the fading coefficients vary quickly; thus an accurate estimation of the coefficients is generally not available to either the transmitter or the receiver. We use a noncoherent block fading model proposed by Marzetta and Hochwald (see ibid. vol.45, p.139-57, 1999). The model does not assume any channel side information at the receiver or at the transmitter, but assumes that the coefficients remain constant for a coherence interval of length T symbol periods. We compute the asymptotic capacity of this channel at high signal-to-noise ratio (SNR) in terms of the coherence time T, the number of transmit antennas M, and the number of receive antennas N. While the capacity gain of the coherent multiple antenna channel is min{M, N} bits per second per Hertz for every 3-dB increase in SNR, the corresponding gain for the noncoherent channel turns out to be M* (1 - M*/T) bits per second per Hertz, where M*=min{M, N, [T/2]}. The capacity expression has a geometric interpretation as sphere packing in the Grassmann manifold.
---
paper_title: Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

paper_content:

Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. We propose the point of view that both types of gains can be simultaneously obtained for a given multiple-antenna channel, but there is a fundamental tradeoff between how much of each any coding scheme can get. For the richly scattered Rayleigh-fading channel, we give a simple characterization of the optimal tradeoff curve and use it to evaluate the performance of existing multiple antenna schemes.
---
paper_title: Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

paper_content:

Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. We propose the point of view that both types of gains can be simultaneously obtained for a given multiple-antenna channel, but there is a fundamental tradeoff between how much of each any coding scheme can get. For the richly scattered Rayleigh-fading channel, we give a simple characterization of the optimal tradeoff curve and use it to evaluate the performance of existing multiple antenna schemes.
---
paper_title: Microwave Mobile Communications

paper_content:

From the Publisher: ::: IEEE Press is pleased to bring back into print this definitive text and reference covering all aspects of microwave mobile systems design. Encompassing ten years of advanced research in the field, this invaluable resource reviews basic microwave theory, explains how cellular systems work, and presents useful techniques for effective systems development. The return of this classic volume should be welcomed by all those seeking the original authoritative and complete source of information on this emerging technology. An in-depth and practical guide, Microwave Mobile Communications will provide you with a solid understanding of the microwave propagation techniques essential to the design of effective cellular systems.
---
paper_title: On the Capacity of Certain Space-Time Coding Schemes

paper_content:

We take a capacity view of a number of different space-time coding (STC) schemes. While the Shannon capacity of multiple-input multiple-output (MIMO) channels has been known for a number of years now, the attainment of these capacities remains a challenging issue in many cases. The introduction of space-time coding schemes in the last 2–3 years has, however, begun paving the way towards the attainment of the promised capacities. In this work we attempt to describe what are the attainable information rates of certain STC schemes, by quantifying their inherent capacity penalties. The obtained results, which are validated for a number of typical cases, cast some interesting light on the merits and tradeoffs of different techniques. Further, they point to future work needed in bridging the gap between the theoretically expected capacities and the performance of practical systems.
---
paper_title: Space-time block codes: a capacity perspective

paper_content:

Space-time block codes are a remarkable modulation scheme discovered recently for the multiple antenna wireless channel. They have an elegant mathematical solution for providing full diversity over the coherent, flat-fading channel. In addition, they require extremely simple encoding and decoding. Although these codes provide full diversity at low computational costs, we show that they incur a loss in capacity because they convert the matrix channel into a scalar AWGN channel whose capacity is smaller than the true channel capacity. In this letter the loss in capacity is quantified as a function of channel rank, code rate, and number of receive antennas.
---
paper_title: Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity

paper_content:

We propose two signaling schemes that exploit the availability of multiple (N) antennas at the transmitter to provide diversity benefit to the receiver. This is typical of cellular radio systems where a mobile is equipped with only one antenna while the base station is equipped with multiple antennas. We further assume that the mobile-to-base and base-to-mobile channel variations are statistically independent and that the base station has no knowledge of the base-to-mobile channel characteristics. In the first scheme, a channel code of lengthN and minimum Hamming distanced ::: min≤N is used to encode a group ofK information bits. Channel code symbolc ::: ::: i ::: is transmitted with thei th antenna. At the receiver, a maximum likelihood decoder for the channel code provides a diversity ofd ::: min as long as each transmitted code symbol is subjected to independent fading. This can be achieved by spacing the transmit antennas several wavelengths apart. The second scheme introduces deliberate resolvable multipath distortion by transmitting the data-bearing signal with antenna 1, andN−1 delayed versions of it with antennas 2 throughN. The delays are unique to each antenna and are chosen to be multiples of the symbol interval. At the receiver, a maximum likelihood sequence estimator resolves the multipath in an optimal manner to realize a diversity benefit ofN. Both schemes can suppress co-channel interference. We provide code constructions and simulation results for scheme 1 to demonstrate its merit. We derive the receiver structure and provide a bound on the error probability for scheme 2 which we show to be tight, by means of simulations, for the nontrivial and perhaps the most interesting caseN=2 antennas. The second scheme is backward-compatible with two of the proposed digital cellular system standards, viz., GSM for Europe and IS-54 for North America.
---
paper_title: On the Capacity of Certain Space-Time Coding Schemes

paper_content:

We take a capacity view of a number of different space-time coding (STC) schemes. While the Shannon capacity of multiple-input multiple-output (MIMO) channels has been known for a number of years now, the attainment of these capacities remains a challenging issue in many cases. The introduction of space-time coding schemes in the last 2–3 years has, however, begun paving the way towards the attainment of the promised capacities. In this work we attempt to describe what are the attainable information rates of certain STC schemes, by quantifying their inherent capacity penalties. The obtained results, which are validated for a number of typical cases, cast some interesting light on the merits and tradeoffs of different techniques. Further, they point to future work needed in bridging the gap between the theoretically expected capacities and the performance of practical systems.
---
paper_title: Space-time coded OFDM for high data-rate wireless communication over wideband channels

paper_content:

There has been an increasing interest in providing high data-rate services such as video-conferencing, multimedia Internet access and wide area network over wideband wireless channels. Wideband wireless channels available in the PCS band (2 GHz) have been envisioned to be used by mobile (high Doppler) and stationary (low Doppler) units in a variety of delay spread profiles. This is a challenging task, given the limited link budget and severity of wireless environment, and calls for the development of novel robust bandwidth efficient techniques which work reliably at low SNRs. To this end, we design a space-time coded orthogonal frequency division multiplexing (OFDM) modulated physical layer. This combines coding and modulation. Space-time codes were previously proposed for narrowband wireless channels. These codes have high spectral efficiency and operate at very low SNR (within 2-3 dB of the capacity). On the other hand, OFDM has matured as a modulation scheme for wideband channels. We combine these two in a natural manner and propose a system achieving data rates of 1.5-3 Mbps over a 1 MHz bandwidth channel. This system requires 18-23 dB (resp. 9-14 dB) receive SNR at a frame error probability of 10/sup -2/ with two transmit and one receive antennas (resp. two transmit and two receive antennas). As space-time coding does not require any form of interleaving, the proposed system is attractive for delay-sensitive applications.
---
paper_title: On the capacity of OFDM-based spatial multiplexing systems

paper_content:

This paper deals with the capacity behavior of wireless orthogonal frequency-division multiplexing (OFDM)-based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown at the transmitter and perfectly known at the receiver. Introducing a physically motivated multiple-input multiple-output (MIMO) broad-band fading channel model, we study the influence of physical parameters such as the amount of delay spread, cluster angle spread, and total angle spread, and system parameters such as the number of antennas and antenna spacing on ergodic capacity and outage capacity. We find that, in the MIMO case, unlike the single-input single-output (SISO) case, delay spread channels may provide advantages over flat fading channels not only in terms of outage capacity but also in terms of ergodic capacity. Therefore, MIMO delay spread channels will in general provide both higher diversity gain and higher multiplexing gain than MIMO flat fading channels
---
paper_title: Spatio-Temporal Coding for Wireless Communication

paper_content:

Multipath signal propagation has long been viewed as an impairment to reliable communication in wireless channels. This paper shows that the presence of multipath greatly improves achievable data rate if the appropriate communication structure is employed. A compact model is developed for the multiple-input multiple-output (MIMO) dispersive spatially selective wireless communication channel. The multivariate information capacity is analyzed. For high signal-to-noise ratio (SNR) conditions, the MIMO channel can exhibit a capacity slope in bits per decibel of power increase that is proportional to the minimum of the number multipath components, the number of input antennas, or the number of output antennas. This desirable result is contrasted with the lower capacity slope of the well-studied case with multiple antennas at only one side of the radio link. A spatio-temporal vector-coding (STVC) communication structure is suggested as a means for achieving MIMO channel capacity. The complexity of STVC motivates a more practical reduced-complexity discrete matrix multitone (DMMT) space-frequency coding approach. Both of these structures are shown to be asymptotically optimum. An adaptive-lattice trellis-coding technique is suggested as a method for coding across the space and frequency dimensions that exist in the DMMT channel. Experimental examples that support the theoretical results are presented.
---
paper_title: Space-frequency coded broadband OFDM systems

paper_content:

Space-time coding for fading channels is a communication technique that realizes the diversity benefits of multiple transmit antennas. Previous work in this area has focused on the narrowband flat fading case where spatial diversity only is available. We investigate the use of space-time coding in OFDM-based broadband systems where both spatial and frequency diversity are available. We consider a strategy which basically consists of coding across OFDM tones and is therefore called space-frequency coding. For a spatial broadband channel model taking into account physical propagation parameters and antenna spacing, we derive the design criteria for space-frequency codes and we show that space-time codes designed to achieve full spatial diversity in the narrowband case will in general not achieve full space-frequency diversity. Specifically, we show that the Alamouti (see IEEE J. Sel. Areas Comm., vol.16, p.1451-58, 1998) scheme across tones fails to exploit frequency diversity. For a given set of propagation parameters and given antenna spacing, we establish the maximum achievable diversity order. Finally, we provide simulation results studying the influence of delay spread, propagation parameters, and antenna spacing on the performance of space-frequency codes.
---
paper_title: Space-time coded OFDM for high data-rate wireless communication over wideband channels

paper_content:

There has been an increasing interest in providing high data-rate services such as video-conferencing, multimedia Internet access and wide area network over wideband wireless channels. Wideband wireless channels available in the PCS band (2 GHz) have been envisioned to be used by mobile (high Doppler) and stationary (low Doppler) units in a variety of delay spread profiles. This is a challenging task, given the limited link budget and severity of wireless environment, and calls for the development of novel robust bandwidth efficient techniques which work reliably at low SNRs. To this end, we design a space-time coded orthogonal frequency division multiplexing (OFDM) modulated physical layer. This combines coding and modulation. Space-time codes were previously proposed for narrowband wireless channels. These codes have high spectral efficiency and operate at very low SNR (within 2-3 dB of the capacity). On the other hand, OFDM has matured as a modulation scheme for wideband channels. We combine these two in a natural manner and propose a system achieving data rates of 1.5-3 Mbps over a 1 MHz bandwidth channel. This system requires 18-23 dB (resp. 9-14 dB) receive SNR at a frame error probability of 10/sup -2/ with two transmit and one receive antennas (resp. two transmit and two receive antennas). As space-time coding does not require any form of interleaving, the proposed system is attractive for delay-sensitive applications.
---
paper_title: On the capacity of OFDM-based spatial multiplexing systems

paper_content:

This paper deals with the capacity behavior of wireless orthogonal frequency-division multiplexing (OFDM)-based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown at the transmitter and perfectly known at the receiver. Introducing a physically motivated multiple-input multiple-output (MIMO) broad-band fading channel model, we study the influence of physical parameters such as the amount of delay spread, cluster angle spread, and total angle spread, and system parameters such as the number of antennas and antenna spacing on ergodic capacity and outage capacity. We find that, in the MIMO case, unlike the single-input single-output (SISO) case, delay spread channels may provide advantages over flat fading channels not only in terms of outage capacity but also in terms of ergodic capacity. Therefore, MIMO delay spread channels will in general provide both higher diversity gain and higher multiplexing gain than MIMO flat fading channels
---
paper_title: A Simple Transmit Diversity Technique for Wireless Communications

paper_content:

This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the scheme may easily be generalized to two transmit antennas and receive antennas to provide a diversity order of 2. The new scheme does not require any bandwidth expansion any feedback from the receiver to the transmitter and its computation complexity is similar to MRRC.
---
paper_title: Space-time code design in OFDM systems

paper_content:

We consider a space-time coded (STC) orthogonal frequency-division multiplexing (OFDM) system in frequency-selective fading channels. By analyzing the pairwise error probability (PEP), we show that STC-OFDM systems can potentially provide a diversity order as the product of the number of transmitter antennas, the number of receiver antennas and the frequency selectivity order, and that the large effective length and the ideal interleaving are two most important principles in designing STCs for OFDM systems. Following these principles, we propose a new class of trellis-structured STCs. Compared with the conventional space-time trellis codes, our proposed STC's significantly improve the performance by efficiently exploiting both the spatial diversity and the frequency-selective-fading diversity.
---
paper_title: LDPC-based space-time coded OFDM systems over correlated fading channels: performance analysis and receiver design

paper_content:

We consider the performance analysis and the receiver design of low-density parity-check (LDPC) code based space-time coded (STC) orthogonal frequency-division multiplexing (OFDM) system over correlated frequency- and time-selective fading channels.
---
paper_title: A transmit diversity scheme for frequency selective fading channels

paper_content:

We propose a transmit diversity scheme for frequency selective fading channels using orthogonal frequency division multiplexing (OFDM). The transmit diversity scheme proposed by Alamouti (see IEEE JSAC, vol.16, no.8, p.1451-58, 1998) for flat fading channels is extended to the case when the channel has a delay spread. There is no loss in receive SNR due to the delay spread in the channel. A diversity order of 2N can be achieved by using two transmit and N receive antennas. We discuss several interesting aspects of the approach and compare it with other extensions of the Alamouti scheme for delay spread channels.
---
paper_title: Space-frequency codes for broadband fading channels

paper_content:

The use of space-frequency coding in orthogonal frequency division multiplexing (OFDM)-based broadband multi-antenna systems has been proposed. The design criteria for space-frequency codes derived by Bolcskei and Paulraj (see Proc. IEEE WCNC-2000, Chicago, IL, vol.1, p.1-6, 2000) are vastly different from the well-known design criteria for space-time codes. In this paper, we provide an explicit construction of a class of space-frequency codes which achieve full spatial and frequency diversity.
---
paper_title: Space-frequency coded broadband OFDM systems

paper_content:

Space-time coding for fading channels is a communication technique that realizes the diversity benefits of multiple transmit antennas. Previous work in this area has focused on the narrowband flat fading case where spatial diversity only is available. We investigate the use of space-time coding in OFDM-based broadband systems where both spatial and frequency diversity are available. We consider a strategy which basically consists of coding across OFDM tones and is therefore called space-frequency coding. For a spatial broadband channel model taking into account physical propagation parameters and antenna spacing, we derive the design criteria for space-frequency codes and we show that space-time codes designed to achieve full spatial diversity in the narrowband case will in general not achieve full space-frequency diversity. Specifically, we show that the Alamouti (see IEEE J. Sel. Areas Comm., vol.16, p.1451-58, 1998) scheme across tones fails to exploit frequency diversity. For a given set of propagation parameters and given antenna spacing, we establish the maximum achievable diversity order. Finally, we provide simulation results studying the influence of delay spread, propagation parameters, and antenna spacing on the performance of space-frequency codes.
---
paper_title: Space-frequency coded MIMO-OFDM with variable multiplexing-diversity tradeoff

paper_content:

Space-frequency coded orthogonal frequency division multiplexing (OFDM) is capable of realizing both spatial and frequency-diversity gains in multipath multiple-input multiple-output (MIMO) fading channels. This naturally leads to the question of variable allocation of the channel's degrees of freedom to multiplexing and diversity transmission modes. In this paper, we provide a systematic method for the design of space-frequency codes with variable multiplexing-diversity tradeoffs. Simulation results illustrate the performance of the proposed codes.
---
paper_title: Turbo codes for OFDM with antenna diversity

paper_content:

OFDM with diversity and coding has been proposed as an effective means for achieving high-rates in wireless environments. Turbo codes have been shown to give near-capacity performance in additive white Gaussian noise (AWGN) channels and is being considered to enhance mobile wireless channel performance. In this paper, we present simulation results of an OFDM system with turbo coding. Comparisons with systems employing convolutional and Reed-Solomon (RS) codes are made. We first study diversity, interleaving and soft decoding for convolutional codes. The same structure is employed for turbo codes of similar complexity and varying word size. Even with a low constraint length, convolutional codes have the potential to outperform RS codes, provided that the interleaver and soft decoder are properly designed. We evaluate Turbo code performance under slow fading conditions and study the effects of changing word size. Increasing word size theoretically provides better interleaving between the two component codes. However, this advantage is less clear when the fading rate is significantly lower than the symbol rate, which is typical of the high data-rate system considered here. Under such conditions, the advantage of using two component convolutional codes in turbo codes is limited. A single convolutional code with higher constraint length may be a better choice.
---
paper_title: Coding strategies for OFDM with antenna diversity high-bit-rate mobile data applications

paper_content:

In this paper, we investigate coding strategies for an OFDM system with antenna diversity. To maximize coding efficiency, interleaving in the two-dimensional frequency-time domain is studied. In particular, transmission over multiple antennas, which achieves an interleaving effect by randomizing the fading over the subchannels, is employed. Based on the best interleaving method, we consider convolutional coding and compare its performance with that of Reed-Solomon coding. Simulation results indicate that a 1/2-rate convolutional code requires a constraint length of at least 6, with soft decisions, to achieve better performance than a 1/2-rate (40,20) Reed-Solomon code with 6-bit symbols and a combination of erasure and error correction. In addition, a concatenated coding scheme, combining convolutional and Reed-Solomon coding, is presented and is shown to achieve improved performance with lower complexity.
---
paper_title: Impact of the propagation environment on the performance of space-frequency coded MIMO-OFDM

paper_content:

Previous work on space-frequency coded multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) has been restricted to idealistic propagation conditions. In this paper, using a broadband MIMO channel model taking into account Ricean K-factor, transmit and receive angle spread, and antenna spacing, we study the impact of the propagation environment on the performance of space-frequency coded MIMO-OFDM. For a given space-frequency code, we quantify the achievable diversity order and coding gain as a function of the propagation parameters. We find that while the presence of spatial receive correlation affects all space-frequency codes equally, spatial fading correlation at the transmit array can result in widely varying performance losses. High-rate space-frequency codes such as spatial multiplexing are typically significantly more affected by transmit correlation than low-rate codes such as space-frequency block codes. We show that in the MIMO Ricean case the presence of frequency-selectivity typically results in improved performance compared to the frequency-flat case.
---

Title: An overview of MIMO communications - a key to gigabit wireless

Section 1: INTRODUCTION
Description 1: Discuss the motivation for high data rate wireless communication and introduce the concept of MIMO technology.

Section 2: BUILDING GIGABIT WIRELESS LINKS
Description 2: Explore design tradeoffs and limitations in building high-speed wireless systems, highlighting the benefits of MIMO technology.

Section 3: MIMO CHANNEL MODEL
Description 3: Introduce the MIMO channel model suitable for NLOS environments, including physical scattering models and real-world channel measurements.

Section 4: CAPACITY OF MIMO CHANNELS
Description 4: Examine the capacity benefits of MIMO channels through theoretical models, providing both ergodic and outage capacity analysis for various fading conditions.

Section 5: MIMO SIGNALING
Description 5: Review basic signaling techniques for MIMO systems, focusing on space-time diversity coding and spatial multiplexing schemes.

Section 6: MIMO RECEIVER ARCHITECTURES
Description 6: Discuss receiver architectures, including ML, linear, and successive cancellation receivers, highlighting their performance and complexity tradeoffs.

Section 7: FUNDAMENTAL PERFORMANCE LIMITS
Description 7: Examine the fundamental tradeoffs between transmission rate, error rate, and SNR for MIMO systems, providing insights into optimal and suboptimal coding schemes.

Section 8: MIMO-OFDM
Description 8: Discuss the integration of MIMO with OFDM modulation, addressing signaling techniques and receiver strategies for frequency-selective fading channels.

Section 9: CONCLUSION
Description 9: Summarize the key points discussed in the paper and provide a brief outlook on future research directions and practical implementation challenges.