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

DOI10.1007/S10878-016-0045-5zbMATH Open1376.90040OpenAlexW2465542723MaRDI QIDQ2012893FDOQ2012893

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

Recommendations

• Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
• An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
• A low complexity semidefinite relaxation for large-scale MIMO detection
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
• An MIMO signal detection algorithm with low-complexity and near-optimal-performance

zbMATH Keywords

branch-and-bound algorithmquadratic programmingMIMO detection problemnew convex reformulation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
• Pilot pattern design scheme with branch and bound in PSA-OFDM system

Uses Software

• CVX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012893)