A low complexity semidefinite relaxation for large-scale MIMO detection
From MaRDI portal
Publication:1702828
DOI10.1007/s10878-017-0186-1zbMath1393.90080OpenAlexW2766029223MaRDI QIDQ1702828
Rupaj Kumar Nayak, Mahendra Prasad Biswal
Publication date: 1 March 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0186-1
multiple-input multiple-outputsemidefinite relaxationmaximum likelihood detectionrow-by-row methodspectral cut
Related Items (2)
Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Improved row-by-row method for binary quadratic optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The spherical constraint in Boolean quadratic programs
- The Schur complement and its applications
- Computational complexity of optimum multiuser detection
- Graph Implementations for Nonsmooth Convex Programs
- On maximum-likelihood detection and the search for the closest lattice point
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Efficient Implementation of Quasi- Maximum-Likelihood Detection Based on Semidefinite Relaxation
- Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
- On the complexity of sphere decoding in digital communications
This page was built for publication: A low complexity semidefinite relaxation for large-scale MIMO detection