Non-associative Algebras and Low Complexity Block Space Time Codes

Paul Wright

AT&T

May 17,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

We construct block space-time codes with low decoding (recognition) complexity with coherent detection at the receiver. For a given number of transmit antennas, the codes have maximum diversity and good coding gain for Rayleigh or Rician faded AWGN channels. Tradeoffs between information rate, diversity and decoder complexity are also presented. Decoding is non-iterative. These results are the best known to date with respect to code rate and decoder complexity and are applicable for arbitrary signal constellations in the complex plane.

The results are obtained by exploiting the properties of three kinds of associative and non-associative algebras:

  1. real division algebras
  2. real and complex Clifford algebras
  3. real Cayley Dickson algebras


Speaker's Contact Info: pew(at-sign)research.att.com


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on April 21, 2000 at 02:44 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.