A low complexity semidefinite relaxation for large-scale MIMO detection
type: Item
instance of: scholarly article
title: A low complexity semidefinite relaxation for large-scale MIMO detection
zbMATH Open document ID: 1393.90080
author: Rupaj Kumar Nayak
author: M. P. Biswal
published in: Journal of Combinatorial Optimization
publication date: 2018-03-01T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6845577
zbMATH Keywords: multiple-input multiple-output
zbMATH Keywords: maximum likelihood detection
zbMATH Keywords: semidefinite relaxation
zbMATH Keywords: spectral cut
zbMATH Keywords: row-by-row method
describes a project that uses: SeDuMi
describes a project that uses: SDPT3
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: s10878-017-0186-1
OpenAlex ID: W2766029223
cites work: Q4821526
cites work: On maximum-likelihood detection and the search for the closest lattice point
cites work: Graph Implementations for Nonsmooth Convex Programs
cites work: On the complexity of sphere decoding in digital communications
cites work: Efficient Implementation of Quasi- Maximum-Likelihood Detection Based on Semidefinite Relaxation
cites work: Q3079666
cites work: Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA
cites work: The spherical constraint in Boolean quadratic programs
cites work: A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Space-time codes for high data rate wireless communication: performance criterion and code construction
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: Computational complexity of optimum multiuser detection
cites work: The Schur complement and its applications
DOI: 10.1007/S10878-017-0186-1
Recommended article: Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
Recommended article: An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection
Recommended article: Efficient Implementation of Quasi- Maximum-Likelihood Detection Based on Semidefinite Relaxation
Recommended article: Low-complexity Gaussian detection for MIMO systems
Recommended article: Q5368567
Recommended article: Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems
Recommended article: Q5399950
Recommended article: On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO Detection: The Blessing of Sequential Reduction
Recommended article: MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding
Recommended article: Fixed-Complexity Soft MIMO Detection via Partial Marginalization
description: scientific article; zbMATH DE number 6845577