A new effective branch-and-bound algorithm to the high order MIMO detection problem
type: Item
instance of: scholarly article
title: A new effective branch-and-bound algorithm to the high order MIMO detection problem
zbMATH Open document ID: 1376.90040
author: Ye Tian
author: Ke Li
author: Wei Yang
author: Zhi-Yong Li
published in: Journal of Combinatorial Optimization
publication date: 2017-08-03T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6756029
zbMATH Keywords: MIMO detection problem
zbMATH Keywords: quadratic programming
zbMATH Keywords: new convex reformulation
zbMATH Keywords: branch-and-bound algorithm
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: s10878-016-0045-5
OpenAlex ID: W2465542723
cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
cites work: \(h_{2}\)-norm optimal model reduction for large scale discrete dynamical MIMO systems
cites work: On maximum-likelihood detection and the search for the closest lattice point
cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
cites work: Lattice Coding and Decoding Achieve the Optimal Diversity–Multiplexing Tradeoff of MIMO Channels
cites work: MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation
cites work: MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding
cites work: DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models
cites work: On the complexity of sphere decoding in digital communications
cites work: Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
cites work: Convex reformulation for binary quadratic programming problems via average objective value maximization
cites work: Decoding by Embedding: Correct Decoding Radius and DMT Optimality
cites work: A Block Alternating Likelihood Maximization Approach to Multiuser Detection
cites work: MEASURE ENTANGLEMENT OF BIPARTITE SYSTEM BY A NEW NONLOCAL EFFECT
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity
cites work: On the Limitations of the Naive Lattice Decoding
cites work: Fundamentals of Wireless Communication
cites work: Semidefinite Programming
cites work: Q4223046
cites work: A universal lattice code decoder for fading channels
cites work: Global extremal conditions for multi-integer quadratic programming
DOI: 10.1007/S10878-016-0045-5
description: scientific article; zbMATH DE number 6756029