Scribd
Upload
21 views2 pages

OTFSNoma

Uploaded by

Suvra Sekhar Das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views2 pages

OTFSNoma

Uploaded by

Suvra Sekhar Das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1

NOMA OTFS
Author 1, Author 2 and Author 3

Abstract—Orthogonal time frequency space modulation is a of s(t) in s = [s(0) s(1) · · · s(M N − 1)] and QAM symbols
two dimensional (2D) delay-Doppler domain waveform. It uses di (k, l) are arranged in M × N matrix as,
inverse symplectic Fourier transform (ISFFT) to spread the signal
in time-frequency domain.
 di (0, 0) di (1, 0) ··· di (N − 1, 0) 
 di (0, 1) di (1, 1) ··· di (N − 1, 1) 
Di =  .. .. .. .. 

. . . .

I. I NTRODUCTION di (M − 1, 0) di (M − 1, 1) ··· di (N − 1, M − 1)
We use the following notations throughout the paper. We let (4)
x, X and x represent vectors, matrices and scalars respectively. If di = vec{Di }, transmitted signal can be written as matrix-
The superscripts (.)T and (.)H indicate transpose and conjugate vector multiplication,
transpose operations, respectively. IN and WL represents 2
X p
identity matrix with order N and L-order normalized IDFT s=A ηi Pi di , (5)
matrix respectively. Kronecker product operator is given by i=1
⊗. diag{.} is a diagonal matrix whose diagonal elements where A = WN ⊗ IM is OTFS modulation matrix. Finally,
are formed by the elements of the vector inside. circ{.} a cyclic prefix (CP) of length α0 ≥ α − 1 is appended at the
is a circulant matrix whose first column is given by the starting of the s, where α is channel delay length described
vector inside. E{.} is exception of expression. Column-wise in Sec. II-B.
vectorization of matrix (.) is represented by vec{.}.√d−e is
the ceil operator. N represents natural numbers. j = −1.
B. Channel
II. S YSTEM M ODEL We consider a time varying channels for both users having
Pi paths having hip complex attenuation, τpi delay and νpi
We consider a multi-carrier and multi time-slot system
Doppler value for pi th path where pi ∈ N[1 Pi ]. Delay-
with total Tf duration and B bandwidth. We have total
Doppler channel spreading function for users can be given
M number of sub-carriers having ∆f sub-carrier bandwidth
as,
and N number of symbols having T symbol duration. Total
Pi
bandwidth B = M ∆f and total duration Tf = N T . We X
consider two users in the system namely (1) User 1 and (2) hi (τ, ν) = hip δ(τ − τpi )δ(ν − νpi ), i = 1, 2. (6)
User 2. pi =1

The delay and Doppler values for pi th path is given as τpi =


i
lp ki
A. Transmitter M ∆f and νpi = NpT . We assume that N and M are sufficiently
QAM modulated data symbols, di (k, l) ∈ C, k ∈ N[0 N − large so that there is no effect of fractional delay and Doppler
1], l ∈ N[0 M − 1], are arranged over Doppler-delay lattice on the performance. We also assume the perfect knowledge
Λ = {( NkT , M ∆f
l
)}, where i = 1 and i = 2 denotes the of (hip , lpi , kpi ), pi ∈ N[0 Pi − 1], at the receiver which can
i i
data symbol for User 1 and User 2 respectively. Doppler-delay be estimated by method described in [2]. Let τmax and νmax
domain data di (k, l) is mapped to time-frequency domain data be the maximum delay and Doppler spread for users. Channel
Xi (n, m) on lattice Λ⊥ = {(nT, m∆f )}, n ∈ N[0 N − 1] delay length αi = dτmax i
M ∆f e and channel Doppler length,
i i
and m ∈ N[0 M − 1] by using inverse symplectic fast Fourier β = dνmax N T e.
transform (ISFFT). X(n, m) can be given as [1],
N −1 M −1 C. Receiver
1 X X nk ml
Xi (n, m) = √ di (k, l)ej2π[ N − M ] . (1)
N M k=0 m=0 After removal of CP at the receiver, received signal for users
can be written as [3],
Next, a time-frequency modulator modulates Xi (n, m) to time
domain using Heisenberg transform as, ri = Hi s + ni , i = 1, 2. (7)
where, ni is white Gaussian noise vector of length M N with
PN −1 PM −1 √ √
s(t) = n=0 m=0 ( η1 P1 X1 (n, m)) + ( η2 P2 (2) elemental variance σn2 and Hi is a M N ×M N channel matrix
for ith user and can be given as,
×X2 (n, m))g(t − nT )ej2πm∆f (t−nT ) , (3)
Pi
i i
where, g(t) is transmitter pulse of duration T . Further, s(t)
X
T
Hi = hip Πlp ∆kp , i = 1, 2, (8)
is sampled at the sampling interval of M . We collect samples pi =1
2

with Π = circ{[0 1 0 · · · 0]M N ×1 } is a circulant delay


1 M N −1
matrix and ∆ = diag{1 ej2π M N · · · ej2π M N } is a diagonal
Doppler matrix.
We further process ri through a LMMSE equalizer which
results in estimated data vector,
σ2
d̂i = (Hi A)H [(Hi A)(Hi A)H + ( σn2 )i I]−1 ri , i = 1, 2. (9)
d

III. C ONCLUSION
R EFERENCES
[1] R. Hadani, S. Rakib, M. Tsatsanis, A. Monk, A. J. Goldsmith, A. F.
Molisch, and R. Calderbank, “Orthogonal Time Frequency Space Mod-
ulation,” in 2017 IEEE Wireless Communications and Networking Con-
ference (WCNC), Mar. 2017, pp. 1–6.
[2] P. Raviteja, K. T. Phan, and Y. Hong, “Embedded Pilot-Aided Channel
Estimation for OTFS in DelayDoppler Channels,” IEEE Transactions on
Vehicular Technology, vol. 68, no. 5, pp. 4906–4917, May 2019.
[3] P. Raviteja, Y. Hong, E. Viterbo, and E. Biglieri, “Practical Pulse-Shaping
Waveforms for Reduced-Cyclic-Prefix OTFS,” IEEE Transactions on
Vehicular Technology, pp. 1–1, 2018.

You might also like