Multigroup-decodable STBCs from Clifford algebras

Karmakar, Sanjay ; Sundar Rajan, B. (2006) Multigroup-decodable STBCs from Clifford algebras In: IEEE Information Theory Workshop, 2006. ITW '06 Chengdu, 22-26 Oct. 2006, Punta del Este, Uruguay.

Full text not available from this repository.

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

Related URL: http://dx.doi.org/10.1109/ITW2.2006.323839

Abstract

A Space-time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt = 2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a/(2(a-1)), which is, equivalently, a class of single-symbol decodable codes, (ii) A class of (2a-2)-group decodable with rate (a-1)/(2(a-2)), i.e. a class of double-symbol decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known quasi-orthogonal designs.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:111162
Deposited On:08 Dec 2017 10:30
Last Modified:08 Dec 2017 10:30

Repository Staff Only: item control page