首页> 外文会议>Sensing and analysis technologies for biomedical and cognitive applications 2016 >Custom Instruction for NIOS Ⅱ processor FFT implementation for Image processing
【24h】

Custom Instruction for NIOS Ⅱ processor FFT implementation for Image processing

机译:用于图像处理的NIOSⅡ处理器FFT实现的自定义指令

获取原文
获取原文并翻译 | 示例

摘要

Image processing can be considered as signal processing in two dimensions (2D). Filtering is one of the basic image processing operation. Filtering in frequency domain is computationally faster when compared to the corresponding spatial domain operation as the complex convolution process is modified as multiplication in frequency domain. The popular 2D transforms used in image processing are Fast Fourier Transform (FFT), Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT). The common values for resolution of an image are 640×480, 800×600, 1024×768 and 1280×1024. As it can be seen, the image formats are generally not a power of 2. So power of 2 FFT lengths are not required and these cannot be built using shorter Discrete Fourier Transform (DFT) blocks. Split radix based FFT algorithms like Good-Thomas FFT algorithm simplifies the implementation logic required for such applications and hence can be implemented in low area and power consumption and also meet the timing constraints thereby operating at high frequency. The Good-Thomas FFT algorithm which is a Prime Factor FFT algorithm (PFA) provides the means of computing DFT with least number of multiplication and addition operations. We will be providing an Altera FPGA based NIOS II custom instruction implementation of Good-Thomas FFT algorithm to improve the system performance and also provide the comparison when the same algorithm is completely implemented in software.
机译:可以将图像处理视为二维(2D)信号处理。过滤是基本的图像处理操作之一。与复杂的卷积过程被修改为频域的乘法运算相比,与相应的空间域运算相比,频域的滤波计算速度更快。图像处理中使用的流行2D变换是快速傅立叶变换(FFT),离散余弦变换(DCT)和离散小波变换(DWT)。图像分辨率的常用值为640×480、800×600、1024×768和1280×1024。可以看出,图像格式通常不是2的幂。因此,不需要2个FFT长度的幂,并且不能使用较短的离散傅立叶变换(DFT)块来构建。像Good-Thomas FFT算法这样的基于分离基数的FFT算法简化了此类应用程序所需的实现逻辑,因此可以在较小的面积和功耗下实现,还可以满足时序约束,从而在高频下运行。作为素数FFT算法(PFA)的Good-Thomas FFT算法提供了使用最少的乘法和加法运算来计算DFT的方法。我们将提供一个基于Altera FPGA的Good-Thomas FFT算法的NIOS II自定义指令实现,以提高系统性能,并在软件中完全实现相同算法时提供比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号