pith. sign in

arxiv: 1202.5857 · v1 · pith:XGSLFDV4new · submitted 2012-02-27 · 💻 cs.IT · math.IT· math.RA

Algebraic Fast-Decodable Relay Codes for Distributed Communications

classification 💻 cs.IT math.ITmath.RA
keywords codesalgebraicalgebrascomplexityconstructionsfast-decodableamplify-and-forwardblock
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.