首页> 外文期刊>Advances in computational mathematics >Sufficient conditions for irregular Gabor frames
【24h】

Sufficient conditions for irregular Gabor frames

机译:不规则Gabor框架的充分条件

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

摘要

Finding general and verifiable conditions which imply that Gabor systems are (resp. cannot be) Gabor frames is among the core problems in Gabor analysis. In their paper on atomic decompositions for coorbit spaces [H.G. Feichtinger and K. Gr?chenig, Banach spaces related to integrable group representations, and their atomic decomposition, I, J. Funct. Anal. 86 (1989), 307–340], the authors proved that every Gabor system generated with a relatively uniformly discrete and sufficiently dense time-frequency sequence will allow series expansions for a large class of Banach spaces if the window function is nice enough. In particular, such a Gabor system is a frame for the Hilbert space of square integrable functions. However, their proof is based on abstract analysis and does not give direct information on how to determine the density in the sense of directly applicable estimates. It is the goal of this paper to present a constructive version of the proof and to provide quantitative results. Specifically, we give a criterion for the general case and explicit density for some cases. We also study the existence of Gabor frames and show that there is some smooth window function such that the corresponding Gabor system is incomplete for arbitrary time-frequency lattices.
机译:查找隐含Gabor系统(不能是Gabor框架)的一般且可验证的条件是Gabor分析的核心问题之一。在他们关于轨道空间原子分解的论文中。 Feichtinger和K. Gr?chenig,与可积群表示有关的Banach空间及其原子分解,I,J。Funct。肛门86(1989),307–340],作者证明,如果窗口函数足够好,每个具有相对均匀离散和足够密集的时频序列的Gabor系统将允许大类Banach空间的级数展开。特别地,这样的Gabor系统是平方可积函数的希尔伯特空间的框架。但是,它们的证明是基于抽象分析的,在直接适用的估计的意义上并未提供有关如何确定密度的直接信息。本文的目的是提供证明的建设性版本并提供定量结果。具体来说,我们为一般情况和某些情况下的显式密度提供了标准。我们还研究了Gabor框架的存在,并表明存在一些光滑的窗函数,以使得相应的Gabor系统对于任意时频晶格都是不完整的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号