Abstract

Efficient utilization of the spectrum, increased resilience to inter-symbol interference (ISI) and simpler channel equalization are becoming important considerations in the design of wireless communication systems including visible light communication (VLC) systems. In this regard, orthogonal frequency division multiplexing (OFDM) has become a preferred modulation technique in wireless communication systems design. However, one of its major challenges is the high peak-to-average power ratio that leads to major inefficiencies. Symbol position permutation (SPP) is a distortion-less technique that achieves substantial PAPR reduction without BER degradation. However, the existing works focus on PAPR reduction using SPP for the radio frequency (RF) OFDM and the use of this technique in optical OFDM is not properly investigated. Therefore, in this paper, we present a new PAPR reduction technique based on lexicographical permutations called lexicographical symbol position permutation (LSPP) for PAPR reduction in direct current optical OFDM (DCO-OFDM). The proposed scheme is less complex than the conventional selective mapping (CSLM) scheme since there is no multiplication of the phase sequences with the DCO OFDM symbol to generate the candidate signals. We further introduce a new way of reducing the complexity by introducing a threshold PAPR and demonstrate that the complexity in terms of inverse fast Fourier transform (IFFT) operations can be reduced substantially depending on the selected threshold and the number of candidate signals.

Highlights

  • INTRODUCTIONVisible light communication (VLC) has lately attracted consideration from researchers in academia, industry and governments around the globe due to its tremendous advantages such as interference-free communication, high levels of security, low cost due to the utilization of the license-free spectrum and availability of light-emitting diodes (LEDs) used for communication [1]–[3]

  • Visible light communication (VLC) has lately attracted consideration from researchers in academia, industry and governments around the globe due to its tremendous advantages such as interference-free communication, high levels of security, low cost due to the utilization of the license-free spectrum and availability of light-emitting diodes (LEDs) used for communication [1]–[3].To attain the higher data rates required nowadays, multicarrier modulation techniques such as orthogonal frequency division multiplexing (OFDM) have been considered for practical implementation in visible light communication (VLC) systems [4], [5]

  • It can be seen that at a complementary cumulative distribution function (CCDF) = 103, the peak-to-average power ratio (PAPR) reduction achieved by our proposed lexicographical symbol position permutation (LSPP) is quite significant with values of 1.6, 2.4, 2.7 and 3dB respectively for U = 4, 8, 16 and 32 candidate signals compared to the original DCO OFDM

Read more

Summary

INTRODUCTION

Visible light communication (VLC) has lately attracted consideration from researchers in academia, industry and governments around the globe due to its tremendous advantages such as interference-free communication, high levels of security, low cost due to the utilization of the license-free spectrum and availability of light-emitting diodes (LEDs) used for communication [1]–[3]. A few techniques have been proposed for PAPR reduction in VLC systems One of these methods is clipping and filtering [10] that can be implemented, it results in significant in-band distortion and out-band radiation which leads to performance degradation in terms of both the spectrum efficiency and the BER. Related to the SLM technique, symbol or bit interleaving method [18] and the data position permutation (DPP) [19] involve generation of multiple candidate signals for PAPR reduction. If the mth(m ≤ U ) permutation sequence satisfies the threshold condition, U − m candidate sequences are not generated and U − m IFFT operations are not performed This new method does reduce the PAPR and results in a significant reduction in computational complexity.

PAPR PROBLEM
CONVENTIONAL SELECTIVE MAPPING AND DCO OFDM
COMPLEXITY REDUCTION
COMPLEXITY REDUCTION ANALYSIS
RESULTS AND DISCUSSIONS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call