# US 2025/0383384 A1 · Method for applying a discrete fourier transform, dft, to a sequence of samples of a sensor signal, processor circuit for performing the method, radar sensor and motor vehicle

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

- Number: US 2025/0383384 A1
- Document ID: US20250383384A1
- Status: Published application
- Kind: A1
- Application number: 19/241,647
- Filed: 2025-06-18
- Published: 2025-12-18
- Earliest claimed: 2024-06-18
- Assignees: Continental Automotive Technologies GmbH
- Applicants: Continental Automotive Technologies GmbH
- Inventors: Mario Schuehler; Burak Sahinbas; Lars Weisgerber; Thomas Kötter
- Web page: https://patentgrep.com/patent/US20250383384A1

## CPC

- G01R 23/16: Spectrum analysis; Fourier analysis
- B60W 30/09: Taking automatic action to avoid collision, e.g. braking and steering
- B60W 30/0956: {the prediction being responsive to traffic or environmental parameters}
- B60W 50/00: Details of control systems for road vehicle drive control not related to the control of a particular sub-unit {, e.g. process diagnostic or vehicle driver interfaces}
- G01S 7/356: {involving particularities of FFT processing}
- G01S 13/04: Systems determining presence of a target (based on relative movement of target G01S13/56)
- G01S 13/931: of land vehicles
- B60W 2050/0012: {Feedforward or open loop systems}
- B60W 2050/0052: {Filtering, filters}
- B60W 2420/408: Radar; Laser, e.g. lidar
- G01R: MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES (indicating correct tuning of resonant circuits H03J3/12)
- B60W: CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION; CONTROL SYSTEMS SPECIALLY ADAPTED FOR HYBRID VEHICLES; ROAD VEHICLE DRIVE CONTROL SYSTEMS FOR PURPOSES NOT RELATED TO THE CONTROL OF A PARTICULAR SUB-UNIT
- 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

A method for applying a Discrete Fourier Transform (“DFT”) to a sequence of N samples of a sensor signal, with N>2. The resulting DFT spectral coefficients are updated iteratively whenever a new one of the samples or a sub-group of consecutive new samples, comprising a predefined number J of samples, with 1<J<N, is received.

## Claims

### Claim 1

A method for applying a P-dimensional discrete Fourier transform (“DFT”) to a sequence of N samples of a sensor signal, with P, N>2, comprising:
receiving one of the samples at a time at a processor circuit; and
performing the following in response to receiving a new one of the samples or a group of consecutive new samples, comprising a predefined number J of samples, with 1<J<N
providing, for each new sample xn, an order index n indicating which one of the 1 to N samples has been received, wherein n in 1, . . . , N,
proving, for each new sample, a corresponding DFT vector {right arrow over (d)}(n), wherein the DFT vector {right arrow over (d)}(n) is selected or generated depending on the order index n of the sample, wherein the DFT vector {right arrow over (d)}(n) comprises P phasor values that are derived from frequency points fp of the P-dimensional DFT by S*exp(−i 2 π fp tn) with p in 1, . . . , P the index of the phasor value in the DFT vector {right arrow over (d)}(n) and S a scaling factor and tn the sampling time of the new sample xn and i the imaginary unit with i2=−1;
applying the respective new sample xn as a multiplication factor to its corresponding DFT vector {right arrow over (d)}(n) for generating a respective spectral contribution vector Δ{right arrow over (y)}(n)={right arrow over (d)}(n) xn;
adding the respective spectral contribution vector Δ{right arrow over (y)}(n) to an accumulation vector {right arrow over (y)}(n)=Δ{right arrow over (y)}(n)+{right arrow over (y)}(n-1),
when for all N samples their corresponding resulting contribution vector has been added to the accumulation vector, providing the accumulation vector {right arrow over (y)}(N) as DFT spectral coefficients of the N samples.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising deleting the respective new sample when the corresponding contribution vector for that sample is calculated and deleting the respective contribution vector after adding it to the accumulation vector, such that at no point in time all N samples xn, with n in 1, . . . , N, nor their resulting contribution vector Δ{right arrow over (y)}(n) are stored together in the processor circuit.

### Claim 3 (depends on 1)

The method according to claim 1, further comprising:
generating at least some or all of the samples at sampling times with constant sampling period t0, resulting in tn=tn-1+t0 for n in 2, . . . N and t1 an initial time value, in particular t1=0; and
generating the respective DFT vector {right arrow over (d)}(n) for the respective sample xn of order index n using a P-dimensional base DFT vector {right arrow over (d)}(0) and the DFT vector {right arrow over (d)}(n-1) by applying an element-wise multiplication {right arrow over (d)}(n)=diag{{right arrow over (d)}(0)}{right arrow over (d)}(n-1), if n>1 and diag{⋅} the diagonal matrix, wherein {right arrow over (d)}(0) comprises phasor elements exp(−i 2 π fp t0) with p in 1, . . . , P.

### Claim 4 (depends on 1)

The method according to claim 1, further comprising:
generating at least some or all of the samples at non-equidistant sampling times tn;
providing a rasterized time pattern by defining a minimum time step width {circumflex over (t)}0; and
generating the respective DFT vector {right arrow over (d)}(n) for the respective sample of order index n using a P-dimensional base DFT vector {right arrow over ({circumflex over (d)})}(0) and the DFT vector {right arrow over (d)}(n-1) by applying a element-wise multiplication, wherein {right arrow over ({circumflex over (d)})}(0) comprises phasor elements exp(−i 2 π fp {circumflex over (t)}0) with p in 1, . . . , P and a time difference tn−tn-1 of sampling time of the last sample xn and the preceding sample xn-1 is expressed as the integer multiple or the next larger integer multiple or the next smaller integer multiple
μ
=
[
t
n
-
t
n
-
1
t
^
0
]
of {circumflex over (t)}0, with [⋅] the rounding operator, such that {right arrow over (d)}(n)=diag{{right arrow over ({circumflex over (d)})}(0)}μ {right arrow over (d)}(n-1).

### Claim 5 (depends on 1)

The method according to claim 1, further comprising:
generating at least some or all of the samples at non-equidistant sampling times tn; and
keeping stored M>1 pre-calculated vectors diag{{right arrow over ({circumflex over (d)})}(m)} for different time values {{circumflex over (t)}1, . . . , {circumflex over (t)}M} are kept stored in memory as {right arrow over ({circumflex over (d)})}(m), m=1 . . . M, with phasor elements exp(−i 2 π fp {circumflex over (t)}m), p=1, . . . , P, and for a given sample xn at sampling time tn the vector for index m=arg min|{tn−tn-1−{circumflex over (t)}m}| with the closest time-difference is applied by element-wise multiplication to the preceding DFT vector for providing the DFT vector {right arrow over (d)}(n)=diag{{right arrow over ({circumflex over (d)})}(m)}{right arrow over (d)}(n-1) for n>1.

### Claim 6 (depends on 1)

The method according to claim 1, further comprising receiving the new sample xn from a first channel τ1 giving a new first-channel sample x(tn, τ1) and receiving together with this new first-channel sample at least one further new sample x(tn, τc) for at least one further channel c, such that overall a respective new sample of C channels are received and transforming the new samples x(tn, τc), c=1, . . . , C, together for each channel, c=1, . . . , C.

### Claim 7 (depends on 1)

The method according to claim 1, further comprising:
generating at least some or all of the samples at non-equidistant sampling times tn; and
providing for M>1 a set of possible time step widths
{
t
ˆ
1
,
…
,
t
ˆ
M
}
and for sample xn it is taken that time step {circumflex over (t)}m that is closest to the time difference tn−tn-1 of two consecutive samples
d
→
(
n
)
=
diag
⁢
{
d
→
^
(
m
)
}
⁢
d
→
(
n
-
1
)
⁢
for
⁢
n
>
1
⁢
and
⁢
m
=
1
,
…
,
M
with
d
→
^
(
m
)
=
(
exp
⁡
(
-
i
⁢
2
⁢
π
⁢
f
1
⁢
t
^
m
)
exp
(
-
i
⁢
2
⁢
π
⁢
f
2
⁢
t
^
m
⋮
exp
⁡
(
-
i
⁢
2
⁢
π
⁢
f
P
⁢
t
^
m
)
)
⁢
and
m
=
arg
⁢
min
⁢
❘
"\[LeftBracketingBar]"
{
t
n
-
t
n
-
1
-
t
^
m
}
❘
"\[RightBracketingBar]"
.

### Claim 8 (depends on 1)

The method according to claim 1, further comprising:
generating at least some or all of the samples at non-equidistant sampling times tn; and
successively approximating the respective time difference tn−tn-1 of two consecutive samples xn-1 and xn, wherein for a maximum time difference max {tn−tn-1}=Δ{circumflex over (t)} for the respective order index n and a time difference resolution of M bits, a minimum time step becomes
Δ
⁢
t
^
2
M
and for given time difference tn−tn-1≤Δ{circumflex over (t)}, a combination of predefined time steps is obtained in that the time difference between the current and the previous sample is Δtn=tn−tn-1 and Δtn is quantised with M bits, wherein m=1 represents the most significant bit and m=M the least significant bit, wherein
the approximations starts with a time difference of Δτ1=Δtn,
the quantisation level is defined by
T
m
=
Δ
⁢
t
ˆ
2
m
,
for m=1, it becomes
T
1
=
Δ
⁢
t
^
2
,
and
the m-th bit follows from
w
m
=
⌊
Δ
⁢
τ
m
T
m
⌋
with
Δ
⁢
τ
m
=
Δ
⁢
τ
m
-
1
-
w
m
-
1
⁢
T
m
-
1
⁢
for
⁢
m
>
1
Δ
⁢
τ
m
=
Δ
⁢
t
n
⁢
for
⁢
m
=
1
the quantised time difference. └⋅┘ denotes the floor operator and for m=1,
w
1
=
⌊
Δ
⁢
t
n
T
1
⌋
.
with all bits computed, the binary word is represented by vector
w
→
=
(
w
1
w
2
⋯
w
M
)
T
with wm∈{0,1} for m=1, . . . , M
and for a set of possible step widths following from Tm
{
t
ˆ
1
,
…
,
t
ˆ
M
}
=
{
T
1
,
T
2
,
…
,
T
M
}
the quantised time difference is calculated as
Δ
⁢
τ
=
(
T
1
T
2
⋯
T
M
)
⁢
w
→
=
∑
m
=
1
M
w
m
⁢
T
m
,
which is mapped to the sub-set of predefined DFT vectors (37) needed to obtain the DFT vector {right arrow over (d)}(n) for the current time instant tn:
d
→
(
n
)
=
∏
w
m
diag
⁢
{
w
m
⁢
d
→
^
(
m
)
}
⁢
d
→
(
n
-
1
)
⁢
for
⁢
w
m
=
1
⁢
and
⁢
m
=
1
,
…
,
M
,
wherein only those predefined vectors {right arrow over ({circumflex over (d)})}(m) are selected for which wm=1.

### Claim 9 (depends on 1)

The method according to claim 1, further comprising providing the DFT as a IIR filter-bank implementation of the sample-wise DFT.

### Claim 10 (depends on 1)

The method according to claim 1, further comprising:
providing the radar signal by a radar sensor; and
providing, by the processor circuit, the DFT spectral coefficients to a assistance system that controls driving motions of a vehicle and that detects at least one object in an environment of the vehicle based on the DFT spectral coefficients.

### Claim 11

A processor circuit for applying a P-dimensional discrete Fourier transform (“DFT”) to a sequence of N samples of a sensor signal, with P, N>2, and configured to:
receive one of the samples at a time; and
perform the following in response to receiving a new one of the samples or a group of consecutive new samples, comprising a predefined number J of samples, with 1<J<N
provide, for each new sample xn, an order index n indicating which one of the 1 to N samples has been received, wherein n in 1, . . . , N,
prove, for each new sample, a corresponding DFT vector {right arrow over (d)}(n), wherein the DFT vector {right arrow over (d)}(n) is selected or generated depending on the order index n of the sample, wherein the DFT vector {right arrow over (d)}(n) comprises P phasor values that are derived from frequency points fp of the P-dimensional DFT by S*exp(−i 2 π fp tn) with p in 1, . . . , P the index of the phasor value in the DFT vector {right arrow over (d)}(n) and S a scaling factor and tn the sampling time of the new sample xn and i the imaginary unit with i2=−1;
apply the respective new sample xn as a multiplication factor to its corresponding DFT vector {right arrow over (d)}(n) for generating a respective spectral contribution vector Δ{right arrow over (y)}(n)={right arrow over (d)}(n)xn; and
add the respective spectral contribution vector Δ{right arrow over (y)}(n) to an accumulation vector {right arrow over (y)}(n)=Δ{right arrow over (y)}(n)+{right arrow over (y)}(n-1),
when for all N samples their corresponding resulting contribution vector has been added to the accumulation vector, provide the accumulation vector {right arrow over (y)}(N) as DFT spectral coefficients of the N samples.

### Claim 12

A RADAR device, comprising:
a sensor for generating a sensor signal; and
a processor circuit for applying a P-dimensional discrete Fourier transform (“DFT”) to a sequence of N samples of the sensor signal, with P, N>2, and configured to
receive one of the samples at a time, and
perform the following in response to receiving a new one of the samples or a group of consecutive new samples, comprising a predefined number J of samples, with 1<J<N
provide, for each new sample xn, an order index n indicating which one of the 1 to N samples has been received, wherein n in 1, . . . , N,
prove, for each new sample, a corresponding DFT vector {right arrow over (d)}(n), wherein the DFT vector {right arrow over (d)}(n) is selected or generated depending on the order index n of the sample, wherein the DFT vector {right arrow over (d)}(n) comprises P phasor values that are derived from frequency points fp of the P-dimensional DFT by S*exp(−i 2 π fp tn) with p in 1, . . . , P the index of the phasor value in the DFT vector {right arrow over (d)}(n) and S a scaling factor and tn the sampling time of the new sample xn and i the imaginary unit with i2=−1;
apply the respective new sample xn as a multiplication factor to its corresponding DFT vector {right arrow over (d)}(n) for generating a respective spectral contribution vector Δ{right arrow over (y)}(n)={right arrow over (d)}(n) xn; and
add the respective spectral contribution vector Δ{right arrow over (y)}(n) to an accumulation vector {right arrow over (y)}(n)=Δ{right arrow over (y)}(n)+{right arrow over (y)}(n-1),
when for all N samples their corresponding resulting contribution vector has been added to the accumulation vector, provide the accumulation vector {right arrow over (y)}(N) as DFT spectral coefficients of the N samples.
