Full-Rank Space-Time Block Codes from Division Algebras (2002)
by
B.A. Sethuraman
,
B. Sundar Rajan
BibTeX
@MISC{Sethuraman02full-rankspace-time,
author = {B.A. Sethuraman and B. Sundar Rajan},
title = {Full-Rank Space-Time Block Codes from Division Algebras},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An n × l (l n) space time block code (STBC) C consists of a finite number |C| of n × l matrices with entries from the complex field. If the entries of the codeword matrices take values from a complex signal set S or complex linear combinations of elements of S then the code is said to be over S. For quasi-static, at fading channels a primary performance index of C is the minimum of the rank of the dierence of any two codeword matrices, called the rank of the code. C is of full-rank if its rank is n and is of minimal-delay if l = n. The rate
