Improved phase factor computation for the PAR reduction of an OFDMsignal using PTS

The peak-to-average power ratio (PAR) of an orthogonal frequency-division multiplexing (OFDM) signal can be substantially larger than that of a single carrier system. Partial transmit sequence (PTS) combining can improve the PAR statistics of an OFDM signal. As PTS requires an exhaustive search over all combinations of allowed phase factors, the search complexity increases exponentially with the number of subblocks. In this letter, we present a new algorithm for computing the phase factors that achieves better performance than the exhaustive search approach     

FBMC/OQAM中基于离散粒子群优化的峰均比抑制方法

部分传输序列(Partial Transmit Sequence,PTS)是降低正交频分复用（Orthogonal Frequency Division Multiplexing,OFDM）系统峰均比(Peak-to-Average Power Ratio,PAPR)的有效方法,但是PTS穷举法搜索最优解,使系统复杂度增加。针对这一缺点进行改进,提出了基于离散粒子群优化的部分传输序列(Partial Transmit Sequence based on Discrete Particle Swarm Optimization,PTS-DPSO)方法,并将其应用到基于偏移正交幅度调制的滤波器组多载波系统(Filter Bank Multicarrier with Offset Quadrature Amplitude Modulation,FBMC/OQAM)中。PTS-DPSO利用离散粒子群优化搜寻最优解,避免了系统复杂度的增加。通过仿真验证,PTS-DPSO可以有效抑制FBMC/OQAM系统过高的PAPR且误码率低。     

A novel search method to reduce PAPR of an OFDM signal using partial transmit sequences

One of the main drawbacks of orthogonal frequency division multiplexing (OFDM) is the high peak‐to‐average power ratio (PAPR) of the transmitted OFDM signal. Partial transmit sequence (PTS) technique can improve the PAPR statistics of an OFDM signal. As ordinary PTS technique requires an exhaustive search over all combinations of allowed phase factors, the search complexity increases exponentially with the number of sub‐blocks. In this paper, we propose a novel PTS technique with reduced complexity that each level inverts twice of phase factor bits from previous level. Then we also use initial random phase sequence to find the better search way of PAPR reduction. Numerical results show that the proposed method can achieve significant reduction in search complexity with little performance degradation. Copyright © 2006 John Wiley & Sons, Ltd.     

An efficient sphere decoding approach for PTS assisted PAPR reduction of OFDM signals

It is well known that one of the main drawbacks of orthogonal frequency division multiplexing (OFDM) is the potentially high peak-to-average power ratio (PAPR) of the (OFDM) signal. Partial transmit sequence (PTS) is a widely accepted method in reducing PAPR of OFDM signal. As traditional optimal PTS (OPTS) technique requires an exhaustive search over all the combinations of the allowed phase factors the search complexity increases exponentially with the number of sub-blocks. In this paper, a new precalculated radius sphere decoding (PRSD) is presented. It can achieve the same PAPR performance but at lower computational complexity compared with OPTS and existing sphere decoding (SD) approach at zero decoding failure rate.     

PAPR reduction of an OFDM signal by use of PTS with low computational complexity

One of the major drawbacks of orthogonal frequency division multiplexing (OFDM) is the high peak-to-average power ratio (PAPR) of the transmitted OFDM signal. Partial transmit sequence (PTS) technique can improve the PAPR statistics of an OFDM signal. However optimum PTS (OPTS) technique requires an exhaustive search over all combinations of allowed phase factors, the search complexity increases exponentially with the number of sub-blocks. By combining sub-optimal PTS with a preset threshold, a novel reduced complexity PTS (RC-PTS) technique is presented to decrease the computational complexity. Numerical results show that the proposed approach can achieve better performance with lower computational complexity when compared to that of other PTS approaches.     

PAPR Reduction of OFDM Signals Using Partial Transmit Sequences With Low Computational Complexity

Partial transmit sequences (PTS) is one of the attractive techniques to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) system. As conventional PTS technique requires an exhaustive searching over all the combinations of the given phase factors, which results in the computational complexity increases exponentially with the number of the sub-blocks. In this paper, we aim to obtain the desirable PAPR reduction with the low computational complexity. Since the process of searching the optimal phase factors can be categorized as combinatorial optimization with some variables and constraints, we propose a novel scheme, which is based on a nonlinear optimization approach named as simulated annealing (SA), to search the optimal combination of phase factors with low complexity. To validate the analytical results, extensive simulations have been conducted, showing that the proposed schemes can achieve significant reduction in computational complexity while keeping good PAPR reduction.     

Novel Low-Complexity Partial Transmit Sequences Scheme for PAPR Reduction in OFDM Systems Using Adaptive Differential Evolution Algorithm

A low-complexity partial transmit sequence (PTS) technique for reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing signal is presented. However, the conventional PTS scheme requires an exhaustive searching over all combinations of allowed phase factors. Consequently, the computational complexity increases exponentially with the number of the subblocks. This paper presents a novel approach to the PAPR problem to reduce computational complexity based on the relationship between phase weighing factors and transmitted bit vectors. In this paper, we aim to obtain the desirable PAPR reduction with the low computational complexity. Since the process of searching the optimal phase factors can be categorized as combinatorial optimization with some variables and constraints, we propose a novel scheme, which is based on a stochastic optimization technique called modified differential evolution, to search the optimal combination of phase factors with low complexity. To validate the analytical results, extensive simulations have been conducted, showing that the proposed schemes can achieve significant reduction in computational complexity while keeping good PAPR reduction.     

OFDM系统中基于迭代和门限理论降低PAPR的改进PTS方法

传统的部分传输序列法（PTS）中,如果要得到最佳的相位旋转因子,需要遍历所有的可选相位,这样的计算量随分割的子序列数按指数增长。本文提出两种减少计算复杂度的改进PTS方法（经迭代的IPTS和经门限的IPTS）。这两种方法都利用快速傅立叶变换（FFT）的时域循环移位特性增加备选信号,改善PAPR降低的性能。首先提出了一种利用反复迭代移位的IPTS方法(经迭代的IPTS),该方法的计算量随子序列数按线性增长。接着提出了一种利用预先设定的门限值以降低计算复杂度的IPTS方法(经门限的IPTS)。最后理论分析、比较了PTS、PTS/CSS方法与本文方法的计算复杂度。Matlab软件仿真显示,当使用相同的分割子序列数和相位旋转因子时,两种IPTS方法能够以较小的运算量达到了PTS/CSS方法性能;两种IPTS方法降低PAPR的性能要优于PTS方法,但计算复杂度并没有增加。      

降低OFDM系统中PAPR的次优化PTS算法

正交频分复用(OFDM)系统的主要缺点是峰均功率比(PAPR)增大会严重地降低了发射机中高功率放大器(HPA)的效率.部分传输序列(PTS)算法能有效地降低OFDM信号的PAPR概率,但随着PTS中分割子块的增多也带来了高的计算复杂度.为此,文中提出一种新的PTS算法,该算法比传统的穷尽搜寻法具有更佳的性能.仿真结果表明,文中所提PTS算法在降低PAPR相似的情况下,具有更小的计算复杂度.     

Sub-optimum PTS for PAPR reduction of OFDM signals

As an attractive technique for peak-to-average power ratio (PAPR) reduction, partial transmit sequences (PTS) provides good PAPR reduction performance for orthogonal frequency division multiplexing (OFDM) signals. However, optimum PTS (OPTS) requires an exhaustive search over all combinations of allowed phase factors, resulting in the high complexity. Proposed is a sub-optimum partial transmit sequences (sub-OPTS) for PAPR reduction of OFDM signals. In sub-OPTS, both the alternate optimisation and the linear property of inverse discrete Fourier transform are employed. Simulation results show that sub-OPTS can reduce the computational complexity dramatically and achieve almost the same PAPR reduction performance compared to OPTS.     

OFDM系统中峰均比降低的次优化循环移位序列方法

部分传输序列（PTS）方法需遍历所有的可选相位因子,这样的计算量随分割子序列数按指数增长。本文在对循环移位PTS方法 (PTS/CSS) 和次优PTS方法 (sub-OPTS) 进行研究的基础上,提出了一种减少计算复杂度的次优化时域循环移位序列方法（sub-OPTS/CSS）。该方法用快速傅立叶变换（FFT）的时域循环移位特性增加更多备选信号;且仅对变换后的部分备选信号进行相位优化。同时,将其与已有的一些方法的备选信号、冗余比特数、运算量进行了分析和比较。理论分析和仿真结果表明,当使用相同的分割子序列数和相位旋转因子时,sub-OPTS/CSS方法降低PAPR的性能稍次于PTS/CSS方法,但搜索最佳相位时的计算量减少了一半;sub-OPTS/CSS方法降低PAPR的性能要优于sub-OPTS方法。      

Partial Transmit Sequence Optimization Using Improved Harmony Search Algorithm for PAPR Reduction in OFDM

This paper considers the use of the Partial Transmit Sequence (PTS) technique to reduce the Peak‐to‐Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS) is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search‐based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.     

一种MIMO系统中的快速广义复球形解码算法

该文提出了一种广义复球形解码算法。它能处理多输入多输出系统(MIMO)中发送天线多于接收天线的情形,并能同时检测具有格型结构和不具有格型结构的二维空间星座信号。该算法对信号矢量的超定部分进行优化搜索,从而避免了穷尽搜索的高复杂度。仿真结果表明该广义复球形解码算法的复杂度明显低于采用穷尽搜索策略的复杂度。     

Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward (AF) mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.     

Symbol detection in spatial multiplexing system using particle swarm optimization meta-heuristics

Symbol detection in multi-input multi-output (MIMO) communication systems using different particle swarm optimization (PSO) algorithms is presented. This approach is particularly attractive as particle swarm intelligence is well suited for real-time applications, where low complexity and fast convergence is of absolute importance. While an optimal maximum likelihood (ML) detection using an exhaustive search method is prohibitively complex, PSO-assisted MIMO detection algorithms give near-optimal bit error rate (BER) performance with a significant reduction in ML complexity. The simulation results show that the proposed detectors give an acceptable BER performance and computational complexity trade-off in comparison with ML detection. These detection techniques show promising results for MIMO systems using high-order modulation schemes and more transmitting antennas where conventional ML detector becomes computationally non-practical to use. Hence, the proposed detectors are best suited for high-speed multi-antenna wireless communication systems. Copyright © 2008 John Wiley & Sons, Ltd.     

一种OFDM系统峰均比的改良PTS算法

部分传输序列（PTS）方法通过选择合适的相位序列以降低信号峰值出现的概率，该方法不会使信号发生畸变。但是传统的PTS技术计算复杂度非常大，需遍历所有可选的相位因子，其计算量随分割子序列数按指数增长。本文提出了一种正倒二叉树多层相位序列方法，该方法通过对称的树形搜索，搜索出最优的相位序列。仿真结果表明，该方法大大降低系统的复杂度．同时PAPR得到更好地抑制。     

一种降低FBMC-OQAM系统PAPR的ASSABC-PTS算法

针对滤波器组多载波-偏移正交幅度调制技术(Filter Bank Multicarrier-Offset Quadrature Amplitude Modulation,FBMC-OQAM)存在峰均功率比(Peak-to-Average Power Ratio,PAPR)过高的问题,以及传统部分传输序列(Partial Transfer Sequence,PTS)算法对PAPR抑制效果不明显,提出了一种新的基于自适应搜索策略的人工蜂群部分传输序列算法(Adaptive Search Strategy Based Artifical Bee Colony PTS,ASSABC-PTS)。首先,根据FBMC-OQAM系统特性,利用传统PTS算法对系统进行初步优化,以降低FBMC-OQAM系统的PAPR;然后,针对PTS算法中存在的计算复杂度问题,引入人工蜂群(Artificial Bee Colony,ABC)算法进行优化;最后,在ABC算法中引入自适应搜索策略提升算法的局部寻优能力,加快ABC算法的收敛速度和搜索精度。仿真实验表明,ASSABC-PTS在有效降低系统算法复杂度的同时,也极大降低了FBMC-OQAM系统的峰均功率比。     

Low complexity MIMO scheduling with channel decomposition using capacity upperbound

In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to avoid the inter-user interference, a transmit preprocessing technique which decomposes the multiuser MIMO downlink channel into multiple parallel independent single-user MIMO channels can be used. When the number of users is larger than the maximum that the system can support simultaneously, the base station selects a subset of users who have the best instantaneous channel quality to maximize the system throughput. Since the exhaustive search for the optimal user set is computationally prohibitive, a low complexity scheduling algorithm which aims to maximize the capacity upper bound is proposed. Simulation results show that the proposed scheduling algorithm achieves comparable total throughput as the optimal algorithm with much lower complexity.     

Fast codeword search algorithm using wavelet transform and partialdistance search techniques

A new fast codeword search algorithm for vector quantisers is presented. This algorithm performs a fast search in the wavelet domain of codewords using the partial distance search technique. Simulation results show that the algorithm has only 2% of the arithmetic complexity of the exhaustive search method     

Joint power allocation and multi-relay selection scheme based on system outage probability

An amplify-and-forward （AF） based multi-relay network is studied. In order to minimize the system outage probability with a required transmission rate, a joint power allocation （PA） and multi-relay selection scheme is proposed under both total and individual power constraints （TIPC）. In the proposed scheme, the idea of ordering is adopted to avoid exhaustive search without losing much system performance. Besides the channel quantity, the ordering algorithm proposed in this article also takes relays＇ maximal output ability into consideration, which is usually ignored in traditional relay ordering algorithms. In addition, simple power reallocation method is provided to avoid repetitive PA operation during the process of searching all possible relay subsets. By Adopting the idea of ordering and using the proposed power reallocation method lead to remarkable decrease of the computation complexity, making the scheme easier and more feasible to implement in practical communication scenarios. Simulations show that the proposed multi-relay selection scheme provides similar performance compared to the optimal scheme with optimal PA and exhaustive search （OPAES） but with much lower complexity.