Fast DHT and DFT Algorithms for Real-Valued Data Using Subgroup Convolutions

Wu Jian-tian

您当前的位置：

首页 >

文章列表页 >

Fast DHT and DFT Algorithms for Real-Valued Data Using Subgroup Convolutions

更新时间：2025-12-08

- Fast DHT and DFT Algorithms for Real-Valued Data Using Subgroup Convolutions
- Acta Electronica Sinica Issue 4, Pages: 127-128(1987)
- 作者机构：
  
  北京邮电学院
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1987
- 稿件说明：
移动端阅览
[1]吴建田.利用子群卷积的实值数据DHT和DFT的快速算法[J].电子学报,1987(04):127-128.

Wu Jian-tian. Fast DHT and DFT Algorithms for Real-Valued Data Using Subgroup Convolutions[J]. Acta Electronica Sinica, 1987, (4): 127-128.
[1]吴建田.利用子群卷积的实值数据DHT和DFT的快速算法[J].电子学报,1987(04):127-128. DOI：

Wu Jian-tian. Fast DHT and DFT Algorithms for Real-Valued Data Using Subgroup Convolutions[J]. Acta Electronica Sinica, 1987, (4): 127-128. DOI：

摘要

本文提出了利用子群卷积计算长为（p

-1）的Hartley变换的快速算法

利用这个新算法计算实值序列的DFT只需实数运算和实数存贮。

Abstract

In this paper fast algrithm of the discrete Hartley transform of length （pM-l） using subgroup convolutions is presented.Only real value arithmetic and real value storage of intermediate results are required to compute the discrete Fourier transform of real value squence using the new algorithm.

关键词

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

⁰