|
Tarokh V, Jafarkhani H, and Calderbank A R. Space-time block codes from orthogonal designs[J].IEEE Trans. on Inform. Theory.1999, 45(5):1456-1467[2]Golden G D, Foschini G J, and Valenzuela R A, et al.. Detection algorithm and initial laboratory results using the V-BLAST space-time communication architecture[J].Electron. Lett.1999, 35(1):14-15[3]Dai L, Sfar S, and Letaief K B. An efficient detector for combined space-time coding and layered processing[J].IEEE Trans. on Commun.2005, 53(9):1438-1442[4]Zhao L and Dubey V K. Detection schemes for space-time block code and spatial multiplexing combined system[J]. IEEE Commun. Lett., 2005, 9(1): 49-51.[5]Tarokh V, Naguib A, and Seshadri N, et al.. Combined array processing and space-time coding[J].IEEE Trans. on Inform. Theory.1999, 45(4):1121-1128[6]Dai Y, Lei Z, and Sun S. Ordered array processing for space-time coded systems[J].IEEE Commun. Lett.2004, 8(8):526-528[7]Dai L, Sfar S, and Letaief K B. A quasi-orthogonal group space-time architecture for higher diversity gains[C]. IEEE Global Telecommun- ications Conference, Dallas Texas, USA, 2004, 5: 2931-2935.[8]Prasad N and Varanasi M K. Optimum efficiently decodable layered space-time block codes[C]. Proc. 35th Asilomar Conf. Signals, Syst., Pacific Grove, CA, 2001: 227.[9]Rekaya G and Belfiore J C. Complexity of ML lattice decoders for the decoding of linear full rate space-time codes[C]. IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, 2003: 206.[10]Fincke U and Pohst M. Improved methods for calculating vectors of short length in a lattice, inlcuding a complexity analysis[J].Math. Computat.1985, 44(170):463-471[11]Horn R A and Johnson C R. Matrix Analysis[M].Cambridge University Press, 1985: 79-80.
|
下载:
