.png){kind=icon}
Return
Space-time chase decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2005.853830.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiple-antenna wireless systems are of interest because they provide increased capacity over single-antenna systems. Several space-time signaling schemes have been proposed to make use of this increased capacity. Space-time techniques, such as space-time block coding and spatial multiplexing, can all be viewed as signaling with a multidimensional constellation. Because of the large capacity of multiple-input multiple-output (MIMO) channels, these multidimensional constellations often have large cardinalities. For this reason, it is impractical to perform optimal maximum-likelihood (ML) decoding for space-time systems, even for a moderate number of transmit antennas. In this paper, we propose a modified version of the classic Chase decoder for multiple-antenna systems. The decoder applies successive detection to yield an initial estimate of the transmitted bit sequence, constructs a list of candidate symbol vectors using this initial estimate, and then computes bit likelihood information over this list. Three algorithms are presented for constructing the candidate vector list. This decoder can be adjusted to have a fixed or variable complexity, while maintaining performance close to that of an ML decoder.
Keywords:
chase decoding
maximum-likelihood (ML) decoding
multiple-input multiple-output (MIMO) systems
spatial multiplexing
sphere decoding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more