Space-time trellis code design based on super QOSTBC with minimum decoding complexity
暂无分享,去创建一个
[1] Dong Wang,et al. On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity , 2005, IEEE Transactions on Information Theory.
[2] B. Sundar Rajan,et al. Rectangular co-ordinate interleaved orthogonal designs , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[3] Xiang-Gen Xia,et al. Space-Time Trellis Code Design Based on Super Quasi-Orthogonal Block Codes With Minimum Decoding Complexity , 2007, IEEE Transactions on Communications.
[4] Chau Yuen,et al. Construction of quasi orthogonal STBC with minimum decoding complexity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[5] Michael P. Fitz,et al. Improved high-rate space-time codes via orthogonality and set partitioning , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).
[6] Hamid Jafarkhani,et al. Super-orthogonal space-time trellis codes , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[7] Xiang-Gen Xia,et al. On optimal quasi-orthogonal space-time block codes with minimum decoding complexity , 2005, ISIT.
[8] Hamid Jafarkhani,et al. Super-quasi-orthogonal space-time trellis codes for four transmit antennas , 2005, IEEE Transactions on Wireless Communications.
[9] Hamid Jafarkhani,et al. Super-quasi-orthogonal space-time trellis codes , 2003, IEEE International Conference on Communications, 2003. ICC '03..
[10] Hamid Jafarkhani,et al. Super-orthogonal space-time trellis codes , 2003 .