A new effective branch-and-bound algorithm to the high order MIMO detection problem

DOI10.1007/s10878-016-0045-5zbMath1376.90040OpenAlexW2465542723MaRDI QIDQ2012893

Ye Tian, Ke Li, Wei Yang, Zhi-Yong Li

Publication date: 3 August 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0045-5

zbMATH Keywords

branch-and-bound algorithmquadratic programmingMIMO detection problemnew convex reformulation

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items

Pilot pattern design scheme with branch and bound in PSA-OFDM system

Uses Software

• CVX

Cites Work

• Unnamed Item
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Global extremal conditions for multi-integer quadratic programming
• \(h_{2}\)-norm optimal model reduction for large scale discrete dynamical MIMO systems
• Convex reformulation for binary quadratic programming problems via average objective value maximization
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Decoding by Embedding: Correct Decoding Radius and DMT Optimality
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• MEASURE ENTANGLEMENT OF BIPARTITE SYSTEM BY A NEW NONLOCAL EFFECT
• On maximum-likelihood detection and the search for the closest lattice point
• Lattice Coding and Decoding Achieve the Optimal Diversity–Multiplexing Tradeoff of MIMO Channels
• MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding
• A universal lattice code decoder for fading channels
• Semidefinite Programming
• Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity
• Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
• MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation
• DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models
• On the Limitations of the Naive Lattice Decoding
• Fundamentals of Wireless Communication
• A Block Alternating Likelihood Maximization Approach to Multiuser Detection
• On the complexity of sphere decoding in digital communications

This page was built for publication: A new effective branch-and-bound algorithm to the high order MIMO detection problem