# US 2020/0154423 A1 · Data transmission method, related device, and system

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

- Number: US 2020/0154423 A1
- Document ID: US20200154423A1
- Status: Published application
- Kind: A1
- Application number: 16/748,616
- Filed: 2020-01-21
- Published: 2020-05-14
- Earliest claimed: 2017-08-04
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Chao WANG; Yiqun WU; Yan CHEN
- Web page: https://patentgrep.com/patent/US20200154423A1

## CPC

- H04W 72/044: based on the type of the allocated resource
- H04B 1/69: Spread spectrum techniques
- H04J 13/10: Code generation
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H04L 25/03866: {using scrambling}
- H04J 13/0051: {Orthogonal gold}
- H04L 1/0042: {Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape (H04L1/0067 takes precedence)}
- H04L 1/0047: {Decoding adapted to other signal detection operation (in conjunction with sequence estimation or equalization H04L25/03286)}
- H04L 5/0053: {Allocation of signalling, i.e. of overhead other than pilot signals}
- H04W 72/0453: Resources in frequency domain, e.g. a carrier in FDMA
- H04W 72/12: Wireless traffic scheduling
- H04W 76/10: Connection setup
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- 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)

## Abstract

Embodiments of the present invention describe a data transmission method, a related device, and a system. The method may include sending, by a terminal, uplink data to a network device. The uplink data is scrambled by using a scrambling sequence, and the scrambling sequence is generated based on information about a radio resource used by the terminal to send the uplink data. According to the embodiments of the present invention, it can be ensured that scrambling and descrambling on the uplink data are successfully implemented when the network device does not obtain an identifier of the terminal in a cell.

## Claims

### Claim 1

A data transmission method, comprising:
generating, by a terminal, a scrambling sequence based on information about a radio resource used by the terminal to send uplink data to a network device; and
sending, by the terminal, the uplink data to the network device, wherein the uplink data is scrambled using the scrambling sequence.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the radio resource comprises at least one of a time-frequency resource used to send the uplink data, a frequency domain of the time-frequency resource, a pilot used to send the uplink data, a spread spectrum sequence used to send the uplink data, and an interleaving pattern used to send the uplink data.

### Claim 3 (depends on 2)

The method according to claim 2, wherein
the radio resource comprises the time-frequency resource; or
the radio resource comprises the pilot; or
the radio resource comprises the frequency domain of the time-frequency resource and the pilot; or
the radio resource comprises the frequency domain of the time-frequency resource and the spread spectrum sequence; or
the radio resource comprises the frequency domain of the time-frequency resource and the interleaving pattern.

### Claim 4 (depends on 3)

The method according to claim 3, wherein when the radio resource comprises the pilot, an initial sequence generation value Cinit of the scrambling sequence meets a formula 1, a formula 2, or a formula 3, comprising:
cinit=nRS·213+└ns/2┘·29+NIDcell Formula 1:
cinit=nRS·214+q·213+└(j0+j)Nacc mod 10┘·29+NIDcell Formula 2:
cinit=(└ns/2┘+1)·(2NIDcell+1)2x+nRS Formula 3:
wherein in the formula 1, the formula 2, and the formula 3, nRS is an identifier of the pilot, q is determined based on a quantity of code words in a subframe, ns is a quantity of timeslots in a frame, NIDcell is an identifier of a cell in which the terminal is located, j0=└i0/Nacc┘, i0 is a subframe sequence number obtained through counting from a first PUSCH subframe to a subframe used for current data transmission, Nacc is a preset value indicating a quantity of subframes, j represents a sequence number of a code block in Nacc subframes that needs to be scrambled currently, and x is determined based on a quantity of bits occupied by a number nRS of the pilot.

### Claim 5 (depends on 3)

The method according to claim 3, wherein when the radio resource comprises the frequency domain of the time-frequency resource and the pilot, an initial sequence generation value Cinit of the scrambling sequence meets a formula 4, a formula 5, or a formula 6, comprising:
cinit=nFeq·2x+nRS·213+└ns/2┘·29+NIDcell Formula 4:
cinit=nFeq·2x+nRS·214+q·213+└(j+j)Nacc mod 10┘·29+NIDcell Formula 5:
cinit=(└ns/2┘+1)·(2NIDcell+1)2y+nFeq2x+nRS Formula 6:
wherein in the formula 4, the formula 5, and the formula 6, nFeq is an identifier of the frequency domain, nRS is a number of the pilot, q is determined based on a quantity of code words in a subframe, ns is a quantity of timeslots in a frame, NIDcell is an identifier of a cell in which the terminal is located, j0=└i0/Nacc┘, i0 is a subframe sequence number obtained through counting from a first PUSCH subframe to a subframe used for current data transmission, Nacc is a preset value indicating a quantity of subframes, j represents a sequence number of a code block in Nacc subframes that needs to be scrambled currently, x is determined based on a quantity of bits occupied by the number nRS of the pilot, and y is determined based on x and a quantity of bits occupied by the identifier nFeq of the frequency domain.

### Claim 6 (depends on 2)

The method according to claim 2, wherein the time-frequency resource used to send the uplink data does not need to be instantly scheduled by the network device.

### Claim 7 (depends on 2)

The method according to claim 2, wherein the time-frequency resource used to send the uplink data is selected by the terminal from a plurality of to-be-selected time-frequency resources according to a preset rule, or is preconfigured by the network device for the terminal by using a signaling message.

### Claim 8

A terminal, comprising:
a memory;
a transceiver; and
at least one processor, communicatively coupled with the memory and the processor, configured to:
generate a scrambling sequence based on information about a radio resource used by the terminal to send uplink data to a network device, and
send, using the transceiver, the uplink data to the network device, wherein the uplink data is scrambled using the scrambling sequence.

### Claim 9 (depends on 8)

The terminal according to claim 8, wherein the radio resource comprises at least one of a time-frequency resource used to send the uplink data, a frequency domain of the time-frequency resource, a pilot used to send the uplink data, a spread spectrum sequence used to send the uplink data, and an interleaving pattern used to send the uplink data.

### Claim 10 (depends on 9)

The terminal according to claim 9, wherein
the radio resource comprises the time-frequency resource; or
the radio resource comprises the pilot; or
the radio resource comprises the frequency domain of the time-frequency resource and the pilot; or
the radio resource comprises the frequency domain of the time-frequency resource and the spread spectrum sequence; or
the radio resource comprises the frequency domain of the time-frequency resource and the interleaving pattern.

### Claim 11 (depends on 10)

The terminal according to claim 10, wherein when the radio resource comprises the pilot, an initial sequence generation value Cinit of the scrambling sequence generated by the at least one processor meets a formula 1, a formula 2, or a formula 3, comprising:
cinit=nRS·213+└ns/2┘·29+NIDcell Formula 1:
cinit=nRS·214+q·213+└(j0+j)Nacc mod 10┘·29+NIDcell Formula 2:
cinit=(└ns/2┘+1)·(2NIDcell+1)2x+nRS Formula 3:
wherein in the formula 1, the formula 2, and the formula 3, nRS is an identifier of the pilot, q is determined based on a quantity of code words in a subframe, ns is a quantity of timeslots in a frame, NIDcell is an identifier of a cell in which the terminal is located, j0=└i0/Nacc┘, i0 is a subframe sequence number obtained through counting from a first PUSCH subframe to a subframe used for current data transmission, Nacc is a preset value indicating a quantity of subframes, j represents a sequence number of a code block in Nacc subframes that needs to be scrambled currently, and x is determined based on a quantity of bits occupied by a number nRS of the pilot.

### Claim 12 (depends on 10)

The terminal according to claim 10, wherein when the radio resource comprises the frequency domain of the time-frequency resource and the pilot, an initial sequence generation value Cinit of the scrambling sequence generated by the at least one processor meets a formula 4, a formula 5, or a formula 6, comprising:
cinit=nFeq·2x+nRS·213+└ns/2┘·29+NIDcell Formula 4:
cinit=nFeq·2x+nRS·214+q·213+└(j+j)Nacc mod 10┘·29+NIDcell Formula 5:
cinit=(└ns/2┘+1)·(2NIDcell+1)2y+nFeq2x+nRS Formula 6:
wherein in the formula 4, the formula 5, and the formula 6, nFeq is an identifier of the frequency domain, nRS is a number of the pilot, q is determined based on a quantity of code words in a subframe, ns is a quantity of timeslots in a frame, NIDcell is an identifier of a cell in which the terminal is located, j0=└i0/Nacc ┘, i0 is a subframe sequence number obtained through counting from a first PUSCH subframe to a subframe used for current data transmission, Nacc is a preset value indicating a quantity of subframes, j represents a sequence number of a code block in Nacc subframes that needs to be scrambled currently, x is determined based on a quantity of bits occupied by the number nRS of the pilot, and y is determined based on x and a quantity of bits occupied by the identifier nFeq of the frequency domain.

### Claim 13 (depends on 9)

The terminal according to claim 9, wherein the time-frequency resource used to send the uplink data does not need to be instantly scheduled by the network device.

### Claim 14 (depends on 9)

The terminal according to claim 9, wherein the time-frequency resource used to send the uplink data is selected by the at least one processor from a plurality of to-be-selected time-frequency resources according to a preset rule, or is preconfigured by the network device for the terminal by using a signaling message received by the transceiver.

### Claim 15

A non-transitory computer readable storage medium, wherein the computer readable storage medium stores an instruction, which when the instruction is executed by at least one processor a terminal, the at least one processor causes the terminal to perform operations,
generating a scrambling sequence based on information about a radio resource used by the terminal to send uplink data to a network device; and
sending the uplink data to the network device, wherein the uplink data is scrambled using the scrambling sequence.

### Claim 16 (depends on 15)

The non-transitory computer readable storage medium according to claim 15, wherein the radio resource comprises at least one of a time-frequency resource used to send the uplink data, a frequency domain of the time-frequency resource, a pilot used to send the uplink data, a spread spectrum sequence used to send the uplink data, and an interleaving pattern used to send the uplink data.

### Claim 17 (depends on 16)

The non-transitory computer readable storage medium according to claim 16, wherein
the radio resource comprises the time-frequency resource; or
the radio resource comprises the pilot; or
the radio resource comprises the frequency domain of the time-frequency resource and the pilot; or
the radio resource comprises the frequency domain of the time-frequency resource and the spread spectrum sequence; or
the radio resource comprises the frequency domain of the time-frequency resource and the interleaving pattern.

### Claim 18 (depends on 17)

The non-transitory computer readable storage medium according to claim 17, wherein when the radio resource comprises the pilot, an initial sequence generation value Cinit of the scrambling sequence meets a formula 1, a formula 2, or a formula 3, comprising:
cinit=nRS·213+└ns/2┘·29+NIDcell Formula 1:
cinit=nRS·214+q·213+└(j0+j)Nacc mod 10┘·29+NIDcell Formula 2:
cinit=(└ns/2┘+1)·(2NIDcell+1)2x+nRS Formula 3:
wherein in the formula 1, the formula 2, and the formula 3, nRS is an identifier of the pilot, q is determined based on a quantity of code words in a subframe, ns is N cell a quantity of timeslots in a frame, NIDcell is an identifier of a cell in which the terminal is located, j0=└i0/Nacc┘, i0 is a subframe sequence number obtained through counting from a first PUSCH subframe to a subframe used for current data transmission, Nacc is a preset value indicating a quantity of subframes, j represents a sequence number of a code block in Nacc subframes that needs to be scrambled currently, and x is determined based on a quantity of bits occupied by a number nRS of the pilot.

### Claim 19 (depends on 17)

The non-transitory computer readable storage medium according to claim 17, wherein when the radio resource comprises the frequency domain of the time-frequency resource and the pilot, an initial sequence generation value Cinit of the scrambling sequence meets a formula 4, a formula 5, or a formula 6, comprising:
cinit=nFeq·2x+nRS·213+└ns/2┘·29+NIDcell Formula 4:
cinit=nFeq·2x+nRS·214+q·213+└(j+j)Nacc mod 10┘·29+NIDcell Formula 5:
cinit=(└ns/2┘+1)·(2NIDcell+1)2y+nFeq2x+nRS Formula 6:
wherein in the formula 4, the formula 5, and the formula 6, nFeq is an identifier of the frequency domain, nRS is a number of the pilot, q is determined based on a quantity of code words in a subframe, ns is a quantity of timeslots in a frame, NIDcell is an identifier of a cell in which the terminal is located, j0=└i0/Nacc┘, i0 is a subframe sequence number obtained through counting from a first PUSCH subframe to a subframe used for current data transmission, Nacc is a preset value indicating a quantity of subframes, j represents a sequence number of a code block in Nacc subframes that needs to be scrambled currently, x is determined based on a quantity of bits occupied by the number nRS of the pilot, and y is determined based on x and a quantity of bits occupied by the identifier nFeq of the frequency domain.

### Claim 20 (depends on 16)

The non-transitory computer readable storage medium according to claim 16, wherein the time-frequency resource used to send the uplink data does not need to be instantly scheduled by the network device.
