نتایج جستجو برای: general linear chirplet transform glct
تعداد نتایج: 1246548 فیلتر نتایج به سال:
We present a new method for multitarget tracking in wireless sensor networks (WSNs) based on chirplet decomposition. In all sensors of the network, reflected signals from targets are decomposed into chirplets. Through this new formulation, after clutter rejection, the delay and Doppler are expressed in terms of chirplet parameters. As an advantage of this strategy, the background noise may assu...
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
Inspired by track-before-detection technology in radar, a novel time-frequency transform, namely polynomial chirping Fourier transform (PCFT), is exploited to extract components from noisy multicomponent signal. The PCFT combines advantages of Fourier transform and polynomial chirplet transform to accumulate component energy along a polynomial chirping curve in the time-frequency plane. The par...
Developing numerical libraries that achieve highest performance on modern computer architectures became an extremely difficult task due to the increasingly complicated microarchitectures, deep cache hierarchies, and different forms of onchip parallelism, such as multiple processor cores and SIMD short vector instruction sets. The difficulty of library development led to interest in automated to...
In many applications, it is necessary to retrieve the sub-signal building blocks of a multi-component signal, which usually non-stationary in real-world and real-life applications. Empirical mode decomposition (EMD), synchrosqueezing transform (SST), signal separation operation (SSO), iterative filtering (IFD) have been proposed developed for this purpose. However, these computational methods a...
| We formulate the problem of approximating a signal with a sum of chirped Gaussians, the so-called chirplets, under the framework of maximum likelihood estimation. For a signal model of one chirplet in noise, we formulate the maximum likelihood estimator (MLE) and compute the Cram er-Rao lower bound. An approximate MLE is developed, based on time-frequency methods, and is applied sequentially ...
A new member of the Cohen’s class time-frequency distribution is proposed. The kernel function is determined adaptively based on the signal of interest. The kernel preserves the chirp-like components while removing interference terms generated due to the quadratic characteristic of Wigner-Ville distribution. This approach is based on the chirplet as an underlying model of biomedical signals. We...
The quaternion linear canonical transform is an important tool in applied mathematics and it closely related to the Fourier transform. In this work, using a symmetric form of two-sided (QFT), we first derive variation on Heisenberg-type uncertainty principle transformation. We then consider general It may be considered as extension Based orthogonal plane split, develop convolution theorem that ...
This paper is concerned with the definition of the continuous fractional Hartley transform. First, a general theory of linear fractional transform is presented to provide a systematic procedure to define the fractional version of any well-known linear transforms. Then, the results of general theory are used to derive the definitions of fractional Fourier transform (FRFT) and fractional Hartley ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید