Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical Permutations
In direct current optical orthogonal frequency division multiplexing (DCO-OFDM) systems, the high peak-to-average power ratio (PAPR) has been a significant challenge. Recently, lexicographical symbol position permutation (LSPP) using random permutations has been introduced as an efficient solution t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-06-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/12/13/2797 |
| _version_ | 1797591909570445312 |
|---|---|
| author | Roland Niwareeba Mitchell A. Cox Ling Cheng |
| author_facet | Roland Niwareeba Mitchell A. Cox Ling Cheng |
| author_sort | Roland Niwareeba |
| collection | DOAJ |
| description | In direct current optical orthogonal frequency division multiplexing (DCO-OFDM) systems, the high peak-to-average power ratio (PAPR) has been a significant challenge. Recently, lexicographical symbol position permutation (LSPP) using random permutations has been introduced as an efficient solution to reduce high PAPR. In this paper, we aim to evaluate the effectiveness of LSPP by comparing both adjacent and interleaved lexicographical permutation sequences with random lexicographical permutation sequences. Our findings demonstrate that random permutation yields superior PAPR reduction performance results when compared to adjacent and interleaved permutation. However, in scenarios with a limited number of sub-blocks, the use of adjacent and interleaved permutation becomes more favorable, as they can eliminate the possibility of generating identical permutation sequences, a drawback of random permutation. Additionally, we propose a novel algorithm to determine the optimal number of candidate permutation sequences that can achieve acceptable PAPR reduction performance while adhering to computational complexity constraints defined by the system requirements. |
| first_indexed | 2024-03-11T01:44:07Z |
| format | Article |
| id | doaj.art-86b5ccbf61e84a19bd8e178a676c3172 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-11T01:44:07Z |
| publishDate | 2023-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-86b5ccbf61e84a19bd8e178a676c31722023-11-18T16:23:35ZengMDPI AGElectronics2079-92922023-06-011213279710.3390/electronics12132797Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical PermutationsRoland Niwareeba0Mitchell A. Cox1Ling Cheng2School of Electrical and Information Engineering, University of the Witwatersrand, Braamfontein, Johannesburg 2000, South AfricaSchool of Electrical and Information Engineering, University of the Witwatersrand, Braamfontein, Johannesburg 2000, South AfricaSchool of Electrical and Information Engineering, University of the Witwatersrand, Braamfontein, Johannesburg 2000, South AfricaIn direct current optical orthogonal frequency division multiplexing (DCO-OFDM) systems, the high peak-to-average power ratio (PAPR) has been a significant challenge. Recently, lexicographical symbol position permutation (LSPP) using random permutations has been introduced as an efficient solution to reduce high PAPR. In this paper, we aim to evaluate the effectiveness of LSPP by comparing both adjacent and interleaved lexicographical permutation sequences with random lexicographical permutation sequences. Our findings demonstrate that random permutation yields superior PAPR reduction performance results when compared to adjacent and interleaved permutation. However, in scenarios with a limited number of sub-blocks, the use of adjacent and interleaved permutation becomes more favorable, as they can eliminate the possibility of generating identical permutation sequences, a drawback of random permutation. Additionally, we propose a novel algorithm to determine the optimal number of candidate permutation sequences that can achieve acceptable PAPR reduction performance while adhering to computational complexity constraints defined by the system requirements.https://www.mdpi.com/2079-9292/12/13/2797CCDFDCO-OFDMlexicographicalPAPRpermutationsVLC |
| spellingShingle | Roland Niwareeba Mitchell A. Cox Ling Cheng Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical Permutations Electronics CCDF DCO-OFDM lexicographical PAPR permutations VLC |
| title | Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical Permutations |
| title_full | Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical Permutations |
| title_fullStr | Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical Permutations |
| title_full_unstemmed | Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical Permutations |
| title_short | Adaptive-Mode PAPR Reduction Algorithm for Optical OFDM Systems Leveraging Lexicographical Permutations |
| title_sort | adaptive mode papr reduction algorithm for optical ofdm systems leveraging lexicographical permutations |
| topic | CCDF DCO-OFDM lexicographical PAPR permutations VLC |
| url | https://www.mdpi.com/2079-9292/12/13/2797 |
| work_keys_str_mv | AT rolandniwareeba adaptivemodepaprreductionalgorithmforopticalofdmsystemsleveraginglexicographicalpermutations AT mitchellacox adaptivemodepaprreductionalgorithmforopticalofdmsystemsleveraginglexicographicalpermutations AT lingcheng adaptivemodepaprreductionalgorithmforopticalofdmsystemsleveraginglexicographicalpermutations |