Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Novel Low Computational Complexity Multiple Signal Representation Technique for PAPR Reduction in OFDM Systems

Version 1 : Received: 13 August 2016 / Approved: 13 August 2016 / Online: 13 August 2016 (10:39:49 CEST)

How to cite: Joshi, A.; Airee, N. A Novel Low Computational Complexity Multiple Signal Representation Technique for PAPR Reduction in OFDM Systems. Preprints 2016, 2016080139. https://doi.org/10.20944/preprints201608.0139.v1 Joshi, A.; Airee, N. A Novel Low Computational Complexity Multiple Signal Representation Technique for PAPR Reduction in OFDM Systems. Preprints 2016, 2016080139. https://doi.org/10.20944/preprints201608.0139.v1

Abstract

Orthogonal Frequency Division Multiplexing (OFDM) while being an efficient scheme for high data rate wireless communications has drawbacks such as higher Peak-to-Average Power Ratio (PAPR). To reduce PAPR, use of multiple signal representation technique such as Partial Transmit Sequence (PTS) is one of the favored techniques. However, the use of conventional PTS technique need excessive number of complex calculations in order to search for all permissible combinations of phase sequences causing steep increase in complexity in terms of complex computations. Paper aims to reduce the cumbersome process of phase selection by making use of the similarity of the phase vectors. The phase vectors are obtained sequentially and thus minimize the number of changes from one phase vector to another. Theoretical analysis shows that computational complexity is significantly reduced with the help of this proposed novel technique. We have also demonstrated that PAPR values are similar i.e. PAPR reduction capability remains similar but at reduced complexity.

Keywords

OFDM; PAPR; PTS

Subject

Engineering, Electrical and Electronic Engineering

Comments (1)

Importance: How significant is the paper to the field?
Outstanding/highlight paper
0%
Significant contribution
0%
Incremental contribution
0%
No contribution
100%
Soundness of evidence/arguments presented:
Conclusions well supported
100%
Most conclusions supported (minor revision needed)
0%
Incomplete evidence (major revision needed)
0%
Hypothesis, unsupported conclusions, or proof-of-principle
0%
Comment 1
Received: 29 June 2018
Commenter: Mohamed Mounir
The commenter has declared there is no conflict of interests.
Comment: it is well know algorithm called Tree PTS
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.