A Low-Complexity SLM PAPR Reduction Scheme for OFDMA

In orthogonal frequency division multiplexing (OFDM) systems, selected mapping (SLM) techniques are widely used to minimize the peak to average power ratio (PAPR). The candidate signals are generated in the time domain by linearly mixing the original time-domain transmitted signal with numerous cyclic shift equivalents to reduce the amount of Inverse Fast Fourier Transform (IFFT) operations in typical SLM systems. The weighting factors and number of cyclic shifts, on the other hand, should be carefully chosen to guarantee that the elements of the appropriate frequency domain phase rotation vectors are of equal magnitude. A low-complexity expression is chosen from among these options to create the proposed low-complexity scheme, which only requires one IFFT. In comparison to the existing SLM technique, the new SLM scheme achieves equivalent PAPR reduction performance with significantly less computing complexity. MATLAB tool is used for simulating the proposed work

A Low-Complexity SLM PAPR Reduction Scheme for OFDMA

In orthogonal frequency division multiplexing (OFDM) systems, selected mapping (SLM) techniques are widely used to minimize the peak to average power ratio (PAPR). The candidate signals are generated in the time domain by linearly mixing the original time-domain transmitted signal with numerous cyclic shift equivalents to reduce the amount of Inverse Fast Fourier Transform (IFFT) operations in typical SLM systems. The weighting factors and number of cyclic shifts, on the other hand, should be carefully chosen to guarantee that the elements of the appropriate frequency domain phase rotation vectors are of equal magnitude. A low-complexity expression is chosen from among these options to create the proposed low-complexity scheme, which only requires one IFFT. In comparison to the existing SLM technique, the new SLM scheme achieves equivalent PAPR reduction performance with significantly less computing complexity. MATLAB tool is used for simulating the proposed work

Adjacent Partitioning Based MIMO-OFDM System with Partial Transmit Sequence for PAPR Reduction

The multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) transmission approach has been chosen to be a standard of fourth-generation (4G) wireless communication systems, but it has to cope with the main disadvantages and challenges of OFDM-based techniques, including the high peak-to-average power ratio (PAPR). Peak to average power ratio (PAPR) being a predictable random variable in multicarrier system and it can be minimized by different techniques. Complementary cumulative distribution function (CCDF) is used to describe the PAPR appropriately. Partial transmit sequence (PTS) is an attractive distortion less peak-to-average power ratio (PAPR) reduction technique for orthogonal frequency division multiplexing (OFDM) system. In this paper the performance of one of scrambling technique called partial transmit sequence (PTS) in MIMO-OFDM system and adjacent partitioning(one of the partitioning technique) in MIMO-OFDM system with PTS are analyzed based on the characteristics of CCDF DOI: 10.17762/ijritcc2321-8169.150514

저복잡도 후보 OFDM 신호 생성을 이용한 새로운 PTS 방법

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2014. 2. 노종선.This dissertation proposes several research results on the peak-to-average power ratio (PAPR) reduction schemes for the orthogonal frequency division multiplexing (OFDM) systems. The PAPR is the one of major drawback of OFDM system which causes signal distortion when OFDM signal passes through nonlinear high power amplifier (HPA). Various schemes have been proposed to reduce the PAPR of OFDM signals such as clipping, selected mapping (SLM), partial transmit sequence (PTS), active constellation extension (ACE), companding, and tone reservation (TR). Among them, PTS scheme can transmit an OFDM signal vector by generating many alternative OFDM signal vectors using the partitioned subblock signals and selecting the optimal OFDM signal vector with the minimum PAPR. However, the PTS scheme requires large computational complexity, because it needs many inverse fast Fourier transforms (IFFTs) of subblock signals and lots of alternative OFDM signal vectors are generated. In this dissertation, we concentrate on reducing the computational complexity of the PTS scheme. In the first part of this dissertation, we propose a new PTS scheme with low computational complexity using two search steps to find a subset of phase rotating vectors showing good PAPR reduction performance. In the first step, sequences with low correlation are used as phase rotating vectors for PTS scheme, which are called the initial phase vectors. Kasami sequence and quaternary sequence are used in this step as the initial phase vectors. In the second step, local search is performed based on the initial phase vectors to find additional phase rotating vectors which show good PAPR reduction performance. Numerical analysis shows that the proposed PTS scheme can achieve almost the same PAPR reduction performance as the conventional PTS scheme with much lower computational complexity than other low-complexity PTS schemes. In the second part of the dissertation, we propose another low-complexity PTS schemes using the dominant time-domain OFDM signal samples, which are only used to calculate PAPR of each alternative OFDM signal vector. In this PTS scheme, we propose efficient metrics to select the dominant time-domain samples. For further lowering the computational complexity, dominant time-domain samples are sorted in decreasing order by the proposed metric values and then the power of each sample is compared with the minimum PAPR of the previously examined alternative OFDM signal vectors. Numerical results confirm that the proposed PTS schemes using new metrics show large computational complexity reduction compared to other existing low-complexity PTS schemes without PAPR degradation. In the last part of the dissertation, for the reduced-complexity PTS scheme, a new selection method of the dominant time-domain samples is proposed by rotating the IFFTed signal samples to the area on which the IFFTed signal sample of the first subblock is located in the signal space. Moreover, the method of pre-exclusion of the phase rotating vectors using the time-domain sample rotation is proposed to reduce the number of alternative OFDM signal vectors. Further, three proposed PTS schemes are introduced to reduce the computational complexity by using simple OFDM signal rotation and pre-exclusion of the phase rotating vectors. Numerical analysis shows that the proposed PTS schemes achieve the same PAPR reduction performance as that of the conventional PTS scheme with the large computational complexity reduction.Docto

Low complexity partial selected mapping for PAPR reduction of OFDM system

International audienceWe present partial blind selected mapping method (P-BSLM) as a probabilistic OFDM-PAPR reduction method. The P-BSLM method generates more candidates than the classical SLM (C-SLM) method while using the same number of IFFT computations. Moreover, common stage computation in an IFFT process can reduce the computational complexity. More candidates increase the PAPR reduction capability, and give a better error performance in the presence of non-linear amplifier. This method has the maximum spectral efficiency without side information, and the phase sequence can be correctly detected using partial blind phase sequence detection

OFDM 시스템에서의 PAPR 감소를 위한 시간 영역의 큰 샘플을 이용한 저복잡도 PTS 기법

학위논문 (박사)-- 서울대학교 대학원 : 공과대학 전기·컴퓨터공학부, 2018. 2. 노종선.In orthogonal frequency division multiplexing (OFDM) systems, high peak-to-average power ratio (PAPR) of OFDM signals is one of the most important problems. The high PAPR of OFDM signals causes serious nonlinear distortions in process of passing through high power amplifier (HPA). These distortions have a effect on in-band distortion and out-of-band radiation, which result in bit error rate degradation of received OFDM signals and interference in adjacent channel, respectively. In order to solve the PAPR problem of OFDM signals, various PAPR reduction schemes have been proposed. This dissertation includes research results on a kind of the PAPR reduction schemes, called the partial transmit sequence (PTS) for the OFDM systems. As a solution to the PAPR problem in OFDM systems, the PTS scheme is a fairly suitable scheme due to its PAPR reduction performance and distortionless characteristics. The PTS scheme generates several candidate OFDM signals to represent an original OFDM signal and selects one with the lowest PAPR among them for transmission. However, a serious problem in the PTS scheme is high computational complexity, which is mainly required to generate and process the candidate OFDM signals. In this dissertation, in an effort to reduce its computational complexity, new PTS schemes are proposed using dominant time-domain samples of OFDM signals. Dominant time-domain samples is a small number of samples of OFDM signals used to estimate PAPRs of candidate OFDM signals efficiently. In the first part of this dissertation, low-complexity PTS schemes are proposed using new selection methods of dominant time-domain samples. The proposed selection methods of dominant time-domain samples are based on selection methods of candidate samples in candidate OFDM signals. These methods select dominant time-domain samples with reduced computational complexity. The dominant time-domain samples selected by the proposed methods are used to estimate PAPRs of candidate OFDM signals with high accuracy. Therefore, the proposed low-complexity PTS schemes can achieve the optimal PAPR reduction performance with considerably reduced computational complexity. In the second part of this dissertation, improved PTS schemes are proposed to lower the computational complexity of previous PTS schemes further while maintaining high performance of PAPR reduction. Similar with the PTS schemes proposed in the previous part of this dissertation, the improved PTS schemes utilize dominant time-domain samples and candidate samples. However, they use more efficient methods, which select the candidate samples by adaptive method or multi-stage method to select dominant time-domain samples. Therefore, the improved PTS schemes reduce computational complexity further while maintaining the optimal PAPR reduction performance. The proposed PTS schemes in this dissertation use efficient methods to select dominant time-domain samples and thus they reduce the computational complexity considerably compared to previous PTS schemes. In addition, they achieve the optimal PAPR reduction performance, which is equivalent to that of the conventional PTS scheme with the low complexity. Due to the high performance and low complexity, they are fully expected to be used in the practical implementation of OFDM systems.1 INTRODUCTION 1 1.1 Introduction 1 1.2 Overview of Dissertation 4 2 PRELIMINARIES 6 2.1 OFDM and PAPR 6 2.2 High Power Amplifier Models 8 2.3 Analysis of PAPR 11 2.3.1 PAPR of OFDM Signal 11 2.3.2 PAPR and BER 17 2.4 Iterative PAPR Reduction Schemes 18 2.4.1 Clipping and Filtering 19 2.4.2 Tone Reservation 20 2.4.3 Active Constellation Extension 24 2.5 Probabilistic PAPR Reduction Scheme: Selective Mapping 26 2.6 Conventional PTS Scheme 32 2.7 Low-Complexity PTS Schemes Using Dominant Time-Domain Samples 34 2.7.1 Dominant Time-Domain Samples 34 2.7.2 Low-Complexity PTS Schemes Using Dominant Time-Domain Samples 37 3 LOW-COMPLEXITY PTS SCHEMES WITHNEWSELECTION METHODS OF DOMINANT TIME-DOMAIN SAMPLES 40 3.1 Notations 40 3.2 Selection Methods of Candidate Samples for Dominant Time-Domain Samples 41 3.3 Proposed Low-Complexity PTS Schemes 50 4 IMPROVED PTS SCHEMES WITH ADAPTIVE SELECTION METHODS OF DOMINANT TIME-DOMAIN SAMPLES 52 4.1 Adaptive Selection Methods of Candidate Samples for Dominant Time-Domain Samples 52 4.1.1 A1-SM with W = 2 53 4.1.2 A1-SM with W = 4 54 4.1.3 A2-SM with W = 2 55 4.2 Mathematical Representations for Probability Distribution of Cn 66 4.2.1 A1-SM with W = 2 69 4.2.2 A1-SM with W = 4 69 4.2.3 A2-SM with W = 2 69 4.3 Multi-Stage Selection Method of Dominant Time-Domain Samples 70 4.4 Proposed PTS Schemes with Adaptive Selection Methods for Dominant Time-Domain Samples 71 5 PERFORMANCE ANALYSIS 74 5.1 Computational Complexity 74 5.2 Simulation Results 76 6 CONCLUSIONS 85 Abstract (In Korean) 92Docto