Scholarlink

Abstract <p>A simple principle is described for the formation of input and output indexing of arrays in the fast Good–Thomas algorithm for implementing the discrete Fourier transform. Specific examples are used to show how its superposition with a fast algorithm of constant structure can be constructed. A generalization of the algorithm to three or more coprime factors is considered.</p>

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

Indexing in the Good–Thomas Fast Fourier Transform Algorithm

  • 期刊论文

  • 发表日期：

    2025年3月1日

查看全文
  • M. S. Bespalov

摘要

Abstract

A simple principle is described for the formation of input and output indexing of arrays in the fast Good–Thomas algorithm for implementing the discrete Fourier transform. Specific examples are used to show how its superposition with a fast algorithm of constant structure can be constructed. A generalization of the algorithm to three or more coprime factors is considered.