High Data-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks

Details High Data-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks High Data-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks

2006-09-11

arxiv.org/abs/cs/0609054v2

Computer Science

Information Theory

submitted to IEEE Transactions on Information Theory

Scientific paper

High data-rate Distributed Orthogonal Space-Time Block Codes (DOSTBCs) which achieve the single-symbol decodability and full diversity order are proposed in this paper. An upper bound of the data-rate of the DOSTBC is derived and it is approximately twice larger than that of the conventional repetition-based cooperative strategy. In order to facilitate the systematic constructions of the DOSTBCs achieving the upper bound of the data-rate, some special DOSTBCs, which have diagonal noise covariance matrices at the destination terminal, are investigated. These codes are referred to as the row-monomial DOSTBCs. An upper bound of the data-rate of the row-monomial DOSTBC is derived and it is equal to or slightly smaller than that of the DOSTBC. Lastly, the systematic construction methods of the row-monomial DOSTBCs achieving the upper bound of the data-rate are presented.

Affiliated with

Also associated with

No associations

Rating

High Data-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks 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 High Data-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High Data-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25489