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

On PAPR Reduction of OFDM using Partial Transmit Sequence with Intelligent Optimization Algorithms

In recent time, the demand for multimedia data services over wireless links has grown up rapidly. Orthogonal Frequency Division Multiplexing (OFDM) forms the basis for all 3G and beyond wireless communication standards due to its efficient frequency utilization permitting near ideal data rate and ubiquitous coverage with high mobility. OFDM signals are prone to high peak-to-average-power ratio (PAPR). Unfortunately, the high PAPR inherent to OFDM signal envelopes occasionally drives high power amplifiers (HPAs) to operate in the nonlinear region of their characteristic leading out-of-band radiation, reduction in efficiency of communication system etc. A plethora of research has been devoted to reducing the performance degradation due to the PAPR problem inherent to OFDM systems. Advanced techniques such as partial transmit sequences (PTS) and selected mapping (SLM) have been considered most promising for PAPR reduction. Such techniques are seen to be efficient for distortion-less signal processing but suffer from computational complexity and often requires transmission of extra information in terms of several side information (SI) bits leading to loss in effective data rate. This thesis investigates the PAPR problem using Partial Transmit Sequence (PTS) scheme, where optimization is achieved with evolutionary bio-inspired metaheuristic stochastic algorithms. The phase factor optimization in PTS is used for PAPR reduction. At first, swarm intelligence based Firefly PTS (FF-PTS) algorithm is proposed which delivers improved PAPR performance with reduced searching complexity. Following this, Cuckoo Search based PTS (CS-PTS) technique is presented, which offers good PAPR performance in terms of solution quality and convergence speed. Lastly, Improved Harmony search based PTS (IHS-PTS) is introduced, which provides improved PAPR. The algorithm has simple structure with a very few parameters for larger PTS sub-blocks. The PAPR performance of the proposed technique with different parameters is also verified through extensive computer simulations. Furthermore, complexity analysis of algorithms demonstrates that the proposed schemes offer significant complexity reduction when compared to standard PAPR reduction techniques. Findings have been validated through extensive simulation tests

저복잡도 후보 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

New methods of partial transmit sequence for reducing the high peak-to-average-power ratio with low complexity in the ofdm and f-ofdm systems

The orthogonal frequency division multiplexing system (OFDM) is one of the most important components for the multicarrier waveform design in the wireless communication standards. Consequently, the OFDM system has been adopted by many high-speed wireless standards. However, the high peak-to-average- power ratio (PAPR) is the main obstacle of the OFDM system in the real applications because of the non-linearity nature in the transmitter. Partial transmit sequence (PTS) is one of the effective PAPR reduction techniques that has been employed for reducing the PAPR value 3 dB; however, the high computational complexity is the main drawback of this technique. This thesis proposes novel methods and algorithms for reducing the high PAPR value with low computational complexity depending on the PTS technique. First, three novel subblocks partitioning schemes, Sine Shape partitioning scheme (SS-PTS), Subsets partitioning scheme (Sb-PTS), and Hybrid partitioning scheme (H-PTS) have been introduced for improving the PAPR reduction performance with low computational complexity in the frequency-domain of the PTS structure. Secondly, two novel algorithms, Grouping Complex iterations algorithm (G-C-PTS), and Gray Code Phase Factor algorithm (Gray-PF-PTS) have been developed to reduce the computational complexity for finding the optimum phase rotation factors in the time domain part of the PTS structure. Third, a new hybrid method that combines the Selective mapping and Cyclically Shifts Sequences (SLM-CSS-PTS) techniques in parallel has been proposed for improving the PAPR reduction performance and the computational complexity level. Based on the proposed methods, an improved PTS method that merges the best subblock partitioning scheme in the frequency domain and the best low-complexity algorithm in the time domain has been introduced to enhance the PAPR reduction performance better than the conventional PTS method with extremely low computational complexity level. The efficiency of the proposed methods is verified by comparing the predicted results with the existing modified PTS methods in the literature using Matlab software simulation and numerical calculation. The results that obtained using the proposed methods achieve a superior gain in the PAPR reduction performance compared with the conventional PTS technique. In addition, the number of complex addition and multiplication operations has been reduced compared with the conventional PTS method by about 54%, and 32% for the frequency domain schemes, 51% and 65% for the time domain algorithms, 18% and 42% for the combining method. Moreover, the improved PTS method which combines the best scheme in the frequency domain and the best algorithm in the time domain outperforms the conventional PTS method in terms of the PAPR reduction performance and the computational complexity level, where the number of complex addition and multiplication operation has been reduced by about 51% and 63%, respectively. Finally, the proposed methods and algorithms have been applied to the OFDM and Filtered-OFDM (F-OFDM) systems through Matlab software simulation, where F-OFDM refers to the waveform design candidate in the next generation technology (5G)

An intelligent genetic algorithm for PAPR reduction in a multi-carrier CDMA wireless system

Abstract— A novel intelligent genetic algorithm (GA), called Minimum Distance guided GA (MDGA) is proposed for peak-average-power ratio (PAPR) reduction based on partial transmit sequence (PTS) scheme in a synchronous Multi-Carrier Code Division Multiple Access (MC-CDMA) system. In contrast to traditional GA, our MDGA starts with a balanced ratio of exploration and exploitation which is maintained throughout the process. It introduces a novel replacement strategy which increases significantly the convergence rate and reduce dramatically computational complexity as compared to the conventional GA. The simulation results demonstrate that, if compared to the PAPR reduction schemes using exhaustive search and traditional GA, our scheme achieves 99.52% and 50+% reduction in computational complexity respectively