Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/2257
Title: | Computational Complexity Analysis of PTS Technique under Graphics Processing Unit |
Authors: | Yadav, S S Pradhan, P K Patra, S K |
Keywords: | PTS GPU OFDM PAPR Phase factor Streaming Multiprocessor |
Issue Date: | Feb-2015 |
Publisher: | IEEE |
Citation: | 3rd International Conference on Computer, Communication, Control and Information Technology, Academy of Technology Adisaptagram, Hooghly , West Bengal, 7-8 February, 2015 |
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 GPU is approx 3.7×, 7×, and 9× faster than CPU in case of 2, 4, and 8 phase factors respectively. |
Description: | Copyright belongs to the Proceeding of Publisher |
URI: | http://hdl.handle.net/2080/2257 |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
C3IT-2015_NITRKL.pdf | 555.12 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.