[1]Dai L, Letaief K B. An Efficient Detector for Combined Space-time Coding and Layered Processing[J]. IEEE Trans on Communications, 2005, 53(9): 1438-1442.
[2]Park S H, Lee I. Unitary Precoding Techniques Based on Transmit-MRC for MIMO Wireless Systems [C]//IEEE International Conference on Communications (ICC'08). Beijing: IEEE, 2008: 1215-1219.
[3]Stankovic V, Haardt M. Generalized Design of Multi-User MIMO Precoding Matrices[J]. IEEE Trans on Wireless Communications, 2008, 7(3): 953-961.
[4]Choi L U, Murch R D. A Transmit Preprocessing Technique for Multiuser MIMO Systems Usinga Decomposition Approach[J]. IEEE Trans on Wireless Communications, 2004, 3(1): 20-24.
[5]Ariyavisitakul S L, Zheng J, Kim J. Subspace Beamforming with Capacity-Balancing Channel Decomposition[C]//IEEE International Symposium on Information Theory (ISIT 2008). Canada: IEEE, 2008: 1012-1015.
[6]Chen Runhua, Jr Heath R W, Andrews J G. Transmit Selection Diversity for Unitary Precoded Multiuser Spatial Multiplexing Systems With Linear Receivers[J]. IEEE Trans on Signal Processing, 2007, 55(3): 1159-1171.
[7]Tarokh V, Seshadri N, Calderbank A R. Space-time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction[J]. IEEE Trans on Inf Theory, 1998, 44(2): 744-765.
[8]Tarokh V, Jafarkhani H, Calderbank A R. Space-time Block Codes from Orthogonal Designs[J]. IEEE Trans on Inf Theory, 1999, 45(5): 1456-1467.
[9]Liang X. Orthogonal Designs with Maximum Rates[J]. IEEE Trans on Inf Theory, 2003, 49(10): 2468-2503.
[10]Golub G H, Van Loan C F. Matrix Computations[M]. 3rd ed. Baltimore: The John Hopkins Univ Press, 1996.
[11]Coppersmith D, Winograd S. Matrix Multiplication Via Arithmetic Progressions[J]. J Symbolic Comput, 1990, 9(3): 251-280. |