Geometrical relations between space time block code designs and complexity reduction

Details Geometrical relations between space time block code designs and complexity reduction Geometrical relations between space time block code designs and complexity reduction

2005-10-17

arxiv.org/abs/cs/0510047v2

IEEE Trans. Inform. Theory, vol. 52, no. 12 (Dec 2006), 5324-5335

Computer Science

Information Theory

final version, 11 pages, two-column

Scientific paper

10.1109/TIT.2006.885457

In this work, the geometric relation between space time block code design for the coherent channel and its non-coherent counterpart is exploited to get an analogue of the information theoretic inequality $I(X;S)\le I((X,H);S)$ in terms of diversity. It provides a lower bound on the performance of non-coherent codes when used in coherent scenarios. This leads in turn to a code design decomposition result splitting coherent code design into two complexity reduced sub tasks. Moreover a geometrical criterion for high performance space time code design is derived.

Affiliated with

Also associated with

No associations

Rating

Geometrical relations between space time block code designs and complexity reduction 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 Geometrical relations between space time block code designs and complexity reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometrical relations between space time block code designs and complexity reduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228727