most citedOn semidefinite programming relaxations of the traveling salesman problem

42 citations · 42 across the 1 of their papers we have counts for

collaborators
Showing cs.ITShow all

1 paper · 1 filter

cs.IT2005

A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming

Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov +1

In Multi-Input Multi-Output (MIMO) systems, Maximum-Likelihood (ML) decoding is equivalent to finding the closest lattice point in an N-dimensional complex space. In general, this…