Multigroup-Decodable STBCs from Clifford Algebras
暂无分享,去创建一个
[1] Ari Hottinen,et al. Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.
[2] Babak Hassibi,et al. High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.
[3] Signal constellations for quasi-orthogonal space-time block codes with full diversity , 2004, IEEE Transactions on Information Theory.
[4] Chau Yuen,et al. Construction of quasi orthogonal STBC with minimum decoding complexity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[5] Xiang-Gen Xia,et al. On optimal quasi-orthogonal space-time block codes with minimum decoding complexity , 2005, ISIT.
[6] Chau Yuen,et al. A Class of Four-Group Quasi-Orthogonal STBC Achieving Full Rate and Full Diversity for Any Number of Antennas , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.
[7] 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.
[8] B. Sundar Rajan,et al. Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.