You are on page 1of 5

This article has been accepted for publication in a future issue of this journal, but has not been

fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TVT.2020.3035183, IEEE
Transactions on Vehicular Technology

A Tight Upper Bound for Enhanced DCT-OFDM


with Index Modulation
Aijun Cao, Lixia Xiao, Member, IEEE, Pei Xiao, Senior Member, IEEE,
and Chang He, Rahim Tafazolli Senior Member, IEEE

Abstract—Orthogonal frequency division multiplexing (OFD- infrastructure (V2X) [8], [9], as well as 5G and beyond wireless
M) with index modulation (IM) (OFDM-IM), which employs communication scenarios [10].
the activated sub-carrier indices to convey information, exhibits However, the current research on OFDM-IM mainly focus-
higher energy efficiency and lower peak-to-average power ratio
(PAPR) than conventional OFDM systems. To further improve the es on the discret Fourier transform (DFT) based OFDM-IM
throughput of discrete Fourier transform (DFT) based OFDM-IM systems. Inspired by the merits of discrete cosine transform
(DFT-OFDM-IM), discrete cosine transform (DCT) based OFDM- (DCT) based OFDM system, we proposed a novel enhanced
IM (DCT-OFDM-IM) can be employed with double subcarriers DCT-OFDM-IM (EDCT-OFDM-IM) scheme to further exploit
given the same bandwidth. However, one of the main disadvantage the benefits of OFDM-IM and DCT techniques, where the
of DCT-OFDM-IM is its lack of circular convolutional property
over a dispersive channel. To address this issue, an enhanced DFT operation is replaced by the DCT [2]. By contrast to the
DCT-OFDM-IM (EDCT-OFDM-IM) system has been proposed by classic DFT-OFDM-IM scheme, the EDCT-OFDM-IM scheme
introducing symmetric prefix and suffix at the transmitter and a employs the symmetric prefix and suffix at the transmitter,
pre-filter at the receiver leading to better performance than DFT- and prefiltering is used at the receiver to efficiently solve
OFDM-IM in terms of bit error rate (BER). However, due to the circular convolutional problem encountered in the DCT-
its special structure, it is difficult to derive the accurate average
bit error probability (ABEP) upper bound, which is essential for OFDM-IM of [12]. EDCT-OFDM-IM is capable of doubling
the performance evaluation. In this paper, a tight ABEP upper the number of subcarriers compared to OFDM-IM given the
bound is derived using the moment-generating-function (MGF). same bandwidth, resulting in higher spectral efficiency and
Our theoretical analysis is validated by simulation results and better bit error rate (BER) performance. We demonstrated
proven to be very accurate. Consequently the advantages of the the advantages of the EDCT-OFDM-IM scheme in [2] by
EDCT-OFDM-IM system over the classic OFDM-IM system are
further demonstrated analytically. simulations. Although a semi-analytical BER performance has
Index Terms—Discrete Cosine Transform (DCT), Inverse Dis- been studied in [2], it relies on generating randomly channels
crete Cosine Transform (IDCT), Orthogonal Frequency Division using a closed form of Q-function. Due to its special structure,
Multiplexing (OFDM), Index Modulation (IM) , Averaged Bit it is difficult to derive the closed form expression of the pair-
Error Probability (ABEP), Pair-wised Error Probability (PEP) wised error probability (PEP).
To tackle this issue, a tight upper bound of average bit error
I. I NTRODUCTION probability (ABEP) is proposed for EDCT-OFDM-IM using
moment-generating-function (MGF) in this paper. More specif-
Rthogonal frequency division multiplexing with index
O modulation (OFDM-IM), which employs the activated
subcarriers indices as a completed new degree of freedom
ically, the correlation coefficients of the adjacent subcarriers
of the EDCT-OFDM-IM is obtained with the aid of derived
effective channel diagonal matrix, to facilitate the performance
to convey information, is a novel modulation technique and analysis. The proposed theoretical ABEP upper bound is fur-
has attracted increasing attentions. Specifically, in the OFDM- ther validated by the simulation results. Both simulation and
IM scheme, parts of the subcarriers are activated to transmit theoretical results further demonstrate the advantages of the
conventional amplitude phase modulation (APM) symbols, so EDCT-OFDM-IM scheme.
that the information bits are conveyed both by the activated Notation: E [·] calculates the expected value of any random vari-
subcarrier indices as well as APM symbols. Since some sub- able. k·kF denotes the Frobenious norm of a matrix. |·| represents
carriers remain dormant, the OFDM-IM scheme is capable of the magnitude of a complex quantity or the cardinality of a given set.
exhibiting better bit error ratio (BER) as well as lower peak-to- (·)T , (·)∗ and (·)H stand for the transpose, conjugate and Hermitian
average power ratio (PAPR) over its classic OFDM counterpart transpose of a vector/matrix, respectively. The dimension N × N
[1] - [7]. Several works have demonstrated that OFDM-IM is a matrix IN , JN and 0Ω×N , are the identity matrix, reversal matrix and
promising candidate for vehicle-to-vehicle (V2V) or vehicle-to- zero matrix, respectively. (Ω, K, N ) denotes an IM scheme where K
subcarriers are activated within a group of Ω subcarriers, and N is
This work was supported by the U. K. Engineering and Physical Sciences the total number of available subcarriers.
Research Council under Grant EP/ R001588/1, EP/P03456X/1 and by National
Science Foundation of China with Grant number 62001179. The authors also II. S YSTEM MODEL OF EDCT-OFDM-IM
would like to acknowledge the support of the University of Surrey 5GIC
(http://www.surrey.ac.uk/5gic) members for this work. The proposed enhanced DCT-OFDM with index modulation
A. Cao, P. Xiao, C. He and R. Tafazolli are with 5G Innovation Center of (EDCT-OFDM-IM) scheme consists of an inverse DCT (IDCT)
University of Surrey, GU2 7XH UK. module followed by a symmetric prefix and suffix insertion at
L. Xiao is with the Wuhan National Laboratory for Optoelectronics,
Huazhong University of Science and Technology, Wuhan 430074, China. transmitter side, and a corresponding pre-filtering at the front-
end of the receiver side, in order to obtain the circular convolu-

0018-9545 (c) 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Authorized licensed use limited to: University of Missouri Libraries. Downloaded on November 19,2020 at 03:46:25 UTC from IEEE Xplore. Restrictions apply.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TVT.2020.3035183, IEEE
Transactions on Vehicular Technology

v. Therefore, the total block length is L1 = N + 2v and the


transmitted signal vector is represented by
u = TP S DH x, (3)
N ×N
where D ∈ R is a power normalised type-II DCT [11]
matrix with its (l, m) entry given by:
 q
 2
cos( (l−1)(2m−1)π ) l>1
C(l, m) = qN 2N
(4)
1

N
l = 1,
and TP S = [Jv , 0v×(N −v) ; IN ; 0v×(N −v) , Jv ] is the L1 × N
matrix that inserts the prefix and suffix at both sides of a data
symbol block.

B. Receiver
Denote the vector for a L-tap Rayleigh fading channel by
Fig. 1. System model of EDCT-OFDM with index modulation.
h = [h1 , h2 , . . . , hL ]. Its corresponding time-reverse pre-filter
vector is thus in the reverse form as p = [hL , hL−1 , . . . , h1 ].
Correspondingly, the matrix form of the multipath channel
tional property as DFT-OFDM. It not only enables simply one- H ∈ RL1 ×L1 is represented as a Toeplitz matrix with its
tap equalization, but also provides robustness against inherent first row and first column being [hL , hL−1 , . . . , h1 , 01×(L1 −L) ]
inter-channel interference (ICI) and inter-symbol interference and [hL , 01×(L1 −1) ]T respectively, while the matrix form of
(ISI). the pre-filter P ∈ RL1 ×L1 is represented also by a Toeplitz
Moreover, the EDCT-OFDM-IM can further reap the benefits matrix with its first row and column being [hL , 01×(L1 −1) ] and
of the DCT-OFDM and IM techniques, and achieves better [hL , hL−1 , . . . , h1 , 01×(L1 −L) ]T , respectively.
BER performance over its conventional DFT-OFDM-IM coun- Thus, at the receiver side, by performing the time-
terparts [9]. Fig. 1 shows a block diagram of an EDCT-OFDM- reverse pre-filtering and the DCT demultiplexing, the received
IM system. frequency-domain sample vector obtained after guard sequence
removal can be expressed as
A. Transmitter z = DRP S P(Hu + n). (5)
In the EDCT-OFDM-IM system, information bits stream to The guard sequence removal operation is denoted by the matrix
be transmitted is firstly divided into G groups with each group RP S = [0N ×v , IN , 0N ×v ]. n ∈ RL1 ×1 is the additive white
containing B bits. In each group, B bits are further split into Gaussian noise (AWGN) noise vector with its elements subject
P1 and P2 bits for an index selector and an ordinary M -ary to Gaussian distribution with zero mean and variance N0 .
ASK modulator respectively. Index modulator selects K active
subcarriers among Ω subcarriers according to the index selector III. P ERFORMANCE A NALYSIS OF EDCT-OFDM-IM
to accommodate K M -ary modulated symbols. The output of
G index modulators which contains N = G × Ω subcarriers in Recalling the aforementioned one-tap equalization mecha-
total is then fed into an inverse DCT (IDCT) module followed nism, with the introduction of a pre-filter and the symmetric
by the prefix and suffix insertion. guard sequence, the EDCT-OFDM-IM is now applicable for
We denote the output of each index modulator by xg = ICI and ISI free transmission. The selection of TP S and RP S
[x(g,0) , x(g,1) , . . . , x(g,Ω−1) ]T , g = 0, 1, . . . , G − 1, in which diagonalizes the output of DRP S PHTP S DH into an effective
there are Ω − K zeros. Then the data symbol vector fed into diagonal matrix Hef f and Eq. (5) thus can be simplified to
IDCT can be expressed as: z = Hef f x + Gef f n, (6)
X = [X0 , X1 , . . . , XN −1 ] = [xT0 , xT1 , . . . , xTG−1 ]T . (1) where Hef f ∈ R N ×N
is the effective channel diago-
For each group, K out of Ω available subcarriers are activated nal matrix with its elements expressed by diag(Hef f ) =
[H0 , H1 , . . . , HN −1 ], and Gef f = DRP S P represents the
to map p1 = blog2 CΩK c bits into a set of subcarrier indices effective noise correlation matrix. Furthermore we can derive
combinations. On the other hand, p2 = K log2 (M ) bits are the effective channel diagonal matrix with its k-th diagonal
modulated to M -ary ASK data symbols with a set size of elements (i.e., the channel frequency response for the k-th
M , and subsequently transmitted by the K active subcarriers. subcarrier) as follows:
L−1
Accordingly, the total number of bits transmitted per EDCT- P
C(k, m)(h̄m+1 + h̄m ) + C(k, L)h̄L
OFDM-IM block is G · (p1 + p2 ) = GB. After subcarrier IM, m=1
Hk = . (7)
the g-th group signal can be written as C(k, 1)
xg = [0, . . . , s(g,0) , 0, . . . , s(g,1) , 0, . . . , s(g,K−1) , 0, . . .]T , (2) Where h̄m is the m-th element of convolution of [h1 , h2 , ..., hL ]
m
P
where s(g,k) (k = 0, 1, . . . , K − 1) represents the M -ary ASK and [hL , hL−1 , ..., h1 ], i.e., h̄m = hi ∗ hL−m+i . Due to
i=1
constellation point, and xg ∈ Λ, where Λ is the set of all the pre-filtering procedure, the noise vector becomes correlated
possible symbol vector combinations. In general, the symmetric and subject to different kinds of correlation gains. In order to
extended prefix and suffix are assumed to have the same length calculate the effective noise variance for each subcarrier, we

0018-9545 (c) 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Authorized licensed use limited to: University of Missouri Libraries. Downloaded on November 19,2020 at 03:46:25 UTC from IEEE Xplore. Restrictions apply.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TVT.2020.3035183, IEEE
Transactions on Vehicular Technology

take a scalar form of (6), as expressed by signal-to-noise-ratio (SNR). Then the PEP can be rewritten as:
N 2 2
X P (xg → xt |H̃g ) = P (kzg − H̃g xg k ≥ kzg − H̃g xt k )
zk = Hk xk + gk,i ni , (8) (g) 2 (g) 2
i=1 g − He xtk ≥ kHg (xg
= P (kns !−xt )+ng − He xt k (16)
where xk is the transmitted symbol at k-th subcarrier, and zk kHg (xg−xt )k2
≈Q .
and ni are the received observation and AWGN sample at the 2(σ 2 + kxg k2 σe2 )
k-th subcarrier and i-th subcarrier, respectively, whereas gk,i is Assuming that β = kHg (xg − xt )k = Hg AAH (Hg )H and
2
the entry in the k-th row and i-th column of Gef f . A = (xg − xt ), the average PEP event in general can be
As long as the OFDM symbol duration is far less than the obtained by
2
coherence time, gk,i can be treated as a constant noise coef-
!
r
β
R
ficient and the overall coloured noise coefficient on arbitrary P (xg → xt ) = Q fβ (β)dβ . (17)
2(σ 2 + kxg k2 σe2 )
subcarrier index is in the summation of the noise coefficient β

from all subcarriers. Accordingly, the coloured noise variance B. PEP based on accurate Q-function
vk at the k-th subcarrier can be obtained as
N
Before proceeding further, we use another equivalent form
N0 X 2 of Q-function:
vk = gk,i . (9) π
2 i=1 Z2
t2
 
1
With the instantaneous coloured noise variance vk , an opti- exp − dθ . Q(t) = (18)
mum maximum likelihood detector for the g-th group can 2 sin θ2 π
0
be formulated accordingly. Denoting by z+gG = z(g,) , Then Eq. (17) can be rewritten as
H+gG = H(g,) and v+gG = v(g,) , where  is the sub- π
carrier offset to the first subcarrier index within group g, i.e., R2 R  
1
P (xg → xt ) = π exp − 4(σ2 +kxg kβ2 σ2 ) sin θ2 fβ (β)dβ dθ
 ∈ 0, 1, 2, ..., Ω − 1, and g is the group index, 0, 1, ..., G − 1, 0 β e

then the transmit symbols in the g-th group can be estimated π


2
as = π1 Γβ (− 4(σ2 +kxg k12 σ2 ) sin θ2 )dθ ,
R
Ω−1 e
X |z(g,) − H(g,) x(g,) |2 0
(19)
xt = arg min . (10)
es fβ (β)dβ and fβ (β) is the MGF and the
R
xg ∈Λ
=0
v(g,) where Γβ (s) =
β
Eq. (10) can be further simplified:
probability density function (PDF) of β respectively.
Ω−1
X According to [16] [17], the generic MGF is further calculated
xt = arg min wg, |y(g,) − x(g,) |2 , (11) as
xg ∈Λ
=0 −1 H
exp(sH̄g AAH ( I − sCov(Hg )AAH ) (H̄g ) )
where yg, is the output of the one-tap equalizer at subcarrier Γβ (s) = ,
 in the g-th group, and wg, is a weight only related to the |I − sCov(Hg )AAH |
channel: (20)
|Hg, |2 where H̄g = E(Hg ) and Cov(Hg ) = E[Hg (Hg )H ].
wg, = . (12) For Rayleigh channel, the average matrix H̄g = 0, and the
v(g,)
covariance matrix Cov(Hg ) can be obtained by Eq. (29) with
σh2 = 1/L in Appendix, thus Γβ (s) is simplified as:
−1
Γβ (s) = I − sCov(Hg )AAH .

(21)
A. Average bit error probability
Suppose there are Qxg ,xt non-zero values labeled as
With the above clarification, we can obtain the averaged bit {f1 , f2 , ..., fQxg ,xt } in A = (xg − xt ), and the corresponding
error probability (ABEP) of the i-th OFDM symbol. For the positions of these non-zero positions are {e1 , e2 , ..., eQxg ,xt },
sake of simplicity, we drop i in all equations. ABEP of xg then the non-zero eigenvalues of Cov(Hg )AAH are
detected as xt then can be expressed as [13]:
λq,xg ,xt = fq2 × req ,g . (22)
1 X X
Pb,g = P (xg → xt )d(xg , xt ), (13) With the above results, Eq. (21) can be simplified further as
B · 2B
∀xg ∀xt 6=xg
following:
where d(xg , xt ) is the Hamming distance (HD) of xg and −1 YQxg ,xt −1
Γβ (s) = I − sCov(Hg )AAH =

xt , and Hg = [H0+gG , H1+gG , ..., H(Ω−1)+gG ] is the effective (1 − sλq,xg ,xt ) .
q=1
channel coefficients in the g-th group shown in Eq. (7). Hence, (23)
the calculation of the pair-wised error proability (PEP) event
P (xg → xt ) becomes pivotal. Specifically, we first derive Accordingly PEP is calculated as:
π
P (xg → xt |Hg ) as Z2 Y
1 Qxg ,xt λq,xg ,xt
P (xg → xt |Hg ) = P (kzg − Hg xg k2 ≥ kz 2
sg − Hg xt k ) !
P (xg → xt ) = (1 + )−1 dθ .
π q=1 4(σ + kxg k2 σe2 ) sin θ2
2
kHg (xg−xt )k2 0
= P (kngk2 ≥ kHg (xg −xt )+ng k2 ≈ Q . (24)
2σ 2
Substituting (24) in to (13) yields the final expression of the
(14)
average bit error probability as
Furthermore, if considering non-perfect channel estimation at
the receiver, which means the channel estimates used in the 1 X X
Pb,g = d(xg , xt )
demodulation may contain errors shown below: πB · 2B
∀xg ∀xt 6=xg
H̃g = Hg + He(g) (15) π
2 (25)
λq,xg ,xt
Z Y
(g) Qxg ,xt
where ∈
He CN (0, σe2 )
and σe2
corresponds to accuracy of (1 + )−1 dθ .
pragmatic channel estimates, it is inversely proportional to the q=1 4(σ 2 + kxg k2 σe2 ) sin θ2
0

0018-9545 (c) 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Authorized licensed use limited to: University of Missouri Libraries. Downloaded on November 19,2020 at 03:46:25 UTC from IEEE Xplore. Restrictions apply.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TVT.2020.3035183, IEEE
Transactions on Vehicular Technology

C. PEP based on approximated Q-function 10 0


Performance with ( ,K,N) and SE = 1.5 bps/Hz, Uniform 10-tap Rayleigh

It is noteworthy that there may be different approximation to Theory EDCT-OFDM-IM(4,1,256)BPSK Eq.(25)


Theory EDCT-OFDM-IM(4,1,256)BPSK Eq.(28)
the Q(·) function in Eq. (17), e.g., the following approximation Sim. EDCT-OFDM-IM(4,1,256)BPSK
Sim. DFT-OFDM-IM(2,1,128)QPSK
is used in [1]:
1 − x22 1 2x2 10 -1
Q(x) ≈ e + e− 3 . (26)
12 4
Accordingly, the PEP can be reformed as
1 β
P (xg → xt ) = 12 Γβ (− 4(σ2 +kx 2 2 )

BER
10 -2
g k σe )
1 β (27)
+ 4 Γβ (− 4(σ2 +kxg k2 σ2 ) ).
e

The average bit error can be derived accordingly as


1 X X 10 -3
Pb,g = d(xg , xt )
B · 2B
∀xg ∀xt 6=xg

1 1 (28)
Γβ (− ) 10 -4
12 4(σ 2 + kxg k2 σe2 ) 0 5 10 15 20 25 30
 Eb/No (dB)
1 1
+ Γβ (− ) .
4 3(σ 2 + kxg k2 σe2 )
The approximation is valid for all types of channels with their Fig. 2. Simulation Vs analytical performance in the case with ideal channel
estimation.
own MGF applied in the equation.

IV. N UMERICAL RESULTS 10 0


EDCT-OFDM-IM(4,1,256) BPSK spectrum efficiency = 1.5 bps/Hz,

Theory Eq.(25) with channel estimation error

Simulation are conducted in order to compare the simulation Theory Eq.(28) with channel estimation error
Sim. with channel estimation error

results of the EDCT-OFDM-IM system, and the theoretical


analysis with different (Ω,K,N ) configurations and two Q(x) 10 -1

approximations described in this paper. Furthermore, the per-


formance of DFT-OFDM-IM is simulated by assuming the
same spectrum efficiency as that of the EDCT-OFDM-IM
BER

10 -2
system. The detailed simulation setup is shown in Table I Channel estimation error 2
e
=1/SNR

for both EDCT-OFDM-IM and DFT-OFDM-IM. In addition


to simulation setup, we also compare the complexity of these
10 -3
two
TABLE I
S IMULATION SETUP FOR EDCT-OFDM-IM AND DFT-OFDM-IM
10 -4
0 5 10 15 20 25 30
Parameter EDCT-OFDM-IM DFT-OFDM-IM Eb/No (dB)

Spectrum Efficiency(SE) 1.5 bps/Hz


DCT/DFT size (N ) 256 128
Fig. 3. Simulation Vs analytical performance in the case with imperfect
suffix length (v) 16 -
channel estimation.
prefix length (v) 16
channel L-tap Rayleigh
tap number (L) 10
PDP (Power Delay Profile) well. Both validate our analyses conducted shown in this paper.
uniformly distribution
modulation BPSK QPSK
Fig. 4 shows the analytical and simulated performance for a
group size (Ω) 4 2
case with high order modulation. Similar observations can be
active SC number (K) 1 1
ML Rx complexity /symbol 2048RM+1536 RA drawn whereas the gap between the theoretical calculation and
4608RM+3072RA
Notes simulation results is slightly larger than that with lower order
RM: real multiplication; RA: real addition
modulation at the same Eb/No. In addition, given the same
spectrum efficiency, the maximum likelihood receiver for DFT-
Fig. 2 shows the comparative results for systems with ideal OFDM-IM has more than twice amount of real operations tan
channel knowledge under a Rayleigh channel. It can be seen EDCT-OFDM-IM, as shown in Table I.
that EDCT-OFDM-IM is superior to DFT-OFDM-IM with the
same spectrum efficiency. The performance gain is greater V. C ONCLUSION
than 3dB at 1% bit error rate. It can also be observed from The performance of an EDCT-OFDM-IM system was an-
the figure that analytical resutls obtained using Eqs. (25) and alyzed theoretically. First the closed-form expression of the
(28) are quite close and both serve as a very tight upper effective channels was derived by taking into account the
bound to the average BER performance of the EDCT-OFDM- insertion of prefix and suffix and prefiltering, and then its
IM system. The bound becomes even tighter in the high correlation coefficients were obtained and applied in MGF. In
SNR region of practical interest, where it actually provides addition to original analytical expression, we also derived its
a very accurate prediction of the real BER performance. Fig. approximate version. Both have been proven to be very accurate
3 illustrates the corresponding case with imperfect channel upon comparing with the simulation results under uniformly
estimation. The simulation and theory curves are still matched distributed Rayleigh channels, for both low and high order

0018-9545 (c) 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Authorized licensed use limited to: University of Missouri Libraries. Downloaded on November 19,2020 at 03:46:25 UTC from IEEE Xplore. Restrictions apply.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TVT.2020.3035183, IEEE
Transactions on Vehicular Technology

10 1
Comparison. high order modulation, ideal channel knowledge where ξm is the average power of h̄m , i.e., ξm = E{|h̄m |2 },
Theory Eq.(25) EDCT-OFDM-IM(4,1,256) 8ASK
Theory Eq.(28) EDCT-OFDM-IM(4,1,256) 8ASK
m = 1, ..., L.
Sim. EDCT-OFDM-IM(4,1,256) 8ASK
Sim. DFT-OFDM-IM(2,1,128) 64QAM
R EFERENCES
0
10

10 -1

[1] E. Basar, U. Aygolu, E. Panayici and H. V. poor, “Orthogonal frequency


BER

division multiplexing with index modulation,” IEEE Trans. Signal Pro-


10
-2 cess., vol. 61. no. 22, pp. 5536-5549, Nov. 2013.
[2] C. He, A. Cao, L. Xiao, L. Zhang, P. Xiao and K. Nikitopoulos,
“Enhanced DCT-OFDM system with index modulation”, IEEE Trans.
10 -3 Veh. Technol., vol. 68, no. 5, pp. 5134-5138, May 2019.
[3] M. Au, et al, “Joint Code-Frequency Index Modulation for IoT and Multi-
User Communications“, in IEEE J. of Sel. Topics in Signal Processing,
10 -4 vol. 13, no. 6, pp. 1223-1236, Oct. 2019.
0 5 10 15 20 25 30 35
Eb/No (dB) [4] E. Soujeri, et al, “Frequency Index Modulation for Low Complexity Low
Energy Communication Networks“, in IEEE Access, vol. 5, pp. 23276-
23287, 2017.
Fig. 4. Simulated performance Vs theoretic analysis for high order modula-
tion. [5] M. Wen, X. Cheng, M. Ma, B. Jiao, and H. V. Poor, “On the achievable
rate of OFDM with index modulation”, IEEE Trans. Signal Process., vol.
64, no. 8, pp. 1919-1932, Apr. 2016.
modulation schemes. Our theoretical framework provides an [6] Y. Xiao, S. Wang, L. Dan, X. Lei, P. Yang and W. Xiang, “OFDM with
effective means of evaluating the performance of the EDCT- interleaved subcarrier-index modulation”, IEEE Commun. Lett., vol. 18,
no. 8, pp. 1447-1450, Aug. 2014
OFDM-IM system and a very useful tool to guide the practical
[7] T. Jiang, M. Guizani, H. Chen, W. Xiang, and Y. Wu, “Derivation of
design of such a system. For the case with Nakagami-m fading PAPR distribution for OFDM wireless systems based on extreme value
channels, we plan to investigate in our future work. theory”, IEEE Trans. Wireless Commun., vol. 7, no. 4, pp. 1298-1305,
Apr. 2008.
VI. A PPENDIX
[8] M. Wen, X. Cheng, et al., “Index modulated OFDM for underwater
The element ε-th row and the l-th column of the correlation acoustic communications”, IEEE Commun. Mag., vol. 54, no. 4, pp.
(g)
matrix Cov(Hg ), i.e., rε,l is calculated as: 132-137, May 2016.
(g)
rε,l = E[Hε+gΩ (Hl+gΩ )H ] [9] T. Mao, Q. Wang, Z. Wang and S. Chen, “Novel index modulation
techniques: A survey”, IEEE Commun. Surveys Tuts., vol. 21, no. 1, pp.
L−1
P 315-348, First Quart. 2019.
C(ε + gΩ, m)(h̄m+1 + h̄m ) + C(ε + gΩ, L)h̄L
m=1 [10] X. Cheng, M. Zhang, M. Wen, and L. Yang, “Index modulation for 5G:
= E{ × Striving to do more with less”, IEEE Wireless Commun. Mag., vol. 25,
C(ε + gΩ, 1)
L−1
no. 2, pp. 126-132, Apr. 2018
C(l + gΩ, m)(h̄∗m+1 + h̄∗m ) + C(l + gΩ, L)h̄∗L
P
[11] V. Sanchez, P. Garcia, A. M. Peinado, J. C. Segura and A. J. Rubio,
m=1 “Diagonalizing properties of the discrete cosine transforms”, IEEE Trans.
}
C(l + gΩ, 1) on Signal Processing, vol. 43, no. 11, pp. 2631-2641, Nov. 1995.
(29) [12] N. Al-Dhahir H. Minn S. Satish, “Optimum DCT-based multicarrier
And it can be further simplified as: transceivers for frequency-selective channels”, IEEE Trans. on Commun.
L−2
X C(ε + gΩ, m) C(l + gΩ, m) vol. 54, no. 4, pp. 760-760, Apr. 2006.
(g)
rε,l = { ξm+1 [13] L. Xiao, P. Yang, Y. Xiao, S. Fan, M. Renzo, and S. Q. Li, “Efficient
m=1
C(ε + gΩ, 1) C(l + gΩ, 1) compressive sensing detection for generalized spatial modulation”, IEEE
C(ε + gΩ, m) C(l + gΩ, m + 1) Trans. Veh. Technol., vol. 66, no. 2, pp. 1284-1298, Feb. 2017.
+ ξm+1
C(ε + gΩ, 1) C(l + gΩ, 1) [14] G. D. Mandyam, “Sinusoidal transforms in OFDM systems”, IEEE Trans.
Broadcast., vol. 50, no. 2, pp. 172-184, Jun. 2004.
C(ε + gΩ, m + 1) C(l + gΩ, m)
+ ξm+1 [15] W.H Chen, C. Smith and S. Fralick, “A fast computational algorithm for
C(ε + gΩ, 1) C(l + gΩ, 1)
the discrete cosine transform”, IEEE Trans. Commun., vol. 25, no. 9, pp.
C(ε + gΩ, m) C(l + gΩ, m) 1004-1009, Sep. 1977.
+ ξm }
C(ε + gΩ, 1) C(l + gΩ, 1) (30) [16] S. Althunibat, R. Mesleh and E. Basar, “Differential subcarrier index
C(ε + gΩ, L − 1) C(l + gΩ, L − 1) modulation”, IEEE Trans. Veh. Technol., vol. 67, no. 8, pp. 7429-7436,
+ (ξL−1 + ξL ) May 2018.
C(ε + gΩ, 1) C(l + gΩ, 1)
C(ε + gΩ, L − 1) C(l + gΩ, L) [17] G. L. Turin, “The characteristic function of Hermitian quadratic forms
+{ · in complex normal variables”, Biometrika, vol. 47, no. 1/2, pp. 199-201,
C(ε + gΩ, 1) C(l + gΩ, 1) Jun. 1960. [Online]. Available: http://www.jstor.org/stable/2332977.
C(ε + gΩ, L) C(l + gΩ, L − 1)
+ · [18] Robert T. Short, Computation of Rice and probabilities,
C(ε + gΩ, 1) C(l + gΩ, 1) PhaseLocked noncen-trals Technical Report PHS0254,
C(ε + gΩ, L) C(l + gΩ, L) http://www.phaselockedsystems.com/NoncentralChiSquared.pdf.
+ · }ξL
C(ε + gΩ, 1) C(l + gΩ, 1)

0018-9545 (c) 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Authorized licensed use limited to: University of Missouri Libraries. Downloaded on November 19,2020 at 03:46:25 UTC from IEEE Xplore. Restrictions apply.

You might also like