# US 2023/0055481 A1 · Three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor

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

- Number: US 2023/0055481 A1
- Document ID: US20230055481A1
- Status: Published application
- Kind: A1
- Application number: 17/623,607
- Filed: 2021-01-20
- Published: 2023-02-23
- Earliest claimed: 2021-01-18
- Assignees: Zhejiang University
- Applicants: Zhejiang University
- Inventors: Zhiguo SHI; Hang ZHENG; Chengwei ZHOU; Jiming CHEN; Yong WANG
- Web page: https://patentgrep.com/patent/US20230055481A1

## CPC

- G01S 3/143: {by vectorial combination of signals derived from differently oriented antennae}
- G01S 3/74: Multi-channel systems specially adapted for direction-finding, i.e. having a single antenna system capable of giving simultaneous indications of the directions of different signals (systems in which the directions of different signals are determined sequentially and displayed simultaneously G01S3/04, G01S3/14)
- G01S 3/043: {Receivers}
- G01S 3/46: using antennas spaced apart and measuring phase or time difference between signals therefrom, i.e. path-difference systems
- 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

The present disclosure discloses a three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor, mainly solving the problems of multi-dimensional signal structured information loss and Nyquist mismatch in existing methods and comprising the following implementing steps: constructing a three-dimensional co-prime cubic array; carrying out tensor modeling on a receiving signal of the three-dimensional co-prime cubic array; calculating six-dimensional second-order cross-correlation tensor statistics; deducing a three-dimensional virtual uniform cubic array equivalent signal tensor based on cross-correlation tensor dimension merging transformation; constructing a four-dimensional virtual domain signal tensor based on mirror image augmentation of the three-dimensional virtual uniform cubic array; constructing a signal and noise subspace in a Kronecker product form through virtual domain signal tensor decomposition; and acquiring a direction-of-arrival estimation result based on three-dimensional spatial spectrum search.

## Claims

### Claim 1

A three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor, comprising the following steps:
(1) constructing at a receiving end with +−1 physical antenna array elements in accordance with a structure of a three-dimensional co-prime cubic array, wherein and , and , and and are respectively a pair of co-prime integers, and the three-dimensional co-prime cubic array is decomposable into two sparse and uniform cubic subarrays and ;
(2) supposing there are K far-field narrowband non-coherent signal sources from a direction of {(θ1,φ1), . . . , (θK,φK)}, carrying out modeling on a receiving signal of the sparse and uniform cubic subarray of the three-dimensional co-prime cubic array via a four-dimensional tensor ∈×××T (T is a number of sampling snapshots) as follows:
=Σk=1K(μk)∘(νk)∘(ωk)∘sk+,
wherein, sk=[sk,1, sk,2, . . . , sk,T]T is a multi-snapshot sampling signal waveform corresponding to a kth incident signal source, (⋅)T represents a transposition operation, ∘ represents an external product of vectors, ∈×××T is a noise tensor mutually independent from each signal source, (μk), (νk) and (ωk) are steering vectors of the three-dimensional sparse and uniform cubic subarray in an x axis, a y axis and a z axis respectively, and a signal source corresponding to a direction-of-arrival of (θk,φk) is represented as:
a
x
(
ℚ
i
)
(
μ
k
)
=
[
1
,
e
-
j
⁢
π
⁢
x
ℚ
i
(
2
)
⁢
μ
k
,
…
,
e
-
j
⁢
π
⁢
x
ℚ
i
(
M
x
(
ℚ
i
)
)
⁢
μ
k
]
T
,
a
y
(
ℚ
i
)
(
v
k
)
=
[
1
,
e
-
j
⁢
π
⁢
y
ℚ
i
(
2
)
⁢
v
k
,
…
,
e
-
j
⁢
π
⁢
y
ℚ
i
(
M
y
(
ℚ
i
)
)
⁢
v
k
]
T
,
a
z
(
ℚ
i
)
(
ω
k
)
=
[
1
,
e
-
j
⁢
π
⁢
z
ℚ
i
(
2
)
⁢
ω
k
,
…
,
e
-
j
⁢
π
⁢
z
ℚ
i
(
M
z
(
ℚ
i
)
)
⁢
ω
k
]
T
,
wherein, (i1=1,2, . . . , )(i2=1,2, . . . , ) and (i3=1, 2, . . . , ) respectively represent actual locations of in i1th, i2th, and i3th physical antenna array elements in the x axis, the y axis and the z axis, and ===0, μk=sin(φk)cos(θk), νk=sin(φk)sin(θk), ωk=cos(φk), j=√{square root over (−1)};
(3) based on four-dimensional receiving signal tensors and of the two three-dimensional sparse and uniform cubic subarrays and , solving their cross-correlation statistics to obtain a six-dimensional space information-covered second-order cross-correlation tensor
ℛ
ℚ
1
⁢
ℚ
2
∈
ℂ
M
x
(
ℚ
1
)
×
M
y
(
ℚ
1
)
×
M
z
(
ℚ
1
)
×
M
x
(
ℚ
2
)
×
M
y
(
ℚ
2
)
×
M
z
(
ℚ
2
)
:
ℛ
ℚ
1
⁢
ℚ
2
=
E
[
〈
𝒳
ℚ
1
,
𝒳
ℚ
2
*
〉
4
]
=
∑
k
=
1
K
σ
k
2
⁢
a
x
(
ℚ
1
)
(
μ
k
)
∘
a
y
(
ℚ
1
)
(
v
k
)
∘
a
z
(
ℚ
1
)
(
ω
k
)
∘
a
x
(
ℚ
2
)
*
(
μ
k
)
∘
a
y
(
ℚ
2
)
*
(
v
k
)
∘
a
z
(
ℚ
2
)
*
(
ω
k
)
+
𝒩
ℚ
1
⁢
ℚ
2
,
wherein, σk2=E[sksk*] represents a power of a kth incident signal source, =E[<,>4] represents a six-dimensional cross-correlation noise tensor, <⋅,⋅>r represents a tensor contraction operation of two tensors along a rth dimension, E[⋅] represents an operation of taking a mathematic expectation, and (⋅)* represents a conjugate operation; a six-dimensional tensor merely has an element with a value of σn2 in a (1, 1, 1, 1, 1, 1)th location, σn2 representing a noise power, and with a value of 0 in other locations;
(4) as a first dimension and a fourth dimension of the cross-correlation tensor represent space information in a direction of the x axis, a second dimension and a fifth dimension represent space information in a direction of the y axis, and a third dimension and a sixth dimension represent space information in a direction of the z axis, defining dimension sets 1={1,4},2={2,5} and 3={3,6}, and carrying out tensor transformation of dimension merging on the cross-correlation tensor to obtain a virtual domain second-order equivalent signal tensor ∈××:
𝒰
𝕎
=
△
ℛ
ℚ
1
⁢
ℚ
2
{
𝕁
1
,
𝕁
2
,
𝕁
3
}
=
∑
k
=
1
K
σ
k
2
⁢
b
x
(
μ
k
)
∘
b
y
(
v
k
)
∘
b
z
(
ω
k
)
,
wherein, bx(μk)=(μk)⊗(μk), by(νk)=(νk)⊗(νk) and bz(ωk)=(ωk)⊗(ωk) respectively construct augmented virtual arrays in the directions of the x axis, the y axis and the z axis through forming arrays of difference sets on exponential terms, bx(μk) , by(νk) and bz(ωk) are respectively equivalent to steering vectors of the virtual arrays in the x axis, the y axis and the z axis to correspond to signal sources in a direction-of-arrival of (θk,φk), and ⊗ represents a product of Kronecker, so that corresponds to an augmented three-dimensional virtual non-uniform cubic array ; comprises a three-dimensional uniform cubic array with (3−+1)×(3−−1)×−+1) virtual array elements, represented as: ={(x,y,z)|x=pxd,y=pyd,z=pzd,−≤px≤−+2,−≤py≤−+2,−≤pz≤−+2},
The equivalent signal tensor ∈−+1)×(3−+1)×(3−+1) of the three-dimensional uniform cubic array is modeled as: =Σk=1Kσk2bx(μk)∘by(νk)∘bz(ωk),
wherein,
b
_
x
(
μ
k
)
=
[
e
-
j
⁢
π
⁡
(
-
M
x
(
ℚ
1
)
)
⁢
μ
k
,
e
-
j
⁢
π
⁡
(
-
M
x
(
ℚ
1
)
+
1
)
⁢
μ
k
,
…
,
e
-
j
⁢
π
⁡
(
-
M
x
(
ℚ
2
)
+
2
⁢
M
x
(
ℚ
1
)
)
⁢
μ
k
]
T
∈
ℂ
3
⁢
M
x
(
ℚ
1
)
-
M
x
(
ℚ
2
)
+
1
,
b
_
y
(
v
k
)
=
[
e
-
j
⁢
π
⁡
(
-
M
y
(
ℚ
1
)
)
⁢
v
k
,
e
-
j
⁢
π
⁡
(
-
M
y
(
ℚ
1
)
+
1
)
⁢
v
k
,
…
,
e
-
j
⁢
π
⁡
(
-
M
y
(
ℚ
2
)
+
2
⁢
M
y
(
ℚ
1
)
)
⁢
v
k
]
T
∈
ℂ
3
⁢
M
y
(
ℚ
1
)
-
M
y
(
ℚ
2
)
+
1
⁢
and
⁢
b
_
z
(
ω
k
)
=
[
e
-
j
⁢
π
⁡
(
-
M
z
(
ℚ
1
)
)
⁢
ω
k
,
e
-
j
⁢
π
⁡
(
-
M
z
(
ℚ
1
)
+
1
)
⁢
ω
k
,
…
,
e
-
j
⁢
π
⁡
(
-
M
z
(
ℚ
2
)
+
2
⁢
M
z
(
ℚ
1
)
)
⁢
ω
k
]
T
∈
ℂ
3
⁢
M
z
(
ℚ
1
)
-
M
z
(
ℚ
2
)
+
1
represent steering vectors of the three-dimensional virtual uniform cubic array in the x axis, the y axis and the z axis corresponding to signal sources in the direction-of-arrival of (θk, φk);
(5) as a mirror image portion sym, of the three-dimensional virtual uniform cubic array is represented as:
sym={(x,y,z)|x={hacek over (p)}xd,y={hacek over (p)}yd,z={hacek over (p)}zd,−2≤{hacek over (p)}x≤−2≤{hacek over (p)}y≤,−2≤{hacek over (p)}z≤},
carrying out transformation by using the equivalent signal tensor of the three-dimensional virtual uniform cubic array to obtain an equivalent signal tensor sym∈−+1)×(3−+1)×(3−+1) of a three-dimensional mirror image virtual uniform cubic array sym, specifically comprising: carrying out a conjugate operation on the three-dimensional virtual domain signal tensor to obtain , carrying out position reversal on elements in the along directions of three dimensions successively so as to obtain the equivalent signal tensor sym corresponding to the sym ; superposing the equivalent signal tensor of the three-dimensional virtual uniform cubic array and the equivalent signal tensor sym of the mirror image virtual uniform cubic array sym in the fourth dimension to obtain a four-dimensional virtual domain signal tensor ∈−+1)×(3−+1)×(3−+1)×2, modeled as: =Σk=1Kσk2bx(μk)∘by(νk)∘bz(ωk)∘c(μk,νk,ωk), wherein,
c
⁡
(
μ
k
,
v
k
,
ω
k
)
=
[
1
,
e
-
j
⁢
π
⁡
(
(
M
x
(
ℚ
2
)
-
M
x
(
ℚ
1
)
)
⁢
μ
k
+
(
M
y
(
ℚ
2
)
-
M
y
(
ℚ
1
)
)
⁢
v
k
+
(
M
z
(
ℚ
2
)
-
M
z
(
ℚ
1
)
)
⁢
ω
k
)
]
T
is a three-dimensional space mirror image transformation factor vector;
(6) carrying out CANDECOMP/PARACFAC decomposition on the four-dimensional virtual domain signal tensor to obtain factor vectors bx(μk),by(νk), bz(ωk) and c(μk,νk,ωk), k=1,2, . . . , K, corresponding to four-dimensional space information, and constructing a signal subspace Vs∈V×K through a form of their Kronecker products: Vs=orth([bx(μ1)⊗by(ν1)⊗bz(ω1)⊗c(μ1,ν1,ω1), bx(μ2)⊗by(ν2)⊗b(ω2)⊗c(μ2,ν2,ω2), . . . , bx(μK)⊗by(νK)⊗bz(ωK)⊗c(μK,νK,ωK)]),
wherein, orth(⋅) represents a matrix orthogonalization operation, V=2(3−+1)(3−+1)(3−+1); by using Vn∈V×(V−K) to represent a noise subspace, VnVnH is obtained by Vs:
VnVnH=I−VsVsH,
wherein, I represents a unit matrix; (⋅)H represents a conjugate transposition operation; and
(7) traversing a two-dimensional direction-of-arrival of ({tilde over (θ)}, {tilde over (φ)}), calculating corresponding parameters {tilde over (μ)}k=sin({tilde over (θ)}k), {tilde over (ν)}k=sin({tilde over (φ)}k)sin({tilde over (θ)}k) and {tilde over (ω)}k=cos({tilde over (φ)}k), and constructing a steering vector ({tilde over (μ)}k,{tilde over (ν)}k,{tilde over (ω)}k)∈V corresponding to the three-dimensional virtual uniform cubic array , represented as: ({tilde over (μ)}k,{tilde over (ν)}k,{tilde over (ω)}k)=bx({tilde over (μ)}k)⊗by({tilde over (ν)}k) ⊗bz({tilde over (ω)}k)⊗c({tilde over (μ)}k, {tilde over (ν)}k, {tilde over (ω)}k),
wherein, {tilde over (θ)}∈[−90°,π°], {tilde over (φ)}∈[0°,180°],
A three-dimensional spatial spectrum ({tilde over (θ)},{tilde over (φ)}) is calculated as follows:
({tilde over (θ)},{tilde over (φ)})=1/(H({tilde over (μ)}k,{tilde over (ν)}k,{tilde over (ω)}k)(VnVnH)({tilde over (μ)}k,{tilde over (ν)}k,{tilde over (ω)}k)),
Spectral peak search is carried out on the three-dimensional spatial spectrum ({tilde over (θ)},{tilde over (φ)}) to obtain a direction-of-arrival estimation result.

### Claim 2 (depends on 1)

The three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor according to claim 1, wherein the structure of the three-dimensional co-prime cubic array in step (1) is described as: a pair of three-dimensional sparse and uniform cubic subarrays and are constructed in a rectangular coordinate system, wherein comprises ×× antenna array elements, with array element spacings in the directions of the x axis, they axis and the z axis being d, d and d respectively, with locations in the rectangular coordinate system being {(dm1x,dm1y,dm1z), m1x=0,1, . . . , −1, m1y=0,1, . . . , −1, m1z−0,1, . . . , −1}; comprises ×× antenna array elements, with array element spacings in the directions of the x axis, the y axis and the z axis being d, d and d respectively, with locations in the rectangular coordinate system being {(dm2x,dm2y,dm2z), m2x=0,1, . . . , −1, m2y=0,1, . . . , −1, m2z=0,1, . . . , −1}; a unit spacing d has a value half of an incident narrowband signal wavelength) λ, i.e., d=λ/2; subarray combination is carried out on the and in such a way that array elements on the (0, 0, 0) location in the rectangular coordinate system are overlapped so as to obtain a three-dimensional co-prime cubic array actually containing +−1 physical antenna array elements.

### Claim 3 (depends on 1)

The three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor according to claim 1, wherein the second-order cross-correlation tensor statistics of the three-dimensional co-prime cubic array in step (3) are estimated by calculating cross-correlation statistics of T sampling snapshots of the receiving signal tensors (t) and (t) in reality:
ℛ
^
ℚ
1
⁢
ℚ
2
=
1
T
⁢
∑
t
=
1
T
𝒳
ℚ
1
(
t
)
∘
𝒳
ℚ
2
*
(
t
)
.

### Claim 4 (depends on 1)

The three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor according to claim 1, wherein the equivalent signal tensor of the three-dimensional virtual uniform cubic array in step (4) can be obtained by selecting elements in the equivalent signal tensor of the three-dimensional virtual nonuniform cubic array corresponding to locations of virtual array elements in the .

### Claim 5 (depends on 1)

The three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor according to claim 1, wherein in step (6), CANDECOMP/PARAFAC decomposition is carried out on the four-dimensional virtual domain signal tensor to obtain factor matrixes Bx=[bx(μ1), bx(μ2), . . . bx(μK)], By=[by(ν1), by(νz), . . . , by(νK)], Bz=[bz(ω1), bz(ω2), . . . , bz(ωK)] and C=[c(μ1,ν1,ω1), c(μ2,ν2,ω2), . . . , c(μK,νK,ωK)], wherein, CANDECOMP/PARAFAC decomposition of the four-dimensional virtual domain signal tensor follows a uniqueness condition as follows: rank(Bx)+rank(By)+rank(Bz)+rank(C)≥2K+3,
wherein, rank(⋅) represents a Kruskal rank of a matrix, and rank(Bx)=min (3−+1, K), rank(By)=min(3−M−1, K), rank(Bz)=min(3−+1, K), rank(C)=min(2, K), min (⋅) represents an operation of taking a minimum value; when spatial smoothing is not introduced to process the deduced four-dimensional virtual domain signal tensor , a uniqueness inequation of the above CANDECOMP/PARACFAC decomposition is established.

### Claim 6 (depends on 1)

The three-dimensional co-prime cubic array direction-of-arrival estimation method based on a cross-correlation tensor according to claim 1, wherein in step (7), a process of obtaining a direction-of-arrival estimation result by three-dimensional spatial spectrum search specifically comprises: fixing a value of {tilde over (φ)} at 0°, gradually increasing {tilde over (θ)} to 90° from −90° at an interval of 0.1°, increasing the {tilde over (θ)} to 0.1° from 0°, increasing the θ to 90° from −90° at an interval of 0.1° once again, and repeating this process until the {tilde over (φ)} is increased to 180°, calculating a corresponding ({tilde over (θ)},{tilde over (φ)}) in each two-dimensional direction-of-arrival of ({tilde over (θ)},{tilde over (φ)}) so as to construct a three-dimensional spatial spectrum on a two-dimensional direction-of-arrival plane; searching peak values of the three-dimensional spatial spectrum ({tilde over (θ)},{tilde over (φ)}) in the two-dimensional direction-of-arrival plane, permutating response values corresponding to these peak values in a descending order, and taking two-dimensional angle values corresponding to first K spectral peaks as the direction-of-arrival estimation result of a corresponding signal source.
