Wireless Communications over MIMO Channels: Applications to CDMA and Multiple Antenna Systems covers both, state-of-the-art channel coding concepts and CDMA and multiple antenna systems, rarely found in other books on the subject.Furthermore, an information theoretical analysis of CDMA and SDMA systems illuminate ultimate limits and demonstrates the high potential of these concepts. Besides spatial multiplexing, the use of multiple transmit antennas in order to increase the link reliability by diversity concepts (space-time coding) is described. Another focus is the application of error control coding in mobile radio communicationsAccompanying appendices include: basic derivations, tables of frequently used channel models, chain rules for entropy and information, data processing theorem, basics of linear algebra, Householder reflection and Givens rotation, and the LLL algorithm for lattice reduction.

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

xi

Acknowledgements

xv

List of Abbreviations

xvii

List of Symbols

xxi

1 Introduction to Digital Communications

1

(50)

1.1 Basic System Model

1

(7)

1.1.1 Introduction

1

(2)

1.1.2 Multiple Access Techniques

3

(2)

1.1.3 Principle Structure of SISO Systems

5

(3)

1.2 Characteristics of Mobile Radio Channels

8

(10)

1.2.1 Equivalent Baseband Representation

8

(3)

1.2.2 Additive White Gaussian Noise

11

(1)

1.2.3 Frequency-Selective Time-Variant Fading

12

(4)

1.2.4 Systems with Multiple Inputs and Outputs

16

(2)

1.3 Signal Detection

18

(9)

1.3.1 Optimal Decision Criteria

18

(2)

1.3.2 Error Probability for AWGN Channel

20

(2)

1.3.3 Error and Outage Probability for Flat Fading Channels

22

(3)

1.3.4 Time-Discrete Matched Filter

25

(2)

1.4 Digital Linear Modulation

27

(9)

1.4.1 Introduction

27

(1)

1.4.2 Amplitude Shift Keying (ASK)

28

(2)

1.4.3 Quadrature Amplitude Modulation (QAM)

30

(3)

1.4.4 Phase Shift Keying (PSK)

33

(3)

1.5 Diversity

36

(13)

1.5.1 General Concept

36

(4)

1.5.2 MRC for Independent Diversity Branches

40

(7)

1.5.3 MRC for Correlated Diversity Branches

47

(2)

1.6 Summary

49

(2)

2 Information Theory

51

(40)

2.1 Basic Definitions

51

(7)

2.1.1 Information, Redundancy, and Entropy

51

(2)

2.1.2 Conditional, Joint and Mutual Information

53

(3)

2.1.3 Extension for Continuous Signals

56

(1)

2.1.4 Extension for Vectors and Matrices

57

(1)

2.2 Channel Coding Theorem for SISO Channels

58

(15)

2.2.1 Channel Capacity

58

(1)

2.2.2 Cutoff Rate

59

(3)

2.2.3 Gallager Exponent

62

(2)

2.2.4 Capacity of the AWGN Channel

64

(4)

2.2.5 Capacity of Fading Channel

68

(2)

2.2.6 Channel Capacity and Diversity

70

(3)

2.3 Channel Capacity of MIMO Systems

73

(5)

2.4 Channel Capacity for Multiuser Communications

78

(11)

2.4.1 Single Antenna AWGN Channel

78

(4)

2.4.2 Single Antenna Flat Fading Channel

82

(3)

2.4.3 Multiple Antennas at Transmitter and Receiver

85

(4)

2.5 Summary

89

(2)

3 Forward Error Correction Coding

91

(82)

3.1 Introduction

92

(2)

3.2 Linear Block Codes

94

(6)

3.2.1 Description by Matrices

94

(3)

3.2.2 Simple Parity Check and Repetition Codes

97

(1)

3.2.3 Hamming and Simplex Codes

98

(1)

3.2.4 Hadamard Codes

99

(1)

3.2.5 Trellis Representation of Linear Block Codes

99

(1)

3.3 Convolutional Codes

100

(9)

3.3.1 Structure of Encoder

101

(3)

3.3.2 Graphical Description of Convolutional Codes

104

(1)

3.3.3 Puncturing Convolutional Codes

105

(1)

3.3.4 ML Decoding with Viterbi Algorithm

106

(3)

3.4 Soft-Output Decoding of Binary Codes

109

(12)

3.4.1 Log-Likelihood Ratios – A Measure of Reliability

109

(3)

3.4.2 General Approach for Soft-Output Decoding

112

(2)

3.4.3 Soft-Output Decoding for Walsh Codes

114

(1)

3.4.4 BCJR Algorithm for Binary Block Codes

115

(3)

3.4.5 BCJR Algorithm for Binary Convolutional Codes

118

(2)

3.4.6 Implementation in Logarithmic Domain

120

(1)

3.5 Performance Evaluation of Linear Codes

121

(14)

3.5.1 Distance Properties of Codes

121

(4)

3.5.2 Error Rate Performance of Codes

125

(6)

3.5.3 Information Processing Characteristic

131

(4)

3.6 Concatenated Codes

135

(25)

3.6.1 Introduction

135

(2)

3.6.2 Performance Analysis for Serial Concatenation

137

(4)

3.6.3 Performance Analysis for Parallel Concatenation

141

(5)

3.6.4 Turbo Decoding of Concatenated Codes

146

(7)

3.6.5 EXIT Charts Analysis of Turbo Decoding

153

(7)

3.7 Low-Density Parity Check (LDPC) Codes

160

(11)

3.7.1 Basic Definitions and Encoding

160

(5)

3.7.2 Graphical Description

165

(2)

3.7.3 Decoding of LDPC Codes

167

(2)

3.7.4 Performance of LDPC Codes

169

(2)

3.8 Summary

171

(2)

4 Code Division Multiple Access

173

(54)

4.1 Fundamentals

174

(20)

4.1.1 Direct-Sequence Spread Spectrum

174

(7)

4.1.2 Direct-Sequence CDMA

181

(4)

4.1.3 Single-User Matched Filter (SUMF)

185

(6)

4.1.4 Spreading Codes

191

(3)

4.2 OFDM-CDMA

194

(14)

4.2.1 Multicarrier Transmission

194

(1)

4.2.2 Orthogonal Frequency Division Multiplexing

195

(5)

4.2.3 Combining OFDM and CDMA

200

(8)

4.3 Low-Rate Channel Coding in CDMA Systems

208

(11)

4.3.1 Conventional Coding Scheme (CCS)

209

(1)

4.3.2 Code-Spread Scheme (CSS)

210

(1)

4.3.3 Serially Concatenated Coding Scheme (SCCS)

211

(3)

4.3.4 Parallel Concatenated Coding Scheme (PCCS)

214

(2)

4.3.5 Influence of MUI on Coding Schemes

216

(3)

4.4 Uplink Capacity of CDMA Systems

219

(6)

4.4.1 Orthogonal Spreading Codes

220

(1)

4.4.2 Random Spreading Codes and Optimum Receiver

220

(2)

4.4.3 Random Spreading Codes and Linear Receivers

222

(3)

4.5 Summary

225

(2)

5 Multiuser Detection in CDMA Systems

227

(48)

5.1 Optimum Detection

227

(6)

5.1.1 Optimum Joint Sequence Detection

228

(1)

5.1.2 Joint Preprocessing and Subsequent Separate Decoding

229

(2)

5.1.3 Turbo Detection with Joint Preprocessing and Separate Decoding

231

(2)

5.2 Linear Multiuser Detection

233

(12)

5.2.1 Decorrelator (Zero-Forcing, ZF)

233

(3)

5.2.2 Minimum Mean Squared Error Receiver (MMSE)

236

(4)

5.2.3 Linear Parallel Interference Cancellation (PIC)

240

(3)

5.2.4 Linear Successive Interference Cancellation (SIC)

243

(2)

5.3 Nonlinear Iterative Multiuser Detection

245

(13)

5.3.1 Nonlinear Devices

245

(2)

5.3.2 Uncoded Nonlinear Interference Cancellation

247

(6)

5.3.3 Nonlinear Coded Interference Cancellation

253

(5)

5.4 Combining Linear MUD and Nonlinear SIC

258

(15)

5.4.1 BLAST-like Detection

258

(1)

5.4.2 QL Decomposition for Zero-Forcing Solution

258

(10)

5.4.3 QL Decomposition for MMSE Solution

268

(2)

5.4.4 Turbo Processing

270

(3)

5.5 Summary

273

(2)

6 Multiple Antenna Systems

275

(54)

6.1 Introduction

275

(2)

6.2 Spatial Diversity Concepts

277

(27)

6.2.1 Receive Diversity

277

(2)

6.2.2 Performance Analysis of Space–Time Codes

279

(3)

6.2.3 Orthogonal Space–Time Block Codes

282

(11)

6.2.4 Space–Time Trellis Codes

293

(11)

6.3 Multilayer Transmission

304

(15)

6.3.1 Channel Knowledge at the Transmitter and Receiver

304

(2)

6.3.2 Channel Knowledge only at the Receiver

306

(2)

6.3.3 Performance of Multilayer Detection Schemes

308

(4)

6.3.4 Lattice Reduction-Aided Detection

312

(7)

6.4 Linear Dispersion Codes

319

(4)

6.4.1 LD Description of Alamouti's Scheme

320

(1)

6.4.2 LD Description of Multilayer Transmissions

321

(1)

6.4.3 LD Description of Beamforming

321

(1)

6.4.4 Optimizing Linear Dispersion Codes

322

(1)

6.4.5 Detection of Linear Dispersion Codes

323

(1)

6.5 Information Theoretic Analysis

323

(5)

6.5.1 Uncorrelated MIMO Channels

323

(2)

6.5.2 Correlated MIMO Channels

325

(3)

6.6 Summary

328

(1)

Appendix A Channel Models

329

(4)

A.1 Equivalent Baseband Representation

329

(1)

A.2 Typical Propagation Profiles for Outdoor Mobile Radio Channels

330

(1)

A.3 Moment-Generating Function for Ricean Fading

331

(2)

Appendix B Derivations for Information Theory

333

(2)

B.1 Chain Rule for Entropies

333

(1)

B.2 Chain Rule for Information

333

(1)

B.3 Data-Processing Theorem

334

(1)

Appendix C Linear Algebra

335

(12)

C.1 Selected Basics

335

(6)

C.2 Householder Reflections and Givens Rotation

341

(2)

C.3 LLL Lattice Reduction

343

(4)

Bibliography

347

(12)

Index

359

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.