Speeding up the Sphere Decoder With H^ and SDP Inspired Lower Bounds - Stojnic, M.; Vikalo, H.; Hassibi, B. (IEEE transactions on signal processing, 2008)
Keywords: Algorithms; Applied sciences; Branch-and-bound algorithm; Coding, codes; Computational complexity; convex optimization; Digital communication; Estimation theory; Exact sciences and technology; expected complexity; H^{∞} estimation; Information, signal and communications theory; integer least-squares; Lattices; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; maximum-likelihood (ML) detection; Signal and communications theory; Signal to noise ratio; sphere decoding; Studies; Telecommunications and information theory; Performance evaluation; Worst case method; Convex programming; sphere decoding; Binary modulation; Least squares method; Digital communication; expected complexity; Branch-and-bound algorithm; H infinite optimization; Lower bound; maximum-likelihood (ML) detection; Branch and bound method; integer least-squares; Least squares problem; H∞ estimation; Estimation theory; Algorithm; Computational complexity; Maximum likelihood decoding; Exact solution; NP hard problem; convex optimization; Search tree; Objective function; Maximum likelihood; Signal to noise ratio