arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.10473math.PRmath.CVmath.FA
收藏

随机信号的稀疏表示

A Sparse Representation of Random Signals

Tao Qian

摘要:

确定性信号稀疏表示的研究已经得到了很好的发展。其中存在一种称为自适应傅立叶分解(AFD)的分解,其通过自适应地选择定义单复变数的Takenaka-Malmquist系统的参数来建立。AFD型算法产生有限能量信号的稀疏表示。AFD的多元推广称为预正交AFD(POAFD),后者是建立在具有字典的上下文希尔伯特空间上的。本研究的目的是推广AFD和POAFD的随机信号。我们研究两种类型的随机信号。一种是那些可表示为确定性信号与误差项(如白噪声)之和的信号;另一种是,一般来说,服从某些分配律的几类随机信号的混合。本文的第一部分利用单复变数的分析,提出了一维随机信号的AFD型稀疏表示。在第二部分中,我们在没有复分析的情况下,用字典在随机希尔伯特空间的背景下处理多变量随机信号。与确定性信号一样,所建立的随机稀疏表示是实际信号分析中的有力工具。

英文摘要:

Studies of sparse representation of deterministic signals have been well developed. Amongst there exists one called adaptive Fourier decomposition (AFD) established through adaptive selections of the parameters defining a Takenaka-Malmquist system in one-complex variable. The AFD type algorithms give rise to sparse representations of signals of finite energy. The multivariate generalization of AFD is one called pre-orthogonal AFD (POAFD), the latter being established with the context Hilbert space possessing a dictionary. The purpose of the present study is to generalize both AFD and POAFD to random signals. We work on two types of random signals. One is those expressible as the sum of a deterministic signal with an error term such as a white noise; and the other is, in general, as mixture of several classes of random signals obeying certain distributive law. In the first part of the paper we develop an AFD type sparse representation for one-dimensional random signals by making use analysis of one complex variable. In the second part, without complex analysis, we treat multivariate random signals in the context of stochastic Hilbert space with a dictionary. Like in the deterministic signal case the established random sparse representations are powerful tools in practical signal analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑