MMSE optimal algebraic space-time codes

Susinder Rajan, G. ; Sundar Rajan, B. (2008) MMSE optimal algebraic space-time codes IEEE Transactions on Wireless Communications, 7 (7). pp. 2468-2472. ISSN 1536-1276

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/4570212/

Related URL: http://dx.doi.org/10.1109/TWC.2008.070172

Abstract

Design of space-time block codes (STBCs) for maximum likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs becomes prohibitive large as the number of transmit and receive antennas increase. Hence it is natural to resort to a suboptimal reception technique like linear minimum mean squared error (MMSE) receiver. Barbarossa et al and Liu et al have independently derived necessary and sufficient conditions for a full rate linear STBC to be MMSE optimal, i.e achieve least symbol error rate (SER). Motivated by this problem, certain existing high rate STBC constructions from crossed product algebras are identified to be MMSE optimal. Also, it is shown that a certain class of codes from cyclic division algebras which are special cases of crossed product algebras are MMSE optimal. Hence, these STBCs achieve least SER when MMSE reception is employed and are fully diverse when ML reception is employed.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:108062
Deposited On:08 Dec 2017 10:14
Last Modified:08 Dec 2017 10:14

Repository Staff Only: item control page