Fast-decodable asymmetric space-time codes from division algebras
Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4×2 channel due to its immediate applicability in the digital...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2013
|
| Online Access: | https://hdl.handle.net/10356/95838 http://hdl.handle.net/10220/11377 |
| _version_ | 1826130152101249024 |
|---|---|
| author | Vehkalahti, Roope Hollanti, Camilla Oggier, Frederique |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Vehkalahti, Roope Hollanti, Camilla Oggier, Frederique |
| author_sort | Vehkalahti, Roope |
| collection | NTU |
| description | Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4×2 channel due to its immediate applicability in the digital video broadcasting (DVB). Such channels optimally employ rate-two space-time (ST) codes consisting of (4×4) matrices. Unfortunately, such codes are in general very complex to decode, hence setting forth a call for constructions with reduced complexity. Recently, some reduced complexity constructions have been proposed, but they have mainly been based on different ad hoc methods and have resulted in isolated examples rather than in a more general class of codes. In this paper, it will be shown that a family of division algebra based MIDO codes will always result in at least 37.5% worst-case complexity reduction, while maintaining full diversity and, for the first time, the nonvanishing determinant (NVD) property. The reduction follows from the fact that, similarly to the Alamouti code, the codes will be subsets of matrix rings of the Hamiltonian quaternions, hence allowing simplified decoding. At the moment, such reductions are among the best known for rate-two MIDO codes [5], [6]. Several explicit constructions are presented and shown to have excellent performance through computer simulations.simulations. |
| first_indexed | 2024-10-01T07:51:49Z |
| format | Journal Article |
| id | ntu-10356/95838 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:51:49Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/958382020-03-07T12:37:21Z Fast-decodable asymmetric space-time codes from division algebras Vehkalahti, Roope Hollanti, Camilla Oggier, Frederique School of Physical and Mathematical Sciences Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4×2 channel due to its immediate applicability in the digital video broadcasting (DVB). Such channels optimally employ rate-two space-time (ST) codes consisting of (4×4) matrices. Unfortunately, such codes are in general very complex to decode, hence setting forth a call for constructions with reduced complexity. Recently, some reduced complexity constructions have been proposed, but they have mainly been based on different ad hoc methods and have resulted in isolated examples rather than in a more general class of codes. In this paper, it will be shown that a family of division algebra based MIDO codes will always result in at least 37.5% worst-case complexity reduction, while maintaining full diversity and, for the first time, the nonvanishing determinant (NVD) property. The reduction follows from the fact that, similarly to the Alamouti code, the codes will be subsets of matrix rings of the Hamiltonian quaternions, hence allowing simplified decoding. At the moment, such reductions are among the best known for rate-two MIDO codes [5], [6]. Several explicit constructions are presented and shown to have excellent performance through computer simulations.simulations. 2013-07-15T03:14:26Z 2019-12-06T19:22:12Z 2013-07-15T03:14:26Z 2019-12-06T19:22:12Z 2011 2011 Journal Article Vehkalahti, R., Hollanti, C., & Oggier, F. (2012). Fast-Decodable Asymmetric Space-Time Codes From Division Algebras. IEEE Transactions on Information Theory, 58(4), 2362-2385. 0018-9448 https://hdl.handle.net/10356/95838 http://hdl.handle.net/10220/11377 10.1109/TIT.2011.2176310 en IEEE transactions on information theory © 2011 IEEE. |
| spellingShingle | Vehkalahti, Roope Hollanti, Camilla Oggier, Frederique Fast-decodable asymmetric space-time codes from division algebras |
| title | Fast-decodable asymmetric space-time codes from division algebras |
| title_full | Fast-decodable asymmetric space-time codes from division algebras |
| title_fullStr | Fast-decodable asymmetric space-time codes from division algebras |
| title_full_unstemmed | Fast-decodable asymmetric space-time codes from division algebras |
| title_short | Fast-decodable asymmetric space-time codes from division algebras |
| title_sort | fast decodable asymmetric space time codes from division algebras |
| url | https://hdl.handle.net/10356/95838 http://hdl.handle.net/10220/11377 |
| work_keys_str_mv | AT vehkalahtiroope fastdecodableasymmetricspacetimecodesfromdivisionalgebras AT hollanticamilla fastdecodableasymmetricspacetimecodesfromdivisionalgebras AT oggierfrederique fastdecodableasymmetricspacetimecodesfromdivisionalgebras |