# US 11,909,571 B2 · Signal processing method and apparatus

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

- Number: US 11,909,571 B2
- Document ID: US11909571B2
- Status: Granted
- Kind: B2
- Application number: 17/696,444
- Filed: 2022-03-16
- Published: 2022-07-14
- Granted: 2024-02-20
- Earliest claimed: 2019-01-10
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Bingyu Qu; Xianda Liu; Mingxin Gong; Kunpeng Liu
- Web page: https://patentgrep.com/patent/US11909571B2

## CPC

- H04L 27/261: {Details of reference signals}
- H04L 5/0005: {Time-frequency}
- H04L 5/0007: {the frequencies being orthogonal, e.g. OFDM(A) or DMT}
- H04L 5/0048: {Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091)}
- H04L 5/0051: {of dedicated pilots, i.e. pilots destined for a single user or terminal}
- H04L 25/0204: {of multiple channels}
- H04L 25/0226: {sounding signals per se}
- H04L 25/0228: {with direct estimation from sounding signals}
- H04L 27/18: Phase-modulated carrier systems, i.e. using phase-shift keying (H04L27/32 takes precedence)
- H04L 27/20: Modulator circuits; Transmitter circuits
- H04L 27/26025: {Numerology, i.e. varying one or more of symbol duration, subcarrier spacing, Fourier transform size, sampling rate or down-clocking (allocating sub-channels of the transmission path H04L5/003)}
- H04L 27/26134: {Pilot insertion in the transmitter chain, e.g. pilot overlapping with data, insertion in time or frequency domain}
- H04L 27/2636: {with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]}
- H04L 27/262: {Reduction thereof by selection of pilot symbols}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present disclosure relates to signal processing methods and apparatus. One example method includes determining a first sequence {x(n)} based on a preset condition, generating a reference signal of a first signal by using the first sequence, and sending the reference signal on a first frequency-domain resource. The preset condition is y n = A · e j × π × s n 8 , x n = A · e j × π × s n 8 , a length of the first sequence is K=6, n=0, 1, . . . , K−1, A is a non-zero complex number, and j=√{square root over (−1)}. The first signal is a signal modulated by using π/2 binary phase shift keying (BPSK). The first frequency-domain resource comprises K subcarriers each having a subcarrier number of k, k=u+L*n+delta, L is an integer greater than or equal to 2, delta∈{0, 1, . . . , L−1}, u is an integer, and subcarrier numbers of the K subcarriers are numbered in ascending or descending order of frequencies.

## Claims

### Claim 1

A signal processing method, comprising:
determining a first sequence {x(n)} based on a preset condition, wherein the preset condition is
x
n
=
A
·
e
j
×
π
×
s
n
8
,
wherein a length of the first sequence is K=6, A is a non-zero complex number, and j=√{square root over (−1)}, and wherein a sequence {s(n)} is {7, 5, −1, −7, −3, 1};
generating a reference signal of a first signal, wherein the first signal is a signal modulated by using π/2 binary phase shift keying (BPSK), and the reference signal is generated by using the first sequence; and
sending the reference signal on a first frequency-domain resource, wherein the first frequency-domain resource comprises K subcarriers each having a subcarrier number of k, and
k=u+L×n+delta,
wherein L is an integer greater than or equal to 2, delta∈{0, 1, . . . , L−1}, u is an integer, and subcarrier numbers of the K subcarriers are numbered in ascending or descending order of frequencies.

### Claim 2 (depends on 1)

The method according to claim 1, wherein a modulation scheme of the first sequence is neither BPSK modulation nor π/2 BPSK modulation.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the first sequence is a sequence modulated by using any one of 8 PSK, 16 PSK, or 32 PSK.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the method further comprises:
determining the first sequence in a first sequence group, wherein the first sequence group is one of a plurality of sequence groups, and wherein the first sequence is determined, based on a value of the delta, in a plurality of sequences that are in the first sequence group and whose length is K.

### Claim 5 (depends on 4)

The method according to claim 4, wherein the method further comprises:
determining the first sequence group based on a cell identifier or a sequence group identifier.

### Claim 6 (depends on 4)

The method according to claim 4, wherein the method further comprises:
receiving indication information, wherein the indication information is used to indicate a sequence that is in each sequence group of at least two sequence groups and is used to generate the reference signal.

### Claim 7 (depends on 1)

The method according to claim 1, wherein when the value of the delta is 0, the generating a reference signal of a first signal comprises:
performing discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} with t=0, . . . , L×K−1, wherein when t=0, . . . , L×K−1, z(t)=x(t mod K), and wherein x(t) represents the first sequence; and
mapping elements numbered L×K+delta in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the performing discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} comprises:
performing the discrete Fourier transform on the sequence {z(t)}; and
filtering a sequence obtained after the discrete Fourier transform to generate the sequence {f(t)}.

### Claim 9 (depends on 1)

The method according to claim 1, wherein when the value of the delta is 1, the generating a reference signal of a first signal comprises:
performing discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} with t=0, . . . , L×K−1, wherein when t=0, . . . , K−1, z(t)=x(t), and wherein when t=0, . . . , L×K−1, z(t)=−x(t mod K), and x(t) represents the first sequence; and
mapping elements numbered L×p+delta in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 10 (depends on 1)

The method according to claim 1, wherein when L=4, the generating a reference signal of a first signal comprises:
performing discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} with t=0, . . . , 4K−1, wherein when t=0, 1, . . . , 4K−1,
z
⁡
(
t
)
=
w
delta
⁡
(
⌊
t
K
⌋
)
⁢
x
⁡
(
t
⁢
⁢
mod
⁢
⁢
K
)
,
and wherein w0=(1,1,1,1), w1=(1,j,−1,−j), w2=(1,−1,1,−1), w3=(1,−j,−1,j), └c┘ represents rounding down of c, and x(t) represents the first sequence; and
mapping elements numbered 4p+delta in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 11 (depends on 1)

The method according to claim 1, wherein the generating a reference signal of a first signal comprises:
performing discrete Fourier transform on elements in a sequence {x(t)} to obtain a sequence {f(t)} with t=0, . . . , K−1, wherein x(t) represents the first sequence; and
mapping elements numbered p in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 12

A signal processing apparatus, comprising:
at least one processor;
one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to:
determine a first sequence {x(n)} based on a preset condition, wherein the preset condition is
x
n
=
A
·
e
j
×
π
×
s
n
8
,
wherein a length of the first sequence is K=6, A is a non-zero complex number, and j=√{square root over (−1)}, and wherein a sequence {s(n)} is {7, 5, −1, −7, −3, 1}; and
generate a reference signal of a first signal, wherein the first signal is a signal modulated by using π/2 binary phase shift keying (BPSK), and the reference signal is generated by using the first sequence; and
a transceiver, the transceiver configured to send the reference signal on a first frequency-domain resource, wherein the first frequency-domain resource comprises K subcarriers each having a subcarrier number of k, and
k=u+L×n+delta,
wherein L is an integer greater than or equal to 2, delta∈{0, 1, . . . , L−1}, u is an integer, and subcarrier numbers of the K subcarriers are numbered in ascending or descending order of frequencies.

### Claim 13 (depends on 12)

The apparatus according to claim 12, wherein a modulation scheme of the first sequence is neither BPSK modulation nor π/2 BPSK modulation.

### Claim 14 (depends on 12)

The apparatus according to claim 12, wherein the first sequence is a sequence modulated by using any one of 8 PSK, 16 PSK, or 32 PSK.

### Claim 15 (depends on 12)

The apparatus according to claim 12, wherein the programming instructions are for execution by the at least one processor to determine the first sequence in a first sequence group, wherein the first sequence group is one of a plurality of sequence groups, and wherein the first sequence is determined, based on a value of the delta, in a plurality of sequences that are in the first sequence group and whose length is K.

### Claim 16 (depends on 15)

The apparatus according to claim 15, wherein the programming instructions are for execution by the at least one processor to determine the first sequence group based on a cell identifier or a sequence group identifier.

### Claim 17 (depends on 15)

The apparatus according to claim 15, wherein the transceiver is further configured to receive indication information, and wherein the indication information is used to indicate a sequence that is in each sequence group of at least two sequence groups and is used to generate the reference signal.

### Claim 18 (depends on 12)

The apparatus according to claim 12, wherein when the value of the delta is 0, the programming instructions are for execution by the at least one processor to:
perform discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} with t=0, . . . , L×K−1, wherein when t=0, . . . , L×K−1, z(t)=x(t mod K), and wherein when x(t) represents the first sequence; and
map elements numbered L×K+delta in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 19 (depends on 18)

The apparatus according to claim 18, wherein the performing discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} comprises:
performing the discrete Fourier transform on the sequence {z(t)}; and
filtering a sequence obtained after the discrete Fourier transform to generate the sequence {f(t)}.

### Claim 20 (depends on 12)

The apparatus according to claim 12, wherein when the value of the delta is 1, the programming instructions are for execution by the at least one processor to:
perform discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} with t=0, . . . , L×K−1, wherein when t=0, . . . , K−1, z(t)=x(t), and wherein when t=0, . . . , L×K−1, z(t)=−x(t mod K), and x(t) represents the first sequence; and
map elements numbered L×K+delta in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 21 (depends on 12)

The apparatus according to claim 12, wherein when L=4, the programming instructions are for execution by the at least one processor to:
perform discrete Fourier transform on elements in a sequence {z(t)} to obtain a sequence {f(t)} with t=0, . . . , 4K−1, wherein when t=0, 1, . . . , 4K−1,
z
⁡
(
t
)
=
w
delta
⁡
(
⌊
t
K
⌋
)
⁢
x
⁡
(
t
⁢
⁢
mod
⁢
⁢
K
)
,
and wherein w0=(1,1,1,1), w1=(1,j,−1,−j), w2=(1,−1,1,−1), w3=(1,−j, −1, j), └c┘ represents rounding down of c, and x(t) represents the first sequence; and
map elements numbered 4p+delta in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 22 (depends on 12)

The apparatus according to claim 12, wherein the programming instructions are for execution by the at least one processor to:
perform discrete Fourier transform on elements in a sequence {x(t)} to obtain a sequence {f(t)} with t=0, . . . , K−1, wherein x(t) represents the first sequence; and
map elements numbered p in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, K−1.

### Claim 23

A non-transitory computer-readable storage medium comprising instructions which, when executed by at least one processor, cause the at least one processor to perform operations comprising:
determining a first sequence {x(n)} based on a preset condition, wherein the preset condition is
x
n
=
A
·
e
j
×
π
×
s
n
8
,
wherein a length of the first sequence is K=6, A is a non-zero complex number, and j=√{square root over (−1)}, and wherein a sequence {s(n)} is {7, 5, −1, −7, −3, 1};
generating a reference signal of a first signal, wherein the first signal is a signal modulated by using π/2 binary phase shift keying (BPSK), and the reference signal is generated by using the first sequence; and
sending the reference signal on a first frequency-domain resource, wherein the first frequency-domain resource comprises K subcarriers each having a subcarrier number of k, and
k=u+L×n+delta,
wherein L is an integer greater than or equal to 2, delta∈{0, 1, . . . , L−1}, u is an integer, and subcarrier numbers of the K subcarriers are numbered in ascending or descending order of frequencies.

### Claim 24 (depends on 23)

The non-transitory computer-readable storage medium according to claim 23, wherein a modulation scheme of the first sequence is neither BPSK modulation nor π/2 BPSK modulation.

### Claim 25 (depends on 23)

The non-transitory computer-readable storage medium according to claim 23, wherein the first sequence is a sequence modulated by using any one of 8 PSK, 16 PSK, or 32 PSK.

### Claim 26 (depends on 23)

The non-transitory computer-readable storage medium according to claim 23, wherein the generating a reference signal of a first signal comprises:
performing discrete Fourier transform on elements in a sequence {x(t)} to obtain a sequence {f(t)} with t=0, . . . , K−1, wherein x(t) represents the first sequence; and
mapping elements numbered p in the sequence {f(t)} to subcarriers each having the subcarrier number of u+L×p+delta, respectively, to generate the reference signal, wherein p=0, . . . , K−1.

### Claim 27

A signal processing method, comprising:
generating a local sequence, wherein the local sequence is a first sequence {x(n)} or a conjugate transpose of the first sequence, the local sequence is used to process a first signal, and the first signal is a signal modulated by using π/2 binary phase shift keying (BPSK), wherein the first sequence {x(n)} meets a preset condition xn=y(n+m)mod K,
y
n
=
A
·
e
j
×
π
×
s
n
8
,
wherein M∈{0, 1, 2, . . . , 5}, a length of the first sequence is K=6, A is a non-zero complex number, and j=√{square root over (−1)}, and wherein a sequence {s(n)} comprises at least one of the following sequences:
{1, −3, 1, 5, −1, 3}, {1, −3, 1, −7, 7, −5}, {1, 5, 1, −5, −1, −3}, {1, 5, 1, −3, 1, 5}, {1, 7, 1, −5, −7, −1}, {1, 5, 1, 5, −5, 5}, {1, 5, 1, −1, 3, 7}, {1, −3, 1, −5, −1, 3}, {1, −3, 1, 5, 3, 7}, {1, 5, 3, 7, −1, −5}; and
receiving a reference signal of the first signal on a first frequency-domain resource, wherein the first frequency-domain resource comprises K subcarriers each having a subcarrier number of k, k=u+L×n+delta, n=0, 1, . . . , K−1, L is an integer greater than or equal to 2, delta∈{0, 1, . . . , L−1}, u is an integer, the subcarrier numbers are numbered in ascending or descending order of frequencies, and the reference signal is generated by using the first sequence, and wherein the first sequence varies as a value of the delta varies.

### Claim 28 (depends on 27)

The method according to claim 27, wherein the method further comprises:
transmitting indication information, wherein the indication information is used to indicate a sequence that is in each sequence group of at least two sequence groups and is used to generate the reference signal.

### Claim 29 (depends on 28)

The method according to claim 28, wherein the first sequence is in a first sequence group, the first sequence group is one of a plurality of sequence groups, and the value of the delta is associated with the first sequence.

### Claim 30 (depends on 28)

The method according to claim 28, wherein the first sequence is in a first sequence group, and the first sequence group is associated with a cell identifier or a sequence group identifier.