...
首页> 外文期刊>Signal processing >Uncertainty principle and sparse reconstruction in pairs of orthonormal rational function bases
【24h】

Uncertainty principle and sparse reconstruction in pairs of orthonormal rational function bases

机译:正交有理函数对中的不确定性原理和稀疏重构

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper presents theoretical results on the uncertainty principle and the sparse reconstruction of rational transfer functions in a dictionary of two orthonormal rational function (ORF) bases. The uncertainty principle concerning pairs of representations of rational transfer functions in different ORF bases is established. It is shown that a rational transfer function cannot have a sparse representation simultaneously in two different mutually incoherent ORF bases. The uniqueness for the sparse representation is derived as a direct consequence of this uncertainty principle. A reconstruction method for a rational transfer function in a pair of ORF bases is proposed. The sparse reconstruction result shows that, given a rational transfer function with a sufficiently sparse representation in a given dictionary of two ORF bases, the sparse representation can be recovered by solving a linear programming problem. A lower bound is provided on the number of frequency response measurements required to recover the sparse representation with high probability. (C) 2019 Elsevier B.V. All rights reserved.
机译:本文介绍了基于两个正交正交有理函数(ORF)基的字典中的不确定性原理和有理传递函数的稀疏重构的理论结果。建立了关于不同ORF基中有理传递函数表示对的不确定性原理。结果表明,在两个互不相关的ORF基中,有理传递函数不能同时具有稀疏表示。稀疏表示的唯一性是这种不确定性原理的直接结果。提出了一种基于ORF对的有理传递函数的重构方法。稀疏重构结果表明,在给定的两个ORF基字典中,给定一个有足够稀疏表示的有理传递函数,可以通过解决线性规划问题来恢复稀疏表示。在以高概率恢复稀疏表示所需的频率响应测量次数上提供了下限。 (C)2019 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号