Iterated MIDO space-time code constructions
We consider the problem of designing codes for multiple antenna channels, with 4 transmit antennas and two receive antennas, using as code design full diversity and fast decodability. We present an iterated construction, which allows us to start with any algebraic 2 × 2 space-time code, and map it t...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/94657 http://hdl.handle.net/10220/8377 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | We consider the problem of designing codes for multiple antenna channels, with 4 transmit antennas and two receive antennas, using as code design full diversity and fast decodability. We present an iterated construction, which allows us to start with any algebraic 2 × 2 space-time code, and map it to a 4 × 4 MIDO code, for which a criterion for full diversity is available. We illustrate our method with two MIDO codes, built upon the Silver Code and the Alamouti code, for which the decoding complexity is analyzed. Simulation results show that the proposed codes exhibit very good behavior compared to existing codes. |
|---|