Computational complexity analysis of PTS technique under graphics processing unit

S. Yadav, P. Pradhan, Sarat Kumar Parra
{"title":"Computational complexity analysis of PTS technique under graphics processing unit","authors":"S. Yadav, P. Pradhan, Sarat Kumar Parra","doi":"10.1109/C3IT.2015.7060162","DOIUrl":null,"url":null,"abstract":"Peak-to-Average Power Ratio (PAPR) reduction is a important signal processing aspect of Orthogonal Frequency Division Multiplexing (OFDM). Minimization of PAPR can be achieved efficiently using PTS Technique. The main drawback of PTS lies in its computational complexity due to large order of multiple IFFT and phase factor computation. Typically simulation to tune 4 sub-blocks with 4 phase factors in PTS is achievable using standard computing hardware. In this paper we present performance comparison of PTS technique using different number of sub-blocks (V=2, 4, 6 and 8) with different phase factors (W=2, 4 and 8) under Central Processing Unit (CPU) and Graphics Processing Unit (GPU) environments. The performance gain of GPU over CPU in terms of speedup is presented and the computational complexity involved is analyzed. The CPU is approx 3.7×, 7×, and 9× faster than CPU in case of 2, 4, and 8 phase factors respectively.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C3IT.2015.7060162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Peak-to-Average Power Ratio (PAPR) reduction is a important signal processing aspect of Orthogonal Frequency Division Multiplexing (OFDM). Minimization of PAPR can be achieved efficiently using PTS Technique. The main drawback of PTS lies in its computational complexity due to large order of multiple IFFT and phase factor computation. Typically simulation to tune 4 sub-blocks with 4 phase factors in PTS is achievable using standard computing hardware. In this paper we present performance comparison of PTS technique using different number of sub-blocks (V=2, 4, 6 and 8) with different phase factors (W=2, 4 and 8) under Central Processing Unit (CPU) and Graphics Processing Unit (GPU) environments. The performance gain of GPU over CPU in terms of speedup is presented and the computational complexity involved is analyzed. The CPU is approx 3.7×, 7×, and 9× faster than CPU in case of 2, 4, and 8 phase factors respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
图形处理单元下PTS技术的计算复杂度分析
峰均功率比(PAPR)降低是正交频分复用(OFDM)信号处理的一个重要方面。使用PTS技术可以有效地实现PAPR的最小化。PTS的主要缺点是由于多次IFFT和相位因子计算的大阶数,计算量大。通常,使用标准计算硬件可以实现PTS中具有4个相位因子的4个子块的仿真。在本文中,我们比较了PTS技术在中央处理器(CPU)和图形处理单元(GPU)环境下使用不同数量的子块(V=2、4、6和8)和不同相位因子(W=2、4和8)的性能。介绍了GPU相对于CPU在加速方面的性能增益,并分析了涉及的计算复杂度。在相位因数为2、4和8时,CPU分别比CPU快3.7倍、7倍和9倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of GaN buffer layer thickness on structural and optical properties of AlGaN/GaN based high electron mobility transistor structure grown on Si(111) substrate by plasma assisted molecular beam epitaxy technique Neural network based gene regulatory network reconstruction Facial landmark detection using FAST Corner Detector of UGC-DDMC Face Database of Tripura tribes A method for developing node probability table using qualitative value of software metrics Computational complexity analysis of PTS technique under graphics processing unit
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1