Space-Time Coding for Broadband Wireless Communications,9780471214793

Space-Time Coding for Broadband Wireless Communications

by ; ; ;
Edition: 1st
ISBN13: 9780471214793
ISBN10: 0471214795
Format: Hardcover
Pub. Date: 2006-12-22
Publisher(s): Wiley-Interscience
List Price: $153.54

Buy New

Usually Ships in 8 - 10 Business Days.
$153.39
Add to Cart

Rent Textbook

Select for Price
Add to Cart
There was a problem. Please try again later.

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

Buy from our Marketplace starting at $89.01

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

This is the first book on space-time coding for wireless communications, one of the most promising techniques for ensuring bandwidth efficiency. The text describes theoretical principles as well as engineering applications; discusses key criteria in the design of practical space-time codes; and covers single-carrier and multi-carrier transmission for both single- and multi-user communications.

Author Biography

GEORGIOS B. GIANNAKIS, PhD, is ADC Endowed Chair Professor in Wireless Telecommunications with the Department of Electrical and Computer Engineering at the University of Minnesota. He is a Fellow of the IEEE, a (co-)recipient of six IEEE best paper awards (including the IEEE Communication Society's 2004 Guglielmo Marconi Prize Paper), and a recipient of the IEEE Signal Processing Society's Technical Achievement Award. His interests and expertise span the areas of wireless communications, wireless networks, sensor networks, and statistical signal processing.

ZHIQIANG LIU, PhD, is Assistant Professor with the Department of Electrical and Computer Engineering at the University of Iowa. His research interests include space-time coding and processing, wireless communications theory, synchronization, channel estimation, and sensor networks.

XIAOLI MA, PhD, is Assistant Professor with the School of Electrical and Computer Engineering at the Georgia Institute of Technology. Her research interests include signal processing for communications and networking, signal estimation algorithms, wireless communications theory, and sensor networks.

SHENGLI ZHOU, PhD, is Assistant Professor with the Department of Electrical and Computer Engineering at the University of Connecticut. His research interests include wireless communications and signal processing, underwater acoustic communications and networking, and wireless positioning and synchronization.

Table of Contents

Preface xv
Acronyms xix
1 Motivation and Context
1
1.1 Evolution of Wireless Communication Systems
2
1.2 Wireless Propagation Effects
3
1.3 Parameters and Classification of Wireless Channels
5
1.3.1 Delay Spread and Coherence Bandwidth
6
1.3.2 Doppler Spread and Coherence Time
7
1.4 Providing, Enabling, and Collecting Diversity
11
1.4.1 Diversity Provided by Frequency-Selective Channels
11
1.4.2 Diversity Provided by Time-Selective Channels
13
1.4.3 Diversity Provided by Multi-Antenna Channels
15
1.5 Chapter-by-Chapter Organization
18
2 Fundamentals of ST Wireless Communications
23
2.1 Generic ST System Model
23
2.2 ST Coding viz Channel Coding
27
2.3 Capacity of ST Channels
29
2.3.1 Outage Capacity
30
2.3.2 Ergodic Capacity
34
2.4 Error Performance of ST Coding
39
2.5 Design Criteria for ST Codes
43
2.6 Diversity and Rate: Finite SNR viz Asymptotics
44
2.7 Classification of ST Codes
48
2.8 Closing Comments
50
3 Coherent ST Codes for Flat Fading Channels
51
3.1 Delay Diversity ST Codes
51
3.2 ST Trellis Codes
53
3.2.1 Trellis Representation
53
3.2.2 TSC ST Trellis Codes
55
3.2.3 BBH ST Trellis Codes
56
3.2.4 GFK ST Trellis Codes
58
3.2.5 Viterbi Decoding of ST Trellis Codes
60
3.3 Orthogonal ST Block Codes
61
3.3.1 Encoding of OSTBCs
61
3.3.2 Linear ML Decoding of OSTBCs
63
3.3.3 BER Performance with OSTBCs
65
3.3.4 Channel Capacity with OSTBCs
66
3.4 Quasi-Orthogonal ST Block Codes
68
3.5 ST Linear Complex Field Codes
70
3.5.1 Antenna Switching and Linear Precoding
71
3.5.2 Designing Linear Precoding Matrices
72
3.5.3 Upper Bound on Coding Gain
72
3.5.4 Construction Based on Parameterization
73
3.5.5 Construction Based on Algebraic Tools
74
3.5.6 Decoding ST Linear Complex Field Codes
76
3.5.7 Modulus-Preserving STLCFC
79
3.6 Linking OSTBC, QO-STBC, and STLCFC Designs
82
3.6.1 Embedding MP-STLCFCs into the Alamouti Code
82
3.6.2 Embedding 2 x 2 MP-STLCFCs into an OSTBC
83
3.6.3 Decoding QO-MP-STLCFC
84
3.7 Closing Comments
85
4 Layered ST Codes
87
4.1 BLAST Designs
88
4.1.1 D-BLAST
88
4.1.2 V-BLAST
91
4.1.3 Rate Performance with BLAST Codes
92
4.2 ST Codes Trading Diversity for Rate
93
4.2.1 Layered ST Codes with Antenna Grouping
93
4.2.2 Layered High-Rate Codes
94
4.3 Full-Diversity Full-Rate ST Codes
94
4.3.1 FDFR Transceiver
95
4.3.2 Algebraic FDFR Code Design
98
4.3.3 Mutual Information Analysis
99
4.3.4 Diversity-Rate-Performance Trade-offs
99
4.4 Numerical Examples
101
4.5 Closing Comments
104
5 Sphere Decoding and (Near-)Optimal MIMO Demodulation
105
5.1 Sphere Decoding Algorithm
106
5.1.1 Selecting a Finite Search Radius
108
5.1.2 Initializing with Unconstrained LS
109
5.1.3 Searching Within the Fixed-Radius Sphere
110
5.2 Average Complexity of The SDA in Practice
113
5.3 SDA Improvements
117
5.3.1 SDA with Detection Ordering and Nulling-Canceling
117
5.3.2 Schnorr-Euchner Variate of the SDA
118
5.3.3 SDA with Increasing Radius Search
119
5.3.4 Simulated Comparisons
120
5.4 Reduced-Complexity IRS-SDA
123
5.5 Soft-Decision Sphere Decoding
125
5.5.1 List Sphere Decoding
126
5.5.2 Soft SDA Using Hard SDAs
127
5.6 Closing Comments
129
6 Noncoherent and Differential ST Codes for Flat Fading Channels
133
6.1 Noncoherent ST Codes
133
6.1.1 Search-Based Designs
135
6.1.2 Training-Based Designs
138
6.2 Differential ST Codes
139
6.2.1 Scalar Differential Codes
140
6.2.2 Differential Unitary ST Codes
141
6.2.3 Differential Alamouti Codes
144
6.2.4 Differential OSTBCs
147
6.2.5 Cayley Differential Unitary ST Codes
148
6.3 Closing Comments
150
7 ST Codes for Frequency-Selective Fading Channels: Single-Carrier Systems
151
7.1 System Model and Performance Limits
152
7.1.1 Flat Fading Equivalence and Diversity
153
7.1.2 Rate Outage Probability
154
7.2 ST Trellis Codes
156
7.2.1 Generalized Delay Diversity
156
7.2.2 Search-Based STTC Construction
158
7.3 ST Block Codes
161
7.3.1 Block Coding with Two Transmit-Antennas
161
7.3.2 Receiver Processing
164
7.3.3 ML Decoding Based on the Viterbi Algorithm
167
7.3.4 Turbo Equalization
168
7.3.5 Multi-Antenna Extensions
169
7.3.6 OSTBC Properties
172
7.3.7 Numerical Examples
174
7.4 Closing Comments
177
8 ST Codes for Frequency-Selective Channels: Multi-Carrier Systems
179
8.1 General MIMO OFDM Framework
180
8.1.1 OFDM Basics
180
8.1.2 MIMO OFDM
183
8.1.3 STF Framework
184
8.2 ST and SF Coded MIMO OFDM
188
8.3 STF Coded OFDM
189
8.3.1 Subcarrier Grouping
189
8.3.2 GSTF Block Codes
190
8.3.3 GSTF Trellis Codes
192
8.3.4 Numerical Examples
195
8.4 Digital-Phase Sweeping and Block Circular Delay
197
8.5 Full-Diversity Full-Rate MIMO OFDM
201
8.5.1 Encoders and Decoders
201
8.5.2 Diversity and Rate Analysis
203
8.5.3 Numerical Examples
205
8.6 Closing Comments
206
9 ST Codes for Time-Varying Channels
209
9.1 Time-Varying Channels
210
9.1.1 Channel Models
211
9.1.2 Time-Frequency Duality
214
9.1.3 Doppler Diversity
215
9.2 Space-Time-Doppler Block Codes
216
9.2.1 Duality-Based STDO Codes
219
9.2.2 Phase Sweeping Design
222
9.3 Space-Time-Doppler FDFR Codes
227
9.4 Space-Time-Doppler Trellis Codes
227
9.4.1 Design Criterion
228
9.4.2 Smart-Greedy Codes
229
9.5 Numerical Examples
229
9.6 Space-Time-Doppler Differential Codes
231
9.6.1 Inner Codec
233
9.6.2 Outer Differential Codec
234
9.7 ST Codes for Doubly Selective Channels
235
9.7.1 Numerical Examples
237
9.8 Closing Comments
239
10 Joint Galois- and Linear Complex-Field ST Codes 241
10.1 GF-LCF ST Codes
242
10.1.1 Separate Versus Joint GF-LCF ST Coding
243
10.1.2 Performance Analysis
245
10.1.3 Turbo Decoding
248
10.2 GF-LCF Layered ST Codes
251
10.2.1 GF-LCF ST FDFR Codes: QPSK Signaling
251
10.2.2 GF-LCF ST FDFR Codes: QAM Signaling
253
10.2.3 Performance Analysis
256
10.2.4 GF-LCF FDFR Versus GF-Coded V-BLAST
259
10.2.5 Numerical Examples
260
10.3 GF-LCF Coded MIMO OFDM
263
10.3.1 Joint GF-LCF Coding and Decoding
263
10.3.2 Numerical Examples
265
10.4 Closing Comments
265
11 MIMO Channel Estimation and Synchronization 269
11.1 Preamble-Based Channel Estimation
270
11.2 Optimal Training-Based Channel Estimation
271
11.2.1 ZP-Based Block Transmissions
274
11.2.2 CP-Based Block Transmissions
283
11.2.3 Special Cases
288
11.2.4 Numerical Examples
290
11.3 (Semi-)Blind Channel Estimation
293
11.4 Joint Symbol Detection and Channel Estimation
294
11.4.1 Decision-Directed Methods
294
11.4.2 Kalman Filtering-Based Methods
295
11.5 Carrier Synchronization
299
11.5.1 Hopping Pilot-Based CFO Estimation
300
11.5.2 Blind CFO Estimation
305
11.5.3 Numerical Examples
307
11.6 Closing Comments
310
12 ST Codes with Partial Channel Knowledge: Statistical CSI 313
12.1 Partial CSI Models
315
12.1.1 Statistical CSI
315
12.2 ST Spreading
319
12.2.1 Average Error Performance
321
12.2.2 Optimization Based on Average SER Bound
323
12.2.3 Mean Feedback
324
12.2.4 Covariance Feedback
328
12.2.5 Beamforming Interpretation
330
12.3 Combining OSTBC with Beamforming
331
12.3.1 Two-Dimensional Coder-Beatufonner
333
12.4 Numerical Examples
335
12.4.1 Performance with Mean Feedback
335
12.4.2 Performance with Covariance Feedback
339
12.5 Adaptive Modulation for Rate Improvement
344
12.5.1 Numerical Examples
347
12.6 Optimizing Average Capacity
350
12.7 Closing Comments
351
13 ST Codes with Partial Channel Knowledge: Finite-Rate CSI 353
13.1 General Problem Formulation
354
13.2 Finite-Rate Beamforming
356
13.2.1 Beamformer Selection
357
13.2.2 Beamformer Codebook Design
357
13.2.3 Quantifying the Power Loss
362
13.2.4 Numerical Examples
364
13.3 Finite-Rate Precoded Spatial Multiplexing
366
13.3.1 Precoder Selection Criteria
367
13.3.2 Codebook Construction: Infinite Rate
369
13.3.3 Codebook Construction: Finite Rate
371
13.3.4 Numerical Examples
374
13.4 Finite-Rate Precoded OSTBC
380
13.4.1 Precoder Selection Criterion
381
13.4.2 Codebook Construction: Infinite Rate
381
13.4.3 Codebook Construction: Finite Rate
382
13.4.4 Numerical Examples
382
13.5 Capacity Optimization with Finite-Rate Feedback
383
13.5.1 Selection Criterion
383
13.5.2 Codebook Design
384
13.6 Combining Adaptive Modulation with Beamforming
385
13.6.1 Mode Selection
386
13.6.2 Codebook Design
386
13.7 Finite-Rate Feedback in MIMO OFDM
387
13.8 Closing Comments
388
14 ST Codes in the Presence of Interference 391
14.1 ST Spreading
392
14.1.1 Maximizing the Average SINR
393
14.1.2 Minimizing the Average Error Bound
394
14.2 Combining STS with OSTBC
396
14.2.1 Low-Complexity Receivers
399
14.3 Optimal Training with Interference
399
14.3.1 LS Channel Estimation
400
14.3.2 LMMSE Channel Estimation
401
14.4 Numerical Examples
401
14.5 Closing Comments
408
15 ST Codes for Orthogonal Multiple Access 409
15.1 System Model
410
15.1.1 Synchronous Downlink
410
15.1.2 Quasi-synchronous Uplink
411
15.2 Single-Carrier Systems: OSTBC-CIBS-CDMA
413
15.2.1 CIBS-CDMA for User Separation
413
15.2.2 OSTBC Encoding and Decoding
417
15.2.3 Attractive Features of OSTBC-CIBS-CDMA
418
15.2.4 Numerical Examples
421
15.3 Multi-Carrier Systems: STF-OFDMA
425
15.3.1 OFDMA for User Separation
425
15.3.2 STF Block Codes
426
15.3.3 Attractive Features of STF-OFDMA
426
15.3.4 Numerical Examples
428
15.4 Closing Comments
431
References 433
Index 461

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.