共查询到19条相似文献,搜索用时 578 毫秒
1.
降低OFDM系统中PAPR的次优化PTS算法 总被引:1,自引:1,他引:0
正交频分复用(OFDM)系统的主要缺点是峰均功率比(PAPR)增大会严重地降低了发射机中高功率放大器(HPA)的效率.部分传输序列(PTS)算法能有效地降低OFDM信号的PAPR概率,但随着PTS中分割子块的增多也带来了高的计算复杂度.为此,文中提出一种新的PTS算法,该算法比传统的穷尽搜寻法具有更佳的性能.仿真结果表明,文中所提PTS算法在降低PAPR相似的情况下,具有更小的计算复杂度. 相似文献
2.
正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统中,峰均功率比(Peak to AveragePower Ratio,PAPR)过高会导致收发器的非线性失真,严重影响系统的性能。传统的部分传输序列(Partial TransmitSequence,PTS)算法能够有效地降低PAPR,然而其计算复杂度随着分块数目增长呈指数增加。在研究PTS的基础上提出了双重迭代PTS算法,该算法利用增加迭代次数,并且每次迭代时选择不同的相位旋转因子集合来优化OFDM系统的峰均比性能。该算法在峰均比性能上优于常规OFDM系统以及普通迭代PTS算法,在降低峰均比性能和计算复杂度之间取得了较好的折衷。 相似文献
3.
部分传输序列(PTS)是一种复杂度较高的减小正交频分复用(OFDM)系统峰均功率比(PAPR)的方法。文中介绍了两种降低PTS复杂度的方法,一种是m序列PTS,另一种是迭代移位线性搜索法PTS。并将这两种方法应用到基于IEEE802.16a的OFDM系统中,仿真表明这两种方法都能够降低PTS的复杂度,同时减小系统的PAPR。 相似文献
4.
5.
6.
7.
部分传输序列(PTS)算法能够有效地降低OFDM通信系统的平均峰值功率比(PA-PR)。文中研究了哈达码矩阵及传统的μ率压缩算法,提出了一种新的能够有效的降低PAPR算法。提出的算法是基于传统的PTS算法,利用哈达码矩阵优化部分传输序列,结合μ率压缩算法进而降低OFDM系统的PAPR值。通过实验仿真证明,文中提出的算法能够降低OFDM系统的PAPR值,而且性能更加优越于单独的μ率压缩以及传统的PTS算法,具有良好的峰值平均功率比性能。 相似文献
8.
9.
10.
11.
Yuh-Ren Tsai Sin-Jhih Huang 《Communications Letters, IEEE》2008,12(1):20-22
Partial transmit sequence (PTS) is one of the effective and uncomplicated PAPR reduction methods for OFDM systems. The phase factors applied in the weighting sequences are assumed to be uniformly distributed within [0, 2pi). By carefully investigating the phase distribution of OFDM signals, we proposed a modified PTS scheme outperforming the conventional PTS scheme in PAPR reduction performance. The process of the proposed scheme is the same as the conventional PTS, except for applying the new non-uniform phase factors. The required side information is the same as the conventional PTS applying uniform phase factors. 相似文献
12.
In general, there has been a trade-off between performance of peak-to-average power ratio (PAPR) reduction and computational complexity in partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM). In this paper, a novel subblock partition scheme (SPS) for PTS OFDM is proposed and analyzed. In this scheme, signals assigned randomly in partial subbands are duplicated and concatenated repetitively to generate each subblock. The proposed scheme, therefore, has a form of concatenation of pseudo-random and interleaved SPS. As results of simulations, the proposed scheme shows almost same PAPR reduction performance as compared to the conventional pseudo-random SPS which has been known to have the best performance. However, computational complexity can be reduced extensively. Hence, the proposed scheme may be considered to be more suitable than the conventional ones for application in high speed transmission systems such as digital terrestrial broadcasting 相似文献
13.
Sub-optimum PTS for PAPR reduction of OFDM signals 总被引:2,自引:0,他引:2
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. 相似文献
14.
A new PTS OFDM scheme with low complexity for PAPR reduction 总被引:5,自引:0,他引:5
Dae-Woon Lim Seok-Joong Heo Jong-Seon No Habong Chung 《Broadcasting, IEEE Transactions on》2006,52(1):77-82
In this paper, we introduce a new partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM) scheme with low computational complexity. In the proposed scheme, 2/sup n/-point inverse fast Fourier transform (IFFT) is divided into two parts. An input symbol sequence is partially transformed using the first l stages of IFFT into an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences. Then, the remaining n-l stages of IFFT are applied to each of the intermediate signal subsequences and the resulting signal subsequences are summed after being multiplied by each member of a set of W rotating vectors to yield W distinct OFDM signal sequences. The one with the lowest peak to average power ratio (PAPR) among these OFDM signal sequences is selected for transmission. The new PTS OFDM scheme reduces the computational complexity while it shows almost the same performance of PAPR reduction as that of the conventional PTS OFDM scheme. 相似文献
15.
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. 相似文献
16.
PAPR Reduction of OFDM Signals Using Partial Transmit Sequences With Low Computational Complexity 总被引:4,自引:0,他引:4
Tao Jiang Weidong Xiang Richardson P.C. Jinhua Guo Guangxi Zhu 《Broadcasting, IEEE Transactions on》2007,53(3):719-724
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. 相似文献
17.
18.
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. 相似文献
19.
Byung Moo Lee Rui J. P. de Figueiredo Youngok Kim 《Wireless Personal Communications》2012,62(2):431-442
The high peak-to-average power ratio (PAPR) of time domain signals has been a major problem in orthogonal frequency division
multiplexing (OFDM) systems, and thus various PAPR reduction algorithms have been introduced. Partial transmit sequence (PTS)
is one of the most attractive solutions because of its good performance without distortion. However, it is considered as an
impractical solution for the realization of high-speed data transmission systems due to its high computational complexity.
In this paper, a novel PAPR reduction algorithm based on a tree-structured searching technique is proposed to reduce the PAPR
with low complexity. In the proposed scheme, the computational complexity of searching process is decreased by adjusting the
size of tree with two parameters, width and depth, while preserving good performance. The simulation results show that proposed
scheme provides similar performance with optimum case with remarkably reduced computational complexity. 相似文献