.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity Multi-Stream Space-Time Codes-Part II: Unitary-Transform Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2011.121511.100222A.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We examine the design of space-time codes that allow simple encoding and decoding of high and low-priority streams of data. This paper comprises two parts. In the first part we introduce the system model, establish performance and complexity criteria, and introduce direct-sum codes that combine existing space-time codes with hierarchical modulation. In this second part, we show that the direct-sum codes of the first part can be greatly improved upon by non-direct-sum designs. We demonstrate unitary-transform codes for two and four antennas. In particular, one such code performs 4 dB better than the direct-sum Alamouti code, with per-bit decoding complexity on one stream that is a bounded function of the rate of the other stream.
Keywords:
Space-time coding
broadcast
hierarchical coding
multi-stream
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W