Blind constant modulus equalization via convex optimization

DOI10.1109/TSP.2002.808112zbMath1369.94396OpenAlexW2130498245MaRDI QIDQ5353762

Timothy N. Davidson, Boris Maričić, Zhi-Quan Luo

Publication date: 8 September 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2002.808112

Mathematics Subject Classification ID

Convex programming (90C25) Modulation and demodulation in information and communication theory (94A14)

Related Items

Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints ⋮ Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ A robust unscented transformation for uncertain moments ⋮ Blind channel equalization using constrained generalized pattern search optimization and reinitialization strategy ⋮ Penalized semidefinite programming for quadratically-constrained quadratic optimization ⋮ Approximation methods for complex polynomial optimization ⋮ Exploiting sparsity in complex polynomial optimization ⋮ Inhomogeneous polynomial optimization over a convex set: An approximation approach

This page was built for publication: Blind constant modulus equalization via convex optimization