@article {4296, title = {Brain Signals Localization by Alternating Projections}, year = {2019}, month = {08/2019}, abstract = {

We present a novel solution to the problem of localization of brain signals. The solution is sequential and iterative, and is based on minimizing the least-squares (LS) criterion by the alternating projection (AP) algorithm, well known in the context of array signal processing. Unlike existing solutions belonging to the linearly constrained minimum variance (LCMV) and to the multiple-signal classification (MUSIC) families, the algorithm is applicable even in the case of a single sample and in the case of synchronous sources. The performance of the solution is demonstrated via simulations.

}, author = {Amir Adler and Mati Wax and Pantazis, Dimitrios} } @conference {4263, title = {Direct Localization by Partly Calibrated Arrays: A Relaxed Maximum Likelihood Solution}, booktitle = {27th European Signal Processing Conference, EUSIPCO 2019}, year = {2019}, month = {07/2019}, address = {A Coruna, Spain}, abstract = {

We present a novel relaxed maximum likelihood solution to the problem of direct localization of multiple narrowband\  sources by partly calibrated arrays, i.e., arrays composed of\  fully calibrated subarrays yet lacking\  inter-array calibration. The proposed solution is based on eliminating analytically all the nuisance parameters in the problem, thus reducing the likelihood function to a maximization problem involving only the location of the sources.\  The performance of the solution is demonstrated via simulations.

}, url = {http://eusipco2019.org/technical-program}, author = {Amir Adler and Mati Wax} } @article {3407, title = {Constant Modulus Algorithms via Low-Rank Approximation}, year = {2018}, month = {04/2018}, abstract = {

We present a novel convex-optimization-based approach to the solutions of a family of problems involving constant modulus signals. The family of problems includes the constant modulus and the constrained constant modulus, as well as the modified constant modulus and the constrained modified constant modulus. The usefulness of the proposed solutions is demonstrated for the tasks of blind beamforming and blind multiuser detection. The performance of these solutions, as we demonstrate by simulated data, is superior to existing methods.

}, keywords = {Constant modulus, convex optimization, trace norm}, author = {Amir Adler and Mati Wax} } @conference {4005, title = {Constant Modulus Beamforming Via Low-Rank Approximation}, booktitle = {2018 IEEE Statistical Signal Processing Workshop (SSP)}, year = {2018}, address = {Freiburg im Breisgau, Germany}, abstract = {

We present novel convex-optimization-based solutions to the problem of blind beamforming of constant modulus signals, and to the related problem of linearly constrained blind beamforming of constant modulus signals. These solutions are based on a low-rank approximation, ensure global optimality and are parameter free, namely, do not contain any tuneable parameters and do not require any a-priori parameter settings. The proposed approach outperforms state-of-the-art both in terms of the number of required samples for convergence, and in terms of the beamformer output SINR.

}, isbn = {978-1-5386-1571-3}, doi = {10.1109/SSP.2018.8450799}, url = {https://ieeexplore.ieee.org/document/8450799/}, author = {Amir Adler and Mati Wax} }