2-D arithmetic Fourier transform using the Bruns method

Atlas V.G.; Atlas D.G.; Bovbel E.I.

首页> 外文期刊>IEEE Transactions on Circuits and Systems. I, Regular Papers >2-D arithmetic Fourier transform using the Bruns method

【24h】

2-D arithmetic Fourier transform using the Bruns method

机译：使用Bruns方法的二维算术傅里叶变换

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

The arithmetic Fourier transform (AFT) has been shown to perform competitively with the classical fast Fourier transform (FFT) in terms of accuracy, complexity, and speed. The new technique of calculating AFT based upon Bruns' method proved to be an advancement of the previous version of the arithmetic transformation, since it provides a more balanced scheme of computation of the even and odd coefficients of a Fourier series. This brief develops the concept of two-dimensional AFT using the Bruns method. A VLSI architecture is suggested for the proposed two-dimensional AFT algorithm

机译：算术傅立叶变换（AFT）在准确性，复杂性和速度方面均表现出与经典的快速傅立叶变换（FFT）相当的性能。事实证明，基于Bruns方法的AFT计算新技术是对算术变换以前版本的改进，因为它提供了一种更加均衡的傅立叶级数偶数和奇数系数计算方案。本文简要介绍了使用Bruns方法进行二维AFT的概念。针对所提出的二维AFT算法，提出了VLSI体系结构

著录项

来源
《IEEE Transactions on Circuits and Systems. I, Regular Papers》 |1997年第6期|p.546-551|共6页
作者
Atlas V.G.; Atlas D.G.; Bovbel E.I.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类 TN71;
关键词
Fourier series; Fourier transforms; VLSI; interpolation; 2D arithmetic Fourier transform; Bruns method; Fourier series; VLSI architecture; accuracy; complexity; even coefficients; odd coefficients; speed;

机译：傅里叶级数;傅里叶变换;VLSI;插值;二维算术傅里叶变换;Bruns方法;傅里叶级数;VLSI体系结构;精度;复杂度;偶系数;奇系数;速度;

相似文献

外文文献
中文文献
专利

1. 2-D arithmetic Fourier transform using the Bruns method [J] . Atlas V.G., Atlas D.G. IEEE Transactions on Circuits and Systems. 1 . 1997,第6期

机译：使用Bruns方法的二维算术傅里叶变换
2. Efficient algorithm for 2-D arithmetic Fourier transform [J] . Xi-Jin Ge, Nan-Xian Chen IEEE Transactions on Signal Processing . 1997,第8期

机译：二维算术傅里叶变换的高效算法
3. Methods for reconstruction of 2-D sequences from Fourier transform magnitude [J] . Zou Mou-Yan, Unbehauen R. IEEE Transactions on Image Processing . 1997,第2期

机译：从傅立叶变换幅度重建二维序列的方法
4. 2-D ARITHMETIC FOURIER TRANSFORM AGORITIIM [C] . Qian Huisheng, Li Ping International conference on signal processing;ICSP'96 . 1996

机译：二维算术傅里叶变换农业
5. 2-D Quaternion Discrete Fourier Transform in Color Image Enhancement [D] . John, Aparna. 2017

机译：彩色图像增强中的二维四元数离散傅里叶变换
6. Betti numbers of holomorphic symplectic quotients via arithmetic Fourier transform [O] . Tamás Hausel 2006

机译：算术傅立叶变换的全纯辛商的贝蒂数
7. Modified Alpha-Rooting Color Image Enhancement Method On The Two-Side 2-D Quaternion Discrete Fourier Transform And The 2-D Discrete Fourier Transform [O] . Grigoryan, Artyom M., John, Aparna, Agaian, Sos S. 2017

机译：双边改进的alpha生根彩色图像增强方法二维四元数离散傅里叶变换和二维离散傅里叶变换转变
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（离散傅立叶变换）算法的算术要求的比较。

2-D arithmetic Fourier transform using the Bruns method

摘要

著录项

相似文献

相关主题

期刊订阅