ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Designs and Full-Rank STBCs from DFT Domain Description of Cyclic Codes

Sripati, U and Shashidhar, V and Rajan, Sundar B (2004) Designs and Full-Rank STBCs from DFT Domain Description of Cyclic Codes. In: International Symposium on Information Theory, 2004. ISIT 2004, 27 June-2 July, Chicago, 338 -338.


Download (241Kb)


Viewing an $n$ length vector over $F_{q^m}$ as an ${m}\times{n}$ matrix over $F_q$, by expanding each entry of the vector with respect to a basis of $F_{q^m}$ over $F_q$, the rank weight of the $n$- length vector over $F_{q^m}$ is the rank of the corresponding ${m}\times{n}$ matrix over $F_q$. It is known that under some conditions, $n$-length cyclic codes over $F_{q^m}$, $({n}\backslash{q}^m-1\hspace{5 mm}and\hspace{5 mm}{m}\leq{n})$ have full rank. In this paper, using this result we obtain a design using which we construct full-rank Space-Time Block Codes (STBCs) for m transmit antennas over signal sets matched to $F_q$ where $q=2$ or $q$ is a prime of the form $4k+1$. We also propose a construction of STBCs using $n$-length cyclic codes over $F_{q^m}$, for $r$ transmit antennas, where ${r}\leq{n}$ and $r|m$.

Item Type: Conference Paper
Additional Information: ©1990 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.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 09 Dec 2005
Last Modified: 19 Sep 2010 04:21
URI: http://eprints.iisc.ernet.in/id/eprint/4350

Actions (login required)

View Item View Item