Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs
暂无分享,去创建一个
[1] R. Phillips,et al. On matrices whose real linear combinations are non-singular , 1965 .
[2] N. Pullman,et al. A theorem of Hurwitz and Radon and orthogonal projective modules , 1974 .
[3] 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, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[4] Sarah Spence Adams,et al. The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.
[5] Xue-Bin Liang,et al. Orthogonal designs with maximal rates , 2003, IEEE Trans. Inf. Theory.
[6] B. Sundar Rajan,et al. Low-complexity, full-diversity space-time-frequency block codes for MIMO-OFDM , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..
[7] 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.
[8] Ari Hottinen,et al. Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.
[9] A. Robert Calderbank,et al. Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.
[10] Il-Min Kim,et al. Existence and construction of noncoherent unitary space-time codes , 2002, IEEE Trans. Inf. Theory.
[11] Yindi Jing,et al. Distributed Space-Time Coding in Wireless Relay Networks , 2006, IEEE Transactions on Wireless Communications.