Algebraic fast-decodable relay codes for distributed communications

Algebraic fast-decodable relay codes for distributed communications

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 prop...

Full description

Saved in:
Bibliographic Details
Main Authors: Hollanti, Camilla, Markin, Nadya
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2013
Subjects:
DRNTU::Science::Mathematics
Online Access:https://hdl.handle.net/10356/102565
http://hdl.handle.net/10220/16393
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-102565
record_format dspace
spelling sg-ntu-dr.10356-1025652020-03-07T12:31:20Z Algebraic fast-decodable relay codes for distributed communications Hollanti, Camilla Markin, Nadya School of Physical and Mathematical Sciences IEEE International Symposium on Information Theory (2012 : Cambridge, US) DRNTU::Science::Mathematics 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. 2013-10-10T06:14:23Z 2019-12-06T20:57:00Z 2013-10-10T06:14:23Z 2019-12-06T20:57:00Z 2012 2012 Conference Paper Hollanti, C., & Markin, N. (2012). Algebraic fast-decodable relay codes for distributed communications. 2012 IEEE International Symposium on Information Theory - ISIT, pp.935-939. https://hdl.handle.net/10356/102565 http://hdl.handle.net/10220/16393 10.1109/ISIT.2012.6284700 en
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Science::Mathematics
spellingShingle DRNTU::Science::Mathematics
Hollanti, Camilla
Markin, Nadya
Algebraic fast-decodable relay codes for distributed communications
description 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.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Hollanti, Camilla
Markin, Nadya
format Conference or Workshop Item
author Hollanti, Camilla
Markin, Nadya
author_sort Hollanti, Camilla
title Algebraic fast-decodable relay codes for distributed communications
title_short Algebraic fast-decodable relay codes for distributed communications
title_full Algebraic fast-decodable relay codes for distributed communications
title_fullStr Algebraic fast-decodable relay codes for distributed communications
title_full_unstemmed Algebraic fast-decodable relay codes for distributed communications
title_sort algebraic fast-decodable relay codes for distributed communications
publishDate 2013
url https://hdl.handle.net/10356/102565
http://hdl.handle.net/10220/16393
_version_ 1681039128467079168

Similar Items