Efficient space-time codes from cyclic division algebras

Kumar, Vijay P and Elia, Petros and Vinodh, K (2007) Efficient space-time codes from cyclic division algebras. In: IEEE Military Communications Conference, 2006. MILCOM 2006. , 23-25 Oct. 2006, Washington, DC.

PDF Efficient.pdf - Published Version Restricted to Registered users only Download (7MB) | Request a copy

Abstract

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 2006 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:	10 Nov 2011 04:43
Last Modified:	10 Nov 2011 04:43
URI:	http://eprints.iisc.ac.in/id/eprint/42020

Actions (login required)

View Item