Title :
Multigroup-Decodable STBCs from Clifford Algebras
Author :
Karmakar, Sanjay ; Sundar Rajan, S.
Author_Institution :
Dept. of ECE, Indian Inst. of Sci., Bangalore
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
Keywords :
block codes; matrix algebra; maximum likelihood decoding; orthogonal codes; space-time codes; Clifford algebras; antennas; double-symbol decodable codes; full-diversity delay-optimal g-group decodable codes; maximum-likelihood decoding; multigroup-decodable STBC; quasi-orthogonal designs; single-symbol decodable codes; space-time block code; weight matrices; Algebra; Block codes; Channel state information; Conferences; Delay; Information theory; Maximum likelihood decoding; Transmitting antennas;
Conference_Titel :
Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
Conference_Location :
Chengdu
Print_ISBN :
1-4244-0067-8
Electronic_ISBN :
1-4244-0068-6
DOI :
10.1109/ITW2.2006.323839