RU2792113C1 - Method for justification and binding of direct connection resource and corresponding device - Google Patents

Abstract

FIELD: communications.

SUBSTANCE: method uses a terminal device and includes calculating, based on the size of the target resource, and allows to perform the lengths E of the encoded bits carried by the resource in use, with the exception of the target resource, and perform resource binding by negotiating the transmission rate based on the output of the sequence of encoded bits, while the length of the sequence of encoded bits equals to E or E+E' , and E' is the length of the encoded bits carried by the target resource.

EFFECT: possibility of justification rate and binding the direct connection resource, taking into account the target resource in the resource being used.

5 cl, 4 dwg

Description

CROSS REFERENCES TO RELATED APPLICATIONS

[0001] This application claims priority to Chinese Patent Application No. 201910691374.5 filed on July 29, 2019 titled "DIRECT CONNECTION RATE NEGOTIATION AND RESOURCE BINDING METHOD AND CORRESPONDING DEVICE", which is incorporated herein by reference in its entirety.

FIELD OF THE INVENTION

[0002] Embodiments of the present invention relate to the field of communications, and specifically to a method for negotiating the transmission rate and binding a resource of a direct connection (sidelink) and the corresponding device.

BACKGROUND OF THE INVENTION

[0003] In the case of long-term evolution (Long Term Evolution, LTE), data transmission over a direct connection is performed as a multicast transmission. While it is used for basic secure data communications such as vehicle to everything (V2X), it is not applicable to more advanced V2X services. The New Radio (NR) technology system supports more advanced implementations for data transmission over a direct connection, such as unicast, multicast, or broadcast, to support more comprehensive services.

[0004] With regard to conventional technologies, if rate matching and resource binding cannot be performed properly, the possibility of demodulation of direct connection data may be reduced, affecting the transmission efficiency of the system. At present, the method of performing rate negotiation and resource binding in data transmission over a direct connection is a technical problem that needs to be urgently solved with regard to related technologies.

SUMMARY OF THE INVENTION

[0005] Embodiments of the present invention provide a direct connection rate negotiation and resource binding method and a corresponding apparatus for providing a rate negotiation and resource binding decision for direct connection data transmission.

[0006] According to a first aspect, a direct connection rate negotiation and resource binding method is provided, wherein the method is performed by a tag, and includes the following:

calculating, based on the size of the target resource, a length E of encoded bits carried by the resource in use, excluding the target resource; And

performing resource binding based on the output of the encoded bit sequence by rate negotiation, wherein the length of the encoded bit sequence is E or E+E', and E' is the length of the encoded bits carried by the target resource.

[0007] According to a second aspect, a terminal device is provided, including:

a computing module configured to calculate, based on the size of the target resource, the length E of encoded bits carried by the resource in use, excluding the target resource; And

a resource binding module configured to perform resource binding based on the output of the encoded bit sequence by rate matching, wherein the length of the encoded bit sequence is E or E+E', and E' is the length of the encoded bits carried by the target resource.

[0008] According to a third aspect, a terminal device is provided, including: a processor, a storage device, and a computer program stored on this storage device, which can be launched by this processor, and, when executed by it, provides the implementation of the steps of the rate negotiation and binding method a direct connection resource according to the first aspect.

[0009] According to a fourth aspect, a computer-readable storage medium is provided that stores a computer program that, when executed by a processor, implements the steps of the direct connection rate negotiation and resource binding method according to the first aspect.

[0010] According to embodiments of the present invention, the terminal can, based on the size of the target resource, calculate the length E of the encoded bits carried by the resource in use, excluding the target resource, and based on the output of the sequence of encoded bits, perform resource binding by negotiating the transmission rate, while the length the encoded bit sequence is E or E+E', and E' is the length of the encoded bits carried by the target resource. According to embodiments of the present invention, the calculation of the length of the encoded bits carried by the resource in use, excluding the target resource, is performed to provide a rate negotiation and resource binding decision for a direct NR connection. In addition, the target resource in the used resource is taken into account in the forward transmission rate and resource binding negotiation, thereby increasing the demodulation success rate of the direct transmission data and improving the transmission efficiency of the system.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The accompanying drawings provided herein are intended to provide a further understanding of the present invention and are part of it. The embodiments of the present invention and their description are intended to explain the present invention and do not limit it in any way. On the attached drawings:

[0012] FIG. 1 is a flowchart of a method for rate negotiation and direct transmission resource binding according to one embodiment of the present invention;

[0013] FIG. 2 is a schematic view of a target resource according to one embodiment of the present invention.

[0014] FIG. 3 is a schematic diagram of a user equipment according to one embodiment of the present invention; And

[0015] FIG. 4 is a schematic diagram of the construction of a terminal device according to another embodiment of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS

[0016] In order to make the objects, technical solutions and advantages of the present invention more clear, the following is a clear and complete description of these solutions according to the embodiments of the present invention with reference to the accompanying drawings of these embodiments. Obviously, the described embodiments are some of the embodiments of the present invention, and not all of them. All other embodiments obtained by a person skilled in the art without creative effort and based on the embodiments of the present invention should fall within the scope of the present invention. The term "and/or" in the embodiments of the present description means the presence of at least one associated object.

[0017] It should be understood that the technical solutions in the embodiments of the present invention may be applied to different communication systems, for example, an LTE direct connection system, an NR direct connection system, or advanced direct connection data transmission systems of the future.

[0018] According to embodiments of the present invention, the terminal device may include, among other things, a mobile station (MS, Mobile Station), mobile subscriber equipment (Mobile Terminal), mobile phone (Mobile Telephone), user equipment (User Equipment, UE), portable telephone (handset), portable equipment (portable equipment), vehicle (vehicle), etc. A terminal may communicate with one or more core networks via a Radio Access Network (RAN). For example, the terminal device may be a mobile phone (also referred to as a "cellular phone") or a computer with a wireless communication function; or the terminal device may be a portable, handheld, handheld device, a device embedded in a computer, or an in-vehicle mobile communication device.

[0019] As shown in FIG. 1, according to an embodiment of the present invention, a direct connection rate negotiation and resource binding method 100 is provided. The method can be carried out at the expense of the terminal device, and includes the following steps:

[0020] Step S102: Calculating, based on the size of the target resource, the length E of encoded bits carried by the resource in use, excluding the target resource.

[0021] The target resource is part of the resource being used. Additionally, the target resource may include:

(1) the resource occupied by automatic gain control (Automatic Gain Control, AGC); or

(2) the resource occupied by the Physical Sidelink Share Channel (PSSCH), wherein the resource occupied by the PSSCH and the resource occupied by the Physical Sidelink Control Channel (PSCCH) coincide in the time domain.

[0022] When transmitting data over a direct connection, the first character or the first half-character of the resource being used may be used to adjust the AGC. Therefore, the resource occupied by the AGC can be represented by the first character or the first half character of the resource being used.

[0023] In addition, the processing time/length of the AGC symbol is a predetermined/predetermined value.

[0024] Alternatively, the processing time/length of the AGC symbol is obtained based on the number.

[0025] Alternatively, the transmit-side terminal indicates the AGC configuration for the receive-side terminal with SCI direct connection control/SL-RRC direct connection radio resource control information, e.g., with indication information such as AGC processing time /AGC character length/Information about whether AGC is enabled.

[0026] Alternatively, the receiving side terminal returns information to the transmitting side terminal indicating at least one of whether AGC is enabled, AGC processing time, number of AGC symbols, and so on.

[0027] In the case where the target source is represented by a PSSCH (matching the PSCCH in the time domain), see FIG. 2. In FIG. 2 PSCCH occupies the first two symbols, the target resource is represented by the PSSCH in part A of FIG. 2, and the guard interval (Guard Period, GP) occupies the last character.

[0028] What pumps the used resource according to this embodiment, in particular, for example, in FIG. 2, the resource in use is represented by the PSSCH resource in FIG. 2, including part A and part B in FIG. 2.

[0029] With regard to the calculation of E, at this stage, as shown in FIG. 2, it is possible to calculate the length E of the coded bits carried by the PSSCH of part B in FIG. 2. The calculation of the E value can be done by the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением целевого ресурса, в частности, например, количество используемых RE в части B на ФИГ. 2;

- порядок модуляции; и

- количество слоев.

- the number of used REs in the scheduled resource with the exception of the target resource, in particular, for example, the number of used REs in part B in FIG. 2;

- modulation order; And

- the number of layers.

[0030] In addition, at this stage, you can calculate the length E' of the encoded bits carried by the target resource, according to the following formula:

, где

, Where

- количество используемых RE в целевом ресурсе, в частности, например,

- количество используемых RE PSSCH в части A на ФИГ. 2;

- порядок модуляции; и

- количество слоев.

- the number of used REs in the target resource, in particular, for example,

- the number of used RE PSSCH in part A in FIG. 2;

- modulation order; And

- the number of layers.

и

, используются для расчета E' и E вместо количества RE.[0031] Additionally, similar parameters such as

And

, are used to calculate E' and E instead of the amount of RE.

[0032] Alternatively, E' is a value predefined/(pre)set by the network device protocol, or a value set for DCI downlink control information/SCI direct connection control information/RRC radio resource control.

[0033] Alternatively, the number of REs used to calculate E' refers to the Demodulation Reference Signal (DMRS) configuration/Channel State Information-Reference Signal (CSI-RS)/ phase-tracking reference signal (PTRS). For example, when the DMRS configuration is not set, the number of REs for each PRB is 12; or if a DMRS configuration is specified, the number of REs used for each PRB is represented by the number of REs per symbol minus the number of DMRS REs.

[0034] The method 100 further includes S104: performing resource binding based on deriving a coded bit sequence by rate negotiation, where the length of the coded bit sequence is E or E+E', and E' is the length of the coded bits carried by the target resource.

[0035] Rate matching may be performed prior to this step (the specific processing procedure is described in detail in subsequent embodiments). The output length of the encoded bit sequence by rate matching is E or E+E'. For information regarding the values of E and E', see the description in step S102.

[0036] Of course, encoding processing may alternatively be performed prior to resource binding. If polar coding is used, the coding process is as follows: information multiplexing -> Cyclic Redundancy Check (CRC) connection -> polar coding -> rate matching; or if LDPC encoding is used: CRC connection -> LDPC based schedule selection -> code block segmentation and code block CRC connection -> LDPC encoding -> rate negotiation -> code block concatenation.

[0037] According to the direct connection rate negotiation and resource binding method of the present embodiment, the terminal can, based on the size of the target resource, calculate the length E of the encoded bits carried by the resource in use, excluding the target resource, and based on the derivation of the sequence of encoded bits, perform binding the resource by rate negotiation, wherein the length of the encoded bit sequence is E or E+E', and E' is the length of the encoded bits carried by the target resource. According to this embodiment of the present invention, the calculation of the length E of the encoded bits carried by the resource in use, excluding the target resource, is performed to provide a decision regarding the rate negotiation and resource binding for the direct NR connection. In addition, the target resource in the used resource is taken into account in the forward transmission rate and resource binding negotiation, thereby increasing the demodulation success rate of the direct transmission data and improving the transmission efficiency of the system.

[0038] The following is a detailed description of the resource binding process indicated in S104 of the above embodiment, with reference to several implementations.

[0039] Method 1:

[0040] S104 may include: associating the output of the encoded bit sequence by rate matching to the resource in use from (N+1) symbol to the last symbol of the resource in use in ascending order, and then associating the remaining encoded bit sequence to the resource in use from the first symbol to N characters in ascending order.

[0041] The output length of the encoded bit sequence by rate negotiation is E+E', N refers to the size of the transport block, and the size of the transport block refers to the resource used. In particular, for example, when the target resource is represented by AGC signaling, N=1.

[0042] Additionally, in the resource used in method 1, the binding information of the first N symbols is a repetition of symbol binding information from (N+1) to (2N), in particular, it may be a repetition of information about the rate matching process. Thus, when the target resource is represented by AGC signaling, the first N symbol can be used to adjust the AGC without the need to demodulate the N symbols, thereby increasing the demodulation success rate and improving data transmission efficiency.

[0043] With respect to increasing the demodulation success rate and improving the data transmission efficiency according to the embodiment of the present disclosure, the first N symbols are represented by repeated information, even if the N symbols are not demodulated, all the valid TTI transmission interval information is transmitted to the symbols after the first N symbols without loss of information.

[0044] Of course, if the first N symbols are not used for AGC adjustment, the demodulation success rate can be improved by having such a piece of repeated information.

[0045] All of the above operations are described in the context of the terminal device on the receiving side. Of course, the terminal may selectively perform such operations, depending on whether the first N characters are used for AGC adjustment.

[0046] Method 2:

[0048] S104 may include: associating the output of the encoded bit sequence by rate matching to the resource in use from (M+1) RE resource element to the resource in use symbol in ascending order, and then associating the remaining encoded bit sequence to the resource in use from the first RE to M RE in ascending order.

[0048] The output length of the encoded bit sequence by rate negotiation is E+E', the target resource includes the resource occupied by the PSSCH, and M is the number of REs occupied by the PSSCH. Wherein, the PSSCH is the matching portion between the PSSCH and the PSCCH in the time domain. For example, the PSSCH here is the PSSCH of part A in FIG. 2.

[0049] Additionally, in the method 2 resource used, the binding information of the first M REs is a repetition of the binding information of the (M+1)th RE to (2M), specifically, it may be a repetition of the rate negotiation process information.

[0050] In method 2, resource binding is from the (M+1)th RE. As shown in FIG. 2, if the PSCCH occupies two symbols, the number of REs occupied by the PSSCH in part A is M. In this case, the binding information of the REs occupied by the PSSCH in part A is a repetition of the binding information of the first M PSSCH REs in part B.

[0051] With regard to practical application, for resource anchoring on the PSSCH part B, anchoring is performed by placing a frequency at the head of the queue from the first symbol to the (M+1)th RE, instead of performing resource anchoring from the (N+1)th symbol, as in method 1.

[0052] Method 3:

[0053] S104 may include: linking the output of the encoded bit sequence by rate matching to the used resource from the (N+1)th symbol to the last symbol of the used resource in ascending order, wherein in the used resource symbols with complex values associated with the first N symbols are similar to the complex values associated with the (N+1)th to (2N) symbols.

[0054] The output length of the encoded bit sequence by rate negotiation is E, N refers to the size of the transport block, and the size of the transport block refers to the resource used. In particular, for example, when the target resource is represented by AGC signaling, N=1.

[0055] Method 4:

[0056] S104 may include: associating the output of the encoded bit sequence by rate matching to the resource in use from the (M+1)th RE to the last RE of the resource in use in ascending order, where in the resource in use symbols with complex values associated with the first M RE, are similar to the complex values associated with RE from (M+1)th to (2M).

[0057] The output length of the encoded bit sequence by rate negotiation is E, the target resource includes the resource occupied by the PSSCH, and M is the number of REs occupied by the PSSCH. Wherein, the PSSCH is the matching portion between the PSSCH and the PSCCH in the time domain. For example, the PSSCH here is the PSSCH of part A in FIG. 2.

[0058] Method 5:

[0059] S104 may include: associating the output of the sequence of encoded bits by matching the transmission rate to the resource in use from the first symbol to the last symbol of the resource in use in ascending order.

[0060] The output length of the encoded bit sequence by rate negotiation is E+E', N refers to the size of the transport block, and the size of the transport block refers to the resource used. In particular, for example, when the target resource is represented by AGC signaling, N=1.

[0061] In addition, in the resource used in method 5, the binding information of the first N symbols is a repetition of the (N+1)th to (2N) symbol binding information, in particular, it may be a repetition of the rate negotiation process information. Details of the implementation process will be described later.

[0062] Additionally, in the method 5 resource used, the binding information of the first M REs is a repetition of the binding information of the (M+1)th RE to (2M), specifically, it may be a repetition of the rate negotiation process information. Details of the implementation process will be described later.

[0063] Method 6:

[0064] S104 may include: associating the output of the sequence of encoded bits by matching the transmission rate to the resource in use from the first symbol to the last symbol of the resource in use in ascending order.

[0065] The number of REs in use on the first symbol is half of the total number of REs on the first symbol, and the output length of the encoded bit sequence by rate negotiation is E.

[0066] In a further embodiment, the first symbol, starting with an odd/even RE, every second RE is represented by one resource in use, i.e. on the first symbol, resource binding is performed on every second RE in the frequency domain.

[0067] According to method 6, the target resource may be AGC signaling, and the AGC occupies the first half-character of the resource being used.

[0068] In a further embodiment according to methods 1 and 2, the output length of the coded bit sequence by rate matching is E+E'. According to method 1, the binding information of the first N symbols is a repetition of the symbol binding information from (N+1)th to (2N). According to method 2, the binding information of the first M REs is a repetition of the binding information of REs from (M+1)th to (2M). To implement repetition of information before performing resource binding based on outputting a sequence of encoded bits, the method further includes the following encoding processing process:

in the case of polar coding, outputting a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=0 of the encoded bits in the ring buffer at rate matching, so as to generate a sequence with a length of E'+E (which is abbreviation of the above-described sequence of encoded bits), while the sequence of length E' is after the sequence of length E; or

in the case of polar coding, outputting a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=A-E of the encoded bits in the ring buffer at rate matching, so as to generate a sequence with a length of E'+E, whereby the sequence of length E' is after the sequence of length E; Where

A is the length of the ring buffer, A is obtained by calculation based on E, and k represents the output start position of the encoded bits.

[0069] In a further embodiment according to the above methods 1 and 2, for realizing repetition information before performing resource binding based on outputting a sequence of encoded bits, the method further includes the following encoding processing process:

in the case of LDPC coding, deriving a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the starting position of redundancy version information in the ring buffer at rate matching, so as to perform generation of a sequence with a length of E'+E, wherein the sequence of length E' is after the sequence of length E.

[0070] In a further embodiment according to the above methods 1 and 2, before performing resource binding based on the output of the encoded bit sequence, the method further includes the following encoding processing process:

in the case of polar coding, outputting a subsequence with the length of the first sequence E from the position k=A-E of the encoded bits in the ring buffer at rate matching, and outputting the subsequence with the length of the second sequence E' from the position k=0 of the encoded bits, so as to generate a sequence with the length E'+E, where the subsequence of length E' is after the subsequence of length E; or

in the case of polar coding, outputting a subsequence with the length of the first sequence E from position k=0 of the encoded bits in the ring buffer at rate matching, and outputting the subsequence with the length of the second sequence E' starting from position k=E of the encoded bits, so as to perform sequence generation with length E'+E, where the subsequence of length E' is after the subsequence of length E; or

in the case of polar coding, the output of a subsequence with the length of the first sequence E from the position k=E mod A of the encoded bits in the ring buffer at rate matching and the output of the subsequence with the length of the second sequence E' from the position k=(E mod A)+E of the encoded bits, so as to generate a sequence of length E'+E, where the subsequence of length E' comes after the subsequence of length E.

[0071] A is the length of the ring buffer, A is obtained by calculation based on E, k represents the output start position of the encoded bits, and mod is the modulo operation.

[0072] In a further embodiment according to the above methods 1 and 2, for realizing repetition information before performing resource binding based on the output of a sequence of encoded bits, the method further includes the following encoding processing process:

in the case of LDPC coding, outputting a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the start position m=E of the redundancy in the ring buffer in the rate matching, so as to perform generation of a sequence with a length of E'+E, wherein the sequence of length E' is after the sequence of length E; or

in the case of LDPC encoding, deriving a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the starting position m=E mod A redundancy in the ring buffer at rate matching, so as to perform generation of a sequence with a length of E'+E, when In this case, the sequence of length E' is after the sequence of length E.

[0073] A is the length of the ring buffer, A is obtained by calculation based on E, m represents the start position of the output, and mod is the modulo operation.

[0074] In a further embodiment according to method 5, before performing resource binding based on deriving a sequence of encoded bits by rate negotiation, in order to realize repetition of information in the rate negotiation process, the method further includes the following steps:

in the case of polar coding, outputting a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=0 of the encoded bits in the ring buffer at rate matching, so as to generate a sequence with a length of E'+E, wherein the sequence of length E' comes before a sequence of length E; or

in the case of polar coding, outputting a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=A-E of the encoded bits in the ring buffer at rate matching, so as to generate a sequence with a length of E'+E, whereby the sequence of length E' comes before a sequence of length E.

[0075] A is the length of the ring buffer, A is obtained by calculation based on E, and k represents the output start position of the encoded bits.

[0076] In a further embodiment according to method 5, before performing resource binding based on deriving a sequence of encoded bits by rate negotiation, in order to realize repetition of information in the rate negotiation process, the method further includes the following steps:

in the case of LDPC coding, deriving a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the starting position of redundancy version information in the ring buffer at rate matching, so as to perform generation of a sequence with a length of E'+E, wherein the sequence of length E' comes before a sequence of length E.

[0077] According to the above methods 1-6, in addition to performing resource binding based on deriving a sequence of encoded bits by rate negotiation, the next step may also include: determining a character start position or RE start position for resource binding based on a number configuration, that is, selecting one from methods 1-6 based on number configuration.

[0078] For example, if the SCS of the number is 15 kHz, given that the AGC may occupy the first half of the resource used, method 6 can be used; otherwise, when the SCS is not 15 kHz, other methods can be used, such as 1 and 2.

[0079] According to the above methods 1-6, in addition to performing resource binding based on deriving a sequence of encoded bits by rate negotiation, the next step may also include: determining a symbol start position or an RE start position for resource binding based on an RV value, that is, selecting one method based on the RV value.

[0080] For example, methods 1 and 2 can be used for RV0/RV1, and binding information is obtained sequentially from the start position of RV0/RV1 in the ring buffer.

[0081] For example, method 5 can be used for RV3/RV2, and binding information is obtained sequentially from the start position of RV3/RV2 in the ring buffer.

[0082] In addition, different repetition processing may be performed for different redundancy versions based on whether rate negotiation is enabled with a limited LBRM buffer.

For example:

if LBRM is enabled, binding is performed sequentially from the second symbol to the last used symbol RV0, RV1 or RV2 (ie in case of N=1 by method 1); and binding is performed sequentially from the first symbol of RV3 (method 5); or

if LBRM is not enabled, binding is performed sequentially from the first character to the last character of RV0 or RV1 (i.e. method 5); and binding is performed sequentially from the second symbol of RV2 or RV3 (ie, in the case where N=1 in method 1).

[0083] In order to describe in detail the rate negotiation and resource binding method presented in the above embodiment of the present invention, reference is made to several specific embodiments below.

[0084] Embodiment 1 (Embodiment 1 is divided into three sub-options for description).

[0085] Sub-option 1: The tag turns on the PSCCH to be transmitted, and performs rate negotiation and resource binding according to the following steps.

[0086] 1. In the case of a one-symbol AGC (target resource), the end device on the transmission side calculates the length E of the encoded bits carried by the resource in use with the exception of one-symbol AGC using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[0087] 2. Performing CRC connection, code block segmentation, and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[0088] 3. After polar encoding, perform sub-block interleaving, where the sequence length after interleaving is A.

[0089] 4. Entering a sequence of length A into the ring buffer and determining E as the length of the sequence after rate matching.

[0090] 5. Performing bit selection for SCI based on the DCI rate negotiation process.

[0091] 6. Performing optional encryption and modulation to generate complex valued symbols, wherein the generated complex valued symbols are tied to the resource in use from the second symbol to the last symbol in ascending order according to the principle of placing time/frequency at the head of the queue. A symbol with complex values attached to the first symbol is the same as a symbol with complex values attached to the second symbol.

[0092] In this embodiment, retry processing is performed when the resource is bound, i. e. the symbol with complex values attached to the first symbol is the same as the symbol with complex values attached to the second symbol. Thus, the first symbol for the receiving terminal can be used for AGC adjustment, and the second symbol and subsequent symbols for data demodulation, thereby increasing the demodulation success rate and improving data transmission efficiency. As for the principles for obtaining specific effects, see the description below.

[0093] Sub-option 2: The tag turns on the PSSCH to be transmitted, and performs rate negotiation and resource binding according to the following steps.

[0094] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[0095] 2. Performing CRC connection, code block segmentation, and LDPC coding on the input of the PSSCH.

[0096] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[0097] 4. Entering a sequence of length A into the ring buffer and determining E as the length of the sequence after rate matching.

[0098] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process and output a length E sequence.

[0099] 6. Performing optional on-sequence ciphering and modulation to perform generation of complex-valued symbols, wherein the generated complex-valued symbols are tied from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the beginning of the queue. A symbol with complex values attached to the first symbol is the same as a symbol with complex values attached to the second symbol.

[00100] In this embodiment, retry processing is performed when the resource is bound, i. e. the symbol with complex values attached to the first symbol is the same as the symbol with complex values attached to the second symbol. Thus, the first symbol for the receiving terminal can be used for AGC adjustment, and the second symbol and subsequent symbols for data demodulation, thereby increasing the demodulation success rate and improving data transmission efficiency.

[00101] Sub-option 3: The tag turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00102] 1. If the number of PSCCH symbols is 2, see FIG. 2. The number of RE PSSCH that matches the PSCCH in the time domain is M. The terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, which excludes the RE PSSCH that matches the PSCCH in the time domain, i.e. the length E of encoded bits carried by the RE part B in FIG. 2:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением RE PSSCH, совпадающего с PSCCH во временной области,

- порядок модуляции и

- количество слоев.

- number of used REs in the scheduled resource with the exception of the PSSCH RE matching the PSCCH in the time domain,

- modulation order and

- the number of layers.

[00103] 2. Performing CRC connection, code block segmentation, and LDPC coding on the input of the PSSCH.

[00104] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[00105] 4. Entering a sequence of length A into the ring buffer and determining E as the length of the sequence after rate matching.

[00106] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process and output a length E sequence.

[00107] 6. Performing optional sequence-based ciphering and modulation to perform complex-valued symbol generation, wherein the generated complex-valued symbols are anchored from (M+1) RE to the last RE on the last symbol in ascending order according to the frequency-first principle queue, and time on the next position. The complex-valued symbol associated with the first M REs is the same as the complex-valued symbol associated with REs from (M+1) to (2M).

[00108] Embodiment 2 (Embodiment 2 is divided into four sub-options for description).

[00109] Sub-option 1: The terminal turns on the PSCCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00110] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00111] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00112] According to this embodiment, the sequence output after rate matching is E+E'.

[00113] 2. Performing CRC connection, code block segmentation and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[00114] 3. After polar encoding, perform sub-block interleaving where the length of the sequence after interleaving is A.

[00115] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00116] 5. If shortening is used to select bits, then

the sequence from k=A-E to A is bound to the bit positions of the sequence output from 0 to E-1; And

a sequence with length E' from k=A is tied to bit positions of the sequence output from E to E+E'-1; Where

a sequence with length E+E' is generated after negotiation.

[00117] 6. Performing optional on-sequence encryption and modulation to perform generation of complex valued symbols, wherein the generated complex valued symbols are tied from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue, and then the rest of the information is tied to the first character.

[00118] Sub-option 2: The tag turns on the PSCCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00119] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the one-character AGC,

- modulation order and

- the number of layers.

[00120] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00121] According to this embodiment, the sequence output after rate matching is E+E'.

[00122] 2. Performing CRC connection, code block segmentation, and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[00123] 3. After polar encoding, perform sub-block interleaving where the length of the sequence after interleaving is A.

[00124] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00125] 5. If puncturing is used to select bits, then

the sequence from k=0 to E-1 is bound to the bit positions of the sequence output from 0 to E-1; And

a sequence with length E' from k=0 is tied to bit positions of the sequence output from E to E+E'-1; Where

a sequence with length E+E' is generated after negotiation.

[00126] 6. Performing optional on-sequence encryption and modulation to perform complex value symbol generation, wherein the generated complex value symbols are tied from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue, and the remaining the sequence binds to the first character.

[00127] Sub-option 3: The tag turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00128] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00129] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00130] According to this embodiment, the sequence output after rate matching is E+E'.

[00131] 2. Performing CRC connection, code block segmentation, and LDPC coding on the input of the PSSCH.

[00132] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[00133] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00134] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process, wherein starting from the starting position of the currently transmitted value RV, a sequence of length E is mapped to sequence output bit positions 0 to E-1.

For example:

(a) if RV=0, the sequence k=0 to E-1 is mapped to bit positions of the sequence output 0 to E-1; and a sequence of length E' from k=0 is tied to the bit positions of the output sequence from E to E+E'-1;

(b) if RV=1, the sequence k=A/4 to A/4+E-1 is mapped to the sequence output bit positions 0 to E-1; and a sequence of length E' from k=A/4 is tied to bit positions of the output sequence from E to E+E'-1;

(c) if RV=2, the sequence k=A/2 to A/2+E-1 is mapped to the sequence output bit positions 0 to E-1; and a sequence of length E' from k=A/2 is tied to bit positions of the output sequence from E to E+E'-1; And

(d) if RV=3, the sequence 3A/4 to 3A/4+E-1 is mapped to bit positions of the sequence output 0 to E-1; and a sequence of length E' from E-1 is mapped to bit positions of the output sequence from E to E+E'-1.

[00135] 6. Performing optional on-sequence encryption and modulation to perform generation of complex valued symbols, wherein the generated complex valued symbols are tied from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue, and the remaining the sequence binds to the first character.

[00136] Sub-option 4: The tag turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00137] 1. The number of PSCCH symbols is 2, the number of PSSCH REs (see PSCCH in part A of FIG. 2) that is the same as the PSCCH in the time domain is M. The transmission side terminal calculates the length E of encoded bits carried resource in use, which excludes the RE PSSCH matching the PSCCH in the time domain, i. e. the length E of encoded bits carried by the RE part B in FIG. 2:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением RE PSSCH, совпадающего с PSCCH во временной области,

- порядок модуляции и

- количество слоев.

- number of used REs in the scheduled resource with the exception of the PSSCH RE matching the PSCCH in the time domain,

- modulation order and

- the number of layers.

[00138] 2. Performing CRC connection, code block segmentation, and LDPC coding on the PSSCH input.

[00139] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[00140] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the sequence length after rate matching.

[00141] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process, wherein starting from the starting position of the currently transmitted value RV, a sequence of length E is mapped to sequence output bit positions 0 to E-1.

For example:

(a) if RV=0, the sequence k=0 to E-1 is mapped to bit positions of the sequence output 0 to E-1; and a sequence of length E' from k=0 is tied to the bit positions of the output sequence from E to E+E'-1;

(b) if RV=1, the sequence k=A/4 to A/4+E-1 is mapped to the sequence output bit positions 0 to E-1; and a sequence of length E' from k=A/4 is tied to bit positions of the output sequence from E to E+E'-1;

(c) if RV=2, the sequence k=A/2 to A/2+E-1 is mapped to the sequence output bit positions 0 to E-1; and a sequence of length E' from k=A/2 is tied to bit positions of the output sequence from E to E+E'-1; And

(d) if RV=3, the sequence 3A/4 to 3A/4+E-1 is mapped to bit positions of the sequence output 0 to E-1; and a sequence of length E' from E-1 is mapped to bit positions of the output sequence from E to E+E'-1.

[00142] 6. Performing optional on-sequence encryption and modulation to perform generation of complex-valued symbols, wherein the generated complex-valued symbols are tied from (M+1) RE to the last allocated RE in ascending order according to the principle of placing time/frequency at the beginning queue, and then the remaining information is tied to the first M REs according to the principle of placing time/frequency at the head of the queue. The information associated with the first M REs is the same as the information associated with REs from (M+1) to (2M).

[00143] In this embodiment, retry processing is performed when the resource is bound, i. the information associated with the first character is the same as the information associated with the second character. Thus, the first symbol for the receiving terminal can be used for AGC adjustment, and the second symbol and subsequent symbols for data demodulation, thereby increasing the demodulation success rate and improving data transmission efficiency.

[00144] In an alternative embodiment, retry processing is performed at resource binding and the information associated with the first M REs is the same as the information associated with REs from (M+1) to (2M). Thus, when power boosting is performed for the PSCCH, information about the repeat with a smaller power spectrum is on the PSSCH M RE, which is the same as the PSCCH in the time domain. REs after the first M REs can be used to demodulate data, thereby increasing the demodulation success rate and improving data transmission efficiency.

[00145] Embodiment 3 (Embodiment 3 is divided into four sub-options for description).

[00146] Sub-option 1: The terminal turns on the PSCCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00147] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00148] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00149] According to this embodiment, the sequence output after rate matching is E+E'.

[00150] 2. Performing CRC connection, code block segmentation, and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[00151] 3. After polar encoding, perform sub-block interleaving where the length of the sequence after interleaving is A.

[00152] 4. Entering a sequence of length A into the ring buffer.

[00153] 5. If shortening is used to select bits, then the sequence k=A-E to A is mapped to the output bit positions of the sequence E' to E+E'-1; And

a sequence with length E' from k=A is tied to bit positions of the sequence output from 0 to E'-1; where the sequence with length E+E' is generated after rate matching.

[00154] 6. Performing optional on-sequence ciphering and modulation to generate complex valued symbols, wherein the generated complex valued symbols are tied from the first symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue.

[00155] Sub-option 2: The tag turns on the PSCCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00156] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00157] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00158] According to this embodiment, the sequence output after rate matching is E+E'.

[00159] 2. Performing CRC connection, code block segmentation, and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[00160] 3. After polar encoding, perform sub-block interleaving where the sequence length after interleaving is A.

[00161] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the sequence length after rate matching.

[00162] 5. If puncturing is used to select bits,

the sequence k=0 to E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; And

a sequence with length E' from k=0 is tied to bit positions of the sequence output from 0 to E'-1; Where

a sequence with length E+E' is generated after negotiation.

[00163] 6. Performing optional on-sequence ciphering and modulation to generate complex valued symbols, wherein the generated complex valued symbols are tied from the first allocated resource symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue.

[00164] Sub-option 3: The tag turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00165] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00166] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00167] According to this embodiment, the sequence output after rate matching is E+E'.

[00168] 2. Performing CRC connection, code block segmentation, and LDPC coding on the input of the PSSCH.

[00169] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[00170] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00171] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process, wherein starting from the starting position of the currently transmitted value RV, a sequence of length E is mapped to sequence output bit positions E' to E+E'-1 .

For example:

(a) if RV=0, the sequence k=0 to E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=0 is tied to bit positions of the sequence output from 0 to E'-1;

(b) if RV=1, the sequence k=A/4 to A/4+E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=A/4 is tied to bit positions of the sequence output from 0 to E'-1;

(c) if RV=2, the sequence k=A/2 to A/2+E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=A/2 is tied to bit positions of the sequence output from 0 to E'-1; And

(d) if RV=3, the sequence k=3A/4 to 3A/4+E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=3A/4 is tied to bit positions of the sequence output from 0 to E'-1.

[00172] 6. Performing optional on-sequence ciphering and modulation to perform generation of complex-valued symbols, wherein the generated complex-valued symbols are tied from the first symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue.

[00173] Sub-option 4: The tag turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00174] 1. The number of PSCCH symbols is 2, the number of PSSCH REs (see PSCCH in part A of FIG. 2) which is the same as the PSCCH in the time domain is M. The transmission side terminal calculates the length E of encoded bits carried resource in use, which excludes the RE PSSCH matching the PSCCH in the time domain, i. e. the length E of encoded bits carried by the RE part B in FIG. 2:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением RE PSSCH, совпадающего с PSCCH во временной области,

- порядок модуляции и

- количество слоев.

- number of used REs in the scheduled resource with the exception of the PSSCH RE matching the PSCCH in the time domain,

- modulation order and

- the number of layers.

[00175] 2. Performing CRC connection, code block segmentation, and LDPC coding on the PSSCH input.

[00176] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[00177] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00178] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process, wherein starting from the starting position of the currently transmitted value RV, a sequence of length E is mapped to sequence output bit positions E' to E+E'-1 .

For example:

(a) if RV=0, the sequence k=0 to E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=0 is tied to bit positions of the sequence output from 0 to E'-1;

(b) if RV=1, the sequence k=A/4 to A/4+E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=A/4 is tied to bit positions of the sequence output from 0 to E'-1;

(c) if RV=2, the sequence k=A/2 to A/2+E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=A/2 is tied to bit positions of the sequence output from 0 to E'-1; And

(d) if RV=3, the sequence k=3A/4 to 3A/4+E-1 is mapped to the output bit positions of the sequence E' to E+E'-1; and a sequence of length E' from k=3A/4 is tied to bit positions of the sequence output from 0 to E'-1.

[00179] 6. Performing optional on-sequence ciphering and modulation to generate complex valued symbols, wherein the generated complex valued symbols are tied from the first symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue.

[00180] In this embodiment, retry processing is performed when the resource is bound, i. the symbol with complex values attached to the first symbol is the same as the symbol with complex values attached to the second symbol. Thus, the first symbol for the receiving terminal can be used for AGC adjustment, and the second symbol and subsequent symbols for data demodulation, thereby increasing the demodulation success rate and improving data transmission efficiency.

[00181] In an alternative embodiment, retry processing is performed at resource binding, and the information associated with the first M REs is the same as the information associated with the (M+1)th to (2M) REs. Thus, when power boosting is performed for the PSCCH, information about the repeat with a smaller power spectrum is on the PSSCH M RE, which is the same as the PSCCH in the time domain. REs after the first M REs can be used to demodulate data, thereby increasing the demodulation success rate and improving data transmission efficiency.

[00182] Embodiment 4

[00183] The terminal turns on the PSCCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00184] 1. Determining the number of AGC symbols based on the relationship between the number and the AGC symbols.

[00185] In particular, for example, in the case of 15 kHz, the AGC contains 0.5 symbols; otherwise, AGC contains 1 character. According to this embodiment, assuming the number is 15 kHz, the AGC contains 0.5 symbols.

[00186] 2. The end device on the transmission side calculates the length E of the encoded bits carried by the resource in use with the exception of the half-character AGC using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением полусимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the half-character AGC,

- modulation order and

- the number of layers.

[00187] According to this embodiment, the sequence output after rate matching is E.

[00188] 3. Performing CRC connection, code block segmentation, and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[00189] 4. After polar encoding, perform sub-block interleaving where the sequence length after interleaving is A.

[00190] 5. Entering a sequence of length A into the ring buffer.

[00191] 6. Perform bit selection based on the DCI rate negotiation process.

[00192] 7. Performing possible encryption and modulation to perform complex value symbol generation, whereby if the number is 15 kHz, the generated complex value symbols are tied from the first symbol of the resource being used to the last allocated symbol in ascending order according to the time allocation principle/ frequencies at the beginning of the queue; and on the first symbol, every second RE in the frequency domain represents one resource in use, and the AGC occupies the first half-symbol of the resource in use.

[00193] Embodiment 5

[00194] The terminal turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00195] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the one-character AGC,

- modulation order and

- the number of layers.

[00196] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00197] According to this embodiment, the sequence output after rate matching is E+E'.

[00198] 2. Performing CRC connection, code block segmentation, and LDPC coding on the input of the PSSCH.

[00199] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[00200] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00201] 5. Performing rate negotiation according to the PUSCH/PDSCH rate negotiation process, wherein starting from the starting position of the currently transmitted value RV, a sequence of length E is mapped to bit positions of the sequence output from 0 to E-1 and a sequence of length E binds to bit positions of the sequence output from E' to E+E'-1 to obtain a sequence of length E+E'. Possible encryption is performed on a sequence of length E+E', and modulation is performed to generate symbols with complex values. Based on the RV version, the binding can be from the second character or from the first character.

[00202] (a) If RV=0, the generated symbols with complex values are mapped from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue, and the remaining sequence is mapped to the first symbol.

[00203] (b) If RV=1, the generated symbols with complex values are mapped from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue, and the remaining sequence is mapped to the first symbol.

[00204] (c) If RV=2, the generated symbols with complex values are tied from the first symbol to the last allocated symbol in ascending order according to the time/frequency principle at the head of the queue.

[00205] (d) If RV=3, the generated symbols with complex values are tied from the first symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue.

[00206] Embodiment 6 (Embodiment 6 is divided into four sub-options for description).

[00207] Sub-option 1: The tag turns on the PSCCH to be transmitted, and performs rate negotiation and resource binding according to the following steps.

[00208] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00209] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00210] According to this embodiment, the sequence output after rate matching is E+E'.

[00211] 2. Performing CRC connection, code block segmentation, and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[00212] 3. After polar encoding, perform sub-block interleaving where the length of the sequence after interleaving is A.

[00213] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00214] 5. If shortening is used to select bits, then

the sequence from k=A-E to A is bound to the bit positions of the sequence output from 0 to E-1; And

a sequence with length E' from k=0 is tied to bit positions of the sequence output from E to E+E'-1; Where

a sequence with length E+E' is generated after negotiation.

[00215] 6. Performing optional on-sequence encryption and modulation to perform generation of complex valued symbols, wherein the generated complex valued symbols are tied from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue, and the remaining the sequence binds back to the first character.

[00216] Sub-option 2: The tag turns on the PSCCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00217] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00218] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00219] According to this embodiment, the sequence output after rate matching is E+E'.

[00220] 2. Performing CRC connection, code block segmentation, and polar coding on the PSCCH input, wherein the polar coding output code length A is calculated based on the value of E in the polar coding, and A in this case is the length of the ring buffer.

[00221] 3. After polar encoding, perform sub-block interleaving where the sequence length after interleaving is A.

[00222] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the sequence length after rate matching.

[00223] 5. If puncturing is used to select bits,

the sequence from k=0 to E-1 is bound to the bit positions of the sequence output from 0 to E-1; And

a sequence with length E' from k=E is tied to bit positions of the sequence output from E to E+E'-1; Where

a sequence with length E+E' is generated after negotiation.

[00224] 6. Performing optional on-sequence encryption and modulation to perform generation of complex valued symbols, wherein the generated complex valued symbols are tied from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the head of the queue, and the remaining the sequence binds back to the first character.

[00225] Sub-Option 3: The tag turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00226] 1. In the case of single symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00227] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00228] According to this embodiment, the sequence output after rate matching is E+E'.

[00229] 2. Performing CRC connection, code block segmentation, and LDPC coding on the input of the PSSCH.

[00230] 3. After LDPC encoding, output a sequence with length A.

[00231] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the length of the sequence after rate matching.

[00232] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process, wherein starting from the starting position of the currently transmitted value RV, a sequence of length E+E' is mapped to sequence output bit positions 0 to E+E' -1. For example:

(a) if RV=0, the sequence k=0 to E+E'-1 is mapped to the output bit positions of the sequence 0 to E+E'-1;

(b) if RV=1, the sequence k=A/4 to A/4+E+E'-1 is mapped to the output bit positions of the sequence 0 to E+E'-1;

(c) if RV=2, the sequence k=A/2 to A/2+E+E'-1 is mapped to the sequence output bit positions 0 to E+E'-1; And

(d) if RV=3, the sequence k=3A/4 to 3A/4+E+E'-1 is mapped to the output bit positions of the sequence 0 to E+E'-1.

[00233] 6. Performing optional on-sequence ciphering and modulation to perform generation of complex valued symbols, wherein the generated complex valued symbols are tied from the second symbol to the last allocated symbol in ascending order according to the principle of placing time/frequency at the beginning of the queue, and then the remaining information is tied back to the first character.

[00234] Sub-option 4: The tag turns on the PSSCH to be transmitted and performs rate negotiation and resource binding according to the following steps.

[00235] 1. The number of PSCCH symbols is 2, the number of PSSCH REs (see PSCCH in part A of FIG. 2) that is the same as the PSCCH in the time domain is M. The transmission side terminal calculates the length E of encoded bits carried resource in use, which excludes the RE PSSCH matching the PSCCH in the time domain, i. e. the length E of encoded bits carried by the RE part B in FIG. 2:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением RE PSSCH, совпадающего с PSCCH во временной области,

- порядок модуляции и

- количество слоев.

- number of used REs in the scheduled resource with the exception of the PSSCH RE matching the PSCCH in the time domain,

- modulation order and

- the number of layers.

[00236] 2. Performing CRC connection, code block segmentation, and LDPC coding on the input of the PSSCH.

[00237] 3. After LDPC encoding, output a sequence with length A, where A is the length of the ring buffer.

[00238] 4. Entering a sequence of length A into the ring buffer and determining E+E' as the sequence length after rate matching.

[00239] 5. Perform rate negotiation according to the PUSCH/PDSCH rate negotiation process, wherein starting from the starting position of the currently transmitted value RV, a sequence of length E+E' is mapped to sequence output bit positions 0 to E+E' -1. For example:

(a) if RV=0, the sequence k=0 to E+E'-1 is mapped to the output bit positions of the sequence 0 to E+E'-1;

(b) if RV=1, the sequence k=A/4 to A/4+E+E'-1 is mapped to the output bit positions of the sequence 0 to E+E'-1;

(c) if RV=2, the sequence k=A/2 to A/2+E+E'-1 is mapped to the sequence output bit positions 0 to E+E'-1; And

(d) if RV=3, the sequence k=3A/4 to 3A/4+E+E'-1 is mapped to the output bit positions of the sequence 0 to E+E'-1.

[00240] 6. Performing optional on-sequence ciphering and modulation to perform complex-value symbol generation, wherein the generated complex-value symbols are anchored from (M+1) RE to the last RE on the last allocated symbol in ascending order according to the time allocation principle/ frequency at the head of the queue, and then the remaining information is tied to the first M REs according to the principle of placing time/frequency at the head of the queue.

[00241] Embodiment 7

[00242] The terminal includes a PSSCH to be transmitted, and contains a configured slot pool for transmitting a large transport block, and performs rate negotiation and resource binding according to the following steps.

[00243] 1. In the case of single-symbol AGC, the terminal on the transmission side calculates the length E of the encoded bits carried by the resource in use, excluding single-symbol AGC, using the following formula:

, где

, Where

- количество используемых RE в запланированном ресурсе с исключением односимвольной AGC,

- порядок модуляции и

- количество слоев.

is the number of REs in use in the scheduled resource, excluding the single-character AGC,

- modulation order and

- the number of layers.

[00244] The length E' of the encoded bits carried by a one-symbol AG is calculated by the following formula:

, где

, Where

- количество используемых RE с односимвольной AGC,

- порядок модуляции и

- количество слоев.

- the number of used REs with one-character AGC,

- modulation order and

- the number of layers.

[00245] According to this embodiment, the sequence output after rate matching is E+E'.

[00246] 2. For the subsequent steps of this embodiment, see sub-option 3 of embodiment 2.

[00247] In this embodiment, the slot aggregation configuration is performed, and generally there is an AGC symbol at the start position of each layer, similar to the processing method of the previous embodiment.

[00248] Alternatively, if the slot merge is considered to be scheduled, the AGC symbol is provided only at the start position of the slot merge.

[00249] The following describes in detail the rate negotiation and direct connection resource binding method presented in the embodiments of the present invention with reference to FIG. 1-2. The following is a detailed description of a terminal device according to one embodiment of the present application with reference to FIG. 3.

[00250] FIG. 3 is a schematic diagram of a terminal device according to one embodiment of the present invention. As shown in FIG. 3, terminal 300 includes:

a computing module 302, configured to calculate, based on the size of the target resource, the length E of encoded bits carried by the resource in use, excluding the target resource; And

a resource binding module 304, configured to perform resource binding based on the output of the encoded bit sequence by rate negotiation, where the length of the encoded bit sequence is E or E+E', and E' is the length of the encoded bits carried by the target resource.

[00251] According to this embodiment of the present invention, the terminal can, based on the size of the target resource, calculate the length E of the encoded bits carried by the resource in use, excluding the target resource, and based on the output of the sequence of encoded bits, perform resource binding by rate negotiation, while the length of the encoded bit sequence is E or E+E', and E' is the length of the encoded bits carried by the target resource. According to this embodiment of the present invention, the calculation of the length E of the encoded bits carried by the resource in use, excluding the target resource, is performed to provide a decision regarding the rate negotiation and resource binding for the direct NR connection. In addition, the target resource in the used resource is taken into account in the forward transmission rate and resource binding negotiation, thereby increasing the demodulation success rate of the direct transmission data and improving the transmission efficiency of the system.

[00252] Further, according to one embodiment, the target resource includes:

the resource occupied by the AGC, or

the resource occupied by the PSSCH, wherein the resource occupied by the PSSCH and the resource occupied by the PSCCH are the same in the time domain.

[00253] Additionally, in one embodiment, the resource binding module 304 may be specifically designed to:

binding the output of the coded bit sequence by matching the rate to the resource in use from (N+1) symbol to the last symbol of the resource in use in ascending order, and then binding the remaining sequence of coded bits to the resource in use from the first symbol to N symbols in ascending order.

[00254] The output length of the encoded bit sequence by rate negotiation is E+E', N refers to the size of the transport block, and the size of the transport block refers to the resource used.

[00255] Additionally, in one embodiment, the resource binding module 304 may be specifically designed to:

binding the output of the encoded bit sequence by matching the rate to the resource in use from (M+1) RE resource element to the used resource symbol in ascending order, and then binding the remaining encoded bit sequence to the resource in use from the first RE to M RE in ascending order.

[00256] The output length of the encoded bit sequence by rate negotiation is E+E', the target resource includes the resource occupied by the PSSCH, and M is the number of REs occupied by the PSSCH.

[00257] Additionally, in one embodiment, the resource binding module 304 may be specifically designed to:

binding the output of the encoded bit sequence by matching the bit rate to the resource in use from (N+1) symbol to the last symbol of the resource in use in ascending order, wherein in the resource in use the symbols with complex values associated with the first N symbols are the same as the complex values associated with to characters from (N+1) to (2N).

[00258] The output length of the encoded bit sequence by rate negotiation is E, N refers to the size of the transport block, and the size of the transport block refers to the resource used.

[00259] Additionally, in one embodiment, the resource binding module 304 may be specifically designed to:

binding the output of the encoded bit sequence by matching the rate to the resource in use from (M+1) RE to the last RE of the resource in use in ascending order, where in the resource in use the symbols with complex values associated with the first M REs are the same as the complex values associated with to RE from (M+1) to (2M).

[00260] The output length of the encoded bit sequence by rate negotiation is E, the target resource includes the resource occupied by the PSSCH, and M is the number of REs occupied by the PSSCH.

[00261] Additionally, in one embodiment, the resource binding module 304 may be specifically designed to:

binding the output of the encoded bit sequence by matching the bit rate to the resource in use from the first symbol to the last symbol of the resource in use in ascending order.

[00262] The output length of the encoded bit sequence by rate negotiation is E+E', N refers to the size of the transport block, and the size of the transport block refers to the resource used.

[00263] Additionally, in one embodiment, the resource binding module 304 may be specifically designed to:

binding the output of the encoded bit sequence by matching the bit rate to the resource in use from the first symbol to the last symbol of the resource in use in ascending order.

[00264] The number of REs in use on the first symbol is half the total number of REs on the first symbol, and the output length of the encoded bit sequence by rate negotiation is E.

[00265] Additionally, according to one embodiment

in the resource used, the first N character binding information is a repetition of (N+1) to (2N) character binding information; or

in the resource used, the binding information of the first M REs is a repetition of the binding information REs from (M+1) to (2M).

[00266] Additionally, in one embodiment, end device 300 also includes a rate matching module for:

in the case of polar coding, to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=0 of the encoded bits, so as to perform the generation of a sequence with a length of E'+E, with a sequence of length E' after the sequence length E; or

in the case of polar coding, to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=A-E of the encoded bits in the ring buffer at rate matching, so as to generate a sequence with a length of E'+E, while the sequence of length E' is after the sequence of length E; or

A is the length of the ring buffer, A is obtained by calculation based on E, and k represents the output start position of the encoded bits.

[00267] Additionally, in one embodiment, end device 300 also includes a rate matching module for:

in the case of LDPC encoding to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the starting position of the redundancy version information, so as to perform the generation of a sequence with a length of E'+E, with a sequence of length E' after the sequence length E.

[00268] Additionally, in one embodiment, end device 300 also includes a rate matching module for:

in the case of polar coding, to output a subsequence with the length of the first sequence E from the position k=A-E of the encoded bits and output a subsequence with the length of the second sequence E' from the position k=0 of the encoded bits, so as to perform the generation of a sequence with the length E'+E, where the subsequence of length E' is after the subsequence of length E; or

in the case of polar coding, to output a subsequence with the length of the first sequence E from the position k=0 of the encoded bits and output a subsequence with the length of the second sequence E' from the position k=E of the encoded bits, so as to generate a sequence with the length E'+E, where the subsequence of length E' is after the subsequence of length E; or

in the case of polar coding, to output a subsequence with the length of the first sequence E from the position k=E mod A of the encoded bits, and output a subsequence with the length of the second sequence E' from the position k=(E mod A)+E of the encoded bits, so as to perform sequence generation with length E'+E, where the subsequence of length E' is after the subsequence of length E; Where

A is the length of the ring buffer, A is obtained by calculation based on E, k represents the output start position of the encoded bits, and mod is the modulo operation.

[00269] Additionally, in one embodiment, end device 300 also includes a rate matching module for:

in the case of LDPC encoding to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the position m=E of the redundancy version, so as to perform the generation of a sequence with a length of E'+E, with a sequence of length E' after the sequence length E; or

in the case of LDPC encoding to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the position m=E mod A of the redundancy version, so as to perform the generation of a sequence with a length of E'+E, while the sequence of length E' is found after a sequence of length E; Where

A is the length of the ring buffer, A is obtained by calculation based on E, m represents the output start position, and mod is the modulo operation.

[00270] Additionally, in one embodiment, end device 300 also includes a rate matching module for:

in the case of polar coding, to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=0 of the encoded bits, so as to generate a sequence with a length of E'+E, with a sequence of length E' before the sequence length E; or

in the case of polar coding, to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from position k=A-E of the encoded bits in the ring buffer at rate matching, so as to generate a sequence with a length of E'+E, while a sequence of length E' comes before a sequence of length E; or

A is the length of the ring buffer, A is obtained by calculation based on E, and k represents the output start position of the encoded bits.

[00271] Additionally, in one embodiment, end device 300 also includes a rate matching module for:

in the case of LDPC encoding to output a subsequence with a length of the second sequence E' and a subsequence with a length of the first sequence E from the starting position of the redundancy version information, so as to perform the generation of a sequence with a length of E'+E, with a sequence of length E' after the sequence length E.

[00272] Additionally, according to one embodiment, end device 300 also includes a selection module for:

to determine the character start position or RE start position for resource binding based on the number configuration.

[00273] Additionally, according to one embodiment, end device 300 also includes a selection module for:

to determine the character start position or RE start position for resource binding based on the redundancy version.

[00274] Additionally, in one embodiment, the selection module may be specifically designed to:

to determine the character start position or RE start position for resource binding based on the redundancy version and the fact that the LBRM was activated.

[00275] With regard to the terminal device 300 according to this embodiment of the present invention, see the processes of the method 100 in the corresponding embodiment of the present invention, and the blocks/modules of the terminal device 300 and other operations and/or functions described above are used to implement the corresponding processes according to method 100 with the same technical effects. For the sake of brevity, detailed information is not presented here.

[00276] FIG. 4 is a block diagram of the construction of a terminal device according to another embodiment of the present invention. Terminal 400 shown in FIG. 4 includes at least one processor 401, a storage device 402, at least one network 404, and user 403 interfaces. The components of the terminal device 400 are connected to each other via a bus system 405. It can be understood that the bus system 405 is designed to establish a connection and exchange data between these components. The bus system 405 may include not only a data bus, but also power, control, and status signaling buses. However, for clarity of description, the various tires in FIG. 4 are referred to as busbar system 405.

[00277] The user interface 403 may include a display, a keyboard or pointing device (eg, a mouse or trackball), a touch pad, or a touch screen.

[00278] As can be understood, the storage device 402 according to this embodiment of the present invention may be volatile, non-volatile, or a combination. The non-volatile storage device may be read-only memory (ROM), programmable read-only memory (Programmable ROM, PROM), erasable read-only memory (Erasable PROM, EPROM), electrically erasable read-only memory (Electrically EPROM, EEPROM ) or flash memory. The volatile storage device may be a Random Access Memory (RAM) that serves as an external cache. As a non-limiting example, many forms of RAM can be used, for example, static random access memory (Static RAM, SRAM), dynamic random access memory (Dynamic RAM, DRAM), synchronous dynamic random access memory (Synchronous DRAM, SDRAM), dynamic synchronous RAM double data rate memory (Double Data Rate SDRAM, DDRSDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), dynamic link synchronous random access memory (Synchlink DRAM, SLDRAM), and Rambus direct access memory (Direct Rambus RAM, DRRAM). The system storage device 402 and the method described in the embodiments of the present invention are intended to include, but are not limited to, these and other applicable types.

[00279] According to some embodiments, storage device 402 stores the following items: executable modules or data structures, a subset or extended set thereof, an operating system 4021, and an application program 4022.

[00280] The operating system 4021 includes various system programs such as an infrastructure layer, an operating library, and a driver layer, and it is designed to implement various basic services and process hardware tasks. The application program 4022 includes various applications such as a Media Player and a Browser and is designed to implement various application services. The program by which the methods according to the embodiments of the present invention are implemented may be included in the application program 4022.

[00281] In this embodiment of the present invention, the terminal device 400 further includes a computer program that is stored on the storage device 402 and can be run on the processor 401. When executed by the processor 401, the computer program implements the following steps according to the method 100.

[00282] The method disclosed in the embodiments of the present invention may be applied to or implemented by the processor 401. Processor 401 may be an integrated circuit chip with signal processing capability. In the implementation process, the steps in the above method may be implemented by a logic circuit embedded in hardware in the processor 401 or by instructions in the form of software. The above processor 401 may be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), or other programmable logic logic. device, discrete logic element, transistor logic device, or discrete hardware component. The processor 401 may provide for the implementation or execution of the methods, steps, and logics disclosed in the embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed with reference to embodiments of the present invention may be directly performed by a decryption processor hardware module or a combination of decryption processor hardware and software modules. The program module may reside on a prior art computer-readable storage medium such as random access memory, flash memory, read only memory, programmable read only memory, electrically erasable programmable memory, or a memory register. A computer-readable storage medium is located in the storage device 402, and the processor 401 reads information from the first and, in combination with its hardware, implements the steps of the above methods. In particular, a computer program is stored on a computer-readable storage medium which, when executed by the processor 401, implements the steps according to an embodiment of the method 100 described above.

[00283] As can be understood, embodiments of the present invention may be implemented in hardware, software, firmware, middleware, microcode, or a combination thereof. With regard to hardware implementation, the processor can be implemented in the form of one or more integrated circuits for special purposes (Application Specific Integrated Circuits, ASIC), digital signal processors (Digital Signal Processing, DSP), digital signal processing devices (DSP Device, DSPD), programmable logic devices (Programmable Logic Device, PLD), programmable logic integrated circuits (Field-Programmable Gate Array, FPGA), general purpose processors, controllers, microcontrollers, microprocessors and other electronic components to implement the functions described in the description of the present invention, or in the form their combinations.

[00284] With regard to software implementation, the techniques described in the embodiments of the present invention may be implemented by modules (eg, processes or functions) that perform the functions described in the embodiments of the present invention. The program code may be stored in a storage device and executed by a processor. The storage device may be implemented inside or outside the processor.

[00285] The terminal device 400 is capable of implementing the processes that are performed by such a device according to the above-described embodiments to achieve the same technical effects. To avoid repetition, the detailed description in this application will no longer be given.

[00286] In one embodiment, the present invention further provides a computer-readable storage medium that stores a computer program. When this computer program is executed by the processor, the processes according to the above embodiment of the method 100 are implemented to achieve the same technical effects. To avoid repetition, the detailed description in this application will no longer be given. A computer-readable storage medium is, for example, a non-volatile computer-readable medium such as Read-Only Memory (ROM for short), Random Access Memory (RAM for short), magnetic or optical disk.

[00287] It should be noted that the terms "comprise", "comprise", or any other variations thereof are intended to mean non-exclusive content such that a process, method, product, or device that includes a number of elements, contains not only these elements, but also other elements not directly listed, or additionally includes elements specific to that process, method, article, or device. Unless otherwise limited, an element containing the term "includes..." does not preclude the presence of other identical elements in a process, method, article, or device that includes the element.

[00288] From the foregoing description of the embodiments, it will be clearly apparent to one skilled in the art that the methods in the above embodiments may be implemented by software in combination with a general purpose hardware platform, and, of course, alternatively may be implemented by hardware or software. However, in most cases the first embodiment is preferred. Based on this understanding, the technical solutions of the present invention, in substantial part or parts relating to the prior art, can be implemented as a software product. This computer program product is stored on a storage medium (e.g., ROM/RAM, magnetic or optical disk) and includes several instructions for execution by user equipment (which may be a mobile phone, computer, server, air conditioner, network device, or the like). .) in order to implement the method described in the embodiments of the present invention.

[00289] The above is a description of embodiments of the present invention with reference to the accompanying drawings. However, the present invention is not limited to the above specific embodiments. The foregoing specific implementations are for illustrative purposes only and are not limiting. As described in this application, many other embodiments will be available to those skilled in the art without departing from the principles of the present invention and the scope of the claims, all of which are within the scope of the present invention.

Claims (16)

1. A method for negotiating the transmission rate and binding a resource of a direct connection, characterized in that it is carried out at the expense of the terminal device and includes the following: calculating, based on the size of the target resource, a length E of encoded bits carried by the resource in use, excluding the target resource; And performing resource binding based on deriving the encoded bit sequence by rate negotiation, wherein the length of the encoded bit sequence is E or E+E', and E' is the length of the encoded bits carried by the target resource; wherein performing resource binding based on deriving a sequence of encoded bits by rate negotiation includes: binding the output of the encoded bit sequence by rate matching to the resource in use from (N+1) symbol to the last symbol of the resource in use in ascending order, wherein in the resource in use the symbols with complex values associated with the first N symbols are the same as the complex values associated with characters from (N+1) to (2N), and the output length of the encoded bit sequence by rate negotiation is E, N refers to the size of the transport block, and the size of the transport block refers to the resource used. 2. The method according to claim 1, characterized in that the target resource includes: resource occupied by automatic gain control AGC; or the resource occupied by the direct connection physical shared channel PSSCH, wherein the resource occupied by the PSSCH and the resource occupied by the PSCCH are the same in the time domain. 3. The method according to claim 1, characterized in that before performing the resource binding based on the output of the encoded bit sequence by rate negotiation, it further includes: determining a character start position or an RE start position for resource binding based on the number configuration; or characterized in that, before performing the resource binding based on deriving the encoded bit sequence by rate negotiation, it further includes: determining the character start position or RE start position for resource binding based on the redundancy version. 4. The method of claim 3, wherein determining the character start position or RE start position for resource binding based on the redundancy version includes: determining a symbol start position or a RE start position for resource binding based on the redundancy version and the fact that the rate negotiation was activated with a limited LBRM buffer. 5. Subscriber equipment, including a memory device, a processor and a computer program stored on it, which can be launched by the processor, characterized in that when this program is executed by the processor, steps are implemented according to the method for negotiating the transmission rate and binding the direct connection resource according to any one of paragraphs. 1-4.

Images