Results 1 
1 of
1
minimumdecodingcomplexity STBCs from Clifford algebras
 IEEE Trans. Inf. Theory
"... Abstract—A spacetime block code (STBC) in K symbols (variables) is called a ggroup decodable STBC if its maximumlikelihood (ML) decoding metric can be written as a sum of g terms, for some positive integer g greater than one, such that each term is a function of a subset of the K variables and ea ..."
Abstract

Cited by 38 (20 self)
 Add to MetaCart
(Show Context)
Abstract—A spacetime block code (STBC) in K symbols (variables) is called a ggroup decodable STBC if its maximumlikelihood (ML) decoding metric can be written as a sum of g terms, for some positive integer g greater than one, 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 multigroup decodable codes using Clifford algebras. Without assuming that the number of variables in each group is the same, a method of explicitly constructing the weight matrices of fulldiversity, delayoptimal multigroup decodable codes is presented for arbitrary number of antennas. For the special case of 2 a number of transmit antennas, we construct two subclass of codes: 1) a class of 2agroup decodable codes with rate a, which is, equivalently, a class of singlesymbol decodable