DocumentCode :
1062070
Title :
Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks
Author :
Yi, Zhihang ; Kim, Il-Min
Author_Institution :
Queen´´s Univ., Kingston
Volume :
53
Issue :
8
fYear :
2007
Firstpage :
2977
Lastpage :
2985
Abstract :
In this correspondence, the distributed orthogonal space-time block codes (DOSTBCs), which achieve the single-symbol maximum likelihood (ML) decodability and full diversity order, are first considered. However, systematic construction of the DOSTBCs is very hard, since the noise covariance matrix is not diagonal in general. Thus, 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 approximately twice higher than that of the repetition-based cooperative strategy. Furthermore, systematic construction methods of the row-monomial DOSTBCs achieving the upper bound of the data-rate are developed when the number of relays and/or the number of information-bearing symbols are even.
Keywords :
block codes; maximum likelihood decoding; space-time codes; cooperative networks; diagonal noise covariance matrices; distributed orthogonal space-time block codes; information-bearing symbols; repetition-based cooperative strategy; row-monomial DOSTBCs; single-symbol ML decodable distributed STBCs; single-symbol maximum likelihood decodability; systematic construction; Association rules; Channel capacity; Cryptography; Data mining; Data privacy; Data security; Databases; Entropy; Maximum likelihood decoding; Maximum likelihood estimation; Cooperative networks; distributed space–time block codes; diversity; single-symbol maximum likelihood (ML) decoding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2007.901177
Filename :
4276943
Link To Document :
بازگشت