A low complexity semidefinite relaxation for large-scale MIMO detection
From MaRDI portal
Publication:1702828
DOI10.1007/S10878-017-0186-1zbMATH Open1393.90080OpenAlexW2766029223MaRDI QIDQ1702828FDOQ1702828
Authors: Rupaj Kumar Nayak, M. P. 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
Recommendations
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
- Efficient Implementation of Quasi- Maximum-Likelihood Detection Based on Semidefinite Relaxation
- Low-complexity Gaussian detection for MIMO systems
- The detection algorithm based on low rank tensor decomposition of large-scale MIMO
- Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems
- An MIMO signal detection algorithm with low-complexity and near-optimal-performance
- On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO Detection: The Blessing of Sequential Reduction
- MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding
- Fixed-Complexity Soft MIMO Detection via Partial Marginalization
semidefinite relaxationmultiple-input multiple-outputmaximum likelihood detectionrow-by-row methodspectral cut
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- The Schur complement and its applications
- Graph implementations for nonsmooth convex programs
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- The spherical constraint in Boolean quadratic programs
- Computational complexity of optimum multiuser detection
- SDP relaxation of homogeneous quadratic optimization: approximation bounds and applications
- On maximum-likelihood detection and the search for the closest lattice point
- Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
- On the complexity of sphere decoding in digital communications
- Efficient Implementation of Quasi- Maximum-Likelihood Detection Based on Semidefinite Relaxation
Cited In (14)
- The Diversity Order of the Semidefinite Relaxation Detector
- Improved row-by-row method for binary quadratic optimization problems
- Learned Conjugate Gradient Descent Network for Massive MIMO Detection
- Algorithm and Architecture of a Low-Complexity and High-Parallelism Preprocessing-Based K -Best Detector for Large-Scale MIMO Systems
- Efficient Successive Over Relaxation Detectors for Massive MIMO
- An Efficient Detector for Massive MIMO Based on Improved Matrix Partition
- A new effective branch-and-bound algorithm to the high order MIMO detection problem
- Scalable low-rank semidefinite programming for certifiably correct machine perception
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Title not available (Why is that?)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- Matrix Completion in Colocated MIMO Radar: Recoverability, Bounds & Theoretical Guarantees
- Semidefinite Relaxation Approaches to Soft MIMO Demodulation for Higher Order QAM Signaling
- An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
Uses Software
This page was built for publication: A low complexity semidefinite relaxation for large-scale MIMO detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702828)
