# US 2024/0160688 A1 · Stepwise superposition-based fourier transform differential method

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

- Number: US 2024/0160688 A1
- Document ID: US20240160688A1
- Status: Published application
- Kind: A1
- Application number: 17/776,251
- Filed: 2021-09-26
- Published: 2024-05-16
- Earliest claimed: 2021-05-07
- Assignees: Fu Jian Jia Pu Xin Ke Technology Co.Ltd
- Applicants: Fu Jian Jia Pu Xin Ke Technology Co.Ltd
- Inventors: Shuping CHEN
- Web page: https://patentgrep.com/patent/US20240160688A1

## CPC

- G06F 17/141: {Discrete Fourier transforms}
- G01D 1/10: giving differentiated values
- G01D 5/145: {influenced by the relative movement between the Hall device and magnetic fields (see G01R33/06)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G01D: MEASURING NOT SPECIALLY ADAPTED FOR A SPECIFIC VARIABLE; ARRANGEMENTS FOR MEASURING TWO OR MORE VARIABLES NOT COVERED IN A SINGLE OTHER SUBCLASS; TARIFF METERING APPARATUS; MEASURING OR TESTING NOT OTHERWISE PROVIDED FOR

## Abstract

The invention relates to a stepwise superposition-based Fourier transform differentiation method, which comprises the following steps: S1, sampling an analytic signal in a finite time domain, converting the analytic signal into a discrete spectrum, and identifying spectral peak vertexes through a differential curve of the spectrum; S2, superposing the peak vertexes in the spectrum in a stepped manner according to the principle of superposition-based Fourier transform; and S3, differentiating the spectrum after the stepwise superposition to obtain a stepwise superposition-based Fourier transform differential spectrum or image. The invention not only potently improves the resolution and sensitivity, but also greatly saves computing time.

## Claims

### Claim 1

A stepwise superposition-based Fourier transform differential method, comprising:
S1, sampling an analytic signal in a finite time domain, converting the analytic signal into a discrete spectrum, and identifying positions of spectral peak vertexes through a differential curve of the spectrum;
S2, superposing the peak vertexes in the spectrum in a stepped manner according to the principle of superposition-based Fourier transform; and
S3, differentiating the spectrum after the stepwise superposition to obtain a stepwise superposition-based Fourier transform differential spectrum or image.

### Claim 2 (depends on 1)

The stepwise superposition-based Fourier transform differential method according to claim 1, wherein in the Step S1,
the analytic signal s(t) is discretized in a measurement period so as to take N samples, s(0), s(1), s(2), . . . , s(N−1), N frequency spectral data S(0), S(1), S(2), . . . , S(N−1) are obtained by discrete Fourier transform, and the Fourier transform matrix is expressed as follows:
[
S
⁡
(
0
)
S
⁡
(
1
)
S
⁡
(
2
)
⋮
S
⁡
(
N
-
1
)
]
=
[
1
1
1
…
1
1
W
W
2
…
W
N
-
1
1
W
2
W
4
…
W
N
-
2
⋮
⋮
⋮
⋱
⋮
1
W
N
-
1
W
N
-
2
…
W
]
[
s
(
0
s
⁡
(
1
)
s
⁡
(
2
)
⋮
s
⁡
(
N
-
1
)
]
(
1
)
where
⁢
W
=
exp
⁢
(
-
i
⁢
⁢
2
⁢
π
/
N
)
;
the Fourier transform spectrum S(ω) is multiplied by a diagonal matrix diag[ak]:
diag
[
a
k
]
×
[
S
⁡
(
ω
)
]
=
[
0
0
0
…
0
…
0
0
a
1
0
…
0
…
0
0
0
a
2
…
0
…
0
⋮
⋮
⋮
⋱
⋮
…
⋮
0
0
0
…
a
k
…
0
⋮
⋮
⋮
…
⋮
⋱
⋮
0
0
0
…
0
…
a
N
-
1
]
[
S
⁡
(
0
)
S
⁡
(
1
)
S
⁡
(
2
)
⋮
S
⁡
(
k
)
⋮
S
⁡
(
N
-
1
)
]
(
3
)
where if there are m overlapping peaks, the value of the diagonal element ak is 2n, n=4, 1, 2, . . . , m;
a stepwise superposition diagonal matrix is further written as:
diag
[
a
kk
]
=
[
0
⁢
…
⁢
0
⁢
2
ω
1
⁢
…
⁢
2
⁢
4
ω
2
⁢
…
⁢
4
⁢
6
ω
3
⁢
…
⁢
6
⁢
8
ω
4
⁢
…
⁢
8
⁢
0
⁢
…
⁢
0
]
(
4
)
peak vertexes ω1, ω2, and ω4 of the spectrum are located through discrimination of its second derivative.

### Claim 3 (depends on 1)

The stepwise superposition-based Fourier transform differential method according to claim 1, wherein in the Step S2,
it is assumed that there are N overlapping peaks in the spectrum, that is, F1, F2, F3, . . . , FN′, the first peak F1 is located on a zero step, whose peak intensity is multiplied by 2 according to a right superposition function, and the baseline is still the original spectral peak baseline 0; the peak intensity of the second peak F2 is multiplied by 4 to rise to a first step, the third peak F3 is multiplied by 6 to rise to a second step, . . . , the Nth peak FN is multiplied by 2N to rise to a (N−1)th step; when it comes to the last overlapping peak, returning to the zero step is conducted immediately, and then, the spectrum after the stepwise superposition is differentiated, so that the baseline of the superposition spectral line of the second peak returns to the first step after differentiation, which is marked as baseline 1; similarly, the remaining baselines are marked, and the baselines are connected to form a stepwise superposition-based Fourier transform differential spectrum.

### Claim 4 (depends on 1)

The stepwise superposition-based Fourier transform differential method according to claim 1, wherein in the Step S3,
it is assumed that a peak vertex of the kth overlapping peak is located at S(ωk), which becomes 2kS(ωk) after the stepwise superposition, and according to the differential rule of multiplied functions:
Δ
[
2
⁢
k
⁢
S
⁡
(
ω
k
)
]
Δ
⁢
ω
=
Δ
⁡
(
2
⁢
k
)
Δ
⁢
ω
⁢
S
⁡
(
ω
k
)
+
2
⁢
k
⁢
Δ
[
S
⁡
(
ω
k
)
]
Δ
⁢
ω
=
2
⁢
S
⁡
(
ω
k
)
+
2
⁢
k
⁢
Δ
[
S
⁡
(
ω
k
)
]
Δ
⁢
ω
(
5
)
where Δ(2k)/Δω=2k−2(k−1)=2, which is equal to the difference from the previous (k−1)th step; for all the following peak values S(ω) of the same step, 2k is a constant, that is, Δ(2k)=0:
Δ
[
2
⁢
k
⁢
S
⁡
(
ω
)
]
Δ
⁢
ω
=
2
⁢
k
⁢
Δ
[
S
⁡
(
ω
)
]
Δ
⁢
ω
(
6
)
(5) and (6) indicate that all points of the spectrum except the peak vertexes are processed into a spectral background by the differentiation.
