Fast decodable MIDO codes from crossed product algebras

The goal of this paper is to design fast-decodable space-time codes for four transmit and two receive antennas. The previous attempts to build such codes have resulted in codes that are not full rank and hence cannot provide full diversity or high coding gains. Extensive work carried out on division...

Full description

Saved in:
Bibliographic Details
Main Authors: Oggier, Frederique, Roope, Vehkalahti, Hollanti, Camilla
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2010
Subjects:
Online Access:https://hdl.handle.net/10356/95630
http://hdl.handle.net/10220/6461
http://www.isit2010.org/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-95630
record_format dspace
spelling sg-ntu-dr.10356-956302023-02-28T19:17:22Z Fast decodable MIDO codes from crossed product algebras Oggier, Frederique Roope, Vehkalahti Hollanti, Camilla School of Physical and Mathematical Sciences IEEE International Symposium on Information Theory (2010 : Austin, Texas, US) DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems The goal of this paper is to design fast-decodable space-time codes for four transmit and two receive antennas. The previous attempts to build such codes have resulted in codes that are not full rank and hence cannot provide full diversity or high coding gains. Extensive work carried out on division algebras indicates that in order to get, not only non-zero but perhaps even non-vanishing determinants (NVD) one should look at division algebras and their orders. To further aid the decoding, we will build our codes so that they consist of four generalized Alamouti blocks which allows decoding with reduced complexity. As far as we know, the resulting codes are the first having both reduced decoding complexity, and at the same time allowing one to give a proof of the NVD property. Accepted version 2010-11-15T02:43:44Z 2019-12-06T19:18:33Z 2010-11-15T02:43:44Z 2019-12-06T19:18:33Z 2010 2010 Conference Paper Oggier, F., Roope, V., & Camilla, H. (2010). Fast decodable MIDO codes from crossed product algebras. IEEE International Symposium on Information Theory. https://hdl.handle.net/10356/95630 http://hdl.handle.net/10220/6461 http://www.isit2010.org/ 10.1109/ISIT.2010.5513709 151800 en © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. 6 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
Oggier, Frederique
Roope, Vehkalahti
Hollanti, Camilla
Fast decodable MIDO codes from crossed product algebras
description The goal of this paper is to design fast-decodable space-time codes for four transmit and two receive antennas. The previous attempts to build such codes have resulted in codes that are not full rank and hence cannot provide full diversity or high coding gains. Extensive work carried out on division algebras indicates that in order to get, not only non-zero but perhaps even non-vanishing determinants (NVD) one should look at division algebras and their orders. To further aid the decoding, we will build our codes so that they consist of four generalized Alamouti blocks which allows decoding with reduced complexity. As far as we know, the resulting codes are the first having both reduced decoding complexity, and at the same time allowing one to give a proof of the NVD property.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Oggier, Frederique
Roope, Vehkalahti
Hollanti, Camilla
format Conference or Workshop Item
author Oggier, Frederique
Roope, Vehkalahti
Hollanti, Camilla
author_sort Oggier, Frederique
title Fast decodable MIDO codes from crossed product algebras
title_short Fast decodable MIDO codes from crossed product algebras
title_full Fast decodable MIDO codes from crossed product algebras
title_fullStr Fast decodable MIDO codes from crossed product algebras
title_full_unstemmed Fast decodable MIDO codes from crossed product algebras
title_sort fast decodable mido codes from crossed product algebras
publishDate 2010
url https://hdl.handle.net/10356/95630
http://hdl.handle.net/10220/6461
http://www.isit2010.org/
_version_ 1759854470178537472