A4 Refereed article in a conference publication
A General Framework for Constructing Fast-Decodable Asymmetric Space-Time Codes
Authors: Vehkalahti Roope, Hollanti Camilla
Publication year: 2011
Journal: IEEE International Symposium on Information Theory
Book title : Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Journal name in source: 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)
First page : 2821
Last page: 2825
Number of pages: 5
ISBN: 978-1-4577-0596-0
ISSN: 2157-8095
Abstract
Recently, extensive effort has been taken to build fast-decodable (FD) space-time (ST) codes, especially called for due to the limited power resources available for mobile receivers. Although there have been numerous successful attempts that have resulted in reduced decoding complexity for a certain number of transmit antennas, a general method for constructing FD codes for a wider range of antenna combinations and rates is still missing. Here, this problem is solved by introducing a totally general framework for constructing full-diversity FD codes with non-vanishing determinants (NVD).
Recently, extensive effort has been taken to build fast-decodable (FD) space-time (ST) codes, especially called for due to the limited power resources available for mobile receivers. Although there have been numerous successful attempts that have resulted in reduced decoding complexity for a certain number of transmit antennas, a general method for constructing FD codes for a wider range of antenna combinations and rates is still missing. Here, this problem is solved by introducing a totally general framework for constructing full-diversity FD codes with non-vanishing determinants (NVD).
UTU Research Portal