Related papers: Constant Modulus Algorithms Using Hyperbolic Given…
This paper addresses the problem of blind demixing of instantaneous mixtures in a multiple-input multiple-output communication system. The main objective is to present efficient blind source separation (BSS) algorithms dedicated to moderate…
In this paper, two low-complexity adaptive step size algorithms are investigated for blind adaptive beamforming. Both of them are used in a stochastic gradient (SG) algorithm, which employs the constrained constant modulus (CCM) criterion…
We present a novel technique for Cosmic Microwave Background (CMB) foreground subtraction based on the framework of blind source separation. Inspired by previous work incorporating local variation to Generalized Morphological Component…
We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worst-case…
In this work, we propose an adaptive set-membership constant modulus (SM-CM) algorithm with a generalized sidelobe canceler (GSC) structure for blind beamforming. We develop a stochastic gradient (SG) type algorithm based on the concept of…
This work presents blind constrained constant modulus (CCM) adaptive algorithms based on the set-membership filtering (SMF) concept and incorporates dynamic bounds {for interference suppression} applications. We develop stochastic gradient…
In this work, we propose an efficient and transparent green learning pipeline to address the automatic modulation classification (AMC) problem. This pipeline aims to enable receivers to blindly identify the modulation modes of the incoming…
We investigate the constant-modulus (CM) waveform design for dual-function radar communication systems in the presence of clutter.To minimize the interference power and enhance the target acquisition performance, we use the…
Optimizing over the set of orthogonal matrices is a central component in problems like sparse-PCA or tensor decomposition. Unfortunately, such optimization is hard since simple operations on orthogonal matrices easily break orthogonality,…
The supervised training of a deep neural network on a given dataset consists in the unconstrained minimization of the finite sum of continuously differentiable functions, commonly referred to as loss with respect to the samples. These…
In this paper, we study the performance of blind adaptive beamforming algorithms for smart antennas in realistic environments. A constrained constant modulus (CCM) design criterion is described and used for deriving a recursive least…
Multimodal learning with incomplete input data (missing modality) is practical and challenging. In this work, we conduct an in-depth analysis of this challenge and find that modality dominance has a significant negative impact on the model…
In this paper we propose a new criterion for the Blind Source Separation (BSS) of antisparse bounded sources, based on the sum of the $\ell_\infty$-norm of the sources. Based on the observation that the mixing process of bounded sources…
The reciprocal square root is an important computation for which many very sophisticated algorithms exist (see for example \cite{863046,863031} and the references therein). In this paper we develop a simple differential compensation (much…
This paper addresses the problem of blind separation of convolutive mixtures of BPSK and circular linearly modulated signals with unknown (and possibly different) baud rates and carrier frequencies. In previous works, we established that…
Blind equalization is a classic yet open problem. Statistic-based algorithms, such as constant modulus (CM), were widely investigated. One inherent issue with blind algorithms is the phase ambiguity of equalized signals. In this letter, we…
This study develops a framework for a class of constant modulus (CM) optimization problems, which covers binary constraints, discrete phase constraints, semi-orthogonal matrix constraints, non-negative semi-orthogonal matrix constraints,…
In this work, we propose an interpretable, robust, and lightweight machine learning method for automatic modulation classification (AMC) under dynamic and noisy channel conditions. It is called green automatic modulation classification…
This work presents blind joint interference suppression and power allocation algorithms for DS-CDMA networks with multiple relays and decode and forward protocols. A scheme for joint allocation of power levels across the relays subject to…
Generating 2-by-2 unitary matrices in floating-precision arithmetic is a delicate task. One way to reduce the accumulation error is to use less floating-point operations to compute each of the entries in the 2-by-2 unitary matrix. This…