Parallel algorithms for a hypercomplex discrete fourier transform

M. V. Aliev; A. M. Belov; A. V. Ershov; M. A. Chicheva

首页> 外文期刊>Pattern recognition and image analysis: advances in mathematical theory and applications in the USSR >Parallel algorithms for a hypercomplex discrete fourier transform

【24h】

Parallel algorithms for a hypercomplex discrete fourier transform

机译：超复杂离散傅里叶变换的并行算法

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Methods for the parallel computation of a multidimensional hypercomplex discrete Fourier transform (HDFT) are considered. The basic idea consists in the application of the properties of the hypercomplex algebra in which this transform is performed. Additional possibilities for increasing the efficiency of the algorithm are provided by the natural parallelism of the multidimensional Cooley-Tukey scheme.

机译：考虑了用于多维超复杂离散傅立叶变换（HDFT）的并行计算方法。基本思想在于应用超复杂代数的属性，在该属性中执行此变换。多维Cooley-Tukey方案的自然并行性提供了提高算法效率的其他可能性。

著录项

来源
《Pattern recognition and image analysis: advances in mathematical theory and applications in the USSR》 |2007年第1期|共5页
作者
M. V. Aliev; A. M. Belov; A. V. Ershov; M. A. Chicheva;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. Parallel algorithms for a hypercomplex discrete fourier transform [J] . M. V. Aliev, A. M. Belov, A. V. Ershov, Pattern recognition and image analysis: advances in mathematical theory and applications in the USSR . 2007,第1期

机译：超复杂离散傅里叶变换的并行算法
2. Fast algorithms for a multidimensional hypercomplex discrete Fourier transform with radix-3 decomposition [J] . M. V. Aliev, M. A. Chicheva Pattern recognition and image analysis: advances in mathematical theory and applications in the USSR . 2007,第1期

机译：具有基数3分解的多维超复杂离散傅立叶变换的快速算法
3. Fast Algorithm of a Multidimensional Hypercomplex Discrete Fourier Transform with Radix-3 Decomposition [J] . M. V. Aliev, M. A. Chicheva Pattern recognition and image analysis: advances in mathematical theory and applications in the USSR . 2005,第1期

机译：具有Radix-3分解的多维超复杂离散傅立叶变换的快速算法
4. Parallelization Techniques for Multidimensional Hypercomplex Discrete Fourier Transform [C] . Marina Chicheva, Marat Aliev, Alexey Yershov International Conference on Parallel Computing Technologies(PaCT 2005); 20050905-09; Krasnoyarsk(RU) . 2005

机译：多维超复杂离散傅立叶变换的并行化技术
5. Parallel implementation and benchmarking in cluster architectures of one-dimensional discrete fourier transforms: A comparison using the row-column algorithm versus a novel formulation based on the bluestein/pseudocirculant algorithm. [D] . Velez Rodriguez, William. 2014

机译：一维离散傅里叶变换的群集体系结构中的并行实现和基准测试：使用行列算法与基于bluestein / pseudocirculant算法的新颖公式进行比较。
6. A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals [O] . Pablo Soto-Quiros 2015

机译：矢量值离散时间信号的具有离散傅立叶变换的块矩阵的并行框架
7. Efficient Parallel Algorithms for Optical Computing with the Discrete Fourier Transform (DFT) Primitive [O] . John H. Reif, Akhilesh Tyagi 1997

机译：具有离散傅立叶变换（DFT）原语的光学计算的高效并行算法
8. Comparison of Arithmetic Requirements for the PFA (Prime Factor Algorithm), WFTA (Winograd Fourier Transform Algorithm), SWIFT, MFFT (Mixed Radix Fast Fourier Transform), FFT (Fast Fourier Transform) and DFT (Discrete Fourier Transform) Algorithms. [R] . Hicks, R. C. 1982

机译：pFa（素因子算法），WFTa（Winograd傅立叶变换算法），sWIFT，mFFT（混合基线快速傅里叶变换），FFT（快速傅立叶变换）和DFT（离散傅立叶变换）算法的算术要求的比较。

Parallel algorithms for a hypercomplex discrete fourier transform

摘要

著录项

相似文献

相关主题

期刊订阅