The electro-optic output of light-emitting diodes commonly used in visible light communication systems is generally nonlinear in nature. It is particularly problematic when using advanced modulation formats, such as orthogonal frequency-division multiplexing (OFDM), which have a high peak-to-average power ratio due to clipping and distortion. In this work, we introduce the so-called C-transform to the system architecture, which utilises a Walsh–Hadamard matrix in conjunction with a discrete cosine transform to deterministically spread the information and reduce the peak-to-average power ratio (PAPR). Several bias points along the electro-optic transfer function were selected for comparison purposes, and the new transform was compared with more traditional formulations of OFDM. This paper determines that the C-transform-based OFDM demonstrated the highest degree of independence from the non-linearity and yielded superior bit-error rate (BER) results. We note an improvement of ~2.5 dB in the power penalty at a BER of 10−4 in comparison to OFDM.
1 April 2011 in American Journal of Engineering and Applied Sciences
This paper introduces a new derivation of the radix- fast algorithm for the forward odd new Mersenne number transform (ONMNT) and the inverse odd new Mersenne number transform (IONMNT). This involves introducing new equations and functions in finite fields, bringing particular challenges unlike those in other fields. The radix- algorithm combines the benefits of the reduced number of operations of the radix-4 algorithm and the simple butterfly structure of the radix-2 algorithm, making it suitable for various applications such as lightweight ciphers, authenticated encryption, hash functions, signal processing, and convolution calculations. The multidimensional linear index mapping technique is the conventional method used to derive the radix- algorithm. However, this method does not provide clear insights into the underlying structure and flexibility of the radix- approach. This paper addresses this limitation and proposes a derivation based on bit-unscrambling techniques, which reverse the ordering of the output sequence, resulting in efficient calculations with fewer operations. Butterfly and signal flow diagrams are also presented to illustrate the structure of the fast algorithm for both ONMNT and IONMNT. The proposed method should pave the way for efficient and flexible implementation of ONMNT and IONMNT in applications such as lightweight ciphers and signal processing. The algorithm has been implemented in C and is validated with an example.