A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras
暂无分享,去创建一个
[1] Karim Abed-Meraim,et al. Diagonal algebraic space-time block codes , 2002, IEEE Trans. Inf. Theory.
[2] Lajos Rónyai,et al. Algorithmic properties of maximal orders in simple algebras over Q , 1992, computational complexity.
[3] Emanuele Viterbo,et al. Good lattice constellations for both Rayleigh fading and Gaussian channels , 1996, IEEE Trans. Inf. Theory.
[4] Genyuan Wang,et al. On optimal multilayer cyclotomic space-time code designs , 2005, IEEE Transactions on Information Theory.
[5] Emanuele Viterbo,et al. The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[6] B. Sundar Rajan,et al. Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.
[7] Emanuele Viterbo,et al. The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.
[8] Hamid Jafarkhani,et al. A quasi-orthogonal space-time block code , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).
[9] Camilla Hollanti,et al. Dense full-diversity matrix lattices for four transmit antenna MISO channel , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..