Karmakar, S and Rajan, BS
(2006)
*Multigroup-Decodable STBCs from Clifford Algebras.*
In: Proceedings of IEEE Information Theory Workshop (ITW 2006), , 29 Oct 2006, Chengdu, China.

PDF
Multigroup.pdf - Published Version Restricted to Registered users only Download (132Kb) | Request a copy |

## 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 a2(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 Paper |
---|---|

Related URLs: | |

Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |

Date Deposited: | 10 Nov 2011 04:47 |

Last Modified: | 10 Nov 2011 04:47 |

URI: | http://eprints.iisc.ernet.in/id/eprint/42016 |

### Actions (login required)

View Item |