Karmakar, Sanjay and Rajan, B Sundar (2009) Multigroup Decodable STBCs From Clifford Algebras. In: IEEE Transactions on Information Theory, 55 (1). pp. 223-231.
getPDF.pdf - Published Version
Restricted to Registered users only
Download (404Kb) | Request a copy
A space-time block code (STBC) in K symbols (variables) is called a g-group decodable STBC if its maximum-likelihood (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 full-diversity, delay-optimal 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 2 a -group decodable codes with rate [(a)/(2( a-1))], which is, equivalently, a class of single-symbol decodable codes, and 2) a class of (2a-2)-group decodable codes with rate [((a-1))/(2( a-2))], i.e., a class of double-symbol decodable codes.
|Item Type:||Journal Article|
|Additional Information:||Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Clifford algebra; decoding complexity; diversity; space-time block codes (STBCs).|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||04 Nov 2009 11:11|
|Last Modified:||19 Sep 2010 05:24|
Actions (login required)