TY - GEN
T1 - Some simple observations on MISO codes
AU - Vehkalahti, Roope
AU - Hollanti, Camilla
AU - Lahtonen, Jyrki
AU - Lu, Francis
PY - 2010
Y1 - 2010
N2 - This paper considers certain aspects of some well-known multiple-input single-output (MISO) codes. In the first section it is proved how in some special cases the n + 1 MISO channel can be seen as consisting of several parallel MISO channels having less transmit antennas. It is also pointed out that unitary conjugation does not change the diversity-multiplexing tradeoff (DMT) of a code. These simple results are then applied to analyze the DMT of several well-known MISO codes. In particular its is proved that all the considered codes are DMT optimal. As a by-product of this study it is seen that the full-diversity quasi-orthogonal codes by Su and Xia are unitarily equivalent to division algebraic constructions. This relation is then used to place the constructions by Su and Xia into a wider context. In the latter part of the paper the 2 + 1 slow fading MISO channel is considered and it is proven that one of the previously proposed MISO multi-block codes (MB-codes) has a linear worst-case sphere decoding complexity.
AB - This paper considers certain aspects of some well-known multiple-input single-output (MISO) codes. In the first section it is proved how in some special cases the n + 1 MISO channel can be seen as consisting of several parallel MISO channels having less transmit antennas. It is also pointed out that unitary conjugation does not change the diversity-multiplexing tradeoff (DMT) of a code. These simple results are then applied to analyze the DMT of several well-known MISO codes. In particular its is proved that all the considered codes are DMT optimal. As a by-product of this study it is seen that the full-diversity quasi-orthogonal codes by Su and Xia are unitarily equivalent to division algebraic constructions. This relation is then used to place the constructions by Su and Xia into a wider context. In the latter part of the paper the 2 + 1 slow fading MISO channel is considered and it is proven that one of the previously proposed MISO multi-block codes (MB-codes) has a linear worst-case sphere decoding complexity.
UR - http://www.scopus.com/inward/record.url?scp=78651341116&partnerID=8YFLogxK
U2 - 10.1109/ISITA.2010.5654389
DO - 10.1109/ISITA.2010.5654389
M3 - Conference contribution
AN - SCOPUS:78651341116
SN - 9781424460175
T3 - ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
SP - 537
EP - 541
BT - ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
T2 - 2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010
Y2 - 17 October 2010 through 20 October 2010
ER -