Speeding up the Sphere Decoder With $H^{\infty }$ and SDP Inspired Lower Bounds
暂无分享,去创建一个
[1] Hans van Maaren,et al. Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT , 2000, Discret. Appl. Math..
[2] Franz Rendl,et al. A recipe for semidefinite relaxation for (0,1)-quadratic programming , 1995, J. Glob. Optim..
[3] Babak Hassibi,et al. Further Results on Speeding up the Sphere Decoder , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.
[4] Babak Hassibi,et al. On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.
[5] Nikos D. Sidiropoulos,et al. A hybrid probabilistic data association-sphere decoding detector for multiple-input-multiple-output systems , 2005, IEEE Signal Processing Letters.
[6] Kai-Kit Wong,et al. On the decoding order of MIMO maximum-likelihood sphere decoder: linear and non-linear receivers , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).
[7] Zhi-Quan Luo,et al. Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA , 2002, IEEE Trans. Signal Process..
[8] C. Tellambura,et al. Reduced complexity sphere decoding using forcing rules , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..
[9] Yindi Jing,et al. Distributed Space-Time Coding in Wireless Relay Networks , 2006, IEEE Transactions on Wireless Communications.
[10] Ami Wiesel,et al. Semidefinite relaxation for detection of 16-QAM signaling in MIMO channels , 2005, IEEE Signal Processing Letters.
[11] Babak Hassibi,et al. An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).
[12] B. Hassibi,et al. An H-infinity based lower bound to speed up the sphere decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..
[13] Eric Moulines,et al. Semidefinite positive relaxation of the maximum-likelihood criterion applied to multiuser detection in a CDMA context , 2002, IEEE Signal Processing Letters.
[14] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[15] R. Saigal,et al. Handbook of semidefinite programming : theory, algorithms, and applications , 2000 .
[16] A. Burg,et al. VLSI implementation of MIMO detection using the sphere decoding algorithm , 2005, IEEE Journal of Solid-State Circuits.
[17] Thomas F. Coleman,et al. A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables , 1992, SIAM J. Optim..
[18] B. Ottersten,et al. Parallel Implementation of a Soft Output Sphere Decoder , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..
[19] Zhan Guo,et al. Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.
[20] T. Kailath,et al. Iterative decoding for MIMO channels via modified sphere decoding , 2004, IEEE Transactions on Wireless Communications.
[21] Babak Hassibi,et al. Indefinite-Quadratic Estimation And Control , 1987 .
[22] Babak Hassibi,et al. A branch and bound approach to speed up the sphere decoder , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..
[23] U. Fincke,et al. Improved methods for calculating vectors of short length in a lattice , 1985 .
[24] A. Beck,et al. Hidden convexity based near maximum-likelihood CDMA detection , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..
[25] Mohamed Oussama Damen,et al. Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.
[26] Björn E. Ottersten,et al. Semidefinite programming for detection in linear systems - optimality conditions and space-time decoding , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..
[27] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[28] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .
[29] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[30] Björn E. Ottersten,et al. On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.
[31] T. Kailath,et al. Indefinite-quadratic estimation and control: a unified approach to H 2 and H ∞ theories , 1999 .
[32] Babak Hassibi,et al. Statistical Pruning for Near-Maximum Likelihood Decoding , 2007, IEEE Transactions on Signal Processing.
[33] Zhi-Quan Luo,et al. Performance analysis of quasi-maximum-likelihood detector based on semi-definite programming , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..
[34] Georgios B. Giannakis,et al. Reduced complexity closest point decoding algorithms for random lattices , 2006, IEEE Transactions on Wireless Communications.
[35] Giuseppe Caire,et al. A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..
[36] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[37] Franz Hlawatsch,et al. Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection , 2003, IEEE Trans. Signal Process..
[38] Stephan ten Brink,et al. Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..
[39] Amir K. Khandani,et al. A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming , 2007, IEEE Transactions on Information Theory.