Single-Symbol Maximum Likelihood Decodable STBCs with Fewer Zero-Entries
暂无分享,去创建一个
[1] Xiang-Gen Xia,et al. Closed-form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennas , 2005, IEEE Transactions on Information Theory.
[2] B. Sundar Rajan,et al. Square Complex Orthogonal Designs with no Zero Entry for any 2m Antennas , 2008, ArXiv.
[3] B. Sundar Rajan,et al. A Class of Maximal-Rate, Low-PAPR, Non-square Complex Orthogonal Designs , 2008, ArXiv.
[4] Xiang-Gen Xia,et al. On optimal quasi-orthogonal space-time block codes with minimum decoding complexity , 2005, ISIT.
[5] B. Sundar Rajan,et al. Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.
[6] Ran Gozali,et al. Space-Time Codes for High Data Rate Wireless Communications , 2002 .
[7] Chau Yuen,et al. Power-Balanced Orthogonal Space–Time Block Code , 2008, IEEE Transactions on Vehicular Technology.
[8] Siavash M. Alamouti,et al. A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..
[9] John R. Barry,et al. A single-symbol-decodable space-time block code with full rate and low peak-to-average power ratio , 2009, IEEE Transactions on Wireless Communications.
[10] B. Sundar Rajan,et al. Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras , 2006, 2006 IEEE International Symposium on Information Theory.
[11] A. Robert Calderbank,et al. Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.
[12] B. Rajan,et al. No-zero-entry, square, single-symbol ML Decodable STBCs , 2010, 2010 National Conference On Communications (NCC).
[13] Chintha Tellambura,et al. Decoding, Performance Analysis, and Optimal Signal Designs for Coordinate Interleaved Orthogonal Designs , 2008, IEEE Transactions on Wireless Communications.