14 December 2020 in IEEE Transactions on Broadcasting
In the present article, we propose a novel selected mapping (SLM) scheme based on a Polar coding technique for peak to average power ratio (PAPR) reduction in orthogonal frequency division multiplexing with index modulation (OFDM-IM) systems. The proposed scheme by utilizing random frozen bits in polar codes generates different number of candidate sequences. Then the candidate sequence with the smallest PAPR is selected for transmission. The proposed scheme can be considered as one block in an OFDM-IM system that performs both PAPR reduction and error correction. For a fair comparison, the performance of an OFDM-IM system based on the proposed scheme is compared with a system that carries out the same operations with two separate blocks where a Polar encoder is cascaded with the one for PAPR reduction (such as conventional SLM or PTS), and a Polar coded OFDM-IM system without any PAPR reduction scheme. Moreover, based on our proposed SLM scheme, a novel receiver without using side information (SI) is proposed. This SI free receiver is based on the successive cancellation list (SCL) polar decoding scheme. Simulation results show that as the Polar code can bring both error correction and PAPR reduction capabilities by using our proposed scheme. Also, the proposed SI free receiver can achieve similar bit error rate (BER) performance as that of the ideal case in both additive Gaussian white noise (AWGN) and frequency selective channels.
8 March 2022 in IEEE Access
Parseval’s theorem states that the energy of a signal is preserved by the discrete Fourier transform (DFT). Parseval’s formula shows that there is a nonlinear invariant function for the DFT, so the total energy of a signal can be computed from the signal or its DFT using the same nonlinear function. In this paper, we try to answer the question of whether there are linear invariant functions for the DFT, and how they can be found, along with their potential applications in digital signal processing. In order to answer this question, we first prove that the only linear equations that are preserved by the DFT are its orthogonal projections. Then, using Hilbert space for adjoint operators, we propose an algorithm that computes all linear invariant functions for the DFT. These linear invariant functions are also shown to be useful and important in a variety of signal-processing applications, particularly for finding some boundaries for transformed signals without explicitly evaluating the DFT, and vice versa. Additionally, using the proposed identities, we demonstrate that the average of a circular auto-correlation function for a large class of signals is preserved by the DFT. Finally, the results reported in this paper are verified for several short-length and long-length DFTs, including a 256-point DFT.
24 April 2019 in IEEE Transactions on Broadcasting
In this paper, a peak to average power ratio (PAPR) reduction scheme with low complexity and high performance for orthogonal frequency division multiplexing (OFDM) signals is proposed. The proposed scheme is a hybrid PAPR scheme that employs a two-stage cascade structure. The first stage is a post-IFFT stage that can construct a set of high-order quadrature amplitude modulation (QAM) sequences from QPSK or BPSK sequences with the smallest possible number of IFFTs. The second stage is based on an optimal Class-III selected mapping (SLM) scheme which consists of a bank of parallel blocks. Each of these blocks generates more candidate sequences from each of QAM sequences by passing it through a set of parallel sub-blocks that perform circular convolution with perfect sequences and circular shifting with optimum shift values. Simulation results show that the proposed scheme can outperform existing schemes in terms of PAPR reduction with lower complexity.
12 December 2017 in Wireless Personal Communications