Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas

Details Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas

2005-12-06

arxiv.org/abs/cs/0512023v1

Computer Science

Information Theory

Scientific paper

Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping of the constellation. These defining conditions jointly correspond to optimality with respect to the Zheng-Tse D-MG tradeoff, independent of channel statistics, as well as to near optimality in maximizing mutual information. All the above traits endow the code with error performance that is currently unmatched. Yet perfect space-time codes have been constructed only for 2,3,4 and 6 transmit antennas. We construct minimum and non-minimum delay perfect codes for all channel dimensions.

Affiliated with

Also associated with

No associations

Rating

Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas 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 Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-697606