Article
Tone injection with hexagonal constellation for peaktoaverage power ratio reduction in OFDM
Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ.
IEEE Communications Letters (Impact Factor: 1.16). 10/2006; DOI: 10.1109/LCOMM.2006.1714532 Source: DBLP

Conference Paper: Tone injection for PAPR reduction using parallel tabu search algorithm in OFDM systems
[Show abstract] [Hide abstract]
ABSTRACT: The main drawback of orthogonal frequency division multiplexing (OFDM) systems is the high peaktoaverage power ratio (PAPR), which leads to performance degradation and power inefficiency. Tone injection (TI) is a distortionless technique that can reduce PAPR efficiently without incurring data rate loss or extra side information. However, optimal TI requires an exhaustive search over all combinations of possible constellations, which is an NPhard problem. Suboptimal algorithms, achieving different tradeoffs between the PAPR reduction and complexity, have thus been developed. In this paper, we introduce a novel parallel tabu search algorithm for TI. Simulation results show that the proposed algorithm achieves significant PAPR reduction while maintaining low complexity.Global Communications Conference (GLOBECOM), 2012 IEEE; 01/2012 
Conference Paper: Using Innovative Differential Evolution Algorithm for OFDM Reducing PAPR
[Show abstract] [Hide abstract]
ABSTRACT: In this paper, tone injection (TI) based on differential evolution algorithm (DE) is proposed to reduce the peaktoaverage power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. TI is a distortionless PAPR reduction technique, but its high search complexity for finding optimal TI scheme requires an exhaustive search over all combinations of possible permutations of the expanded constellation, which is a potential problem for practical applications. In this work we present a novel convex optimization approach to numerically determine the nearoptimal tone injection (TI) solution based on a differential evolution algorithm (DETI). DETI is compared to different TI schemes for PAPR reduction and search complexity performances. The simulation results show that the proposed DETI method provides good PAPR reduction and bit errorrate (BER) performances. Finally, the DETI algorithm not only reduces the PAPR significantly, but also decreases the computational complexity. The simulation results show that it achieves more or less the same PAPR reduction as that of exhaustive search.Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2013 Seventh International Conference on; 01/2013 
Conference Paper: New PMEPR bounding analysis for coded OFDM transmitters
[Show abstract] [Hide abstract]
ABSTRACT: In this work, we derive the PMEPR upper bound for the concatenation of OFDM (orthogonal frequencydivision multiplexing) sequences. This new study enables people to construct the longer OFDM sequences from the shorter ones. We investigate how the PMEPR (peaktomeanenvelopepower ratio) upper bound changes as sequences of different lengths and PMEPRs concatenate. Our new theoretical results are crucial for the PMEPR control of OFDM sequences since it is harder to construct long sequences possessing good properties and concatenating several shorter sequences can be an effective alternative solution in practice.Global Communications Conference (GLOBECOM), 2012 IEEE; 01/2012
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.