Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks

Zhihang Yi, Il-Min Kim
2007 IEEE Transactions on Information Theory  
2977 pN pdf of noise, continuous-valued RDP. 2 Maximum average power in query sequence. 2 n Maximum average power in noise. P Conditional privacy loss. I w Worst-case information. g(:) ML estimate function. S i ML estimate of S i . S ML estimate of S. ! m Maximum probability of error. M Alphabet for X i . M Number of possible values of X. m Number of queries per bit determined. 3m Lower bound on i 8i m. min limm!1 3m. 8 RDP channel. C(8) Capacity of 8. Small bias of discrete RDP. E m Average
more » ... RDP. E m Average probability of error. H(:) Entropy. m Query complexity per record. 0 m Lower bound on m 8i m. N r Number of records. ACKNOWLEDGMENT The author would like to acknowledge the substantial contributions of the anonymous reviewers, including a pointer to [6]. 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. Index Terms-Cooperative networks, distributed space-time block codes, diversity, single-symbol maximum likelihood (ML) decoding.
doi:10.1109/tit.2007.901177 fatcat:ovec53ai25dapfqbf4jrnzn7xa