# US 2017/0288931 A1 · Method and Receiver in a Wireless Communication System

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

- Number: US 2017/0288931 A1
- Document ID: US20170288931A1
- Status: Published application
- Kind: A1
- Application number: 15/624,362
- Filed: 2017-06-15
- Published: 2017-10-05
- Earliest claimed: 2014-12-15
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Fredrik Rusek
- Web page: https://patentgrep.com/patent/US20170288931A1

## CPC

- H04L 27/2657: {Carrier synchronisation}
- H04L 27/266: {Fine or fractional frequency offset determination and synchronisation}
- H04L 27/2675: {Pilot or known symbols}
- H04L 27/2684: {Complexity}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A receiver and method applied to the receiver, for estimating a normalized frequency offset value ε between a transmitter and the receiver in a wireless communication system, based on Orthogonal Frequency Division Multiplexing (OFDM), where the method includes receiving a first pilot signal (yr1) and a second pilot signal (yr2), from the transmitter, determining a correlation model to be applied based on correlation among involved sub-carrier channels at the yr1 and the yr2, computing three complex values μ−1, μ0, and μ1, by a complex extension of a log-likelihood function (λ(ε)), based on the determined correlation model, and estimating the ε by finding a maximum value of a Karhunen-Loeve approximation of the λ(ε), based on the computed three complex values μ−1, μ0, and μ1.

## Claims

### Claim 1

A receiver, for estimating a normalised frequency offset value (ε) between a transmitter and the receiver in a wireless communication system, based on Orthogonal Frequency Division Multiplexing (OFDM), the receiver comprising:
a receiving circuit configured to receive a first pilot signal (yr1) and a second pilot signal (yr2) from the transmitter; and
a processor coupled to the receiver circuit and configured to:
determine a correlation model based on correlation among involved sub-carrier channels at the yr1 and the yr2;
compute three complex values (μ−1, μ0, and μ1), by a complex extension of a log-likelihood function (λ(ε)), based on the determined correlation model; and
estimate the ε by finding a maximum value of the λ(ε), based on the computed μ−1, μ0, and μ1.

### Claim 2 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to determine the correlation model based on any of Extended Pedestrian A (EPA), Extended Vehicular A (EVA), Extended Typical Urban (ETU), correlation models when the correlation among involved sub-carrier channels at the yr1 and the yr2 is known.

### Claim 3 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to determine the correlation model by computing QΣ0QH, wherein Q is the Inverse Fast Fourier Transform (IFFT) matrix, wherein Σ0 is
Σ
0
=
[
N
FFT
N
CP
⋱
N
FFT
N
CP
0
⋱
0
]
,
wherein Σ0 a diagonal matrix comprising eigenvalues of a covariance among the sub-carriers at any given OFDM symbol, wherein Ncp is length of a Cyclic Prefix (CP), and wherein NFFT is number of sub-carriers of the yr1, yr2 when the correlation among involved sub-carrier channels at the yr1 and the yr2 is unknown.

### Claim 4 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to approximate the maximum value of the λ(ε) by a Karhunen-Loeve approximation of λ(ε), based on the computed μ−1, μ0, and μ1, wherein μ−1=λc(−1/tΔ), wherein μ0=λc(0), wherein μ1=λc(1/tΔ), wherein t is a distance between the yr1 and yr2, and wherein Δ=(NFFT+Ncp)/NFFT.

### Claim 5 (depends on 4)

The receiver according to claim 4, wherein the processor is further configured to perform the Karhunen-Loeve approximation of λ(ε), and wherein the λ(ε) satisfies the condition λ(ε)=Re(λc(ε)).

### Claim 6 (depends on 4)

The receiver according to claim 4, wherein the processor is further configured to perform the Karhunen-Loeve approximation of λc(ε) given by the equation λc(ε)≈α−1exp(−i2πε(Δt−0.5)+α0exp(−i2πε(Δt)+α1exp(−i2πε(Δt+0.5), wherein the three coefficients are chosen such that μ−1=λc(−1/tΔ), μ0=λc(0), and μ1=λc(1/tΔ) is satisfied, and wherein the Karhunen-Loeve representation of the likelihood function is then taken as λ(ε)≈Re(λc(ε))=Re(α−1exp(−i2πε(Δt−0.5)+α0exp(−i2πε(Δt)+α1exp(−i2πε(Δt+0.5)).

### Claim 7 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to perform a Karhunen-Loeve approximation of λc(ε), wherein the λ(ε) is defined as λ(ε)=−2Re{{tilde over (y)}0(ε)H└(IN0+Σ0(1−α))−1−(IN0+Σ0(1−α))−1┘{tilde over (y)}t(ε)}, wherein at represents a correlation between two OFDM symbols in time, wherein {tilde over (y)}k(ε)=QYk(ε), wherein Q is the Inverse Fast Fourier Transform (IFFT) matrix, and wherein Yk(ε) is the Fast Fourier Transform (FFT) of signal k compensated for the ε.

### Claim 8 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to estimate a maximum value of a Karhunen-Loeve approximation of the λ(ε) by application of an optimisation algorithm such as the Newton-Raphson method.

### Claim 9 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to estimate a maximum value of a Karhunen-Loeve approximation of the λ(ε) by application of an optimisation algorithm such as the Secant method.

### Claim 10 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to estimate a maximum value of a Karhunen-Loeve approximation of the λ(ε) by application of an optimisation algorithm such as the Backtracking line search.

### Claim 11 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to estimate a maximum value of a Karhunen-Loeve approximation of the λ(ε) by application of an optimisation algorithm such as the Nelder-Mead method.

### Claim 12 (depends on 1)

The receiver according to claim 1, wherein the processor is further configured to estimate a maximum value of a Karhunen-Loeve approximation of the λ(ε) by application of an optimisation algorithm such as golden section search.

### Claim 13 (depends on 1)

The receiver according to claim 1, wherein when estimating a maximum value of a Karhunen-Loeve approximation of the λ(ε), the processor is further configured to:
select P values of ε such that ε∈{ε1, ε2, . . . , εP} within [−0.5, 0.5];
compute P values of the Karhunen-Loeve approximation of the λ(ε) at ε∈{ε1, ε2, . . . , εP};
determine the biggest value of the Karhunen-Loeve approximation of the λ(ε) (λmax), as λmax=max λ(εm), wherein 1≦m≦P, and wherein corresponding value of ε denoted εmax; and
utilise the determined λmax and εmax as a starting point in a line search algorithm to find the maximum of the Karhunen-Loeve approximation of the λ(ε).

### Claim 14 (depends on 13)

The receiver according to claim 13, wherein, the processor is further configured to determine that the maximum value of the Karhunen-Loeve approximation of the λ(ε) is within an interval ε
ɛ
∈
2

ɛ
max
-
2
-
P
2

P
,
2

ɛ
max
-
P
2

P
when the λmax and εmax are determined.

### Claim 15 (depends on 14)

The receiver according to claim 14, wherein the processor is further configured to find the maximum value of the Karhunen-Loeve approximation of λ(ε) within the determined interval with M iterations, using an optimisation algorithm such as the Newton-Raphson method.

### Claim 16 (depends on 14)

The receiver according to claim 14, wherein the processor is further configured to find the maximum value of the Karhunen-Loeve approximation of λ(ε) within the determined interval with M iterations, using an optimisation algorithm such as the Secant method.

### Claim 17 (depends on 14)

The receiver according to claim 14, wherein the processor is further configured to find the maximum value of the Karhunen-Loeve approximation of λ(ε) within the determined interval with M iterations, using an optimisation algorithm comprised in a group such as the Backtracking line search, the Nelder-Mead method or golden section search.

### Claim 18 (depends on 1)

The receiver according to claim 1, wherein the receiver is represented by a User Equipment (UE), and wherein the transmitter is represented by a radio network node.

### Claim 19 (depends on 1)

The receiver according to claim 1, wherein the receiver is represented by a radio network node, and wherein the transmitter is represented by a User Equipment (UE).

### Claim 20

A method applied to a receiver, for estimating a normalised frequency offset value (ε) between a transmitter and the receiver in a wireless communication system, based on Orthogonal Frequency Division Multiplexing (OFDM), the method comprising:
receiving a first pilot signal (yr1) and a second pilot signal (yr2), from the transmitter;
determining a correlation model to be applied based on correlation among involved sub-carrier channels at the yr1 and the yr2;
computing three complex values (μ−1, μ0, and μ1), by a complex extension of a log-likelihood function (λ(ε)), based on the determined correlation model; and
estimating the ε by finding a maximum value of a Karhunen-Loeve approximation of the λ(ε), based on the computed μ−1, μ0, and μ1.
