248 research outputs found

    Distributions of Upper PAPR and Lower PAPR of OFDM Signals in Visible Light Communications

    Full text link
    Orthogonal frequency-division multiplexing (OFDM) in visible light communications (VLC) inherits the disadvantage of high peak-to-average power ratio (PAPR) from OFDM in radio frequency (RF) communications. The upper peak power and lower peak power of real-valued VLC-OFDM signals are both limited by the dynamic constraints of light emitting diodes (LEDs). The efficiency and transmitted electrical power are directly related with the upper PAPR (UPAPR) and lower PAPR (LPAPR) of VLC-OFDM. In this paper, we will derive the complementary cumulative distribution function (CCDF) of UPAPR and LPAPR, and investigate the joint distribution of UPAPR and LPAPR.Comment: acceptted by IEEE ICASSP 2014. arXiv admin note: text overlap with arXiv:1304.019

    Peak-to-average power ratio analysis for OFDM-based mixed-numerology transmissions

    Get PDF
    In this paper, the probability distribution of the peak to average power ratio (PAPR) is analyzed for the mixed numerologies transmission based on orthogonal frequency division multiplexing (OFDM). State of the art theoretical analysis implicitly assumes continuous and symmetric frequency spectrum of OFDM signals. Thus, it is difficult to be applied to the mixed-numerology system due to its complication. By comprehensively considering system parameters, including numerology, bandwidth and power level of each subband, we propose a generic analytical distribution function of PAPR for continuous-time signals based on level-crossing theory. The proposed approach can be applied to both conventional single numerology and mixed-numerology systems. In addition, it also ensures the validity for the noncontinuous-OFDM (NC-OFDM). Given the derived distribution expression, we further investigate the effect of power allocation between different numerologies on PAPR. Simulations are presented and show the good match of the proposed theoretical results

    Dual-Polarization OFDM-OQAM Wireless Communication System

    Full text link
    In this paper we describe the overall idea and results of a recently proposed radio access technique based on filter bank multicarrier (FBMC) communication system using two orthogonal polarizations: dual-polarization FBMC (DP-FBMC). Using this system we can alleviate the intrinsic interference problem in FBMC systems. This enables use of all the multicarrier techniques used in cyclic-prefix orthogonal frequency-division multiplexing (CP-OFDM) systems for channel equalization, multiple-input/multiple-output (MIMO) processing, etc., without using the extra processing required for conventional FBMC. DP-FBMC also provides other interesting advantages over CP-OFDM and FBMC such as more robustness in multipath fading channels, and more robustness to receiver carrier frequency offset (CFO) and timing offset (TO). For DP-FBMC we propose three different structures based on different multiplexing techniques in time, frequency, and polarization. We will show that one of these structures has exactly the same system complexity and equipment as conventional FBMC. In our simulation results DP-FBMC has better bit error ratio (BER) performance in dispersive channels. Based on these results, DP-FBMC has potential as a promising candidate for future wireless communication systems.Comment: 1.This paper is accepted to be published in IEEE Vehicular Technology Conference (VTC) FALL 2018. 2.In this new submitted version authors have revised the paper based on the VTC FALL reviewers comments. Therefore some typos have fixed and some results have change

    A joint OFDM PAPR reduction and data decoding scheme with no SI estimation

    Get PDF
    The need for side information (SI) estimation poses a major challenge when selected mapping (SLM) is implemented to reduce peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. Recent studies on pilot-assisted SI estimation procedures suggest that it is possible to determine the SI without the need for SI transmission. However, SI estimation adds to computational complexity and implementation challenges of practical SLM-OFDM receivers. To address these technical issues, this paper presents the use of a pilot-assisted cluster-based phase modulation and demodulation procedure called embedded coded modulation (ECM). The ECM technique uses a slightly modified SLM approach to reduce PAPR and to enable data recovery with no SI transmission and no SI estimation. In the presence of some non-linear amplifier distortion, it is shown that the ECM method achieves similar data decoding performance as conventional SLM-OFDM receiver that assumed a perfectly known SI and when the SI is estimated using a frequency-domain correlation approach. However, when the number of OFDM subcarriers is small and due to the clustering in ECM, the modified SLM produces a smaller PAPR reduction gain compared with conventional SLM

    Democratic Representations

    Full text link
    Minimization of the ℓ∞\ell_{\infty} (or maximum) norm subject to a constraint that imposes consistency to an underdetermined system of linear equations finds use in a large number of practical applications, including vector quantization, approximate nearest neighbor search, peak-to-average power ratio (or "crest factor") reduction in communication systems, and peak force minimization in robotics and control. This paper analyzes the fundamental properties of signal representations obtained by solving such a convex optimization problem. We develop bounds on the maximum magnitude of such representations using the uncertainty principle (UP) introduced by Lyubarskii and Vershynin, and study the efficacy of ℓ∞\ell_{\infty}-norm-based dynamic range reduction. Our analysis shows that matrices satisfying the UP, such as randomly subsampled Fourier or i.i.d. Gaussian matrices, enable the computation of what we call democratic representations, whose entries all have small and similar magnitude, as well as low dynamic range. To compute democratic representations at low computational complexity, we present two new, efficient convex optimization algorithms. We finally demonstrate the efficacy of democratic representations for dynamic range reduction in a DVB-T2-based broadcast system.Comment: Submitted to a Journa
    • …
    corecore