Wireless Communications over MIMO Channels

Volker Kühn is Assistant Professor, at the Department of Communications Engineering, University of Bremen, Germany. He completed his Ph.D. at the University of Paderborn, Germany (1994-1998). He has also undertaken consultation work for Siemens AG and Infineon Technologies, and is a member of the IEEE.

• Preface xiAcknowledgements xvList of Abbreviations xviiList of Symbols xxi1 Introduction to Digital Communications 11.1 Basic SystemModel 11.1.1 Introduction 11.1.2 Multiple Access Techniques 31.1.3 Principle Structure of SISO Systems 51.2 Characteristics ofMobile Radio Channels 81.2.1 Equivalent Baseband Representation 81.2.2 Additive White Gaussian Noise 111.2.3 Frequency-Selective Time-Variant Fading 121.2.4 Systems with Multiple Inputs and Outputs 161.3 Signal Detection 181.3.1 Optimal Decision Criteria 181.3.2 Error Probability for AWGN Channel 201.3.3 Error and Outage Probability for Flat Fading Channels 221.3.4 Time-Discrete Matched Filter 251.4 Digital Linear Modulation 271.4.1 Introduction 271.4.2 Amplitude Shift Keying (ASK) 281.4.3 Quadrature Amplitude Modulation (QAM) 301.4.4 Phase Shift Keying (PSK) 331.5 Diversity 361.5.1 General Concept 361.5.2 MRC for Independent Diversity Branches 401.5.3 MRC for Correlated Diversity Branches 471.6 Summary 492 Information Theory 512.1 Basic Definitions 512.1.1 Information, Redundancy, and Entropy 512.1.2 Conditional, Joint and Mutual Information 532.1.3 Extension for Continuous Signals 562.1.4 Extension for Vectors and Matrices 572.2 Channel Coding Theorem for SISO Channels 582.2.1 Channel Capacity 582.2.2 Cutoff Rate 592.2.3 Gallager Exponent 622.2.4 Capacity of the AWGN Channel 642.2.5 Capacity of Fading Channel 682.2.6 Channel Capacity and Diversity 702.3 Channel Capacity ofMIMO Systems 732.4 Channel Capacity for Multiuser Communications 782.4.1 Single Antenna AWGN Channel 782.4.2 Single Antenna Flat Fading Channel 822.4.3 Multiple Antennas at Transmitter and Receiver 852.5 Summary 893 Forward Error Correction Coding 913.1 Introduction 923.2 Linear Block Codes 943.2.1 Description byMatrices 943.2.2 Simple Parity Check and Repetition Codes 973.2.3 Hamming and Simplex Codes 983.2.4 Hadamard Codes 993.2.5 Trellis Representation of Linear Block Codes 993.3 Convolutional Codes 1003.3.1 Structure of Encoder 1013.3.2 Graphical Description of Convolutional Codes 1043.3.3 Puncturing Convolutional Codes 1053.3.4 ML Decoding with Viterbi Algorithm 1063.4 Soft-Output Decoding of Binary Codes 1093.4.1 Log-Likelihood Ratios – A Measure of Reliability 1093.4.2 General Approach for Soft-Output Decoding 1123.4.3 Soft-Output Decoding for Walsh Codes 1143.4.4 BCJR Algorithm for Binary Block Codes 1153.4.5 BCJR Algorithm for Binary Convolutional Codes 1183.4.6 Implementation in Logarithmic Domain 1203.5 Performance Evaluation of Linear Codes 1213.5.1 Distance Properties of Codes 1213.5.2 Error Rate Performance of Codes 1253.5.3 Information Processing Characteristic 1313.6 Concatenated Codes 1353.6.1 Introduction 1353.6.2 Performance Analysis for Serial Concatenation 1373.6.3 Performance Analysis for Parallel Concatenation 1413.6.4 Turbo Decoding of Concatenated Codes 1463.6.5 EXIT Charts Analysis of Turbo Decoding 1533.7 Low-Density Parity Check (LDPC) Codes 1603.7.1 Basic Definitions and Encoding 1603.7.2 Graphical Description 1653.7.3 Decoding of LDPC Codes 1673.7.4 Performance of LDPC Codes 1693.8 Summary 1714 Code Division Multiple Access 1734.1 Fundamentals 1744.1.1 Direct-Sequence Spread Spectrum 1744.1.2 Direct-Sequence CDMA 1814.1.3 Single-User Matched Filter (SUMF) 1854.1.4 Spreading Codes 1914.2 OFDM-CDMA 1944.2.1 Multicarrier Transmission 1944.2.2 Orthogonal Frequency Division Multiplexing 1954.2.3 Combining OFDMand CDMA 2004.3 Low-Rate Channel Coding in CDMA Systems 2084.3.1 Conventional Coding Scheme (CCS) 2094.3.2 Code-Spread Scheme (CSS) 2104.3.3 Serially Concatenated Coding Scheme (SCCS) 2114.3.4 Parallel Concatenated Coding Scheme (PCCS) 2144.3.5 Influence of MUI on Coding Schemes 2164.4 Uplink Capacity of CDMA Systems 2194.4.1 Orthogonal Spreading Codes 2204.4.2 Random Spreading Codes and Optimum Receiver 2204.4.3 Random Spreading Codes and Linear Receivers 2224.5 Summary 2255 Multiuser Detection in CDMA Systems 2275.1 Optimum Detection 2275.1.1 Optimum Joint Sequence Detection 2285.1.2 Joint Preprocessing and Subsequent Separate Decoding 2295.1.3 Turbo Detection with Joint Preprocessing and Separate Decoding 2315.2 Linear Multiuser Detection 2335.2.1 Decorrelator (Zero-Forcing, ZF) 2335.2.2 Minimum Mean Squared Error Receiver (MMSE) 2365.2.3 Linear Parallel Interference Cancellation (PIC) 2405.2.4 Linear Successive Interference Cancellation (SIC) 2435.3 Nonlinear Iterative Multiuser Detection 2455.3.1 Nonlinear Devices 2455.3.2 Uncoded Nonlinear Interference Cancellation 2475.3.3 Nonlinear Coded Interference Cancellation 2535.4 Combining Linear MUD and Nonlinear SIC 2585.4.1 BLAST-like Detection 2585.4.2 QL Decomposition for Zero-Forcing Solution 2585.4.3 QL Decomposition for MMSE Solution 2685.4.4 Turbo Processing 2705.5 Summary 2736 Multiple Antenna Systems 2756.1 Introduction 2756.2 Spatial Diversity Concepts 2776.2.1 Receive Diversity 2776.2.2 Performance Analysis of Space–Time Codes 2796.2.3 Orthogonal Space–Time Block Codes 2826.2.4 Space–Time Trellis Codes 2936.3 Multilayer Transmission 3046.3.1 Channel Knowledge at the Transmitter and Receiver 3046.3.2 Channel Knowledge only at the Receiver 3066.3.3 Performance of Multilayer Detection Schemes 3086.3.4 Lattice Reduction-Aided Detection 3126.4 Linear Dispersion Codes 3196.4.1 LD Description of Alamouti’s Scheme 3206.4.2 LD Description of Multilayer Transmissions 3216.4.3 LD Description of Beamforming 3216.4.4 Optimizing Linear Dispersion Codes 3226.4.5 Detection of Linear Dispersion Codes 3236.5 Information Theoretic Analysis 3236.5.1 UncorrelatedMIMO Channels 3236.5.2 CorrelatedMIMO Channels 3256.6 Summary 328Appendix A Channel Models 329A.1 Equivalent Baseband Representation 329A.2 Typical Propagation Profiles for Outdoor Mobile Radio Channels 330A.3 Moment-Generating Function for Ricean Fading 331Appendix B Derivations for Information Theory 333B.1 Chain Rule for Entropies 333B.2 Chain Rule for Information 333B.3 Data-Processing Theorem 334Appendix C Linear Algebra 335C.1 Selected Basics 335C.2 Householder Reflections and Givens Rotation 341C.3 LLL Lattice Reduction 343Bibliography 347Index 359