# US 2022/0034994 A1 · Time difference of arrival estimator based on a joint-optimization formulation

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

- Number: US 2022/0034994 A1
- Document ID: US20220034994A1
- Status: Published application
- Kind: A1
- Application number: 16/943,002
- Filed: 2020-07-30
- Published: 2022-02-03
- Earliest claimed: 2020-07-30
- Assignees: BAE Systems Information and Electronic Systems Integration Inc.
- Applicants: BAE SYSTEMS Information and Electronic Systems Integration Inc.
- Inventors: Masoud Farshchian
- Web page: https://patentgrep.com/patent/US20220034994A1

## CPC

- G01S 5/0244: {Accuracy or reliability of position solution or of measurements contributing thereto}
- G01S 5/0205: {Details}
- G01S 5/06: Position of source determined by co-ordinating a plurality of position lines defined by path-difference measurements (G01S5/12 takes precedence)
- G01S 5/22: Position of source determined by co-ordinating a plurality of position lines defined by path-difference measurements (G01S5/28 takes precedence)
- G01S: RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES

## Abstract

Techniques, systems, architectures, and methods for estimating the time difference of arrival (TDOA) based on a joint-optimization formulation, the method comprising providing at least two noisy signals, y1 and y2, where the signals are measured across different antenna elements and where one signal is a delayed amplitude, scaled version of the other signal; and estimating the TDOA using an optimization formulation.

## Claims

### Claim 1

A method of estimating the time difference of arrival based on a joint-optimization formulation, the method comprising:
providing at least two noisy signals, y1 and y2, where the signals are measured across different antenna elements and where one signal is a delayed amplitude, scaled version of the other signal; and
using the following optimization formulation:
F
λ
⁢
{
y
1
,
y
2
}
=
arg
⁢
⁢
min
x
,
τ
,
ϵ
,
K
⁢
{
1
2
⁢
w
1
·

y
1
-
x

2
2
+
1
2
⁢
w
2
⁣
·

y
2
-
x

2
2
+
λ
·
(
φ
⁡
(
Dx
;
a
,
K
)
)
}
solving for x and a using an iterative process.

### Claim 2 (depends on 1)

The method of claim 1, wherein the penalty function is a convex penalty function.

### Claim 3 (depends on 1)

The method of claim 1, wherein the penalty function is a non-convex penalty function.

### Claim 4 (depends on 1)

The method of claim 1, wherein a power of the noisy signals is normalized before solving for x and a.

### Claim 5 (depends on 1)

The method of claim 1, wherein the following cost function is used in the optimization formulation:
φ
⁡
(
x
;
a
)
=
∑
i
=
1
N
⁢
1
a
⁢
(
log
⁡
(
1
+
a
⁢

f
⁡
(
x
i
;
K
)

)
)
.

### Claim 6 (depends on 1)

The method of claim 1, wherein the following cost function is used in the optimization formulation:
φ
⁡
(
x
;
a
)
=
∑
i
=
1
N
⁢
1
a
⁢
(
log
⁡
(
1
+
a
⁢

f
⁡
(
x
i
;
K
)

)
)
and wherein f(xi;K) is chosen to promote over-lapping structure sparsity and is defined as:
f
⁡
(
x
i
;
K
)
=
[
Σ
k
=
0
K
-
1
⁢

x
⁡
(
i
+
k
)

2
]
1
2
.

### Claim 7 (depends on 6)

The method of claim 6, wherein f(xl;K) is further generalized by using weighting functions to weight a sum.

### Claim 8 (depends on 7)

The method of claim 7, wherein the weighting functions are hamming type functions.

### Claim 9 (depends on 1)

The method of claim 1, wherein the following cost function is used in the optimization formulation: φ(x;a)=Σi=1N[Σk=0K−1Vig(x(i+k);a)p]r

### Claim 10 (depends on 1)

The method of claim 1, further comprising defining a mixed norm in the following equation: φG(x)=Σi=1N[Σk=0K−1Vk|x(i+k)|2]1/2.

### Claim 11 (depends on 1)

The method of claim 1, further comprising penalizing φG(Dlx) where Dl is the lth order difference operator.

### Claim 12 (depends on 1)

The method of claim 1 wherein the iterative process comprises:
fixing τ;
solving the optimization formulation for multiple values of τ; and
choosing a vector x such that a cost function of the optimization formulation is minimized.

### Claim 13 (depends on 12)

The method of claim 12 wherein solving the optimization formulation is accomplished using a technique selected from the group consisting of: majorization, proximal methods, and non-linear convex optimization for each fixed τ.

### Claim 14 (depends on 13)

The method of claim 13 further comprising estimating the TDOA of a pulse once x is estimated.

### Claim 15 (depends on 1)

The method of claim 1 further comprising estimating the TDOA of a pulse once x is estimated.

### Claim 16 (depends on 1)

The method of claim 1 wherein estimating x comprises setting w2=0

### Claim 17 (depends on 1)

The method of claim 1 further comprising estimating x(n−τ) by setting w1=0 and, subsequently, estimating a time difference of arrival between the two signals using cross-correlation techniques.
