A New Fast Algorithm for Computing DFT of Real-Valued Sequence

Qian Huisheng

您当前的位置：

首页 >

文章列表页 >

A New Fast Algorithm for Computing DFT of Real-Valued Sequence

更新时间：2025-12-08

- A New Fast Algorithm for Computing DFT of Real-Valued Sequence
- Acta Electronica Sinica Issue 3, Pages: 16-22(1991)
- 作者机构：
  
  杭州电子工业学院
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1991
- 稿件说明：
移动端阅览
[1]钱惠生.快速计算实序列DFT的新算法[J].电子学报,1991(03):16-22.

Qian Huisheng. A New Fast Algorithm for Computing DFT of Real-Valued Sequence[J]. Acta Electronica Sinica, 1991, (3): 16-22.
[1]钱惠生.快速计算实序列DFT的新算法[J].电子学报,1991(03):16-22. DOI：

Qian Huisheng. A New Fast Algorithm for Computing DFT of Real-Valued Sequence[J]. Acta Electronica Sinica, 1991, (3): 16-22. DOI：

摘要

本文提出一种实傅里叶变换（RFT）的新定义

用这种定义推导出计算实序列离散傅里叶变换（DFT）的一种快速算法（FRFT）;它是当前同类算法中乘法次数、总运算次数、存储量均属最低水平的结构性最强的一种同址算法。

Abstract

A new definition for Real-valued Fourier transform（RFT） is presented. By this definition

a Fast Real-valued Fourier Transform （FRFT） algorithm is developed for calculating Discrete Fourier Transform （DFT） of Real-valued sequence. It is an in-place algorithm with better regularity in structure among algorithms which takes the least number of multiplication

total opration

and size of memory.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰