Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
From MaRDI portal
Publication:2425858
DOI10.1007/s11432-008-0022-4zbMath1141.93354OpenAlexW2036728132MaRDI QIDQ2425858
Publication date: 7 May 2008
Published in: Science in China. Series F (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-008-0022-4
Factorization of matrices (15A23) Integer programming (90C10) Multivariable systems, multidimensional control systems (93C35)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
- An Automatic Method of Solving Discrete Programming Problems
- A unified framework for tree search decoding: rediscovering the sequential decoder
- Constrained maximum-likelihood detection in CDMA
- A universal lattice code decoder for fading channels
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
- On the complexity of sphere decoding in digital communications
- On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications
- Branch-and-Bound Methods: General Formulation and Properties
This page was built for publication: Maximum-likelihood detection based on branch and bound algorithm for MIMO systems