Advanced Space-Time Block Codes and Low Complexity Near Optimal Detection for Future Wireless Networks

Advanced Space-Time Block Codes and Low Complexity Near Optimal Detection for Future Wireless Networks

W. H. Chin (Institute for Infocomm Research, Singapore) and C. Yuen (Institute for Infocomm Research, Singapore)
DOI: 10.4018/978-1-59904-988-5.ch006
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Space-time block coding is a way of introducing multiplexing and diversity gain in wireless systems equipped with multiple antennas. There are several classes of codes tailored for different channel conditions. However, in almost all the cases, maximum likelihood detection is required to fully realize the diversity introduced. In this chapter, we present the fundamentals of space-time block coding, as well as introduce new codes with better performance. Additionally, we introduce the basic detection algorithms which can be used for detecting space-time block codes. Several low complexity pseudo-maximum likelihood algorithms will also be introduced and discussed.
Chapter Preview
Top

Introduction

The use of multiple antennas at both transmitters and receivers has become increasingly common in recent years due to the higher capacities of such systems (Foschini, 1996; Telatar, 1995). A system with multiple transmit and multiple receive antennas, or more commonly known as multiple-input multiple-output (MIMO) systems, can provide two types of advantages (Zheng & Tse, 2003). Spatial multiplexing gains are obtained by sending different signals through the multiple Space-Time virtual channels created by the multiple transmit and receive antennas (Foschini, 1996). On the other hand, spatial diversity gains are obtained by transmitting or receiving copies of a signal through different antennas as a mean to combat fading and improve the performance of the system. Space-time coding is a way to achieve the above two advantages.

This chapter aims to deliver to readers a basic understanding of Space-Time Block Codes (STBCs), a special and important class of space-time coding. We will introduce the design and optimization of some advanced STBCs, which has better performance than prior arts. These high-rate STBCs can provide a transmit diversity gain of two and they can flexibly support either three or four transmit antennas with a code rate of between two to four. We show that by having good symbol dispersion property, the new codes lead to better performance, especially under spatially-correlated MIMO channels or with reduced number of transmit antennas. They also have better coding gain and lower decoding complexity than some existing high-rate STBCs at the same spectral efficiency.

Next, a tutorial of low complexity detection schemes will be delivered to introduce the readers to the detection schemes available for both STBC and non-STBC systems. The detection of symbols in a communications is a crucial link whereby we try to recover the transmitted symbols given certain information about the channel. Selecting an appropriate detection scheme would also make a big difference, especially in the performance and complexity of a communications system. We will start with basic detection schemes which can be applied not only to STBCs, but also to any MIMO system. We will also introduce the concept of tree search based detection, which have near maximum likelihood performance at a fraction of the computational cost. Additionally, list detection is also briefly covered to introduce the idea of soft detection to the readers.

The STBCs and detection schemes introduced in this chapter are the essential elements in future wireless system in order to provide a reliable, low cost and high throughput communication network.

Complete Chapter List

Search this Book:
Reset