Research on Mixed Matrix Estimation Algorithm Based on Improved Sparse Representation Model in Underdetermined Blind Source Separation System

نویسندگان

چکیده

The estimation accuracy of the mixed matrix is very important to performance underdetermined blind source separation (UBSS) system. To improve matrix, sparsity signal required. novel fractional domain time–frequency plane obtained by rotating after short-time Fourier transform. This represents fine characteristics in time and frequency domain. rotation angle determined global searching for minimum L1 norm make sufficiently sparse. points do not need single point detection, reducing calculation amount original algorithm, insensitivity noise improves robustness algorithm environment. simulation results show that are improved. Compared with existing algorithms, proposed method effective.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixing Matrix Estimation of Underdetermined Blind Source Separation Based on Data Field and Improved FCM Clustering

In modern electronic warfare, multiple input multiple output (MIMO) radar has become an important tool for electronic reconnaissance and intelligence transmission because of its anti-stealth, high resolution, low intercept and anti-destruction characteristics. As a common MIMO radar signal, discrete frequency coding waveform (DFCW) has a serious overlap of both time and frequency, so it cannot ...

متن کامل

Underdetermined Sparse Blind Source Separation with Delays

In this paper, we address the problem of under-determined blind source separation (BSS), mainly for speech signals, in an anechoic environment. Our approach is based on exploiting the sparsity of Gabor expansions of speech signals. For parameter estimation, we adopt the clustering approach of DUET [19]. However, unlike in the case of DUET where only two mixtures are used, we use all available m...

متن کامل

Source Number Estimation and Clustering for Underdetermined Blind Source Separation

Much research has been undertaken in the field of blind source separation (BSS) and a large number of algorithms have been developed. However, most of them assume that the number of sources is known. In this paper we present an algorithm to estimate the number of sources in the (over-)determined and underdetermined case. We call this algorithm NOSET (Number of Sources Estimation Technique). We ...

متن کامل

Underdetermined blind sparse source separation for arbitrarily arranged multiple sensors

This paper presents a new method for blind sparse source separation. Some sparse source separation methods, which rely on source sparseness and an anechoic mixing model, have already been proposed. These methods utilize level ratios and phase differences between sensor observations as their features, and they separate signals by classifying them. However, some of the features cannot form cluste...

متن کامل

Underdetermined Anechoic Blind Source Separation

In this paper, we address the problem of under-determined Blind Source Separation (BSS) of anechoic speech mixtures. We propose a demixing algorithm that exploits the sparsity of certain time-frequency expansions of speech signals. Our algorithm merges `-basis-pursuit with ideas based on the degenerate unmixing estimation technique (DUET) [1]. There are two main novel components to our approach...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12020456