Kiran, T and Rajan, Sundar B (2005) Optimal Rate-Diversity Tradeoff STBCs from Codes over Arbitrary Finite Fields. In: 2005 IEEE International Conference on Communications. ICC 2005, 16-20 May, Seoul,South Korea, Vol.1, 435-457.
A linear rank-distance code is a set of matrices over a finite field $F_q$, with the rank over $F_q$ as a distance metric. A space-time block code (STBC) is a finite set of complex matrices with the rank over the complex field as a metric. Rank-distance codes over prime fields $F_p$ have found applications as space-time codes. In this paper, we extend this result to arbitrary finite fields by providing an isomorphism from $F_q(q = p^m)$ to a subset of the ring of integers of an appropriate number field. Using this map and a maximal rank-distance code over $F_q$, we construct STBC that achieve optimal rate-diversity tradeoff for any given diversity order. Simulation results confirm the diversity gain obtained using these codes.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2005 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:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:28|
Actions (login required)