Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/95638
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOggier, Frederiqueen
dc.contributor.authorLuzzi, Lauraen
dc.date.accessioned2011-09-19T01:08:31Zen
dc.date.accessioned2019-12-06T19:18:41Z-
dc.date.available2011-09-19T01:08:31Zen
dc.date.available2019-12-06T19:18:41Z-
dc.date.copyright2011en
dc.date.issued2011en
dc.identifier.citationLuzzi, L., & Oggier, F. (2011). A family of fast-decodable MIDO codes from crossed-product algebras over Q. Proceedings of the 2011 IEEE International Symposium on Information Theory (ISIT 2011), Saint-Petersburg, Russia.en
dc.identifier.urihttps://hdl.handle.net/10356/95638-
dc.identifier.urihttp://hdl.handle.net/10220/7084en
dc.description.abstractMultiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum Likelihood (ML) decoding complexity, full diversity and the non-vanishing determinant (NVD) property are mostly based on cyclic division algebras. In this paper, a new family of MIDO codes with the NVD property based on crossed-product algebras over Q is introduced. Fast decodability follows naturally from the structure of the codewords which consist of four generalized Alamouti blocks. The associated ML complexity order is the lowest known for full-rate MIDO codes (O(M^{10}) instead of O(M^{16}) with respect to the real constellation size M). Numerical simulations show that these codes have a performance from comparable up to 1dB gain compared to the best known MIDO code with the same complexity.en
dc.format.extent5 p.en
dc.language.isoenen
dc.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: http://dx.doi.org/10.1109/ISIT.2010.5513709.en
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Wireless communication systemsen
dc.titleA family of fast-decodable MIDO codes from crossed-product algebras over Qen
dc.typeConference Paperen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen
dc.contributor.conferenceIEEE International Symposium on Information Theory (2010 : Austin, Texas, US)en
dc.identifier.doihttp://dx.doi.org/10.1109/ISIT.2010.5513709en
dc.description.versionAccepted versionen
dc.identifier.rims158355en
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SPMS Conference Papers
Files in This Item:
File Description SizeFormat 
draftFDCPv4.pdf111.27 kBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.