Efficient Space-Time Codes from Cyclic Division Algebras

Author

Kumar, P. Vijay ; Elia, Petros ; Vinoth, K.

Author_Institution

Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA

fYear

2006

fDate

23-25 Oct. 2006

Firstpage

1

Lastpage

6

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

Keywords

automatic repeat request; cyclic codes; diversity reception; protocols; space-time codes; telecommunication channels; ARQ channel; CDA; D-MG; cooperative relay network channel; cyclic division algebra; diversity-multiplexing gain; orthogonal amplify-forward protocol; space-time code; Algebra; Decoding; Diversity methods; Lattices; MIMO; Quadrature amplitude modulation; Receiving antennas; Relays; Space time codes; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 2006. MILCOM 2006. IEEE

Conference_Location

Washington, DC

Print_ISBN

1-4244-0617-X

Electronic_ISBN

1-4244-0618-8

Type

conf

DOI

10.1109/MILCOM.2006.302364

Filename

4086626