Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/102565
Title: Algebraic fast-decodable relay codes for distributed communications
Authors: Hollanti, Camilla
Markin, Nadya
Keywords: DRNTU::Science::Mathematics
Issue Date: 2012
Source: Hollanti, C., & Markin, N. (2012). Algebraic fast-decodable relay codes for distributed communications. 2012 IEEE International Symposium on Information Theory - ISIT, pp.935-939.
Abstract: In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures, e.g. quaternion division algebras. When satisfying certain properties, these algebras provide us with codes whose structure naturally reduces the decoding complexity. The complexity can be further reduced by shortening the block length, i.e., by considering rectangular codes called less than minimum delay (LMD) codes.
URI: https://hdl.handle.net/10356/102565
http://hdl.handle.net/10220/16393
DOI: http://dx.doi.org/10.1109/ISIT.2012.6284700
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SPMS Conference Papers

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.