Stopping criterion for complexity reduction of sphere decoding
暂无分享,去创建一个
Pingzhi Fan | Erik G. Larsson | Bahram Honary | Zheng Ma | P. Fan | E. Larsson | B. Honary | Zheng Ma
[1] Erik G. Larsson,et al. Fixed-Complexity Soft MIMO Detection via Partial Marginalization , 2008, IEEE Transactions on Signal Processing.
[2] Claus-Peter Schnorr,et al. Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems , 1991, FCT.
[3] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[4] Björn E. Ottersten,et al. On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.
[5] Wai Ho Mow. Maximum likelihood sequence estimation from the lattice viewpoint , 1994, IEEE Trans. Inf. Theory.
[6] Inkyu Lee,et al. A new reduced-complexity sphere decoder for multiple antenna systems , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[7] Wai Ho Mow,et al. Universal lattice decoding: principle and recent advances , 2003, Wirel. Commun. Mob. Comput..
[8] Georgios B. Giannakis,et al. Reduced complexity closest point decoding algorithms for random lattices , 2006, IEEE Transactions on Wireless Communications.
[9] U. Fincke,et al. Improved methods for calculating vectors of short length in a lattice , 1985 .
[10] Erik G. Larsson,et al. Soft MIMO Detection at Fixed Complexity , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.
[11] Gregory W. Wornell,et al. Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.