Method and apparatus for sidelink rate matching and resource mapping

Abstract

An embodiment of the present disclosure discloses a method and device for sidelink rate matching and resource mapping to provide a solution for rate matching and resource mapping in sidelink communication. The method is executed by a terminal device and includes: calculating an available coding bit length E based on a resource size of a target resource when available resources do not include the target resource; and performing resource mapping based on a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or E+E', where E' is the available coding bit length of the target resource.

Description

[Technical field]

[0001] (CROSS REFERENCE TO RELATED APPLICATIONS) This disclosure claims priority to China Patent Application No. 201910691374.5, filed on July 29, 2019, entitled “Method and apparatus for sidelink rate matching and resource mapping,” the entire contents of which are incorporated herein by reference. TECHNICAL FIELD The embodiments of the present disclosure relate to the field of communications, and more particularly to a method and apparatus for sublink (also called sidelink, edge link, etc.) rate matching and resource mapping. [Background technology]

[0002] The Long Term Evolution (LTE) sidelink is based on broadcast format and can be used for basic security type communication of vehicle to everything (V2X), but does not apply to higher level V2X services. The New Radio (NR) system supports more advanced sidelink transmission design, such as unicast, multicast or groupcast, to support more comprehensive service types.

[0003] In the related art, if rate matching and resource mapping cannot be performed rationally, the demodulation probability of sidelink data may decrease, which may affect the communication efficiency of the system. At present, how to perform rate matching and resource mapping during sidelink communication in an NR system is a technical issue that needs to be resolved quickly in the related art. Summary of the Invention [Problem to be solved by the invention]

[0004] An objective of the embodiments of the present disclosure is to provide a method and apparatus for sidelink rate matching and resource mapping to provide a solution to rate matching and resource mapping for sidelink communication. [Means for solving the problem]

[0005] According to a first aspect, there is provided a method for sublink rate matching and resource mapping performed by a terminal device, the method comprising: Calculating an additional coding bit length E according to a resource size of a target resource when an available resource does not include the target resource; Performing resource mapping based on a coding bit sequence of a rate matching output, the length of the coding bit sequence being equal to E or equal to E+E', where E' is the available coding bit length of the target resource.

[0006] According to a second aspect, a terminal device is provided, the terminal device comprising: A calculation module for calculating an additional coding bit length E according to a resource size of a target resource when an available resource does not include the target resource; and a resource mapping module for performing resource mapping based on a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource.

[0007] According to a third aspect, there is provided a terminal device, the terminal device including a processor, a memory, and a computer program stored in the memory and operable on the processor, the computer program, when executed by the processor, realizing the steps of the method for sublink rate matching and resource mapping as described in the first aspect.

[0008] According to a fourth aspect, there is provided a computer-readable storage medium having a computer program stored thereon, the computer program being operable, when executed by a processor, to implement the steps of the sublink rate matching and resource mapping method according to the first aspect. Effect of the Invention

[0009] In the embodiment of the present disclosure, the terminal device can calculate the coding bit length E that can be added when the available resource does not include the target resource according to the resource size of the target resource, and can perform resource mapping according to the coding bit sequence of the rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the coding bit length that can be added to the target resource. The embodiment of the present disclosure provides a solution to the rate matching and resource mapping of NR sidelink by calculating the coding bit length that can be added when the available resource does not include the target resource, and the target resource in the available resource is considered during the rate matching and resource mapping, which is easy to improve the demodulation success rate of sidelink data and the transmission efficiency of the system.

[0010] The accompanying drawings described herein are used to provide further understanding of the present disclosure, constitute a part of the present disclosure, and the exemplary embodiments of the present disclosure and the description thereof are for interpreting the present disclosure and are not to be construed as undue limitations to the present disclosure. [Brief description of the drawings]

[0011] [Figure 1] 2 is a schematic flowchart of a method for sub-link rate matching and resource mapping according to one embodiment of the present disclosure; [Diagram 2] FIG. 2 is a schematic diagram of a target resource according to one embodiment of the present disclosure. [Diagram 3] FIG. 2 is a structural schematic diagram of a terminal device according to an embodiment of the present disclosure. [Figure 4] FIG. 2 is a structural schematic diagram of a terminal device according to another embodiment of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] In order to make the objectives, technical solutions and advantages of the present disclosure clearer, the following clearly and completely describes the technical solutions of the present disclosure in conjunction with specific embodiments of the present disclosure and corresponding accompanying drawings. Obviously, the described embodiments are only some embodiments of the present disclosure, and are not all embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained without the need for creative efforts by those skilled in the art are all within the scope of protection of the present disclosure. "And / or" in each embodiment of the present specification represents at least one of both the preceding and following.

[0013] In addition, the technical solutions of the embodiments of the present disclosure can be applied to various communication systems, such as an LTE sidelink system or an NR sidelink system, or a subsequently evolved sidelink communication system.

[0014] In the embodiments of the present disclosure, the terminal equipment may include, but is not limited to, a Mobile Station (MS), a Mobile Terminal, a Mobile Telephone, a User Equipment (UE), a handset, a portable equipment, a vehicle, etc. The terminal equipment may communicate with one or more core networks via a Radio Access Network (RAN), and for example, the terminal equipment may be a mobile phone (also called a "cellular" phone), a computer with wireless communication capabilities, etc., and the terminal equipment may be a portable, pocket, handheld, computer-embedded, or vehicle-mounted mobile device.

[0015] As shown in Fig. 1, an embodiment of the present disclosure provides a sidelink rate matching and resource mapping method 100. The method may be performed by a terminal device and includes the following steps:

[0016] S102, according to a resource size of a target resource, calculate an available coding bit length E when the available resource does not include the target resource.

[0017] The target resource is a portion of the available resources. Optionally, the target resource is: 1) Resources occupied by Automatic Gain Control (AGC), or 2) It may include resources occupied by a Physical Sidelink Share Channel (PSSCH) that overlap in the time domain with resources occupied by a Physical Sidelink Control Channel (PSCCH).

[0018] During sidelink communication, the first symbol or the first half of the available resource can be used for AGC adjustment, so the resource occupied by AGC may be the first symbol or the first half of the available resource.

[0019] Optionally, the AGC processing time / symbol length is a predefined / preconfigured value; Or, the AGC processing time / symbol length is obtained based on the parameter set numerology, Alternatively, the transmitting end terminal device instructs the receiving end terminal device to configure AGC through sublink control information SCI / sublink radio resource control SL-RRC, for example, instructing information such as AGC processing time / AGC symbol length / whether AGC is enabled, etc.

[0020] Or the receiving end terminal equipment feeds back information to the transmitting end terminal equipment, indicating at least one of whether the AGC is enabled, the processing time of the AGC, the number of symbols of the AGC, and so on.

[0021] When the target resource is a PSSCH (overlapping with the PSCCH time domain), specifically refer to FIG. 2, in which the PSCCH occupies the first two symbols, the target resource is the PSSCH in part A in FIG. 2, and the guard period (GP) occupies the last symbol in FIG. 2.

[0022] For the available resource in this embodiment, specifically, for example, in FIG. 2, the available resource is the PSSCH resource in FIG. 2, including part A and part B in FIG.

[0023] In this step, when E is calculated, the available coding bit length E of the PSSCH in part B in FIG. 2 can be calculated as shown in FIG. 2. E can be calculated by the following formula: TIFF0007602531000001.tif724 However, TIFF0007602531000002.tif78 is the number of available REs after removing the target resource from the resources to be scheduled. Specifically, for example, TIFF0007602531000003.tif78 is the number of available REs in part B in Figure 2, TIFF0007602531000004.tif77 is the modulation order, TIFF0007602531000005.tif54 is the number of layers.

[0024] Optionally, this step can further calculate an available coding bit length E' of the target resource, where E' can be calculated by the following formula: TIFF0007602531000006.tif728However, TIFF0007602531000007.tif712 is the number of available REs in the target resource. Specifically, for example, TIFF0007602531000008.tif712 is the number of available REs in the PSSCH in part A in FIG. 2 , TIFF0007602531000009.tif77 is the modulation order, TIFF0007602531000010.tif54 is the number of layers.

[0025] Alternatively, when calculating E', do the same as when calculating E. TIFF0007602531000011.tif77, TIFF0007602531000012.tif54, etc., parameters other than the number of REs are adopted. Or E' is a value predefined by a protocol / preconfigured by a network device, or configured by downlink control information (DCI) / sublink control information (SCI) / radio resource control (RRC), Alternatively, the number of available REs used to calculate E' may be related to the configuration of a Demodulation Reference Signal (DMRS) / Channel State Information-Reference Signal (CSI-RS) / Phase-tracking reference signal (PTRS). For example, when DMRS is not configured, the number of available REs in each physical resource block (PRB) is 12, and when DMRS is configured, the number of available REs in each PRB is the number of REs on one symbol minus the number of DMRS symbols.

[0026] The above method 100 further includes performing resource mapping S104 based on a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource.

[0027] Before this step is performed, rate matching can be performed (the specific processing process will be introduced in detail in the subsequent embodiments), in which the length of the coding bit sequence of the rate matching output is equal to E or equal to E+E', and the meanings of E and E' can be found in the description of step S102.

[0028] Of course, further coding processing can be performed before resource mapping. If polar coding is adopted, the coding process is information multiplexing->adding a cyclic redundancy check code (CRC)->polar coding->rate matching. If LDPC coding is adopted, the coding process is adding a CRC->selecting an LDPC based graph->division of code blocks and adding a code block CRC->LDPC coding->rate matching->code block cascading.

[0029] In the sidelink rate matching and resource mapping method according to the embodiment of the present disclosure, the terminal device can calculate an available coding bit length E when the available resources do not include the target resource according to the resource size of the target resource, and perform resource mapping according to the coding bit sequence of the rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource. The embodiment of the present disclosure provides a solution to the rate matching and resource mapping of the NR sidelink by calculating the available coding bit length when the available resources do not include the target resource, and the target resource in the available resources is taken into account during the rate matching and resource mapping, which is easy to improve the demodulation success rate of sidelink data and the transmission efficiency of the system.

[0030] The resource mapping process is mentioned in S104 of the above embodiment, which will be introduced in detail below in conjunction with several embodiment methods.

[0031] Method 1.

[0032] S104 may include mapping the coding bit sequence of the rate matching output to a last symbol of the available resource in ascending sequence order starting from the N+1th symbol of the available resource, and further mapping the remaining coding bit sequence to an Nth symbol of the available resource in ascending sequence order starting from the first symbol of the available resource.

[0033] Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', N is related to a transport block size, and the transport block size is related to the available resource, for example, when the target resource is the AGC overhead, N=1.

[0034] Optionally, in the available resource of the method 1, the mapping information of the first N symbols is a repetition of the mapping information of the (N+1) to 2Nth symbols, specifically, it may be a repetition of the information in the rate matching process. In this way, when the target resource is the AGC overhead, the first N symbols can be used to perform AGC adjustment, and the first N symbols do not need to be demodulated, which improves the demodulation success rate and improves communication efficiency.

[0035] Regarding the improvement of the demodulation success rate and the improvement of communication efficiency mentioned in each embodiment of this specification, since the first N symbols are repeated information, even if the first N symbols are not demodulated, all useful information within the transmission time interval (TTI) is transmitted in the symbols after these first N symbols, so there is no information loss.

[0036] Of course, if the first N symbols are not used for AGC adjustment, the demodulation success rate can be improved because of the presence of repeated information in this portion.

[0037] The above operations are all for the receiving end terminal equipment, and of course, the receiving end terminal equipment can selectively realize whether the first N symbols are used for AGC adjustment or not.

[0038] Method 2.

[0039] S104 may include mapping the coding bit sequence of the rate matching output to the last RE of the available resources in ascending sequence order from the M+1th resource particle RE of the available resources, and further mapping the remaining coding bit sequence to the Mth RE of the available resources in ascending sequence order from the first RE of the available resources.

[0040] Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', the target resource includes resources occupied by PSSCH, and M is the number of REs occupied by PSSCH, where PSSCH refers to the part overlapping with PSCCH in the time domain, for example, PSSCH in part A in FIG. 2.

[0041] Optionally, in the available resources of this Scheme 2, the mapping information of the first M REs may be a repetition of the mapping information of the (M+1)th to 2Mth REs, specifically, a repetition of the information in the rate matching process.

[0042] In method 2, resource mapping starts from the M+1th RE. As shown in FIG. 2, if the PSCCH occupies two symbols and the number of REs occupied by the PSSCH in part A is M, then the mapping information of the REs occupied by the PSSCH in part A is a repetition of the mapping information of the first M REs of the PSSCH in part B.

[0043] In practical application, when the PSSCH of part B performs resource mapping, resource mapping is performed in a frequency domain priority manner starting from the first symbol of the PSSCH of part B. Therefore, in this method 2, resource mapping starts from the M+1th RE, rather than starting from the N+1th symbol as in method 1.

[0044] Method 3.

[0045] S104 may include mapping the coding bit sequence of the rate matching output to a last symbol of the available resource in an increasing sequence order from an N+1th symbol of the available resource, and the complex-valued symbols mapped by the first N symbols in the available resource are the same as the complex-valued symbols mapped by the (N+1)th to 2Nth symbols.

[0046] Wherein, the length of the coding bit sequence of the rate matching output is equal to E, and N is related to a transmission block size, which is related to the available resource, for example, when the target resource is the AGC overhead, N=1.

[0047] Method 4.

[0048] S104 may include mapping the coding bit sequence of the rate matching output to the last RE of the available resource in an increasing sequence order from the M+1th RE of the available resource, and the complex-valued symbols mapped onto the first M REs in the available resource are the same as the complex-valued symbols mapped onto the (M+1)th to 2Mth REs in the available resource.

[0049] Wherein, the length of the coding bit sequence of the rate matching output is equal to E, the target resource includes resources occupied by PSSCH, and M is the number of REs occupied by PSSCH, where PSSCH refers to the part overlapping with PSCCH in the time domain, for example, PSSCH in part A in FIG. 2.

[0050] Method 5.

[0051] S104 may include mapping the coding bit sequence of the rate matching output from a first symbol of the available resource to a last symbol of the available resource in an ascending sequence order.

[0052] Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', N is related to a transport block size, and the transport block size is related to the available resource, for example, when the target resource is the AGC overhead, N=1.

[0053] Alternatively, in the available resource of this mode 5, the mapping information of the first N symbols may be a repetition of the mapping information of the (N+1) to 2N symbols, specifically, the repetition of information in the rate matching process. The specific implementation process will be described later.

[0054] Alternatively, in the available resources of this Scheme 5, the mapping information of the first M REs may be a repetition of the mapping information of the (M+1) to 2M REs, specifically, the repetition of information in the rate matching process. A specific implementation process will be described later.

[0055] Method 6.

[0056] S104 may include mapping the coding bit sequence of the rate matching output from a first symbol of the available resource to a last symbol of the available resource in an ascending sequence order.

[0057] Wherein, the number of available resource particles RE on the first symbol is half the total number of RE on the first symbol, and the length of the coding bit sequence of the rate matching output is equal to E.

[0058] Optionally, on the first symbol, starting from odd / even numbered REs, there is one available resource every other RE, i.e. on the first symbol, the frequency domain performs resource mapping every other RE.

[0059] In this scheme 6, the target resource may be the AGC overhead, and the AGC occupies the first half symbols of the available resource.

[0060] Optionally, in the above Scheme 1 and Scheme 2, the length of the coding bit sequence of the rate matching output is equal to E+E', and in Scheme 1, the mapping information of the first N symbols is a repetition of the mapping information of the (N+1)th to 2Nth symbols, and in Scheme 2, the mapping information of the first M REs is a repetition of the mapping information of the (M+1)th to 2Mth REs. In order to realize the information repetition, before performing resource mapping according to the coding bit sequence of the rate matching output, the method further comprises: In the case of polar coding, when rate matching, a sequence of length E'+E (i.e., an abbreviation of the coding bit sequence mentioned in the previous sentence) is generated by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from the coding bit position k=0 of the circular buffer, and the subsequence of length E' is after the subsequence of length E; or In the case of polar coding, the coding process further includes, during rate matching, generating a sequence of length E'+E by starting from position k=AE of the coding bits of the circular buffer and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' is after the subsequence of length E.

[0061] Wherein, A is the length of the circular buffer, A is calculated based on E, and k represents the starting output position of the coding bit.

[0062] Optionally, in the above manner 1 and manner 2, before performing resource mapping according to the coding bit sequence of the rate matching output to realize the information repetition, the method further comprises: In the case of LDPC coding, the coding process further includes, during rate matching, generating a sequence of length E'+E by starting from the starting information position of the redundant version of the circular buffer and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' is after the subsequence of length E.

[0063] Optionally, in the above-mentioned manner 1 and manner 2, before performing resource mapping according to the coding bit sequence of the rate matching output, the method further comprises: if polar coding, when rate matching, generating a sequence of length E'+E by outputting a subsequence of length E of the first sequence length starting from the coding bit position k=AE of the circular buffer and outputting a subsequence of length E' of the second sequence length starting from the coding bit position k=0, the subsequence of length E' being after the subsequence of length E; or if polar coding, when rate matching, generating a sequence of length E'+E by outputting a subsequence starting from coding bit position k=0 of the circular buffer and having a length of a first sequence length E, and outputting a subsequence starting from coding bit position k=E and having a length of a second sequence length E', the subsequence of length E' being after the subsequence of length E; or In the case of polar coding, the coding process further includes, during rate matching, generating a sequence of length E'+E by outputting a subsequence starting from a position k=E mod A of the coding bits in the circular buffer and having a length of a first sequence length E, and outputting a subsequence starting from a position k=(E mod A)+E of the coding bits and having a length of a second sequence length E', where the subsequence of length E' is after the subsequence of length E.

[0064] Wherein, A is the length of the circular buffer, A is calculated based on E, k represents the starting output position of the coding bit, and mod represents the modulo operation.

[0065] Optionally, in the above manner 1 and manner 2, before performing resource mapping according to the coding bit sequence of the rate matching output to realize the information repetition, the method further comprises: In the case of LDPC coding, when rate matching, generate a sequence of length E'+E by starting from a position m=E of the redundant version of the circular buffer and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' is after the subsequence of length E; or In the case of LDPC coding, the coding process further includes, during rate matching, generating a sequence of length E'+E by starting from position m=E mod A of the redundant version of the circular buffer and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' is after the subsequence of length E.

[0066] Wherein, A is the length of the circular buffer, A is calculated based on E, m represents the starting output position, and mod represents the modulo operation.

[0067] Optionally, in the above manner 5, before performing resource mapping according to the coding bit sequence of the rate matching output, in order to realize information repetition in the rate matching process, the method further comprises: In the case of polar coding, when rate matching, generating a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from the coding bit position k=0 of the circular buffer, and the subsequence of length E' is before the subsequence of length E; or In the case of polar coding, the method further includes a step of generating a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from position k=AE of the coding bits of the circular buffer, and the subsequence of length E' is before the subsequence of length E.

[0068] Wherein, A is the length of the circular buffer, A is calculated based on E, and k represents the starting output position of the coding bit.

[0069] Optionally, in the above manner 5, before performing resource mapping according to the coding bit sequence of the rate matching output, in order to realize information repetition in the rate matching process, the method further comprises: In the case of LDPC coding, the method further includes a step of generating a sequence of length E'+E by starting from the starting information position of the redundant version of the circular buffer and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' is before the subsequence of length E.

[0070] Alternatively, the above-mentioned methods 1 to 6 may further include a step of determining a starting symbol position or a starting RE position of the resource mapping based on the arrangement of the parameter set before performing resource mapping based on the coding bit sequence of the rate matching output as described above, i.e., selecting which of methods 1 to 6 to use based on the arrangement of the parameter set.

[0071] Specifically, for example, if the numerology SCS=15kHz, considering that the AGC may occupy the first half of the available resources, the above method 6 can be adopted; otherwise, that is, if the SCS is not equal to 15kHz, the above other methods, for example, methods 1 and 2, may be adopted.

[0072] Alternatively, the above methods 1 to 6 may further include a step of determining a starting symbol position or a starting RE position of the resource mapping based on different values ​​of RV before performing resource mapping based on the coding bit sequence of the rate matching output as described above, i.e., selecting which method to use based on different values ​​of RV.

[0073] For example, for RV0 / RV1, Scheme 1 and Scheme 2 can be adopted, in which the mapping information is obtained sequentially from the starting position of RV0 / RV1 in the circular buffer.

[0074] For example, for RV3 / RV2, Scheme 5 can be adopted, in which the mapping information is obtained sequentially from the starting position of RV3 / RV2 in the circular buffer.

[0075] Additionally, different iterations can be processed for different redundancy versions based on whether finite buffer rate matching LBRM is enabled. For example, If LBRM is enabled, RV0, RV1, and RV2 are mapped sequentially from the second symbol to the last available symbol (i.e., the N=1 situation in Scheme 1), and RV3 is mapped sequentially from the first symbol (Scheme 5).

[0076] If LBRM is not enabled, RV0, RV1 are mapped sequentially from the first symbol to the last available symbol (i.e., Scheme 5), and RV2, RV3 are mapped sequentially from the second symbol (i.e., the N=1 situation in Scheme 1).

[0077] In order to describe in detail the rate matching and resource mapping method according to the above embodiments of the present disclosure, the following will present several specific examples in conjunction with each other.

[0078] Example 1 (This Example 1 is presented in three sub-examples) In a first sub-embodiment, the terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0079] 1. If the (target resource) is an AGC of one symbol, the transmitting terminal equipment calculates the coding bit length E that can be added when the available resource does not include an AGC of one symbol according to the following formula: TIFF0007602531000013.tif724 However, TIFF0007602531000014.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000015.tif77 is the modulation order, TIFF0007602531000016.tif54 is the number of layers.

[0080] 2. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A according to the value of E, where A is the length of the circular buffer.

[0081] 3. After polar coding, sub-block interleaving is performed, and the sequence length after interleaving is A.

[0082] 4. Input a sequence of length A into the circular buffer and define E as the length of the sequence after rate matching.

[0083] 5. Based on the rate matching process of DCI, perform bit selection for SCI.

[0084] 6. After possible scrambling, modulate to generate complex-valued symbols, which are then mapped to the last symbol of the available resources in an increasing sequence starting from the second symbol according to the time domain priority / frequency domain priority principle, where the complex-valued symbols mapped onto the first symbol are the same as the complex-valued symbols mapped onto the second symbol.

[0085] In this embodiment, resource mapping is performed by iterative processing, that is, the complex-valued symbol mapped on the first symbol is the same as the complex-valued symbol mapped on the second symbol. In this way, the first symbol of the receiving end terminal device can be used for AGC adjustment, and the second symbol and the following symbols can be used for data demodulation, which is easy to improve the demodulation success rate and communication efficiency. For the specific principle of effect realization, please refer to the above description.

[0086] In a second sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0087] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000017.tif724 However, TIFF0007602531000018.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000019.tif77 is the modulation order, TIFF0007602531000020.tif54 is the number of layers.

[0088] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0089] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0090] 4. Input a sequence of length A into the circular buffer and define E as the length of the sequence after rate matching.

[0091] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching and output a sequence with length E.

[0092] 6, this sequence is possibly scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last assigned symbol in the order of increasing sequence numbers starting from the second symbol according to the time domain first / frequency domain first principle, and the complex-valued symbol mapped onto the first symbol is the same as the complex-valued symbol mapped onto the second symbol.

[0093] In this embodiment, resource mapping is performed iteratively, that is, the complex-valued symbol mapped on the first symbol is the same as the complex-valued symbol mapped on the second symbol.In this way, the first symbol of the receiving end terminal device can be used for AGC adjustment, and the second symbol and the following symbols can be used for data demodulation, which is convenient to improve the demodulation success rate and communication efficiency.

[0094] In a third sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0095] 1. If the number of symbols of the PSCCH is 2, refer to Fig. 2. The number of REs of the PSSCH that overlap with the PSCCH in the time domain is M. The transmitting end terminal device calculates the coding bit length E that can be added when the available resources do not include the REs of the PSSCH that overlap with the PSCCH in the time domain, that is, the coding bit length E that can be added to the RE B part in Fig. 2, according to the following formula: TIFF0007602531000021.tif724 However, TIFF0007602531000022.tif78 is the number of available REs after removing the PSSCH that overlaps with the PSCCH in the time domain from the scheduled resources, TIFF0007602531000023.tif77 is the modulation order, TIFF0007602531000024.tif54 is the number of layers.

[0096] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0097] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0098] 4. Input a sequence of length A into the circular buffer and define E as the length of the sequence after rate matching.

[0099] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching and output a sequence with length E.

[0100] 6, this sequence is possibly scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last RE of the last symbol in a time-domain-first / frequency-domain-first manner, starting from the M+1th RE, first in the frequency domain and then in the time domain, in a manner of increasing sequence numbers, and the complex-valued symbols mapped onto the first M REs are the same as the complex-valued symbols mapped onto the (M+1)th to 2Mth REs.

[0101] Example 2 (This Example 2 is presented in four sub-examples) In a first sub-embodiment, the terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0102] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000025.tif724 However, TIFF0007602531000026.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000027.tif77 is the modulation order, TIFF0007602531000028.tif54 is the number of layers.

[0103] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000029.tif728However, TIFF0007602531000030.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000031.tif77 is the modulation order, TIFF0007602531000032.tif54 is the number of layers.

[0104] In this embodiment, the output sequence length after rate matching is E+E'.

[0105] 2. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A based on the value of E, where A is the length of the circular buffer.

[0106] 3. After polar coding, sub-block interleaving is performed. The sequence length after interleaving is A.

[0107] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0108] 5. If shortening is used to select bits, Map the sequence k=AE through A to bit positions such that the output sequence runs from 0 through E-1; Starting with k=AE, we map a sequence of length E' to bit positions such that the output sequence goes from E to E+E'-1.

[0109] After rate matching, we generate a sequence of length E+E'.

[0110] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last assigned symbol in the order of increasing sequence numbers starting from the second symbol according to the time domain first / frequency domain first principle, and the remaining information is then mapped to the first symbol.

[0111] In a second sub-embodiment, the terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0112] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000033.tif724 However, TIFF0007602531000034.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000035.tif77 is the modulation order, TIFF0007602531000036.tif54 is the number of layers.

[0113] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000037.tif728However, TIFF0007602531000038.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000039.tif77 is the modulation order, TIFF0007602531000040.tif54 is the number of layers.

[0114] In this embodiment, the output sequence length after rate matching is E+E'.

[0115] 2. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A based on the value of E, where A is the length of the circular buffer.

[0116] 3. After polar coding, sub-block interleaving is performed. The sequence length after interleaving is A.

[0117] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0118] 5. If puncturing is used to select bits, Map the sequence k=0 to E-1 to bit positions such that the output sequence is from 0 to E-1; Starting with k=0, we map a sequence of length E' to bit positions such that the output sequence goes from E to E+E'-1.

[0119] After rate matching, we generate a sequence of length E+E'.

[0120] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped onto the last assigned symbol in increasing sequence number order starting from the second symbol according to the time domain first / frequency domain first principle, and the remaining sequence is then mapped onto the first symbol.

[0121] In a third sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0122] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000041.tif724 However, TIFF0007602531000042.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000043.tif77 is the modulation order, TIFF0007602531000044.tif54 is the number of layers.

[0123] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000045.tif728However, TIFF0007602531000046.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000047.tif77 is the modulation order, TIFF0007602531000048.tif54 is the number of layers.

[0124] In this embodiment, the output sequence length after rate matching is E+E'.

[0125] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0126] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0127] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0128] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching. Starting from the start position of the currently transmitted RV, map a sequence of length E to bit positions from 0 to E-1 in the output sequence. For example, a) If RV=0, then map sequences from k=0 to E-1 into bit positions from 0 to E-1 in the output sequence. Map sequences starting with k=0 and of length E' into bit positions from E to E+E'-1 in the output sequence.

[0129] b) If RV=1, then map sequences from k=A / 4 to A / 4+E-1 into bit positions from 0 to E-1 in the output sequence. Map sequences starting with k=A / 4 and of length E' into bit positions from E to E+E'-1 in the output sequence.

[0130] c) If RV=2, then map sequences from k=A / 2 to A / 2+E-1 into bit positions from 0 to E-1 in the output sequence. Map sequences starting with k=A / 2 and of length E' into bit positions from E to E+E'-1 in the output sequence.

[0131] d) If RV=3, then map sequences from k=3A / 4 through 3A / 4+E-1 into bit positions from 0 through E-1 in the output sequence. Map sequences starting with k=3A / 4 and of length E' into bit positions from E through E+E'-1 in the output sequence.

[0132] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped onto the last assigned symbol in increasing sequence number order starting from the second symbol according to the time domain first / frequency domain first principle, and the remaining sequence is then mapped onto the first symbol.

[0133] In a fourth sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0134] 1. If the number of symbols of the PSCCH is 2, the number of REs of the PSSCH (see the PSCCH in part A of FIG. 2) that overlaps with the PSCCH in the time domain is M. The transmitting end terminal device calculates the coding bit length E that can be added when the available resources do not include the REs of the PSSCH that overlap with the PSCCH in the time domain, that is, the coding bit length E that can be added to the REs in part B of FIG. 2, according to the following formula: TIFF0007602531000049.tif724However, TIFF0007602531000050.tif78 is the number of available REs after removing the PSSCH that overlaps with the PSCCH in the time domain from the scheduled resources, TIFF0007602531000051.tif77 is the modulation order, TIFF0007602531000052.tif54 is the number of layers.

[0135] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0136] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0137] 4. Input a sequence of length A into the circular buffer and define E+E' as the length of the sequence after rate matching.

[0138] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching. Starting from the start position of the currently transmitted RV, map a sequence of length E to bit positions from 0 to E-1 in the output sequence. For example, a) If RV=0, then map sequences from k=0 to E-1 into bit positions from 0 to E-1 in the output sequence. Map sequences starting with k=0 and of length E' into bit positions from E to E+E'-1 in the output sequence.

[0139] b) If RV=1, then map sequences from k=A / 4 to A / 4+E-1 into bit positions from 0 to E-1 in the output sequence. Map sequences starting with k=A / 4 and of length E' into bit positions from E to E+E'-1 in the output sequence.

[0140] c) If RV=2, then map sequences from k=A / 2 to A / 2+E-1 into bit positions from 0 to E-1 in the output sequence. Map sequences starting with k=A / 2 and of length E' into bit positions from E to E+E'-1 in the output sequence.

[0141] d) If RV=3, then map sequences from k=3A / 4 through 3A / 4+E-1 into bit positions from 0 through E-1 in the output sequence. Map sequences starting with k=3A / 4 and of length E' into bit positions from E through E+E'-1 in the output sequence.

[0142] 6, this sequence is possibly scrambled and modulated to generate complex-valued symbols, which are then mapped to the last RE allocated in order of increasing sequence numbers starting from the M+1th RE in a time-domain / frequency-domain priority manner, and the remaining information is then mapped onto the first M REs in a time-domain / frequency-domain priority manner, where the information mapped onto the first M REs is the same as the information mapped onto the (M+1)th to 2Mth REs.

[0143] In this embodiment, resource mapping is performed iteratively, that is, the information mapped on the first symbol is the same as the information mapped on the second symbol, so that the first symbol of the receiving terminal device can be used for AGC adjustment, and the second symbol and the following symbols can be used for data demodulation, which is convenient to improve the demodulation success rate and communication efficiency.

[0144] Alternatively, in the embodiment, a repetitive process is performed during resource mapping, and the information mapped onto the first M REs is the same as the information mapped onto the (M+1) to 2M REs. In this way, when the PSCCH is powered up, the PSSCH of M REs overlapping with the PSCCH in the time domain is repetitive information with a smaller power spectral density, and the REs after the first M REs can be used for data demodulation, which makes it easier to improve the demodulation success rate and communication efficiency.

[0145] Example 3 (This Example 3 is presented in four sub-examples) In a first sub-embodiment, the terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0146] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000053.tif724However, TIFF0007602531000054.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000055.tif77 is the modulation order, TIFF0007602531000056.tif54 is the number of layers.

[0147] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000057.tif728However, TIFF0007602531000058.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000059.tif77 is the modulation order, TIFF0007602531000060.tif54 is the number of layers.

[0148] In this embodiment, the output sequence length after rate matching is E+E'.

[0149] 2. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A based on the value of E, where A is the length of the circular buffer.

[0150] 3. After polar coding, sub-block interleaving is performed, and the sequence length after interleaving is A.

[0151] 4. Input a sequence of length A into a circular buffer.

[0152] 5. If shortening is used to select bits, Map the sequence k=AE through A to bit positions such that the output sequence runs from E' through E+E'-1; Starting with k=AE, map a sequence of length E' to bit positions from 0 to E'-1 in the output sequence. After rate matching, generate a sequence of length E+E'.

[0153] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last assigned symbol in ascending order of the sequence, starting from the first symbol, in a time-domain first / frequency-domain first order.

[0154] In a second sub-embodiment, the terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0155] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000061.tif724 However, TIFF0007602531000062.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000063.tif77 is the modulation order, TIFF0007602531000064.tif54 is the number of layers.

[0156] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000065.tif728However, TIFF0007602531000066.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000067.tif77 is the modulation order, TIFF0007602531000068.tif54 is the number of layers.

[0157] In this embodiment, the output sequence length after rate matching is E+E'.

[0158] 2. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A based on the value of E, where A is the length of the circular buffer.

[0159] 3. After polar coding, sub-block interleaving is performed. The sequence length after interleaving is A.

[0160] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0161] 5. If puncturing is used to select bits, Map the sequence k=0 to E-1 to bit positions such that the output sequence runs from E' to E+E'-1; Starting with k=0, we map a sequence of length E' such that the output sequence runs from bit position 0 to E'-1.

[0162] After rate matching, we generate a sequence of length E+E'.

[0163] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped in a time-domain / frequency-domain priority manner starting from the first symbol of the allocated resource and gradually increasing the sequence number to the last symbol of the allocated resource.

[0164] In a third sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0165] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000069.tif724 However, TIFF0007602531000070.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000071.tif77 is the modulation order, TIFF0007602531000072.tif54 is the number of layers.

[0166] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000073.tif728However, TIFF0007602531000074.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000075.tif77 is the modulation order, TIFF0007602531000076.tif54 is the number of layers.

[0167] In this embodiment, the output sequence length after rate matching is E+E'.

[0168] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0169] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0170] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0171] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching. Starting from the start position of the currently transmitted RV, map a sequence of length E to bit positions from E' to E+E'-1 in the output sequence. For example, a) If RV=0, map sequences from k=0 to E-1 into bit positions in the output sequence from E' to E+E'-1. Map sequences starting with k=0 and of length E' into bit positions in the output sequence from 0 to E'-1.

[0172] b) If RV=1, then map sequences from k=A / 4 to A / 4+E-1 into bit positions in the output sequence from E' to E+E'-1. Map sequences starting with k=A / 4 and of length E' into bit positions in the output sequence from 0 to E'-1.

[0173] c) If RV=2, then map sequences from k=A / 2 to A / 2+E-1 into bit positions in the output sequence from E' to E+E'-1. Map sequences starting with k=A / 2 and of length E' into bit positions in the output sequence from 0 to E'-1.

[0174] d) If RV=3, then map sequences from k=3A / 4 through 3A / 4+E-1 into bit positions in the output sequence from E' through E+E'-1. Map sequences starting with k=3A / 4 and of length E' into bit positions in the output sequence from 0 through E'-1.

[0175] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last symbol in a time-domain / frequency-domain priority order, with the sequence numbers being assigned in an increasing order starting from the first symbol.

[0176] In a fourth sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0177] 1. If the number of symbols of the PSCCH is 2, the number of REs of the PSSCH (see the PSCCH in part A of FIG. 2) that overlaps with the PSCCH in the time domain is M. The transmitting end terminal device calculates the coding bit length E that can be added when the available resources do not include the REs of the PSSCH that overlap with the PSCCH in the time domain, that is, the coding bit length E that can be added to the REs in part B of FIG. 2, according to the following formula: TIFF0007602531000077.tif724 However, TIFF0007602531000078.tif78 is the number of available REs after removing the PSSCH that overlaps with the PSCCH in the time domain from the scheduled resources, TIFF0007602531000079.tif77 is the modulation order, TIFF0007602531000080.tif54 is the number of layers.

[0178] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0179] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0180] 4. Input a sequence of length A into the circular buffer and define E+E' as the length of the sequence after rate matching.

[0181] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching. Starting from the start position of the currently transmitted RV, map a sequence of length E to bit positions from E' to E+E'-1 in the output sequence. For example, a) If RV=0, map sequences from k=0 to E-1 into bit positions in the output sequence from E' to E+E'-1. Map sequences starting with k=0 and of length E' into bit positions in the output sequence from 0 to E'-1.

[0182] b) If RV=1, then map sequences from k=A / 4 to A / 4+E-1 into bit positions in the output sequence from E' to E+E'-1. Map sequences starting with k=A / 4 and of length E' into bit positions in the output sequence from 0 to E'-1.

[0183] c) If RV=2, then map sequences from k=A / 2 to A / 2+E-1 into bit positions in the output sequence from E' to E+E'-1. Map sequences starting with k=A / 2 and of length E' into bit positions in the output sequence from 0 to E'-1.

[0184] d) If RV=3, then map sequences from k=3A / 4 through 3A / 4+E-1 into bit positions in the output sequence from E' through E+E'-1. Map sequences starting with k=3A / 4 and of length E' into bit positions in the output sequence from 0 through E'-1.

[0185] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last symbol in a time-domain / frequency-domain priority order, with the sequence numbers being assigned in an increasing order starting from the first symbol.

[0186] In this embodiment, resource mapping is performed iteratively, that is, the complex-valued symbol mapped on the first symbol is the same as the complex-valued symbol mapped on the second symbol.In this way, the first symbol of the receiving end terminal device can be used for AGC adjustment, and the second symbol and the following symbols can be used for data demodulation, which is convenient to improve the demodulation success rate and communication efficiency.

[0187] Alternatively, in this embodiment, a repetitive process is performed during resource mapping, and the information mapped onto the first M REs is the same as the information mapped onto the (M+1) to 2M REs. In this way, when the PSCCH is powered up, the PSSCH of M REs overlapping with the PSCCH in the time domain is repetitive information with smaller power spectral density, and the REs after the first M REs can be used for data demodulation, which is easy to improve the demodulation success rate and communication efficiency.

[0188] Example 4 The terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0189] 1. Determine the number of AGC symbols according to the relationship between numerology and AGC symbol.

[0190] Specifically, for example, if the frequency is 15 kHz, the AGC is 0.5 symbol, and if not, the AGC is 1 symbol. In this embodiment, if the numerology is 15 kHz, the AGC is 0.5 symbol.

[0191] 2. The transmitting terminal equipment calculates the coding bit length E that can be added when the available resources do not include 0.5 symbol AGC according to the following formula: TIFF0007602531000081.tif724 However, TIFF0007602531000082.tif78 is the number of available REs after removing 0.5 symbol number of AGC from the scheduled resource, TIFF0007602531000083.tif77 is the modulation order, TIFF0007602531000084.tif54 is the number of layers.

[0192] In this embodiment, the output sequence length after rate matching is E.

[0193] 3. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A based on the value of E, where A is the length of the circular buffer.

[0194] 4. After polar coding, sub-block interleaving is performed. The sequence length after interleaving is A.

[0195] 5. Input a sequence of length A into a circular buffer.

[0196] 6. Bit selection is performed based on the DCI rate matching process.

[0197] 7. After possible scrambling, modulate to generate complex-valued symbols. If the numerology is 15kHz, the generated complex-valued symbols are mapped to the last symbol of the available resource, which is allocated in a manner that the sequence number increases from the first symbol according to the time domain priority / frequency domain priority principle. Among them, the first symbol is one available resource every other RE in the frequency domain, and the AGC occupies the first half of the available resources.

[0198] Example 5 The terminal equipment has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping based on the following steps:

[0199] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000085.tif724However, TIFF0007602531000086.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000087.tif77 is the modulation order, TIFF0007602531000088.tif54 is the number of layers.

[0200] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000089.tif728However, TIFF0007602531000090.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000091.tif77 is the modulation order, TIFF0007602531000092.tif54 is the number of layers.

[0201] In this embodiment, the output sequence length after rate matching is E+E'.

[0202] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0203] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0204] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0205] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching. Starting from the start position of the currently transmitted RV, map a sequence of length E to bit positions of the output sequence from 0 to E-1, and map a sequence of length E' to bit positions of the output sequence from E to E+E'-1 to obtain a sequence of length E+E'. This sequence of length E+E' is modulated through possible scrambling to generate complex-valued symbols. Based on the version of the RV, select whether to start mapping from the second symbol or the first symbol.

[0206] a) If RV=0, map the generated complex-valued symbols onto the last allocated symbol in increasing sequence order starting from the second symbol on a time domain first / frequency domain first basis, and then map the remaining sequence onto the first symbol.

[0207] b) If RV=1, map the generated complex-valued symbols onto the last allocated symbol in increasing sequence order starting from the second symbol in a time-domain / frequency-domain priority order, and then map the remaining sequence onto the first symbol.

[0208] c) If RV=2, the generated complex-valued symbol is mapped to the last symbol, which is assigned in a manner in which the sequence number increases from the first symbol, on the principle of time domain priority / frequency domain priority.

[0209] d) If RV=3, the generated complex-valued symbol is mapped to the last symbol, which is assigned in a manner in which the sequence number increases from the first symbol, on the principle of time domain priority / frequency domain priority.

[0210] Example 6 (This Example 6 is presented in four sub-examples) In a first sub-embodiment, the terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0211] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000093.tif724 However, TIFF0007602531000094.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000095.tif77 is the modulation order, TIFF0007602531000096.tif54 is the number of layers.

[0212] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000097.tif728However, TIFF0007602531000098.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000099.tif77 is in modulation order, TIFF0007602531000100.tif54 is the number of layers.

[0213] In this embodiment, the output sequence length after rate matching is E+E'.

[0214] 2. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A based on the value of E, where A is the length of the circular buffer.

[0215] 3. After polar coding, sub-block interleaving is performed. The sequence length after interleaving is A.

[0216] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0217] 5. If shortening is used to select bits, Map the sequence k=AE through A to bit positions such that the output sequence runs from 0 through E-1; Starting with k=0, we map a sequence of length E' to bit positions such that the output sequence goes from E to E+E'-1.

[0218] After rate matching, we generate a sequence of length E+E'.

[0219] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last assigned symbol in ascending order of the sequence starting from the second symbol according to the time domain first / frequency domain first principle, and then the remaining sequence is loop-mapped to the first symbol.

[0220] In a second sub-embodiment, the terminal device has one PSCCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0221] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000101.tif724 However, TIFF0007602531000102.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000103.tif77 is the modulation order, TIFF0007602531000104.tif54 is the number of layers.

[0222] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000105.tif728However, TIFF0007602531000106.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000107.tif77 is the modulation order, TIFF0007602531000108.tif54 is the number of layers.

[0223] In this embodiment, the output sequence length after rate matching is E+E'.

[0224] 2. Add CRC to the input PSCCH, divide it into code blocks, and perform polar coding. In polar coding, calculate the polar encoder output coding length A based on the value of E, where A is the length of the circular buffer.

[0225] 3. After polar coding, sub-block interleaving is performed. The sequence length after interleaving is A.

[0226] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0227] 5. If puncturing is used to select bits, Map the sequence k=0 to E-1 to bit positions such that the output sequence is from 0 to E-1; Starting with k=E, we map a sequence of length E' to bit positions such that the output sequence goes from E to E+E'-1.

[0228] After rate matching, we generate a sequence of length E+E'.

[0229] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last assigned symbol in ascending order of the sequence starting from the second symbol according to the time domain first / frequency domain first principle, and then the remaining sequence is loop-mapped to the first symbol.

[0230] In a third sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0231] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000109.tif724 However, TIFF0007602531000110.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000111.tif77 is the modulation order, TIFF0007602531000112.tif54 is the number of layers.

[0232] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000113.tif728However, TIFF0007602531000114.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000115.tif77 is the modulation order, TIFF0007602531000116.tif54 is the number of layers.

[0233] In this embodiment, the output sequence length after rate matching is E+E'.

[0234] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0235] 3. After LDPC coding, output a sequence whose length is A.

[0236] 4. Input a sequence of length A into the circular buffer. Define E+E' as the length of the sequence after rate matching.

[0237] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching. Starting from the start position of the currently transmitted RV, map a sequence of length E+E' to bit positions from 0 to E+E'-1 in the output sequence. For example, a) If RV=0, map the sequence k=0 to E+E'-1 to bit positions such that the output sequence runs from 0 to E+E'-1.

[0238] b) If RV=1, map the sequence k=A / 4 through A / 4+E+E'-1 to bit positions such that the output sequence runs from 0 through E+E'-1.

[0239] c) If RV=2, map the sequence from k=A / 2 to A / 2+E+E'-1 into bit positions such that the output sequence runs from 0 to E+E'-1.

[0240] d) If RV=3, map the sequence from k=3A / 4 through 3A / 4+E+E'-1 into bit positions such that the output sequence runs from 0 through E+E'-1.

[0241] 6. This sequence is optionally scrambled and then modulated to generate complex-valued symbols, which are then mapped to the last assigned symbol in increasing sequence number order starting from the second symbol according to the time domain first / frequency domain first principle, and the remaining information is then loop-mapped onto the first symbol.

[0242] In a fourth sub-embodiment, the terminal device has one PSSCH that needs to be transmitted, and performs rate matching and resource mapping according to the following steps:

[0243] 1. If the number of symbols of the PSCCH is 2, the number of REs of the PSSCH (see the PSCCH in part A of FIG. 2) that overlaps with the PSCCH in the time domain is M. The transmitting end terminal device calculates the coding bit length E that can be added when the available resources do not include the REs of the PSSCH that overlap with the PSCCH in the time domain, that is, the coding bit length E that can be added to the REs in part B of FIG. 2, according to the following formula: TIFF0007602531000117.tif724 However, TIFF0007602531000118.tif78 is the number of available REs after removing the PSSCH that overlaps with the PSCCH in the time domain from the scheduled resources, TIFF0007602531000119.tif77 is the modulation order, TIFF0007602531000120.tif54 is the number of layers.

[0244] 2. CRC is added to the input PSSCH, code block division is performed, and LDPC coding is performed.

[0245] 3. After LDPC coding, output a sequence of length A, where A is the length of the circular buffer.

[0246] 4. Input a sequence of length A into the circular buffer and define E+E' as the length of the sequence after rate matching.

[0247] 5. Based on the rate matching process of PUSCH / PDSCH, perform rate matching. Starting from the start position of the currently transmitted RV, map a sequence of length E+E' to bit positions from 0 to E+E'-1 in the output sequence. For example, a) If RV=0, map the sequence k=0 to E+E'-1 to bit positions such that the output sequence runs from 0 to E+E'-1.

[0248] b) If RV=1, map the sequence k=A / 4 through A / 4+E+E'-1 to bit positions such that the output sequence runs from 0 through E+E'-1.

[0249] c) If RV=2, map the sequence from k=A / 2 to A / 2+E+E'-1 into bit positions such that the output sequence runs from 0 to E+E'-1.

[0250] d) If RV=3, map the sequence from k=3A / 4 through 3A / 4+E+E'-1 into bit positions such that the output sequence runs from 0 through E+E'-1.

[0251] 6, this sequence is possibly scrambled and then modulated to generate complex-valued symbols, which are then mapped in a time-domain / frequency-domain priority manner to the last RE of the last symbol allocated in increasing sequence order starting from the M+1th RE, and the remaining information is then mapped onto the first M REs in a time-domain / frequency-domain priority manner.

[0252] Example 7 In the terminal device, there is one PSSCH that needs to be transmitted. The terminal device configures slot aggregation for transmitting one large transmission block, and performs rate matching and resource mapping based on the following steps:

[0253] 1. For one-symbol AGC, the transmitting terminal device calculates the coding bit length E that can be added when the available resources do not include one-symbol AGC according to the following formula: TIFF0007602531000121.tif724 However, TIFF0007602531000122.tif78 is the number of available REs after removing one symbol number of AGC from the scheduled resource, TIFF0007602531000123.tif77 is the modulation order, TIFF0007602531000124.tif54 is the number of layers.

[0254] Then, the coding bit length E' that can be added to the AGC for one symbol is calculated based on the following formula. TIFF0007602531000125.tif728However, TIFF0007602531000126.tif712 is the number of available REs in 1 symbol AGC, TIFF0007602531000127.tif77 is the modulation order, TIFF0007602531000128.tif54 is the number of layers.

[0255] In this embodiment, the output sequence length after rate matching is E+E'.

[0256] 2. The subsequent steps of this embodiment can be referred to the third sub-embodiment of embodiment 2.

[0257] In this embodiment, slot aggregation is arranged, and an AGC symbol is normally present at the start position of each slot, which is the same as the processing method in the previous embodiment.

[0258] Alternatively, when a slot aggregation is regarded as one scheduling, the AGC symbol is present only at the start position of the slot aggregation.

[0259] Above, the method for sidelink rate matching and resource mapping according to the embodiment of the present disclosure is described in detail in conjunction with Figures 1 and 2. Hereinafter, the terminal device according to the embodiment of the present disclosure will be described in detail in conjunction with Figure 3.

[0260] 3 is a structural schematic diagram of a terminal device according to an embodiment of the present disclosure. As shown in FIG. 3, the terminal device 300 includes: A calculation module 302, which can be used to calculate an available coding bit length E according to a resource size of a target resource when the available resource does not include the target resource; and a resource mapping module 304 that can be used to perform resource mapping based on a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource.

[0261] In the embodiment of the present disclosure, the terminal device can calculate the coding bit length E that can be added when the available resource does not include the target resource according to the resource size of the target resource, and can perform resource mapping according to the coding bit sequence of the rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the coding bit length that can be added to the target resource. The embodiment of the present disclosure provides a solution to the rate matching and resource mapping of NR sidelink by calculating the coding bit length that can be added when the available resource does not include the target resource, and the target resource in the available resource is considered during the rate matching and resource mapping, which is easy to improve the demodulation success rate of sidelink data and the transmission efficiency of the system.

[0262] Optionally, in one embodiment, the target resource is: The resources occupied by the AGC, or It includes resources occupied by the PSSCH that overlap in the time domain with resources occupied by the PSCCH.

[0263] Optionally, in one embodiment, the resource mapping module 304 specifically: may be used to map a coding bit sequence of a rate matching output from the N+1th symbol of the available resource in ascending sequence order to the last symbol of the available resource, and further to map a remaining coding bit sequence from the first symbol of the available resource in ascending sequence order to the Nth symbol of the available resource; Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', N is related to a transport block size, and the transport block size is related to the available resources.

[0264] Optionally, in one embodiment, the resource mapping module 304 specifically: may be used to map the coding bit sequence of the rate matching output from the M+1th resource particle RE of the available resource in ascending sequence order to the last RE of the available resource, and further map the remaining coding bit sequence from the first RE of the available resource to the Mth RE in ascending sequence order; Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', the target resources include the resources occupied by the PSSCH, and M is the number of REs occupied by the PSSCH.

[0265] Optionally, in one embodiment, the resource mapping module 304 specifically: The coding bit sequence of the rate matching output may be used to map the coding bit sequence from the N+1th symbol of the available resource to the last symbol of the available resource in an increasing sequence order, and the complex-valued symbols mapped by the first N symbols in the available resource are the same as the complex-valued symbols mapped by the (N+1)th to 2Nth symbols; Wherein, the length of the coding bit sequence of the rate matching output is equal to E, and N is related to a transport block size, which is related to the available resources.

[0266] Optionally, in one embodiment, the resource mapping module 304 specifically: The coding bit sequence of the rate matching output can be used to map from the M+1th RE of the available resource to the last RE of the available resource in an increasing sequence order, and the complex-valued symbols mapped onto the first M REs in the available resource are the same as the complex-valued symbols mapped onto the (M+1)th to 2Mth REs; Wherein, the length of the coding bit sequence of the rate matching output is equal to E, the target resources include the resources occupied by the PSSCH, and M is the number of REs occupied by the PSSCH.

[0267] Optionally, in one embodiment, the resource mapping module 304 specifically: a rate matching output coding bit sequence may be used to map the coding bit sequence from a first symbol of the available resource to a last symbol of the available resource in ascending sequence order; Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', N is related to a transport block size, and the transport block size is related to the available resources.

[0268] Optionally, in one embodiment, the resource mapping module 304 specifically: a rate matching output coding bit sequence may be used to map the coding bit sequence from a first symbol of the available resource to a last symbol of the available resource in ascending sequence order; Wherein, the number of available resource particles RE on the first symbol is half the total number of RE on the first symbol, and the length of the coding bit sequence of the rate matching output is equal to E.

[0269] Optionally, as an embodiment, In the available resource, the mapping information of the first N symbols is a repetition of the mapping information of the (N+1)th to 2Nth symbols; or In the available resources, the mapping information of the first M REs is a repetition of the mapping information of the (M+1)th to 2Mth REs.

[0270] Optionally, in one embodiment, the terminal device 300 if polar coding, generating a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from the k=0 position of the coding bits, and the subsequence of length E' is after the subsequence of length E; or If the coding is polar, the rate matching module may generate a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from a position k=AE of the coding bit, and the subsequence of length E' may be used after the subsequence of length E; Wherein, A is the length of the circular buffer, A is calculated based on E, and k represents the starting output position of the coding bit.

[0271] Optionally, in one embodiment, the terminal device 300 For LDPC coding, the rate matching module may further include a rate matching module that generates a sequence of length E'+E by starting from the start information position of the redundancy version and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' may be used after the subsequence of length E.

[0272] Optionally, in one embodiment, the terminal device 300 if polar coding, generating a sequence of length E'+E by outputting a subsequence starting at coding bit position k=AE and having length E of the first sequence, and outputting a subsequence starting at coding bit position k=0 and having length E' of the second sequence, the subsequence being after the subsequence of length E; or if polar coding, generating a sequence of length E'+E by outputting a subsequence starting at coding bit position k=0 and having a length of the first sequence length E, and outputting a subsequence starting at coding bit position k=E and having a length of the second sequence length E', the subsequence of length E' being after the subsequence of length E; or and a rate matching module that can be used for polar coding to generate a sequence of length E'+E by outputting a subsequence of length E'+E starting at a coding bit position k=E mod A and a subsequence of length E' starting at a coding bit position k=(E mod A)+E and a subsequence of length E', the subsequence of length E' being after the subsequence of length E; Wherein, A is the length of the circular buffer, A is calculated based on E, k represents the starting output position of the coding bit, and mod represents the modulo operation.

[0273] Optionally, in one embodiment, the terminal device 300 In the case of LDPC coding, generating a sequence of length E'+E by starting from position m=E of the redundancy version and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' is after the subsequence of length E; or Further comprising a rate matching module that can be used for LDPC coding, starting from a position m=E mod A of the redundancy version, and outputting a subsequence having a length of the second sequence length E' and a subsequence having a length of the first sequence length E, respectively, to generate a sequence having a length of E'+E, and the subsequence having a length of E' is after the subsequence having a length of E; Wherein, A is the length of the circular buffer, A is calculated based on E, m represents the starting output position, and mod represents the modulo operation.

[0274] Optionally, in one embodiment, the terminal device 300 if polar coding, generating a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from the k=0 position of the coding bits, and the subsequence of length E' is before the subsequence of length E; or If the coding is polar coding, the rate matching module may generate a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from a position k=AE of the coding bit, and the subsequence of length E' may be used before the subsequence of length E; Wherein, A is the length of the circular buffer, A is calculated based on E, and k represents the starting output position of the coding bit.

[0275] Optionally, in one embodiment, the terminal device 300 For LDPC coding, the rate matching module may further include a rate matching module that generates a sequence of length E'+E by starting from the start information position of the redundancy version and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' may be used before the subsequence of length E.

[0276] Optionally, in one embodiment, the terminal device 300 The method further includes a selection module that can be used to determine a starting symbol position or a starting RE position of the resource mapping based on a configuration of a parameter set.

[0277] Optionally, in one embodiment, the terminal device 300 The method further includes a selection module that can be used to determine a starting symbol position or a starting RE position of the resource mapping based on a redundancy version.

[0278] Optionally, in one embodiment, the selection module specifically comprises: Depending on whether LBRM is enabled and the redundancy version, it can be used to determine the starting symbol position or starting RE position of the resource mapping.

[0279] The terminal device 300 according to the embodiment of the present disclosure can refer to the flow of the method 100 corresponding to the embodiment of the present disclosure, and each unit / module and other operations and / or functions in the terminal device 300 are for respectively realizing the corresponding flow in the method 100, and can achieve the same or equivalent technical effects. For the sake of brevity, no further description will be given here.

[0280] FIG. 4 is a block diagram of a terminal device according to another embodiment of the present disclosure. The terminal device 400 shown in FIG. 4 includes at least one processor 401, a memory 402, at least one network interface 404, and a user interface 403. The components in the terminal device 400 are coupled to each other via a bus system 405. As can be understood, the bus system 405 is used to realize the connection communication between these components. The bus system 405 further includes a data bus, a power bus, a control bus, and a status signal bus. However, for the sake of clarity, various buses are described as the bus system 405 in FIG. 4.

[0281] Among them, the user interface 403 may include a display, a keyboard, a clicking device (e.g., a mouse, a trackball), a touchpad or a touch screen, etc.

[0282] As can be appreciated, memory 402 in the embodiments of the present disclosure may be volatile or non-volatile memory, or may include both volatile and non-volatile memory. Among them, non-volatile memory may be Read-Only Memory (ROM), Programmable Read-Only Memory (PROM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM) or Flash memory. Volatile memory may be Random Access Memory (RAM) used as an external cache. By way of example and not limitation, many types of RAM may be used, such as static random access memory (Static RAM, SRAM), dynamic random access memory (DRAM, DRAM), synchronous dynamic random access memory (Synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDRSDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), synchronous linked dynamic random access memory (Synchlink DRAM, SLDRAM), and direct Rambus random access memory (Direct Rambus RAM, DRRAM). The memory 402 of the systems and methods described in the embodiments of the present disclosure is intended to include, but is not limited to, these and any other suitable types of memory.

[0283] In some embodiments, memory 402 stores elements such as an operating system 4021 and application programs 4022, which may be executable modules or data structures, or a subset or extension thereof.

[0284] Among them, the operating system 4021 includes various system programs, such as a framework layer, a core library layer, a drive layer, etc., and is used to realize various basic services and process tasks based on hardware. The application programs 4022 include various application programs, such as a media player, a browser, etc., and are used to realize various application services. A program for realizing the method of the embodiment of the present disclosure may be included in the application programs 4022.

[0285] In an embodiment of the present disclosure, the terminal device 400 further includes a computer program stored in the memory 402 and operable on the processor 401, which, when executed by the processor 401, realizes the steps of the method 100 as follows:

[0286] The method disclosed in the embodiment of the present disclosure may be used in or realized by the processor 401. The processor 401 may be an integrated circuit chip having a signal processing capability. In the implementation process, each step of the method may be completed by an instruction in the form of a hardware integrated logic circuit or software in the processor 401. The 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 device, a discrete gate or transistor logic device, or a discrete hardware component. Each method, step, and logic block diagram disclosed in the embodiment of the present disclosure may be realized or executed. The general-purpose processor may be a microprocessor, or the processor may be any ordinary processor, etc. The steps of the method disclosed in connection with the embodiment of the present disclosure may be directly embodied to be executed and completed by a hardware decoding processor, or may be executed and completed by a combination of hardware and software modules in the decoding processor. The software module may be located in a computer-readable storage medium mature in the art, such as a random memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. This computer-readable storage medium is located in the memory 402, and the processor 401 reads the information in the memory 402 and combines the hardware to complete the steps of the above method. Specifically, the computer-readable storage medium stores a computer program, which, when executed by the processor 401, realizes each step of the above method 100.

[0287] As can be understood, the embodiments described in the embodiments of the present disclosure may be implemented in hardware, software, firmware, middleware, microcode, or a combination thereof. For a hardware implementation, the processing unit may be implemented in one or more Application Specific Integrated Circuits (ASIC), Digital Signal Processing (DSP), Digital Signal Processing Device (DSPD), Programmable Logic Device (PLD), Field-Programmable Gate Array (FPGA), general-purpose processor, controller, microcontroller, microprocessor, other electronic unit for performing the functions described in the present disclosure, or a combination thereof.

[0288] For a software implementation, the techniques described in the embodiments of the present disclosure may be implemented by modules (e.g., processes, functions, etc.) that perform functions described in the embodiments of the present disclosure. The software code may be stored in a memory and executed via a processor. The memory may be implemented within the processor or external to the processor.

[0289] The terminal device 400 can implement each process implemented by the terminal device in the above embodiment, and can achieve the same or equivalent technical effects, which will not be described further here in order to avoid repetition.

[0290] The embodiment of the present disclosure further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, which, when executed by a processor, can realize each process of the above method embodiment 100 and achieve the same technical effect. In order to avoid repetition, no further description will be given here. Among them, examples of the computer-readable storage medium include non-transitory computer-readable storage media, such as read-only memory (abbreviated as ROM), random access memory (abbreviated as RAM), magnetic disk or optical disk.

[0291] It is to be noted that, in this specification, the terms "comprises," "including," or any other variations thereof, are intended to cover the non-exclusive "comprises," whereby a process, method, article, or apparatus that includes a set of elements not only includes those elements, but also includes other elements not specifically listed or that are inherent to such process, method, article, or apparatus. In the absence of further limitations, an element limited by the phrase "comprising a," does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0292] From the above description of the embodiments, it is clear to those skilled in the art that the methods of the above embodiments may be realized in the form of software and a necessary general-purpose hardware platform. Of course, they may be realized in either hardware or software, but in many cases, the former is a preferred embodiment. Based on this understanding, the technical solution of the present disclosure may be substantially or in part contributed to the prior art in the form of a software product. The computer software product is stored in a storage medium (e.g., ROM / RAM, magnetic disk, optical disk) and includes some instructions for causing a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the methods described in each embodiment of the present disclosure.

[0293] The above describes the embodiments of the present disclosure in conjunction with the accompanying drawings, but the present disclosure is not limited to the specific embodiments described above, and the specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many modifications based on the suggestions of the present disclosure without departing from the spirit of the present disclosure or the scope of protection of the claims, and all of them are within the scope of protection of the present disclosure.

Claims

1. 1. A method of sublink rate matching and resource mapping performed by a terminal device, comprising: Calculating an additional coding bit length E according to a resource size of a target resource when an available resource does not include the target resource; Perform resource mapping according to a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource; The target resource is the resources occupied by the automatic gain control AGC, or A part of resources of the physical sublink shared channel PSSCH overlapping with the physical sublink control channel PSCCH in the time domain; Performing resource mapping based on the coding bit sequence of the rate matching output, Mapping the coding bit sequence of the rate matching output from the N+1th symbol of the available resource to the last symbol of the available resource in an increasing sequence order, wherein the complex-valued symbols mapped by the first N symbols in the available resource are the same as the complex-valued symbols mapped by the (N+1)th to 2Nth symbols; A method for sublink rate matching and resource mapping, wherein a length of the coding bit sequence of the rate matching output is equal to E, and N is related to a transmission block size, the transmission block size being related to the available resources.

2. 1. A method of sublink rate matching and resource mapping performed by a terminal device, comprising: Calculating an additional coding bit length E according to a resource size of a target resource when an available resource does not include the target resource; Perform resource mapping according to a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource; The target resource is the resources occupied by the automatic gain control AGC, or A part of resources of the physical sublink shared channel PSSCH overlapping with the physical sublink control channel PSCCH in the time domain; Performing resource mapping based on the coding bit sequence of the rate matching output, mapping the coding bit sequence of the rate matching output from the N+1th symbol of the available resource in ascending sequence order to the last symbol of the available resource, and further mapping the remaining coding bit sequence from the 1st symbol of the available resource in ascending sequence order to the Nth symbol of the available resource; Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', N is related to a transmission block size, and the transmission block size is related to the available resources; Or, Performing resource mapping based on the coding bit sequence of the rate matching output, Mapping the coding bit sequence of the rate matching output from the M+1th resource particle RE of the available resource in ascending sequence order to the last RE of the available resource, and further mapping the remaining coding bit sequence from the first RE of the available resource in ascending sequence order to the Mth RE, Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', the target resource includes a portion of the resources of the PSSCH that overlap with the PSCCH in the time domain, M is the number of REs occupied by the portion of the resources of the PSSCH that overlap with the PSCCH in the time domain, and the available resource includes the resources occupied by the PSSCH; Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: if polar coding, generating a sequence of length E'+E by outputting a subsequence of length E', which is the second sequence length, and a subsequence of length E, which is the first sequence length, respectively, starting from the k=0 position of the coding bits, and the subsequence of length E' is after the subsequence of length E; or If it is polar coding, the coding bit k=A-E position, and by outputting a subsequence having a length of the second sequence length E' and a subsequence having a length of the first sequence length E, respectively, a sequence having a length of E'+E is generated, and the subsequence having a length of E' is after the subsequence having a length of E; Wherein, A is the length of the circular buffer, A is calculated based on E, and k represents the starting output position of the coding bit; Or, Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: The method for sublink rate matching and resource mapping further includes, if LDPC coding, generating a sequence of length E'+E by starting from a starting information position of a redundancy version and outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, and the subsequence of length E' is after the subsequence of length E.

3. 1. A method of sublink rate matching and resource mapping performed by a terminal device, comprising: Calculating an additional coding bit length E according to a resource size of a target resource when an available resource does not include the target resource; Perform resource mapping according to a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource; The target resource is the resources occupied by the automatic gain control AGC, or A part of resources of the physical sublink shared channel PSSCH overlapping with the physical sublink control channel PSCCH in the time domain; Performing resource mapping based on the coding bit sequence of the rate matching output, mapping the coding bit sequence of the rate matching output from the N+1th symbol of the available resource in ascending sequence order to the last symbol of the available resource, and further mapping the remaining coding bit sequence from the 1st symbol of the available resource in ascending sequence order to the Nth symbol of the available resource; Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', N is related to a transmission block size, and the transmission block size is related to the available resources; Or, Performing resource mapping based on the coding bit sequence of the rate matching output, Mapping the coding bit sequence of the rate matching output from the M+1th resource particle RE of the available resource in ascending sequence order to the last RE of the available resource, and further mapping the remaining coding bit sequence from the first RE of the available resource in ascending sequence order to the Mth RE, Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', the target resource includes a portion of the resources of the PSSCH that overlap with the PSCCH in the time domain, M is the number of REs occupied by the portion of the resources of the PSSCH that overlap with the PSCCH in the time domain, and the available resource includes the resources occupied by the PSSCH; Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: if polar coding, generating a sequence of length E'+E by outputting a subsequence starting at coding bit position k=A-E and having a length of the first sequence length E, and outputting a subsequence starting at coding bit position k=0 and having a length of the second sequence length E', the subsequence of length E' being after the subsequence of length E; or if polar coding, generating a sequence of length E'+E by outputting a subsequence starting at coding bit position k=0 and having a length of the first sequence length E, and outputting a subsequence starting at coding bit position k=E and having a length of the second sequence length E', the subsequence of length E' being after the subsequence of length E; or If polar coding, outputting a subsequence starting at position k=E mod A of the coding bits and having a length equal to the first sequence length E, and outputting a subsequence starting at position k=(E mod A)+E of the coding bits and having a length equal to the second sequence length E', thereby generating a sequence of length E'+E, and the subsequence of length E' is after the subsequence of length E; Wherein, A is the length of the circular buffer, A is calculated based on E, k represents the starting output position of the coding bit, and mod represents modulo operation; Or, Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: In the case of LDPC coding, generating a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from position m=E of the redundancy version, and the subsequence of length E' is after the subsequence of length E; or If it is LDPC coding, the method further includes: generating a sequence of length E'+E by outputting a subsequence having a length of the second sequence length E' and a subsequence having a length of the first sequence length E, respectively, starting from a position m=E mod A of the redundancy version, and the subsequence of length E' is after the subsequence of length E; Wherein, A is the length of the circular buffer, A is calculated based on E, m represents the starting output position, and mod represents the modulo operation. A method for sub-link rate matching and resource mapping.

4. 1. A method of sublink rate matching and resource mapping performed by a terminal device, comprising: Calculating an additional coding bit length E according to a resource size of a target resource when an available resource does not include the target resource; Perform resource mapping according to a coding bit sequence of a rate matching output, where the length of the coding bit sequence is equal to E or equal to E+E', where E' is the available coding bit length of the target resource; The target resource is the resources occupied by the automatic gain control AGC, or A part of resources of the physical sublink shared channel PSSCH overlapping with the physical sublink control channel PSCCH in the time domain; Performing resource mapping based on the coding bit sequence of the rate matching output, mapping the coding bit sequence of the rate matching output from a first symbol of the available resource to a last symbol of the available resource in ascending sequence order; Wherein, the length of the coding bit sequence of the rate matching output is equal to E+E', N is related to a transmission block size, and the transmission block size is related to the available resources; Or, Performing resource mapping based on the coding bit sequence of the rate matching output, mapping the coding bit sequence of the rate matching output from a first symbol of the available resource to a last symbol of the available resource in ascending sequence order; Wherein, the number of available resource particles RE on the first symbol is half the total number of RE on the first symbol, and the length of the coding bit sequence of the rate matching output is equal to E; Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: if polar coding, generating a sequence of length E'+E by outputting a subsequence of length E' of the second sequence and a subsequence of length E of the first sequence, respectively, starting from the k=0 position of the coding bits, and the subsequence of length E' is before the subsequence of length E; or If it is polar coding, generating a sequence of length E'+E by outputting a subsequence having a length of the second sequence length E' and a subsequence having a length of the first sequence length E, respectively, starting from a position k=A-E of the coding bits, and the subsequence of length E' is before the subsequence of length E; Wherein, A is the length of the circular buffer, A is calculated based on E, and k represents the starting output position of the coding bit; Or, Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: If it is LDPC coding, the method further includes: generating a sequence of length E'+E by outputting a subsequence having a length of the second sequence length E' and a subsequence having a length of the first sequence length E, respectively, starting from the start information position of the redundancy version, and the subsequence of length E' is before the subsequence of length E; A method for sub-link rate matching and resource mapping.

5. In the available resource, the mapping information of the first N symbols is a repetition of the mapping information of the (N+1) to 2N symbols; or The method according to claim 2 or 4, wherein the mapping information of the first M REs in the available resource is a repetition of the mapping information of the (M+1) to 2M REs.

6. Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: The method further includes determining a starting symbol position or a starting RE position of the resource mapping based on a configuration of the parameter set; Or, Before performing resource mapping according to the coding bit sequence of the rate matching output as described above, the method includes: The method according to any one of claims 1 to 5, further comprising determining a starting symbol position or a starting RE position of the resource mapping based on a redundancy version.

7. A terminal device comprising a memory, a processor, and a computer program stored in the memory and operable on the processor, the computer program implementing the steps of the sublink rate matching and resource mapping method of any one of claims 1 to 6 when executed by the processor.

Images