# US 10,771,303 B2 · Overlapped multiplexing-based decoding method and device, and modulation and demodulation method and system

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

- Number: US 10,771,303 B2
- Document ID: US10771303B2
- Status: Granted
- Kind: B2
- Application number: 16/377,149
- Filed: 2019-04-05
- Published: 2019-08-01
- Granted: 2020-09-08
- Earliest claimed: 2017-07-06
- Assignees: Shen Zhen Kuang-Chi Hezhong Technology Ltd
- Applicants: Shenzhen Super Data Link Technology Ltd.
- Inventors: Ruopeng Liu; Chunlin Ji; Xingan Xu; Shasha Zhang
- Web page: https://patentgrep.com/patent/US10771303B2

## CPC

- H04L 1/0045: {Arrangements at the receiver end}
- H04J 4/00: Combined time-division and frequency-division multiplex systems (H04J13/00 takes precedence {; data transmission H04L5/26; telemetry G08C15/00})
- H04L 1/00: Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)}
- H04L 1/0047: {Decoding adapted to other signal detection operation (in conjunction with sequence estimation or equalization H04L25/03286)}
- H04L 1/005: {Iterative decoding, including iteration between signal detection and decoding operation}
- H04L 27/04: Modulator circuits; Transmitter circuits
- H04L 27/2627: {Modulators}
- H04L 27/2649: {Demodulators}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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)

## Abstract

In an overlapped multiplexing-based decoding method and device, and modulation and demodulation method and system provided in this application, a convolution operation with a header and without a tail is split into group operations with both a header and a tail by using a slide group decoding scheme and based on association between adjacent symbols in an OvXDM system, and then each group of sequences is decoded by using a corresponding decoding algorithm.

## Claims

### Claim 1

An overlapped multiplexing-based decoding method, comprising:
step 1: setting a group sequence length based on a length of a multiplexing waveform in a received signal, and grouping receive sequences in the received signal;
step 2: converting a multiplexing waveform coefficient into a matrix form based on the group sequence length;
step 3: decoding a receive sequence of a current group by using a preset algorithm, to obtain a transmit sequence of the current group in an original signal;
step 4: if there is known information in the receive sequence of the current group, removing the known information; otherwise, proceeding to step 5;
step 5: sliding the receive sequence backward, and repeating step 3 and step 4, until all groups are decoded; and
step 6: outputting a decoding result after all the groups are decoded.

### Claim 2 (depends on 1)

The method according to claim 1, wherein when the multiplexing waveform coefficient is converted into the matrix form based on the group sequence length, a representation is:
[
h
0
0
0
0
0
h
1
h
0
0
0
0
h
2
h
1
h
0
0
0
⋮
⋮
⋮
0
0
h
K
-
1
h
K
-
2
⋯
h
0
0
0
h
K
-
1
h
K
-
2
⋯
h
0
]
M
×
M
wherein h is the multiplexing waveform coefficient, and M is the group sequence length.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the preset algorithm is a gradient algorithm, a least squares algorithm, a steepest descent algorithm, a conjugate gradient algorithm, an accelerated conjugate gradient algorithm, or an accelerated Chebyshev algorithm.

### Claim 4 (depends on 1)

The method according to claim 1, wherein when the receive sequence of the current group is decoded by using the preset algorithm, the method further comprises: storing a non-variable in the preset algorithm, and calling the non-variable during decoding.

### Claim 5 (depends on 4)

The method according to claim 4, wherein the preset algorithm is a least squares algorithm, and the non-variable is (HT×H)−1×HT, wherein H is a matrix obtained after conversion of the multiplexing waveform coefficient.

### Claim 6

An overlapped multiplexing-based decoding device, comprising:
a grouping module, configured to set a group sequence length based on a length of a multiplexing waveform in a received signal, and group receive sequences in the received signal;
a conversion module, configured to convert a multiplexing waveform coefficient into a matrix form based on the group sequence length;
a decoding module, configured to decode a receive sequence of a current group by using a preset algorithm, to obtain a transmit sequence of the current group in an original signal;
a known information removal module, configured to: when there is known information in the receive sequence of the current group, remove the known information;
a sliding module, configured to slide the receive sequence backward, and control the decoding module and the known information removal module to repeatedly perform a decoding step, until all groups are decoded; and
an output module, configured to output a decoding result after all the groups are decoded.

### Claim 7 (depends on 6)

The device according to claim 6, wherein when the multiplexing waveform coefficient is converted into the matrix form based on the group sequence length, a representation is:
[
h
0
0
0
0
0
h
1
h
0
0
0
0
h
2
h
1
h
0
0
0
⋮
⋮
⋮
0
0
h
K
-
1
h
K
-
2
⋯
h
0
0
0
h
K
-
1
h
K
-
2
⋯
h
0
]
M
×
M
wherein h is the multiplexing waveform coefficient, and M is the group sequence length.

### Claim 8 (depends on 6)

The device according to claim 6, wherein the preset algorithm is a gradient algorithm, a least squares algorithm, a steepest descent algorithm, a conjugate gradient algorithm, an accelerated conjugate gradient algorithm, or an accelerated Chebyshev algorithm.

### Claim 9 (depends on 6)

The device according to claim 6, further comprising a storage module, configured to store a non-variable in the preset algorithm, and the decoding module calls the non-variable during decoding.

### Claim 10 (depends on 9)

The device according to claim 9, wherein the preset algorithm is a least squares algorithm, and the non-variable is (HT×H)−1×HT, wherein H is a matrix obtained after conversion of the multiplexing waveform coefficient.

### Claim 11

An overlapped multiplexing-based modulation and demodulation method, comprising a modulation step and a demodulation step, wherein
the modulation step comprises:
generating an initial envelope waveform;
shifting the initial envelope waveform in a corresponding domain at a shift interval based on a quantity of times of overlapped multiplexing, to obtain shifted envelope waveforms at fixed intervals;
converting an input digital signal sequence into a signal symbol sequence represented by using positive and negative symbols;
multiplying the signal symbol sequence by offset shifted envelope waveforms at fixed intervals, to obtain modulated envelope waveforms;
superimposing the modulated envelope waveforms in the corresponding domain, to obtain a complex modulated envelope waveform carrying the digital signal sequence; and
transmitting the complex modulated envelope waveform; and
the decoding method used in the demodulation step comprises:
step 1: setting a group sequence length based on a length of a multiplexing waveform in a received signal, and grouping receive sequences in the received signal;
step 2: converting a multiplexing waveform coefficient into a matrix form based on the group sequence length;
step 3: decoding a receive sequence of a current group by using a preset algorithm, to obtain a transmit sequence of the current group in an original signal;
step 4: if there is known information in the receive sequence of the current group, removing the known information; otherwise, proceeding to step 5;
step 5: sliding the receive sequence backward, and repeating step 3 and step 4, until all groups are decoded; and
step 6: outputting a decoding result after all the groups are decoded.

### Claim 12 (depends on 11)

The overlapped multiplexing-based modulation and demodulation method according to claim 11, wherein when the multiplexing waveform coefficient is converted into the matrix form based on the group sequence length, a representation is:
[
h
0
0
0
0
0
h
1
h
0
0
0
0
h
2
h
1
h
0
0
0
⋮
⋮
⋮
0
0
h
K
-
1
h
K
-
2
⋯
h
0
0
0
h
K
-
1
h
K
-
2
⋯
h
0
]
M
×
M
wherein h is the multiplexing waveform coefficient, and M is the group sequence length.

### Claim 13 (depends on 11)

The overlapped multiplexing-based modulation and demodulation method according to claim 11, wherein the preset algorithm is a gradient algorithm, a least squares algorithm, a steepest descent algorithm, a conjugate gradient algorithm, an accelerated conjugate gradient algorithm, or an accelerated Chebyshev algorithm.

### Claim 14 (depends on 11)

The overlapped multiplexing-based modulation and demodulation method according to claim 11, wherein when the receive sequence of the current group is decoded by using the preset algorithm, the method further comprises: storing a non-variable in the preset algorithm, and calling the non-variable during decoding.

### Claim 15 (depends on 14)

The overlapped multiplexing-based modulation and demodulation method according to claim 14, wherein the preset algorithm is a least squares algorithm, and the non-variable is (HT×H)−1×HT, wherein H is a matrix obtained after conversion of the multiplexing waveform coefficient.