A new family of Linear Dispersion Code for fast Sphere Decoding
暂无分享,去创建一个
[1] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[2] Björn E. Ottersten,et al. On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.
[3] Ari Hottinen,et al. Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.
[4] Reinaldo A. Valenzuela,et al. Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .
[5] A. Robert Calderbank,et al. Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.
[6] Mohammad Gharavi-Alkhansari,et al. A 2×2 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.
[7] Yi Hong,et al. On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.
[8] Siavash M. Alamouti,et al. A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..
[9] Claus-Peter Schnorr,et al. Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.
[10] A. Robert Calderbank,et al. Space-time codes for high data rate wireless communication: performance criteria in the presence of channel estimation errors, mobility, and multiple paths , 1999, IEEE Trans. Commun..
[11] Robert W. Heath,et al. Linear dispersion codes for MIMO systems based on frame theory , 2002, IEEE Trans. Signal Process..
[12] U. Fincke,et al. Improved methods for calculating vectors of short length in a lattice , 1985 .