Scholarlink

<p>We propose an analytical representation of complexity diagrams based on information about the number of discretes in the signal spectrum and the signal-to-noise ratio. This approach provides additional criteria for solving the classification problem. We formulate and prove lemmas on the construction of analytical metric grids for complexity diagrams. The obtained results are verified by numerical experiments, which have confirmed the efficiency of these methods.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Analytical Representation of Complexity Diagrams

  • 期刊论文

  • 发表日期：

    2025年4月21日

查看全文
  • V. G. Babikov,
  • A. A. Galyaev

摘要

We propose an analytical representation of complexity diagrams based on information about the number of discretes in the signal spectrum and the signal-to-noise ratio. This approach provides additional criteria for solving the classification problem. We formulate and prove lemmas on the construction of analytical metric grids for complexity diagrams. The obtained results are verified by numerical experiments, which have confirmed the efficiency of these methods.