Computational Complexity of Decoding Orthogonal Space-Time Block Codes

Details Computational Complexity of Decoding Orthogonal Space-Time Block Codes Computational Complexity of Decoding Orthogonal Space-Time Block Codes

2009-10-09

arxiv.org/abs/0910.1863v1

Computer Science

Information Theory

Scientific paper

The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols of the code times an identity matrix, where c is a positive integer is quantified. Four equivalent techniques of optimum decoding which have the same computational complexity are specified. Modifications to the basic formulation in special cases are calculated and illustrated by means of examples. This paper corrects and extends [1],[2], and unifies them with the results from the literature. In addition, a number of results from the literature are extended to the case c > 1.

Affiliated with

Also associated with

No associations

Rating

Computational Complexity of Decoding Orthogonal Space-Time Block Codes 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 Computational Complexity of Decoding Orthogonal Space-Time Block Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Complexity of Decoding Orthogonal Space-Time Block Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619191