Please use this identifier to cite or link to this item:
|Title:||Iterated MIDO space-time code constructions||Authors:||Markin, Nadya
|Keywords:||DRNTU::Science::Mathematics||Issue Date:||2011||Source:||Markin, N., & Oggier, F. (2011). Iterated MIDO space-time code constructions. Forty-Ninth Annual Allerton Conference on Communication, Control, and Computing proceedings, pp.539-544.||Abstract:||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.||URI:||https://hdl.handle.net/10356/94657
|DOI:||http://dx.doi.org/10.1109/Allerton.2011.6120213||Rights:||© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI: http://dx.doi.org/10.1109/Allerton.2011.6120213].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.