# US 2025/0260462 A1 · Orthogonal multiplexing of signals for non-coherent detection of wake-up sequences

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

- Number: US 2025/0260462 A1
- Document ID: US20250260462A1
- Status: Published application
- Kind: A1
- Application number: 19/190,371
- Filed: 2025-04-25
- Published: 2025-08-14
- Earliest claimed: 2022-10-28
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Fredrik BERGGREN
- Web page: https://patentgrep.com/patent/US20250260462A1

## CPC

- H04B 7/0634: {Antenna weights or vector/matrix coefficients}
- H04J 13/004: {Orthogonal}
- H04J 13/0077: {Multicode, e.g. multiple codes assigned to one user}
- H04J 13/12: Generation of orthogonal codes
- H04L 5/0005: {Time-frequency}
- 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 27/26134: {Pilot insertion in the transmitter chain, e.g. pilot overlapping with data, insertion in time or frequency domain}
- H04L 27/2634: {Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation}
- 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]}
- H04W 52/0235: {where the received signal is a power saving command}
- H04L 27/02: Amplitude-modulated carrier systems, e.g. using on-off keying; Single sideband or vestigial sideband modulation (H04L27/32 takes precedence)
- H04B: TRANSMISSION
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Embodiments of the invention relate to multiplexing of signals in a communication system. A first communication device obtains a vector b comprising M number of integer valued information symbols from a set {0, 1, . . . , q−1}, where q=2Q and where Q is a positive integer; and obtains a N×M matrix C comprising symbols from the set {0, 1, . . . , q−1}, where N is a positive integer such that M≤N. The matrix C is multiplied with the vector b modulo-q to obtain a vector y comprising N number of transmission symbols, wherein each transmission symbol in the vector y is associated with one of q number of signals. An associated signal is transmitted for each transmission symbol in the vector y to one or more receivers.

## Claims

### Claim 1

A first communication device for a communication system, the first communication device comprising:
one or more processors in communications with a non-transitory memory storing computer instructions, wherein the instructions, when executed by the one or more processors, cause the apparatus to:
obtain a vector b comprising M number of integer valued information symbols from a set {0, 1, . . . , q−1}, where q=2Q and where Q is a positive integer;
obtain a N×M matrix C comprising symbols from the set {0, 1, . . . , q−1}, where N is a positive integer such that M≤N;
multiply the matrix C with the vector b modulo-q to obtain a vector y comprising N number of transmission symbols, wherein each transmission symbol in the vector y is associated with one of q number of signals; and
transmit an associated signal for each transmission symbol in the vector y to one or more receivers.

### Claim 2 (depends on 1)

The first communication device according to claim 1, wherein a component k with 1≤k≤N in the vector y is associated with time/frequency resource k.

### Claim 3 (depends on 1)

The first communication device according to claim 1, wherein N=12n or N=14n for any positive integer value of n.

### Claim 4 (depends on 1)

The first communication device according to claim 1, wherein the vector b comprises information symbols for different receivers.

### Claim 5 (depends on 4)

The first communication device according to claim 4, wherein the vector b comprises Su number of information symbols for receiver u such that
∑
u
=
1
U
S
u
=
M
where U is the number of receivers with 1≤U≤M.

### Claim 6 (depends on 1)

The first communication device according to claim 1, wherein the associated signal is any one of:
an on-off keying signal;
a frequency shift keying signal;
an orthogonal frequency division multiplex signal; or a discrete Fourier transform precoded orthogonal frequency division multiplex signal.

### Claim 7 (depends on 1)

The first communication device according to claim 1, wherein at least one information symbol represents any one of:
an indicator to wake-up a receiver or a group of receivers;
an identity of a receiver or a group of receivers; or
a paging information associated with a receiver or a group of receivers.

### Claim 8 (depends on 1)

The first communication device according to claim 1, wherein M=N, and wherein C and C−1 comprise integer valued symbols from the set {0, 1, . . . , q−1} and fulfil
C
-
1
⁢
C
=
I
⁡
(
mod
⁢
q
)
,
where C−1 is the modular inverse of C, I is the identity matrix and mod q is the modulo-q operator.

### Claim 9 (depends on 1)

The first communication device according to claim 1, wherein C is a N×N matrix and has a rank equal to N, where q=2, and wherein C−1 fulfills at least one of:
C−1 is a matrix with one element equal to 1 per row and per column;
C−1 is a matrix where at least one row has an even Hamming weight;
C−1 is a matrix where N−1 number of rows have an even Hamming weight;
C−1 is a matrix where the rows have an odd Hamming weight;
C−1 is a matrix with a total Hamming weight equal to N2−N+1 such that N−1 number of rows have a Hamming weight equal to N−1 and 1 row has a Hamming weight equal to N; and/or
C−1 is a matrix where every row has the same odd-valued Hamming weight.

### Claim 10 (depends on 1)

The first communication device according to claim 1, wherein C is a N×N matrix and has rank equal to N, where Q>1, and wherein C is any row or column permuted version of a matrix C given as
C
_
=
(
c
11
0
0
0
0
c
22
0
0
⋮
⋮
⋱
⋮
0
0
0
c
NN
)
where cii are odd integers from the set {0, 1, . . . , q−1}, and where for at least one i with 1≤i≤N, each symbol in the set {0, 1, . . . , q−1} is associated with a bit label such that a difference in Hamming weight between bit labels for symbol X and Y=cii−1 X(mod q) is at most 1.

### Claim 11 (depends on 1)

The first communication device according to claim 1, wherein M=N, wherein t is the smallest positive integer such that Ct=I(mod q), and wherein up to t−1 matrices are generated for the communication system as:
{C, C2, . . . , Ct−1}.

### Claim 12 (depends on 1)

The first communication device according to claim 1, wherein C is a N×M matrix and has a rank equal to M, where M<N and q=2,and wherein C fulfills at least one of:
C is obtained from any row or column permutation of a matrix {tilde over (C)} given as
C
~
=
[
P
A
]
where P is an M×M matrix with distinct rows and columns and where every row and every column contains one non-zero element, and where A is an (N−M)×M matrix;
a product of C′C has a rank equal to M where C′ is the transpose of C; and/or C comprises orthogonal column vectors with an odd Hamming weight.

### Claim 13

A second communication device for a communication system, the second communication device comprising:
one or more processors in communications with a non-transitory memory storing computer instructions, wherein the instructions, when executed by the one or more processors, cause the apparatus to:
receive N number of signals, wherein each signal is associated with a symbol from a set {0, 1, . . . , q−1}, where q=2Q and where Q is a positive integer;
determine M number of integer valued information symbols from N number of associated symbols based on a N×M matrix C or its modular inverse, where the matrix C and its modular inverse comprises symbols from the set {0, 1, . . . , q−1}, where N is a positive integer such that M≤N.

### Claim 14 (depends on 13)

The second communication device according to claim 13, wherein a signal is any one of:
an on-off keying signal;
a frequency shift keying signal;
an orthogonal frequency division multiplex signal; or
a discrete Fourier transform precoded orthogonal frequency division multiplex signal.

### Claim 15 (depends on 13)

The second communication device according to claim 13, wherein at least one information symbol represents any one of:
an indicator to wake-up a receiver or a group of receivers;
an identity of a receiver or a group of receivers; or
a paging information associated with a receiver or a group of receivers.

### Claim 16 (depends on 13)

The second communication device according to claim 13, wherein M=N, and wherein C and C−1 comprise integer valued symbols from the set {0, 1, . . . , q−1} and fulfil
C
-
1
⁢
C
=
I
⁡
(
mod
⁢
q
)
,
where C−1 is the modular inverse of C, I is the identity matrix and mod q is the modulo-q operator.

### Claim 17 (depends on 13)

The second communication device according to claim 13, wherein C is a N×N matrix and has a rank equal to N, where q=2, and wherein C−1 fulfills at least one of:
C−1 is a matrix with one element equal to 1 per row and per column;
C−1 is a matrix where at least one row has an even Hamming weight;
C−1 is a matrix where N−1 number of rows have an even Hamming weight;
C−1 is a matrix where the rows have an odd Hamming weight;
C−1 is a matrix with a total Hamming weight equal to N2−N+1 such that N−1 number of rows have a Hamming weight equal to N−1 and 1 row has a Hamming weight equal to N; and/or
C−1 is a matrix where every row has the same odd-valued Hamming weight.

### Claim 18 (depends on 13)

The second communication device according to claim 13, wherein C is a N×N matrix and has rank equal to N, where Q>1, and wherein C is any row or column permuted version of a matrix C given as
C
_
=
(
c
11
0
0
0
0
c
22
0
0
⋮
⋮
⋱
⋮
0
0
0
c
NN
)
where cii are odd integers from the set {0, 1, . . . , q−1}, and where for at least one i with 1≤i≤N, each symbol in the set {0, 1, . . . , q−1} is associated with a bit label such that a difference in Hamming weight between bit labels for symbol X and Y=cii−1 X(mod q) is at most 1.

### Claim 19 (depends on 13)

The second communication device according to claim 13, wherein C is a N×M matrix and has a rank equal to M, where M<N and q=2, and wherein C fulfills at least one of:
C is obtained from any row or column permutation of a matrix {tilde over (C)} given as
C
~
=
[
P
A
]
where P is an M×M matrix with distinct rows and columns and where every row and every column contains one non-zero element, and where A is an (N−M)×M matrix;
a product of C′C has a rank equal to M where C′ is the transpose of C; and/or
C comprises orthogonal column vectors with an odd Hamming weight.

### Claim 20

A method for a first communication device, the method comprising:
obtaining a vector b comprising M number of integer valued information symbols from a set {0, 1, . . . , q−1}, where q=2Q and where Q is a positive integer;
obtaining a N×M matrix C comprising symbols from the set {0, 1, . . . , q−1}, where N is a positive integer such that M≤N;
multiplying the matrix C with the vector b modulo-q to obtain a vector y comprising N number of transmission symbols, wherein each transmission symbol in the vector y is associated with one of q number of signals; and
transmitting an associated signal for each transmission symbol in the vector y to one or more receivers.
