Orthogonal frequency division multiplexing (OFDM) [1] is a multicarrier transmission technique widely employed in diverse industry standards, such as digital audio broadcasting, digital video broadcasting, asymmetric digital subscriber line, powerline communications, 4G/5G mobile communication, and IEEE802.11 series. A key advantage of OFDM driving its widespread use is its ability to convert a broadband dispersive channel into multiple narrowband frequency-flat subchannels. Appending a cyclic prefix (CP) ensures that the linear convolution between the symbol vector and channel impulse response is converted to circular convolution, which is equivalent to point-wise multiplication of channel frequency response with each OFDM subcarrier. This enables single-tap equalization in the frequency domain of OFDM symbols. Despite its acclaimed benefits, OFDM has several limitations. For example, since OFDM employs a rectangular pulse in the time domain, it suffers from high out-of-band (OOB) emissions. To combat the limitations of OFDM, several non-orthogonal frequency division multiplexing (NOFDM) schemes, including the filterbank multicarrier (FBMC) [2], generalized FDM (GFDM) [3], universal filtered multicarrier (UFMC) [4], spectrally efficient FDM (SEFDM) [5], have been developed. In FBMC, by filtering each subcarrier using a narrowband orthogonal shaping filter, OOB emission is reduced. Furthermore, owing to its lower sensitivity to carrier frequency offset relative to OFDM, the FBMC system typically performs better than OFDM in a high-mobility scenario. UFMC offers an intermediate choice between OFDM and FBMC, where in contrast to filtering of each individual subcarriers as in FBMC and no filtering as in classic CP-OFDM, in UFMC, each clustered set of subcarriers is filtered, which allows a shorter filter length than in FBMC, thus making it suitable for low-latency applications. Specifically, adjustments of the prototype filter and length of each sub-group of symbols offer flexibility. In SEFDM, subcarrier spacing in the frequency domain is set smaller than that of OFDM, similar to faster-than-Nyquist (FTN) signaling [6] that packs symbols tighter than the Nyquist criterion to improve spectral efficiency. This benefit is achieved at the cost of detrimental inter-carrier interference (ICI) effects. To combat this limitation, several precoding schemes, such as zero-forcing [7] and eigenvalue decomposition (EVD) [8], [9], were developed. Also, in [8] and [9], optimal power allocation employing the amplification factors formulated as the reciprocals of the eigenvalues was presented. Moreover, EVD-based SEFDM was extended to that supporting physical-layer security transmission [10].
Index modulation (IM) [11] is a modulation technique that conveys information by activating a subset of available indices in the space [12], time [13], and frequency domains [14]. Time- and frequency-domain IM techniques convey information by activating indices of time slots [11] and frequency subcarriers [15], respectively. Specifically, some of the information bits are modulated using the activated index subset, and the rest are modulated onto a conventional amplitude and phase-shift keying (APSK) symbol. Additionally, IM supporting combinations of multiple resource domains, such as space-time domains [16] and space-time-frequency domains [17], have been developed. Moreover, IM has been introduced in beamspace dimensions [18], [19], filter shape dimensions [20], and distributed node-space dimensions [21]. More recently, in [22], the SEFDM with SIM (SEFDM-SIM) scheme was first studied without employing any precoding and the minimum mean-square error (MMSE)-based linear receiver was developed. Also, a joint channel estimation and equalization technique was developed for SEFDM-SIM [23]. Furthermore, the time-domain counterpart of SEFDM-SIM was independently developed as FTN-IM [24], [25], [26]. To the best of our knowledge, the conventional SEFDM-SIM scheme has not been investigated with any sophisticated precoding or power allocation, based on our review of the existing literature.
Against the above background, the novel contributions of this paper are as follows
We propose a novel precoded NOFDM-SIM architecture to enhance spectral efficiency by exploiting the combined benefits of the reduced subcarrier spacing of filtered SEFDM and the gain from introducing SIM. More specifically, EVD-based precoding is employed to eliminate the effects of ICI, imposed by the non-orthogonality of subcarriers and filtering of subcarriers.
We investigate the proposed scheme by analyzing its power spectral density (PSD), bit-error rate (BER), and peak-to-average power ratio (PAPR) performance.
The ICI effects of NOFDM-SIM, resulting from the combination of symbol density (occurring due to NOFDM) and symbol sparsity (occurring due to SIM), are analyzed in detail. Furthermore, the effects of precoding and power allocation on ICI are also revealed.
We present a three-stage concatenated iterative decoder employing the turbo coding principle for the proposed scheme to demonstrate the near-capacity performance in a frequency-flat Rayleigh fading channel.
The rest of this paper is organized as follows. Section II describes our proposed scheme. Section III presents the BER performance in a channel-uncoded scenario to demonstrate that the proposed scheme does not have any BER penalty over its orthogonal counterpart. Section IV shows the PAPR evaluations to evince that PAPR is not affected by the introduction of non-orthogonality in the proposed method. In Section V, we investigate the bandlimitedness in our scheme resulting from its subcarrier-wise filtering. Section VI evaluates the resultant ICI in the proposed scheme arising from the amalgamation of contrasting features of reduced subcarrier spacing and sparsely activated subcarriers. The BER performance in near-capacity turbo-encoded scenarios is presented in Section VII. In Section VIII, we discuss the implementation complexity of the proposed method. Finally, Section IX concludes the paper.
Notation: We use boldface uppercase letters to denote matrices, boldface lowercase letters for vectors, and lowercase letters with a suffix to denote elements of a vector. \mathbb {C}^{j\times k}
and \mathbb {R}^{j\times k}
denote the complex and real fields of dimensions j\times k
, respectively. \mathbb {P}(.)
denotes the probability of an event, \mathbb {E}[.]
denotes the expectation of a random variable. Transpose and Hermitian operations are denoted by (.)^{T}
and (.)^{H}
, respectively.
SECTION II.
System Model of Proposed Scheme
Let us consider a precoded NOFDM-SIM scheme operating over a frequency-flat Rayleigh fading channel, where the channel coefficients are modeled by independent and identically distributed complex Gaussian random variables. A block diagram of our transceiver is shown in Fig. 2. In the following subsections, we expound on the features of each block.
A. Frequency-Domain Index Modulation
Information bits are modulated onto N
subcarriers, which are divided into L
clusters, each containing M
subcarriers. Thus, we have the relationship N=LM
. We assume that B
information bits are modulated onto each cluster, giving a total of LB
information bits per frame. For the l
th cluster, B
information bits are divided into two groups of B_{1}
and B_{2}
bits as shown in Fig. 2, where B=B_{1}+B_{2}
. The first B_{1}
bits are used to activate an index activation pattern of subcarriers, which corresponds to SIM. For example, if K
out of M
subcarriers are activated in a given cluster, then B_{1}=\left \lfloor{ \log _{2}{\binom{M}{ K}}}\right \rfloor
bits are modulated using the SIM principle. Since M-K
subcarriers are deactivated, the symbols modulated on the active subcarriers are scaled by a factor of \sqrt {M/K}
to maintain the same transmit power. The remaining B_{2}
bits are modulated based on \mathcal {P}
-ary APSK modulation, where {\mathcal {P}=2^{B_{2}/K}}
. Thus, the proposed modulation scheme is characterized by the parameters (M,K,\mathcal {P})
. The resultant spectral efficiency is formulated by \begin{equation*} R=\frac {1}{\tau } \left({\left \lfloor{ \log _{2}{\binom{M}{ K}}}\right \rfloor + K\log _{2}{\mathcal {P}}}\right) \hspace {2mm}\text {bits/s/Hz}.\tag{1}\end{equation*}
View Source
\begin{equation*} R=\frac {1}{\tau } \left({\left \lfloor{ \log _{2}{\binom{M}{ K}}}\right \rfloor + K\log _{2}{\mathcal {P}}}\right) \hspace {2mm}\text {bits/s/Hz}.\tag{1}\end{equation*}
Moreover, the corresponding energy efficiency of the proposed scheme in bit per Joule per noise level [28] can be expressed as \begin{equation*} E=\frac {R}{P_{t}/N_{0}},\tag{2}\end{equation*}
View Source
\begin{equation*} E=\frac {R}{P_{t}/N_{0}},\tag{2}\end{equation*}
where P_{t}
is transmit power and N_{0}
is one-sided noise power spectral density. The u
th frame of our SIM symbols in the frequency domain is represented by \begin{equation*} \boldsymbol {s}_{u}=[\boldsymbol {s}_{u,0}^{T}, \boldsymbol {s}_{u,1}^{T}, \ldots, \boldsymbol {s}_{u,N-1}^{T}]^{T} \in \mathbb {C}^{LM},\tag{3}\end{equation*}
View Source
\begin{equation*} \boldsymbol {s}_{u}=[\boldsymbol {s}_{u,0}^{T}, \boldsymbol {s}_{u,1}^{T}, \ldots, \boldsymbol {s}_{u,N-1}^{T}]^{T} \in \mathbb {C}^{LM},\tag{3}\end{equation*}
where \begin{equation*} \boldsymbol {s}_{u,l}=[s_{u,l}^{(0)}, s_{u,l}^{(1) }, \ldots, s_{u,l}^{(M{-}1)}]^{T} \in \mathbb {C}^{M}\hspace {4mm} (0\leq l < L).\tag{4}\end{equation*}
View Source
\begin{equation*} \boldsymbol {s}_{u,l}=[s_{u,l}^{(0)}, s_{u,l}^{(1) }, \ldots, s_{u,l}^{(M{-}1)}]^{T} \in \mathbb {C}^{M}\hspace {4mm} (0\leq l < L).\tag{4}\end{equation*}
For ease of exposition, the frame structure employing the SIM parameters M=4, K=1
is exemplified in Fig. 3. Furthermore, s_{u,l}^{(m)}
is the symbol modulated on the m
th subcarrier in the l
th cluster. The symbol block has to satisfy the energy constraint \mathbb {E}[\boldsymbol {s}_{u}^{H} \boldsymbol {s}_{u}]=LM\sigma _{s}^{2}
, where \sigma _{s}^{2}
is the average energy per symbol.
B. EVD-Based Precoding
In our scheme, the EVD-based precoding technique [9] is invoked to attain equivalent ICI-free parallel substreams at the receiver. Let us define a matrix {\mathbf{H}}\in \mathbb {C}^{LM\times LM}
that is composed of ICI components originating due to the non-orthogonality between subcarriers introduced by reducing the subcarrier spacing in the proposed scheme. More specifically, the k
th-row and l
th-column entry of {\mathbf{H}}
is expressed as \begin{equation*} h_{k,l} = \int _{-\infty }^{\infty }g(t)g^{*}(-t)e^{j2\pi (l-k)Ft}dt,\tag{5}\end{equation*}
View Source
\begin{equation*} h_{k,l} = \int _{-\infty }^{\infty }g(t)g^{*}(-t)e^{j2\pi (l-k)Ft}dt,\tag{5}\end{equation*}
where g(t)
is the impulse response of a shaping filter and F
is the subcarrier spacing. For ease of exposition, the {\mathbf{H}}
matrix can be further represented as \begin{align*} {\mathbf{H}} = \begin{pmatrix} \phi (c_{0}, c_{0}) & \phi (c_{0}, c_{1}) & \cdots & \phi (c_{0},c_{N-1}) \\ \phi (c_{1}, c_{0}) & \phi (c_{1}, c_{1}) & \cdots & \phi (c_{1},c_{N-1}) \\ \vdots & \vdots & \ddots & \vdots \\ \phi (c_{N-1}, c_{0}) & \phi (c_{N-1}, c_{1}) & \cdots & \phi (c_{N-1},c_{N-1}) \end{pmatrix}\tag{6}\end{align*}
View Source
\begin{align*} {\mathbf{H}} = \begin{pmatrix} \phi (c_{0}, c_{0}) & \phi (c_{0}, c_{1}) & \cdots & \phi (c_{0},c_{N-1}) \\ \phi (c_{1}, c_{0}) & \phi (c_{1}, c_{1}) & \cdots & \phi (c_{1},c_{N-1}) \\ \vdots & \vdots & \ddots & \vdots \\ \phi (c_{N-1}, c_{0}) & \phi (c_{N-1}, c_{1}) & \cdots & \phi (c_{N-1},c_{N-1}) \end{pmatrix}\tag{6}\end{align*}
where c_{i} \,\,(0\le i\le N-1)
denotes the index of the n
th subcarrier, and \phi (c_{m}, c_{n})
denotes interference between the m
th and the n
th subcarriers. Note that we have the relationships of \phi (c_{m}, c_{m})=1
and \phi (c_{m}, c_{n})=\phi (c_{n}, c_{m})
. Assuming the use of the same shaping filter for each subcarrier, the relationship of \phi (c_{m}, c_{n})=\phi (c_{p}, c_{q})
is observed when \lvert m-n \rvert = \lvert p-q \rvert
for 0\leq m,n,p,q < N
. Hence, {\mathbf{H}}
is a Toeplitz matrix (or a diagonal-constant matrix). Furthermore, for a specific zero-ICI OFDM signaling, having \tau =1
and the use of a sinc pulse, {\mathbf{H}}
becomes the identity matrix owing to the orthogonal relationship of \phi (c_{m}, c_{n})=0
. With a sufficiently high subcarrier packing ratio \tau
, the {\mathbf{H}}
matrix tends to exhibit full-rank, which can be verified from its non-zero determinant, thus satisfying the positive definiteness. Hence, based on EVD, {\mathbf{H}}
is factorized as \begin{equation*} {\mathbf{H}}=\boldsymbol{ Q\Lambda Q}^{T},\tag{7}\end{equation*}
View Source
\begin{equation*} {\mathbf{H}}=\boldsymbol{ Q\Lambda Q}^{T},\tag{7}\end{equation*}
where {\boldsymbol{\Lambda }}=\text {diag}(\lambda _{0}, \lambda _{1}, \ldots, \lambda _{LM-1})\in \mathbb {R}^{LM\times LM}
is a diagonal matrix containing LM
eigenvalues \lambda _{i}~(0\leq i < LM)
, and {\mathbf{Q}}\in \mathbb {R}^{LM\times LM}
is an orthonormal matrix containing LM
eigenvectors.
At the transmitter, the frequency-domain modulated symbols \boldsymbol {s}_{u}
are precoded by {\mathbf{QP}}
, where {\mathbf{P}}\in \mathbb {R}^{LM\times LM}
is a real-valued diagonal matrix, called the power-allocation (PA) matrix. Thus, the precoded symbols of the u
th frame in the frequency domain are expressed as \begin{align*} \boldsymbol {x}_{u}=&[x_{u,0}, x_{u,1}, \ldots, x_{u,N-1}]^{T} \in \mathbb {C}^{N\times N} \tag{8}\\=&{\mathbf{QP}} \boldsymbol {s}_{u}. \tag{9}\end{align*}
View Source
\begin{align*} \boldsymbol {x}_{u}=&[x_{u,0}, x_{u,1}, \ldots, x_{u,N-1}]^{T} \in \mathbb {C}^{N\times N} \tag{8}\\=&{\mathbf{QP}} \boldsymbol {s}_{u}. \tag{9}\end{align*}
Here, according to [9], the PA matrix {\mathbf{P}}
is given by \begin{align*} {\mathbf{P}}=&{\boldsymbol{\Lambda }}^{-\frac {1}{2}} \\=&\text {diag}\left({\frac {1}{\sqrt {\lambda _{0}}}, \frac {1}{\sqrt {\lambda _{1}}}, \ldots, \frac {1}{\sqrt {\lambda _{N-1}}}}\right).\tag{10}\end{align*}
View Source
\begin{align*} {\mathbf{P}}=&{\boldsymbol{\Lambda }}^{-\frac {1}{2}} \\=&\text {diag}\left({\frac {1}{\sqrt {\lambda _{0}}}, \frac {1}{\sqrt {\lambda _{1}}}, \ldots, \frac {1}{\sqrt {\lambda _{N-1}}}}\right).\tag{10}\end{align*}
As observed from (10), the eigenvalues \lambda _{i}
, 0\leq i < N
have to be positive and sufficiently large to be tractable [9]. Also, low eigenvalues tend to increase the effects of inter-frame interference [29]. Hence, the \tau
value has to be set sufficiently high to avoid the limitations imposed by the numerically ill-conditioned H matrix.
The complex multiplication operations used in the linear precoding are dominant in the complexity of our proposed scheme. However, by approximating the EVD using a fast Fourier transform (FFT) according to [30], the multiplications of {\mathbf{Q}}
and {\mathbf{Q}}^{H}
can be efficiently implemented [31], which has complexity order O(LM\log LM)
. For a predetermined number of subcarriers N
, subcarrier packing ratio \tau
, and subcarrier filters employed at the transmitter, the FFT calculations can be carried out offline in advance of transmission since the {\mathbf{H}}
matrix is uniquely defined by these three parameters.
C. Non-Orthogonal FDM Signaling
Having attained the discrete precoded symbols \boldsymbol {x}_{u}
in the frequency domain, now let us introduce the transmitted signals in the continuous-time complex-valued baseband representation as follows:\begin{equation*} x(t)=\sum _{u=-\infty }^{\infty }\sum _{v=0}^{N-1} x_{u,v}g_{u,v}(t),\tag{11}\end{equation*}
View Source
\begin{equation*} x(t)=\sum _{u=-\infty }^{\infty }\sum _{v=0}^{N-1} x_{u,v}g_{u,v}(t),\tag{11}\end{equation*}
where g_{u,v}(t)
is the basis pulse shape, formulated by \begin{equation*} g_{u,v}(t)=g(t-uT)e^{j2\pi vtF}.\tag{12}\end{equation*}
View Source
\begin{equation*} g_{u,v}(t)=g(t-uT)e^{j2\pi vtF}.\tag{12}\end{equation*}
More specifically, (12) is obtained by appropriate time-frequency shifting of a prototype transmit filter g(t)
in the time-frequency lattice (Fig. 4). The subcarrier spacing is reduced below the orthogonality limit by applying F=\tau F_{0}\,\,(0\leq \tau < 1)
in (12), where F_{0}={1}/{T_{0}}
and T_{0}
denote the subcarrier spacing and the symbol duration of OFDM, respectively.
D. Detection Algorithm
At the receiver, the continuous-time signal at the output of the AWGN channel is expressed as \begin{equation*} r(t)=ax(t)+n(t),\tag{13}\end{equation*}
View Source
\begin{equation*} r(t)=ax(t)+n(t),\tag{13}\end{equation*}
where a
is the block-fading coefficient, and n(t)
is a complex-valued white Gaussian random process with a zero mean and one-sided spectral density of N_{0}
. Based on the received signal r(t)
, the receiver carries out matched filtering, sampling, ICI cancellation, and demodulation to recover the transmitted bits. These steps are described as follows.
1) Matched Filtering & Sampling:
The received signal is projected onto the basis pulse g_{u,v}
based on matched filtering to maximize the signal-to-noise ratio (SNR). Then, the matched-filtered signal is sampled. To be more specific, the sampled symbol on the v
th subcarrier in the u
th frame is represented by \begin{align*} r_{u,v}=&{a_{u}}\sum _{m=-\infty }^{\infty }\sum _{n=0}^{N-1} x_{m,n} \\&\times \underbrace {\int _{-\infty }^{\infty } g(t-mT)g^{*}(t-uT)e^{j2\pi (n-v)tF}dt}_{h_{m,n}} \\+&\underbrace {\int _{-\infty }^{\infty } n(t)g^{*}(t-uT)e^{-j2\pi vtF}dt}_{\eta _{u,v}}, \tag{14}\end{align*}
View Source
\begin{align*} r_{u,v}=&{a_{u}}\sum _{m=-\infty }^{\infty }\sum _{n=0}^{N-1} x_{m,n} \\&\times \underbrace {\int _{-\infty }^{\infty } g(t-mT)g^{*}(t-uT)e^{j2\pi (n-v)tF}dt}_{h_{m,n}} \\+&\underbrace {\int _{-\infty }^{\infty } n(t)g^{*}(t-uT)e^{-j2\pi vtF}dt}_{\eta _{u,v}}, \tag{14}\end{align*}
where a_{u}
is the frequency-flat block-fading coefficient for the u
th frame and the term \eta _{u,v}
corresponds to the additive noise component. From (14), the vectorial form of the sampled symbols is expressed as \begin{align*} \boldsymbol {r}_{u}=&[r_{u,0}, r_{u,1}, \ldots, r_{u,N-1}]^{T} \in \mathbb {C}^{N}\tag{15}\\=&{a_{u}{\mathbf{H}} \boldsymbol {x}_{u} + \boldsymbol {\eta }_{u}}, \tag{16}\end{align*}
View Source
\begin{align*} \boldsymbol {r}_{u}=&[r_{u,0}, r_{u,1}, \ldots, r_{u,N-1}]^{T} \in \mathbb {C}^{N}\tag{15}\\=&{a_{u}{\mathbf{H}} \boldsymbol {x}_{u} + \boldsymbol {\eta }_{u}}, \tag{16}\end{align*}
where \begin{equation*} \boldsymbol {\eta }_{u} = [\eta _{u,0},\cdots,\eta _{u,N-1}]^{T}.\tag{17}\end{equation*}
View Source
\begin{equation*} \boldsymbol {\eta }_{u} = [\eta _{u,0},\cdots,\eta _{u,N-1}]^{T}.\tag{17}\end{equation*}
The noise samples \eta _{u,v}
are correlated and have covariance \begin{equation*} \mathbb {E}[\boldsymbol {\eta }_{u} \boldsymbol {\eta }_{u}^{H}]=N_{0}{\mathbf{H}},\tag{18}\end{equation*}
View Source
\begin{equation*} \mathbb {E}[\boldsymbol {\eta }_{u} \boldsymbol {\eta }_{u}^{H}]=N_{0}{\mathbf{H}},\tag{18}\end{equation*}
which is specific to SEFDM.
3) Demodulation:
Next, we introduce two types of demodulators, namely the maximum likelihood (ML) detector and the log-likelihood ratio (LLR)-based low-complexity detector, for our proposed NOFDM-SIM scheme.
3.1) ML Detection:
The ML detector attains optimal detection performance by performing an exhaustive joint search on the legitimate SIM and APSK constellation. The equalized symbols { \boldsymbol {r}_{u, \text {eq}}}
are split into L
sub-blocks { \boldsymbol {r}_{u, \text {eq}}^{l}}~(0\leq l < L)
, each containing M
symbols, similar to the transmitter. Then, the estimated information bits in the l
th sub-block \hat { \boldsymbol {b}}^{l}=(\hat { \boldsymbol {b}}_{1}^{l},\hat { \boldsymbol {b}}_{2}^{l})
are computed as follows:\begin{equation*} \hat { \boldsymbol {b}}^{l}= \mathop {\mathrm {arg\,min}} _{(\boldsymbol {b}_{1}^{l}, \boldsymbol {b}_{2}^{l})} \left \Vert{ { \boldsymbol {r}_{u,\text {eq}}^{l}}- \boldsymbol {s}_{u}|_{(\boldsymbol {b}_{1}^{l}, \boldsymbol {b}_{2}^{l})}}\right \Vert ^{2}. \tag{26}\end{equation*}
View Source
\begin{equation*} \hat { \boldsymbol {b}}^{l}= \mathop {\mathrm {arg\,min}} _{(\boldsymbol {b}_{1}^{l}, \boldsymbol {b}_{2}^{l})} \left \Vert{ { \boldsymbol {r}_{u,\text {eq}}^{l}}- \boldsymbol {s}_{u}|_{(\boldsymbol {b}_{1}^{l}, \boldsymbol {b}_{2}^{l})}}\right \Vert ^{2}. \tag{26}\end{equation*}
Naturally, the complexity of ML detection is significantly high, especially when the number of subcarriers M
is high.
3.2) Low-Complexity LLR-Based Detection:
To avoid the high complexity imposed by an exhaustive ML search, reduced-complexity two-stage LLR-based detection is used to demodulate the symbols in { \boldsymbol {r}_{u,\text {eq}}}
, similar to that employed for OFDM-SIM [32]. More specifically, the LLR of the m
th symbol s_{m}^{(l)}
in the l
th frame is given by \begin{equation*} L_{m}^{(l)}=\ln \left({\frac {\sum _{i=1}^{\mathcal {P}} \mathbb {P}(s_{m}^{(l)}=s_{i})|r_{m}(l)}{\mathbb {P}(s_{m}^{(l)}=0)|r_{m}(l)}}\right).\tag{27}\end{equation*}
View Source
\begin{equation*} L_{m}^{(l)}=\ln \left({\frac {\sum _{i=1}^{\mathcal {P}} \mathbb {P}(s_{m}^{(l)}=s_{i})|r_{m}(l)}{\mathbb {P}(s_{m}^{(l)}=0)|r_{m}(l)}}\right).\tag{27}\end{equation*}
At the first stage of LLR detection, an active index is estimated by a high value of the corresponding LLR. For example, in the case of IM parameters (M,K,\mathcal {P})=(4,1,4)
, the index with the highest LLR value is detected as the activated index. The symbol corresponding to the detected active index is then demapped according to the look-up table. At the second stage, the APSK symbol of the estimated active symbol is demodulated.
The LLR expression in (27) is further simplified for ease of implementation. Firstly, note that \begin{align*} \sum _{i=1}^{\mathcal {P}} \mathbb {P}(s_{m}^{(l)}=s_{i})=&\frac {K}{M}\tag{28}\\ \mathbb {P}(s_{m}^{(l)}=0)=&\frac {M-K}{M}.\tag{29}\end{align*}
View Source
\begin{align*} \sum _{i=1}^{\mathcal {P}} \mathbb {P}(s_{m}^{(l)}=s_{i})=&\frac {K}{M}\tag{28}\\ \mathbb {P}(s_{m}^{(l)}=0)=&\frac {M-K}{M}.\tag{29}\end{align*}
Then, by applying Bayes’ theorem to (27) and substituting (28) and (29) into (27), we arrive at \begin{align*} L_{m}^{(l)}=&\ln \left({\frac {K}{M-K}}\right)+\frac {|r^{(l)}_{m,\text {eq}}|^{2}}{N_{0}} \\&+\,\ln \left({\sum _{i=1}^{\mathcal {P}} \exp \left({\underbrace {-\frac {|r^{(l)}_{m,\text {eq}}-s_{i}|^{2}} {N_{0}}}_{z_{i}}}\right)}\right) \\=&\ln \left({\frac {K}{M-K}}\right)+\frac {|r^{(l)}_{m,\text {eq}}|^{2}}{N_{0}} +\ln \left({\sum _{i=1}^{\mathcal {P}} \exp (z_{i})}\right).\tag{30}\end{align*}
View Source
\begin{align*} L_{m}^{(l)}=&\ln \left({\frac {K}{M-K}}\right)+\frac {|r^{(l)}_{m,\text {eq}}|^{2}}{N_{0}} \\&+\,\ln \left({\sum _{i=1}^{\mathcal {P}} \exp \left({\underbrace {-\frac {|r^{(l)}_{m,\text {eq}}-s_{i}|^{2}} {N_{0}}}_{z_{i}}}\right)}\right) \\=&\ln \left({\frac {K}{M-K}}\right)+\frac {|r^{(l)}_{m,\text {eq}}|^{2}}{N_{0}} +\ln \left({\sum _{i=1}^{\mathcal {P}} \exp (z_{i})}\right).\tag{30}\end{align*}
Furthermore, the last term of (30) is simplified with the \text {max}^{*}()
function [33], which is defined for BPSK modulation as follows:\begin{align*} \text {max}^{*}(z_{1}, z_{2})=&\ln (e^{z_{1}}+e^{z_{2}})\tag{31}\\=&\text {max}(z_{1},z_{2})+\ln \big (1+e^{-|z_{1}-z_{2}|}\big).\tag{32}\end{align*}
View Source
\begin{align*} \text {max}^{*}(z_{1}, z_{2})=&\ln (e^{z_{1}}+e^{z_{2}})\tag{31}\\=&\text {max}(z_{1},z_{2})+\ln \big (1+e^{-|z_{1}-z_{2}|}\big).\tag{32}\end{align*}
In general, for P-
ary APSK modulation, we obtain [33] \begin{align*}&\hspace {-2pc}\text {max}^{*}(z_{1},z_{2},z_{3}\ldots,z_{P}) \qquad \qquad \qquad \qquad \qquad \\=&\text {max}^{*}(\ldots \text {max}^{*}(\text {max}^{*}(z_{1},z_{2}),z_{3})\ldots,z_{P}).\tag{33}\end{align*}
View Source
\begin{align*}&\hspace {-2pc}\text {max}^{*}(z_{1},z_{2},z_{3}\ldots,z_{P}) \qquad \qquad \qquad \qquad \qquad \\=&\text {max}^{*}(\ldots \text {max}^{*}(\text {max}^{*}(z_{1},z_{2}),z_{3})\ldots,z_{P}).\tag{33}\end{align*}
SECTION III.
BER Analysis in Channel-Uncoded Scenario
In this section, we evaluate the BER performance of the precoded NOFDM-SIM scheme, with and without PA for a channel-uncoded scenario, which is introduced in Section II. Specifically, we show that the proposed scheme does not incur any BER penalty over its orthogonal counterpart, despite introducing non-orthogonality among subcarriers.
Figs. 5 and 6 show the BER results of the proposed scheme with and without PA, respectively. Two benchmark schemes, namely the OFDM with BPSK and the OFDM-SIM with QPSK, were considered. Without loss of generality, the root-raised cosine (RRC) shaping filter with a frequency-domain roll-off factor \beta
is assumed as the prototype transmit filter g(t)
in (11). The pulse is T-
orthogonal and satisfies the energy constraint \int _{-\infty }^{\infty }\lvert g(t)\rvert ^{2}dt=1
. For OFDM, a rectangular pulse was employed. The SIM parameters (M,K,\mathcal {P})=(4,1,4)
were employed for both the OFDM-SIM and the proposed schemes. Furthermore, the number of subcarriers was set to N=10^{3}
for both schemes. For simplicity, we considered only the interference occurring between subcarriers in the same frame, thus ignoring the effects of inter-frame interference like most previous work. ML detection was employed at the receiver of each scheme. It can be observed in Fig. 5 that the introduction of PA in the proposed scheme allows us to accomplish perfect cancellation of the ICI effects, hence obtaining the same BER performance as that of the classic OFDM free from ICI. Recall from (22) that the EVD-based diagonalization, as well as PA, enabled the same received SNR at each subcarrier, which justifies the BER results of our proposed scheme observed in Fig. 5. It is also observable in Fig. 6 that the absence of PA imposed a BER performance penalty on the proposed scheme over the OFDM benchmark, which increased upon a decrease in \tau
.
The theoretical upper bound on the average error probability, denoted by \bar {P}_{\text {err}}
, in the proposed scheme for a channel-uncoded scenario is formulated by \begin{align*} \bar {P}_{\text {err}}\leq&\mathbb {E}\left[{\frac {1}{B}\sum _{ \boldsymbol {s}}\sum _{ \boldsymbol {s}\neq \boldsymbol {s}'}d(\boldsymbol {s}, \boldsymbol {s}')\mathbb {P}(\boldsymbol {s}\rightarrow \boldsymbol {s}')}\right]\tag{34}\\=&\frac {1}{B2^{B}}\sum _{ \boldsymbol {s}}\sum _{ \boldsymbol {s}\neq \boldsymbol {s}'}d(\boldsymbol {s}, \boldsymbol {s}')\mathbb {P}(\boldsymbol {s}\rightarrow \boldsymbol {s}'),\tag{35}\end{align*}
View Source
\begin{align*} \bar {P}_{\text {err}}\leq&\mathbb {E}\left[{\frac {1}{B}\sum _{ \boldsymbol {s}}\sum _{ \boldsymbol {s}\neq \boldsymbol {s}'}d(\boldsymbol {s}, \boldsymbol {s}')\mathbb {P}(\boldsymbol {s}\rightarrow \boldsymbol {s}')}\right]\tag{34}\\=&\frac {1}{B2^{B}}\sum _{ \boldsymbol {s}}\sum _{ \boldsymbol {s}\neq \boldsymbol {s}'}d(\boldsymbol {s}, \boldsymbol {s}')\mathbb {P}(\boldsymbol {s}\rightarrow \boldsymbol {s}'),\tag{35}\end{align*}
where \boldsymbol {s}
and \boldsymbol {s}'
denote two distinct symbols composed of B
bits each, and d(\boldsymbol {s}, \boldsymbol {s}')
denotes their Hamming distance. \mathbb {P}(\boldsymbol {s}, \boldsymbol {s}')
indicates the pairwise error probability, which is expressed for the AWGN channel as follows:\begin{equation*} \mathbb {P}(\boldsymbol {s}, \boldsymbol {s}')=Q\left[{\sqrt {\frac {\left \Vert{ \bf {Q\Lambda P}(\boldsymbol {s}- \boldsymbol {s}')}\right \Vert ^{2}}{2N_{0}}}}\right], \tag{36}\end{equation*}
View Source
\begin{equation*} \mathbb {P}(\boldsymbol {s}, \boldsymbol {s}')=Q\left[{\sqrt {\frac {\left \Vert{ \bf {Q\Lambda P}(\boldsymbol {s}- \boldsymbol {s}')}\right \Vert ^{2}}{2N_{0}}}}\right], \tag{36}\end{equation*}
where Q[\cdot]
denotes the tail probability of a normal distribution, defined as Q(z)=\frac {1}{\sqrt {2\pi }}\int _{z}^{\infty }\exp \left({-\frac {z^{2}}{2}}\right)dz
. The theoretical BER bounds with PA and without PA settings are calculated using (35) and shown in Figs. 5 and 6 to further validate our system model.
SECTION IV.
Analysis of Peak-to-Average Power Ratio
Having presented the insights on BER of the proposed scheme in Section III, here we investigate another key performance metric, the peak-to-average-power-ratio (PAPR). The PAPR [36], [37] captures the amplitude fluctuations in the envelope signal of a multicarrier transmission system. Since individually modulated subcarriers are added to generate a transmit signal, a high peak may stochastically occur in time. This is illustrated in Fig. 7, where 4 subcarriers are coherently added to generate overshoots in the envelope.
For our transmit signal expressed in (11), the PAPR is defined by \begin{equation*} \text {PAPR}=\frac {\max |x(t)|^{2}}{\mathbb {E}[|x(t)|^{2}]}.\tag{37}\end{equation*}
View Source
\begin{equation*} \text {PAPR}=\frac {\max |x(t)|^{2}}{\mathbb {E}[|x(t)|^{2}]}.\tag{37}\end{equation*}
Fig. 8 compares the complementary cumulative distribution functions (CCDFs) of the PAPR for the classic OFDM-BPSK, OFDM-IM, and the proposed precoded NOFDM-SIM (with and without power allocation) schemes, where the normalized transmission rate was set to 1 bit per channel use in each scheme. For the simulations, we considered SIM parameters (M,K)=(4,1)
and QPSK modulation. An RRC shaping filter was used for all cases except for OFDM. The subcarrier packing ratio \tau
and roll-off factor \beta
of the RRC shaping pulse were chosen as (\tau, \beta)=(1,0.5)
, (0.9, 0.5)
, (0.8,0.5)
, and (0.7,0.5)
in order to satisfy the condition of positive-definiteness of the {\mathbf{H}}
matrix. A rectangular pulse in the time domain was used for OFDM. The number of subcarriers was set to 103, and the evaluation was done without channel coding. Observe in Fig. 8 that the proposed scheme exhibited a similar PAPR to other benchmark schemes, regardless of the system parameters employed. Since a sufficiently high subcarrier packing ratio \tau
was chosen to avoid any numerical ill-conditioning of the H matrix and associated inaccuracy in eigenvalue computation, hence the employed PA did not affect the PAPR performance in our evaluations.
SECTION V.
Analysis of Bandwidth Limitation
In this section, we present the PSD of the proposed scheme, which captures the advantage of subcarrier-wise filtering. More specifically, the proposed scheme’s bandwidth limitation, i.e., the OOB emission, is compared with those of the conventional OFDM and OFDM-SIM schemes by analyzing the PSD, which characterizes the power distribution of a stochastic signal over a continuum of frequencies. For a transmit signal x(t)
of (11), its PSD is obtained as [45] \begin{equation*} P(f)=\int _{-\infty }^{\infty } A(\tau)e^{-j2\pi f\tau }d\tau,\tag{38}\end{equation*}
View Source
\begin{equation*} P(f)=\int _{-\infty }^{\infty } A(\tau)e^{-j2\pi f\tau }d\tau,\tag{38}\end{equation*}
where A(\tau)
is the autocorrelation function of x(t)
and A(0)
is the average power of x(t)
. The periodogram technique [31] is used for calculating the PSD by considering only discrete fundamental harmonic frequencies instead of continuous frequency. Specifically, x(t)
of (11) obtained from bandlimited complex-valued symbols is sampled to obtain a discrete time series. Then, the PSD is approximated by the periodogram, which is expressed as \begin{equation*} P(e^{jw})=\frac {1}{N}\Bigg \vert \sum _{n=0}^{N-1}x_{n}e^{-jwn}\Bigg \vert ^{2}.\tag{39}\end{equation*}
View Source
\begin{equation*} P(e^{jw})=\frac {1}{N}\Bigg \vert \sum _{n=0}^{N-1}x_{n}e^{-jwn}\Bigg \vert ^{2}.\tag{39}\end{equation*}
In our simulations, a sampling interval of 10−2 s is used for discretizing the continuous-time signal. Figs. 9–11 show the PSD calculated within the time interval [-100T_{0}, NT_{0}+100T_{0}]
. Fig. 9 shows the PSD comparisons of the classic OFDM-SIM scheme and the proposed precoded NOFDM-SIM scheme without PA. The number of subcarriers in OFDM was set to 20, and the SIM parameters (M,K)=(4,1)
with QPSK were employed. For the proposed scheme, the subcarrier packing ratio was selected from \tau =0.83
, 0.71, and 0.625, which resulted in 24, 28
, and 32 subcarriers, respectively, in the same bandwidth as OFDM. The proposed scheme is strictly bandlimited, unlike OFDM-SIM, as evident from Fig. 9. Specifically, the low sidelobe level in the proposed scheme was seen as a consequence of the subcarrier filtering applied at the transmitter, as mentioned in Section II-C.
Fig. 10 compares the PSD of the proposed scheme with PA, and OFDM-SIM. The \tau
value did not affect the sidelobe level much since a mild compression was assumed. The proposed scheme with a tighter subcarrier packing ratio of \tau =0.625
exhibited a marginally increased sidelobe level, but is still significantly lower than that of OFDM-SIM.
Finally, Fig. 11 compares the PSD of the proposed scheme with PA for varying roll-off factor \beta
of the RRC shaping filter while maintaining a fixed subcarrier packing ratio of \tau =0.71
. Observe that the sidelobe level goes higher as \beta
is reduced. Our additional extensive simulations showed that there was no significant difference in the PSD sidelobe levels regardless of the modulation size and of the introduction of SIM under a transmission rate of 1 bit per subcarrier.
SECTION VI.
Analysis of Inter-Carrier Interference
In this section, we examine the effects of ICI in the proposed scheme. In contrast to the conventional OFDM free from ICI, the proposed scheme suffers from two-fold ICI. First, each subcarrier is bandlimited by an RRC shaping filter, which introduces non-orthogonality among subcarriers, as detailed in Section II-C. Second, spacing between subcarriers is reduced below the orthogonal limit to increase the spectral efficiency by applying F=\tau F_{0},\,\,\tau < 1
, in (12)), hence introducing ICI. While the reduction of subcarrier spacing decreases the minimum Euclidean distance, the SIM principle described in Section II-A deactivates a subset of the subcarriers, which introduces sparsity. Hence, the proposed scheme is capable of striking a tradeoff between the symbol density and the sparsity on overall ICI. Additionally, it is similarly beneficial to characterize the effects of precoding and power allocation on ICI.
ICI imposed on the n
th subcarrier from all other subcarriers within a single block is characterized in the time domain complex-valued baseband representation as follows:\begin{align*} I_{n}=&\Bigg (\underbrace {\sum _{u=-\infty }^{\infty }\sum _{v=0}^{N-1}x_{u,v}g(t-uT)e^{j2\pi vtF}}_{\text {Complex baseband envelope signal } x(t)} \\&-\, \underbrace {\sum _{u=-\infty }^{\infty }x_{u,i}g(t-uT)e^{j2\pi ntF}}_{\substack {\text {Complex baseband signal corresponding to } \\ \text {pulse-shaped } k{\text {th}} \text {subcarrier}}}\Bigg)\Bigg \vert _{t=kT}. \tag{40}\end{align*}
View Source
\begin{align*} I_{n}=&\Bigg (\underbrace {\sum _{u=-\infty }^{\infty }\sum _{v=0}^{N-1}x_{u,v}g(t-uT)e^{j2\pi vtF}}_{\text {Complex baseband envelope signal } x(t)} \\&-\, \underbrace {\sum _{u=-\infty }^{\infty }x_{u,i}g(t-uT)e^{j2\pi ntF}}_{\substack {\text {Complex baseband signal corresponding to } \\ \text {pulse-shaped } k{\text {th}} \text {subcarrier}}}\Bigg)\Bigg \vert _{t=kT}. \tag{40}\end{align*}
Here, we numerically evaluated ICI of (40) for a single block transmission with N=8
subcarriers to maintain a practical computational complexity. The 2^{N}
legitimate symbol blocks were considered, and ICI at each of the N
subcarriers was computed. Fig. 12 compares the cumulative distribution functions (CDF) of ICI for the proposed scheme with and without SIM with that of classic OFDM, each employing a transmission rate of 1 bit per subcarrier. The RRC filter with the roll-off factor \beta =0.5
and subcarrier packing ratios \tau =0.9, 0.8, 0.7
were considered. Since our proposed scheme introduces a controlled-amount of ICI to improve spectral efficiency over OFDM, Fig. 12 enables us to quantify this deliberately introduced ICI. Observe in Fig. 12 that ICI increases upon reducing the subcarrier packing ratio \tau
. Furthermore, the CDF curves for NOFDM and NOFDM-SIM are similar with crossover points. However, as mentioned above, the proposed scheme with SIM has a lower number of active subcarriers than the non-SIM counterpart. Hence, it is expected to have a lower ICI. To show this, in Fig. 13, we compare ICI between the two schemes, where the scaling factor \sqrt {M/K}
imposed by the transmit signal is deactivated, while it is not in Fig. 12. It was found that the proposed scheme with SIM exhibited significantly lower ICI than the non-SIM case when the scaling of \sqrt {M/K}
is deactivated, as expected. Hence, the similarity in ICI occurring in the proposed schemes with and without SIM may be caused by the power scaling factor.
Furthermore, in Fig. 14, the effects of precoding and power allocation on ICI in the NOFDM scheme with SIM are depicted. Observe in the figure that the introduction of precoding renders an otherwise staircase CDF plot as a smoother curve. Moreover, employing EVD-based power allocation leads to a further increase in ICI.
SECTION VII.
Near-Capacity Turbo-Encoded EVD-NOFDM-SIM With Iterative Detection
Having characterized the fundamental properties of the proposed scheme, we now investigate its performance limits under the assumption of employing powerful channel coding and iterative decoding. More specifically, we show the performance of our scheme with three-stage serially concatenated turbo coding and iterative detection to demonstrate the near-capacity performance. In contrast to the BER evaluation covered in Section III for an uncoded AWGN channel employing ML detection, here we perform the symbol detection by max-log-MAP detector by iterative exchange of soft extrinsic information. Throughout this section, we consider communication over a frequency-flat Rayleigh fading channel.
A. Turbo-Coded Architecture
Fig. 15 shows a block diagram of the channel-coded architecture considered. The information bit sequence is encoded by a recursive systematic convolutional (RSC) encoder, followed by interleaving using the first interleaver. The interleaved bits are further encoded by a unity rate code (URC). The output bits from the URC are interleaved by the second interleaver, and the interleaved bits are loaded into each cluster of M
subcarriers. More specifically, the first B_{1}
coded bits are used to determine which subcarriers in each cluster will be activated, and the remaining B_{2}
coded bits are mapped to suitable APSK symbols, which are loaded onto the active subcarriers, according to our NOFDM-SIM principle.
The receiver is constituted by three serially concatenated soft-output detectors: a NOFDM-SIM soft demapper, a URC decoder, and an RSC decoder employing the max-log-MAP algorithm. Extrinsic information is exchanged between the three soft-output decoder stages in an iterative manner. More specifically, the joint demapper block computes LLR from the post-diagonalization received symbols and soft a-priori information from the URC decoder in each inner iteration using the expression [47] \begin{align*} L_{e}(b_{i})=&\max \limits _{ \boldsymbol {\Gamma }^{i}_{(1) }}\left[{{-}\frac {\left \Vert{ { \boldsymbol {r}_{eq}- \boldsymbol {s}}}\right \Vert ^{2}}{N_{0}}+\sum _{\substack {j=1 \\ j\neq i}}^{B} b_{j}L_{a}(b_{j})}\right] \\&-\,\max \limits _{ \boldsymbol {\Gamma }^{i}_{(0)}}\left[{{-}\frac {\left \Vert{ { \boldsymbol {r}_{eq}- \boldsymbol {s}}}\right \Vert ^{2}}{N_{0}}+\sum _{\substack {j=1 \\ j\neq i}}^{B} b_{j}L_{a}(b_{j})}\right],\tag{41}\end{align*}
View Source
\begin{align*} L_{e}(b_{i})=&\max \limits _{ \boldsymbol {\Gamma }^{i}_{(1) }}\left[{{-}\frac {\left \Vert{ { \boldsymbol {r}_{eq}- \boldsymbol {s}}}\right \Vert ^{2}}{N_{0}}+\sum _{\substack {j=1 \\ j\neq i}}^{B} b_{j}L_{a}(b_{j})}\right] \\&-\,\max \limits _{ \boldsymbol {\Gamma }^{i}_{(0)}}\left[{{-}\frac {\left \Vert{ { \boldsymbol {r}_{eq}- \boldsymbol {s}}}\right \Vert ^{2}}{N_{0}}+\sum _{\substack {j=1 \\ j\neq i}}^{B} b_{j}L_{a}(b_{j})}\right],\tag{41}\end{align*}
where L_{e}(b_{i})
and L_{a}(b_{j})
denote the extrinsic LLR and a-priori LLR, respectively, corresponding to the i
th and j
th bits. Furthermore, \boldsymbol {\Gamma }^{i}_{(1) }
and \boldsymbol {\Gamma }^{i}_{(0)}
denote the sets of legitimate symbol points in the hybrid SIM-APSK constellation where the i
th bit is 1 and 0, respectively. Also, L_{e}(b_{i})
is exchanged between the soft demapper and URC decoder in each inner decoding iteration and between the URC decoder and RSC decoder in each outer decoding iteration. We denote the number of inner decoding iterations between the soft demapper and URC decoder by I_{\text {in}}
and the number of outer decoding iterations between the URC and RSC decoders by I_{\text {out}}
. Thus, each received block is detected by a total of I_{\text {out}}\times I_{\text {in}}
decoding iterations. The estimations of transmitted bits are obtained from the output of the RSC decoder at the end of all decoding iterations.
B. BER Performance
Here, we provide numerical results to show the BER performance of the turbo-encoded NOFDM-SIM scheme, where both the activation and deactivation of power allocation were considered. Furthermore, the conventional OFDM-SIM system was selected as a benchmark scheme. The basic system parameters used in our simulations are provided in Table II. We considered the total available system bandwidth to be the same for all the schemes. At the transmitter of the proposed scheme, N=10^{3}
subcarriers were considered regardless of the subcarrier packing ratio. Correspondingly, the conventional OFDM scheme has a lower number of subcarriers in the same bandwidth than the proposed NOFDM scheme. Table III shows the representative numbers of subcarriers in the conventional OFDM scheme and the proposed precoded NOFDM-SIM scheme for different values of the subcarrier packing ratio used in our simulations. Since the classic OFDM scheme has a lower number of subcarriers than the NOFDM scheme, a higher-order modulation has to be adopted in OFDM to achieve the same transmission rate as the proposed NOFDM. The half-rate RSC code was used at the transmitter, and the second interleaver’s length was set to 2\times 10^{5}
bits, which is sufficient for demonstrating the theoretical performance limit. Furthermore, the numbers of inner and outer iterations were set to I_{\text {in}}=2
and I_{\text {out}}=40
. The target transmission rate was set to 1.5 bps/Hz. The roll-off factor of the RRC shaping pulse was set to either 0.25 or 0.5. For roll-off factor \beta =0.25
, subcarrier packing ratio \tau
was chosen from the set \{0.8, 0.9\}
, and that for \beta =0.5
was selected from the set \{0.7, 0.8, 0.9\}
. For the benchmark OFDM scheme, an ideal rectangular filter was employed, while subcarrier spacing was set to satisfy the subcarrier orthogonality.
Fig. 16 shows the BER performance of the proposed NOFDM-SIM scheme with PA, employing an RRC shaping filter with roll-off factor \beta =0.5
. Additionally, the BER performance of the classic OFDM-SIM scheme is also plotted. Observe that the proposed scheme outperforms the classic OFDM scheme by a non-negligible margin close to 8 dB, 4 dB, and 1.8 dB at \tau =0.7
, 0.8, and 0.9, respectively, for the BER{}=10^{-4}
. As seen in Fig. 16, the BER performance of the proposed scheme improves upon decreasing the subcarrier packing ratio owing to the benefits of reduced modulation order.
Fig. 17 shows the BER performance of the proposed precoded NOFDM-SIM scheme without PA, employing an RRC shaping filter with roll-off \beta =0.5
. Observe that even without PA, the proposed scheme outperforms the classic OFDM-SIM scheme by 4.4 dB, 2 dB, and 0.8 dB at \tau =0.7
, 0.8, and 0.9, respectively, for the BER{}=10^{-4}
.
Figs. 18 and 19 show the BER performance of the proposed schemes with and without PA, respectively, both employing an RRC shaping filter with roll-off factor \beta =0.25
. As shown in Fig. 18, compared to the classic OFDM-SIM scheme, gains of 4 dB and 1.8 dB are observed at \tau =0.8
and 0.9 in the proposed scheme, respectively, for the BER{}=10^{-4}
. Furthermore, in Fig. 19, we observe gains of 2.6 dB and 1.2 dB at \tau =0.8
and 0.9, respectively. Thus, the proposed precoded NOFDM-SIM scheme can perform better than the OFDM-SIM scheme even without PA. This makes it an attractive technique, since complications arising due to low eigenvalues of the interference matrix are avoided.
C. Convergence of Turbo Detector
Here, we discuss the convergence of the serially concatenated RSC-URC code and its iterative detection in our proposed NOFDM-SIM method. The three-stage structure allows us to employ a simple RSC(2,1,2)
code instead of a highly complex channel encoder and achieve near-capacity performance. By iteratively exchanging extrinsic information for I_{\text {in}}
inner iterations, and I_{\text {out}}
outer iterations as mentioned in Section VII-A, the hard bits are generated. The number of hard bits in errors reduces upon increasing iterations, and eventually, after several iterations, there is no further significant reduction in the BER. Note that the maximum number of outer decoding iterations is set to 40 in the simulations of Figs. 16–19. However, it was found in our extensive simulations that the results nearly converged at around I_{\text {out}}=8
when BER=10^{-5}
. Fig. 20 shows the convergence behavior with the outer iterations from I_{\text {out}}=1
to 20.
SECTION VIII.
Discussion on Implementation Complexity
In this section, we discuss several aspects of implementation complexity for our proposed scheme over classic OFDM.
A. Complexity of EVD
The proposed scheme performs EVD of the \textbf {H}\in \mathbb {C}^{LM\times LM}
matrix, which has the complexity of O\big ((LM)^{3}\big)
arithmetic operations. Recent work [52] has revealed that the complexity of EVD operation could be reduced to O\big ((LM)^{\omega }\big)
where \omega < 2.376
is the exponent of matrix multiplication. Furthermore, in our assumption, \textbf {H}
, \tau
, and \beta
are perfectly known in advance of data transmission. Hence, the EVD operation can be performed offline and the values can be stored in memory to avoid high real-time computational complexity. Also, as outlined in Section II-B, the EVD operation may be approximated by an FFT algorithm [30], [31], which has a complexity of O\big (LM\log (LM)\big)
.
B. Complexity of SIM Detection
The optimal ML detector in (26) may have a high complexity, which increases with the sub-block length M
. This is because exhaustive search is performed over all possible index activation patterns and APSK signal constellation points. Specifically, the ML detector requires \mathcal {O}(2^{B_{1}}\mathcal {P}^{K})
complex multiplications [32] to demodulate each of the L
sub-blocks. Thus, it may be practically infeasible for high B_{1}
and K
values. However, a low-complexity LLR-based detector mentioned in Section II-D may require as low as \mathcal {O}(M)
complex multiplications per sub-carrier. Moreover, there are several low-complexity detection algorithms for SIM [53], [54], [55], [56], [57], [58], [59], [60], which may be applicable to our proposed scheme. Specifically, a low-complexity IM detector, exploiting sequential Monte Carlo theory [54], has been shown to produce near-optimal error performance at significantly lower complexity than the optimal detector. Compressed-sensing-based detectors for IM in [56], [57], [58], and [61] were also developed to reduce the complexity. Furthermore, in [55], two low-complexity detectors for IM using local ML-based MMSE and local ordered block-based MMSE principles were presented.
C. Complexity of Turbo-Coded Architecture and Three-Stage Iterative Detection
Assuming that perfect knowledge of channel state information is available, the complexity of our ideal RSC-URC coded architecture and the three-stage demapper/decoder system is expressed as [62] \begin{equation*} C=I_{\text {outer}}\Big (C_{\text {RSC}}+I_{\text {inner}}(C_{\text {Demapper}}+C_{\text {URC}})\Big),\tag{42}\end{equation*}
View Source
\begin{equation*} C=I_{\text {outer}}\Big (C_{\text {RSC}}+I_{\text {inner}}(C_{\text {Demapper}}+C_{\text {URC}})\Big),\tag{42}\end{equation*}
where C_{\text {RSC}}
, C_{\text {URC}}
and C_{\text {Demapper}}
indicate the complexities of the RSC decoder, the URC decoder, and the soft-output demapper respectively, shown in Fig. 15. Note that the turbo-coded architecture and the iterative detection are aimed at numerically demonstrating the maximum achievable limit of the proposed scheme. Thus, we employed ideal parameter assumptions of high interleaver length of 2\times 10^{5}
bits and a total of I_{\text {in}}\times I_{\text {out}}=2\times 40=80
decoding iterations with the near-optimal max-log-MAP algorithm. However, in a realistic scenario, the optimal detector is replaced by a low-complexity symbol detector mentioned above. Also, the convergence may be achieved within 8 to 10 outer iterations. Hence, complexity reduction is possible by fine-tuning the detector parameters based on the requirements of an application.
In this paper, we proposed a novel precoded NOFDM scheme with SIM to harness the combined benefits of NOFDM and SIM aimed at spectral efficiency. With the aid of EVD-based precoding, the detrimental ICI effects induced due to non-orthogonality among subcarriers are removed. Our numerical results for the channel-uncoded scenario demonstrated that the proposed scheme is capable of achieving the ideal BER performance free from ICI while attaining a higher normalized throughput. We also demonstrated that the proposed scheme is strictly bandlimited as compared to the classic OFDM-SIM scheme as a benefit of subcarrier-wise filtering. Our PAPR analysis found no increase in the PAPR of the proposed scheme over that of classic OFDM-SIM. Our detailed investigations on ICI unveiled the tradeoff between the symbol density and the sparsity in the proposed scheme, as well as its overall impact on ICI. Furthermore, the BER of the proposed scheme with near-capacity turbo coding revealed the competitive advantage over the conventional orthogonal counterpart, which is achievable owing to a higher number of subcarriers and a lower modulation order.