Algebraic Fast-Decodable Relay Codes for Distributed Communications

Details Algebraic Fast-Decodable Relay Codes for Distributed Communications Algebraic Fast-Decodable Relay Codes for Distributed Communications

2012-02-27

arxiv.org/abs/1202.5857v1

Computer Science

Information Theory

5 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algebraic Fast-Decodable Relay Codes for Distributed Communications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic Fast-Decodable Relay Codes for Distributed Communications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Fast-Decodable Relay Codes for Distributed Communications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263054