Efficient space-time codes from cyclic division algebras
| Data(s) |
12/02/2007
|
|---|---|
| Resumo |
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 |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/42020/1/Efficient.pdf 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. |
| Publicador |
IEEE |
| Relação |
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4086626&tag=1 http://eprints.iisc.ernet.in/42020/ |
| Palavras-Chave | #Electrical Communication Engineering |
| Tipo |
Conference Paper PeerReviewed |
