图形处理单元(gpu)上的高性能多维(2D/3D) FFT-Shift实现

M. Abdellah, S. Saleh, A. Eldeib, A. Shaarawi
{"title":"图形处理单元(gpu)上的高性能多维(2D/3D) FFT-Shift实现","authors":"M. Abdellah, S. Saleh, A. Eldeib, A. Shaarawi","doi":"10.1109/CIBEC.2012.6473306","DOIUrl":null,"url":null,"abstract":"Frequency domain analysis is one of the most common analysis techniques in signal and image processing. Fast Fourier Transform (FFT) is a well know tool used to perform such analysis by obtaining the frequency spectrum for time- or spatial-domain signals and vice versa. FFT-Shift is a subsequent operation used to handle the resulting arrays from this stage as it centers the DC component of the resulting array at the origin of the spectrum. The modern Graphics Processing Units (GPUs) can be easily exploited to efficiently execute this operation considering the Compute Unified Device Architecture (CUDA) technology that was released by NVIDIA. In this work, we present an efficient high performance implementation for two- and three-dimensional FFT-Shift on the GPU exploiting its highly parallel architecture relying on the CUDA platform. We use Fourier volume rendering as an example to demonstrate the significance of this proposed implementation. It achieves a speedup of 65X for the 2D case & 219X for the 3D case.","PeriodicalId":416740,"journal":{"name":"2012 Cairo International Biomedical Engineering Conference (CIBEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"High performance multi-dimensional (2D/3D) FFT-Shift implementation on Graphics Processing Units (GPUs)\",\"authors\":\"M. Abdellah, S. Saleh, A. Eldeib, A. Shaarawi\",\"doi\":\"10.1109/CIBEC.2012.6473306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Frequency domain analysis is one of the most common analysis techniques in signal and image processing. Fast Fourier Transform (FFT) is a well know tool used to perform such analysis by obtaining the frequency spectrum for time- or spatial-domain signals and vice versa. FFT-Shift is a subsequent operation used to handle the resulting arrays from this stage as it centers the DC component of the resulting array at the origin of the spectrum. The modern Graphics Processing Units (GPUs) can be easily exploited to efficiently execute this operation considering the Compute Unified Device Architecture (CUDA) technology that was released by NVIDIA. In this work, we present an efficient high performance implementation for two- and three-dimensional FFT-Shift on the GPU exploiting its highly parallel architecture relying on the CUDA platform. We use Fourier volume rendering as an example to demonstrate the significance of this proposed implementation. It achieves a speedup of 65X for the 2D case & 219X for the 3D case.\",\"PeriodicalId\":416740,\"journal\":{\"name\":\"2012 Cairo International Biomedical Engineering Conference (CIBEC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Cairo International Biomedical Engineering Conference (CIBEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIBEC.2012.6473306\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Cairo International Biomedical Engineering Conference (CIBEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBEC.2012.6473306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

频域分析是信号和图像处理中最常用的分析技术之一。快速傅里叶变换(FFT)是一种众所周知的工具,用于通过获取时域或空域信号的频谱来执行这种分析,反之亦然。FFT-Shift是一个后续操作,用于处理从这一阶段产生的结果阵列,因为它将结果阵列的直流分量集中在频谱原点。考虑到NVIDIA发布的计算统一设备架构(CUDA)技术,可以很容易地利用现代图形处理单元(gpu)来有效地执行此操作。在这项工作中,我们提出了一种在GPU上利用其依赖CUDA平台的高度并行架构的二维和三维FFT-Shift的高效高性能实现。我们以傅里叶体绘制为例来说明该方法的重要性。它在2D情况下实现了65倍的加速,在3D情况下实现了219X的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
High performance multi-dimensional (2D/3D) FFT-Shift implementation on Graphics Processing Units (GPUs)
Frequency domain analysis is one of the most common analysis techniques in signal and image processing. Fast Fourier Transform (FFT) is a well know tool used to perform such analysis by obtaining the frequency spectrum for time- or spatial-domain signals and vice versa. FFT-Shift is a subsequent operation used to handle the resulting arrays from this stage as it centers the DC component of the resulting array at the origin of the spectrum. The modern Graphics Processing Units (GPUs) can be easily exploited to efficiently execute this operation considering the Compute Unified Device Architecture (CUDA) technology that was released by NVIDIA. In this work, we present an efficient high performance implementation for two- and three-dimensional FFT-Shift on the GPU exploiting its highly parallel architecture relying on the CUDA platform. We use Fourier volume rendering as an example to demonstrate the significance of this proposed implementation. It achieves a speedup of 65X for the 2D case & 219X for the 3D case.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信