# US 2022/0182265 A1 · Linear Equalization Method and Device for OTFS Systems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0182265 A1
- Document ID: US20220182265A1
- Status: Published application
- Kind: A1
- Application number: 17/679,911
- Filed: 2022-02-24
- Published: 2022-06-09
- Earliest claimed: 2019-09-02
- Assignees: Beijing University of Posts and Telecommunications
- Applicants: Beijing University of Posts and Telecommunications
- Inventors: Wenjun XU; Tingting ZOU; Hui GAO; Zhisong BIE; Ping ZHANG; Fengyu WANG; Jiaru LIN
- Web page: https://patentgrep.com/patent/US20220182265A1

## CPC

- H04L 25/03878: {Line equalisers; line build-out devices}
- H04L 27/26532: {Demodulators using other transforms, e.g. discrete cosine transforms, Orthogonal Time Frequency and Space [OTFS] or hermetic transforms}
- H04L 25/0242: {using matrix methods}
- H04L 25/03159: {operating in the frequency domain (H04L25/03165, H04L25/03178 take precedence)}
- H04L 25/03343: {Arrangements at the transmitter end}
- H04L 2025/03624: {Zero-forcing}
- H04W 24/02: Arrangements for optimising operational condition
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Disclosed is a low-complexity linear equalization method for an Orthogonal Time Frequency Space (OTFS) system. The method may include: receiving a time domain signal passing through a linear time-varying (LTV) channel; sampling the time domain signal to obtain a sampled signal; demodulating the sampled signal to obtain a demodulated signal; performing a Symplectic Finite Fourier Transform (SFFT) on the demodulated signal to obtain a sampled delay-Doppler domain signal; determining an effective channel matrix in a delay-Doppler domain under a restriction of a rectangular window according to a time domain channel matrix; determining a linear equalization matrix according to the effective channel matrix; and equalizing the sampled delay-Doppler domain signal in a low-complexity way according to the linear equalization matrix. The disclosure also discloses a linear equalization device of an OTFS system for realizing the linear equalization method and a computer-readable storage medium.

## Claims

### Claim 1

A linear equalization method for an Orthogonal Time Frequency Space (OTFS) system implemented by an OTFS receiver, comprising:
receiving a time domain signal passing through a linear time-varying (LTV) channel;
sampling the time domain signal to obtain a sampled signal;
demodulating the sampled signal to obtain a demodulated signal;
performing a Symplectic Finite Fourier Transform (SFFT) on the demodulated signal to obtain a sampled delay-Doppler domain signal;
determining an effective channel matrix in a delay-Doppler domain under a restriction of a rectangular window according to a time domain channel matrix;
determining a linear equalization matrix according to the effective channel matrix; and
equalizing the sampled delay-Doppler domain signal according to the linear equalization matrix.

### Claim 2 (depends on 1)

The linear equalization method of claim 1, wherein, the effective channel matrix Heff is a block circulant matrix composed of N first circulant matrices An.

### Claim 3 (depends on 2)

The linear equalization method of claim 2, wherein, determining an effective channel matrix in a delay-Doppler domain under a restriction of a rectangular window according to a time domain channel matrix comprises:
obtaining a time domain channel sub-matrix {tilde over (H)}p from the time domain channel matrix; wherein, {tilde over (H)}p represents the time domain channel sub-matrix of the time domain channel matrix {tilde over (H)}=diag[, . . . , ] experienced by the pth symbol; {tilde over (H)}=diag[, . . . , ] is a NM×NM block diagonal matrix, which represents the time domain channel matrix when a length of a cyclic prefix is greater than a maximum delay of the LTV channel;
determining each first circulant matrices An based on the time domain channel sub-matrix {tilde over (H)}p; and
determining the effective channel matrix Heff based on the first circulant matrices An.

### Claim 4 (depends on 3)

The linear equalization method of claim 3, wherein, determining each first circulant matrices An based on the time domain channel sub-matrix {tilde over (H)}p comprises:
determining the circulant matrices An according to the following equation:
An=FFTMtx({tilde over (H)}p)
wherein, FFTMtx( ) represents a Fast Fourier Transform operation on a set of matrices.

### Claim 5 (depends on 3)

The linear equalization method of claim 3, wherein, determining the effective channel matrix Heff based on the circulant matrices An comprises:
determining the effective channel matrix Heff according to the following equation:
H
eff
=
(
⁢
A
1
A
2
…
A
N
⁢
­
⁢
1
A
N
A
N
A
1
A
N
-
2
A
N
-
1
⋮
⋱
⋮
A
3
A
4
…
A
1
A
2
A
2
A
3
A
N
A
1
⁢
)
.

### Claim 6 (depends on 2)

The linear equalization method of claim 2, wherein, the linear equalization matrix is a zero-forcing equalization matrix WZF; wherein,
determining the linear equalization matrix according to the effective channel matrix comprises: determining the zero-forcing equalization matrix according to the following expression:
WZF=Heff−1.

### Claim 7 (depends on 2)

The linear equalization method of claim 2, wherein, the linear equalization matrix is a zero-forcing equalization matrix WZF; wherein,
determining the linear equalization matrix according to the effective channel matrix comprises:
for each first circulant matrices An, performing an Inverse Fast Fourier Transform (IFFT) on the first circulant matrices An to obtain a first intermediate matrix St; inverting the first intermediate matrix St to obtain a first inversed intermediate matrix St−1; performing a Fast Fourier Transform (FFT) on the first inversed intermediate matrix St−1 to obtain a second circulant matrix Bq; and
determining the zero-forcing equalization matrix WZF according to the second circulant matrices Bq.

### Claim 8 (depends on 7)

The linear equalization method of claim 7, wherein, performing a Fast Fourier Transform (FFT) on the first inversed intermediate matrix St−1 to obtain a second circulant matrix Bq comprises:
determining the second circulant matrix Bq according to the following equation:
B
q
=
1
N
⁢
F
⁢
F
⁢
T
Mtx
⁡
(
S
t
-
1
)
wherein, FFTMtx( ) represents a Fast Fourier Transform operation on a set of matrices.

### Claim 9 (depends on 7)

The linear equalization method of claim 7, wherein, inverting the first intermediate matrix St to obtain a first inversed intermediate matrix St−1 comprises:
initializing an L matrix as L=IM;
initializing a U matrix as U=0M;
initializing an intermediate variable matrix as Y=0M;
initializing an auxiliary vector as d=[dchan,M−DP]; wherein, dchan=[D1,D2,D3, . . . ,DP] is a vector representing delays of the LTV channel; P represents a number of paths of the LTV channel; D1, D2, D3, . . . , DP represents a coordinate value of a delay of each path on a delay axis in the delay-Doppler domain;
determining a first M−DP columns of the L matrix according to L(i+DP,i)=St(i+DP,i)/St(i,i); where, L(i+DP, i) represents an element at a position of row i+DP and column i in the L matrix; and i is a first cyclic variable, where i=1: M−DP;
determining a first M−DP rows of the U matrix according to U(ξ,:)=St(ξ,:)−Σk=nΣj=1ML(ξ,ξ−Dk)U(ξ−Dk,j); where, U(ξ, :) represents row ξ of the U matrix; St(ξ, :)) represents row ξ of the first intermediate matrix St; the vector ξ increases from Dp+1 to Dp+1 one by one; and p is a second cyclic variable, where p=1: P+1;
determining a last DP columns of the L matrix through an LU decomposition method;
determining a last DP rows of the U matrix through the LU decomposition method;
obtaining the first inversed intermediate matrix St−1 according to the L matrix and the U matrix.

### Claim 10 (depends on 9)

The linear equalization method of claim 9, wherein, obtaining the first inversed intermediate matrix St−1 according to the L matrix and the U matrix comprises:
setting a third cyclic variable n increasing from 1 to P one by one;
in loop n, setting a vector k increasing from d(n)+1 to d(n+1) one by one;
wherein, d(n) represents a nth element in the vector d(n); d(n+1) represents a n+1th element in the vector d(n);
calculating the row k of the intermediate variable matrix Y according to the following expression Y(k,:)=I(k,:)−Σi=1nL(k,k−d(i)Y(k−d(i),:);
setting a fourth cyclic variable k increasing from DP+1 to M one by one;
in loop k, calculating row k of the intermediate variable matrix Y according to Y(k,:)=I(k,:)−L(k,1:k−1)Y(1:k−1,:);
setting a fifth cyclic variable t decreasing from N to 1 one by one;
in loop t, setting a variable f represents a bigger one between M−DP and k+1;
obtain row t of the inversed matrix St−1 through
S
t
-
1
⁡
(
t
,
;
)
=
Y
⁡
(
t
,
:
)
-
U
⁡
(
t
,
f
:
M
)
⁢
X
⁡
(
f
:
M
,
:
)
U
⁡
(
t
,
t
)
.

### Claim 11 (depends on 2)

The linear equalization method of claim 2, wherein, the linear equalization matrix is a Minimum Mean Square Error (MMSE) equalization matrix WMMSE; wherein,
determining the linear equalization matrix according to the effective channel matrix comprises:
determining a second intermediate matrix R according to the effective channel matrix and a transpose matrix of the effective channel matrix and a variance of channel noises;
inverting the second intermediate matrix R to obtain a second inverted intermediate matrix R−1; and
multiplying the second inverted intermediate matrix R−1 by the transpose matrix of the effective channel matrix to obtain the equalization matrix of the MMSE equalization WMMSE.

### Claim 12 (depends on 11)

The linear equalization method of claim 11, wherein, determining a second intermediate matrix R according to the effective channel matrix and a transpose matrix of the effective channel matrix and a variance of channel noises comprises:
determining the second intermediate matrix R according to the following expression:
R=HeffHHeff+σ2I
wherein, HeffH represents the conjugate transpose matrix of the effective channel matrix Heff; σ2 represents the variance of channel noises; and I represents an identity matrix with a same dimension with the effective channel matrix Heff.

### Claim 13 (depends on 11)

The linear equalization method of claim 11, wherein, determining a second intermediate matrix R according to the effective channel matrix and a transpose matrix of the effective channel matrix and a variance of channel noises comprises:
determining the second intermediate matrix R according to the following expression:
R
=
[
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
⁢
]
N
+
σ
2
⁢
I
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
+
1
⁢
]
N
…
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
+
N
-
1
⁢
]
N
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
+
N
-
1
⁢
]
N
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
⁢
]
N
+
σ
2
⁢
I
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
+
N
-
2
⁢
]
N
⋮
⋱
⋮
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
+
1
⁢
]
N
+
σ
2
⁢
I
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
+
2
⁢
]
N
+
σ
2
⁢
I
…
∑
n
=
1
N
⁢
A
n
H
⁢
A
[
n
⁢
]
N
+
σ
2
⁢
I
]
wherein, [⋅]N represent a modulo operation; [N]N=N.

### Claim 14 (depends on 11)

The linear equalization method of claim 11, wherein, inverting the second intermediate matrix R to obtain a second inverted intermediate matrix R−1 comprises:
initializing an L matrix as L=IM;
initializing a U matrix as U=0M;
initializing an intermediate variable matrix as Y=0M;
initializing an auxiliary vector as d=[dchan,M−DP]; wherein, dchan=[D1,D2,D3, . . . ,DP] is a vector representing delays of the LTV channel; P represents a number of paths of the LTV channel; D1, D2, D3, . . . , DP represents a coordinate value of a delay of each path on a delay axis in the delay-Doppler domain;
determining a first M−DP columns of the L matrix according to L(i+DP,i)=M(i+DP,i)/M(i,i); where, L(i+DP, i) represents an element at a position of row i+DP and column i in the L matrix; and i is a first cyclic variable, where i=1: M−DP;
determining a first M−DP rows of the U matrix according to U(ξ,:)=M(ξ:)−Σk=2nτj=1ML(ξ,ξ−Dk)U(ξ−Dk,j); where, U(ξ,:) represents row of the U matrix; St(ξ, :) represents row of the first intermediate matrix M; the vector increases from Dp+1 to Dp+1 one by one; and p is a second cyclic variable, where p=1: P+1;
determining a last DP columns of the L matrix through an LU decomposition method;
determining a last DP rows of the U matrix through the LU decomposition method;
obtaining the second inversed intermediate matrix R−1 according to the L matrix and the U matrix.

### Claim 15 (depends on 14)

The linear equalization method of claim 14, wherein, obtaining the second inversed intermediate matrix R−1 according to the L matrix and the U matrix comprises:
setting a third cyclic variable n increasing from 1 to P one by one;
in loop n, setting a vector k increasing from d(n)+1 to d(n+1) one by one;
wherein, d(n) represents a nth element in the vector d; d(n+1) represents a n+1th element in the vector d;
calculating the row k of the intermediate variable matrix Y according to the following expression Y(k,:)=I(k,:)−L(k,k−d(i))Y(k−d(i),:);
setting a fourth cyclic variable k increasing from Dp+1 to M one by one;
in loop k, calculating row k of the intermediate variable matrix Y according to Y(k,:)=I(k,:)−L(k,1:k−1)Y(1:k−1,:);
setting a fifth cyclic variable t decreasing from N to 1 one by one;
in loop t, setting a variable f represents a bigger one between M−DP and k+1;
obtain row t of the inversed matrix R−1 through
R
-
1
⁡
(
t
,
;
)
=
Y
⁡
(
t
,
:
)
-
U
⁡
(
t
,
f
:
M
)
⁢
X
⁡
(
f
:
M
,
:
)
U
⁡
(
t
,
t
)
.

### Claim 16 (depends on 1)

An electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the linear equalization method of claim 1.

### Claim 17 (depends on 1)

A non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions being used to make a computer execute the linear equalization method of claim 1.
