Transmission parameter determination method and apparatus, and storage medium, chip system and computer program product

Abstract

A transmission parameter determination method and apparatus, and a storage medium, a chip system and a computer program product, which are used for setting transmission parameters more rationally, thereby improving the communication performance. In the solution, the method comprises: a first apparatus acquiring a processing mode for first information, wherein the processing mode comprises at least one of the following: expanding the first information by N1 times in a time domain, N1 being a positive integer, expanding the first information by N2 times in a frequency domain, N2 being a positive integer, and mapping the first information in the frequency domain with an interlace N3 as an interval, N3 being a positive integer; and the first apparatus determining the size of the first information on the basis of a first parameter, wherein the first parameter is associated with at least one of N1, N2 and N3. After first information is processed in the processing mode described above, the number of resources that can be used for transmitting data is reduced. In the present application, a first apparatus can more accurately determine transmission parameters (e.g., the size of the first information) on the basis of a first parameter, thereby improving the transmission performance.

Description

Transmission parameter determination method, device, storage medium, chip system and computer program product

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of the People's Republic of China on February 8, 2024, with application number 202410177932.7 and application name "Transmission parameter determination method, device, storage medium, chip system and computer program product", all of which are incorporated by reference into this application. Technical Field

[0003] The present application relates to the field of mobile communication technologies, and in particular to a method, device, storage medium, chip system, and computer program product for determining transmission parameters. Background Art

[0004] In existing wireless communication technologies, a transmitting device typically modulates a bit sequence to be transmitted into a modulation symbol, maps the modulation symbol to a resource unit, and transmits it to a receiving device. However, the modulation symbols transmitted by the transmitting device are easily affected by various factors such as wireless channel path loss, shadowing, and multipath fading. This results in a low signal-to-interference-noise ratio for the modulation symbols received by the receiving device on a single resource unit, leading to a high probability of error in the bit sequence obtained by the receiving device through modulation symbol detection, seriously affecting the reliability of communication. For example, in ground-to-air communications, a terminal (such as a mobile phone) may need to communicate directly with a satellite. Due to factors such as the terminal's transmission power limitation, the quality of the link from the terminal to the satellite is usually poor.

[0005] To address this issue, the 3rd Generation Partnership Project (3GPP) Long Term Evolution (Revision 17, R17) introduced repetition-based coverage enhancement technology (such as extension technology) to improve communication reliability. For example, in the extension technology, the transmitting device modulates the bit sequence to be transmitted into a modulation symbol, multiplies the modulation symbol by different real numbers, and then maps the obtained different products to multiple resource units for transmission to the receiving device. In the scheme for communication based on the extension technology, the transmitting device needs to transmit the data multiple times (such as 32 times). How to set the transmission parameters has become an urgent problem that needs to be solved. Summary of the Invention

[0006] The present application provides a transmission parameter determination method, device, storage medium, chip system and computer program product for more reasonably setting transmission parameters to improve communication performance.

[0007] In the first aspect, the present application provides a method for determining transmission parameters. The method is performed by a first device, which may be a terminal device, a chip (system) inside a terminal device, a network device, or a chip (system) inside a network device. The first device may be a transmitting end of a first channel, used to send the first channel. Or the first device may be a receiving end of a first channel, used to receive the first channel. If the first device is the transmitting end of the first channel, the first device may determine the transmission parameters of the first channel according to the method provided in the present application, and then send the first channel according to the transmission parameters of the first channel. If the first device is the receiving end of the first channel, the first device may determine the transmission parameters of the first channel according to the method provided in the present application, and then recover the content carried on the first channel from the received signal.

[0008] In this solution, a first device obtains a processing method for the first information. The processing method includes at least one of the following: expanding the first information by a factor of N1 in the time domain, where N1 is a positive integer; expanding the first information by a factor of N2 in the frequency domain, where N2 is a positive integer; or mapping the first information in the frequency domain with comb teeth N3 as an interval, where N3 is a positive integer. The first device determines the size of the first information based on a first parameter. The first parameter is associated with at least one of N1, N2, and N3.

[0009] After the first information is processed by the above-mentioned processing method, the effective number of resources that can actually be used to transmit data (such as the first data) will be reduced. For example, the expansion (time domain expansion and / or frequency domain expansion) operation is essentially a repeated transmission of the signal or data before expansion, except that each repeated signal or data (or replica) is correspondingly multiplied by the code element of the expansion sequence. Therefore, the expansion (time domain expansion and / or frequency domain expansion) operation will reduce the number of available resources. For example, if data d occupies 3 symbols, when data d is expanded in the time domain (for example, the expansion length is 4), data b is obtained. Data b includes four elements, each of which is the result of multiplying data d by a code element. Data b occupies 12 symbols. Originally, all 12 symbols in a time slot can be used to transmit data d (i.e., the number of symbols that can be used to transmit data d is 12). However, in order to transmit data b (i.e., all 12 symbols in a time slot need to transmit data b), only 3 symbols in a time slot can actually be used to transmit data d (the remaining symbols are needed to transmit other extended data corresponding to data d), that is, the number of symbols that can be used to transmit data d is 3. It can be seen that after the extension process, the number of resources available for transmitting the first information (e.g., the first information before processing, such as data d) is reduced.

[0010] For another example, the first information is mapped in the frequency domain with the comb tooth N3 as the interval. In this case, some resources cannot be used to map signals or data, so the actual (or equivalent) number of resources that can be used to carry data or signals will be reduced.

[0011] The number of resources available for transmitting the first information is reduced, which in turn affects the size of the data packet corresponding to the first information. Based on this, the first device can obtain a more accurate number of resources for the first channel based on the first parameter, and then more accurately calculate the size of the data packet corresponding to the first information.

[0012] In the present application, "the number of resources used to transmit the first information" may refer to "the number of resources used to transmit the first information before being processed by the above-mentioned processing method". For example, when data d is expanded in the time domain (for example, the expansion length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. When data d is the first information, the number of resources used to transmit the first information (or the number of resources used to transmit the first information before being processed by the above-mentioned processing method) refers to the number of resources used to transmit data d, rather than the number of resources used to transmit data b. For other location-related content, please refer to the description here and will not be repeated.

[0013] In one possible implementation, at least one of N1, N2, and N3 is an integer greater than 1. In another possible implementation, N1 is an integer greater than 1. In another possible implementation, N2 is an integer greater than 1. In another possible implementation, N3 is an integer greater than 1. These implementations can improve the reliability of data transmission.

[0014] The first parameter of the present application may also be replaced by other names, for example, by: first value, extension length, etc. Optionally, the extension length may include / be / be determined according to: time domain extension length; frequency domain extension length; comb tooth size; joint length of time domain extension and frequency domain extension (for example, the product of time domain extension length and frequency domain extension length); joint length of time domain extension and comb division (for example, the product of time domain extension length and comb tooth size); or joint length of frequency domain extension and comb division (for example, the product of frequency domain extension length and comb tooth size), etc.

[0015] In one possible implementation of the first aspect, the first information may include the second information and / or the first data. The first information may be carried on a first channel. The second information may be carried on the first channel. The first channel may or may not carry the first data (or may not carry data).

[0016] For example, the first channel can be a channel on any link (such as a shared channel), including / being but not limited to: a physical uplink shared channel (PUSCH), a physical downlink shared channel (PDSCH) or a physical sidelink shared channel (PSSCH). Correspondingly, the corresponding link also has corresponding link control information. For example, the second information may include / be control information (CI). For example, the first channel is PUSCH, and the second information is uplink control information (UCI). For another example, the first channel is PDSCH, and the second information is downlink control information (DCI). For another example, the first channel is PSSCH, and the second information is sidelink control information (SCI).

[0017] For example, the second information may include control information. The second information may include / be at least one of: hybrid automatic repeat request acknowledgement (HARQ-ACK), channel state information (CSI)-1, CSI-2, and configured grant uplink control information (CG-UCI).

[0018] In a possible implementation of the first aspect, the first parameter includes any one of N1, N2, and N3; or the first parameter includes the product of any multiple values ​​of N1, N2, and N3.

[0019] In this application, after the above processing, the first information may obtain one or more information. The information obtained after the above processing is referred to as the processed first information. For example, when data d is expanded in the time domain (for example, the expansion length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. Data d belongs to the first information (or the first information before processing), and data b can belong to the processed first information.

[0020] In one possible implementation of the first aspect, a first device determines, based on a first parameter, a quantity of resources on a first channel that carries first information (e.g., the first information before processing). The first device determines a size of the first information based on the quantity of resources on the first channel. Because the first parameter affects the quantity of resources available on the first channel for transmitting the first information (the first information before processing), the quantity of resources on the first channel determined by the first device based on the first parameter is more accurate, and the first device can then obtain a more accurate size of the first information, thereby improving transmission performance.

[0021] In a possible implementation of the first aspect, the number of resources used to transmit the first information (eg, N RE ) may refer to: the number of resources used to transmit the first information before processing. For example, when data d is expanded in the time domain (for example, the extension length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. For example, in the case where data d belongs to the first information, the number of resources used to transmit the first information refers to the number of resources used to transmit data d (the first information before processing), rather than the number of resources used to transmit data b (the first information after processing). Similarly, the number of resources used to transmit the first information has decreased, which may mean that the number of resources that can be used to transmit the first information before processing (i.e., data d) has decreased. For other location-related content, please refer to the description here and will not be repeated.

[0022] In a possible implementation of the first aspect, the first device determines the number of resources allocated to the first channel on a resource unit based on a first parameter. The first device determines the number of resources of the first channel based on the number of resources allocated to the first channel on a resource unit. In this implementation, the first device can determine a relatively accurate number of resources allocated to the first channel on a resource unit based on the first parameter, thereby obtaining a more accurate size of the first information, thereby improving transmission performance.

[0023] In a possible implementation of the first aspect, the number of resources allocated to the first channel in the embodiment of the present application (eg, N′ RE1) may refer to: the number of resources that can be allocated to the first channel (the first channel includes or carries the first information before processing). For example, when data d is expanded in the time domain (for example, the extension length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. In the case where data d belongs to the first information, the number of resources allocated to the first channel may refer to the number of resources allocated to the first channel based on the number of resources used to transmit data d (the first information before processing), rather than the number of resources allocated to the first channel based on the number of resources for data b (the first information after processing). For other location-related content, please refer to the description here and will not be repeated. A channel (for example, the first channel) involved in this application includes an information (for example, the first information), which can be understood as the information being carried on the channel. The content carried by the channel may include the information and may also include some other information.

[0024] In a possible implementation of the first aspect, the number of resources allocated to the first channel (for example, based on the first information before processing) on ​​one resource unit satisfies the following formula:

[0025] Among them, N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, Indicates the number of resources on a resource unit. represents the number of time domain units (eg, time domain symbols) of the first channel, N0 represents a first parameter, Indicates the number of reference signals in a resource unit, Parameters configured through signaling.

[0026] It can be seen from this embodiment that since the first channel also carries a reference signal and / or overhead information, in the present application, the first device can calculate the total number of resources that can be used by the first channel minus the number of resources occupied by the reference signal and / or overhead information, thereby obtaining the number of resources that can be allocated to the first channel on a resource unit, and then the first device can obtain a more accurate size of the first information, thereby improving the transmission performance.

[0027] In a possible implementation of the first aspect, the number of resources of the first channel satisfies the following formula:

[0028] N RE =min(M0, N′ RE1 )·n PRB

[0029] Among them, N RE Indicates the number of resources allocated to the first channel, M0 is an integer, N' RE1Indicates the number of resources allocated to the first channel on a resource unit, n PRB Indicates the number of resource units allocated to the first channel. In this way, the number of resources of the first channel can be limited to not exceed M0 determined from the system perspective and the number of resources N' calculated in the above manner RE1 Thus, it is ensured from multiple dimensions that the value of the number of resources of the first channel finally determined is a reasonable and effective value, thereby improving the reliability of transmission.

[0030] In a possible implementation of the first aspect, the number of resources of the first channel satisfies the following formula:

[0031] N RE =min(M0, N′ RE2 )·n PRB / N0

[0032] Among them, N RE Indicates the number of resources allocated to the first channel, M0 is an integer, N' RE2 Indicates the number of resources allocated to the first channel on a resource unit, n PRB represents the number of resource units allocated to the first channel, and N0 represents a first parameter.

[0033] Since the number of resources (such as RE) that can be used to transmit data (such as the first data) will be reduced after the first information is processed by the above-mentioned processing method, the number of resources of the first channel determined by the first device based on the first parameter is more accurate, and then the first device can obtain a more accurate size of the first information, thereby improving the transmission performance.

[0034] In a possible implementation of the first aspect, the number of resources allocated to the first channel on a resource unit satisfies the following formula:

[0035] Among them, N′ RE2 Indicates the number of resources allocated to the first channel on a resource unit, Indicates the number of resources on a resource unit. represents the number of time domain units (eg, time domain symbols) of the first channel, Indicates the number of reference signals in a resource unit, Parameters configured through signaling.

[0036] It can be seen from this embodiment that since the first channel also carries a reference signal and / or overhead information, in the present application, the first device can calculate the total number of resources that can be used by the first channel minus the number of resources occupied by the reference signal and / or overhead information, thereby obtaining the number of resources that can be allocated to the first channel on a resource unit, and then the first device can obtain a more accurate size of the first information, thereby improving the transmission performance.

[0037] In a possible implementation of the first aspect, the first device determines the number of resources of the first channel based on the first parameter and the number of time domain units (e.g., time slots) occupied by the first data in the first channel. The number of time domain units (e.g., time slots) occupied by the first channel may be one or more.

[0038] In a possible implementation manner of the first aspect, the number of resources of the first channel satisfies one of the following:

[0039] N RE =N4·min(M0, N′ RE1 )·n PRB ; or, N RE =N4·min(M0, N′ RE2 )·n PRB / N0;

[0040] Among them, N RE represents the number of resources allocated to the first channel, N4 represents the number of time domain units (such as time slots) occupied by the first data in the first information, M0 is an integer, N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, n PRB Indicates the number of resource units allocated to the first channel, N′ RE2 represents the number of resources allocated to the first channel on a resource unit, and N0 represents a first parameter.

[0041] In a second aspect, the present application provides a method for determining a transmission parameter. The method is performed by a first device, which may be a terminal device, a chip (system) inside a terminal device, a network device, or a chip (system) inside a network device.

[0042] In this method, a first device obtains a processing method for first information. The processing method includes at least one of the following: expanding the first information by a factor of N1 in the time domain, where N1 is a positive integer; expanding the first information by a factor of N2 in the frequency domain, where N2 is a positive integer; or mapping the first information in the frequency domain with a comb tooth interval of N3, where N3 is a positive integer. The first device determines the number of coded modulation symbols for the second information based on a first parameter. The first parameter is associated with at least one of N1, N2, and N3.

[0043] The number of coded modulation symbols of the second information may be replaced by the number of coded modulation symbols per layer of the second information on each spatial layer or spatial stream.

[0044] After the first information is processed by the above-mentioned processing method, the resources that can actually be used to carry the data in the first information (the first information before being processed by the above-mentioned processing method) are reduced. For example, the expansion (time domain expansion and / or frequency domain expansion) operation is essentially a repeated transmission of the signal or data before expansion, except that each repeated signal or data (or replica) is multiplied by the code element of the expansion sequence accordingly. Therefore, the expansion (time domain expansion and / or frequency domain expansion) operation will reduce the number of available resources. For example, if data d occupies 3 symbols, when data d is expanded in the time domain (for example, the expansion length is 4), data b is obtained. Data b includes four elements, each of which is the result of multiplying data d by a code element. Data b occupies 12 symbols. Originally, all 12 symbols in a time slot could be used to transmit data d (i.e., the number of symbols available for transmitting data d is 12). However, in order to transmit data b (i.e., all 12 symbols in a time slot are required to transmit data b), only 3 symbols in a time slot can actually be used to transmit data d (the remaining symbols are required to transmit other extended data corresponding to data d), that is, the number of symbols available for transmitting data d is 3. It can be seen that after the extension process, the number of resources available for transmitting the first information (the first information before being processed by the above method, such as data d) is reduced.

[0045] For another example, the first information is mapped in the frequency domain with the comb tooth N3 as the interval. In this case, some resources cannot be used to map signals or data, so the actual (or equivalent) number of resources that can be used to carry data or signals will be reduced.

[0046] The amount of resources available on the first channel for carrying the second information should also be reduced accordingly. Otherwise, if this effect is not taken into account when performing rate matching on the first channel, the first device will allocate too many resources for the second information, resulting in a corresponding reduction in the resources available for transmitting data on the first channel, which will affect the transmission performance and reliability of the first channel.

[0047] Based on the above problem, in the solution provided in this application, the first device can determine the number of coded modulation symbols of the second information according to the first parameter, and then the first device performs rate matching on the first channel according to the number of coded modulation symbols of the second information.

[0048] The first device may perform rate matching on the first channel based on the number of coded modulation symbols of the second information. For example, the first device may remove the resources occupied by the coded modulation symbols corresponding to the second information from the resources of the first channel, and determine the amount of data (e.g., the first data) available for transmission on the first channel using the remaining resources. This process may be referred to as rate matching.

[0049] In a possible implementation of the second aspect, the first information includes second information and / or first data. The second information is carried on the first channel. For descriptions of the first parameter, the first information, the second information, the first data, and the first channel, refer to the description of the first aspect and possible implementations of the first aspect and are not repeated here.

[0050] In a possible implementation of the second aspect, the first device determines the number of resources used to transmit the second information in the first channel according to the first parameter. The first device determines the number of coded modulation symbols of the second information according to the number of resources used to transmit the second information in the first channel.

[0051] After the first information is processed in the above-mentioned manner, the resources used to carry the data in the first information increase, and the corresponding number of resources on the first channel that can be used to carry the second information will decrease. The first device can more accurately determine the number of resources in the first channel used to transmit the second information based on the first parameter, and then more accurately determine the number of coded modulation symbols of the second information. Then, the first device can more accurately perform rate matching on the first channel based on the number of coded modulation symbols of the second information.

[0052] In a possible implementation of the second aspect, the amount of resources used (available for) transmitting the second information in the first channel is determined by a result of the following formula:

[0053] Among them, N0 represents the first parameter, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the amount of resources used to transmit the second information in the time domain unit 1 in the first channel.

[0054] Represents the number of resources (e.g., REs) available on the first channel for carrying the second information. The above embodiment demonstrates that the first device, taking into account the aforementioned processing performed on the first information, proportionally reduces the number of resources on the first channel used for transmitting the second information. This solution is compatible with existing technologies, consistent with actual conditions, and simple and convenient to calculate.

[0055] In a possible implementation of the second aspect, the second information includes HARQ-ACK, the first channel carrying the second information carries data, and the number of coded modulation symbols of the HARQ-ACK satisfies the following formula:

[0056] Among them, Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O ACK Indicates the number of HARQ-ACK bits, L ACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, and ∑·is the summation operation.

[0057] In one possible implementation of the second aspect, the second information includes a HARQ-ACK. The first channel carrying the second information carries data. The data on the first channel is transmitted using a multi-slot transmission block (TB processing over multiple slots, TBoMS) technology. The number of coded modulation symbols of the HARQ-ACK satisfies the following formula:

[0058] Among them, Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O ACK Indicates the number of HARQ-ACK bits, L ACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time domain units (eg, time slots) occupied by the first data in the first information.

[0059] In a possible implementation of the second aspect, the second information includes a HARQ-ACK. When the first channel carrying the second information does not carry data, the number of coded modulation symbols of the HARQ-ACK satisfies the following formula:

[0060] Among them, Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O ACK Indicates the number of HARQ-ACK bits, L ACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, R represents the code rate of the first channel, Q m represents the modulation order of the first channel, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, and ∑·is the summation operation.

[0061] In a possible implementation of the second aspect, the second information includes HARQ-ACK and CG-UCI, and the number of coded modulation symbols of HARQ-ACK satisfies the following formula:

[0062] Among them, Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O CG-UCI Indicates the number of CG-UCI bits, O ACK Indicates the number of HARQ-ACK bits, L ACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time domain units (eg, time slots) occupied by the first data.

[0063] In a possible implementation of the second aspect, the second information includes a CG-UCI. When the first channel carrying the second information carries data, the number of coded modulation symbols of the CG-UCI satisfies the following formula:

[0064] Among them, Q′ CG-UCI Indicates the number of coded modulation symbols of CG-UCI, O CG-UCI Indicates the number of CG-UCI bits, L CG-UCI Indicates the number of bits of CG-UCI cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time slots occupied by the first data.

[0065] In a possible implementation of the second aspect, the second information includes CSI-1. The number of coded modulation symbols of CSI-1 satisfies the following formula:

[0066] Among them, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, O CSI-1 Indicates the number of CSI-1 bits, L CSI-1 Indicates the number of bits of the cyclic redundancy check of CSI-1, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is the summation operation, N4 represents the number of time domain units (such as time slots) occupied by the first data, and Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI.

[0067] In this application, Q′ACK / CG-UCI can be replaced by: Q′ ACK , Q′ CG-UCI , can also be replaced by: (Q′ ACK +Q′ CG-UCI ).

[0068] In a possible implementation of the second aspect, the second information includes CSI-1. The number of coded modulation symbols of CSI-1 satisfies the following formula:

[0069] Among them, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, O CSI-1 Indicates the number of CSI-1 bits, L CSI-1 Indicates the number of bits of the cyclic redundancy check of CSI-1, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI, min{·} represents the minimum value operation, is rounded up, and ∑·is the summation operation.

[0070] In a possible implementation of the second aspect, when the second information includes CSI-1 and CSI-2, the number of coded modulation symbols of CSI-1 satisfies the following formula:

[0071] Among them, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, O CSI-1 Indicates the number of CSI-1 bits, L CSI-1 Indicates the number of bits of the cyclic redundancy check of CSI-1, represents the adjustment factor, R represents the code rate of the first channel, Q m represents the modulation order of the first channel, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, min{·} is the minimum value operation, is rounded up, ∑· is the summation operation. ACK It can also be replaced by Q′ACK / CG-UCI. For related meanings, please refer to the descriptions elsewhere and will not be repeated here.

[0072] In a possible implementation of the second aspect, the second information includes CSI-1, and when the first channel carrying the second information does not carry CSI-2, the number of coded modulation symbols of CSI-1 satisfies the following formula:

[0073] Among them, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, min{·} is the minimum value operation, is rounded up, ∑· is the summation operation. ACK It can also be replaced by Q′ACK / CG-UCI. For related meanings, please refer to the descriptions elsewhere and will not be repeated here.

[0074] In a possible implementation of the second aspect, the second information includes CSI-2, and the number of coded modulation symbols of the CSI-2 satisfies the following formula:

[0075] Among them, Q′ CSI-2 Indicates the number of coded modulation symbols of CSI-2, O CSI-2 Indicates the number of CSI-2 bits, L CSI-2 Indicates the number of bits of the CSI-2 cyclic redundancy check. represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, min{·} is the minimum value operation, is rounded up, ∑·is the summation operation, N4 represents the number of time domain units (such as time slots) occupied by the first data, and Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI.

[0076] In a possible implementation of the second aspect, the second information includes CSI-2, and the number of coded modulation symbols of the CSI-2 satisfies the following formula:

[0077] Among them, Q′ CSI-2 Indicates the number of coded modulation symbols of CSI-2, O CSI-2 Indicates the number of CSI-2 bits, L CSI-2 Indicates the number of bits of the CSI-2 cyclic redundancy check. represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, min{·} is the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time domain units (eg, time slots) occupied by the first data.

[0078] In a possible implementation of the second aspect, the second information includes CSI-2. When the first channel carrying the second information does not carry data, the number of coded modulation symbols of the CSI-2 satisfies the following formula:

[0079] Among them, Q′ CSI-2 Indicates the number of coded modulation symbols of CSI-2, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, N0 represents the first parameter, Q′ ACK Indicates the number of coded modulation symbols of HARQ-ACK, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, min{·} is the minimum value operation, is rounded up, ∑· is the summation operation. ACK It can also be replaced by Q′ACK / CG-UCI. For related meanings, please refer to the descriptions elsewhere and will not be repeated here.

[0080] In a third aspect, the present application provides a method for determining transmission parameters. The method is performed by a first device, which may be a terminal device, a chip (system) inside a terminal device, a network device, or a chip (system) inside a network device.

[0081] In this method, a first device obtains a processing method for first information. The processing method includes at least one of the following: expanding the first information by a factor of N1 in the time domain, where N1 is a positive integer; expanding the first information by a factor of N2 in the frequency domain, where N2 is a positive integer; or mapping the first information in the frequency domain with comb teeth N3 as an interval, where N3 is a positive integer. The first device determines the transmit power of a first channel used to carry the first information based on a second parameter. The second parameter is associated with at least one of N1, N2, and N3.

[0082] After the first information is processed in the above-mentioned related manner, the resources used to carry the data in the first information increase, and the number of resources (such as resource elements (RE)) corresponding to a transport block (TB) of the first data on the corresponding first channel will change. For example, mapping the first information in the frequency domain with a comb tooth N3 as an interval will cause a decrease in the total resources when transmitting a TB of the first data, thereby resulting in an increase in the number of bits per resource element (bits per RE, BPRE). For another example, expanding the first information by N1 times in the time domain will cause an increase in the total RE when transmitting a TB of the first data, thereby resulting in a decrease in BPRE. BRPE will affect the transmission power of the first channel. Based on this, if the impact of the processing method of the first information is not taken into account when determining the transmission power of the first channel, the transmission power of the first channel will be inaccurate, which will affect the transmission performance and reliability of the first channel.

[0083] Based on the above problems, in the solution provided in this application, the first device can determine the transmission power of the first channel according to the second parameter, so as to determine a more accurate transmission power of the first channel, thereby improving the transmission performance and reliability of the first channel.

[0084] For example, the second parameter of the present application may also be replaced with other names, such as: second value, extension length, etc. Optionally, the extension length may include / be / be determined according to the following: time domain extension length; frequency domain extension length; the inverse of the comb tooth size; the joint length of time domain extension and frequency domain extension (e.g., the product of the time domain extension length and the frequency domain extension length); the joint length of time domain extension and comb division (e.g., the product of the time domain extension length and the inverse of the comb tooth size); or the joint length of frequency domain extension and comb division (e.g., the product of the frequency domain extension length and the inverse of the comb tooth size), etc.

[0085] In a possible implementation manner of the third aspect, the second parameter includes N1, N2 and Or, the second parameter includes N1, N2 and The product of any number of values ​​in .

[0086] In one possible implementation of the third aspect, the first device determines the number of resources of the first channel. The first device determines the transmit power of the first channel based on the second parameter and the number of resources of the first channel. This allows for a relatively accurate transmit power to be determined for the first information to be transmitted and subjected to the aforementioned processing operation. This can prevent the transmit power from being too low, thereby improving transmission performance and reliability, and prevent the transmit power from being too high, thereby reducing energy waste.

[0087] In a possible implementation of the third aspect, the first device determines the number of bits per resource element based on the second parameter and the number of resources of the first channel. The first device determines the transmit power of the first channel based on the number of bits per resource element. After the first information is processed in the above-mentioned related manner, the resources used to carry the data in the first information increase, and the number of REs corresponding to one TB of the first data on the corresponding first channel will change, and then the BPRE will change. Therefore, the BPRE determined by the first device based on the second parameter will be more accurate, and then a more accurate transmit power of the first channel can be determined, thereby improving the transmission performance and reliability of the first channel.

[0088] In a possible implementation of the third aspect, BPRE satisfies the following formula: or,

[0089] BPRE represents the number of bits per resource element, N5 represents the second parameter, and N RE represents the number of resources of the first channel, N4 represents the number of time domain units (such as time slots) occupied by the first data on the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel.

[0090] In a possible implementation of the third aspect, the first device determines a power offset value based on the number of bits per resource element, and determines a transmit power of the first channel based on the power offset value.

[0091] In a fourth aspect, a communication device is provided, which may be the aforementioned first device. The communication device may include a communication unit and a processing unit to perform any aspect of the above-mentioned first to third aspects, or to perform any possible implementation of the first to third aspects. The communication unit is used to perform functions related to sending and receiving. The communication unit may be referred to as a transceiver unit. Optionally, the communication unit includes a receiving unit and a sending unit. In one design, the communication device is a communication chip, the processing unit may be one or more processors or processor cores, and the communication unit may be an input / output circuit, an input / output interface, or an antenna port of the communication chip.

[0092] In another design, the communication unit may be a transmitter and a receiver, or the communication unit may be a transmitter and a receiver.

[0093] Optionally, the communication device further includes modules that can be used to execute any one of the first to third aspects above, or execute any possible implementation of the first to third aspects.

[0094] In a fifth aspect, a communication device is provided, which may be the aforementioned first device. The communication device may include a processor and a memory to perform any aspect of the above-mentioned first to third aspects, or perform any possible implementation of the first to third aspects. Optionally, it also includes a transceiver, the memory is used to store a computer program or instruction, and the processor is used to call and run the computer program or instruction from the memory. When the processor executes the computer program or instruction in the memory, the communication device performs any aspect of the above-mentioned first to third aspects, or performs any possible implementation of the first to third aspects.

[0095] Optionally, there are one or more processors and one or more memories.

[0096] Optionally, the memory may be integrated with the processor, or the memory may be provided separately from the processor.

[0097] Optionally, the transceiver may include a transmitter (transmitter) and a receiver (receiver).

[0098] In a sixth aspect, a communication device is provided, which may be the aforementioned first device. The communication device may include a processor to execute any one of the above-mentioned first to third aspects, or any possible implementation of the above-mentioned first to third aspects. For example, the processor executes any one of the above-mentioned first to third aspects, or any possible implementation of the above-mentioned first to third aspects, through a logic circuit or by executing a computer program or instruction in a memory. The processor is coupled to the memory. Optionally, the communication device also includes a memory. Optionally, the communication device also includes a communication interface, and the processor is coupled to the communication interface.

[0099] In one implementation, when the communication device is the first device, the communication interface may be a transceiver, or an input / output interface. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input / output interface may be an input / output circuit.

[0100] In another implementation, when the communication device is a chip or a chip system, the communication interface may be an input / output interface, an interface circuit, an output circuit, an input circuit, a pin, or related circuits on the chip or chip system. The processor may also be embodied as a processing circuit or a logic circuit.

[0101] In a seventh aspect, a system is provided, the system including a device for sending a first channel, and the device for sending the first channel may include the above-mentioned first device.

[0102] In a possible implementation, the system may further include a device for receiving a first channel. The device for receiving a first channel may also include the first device described above.

[0103] In the eighth aspect, a chip system is provided, which includes at least one processor and an interface circuit, wherein the interface circuit and the at least one processor are interconnected through lines, and the processor runs a computer program (also referred to as code or instruction) to execute any one of the above-mentioned first to third aspects and any possible implementation methods of the first to third aspects.

[0104] In the ninth aspect, a computer program product is provided, which includes: a computer program (also referred to as code, or instructions), which, when executed, enables the computer to execute any one of the above-mentioned first to third aspects, or any possible implementation of the first to third aspects.

[0105] In the tenth aspect, a computer-readable storage medium is provided, which stores a computer program (also referred to as code, or instructions). When the computer program is run on a computer, the computer executes any one of the above-mentioned first to third aspects, or executes any possible implementation of the first to third aspects.

[0106] In an eleventh aspect, a processing device is provided, comprising: an interface circuit and a processing circuit. The interface circuit may include an input circuit and an output circuit. The processing circuit is configured to receive signals via the input circuit and transmit signals via the output circuit, thereby implementing any of the first to third aspects, or any possible implementation of the first to third aspects.

[0107] In a specific implementation, the processing device may be a chip, the input circuit may be an input pin, the output circuit may be an output pin, and the processing circuit may be a transistor, a gate circuit, a trigger, or various logic circuits. The input signal received by the input circuit may be, for example, but not limited to, received and input by a receiver, and the signal output by the output circuit may be, for example, but not limited to, output to and transmitted by a transmitter. The input circuit and the output circuit may be the same circuit, which functions as an input circuit and an output circuit at different times. This application does not limit the specific implementation of the processor and various circuits.

[0108] In one implementation, when the communication device is a first device, the interface circuit may be a radio frequency processing chip in the first device, and the processing circuit may be a baseband processing chip in the first device.

[0109] In another implementation, the communication device may be a component of the first device, such as an integrated circuit product such as a system-on-chip (SoC) or a communication chip. The interface circuit may be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip or chip system. The processing circuit may be a logic circuit on the chip. BRIEF DESCRIPTION OF THE DRAWINGS

[0110] FIG1 is a schematic diagram of a possible data processing process according to an embodiment of the present application;

[0111] FIG2A is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0112] FIG2B is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0113] FIG3A is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0114] FIG3B is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0115] FIG3C is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0116] FIG3D is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0117] FIG3E is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0118] FIG3F is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0119] FIG3G is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0120] FIG3H is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0121] FIG3I is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0122] FIG3J is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0123] FIG3K is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0124] FIG4A is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0125] FIG4B is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0126] FIG5 is a schematic diagram of a possible structure of data provided in an embodiment of the present application;

[0127] FIG6A is a schematic diagram of a communication system architecture applicable to an embodiment of the present application;

[0128] FIG6B is a schematic diagram of a communication system architecture applicable to an embodiment of the present application;

[0129] FIG7 is a flow chart of a communication method provided in an embodiment of the present application;

[0130] FIG8 is a flow chart of another communication method provided in an embodiment of the present application;

[0131] FIG9 is a flow chart of another communication method provided in an embodiment of the present application;

[0132] FIG10 is a flow chart of another communication method provided in an embodiment of the present application;

[0133] FIG11 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0134] FIG12 is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0135] The following is an introduction to the nouns and terms involved in the embodiments of this application.

[0136] (1) Resources.

[0137] The resources in the embodiments of the present application may include, for example, at least one of time domain resources, frequency domain resources, code domain resources, or space domain resources.

[0138] (1.1) Time domain resources.

[0139] The time domain resources may include at least one of a radio frame, a subframe, a slot, a mini slot, or an orthogonal frequency division multiplexing (OFDM) symbol.

[0140] A time domain unit may include a radio frame, a subframe, a time slot, a mini slot, or an OFDM symbol. A time domain unit may also include resources composed of multiple radio frames, multiple subframes, multiple time slots, multiple mini slots, or multiple OFDM symbols. Among them, a radio frame may include multiple subframes, a subframe may include one or more time slots, and a time slot may include at least one symbol. Alternatively, a radio frame may include multiple time slots, and a time slot may include at least one symbol. It should be noted that in the embodiment of the present application, an OFDM symbol may also be referred to as a symbol.

[0141] Depending on the subcarrier spacing, the length of each symbol can be different, and therefore the time slot length can be different. For example, a time slot length corresponding to a 15kHz subcarrier spacing is 0.5ms, a time slot length corresponding to a 60kHz subcarrier spacing is 0.125ms, and so on.

[0142] In the embodiment of the present application, the time domain unit can also be replaced by: a time domain resource unit or a time unit, etc.

[0143] (1.2) Frequency domain resources.

[0144] In the frequency domain, frequency domain resources can include one or more frequency domain units. Among them, a frequency domain unit can be a resource block (RB), a subcarrier, a resource block group (RBG), a predefined subband, a precoding resource block group (PRG), a bandwidth part (BWP), a resource element (RE) (also called a resource unit or resource particle), a carrier, and a serving cell.

[0145] Subcarrier or RE refers to a minimum frequency domain unit on a specific symbol in a multi-carrier system. Subcarrier spacing (SCS) is the spacing value between the center position or peak position of two adjacent subcarriers in the frequency domain in an OFDM system. In 5G NR, a variety of subcarrier spacings are introduced, and different carriers can have different subcarrier spacings. The baseline is 15kHz, which can be 15kHz×2n, where n is an integer from 3.75, 7.5 to 480kHz. In the embodiment of the present application, RE may refer to a resource unit of time-frequency resources, for example, it can be regarded as the smallest time-frequency resource unit. In this application, subcarriers and RE can be used interchangeably, and their contents are the same.

[0146] A subchannel is the smallest unit of frequency domain resources occupied by a physical sidelink shared channel. A subchannel may include one or more resource blocks (RBs). The bandwidth of a wireless communication system in the frequency domain may include multiple RBs. For example, in each possible bandwidth of an LTE system, the number of physical resource blocks (PRBs) included may be 6, 15, 25, 50, and so on. In the frequency domain, an RB may include several subcarriers. For example, in an LTE system, an RB includes 12 subcarriers, where each subcarrier spacing may be 15kHz. Of course, other subcarrier spacings may also be used, such as 3.75kHz, 30kHz, 60kHz, or 120kHz subcarrier spacing, which is not limited here.

[0147] A frequency domain unit may include an RE, an RB, a channel, a subchannel, a carrier, or a bandwidth part (BWP). A frequency domain unit may also include resources composed of multiple REs, multiple RBs, multiple subchannels, multiple carriers, or multiple BWPs. In an embodiment of the present application, a channel may be equivalently replaced by a resource block set (RB set), and the frequency domain bandwidth of an RB set may be 20 megahertz (MHz).

[0148] In the embodiment of the present application, the frequency domain unit may also be replaced by: a frequency domain resource unit or a frequency unit, etc.

[0149] (1.3) Code domain resources.

[0150] Code domain resources may include sequence indices or identifiers used when transmitting information. In one possible implementation, information may be transmitted using sequences, such as direct spread sequence, block spread sequence, or direct sequence modulation. Different information to be transmitted requires one or more sequences. These sequence indices and numbers carrying this information are referred to as code domain resources.

[0151] (1.4) Airspace resources.

[0152] Spatial resources can include all or part of the antennas used for information transmission, the direction of the digital and / or analog beams used for information transmission, or a certain layer / layers / stream / streams of the space formed by digital and / or analog precoding used for information transmission. These antenna resources, spatial directions, streams, or layers that carry information are referred to as spatial resources.

[0153] (2) Expansion.

[0154] When two devices communicate, the transmitter modulates and spreads the data, maps the spread data to time-frequency resources, and then sends it to the receiver. The receiver despreads and demodulates the received data to obtain the data to be parsed. This spread data can then be mapped to time-frequency resources for transmission.

[0155] For ease of understanding, FIG1 exemplarily shows a possible flow chart of data processing provided by an embodiment of the present application. As shown in FIG1 , a transmitting end generates or obtains data. The data may be, for example, a bit sequence. The bit sequence may be obtained by encoding, interleaving, scrambling, and other processing of the original bit stream. The original bit stream may be obtained based on the service to be transmitted by the transmitting device, which is not limited in this application. The transmitting end may then modulate the data according to a modulation method (e.g., 16-bit Quadrature Amplitude Modulation (QAM) or 64QAM) to obtain at least one adjustment symbol. The sequence of at least one adjustment symbol may be referred to as a modulated symbol sequence. The transmitting end extends the modulated symbol sequence to obtain one or more extended data. An extended data may also be referred to as an extended data. An extended data may be the data obtained by multiplying the modulation symbol corresponding to the data by an extended element in the extended sequence. The transmitting end maps the extended data to time-frequency resources for transmission through time-frequency resource mapping. Correspondingly, the receiving end receives the data, performs time-frequency resource demapping on the received data, and obtains the data to be despread. The receiving end despreads the data to be despread to obtain a modulated symbol sequence. The receiving end demodulates the adjusted symbol sequence to obtain data.

[0156] Spreading refers to a method of directly multiplying one or a group of identical signals using a specific sequence (for ease of description, this sequence is referred to as sequence #A) in the time domain and / or frequency domain, and spreading the signals to more resources for transmission. Spreading in the embodiments of the present application may also be referred to as spreading, etc., or in English, spreading. The spreading factor (SF) may be equal to the length of the spread sequence, which may also be understood as the number of elements included in the spread sequence.

[0157] Assume that the signal to be transmitted is d and the length of sequence #A is N SF , after using sequence #A for expansion operation, the obtained signal is b, b i =w i *di, where i=0,1,...,N SF -1. For the convenience of description, w i An element of sequence #A, i.e., a sequence of length N SF The sequence #A includes N SF It is understood that the element can also be replaced by other names, such as code element.

[0158] Refer to Figure 2A, as an example, Figure 2A is a schematic diagram of the expansion operation applicable to the embodiment of the present application. As shown in Figure 2A, it is assumed that the signal d to be transmitted occupies 12 resources, the length of sequence #A is 4, and sequence #A is [w0, w1, w2, w3]. After the signal d to be transmitted is expanded, the signals obtained on the 12 resources are: w0*d1, w0*d1, w0*d1, w1*d2, w1*d2, w1*d2, w2*d3, w2*d3, w2*d3, w3*d4, w3*d4, w3*d4. The d in Figure 2A i Represents the i-th element in sequence #A (i.e. w i-1 ) corresponding signal. It is understood that the content carried on different resources can be the same or different, and this is not limited. As shown in Figure 2A, for example, in a group of symbols corresponding to w0 (i.e., the first 3 symbols), the content carried on different symbols may be the same or different. In Figure 2A, for the convenience of description, the same d i This is described using an example, and is not intended to be limiting. Furthermore, the content corresponding to different elements in sequence #A may be the same or different. As shown in FIG2A , for example, the content carried by the symbols corresponding to w0 and w1 may be the same or different, and is not intended to be limiting. Optionally, the 12 resources may include frequency domain resources, spatial domain resources, or time domain resources (e.g., OFDM symbols).

[0159] There is no limitation on the specific form of sequence #A.

[0160] In one example, sequence #A is a binary sequence. For example, if the length of sequence #A is 2, sequence #A can be any of the following: [+1, +1], [+1, -1]. For another example, if the length of sequence #A is 4, sequence #A can be any of the following: [+1, +1, +1, +1], [+1, +1, -1, -1], [+1, -1, +1, -1], [+1, -1, -1, +1]. For another example, assuming the length of sequence #A is 8, sequence #A can be any of the following: [+1,+1,+1,+1,+1,+1,+1,1], [+1,-1,+1,-1,+1,-1,+1,-1,-1], [+1,+1,-1,-1,+1,-1,-1,-1], [+1,-1,-1,+1,-1,-1,+1,-1,-1,+1], [+1,-1,+1,-1,-1,-1,-1,+1], [+1,-1,+1,-1,-1,-1,+1,-1,+1], [+1,+1,-1,-1,-1,-1,+1,-1], [+1,+1,-1,-1,-1,-1,+1], or [+1,-1,+1,-1,+1,-1,+1,-1].

[0161] In another example, sequence #A is a complex sequence. For example, if the length of sequence #A is 2, sequence #A can be any of the following: [+1, +j], [+1, -j]. For another example, if the length of sequence #A is 4, sequence #A can be any of the following: [+1, +1, +1, +1], [+1, -j, -1, +j], [+1, -1, +1, -1], [+1, +j, -1, -j]. For another example, assuming the length of sequence #A is 8, sequence #A can be any of the following: [+1,+1,+1,+1,+1,+1,+1,+1], [+1,-1,+1,-1,+1,-1,+1,-1,+1,-1], [+1,+1,-j,-j,-1,-1,+j,+j], [+1,-1,-j,+j,-1,+1,+j,-j], [+1,+1,-1,-1,+1,-1,-1,+1,-1,-1], [+1,-1,-1,+1,+1,-1,-1,+1], [+1,+1,+j,+j,-1,-1,-j,-j], or [+1,-1,+j,-j,-1,+1,-j,+j]. Where "j" represents an imaginary unit, and j 2 =-1.

[0162] Further optionally, rows or columns in a discrete Fourier transform (DFT) or inverse discrete Fourier transform (IDFT) matrix may be used as the sequence #A.

[0163] As an example, for a value of length N SF There are at most N sequences in total SF An orthogonal sequence described as follows: or,

[0164] Among them, w n (k) represents the kth element in sequence #A.

[0165] The following further describes the time domain expansion by taking the expansion of OFDM symbols as an example. As an example, the signal of the time domain symbol at symbol n satisfies the following formula (1):

[0166] In formula (1), m = 0, 1, ..., N SF M-1; l = 0, 1, …, N SF -1;s n (t) represents the signal of the time domain symbol at symbol n, w n (m) represents the mth element in the sequence #A numbered n, N SF Indicates the length of sequence #A, M indicates the number of symbols corresponding to an element, t indicates time, Indicates that x is rounded down.

[0167] As an example, s n (t) is a time domain signal obtained after a signal (such as data and / or reference signal) is mapped to each subcarrier on symbol 1 and then undergoes inverse fast Fourier transform (IFFT).

[0168] As an example, in the above formula (1), when M=1, spreading (or time domain spreading) can be called direct spreading.

[0169] As an example, in the above formula (1), when M>1, the spreading (or time domain spreading) can be called block-wise spreading.

[0170] As an example, in the above formula (1), when s n When (t) is replaced by the frequency domain signal d(k), it can also be described in a frequency domain extension manner. As an example, the frequency domain signal d(k) satisfies formula (2).

[0171] The meaning of each parameter in formula (2) can be found in the above description and will not be repeated here. Similarly, M represents the number of frequency domain resources corresponding to an element.

[0172] It can be understood that sequence #A can also be called an extended sequence or a time domain extended sequence, and its naming does not limit the protection scope of the embodiments of the present application.

[0173] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are a possible example to distinguish the various parameters and have no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For example, N SF Can also be replaced by N 17 N can also be replaced by other characters.

[0174] Figure 2B exemplarily shows a possible structural diagram of a data provided by an embodiment of the present application. As shown in Figure 2B, data d includes data d1, data d2 and data d3. Data d can also be called a data group, or a group of data. The number of time domain resources occupied by data d can be flexibly configured, such as data d can occupy one or more time domain symbols (for example, data d1, data d2 and data d3 each occupy a time domain symbol), or it can occupy one or more time slots. The extended sequence a is [a1, a2, a3, a4], and the data b obtained after the extended processing of data d based on the extended sequence a is [b1, b2, b3, b4]. Among them, the extended data b1 is obtained by multiplying data d by a1, the extended data b2 is obtained by multiplying data d by a2, the extended data b3 is obtained by multiplying data d by a3, and the extended data b4 is obtained by multiplying data d by a4.

[0175] To facilitate understanding, let's take another example. For example, if the modulation symbol of the data bit sequence after modulation is d, and the extended sequence is [+1, -1, -1, +1], the data obtained after the extended processing can be d*[+1, -1, -1, +1] = [+d, -d, -d, +d]. The data obtained after the extended processing can also be called the symbol sequence obtained after the extended processing. In this example, the length of the extended sequence (i.e., the number of elements in the extended sequence is 4) is 4, so SF is 4. From this example, it can be seen that after the data is extended, more data will be obtained, and this data can be extended to more resources for transmission.

[0176] In the embodiment of the present application, the subscript of a signal or sequence can be from 0 or from 1. For example, a parameter has a total of Nx (Nx is a positive number), and the subscript of the parameter can be taken from 1 in sequence, until it is taken to Nx (the subscript of the parameter can be taken as an integer in sequence). Alternatively, the subscript of the parameter is taken from 0 in sequence, until (Nx-1) (the subscript of the parameter can be taken as an integer in sequence). For example, the four elements that the extended sequence a can include can be written as [a1, a2, a3, a4], or can be replaced by [a0, a1, a2, a3]. Similarly, data b can be written as [b1, b2, b3, b4], or can be written as [b0, b1, b2, b3]. Similarly, data d can be written as [d1, d2, d3], or can be replaced by data [d0, d1, d2].

[0177] (3) Expand the application scenarios of the technology.

[0178] (3.1) Data is expanded in the time domain.

[0179] (3.1.1) Data is spread over a time slot (eg, a single time slot) with a symbol granularity.

[0180] In this embodiment, a TB of data may be mapped to one or more OFDM symbols (OFDM symbols: OS) of a time slot, and then expanded. The data obtained after the expansion may be mapped to each symbol.

[0181] Figure 3A exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3A, data d includes data d1, data d2 and data d3. The extended sequence a is [a1, a2, a3, a4], and the data b obtained after the data d is extended based on the extended sequence a is [b1, b2, b3, b4]. The data d, extended sequence a and data b in the example provided in Figure 3A can refer to the corresponding description in Figure 2B. In Figure 3A, data d1, data d2 and data d3 each occupy a time domain symbol. Data b1, data b2, data b3 and data b4 can each occupy three time domain symbols. In the example, the length of the extended sequence (that is, the number of elements in the extended sequence is 4) is 4, so SF is 4. N1 can also be used to represent the expansion factor of the time domain (for example, N1 can be replaced by N SFt N can also be replaced by other characters), for example, in the example shown in FIG3A , the value of N1 is 4. In the embodiment of the present application, “*” can be used to represent “multiplication”.

[0182] (3.1.2) Data is spread over a single time slot with symbols such as .

[0183] In this embodiment, a TB of data may be mapped to one time slot or multiple time slots, and then the data of one or more time slots may be expanded, and the data obtained after the expansion may be mapped to each time slot.

[0184] Figure 3B exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. The data d in Figure 3B may include data carried on one symbol or multiple symbols. The extended sequence a is [a1, a2, a3, a4], and the data b obtained after the data d is extended based on the extended sequence a is [b1, b2, b3, b4]. The data d, extended sequence a and data b in the example provided in Figure 3B can all refer to the corresponding description in Figure 2B. In Figure 3B, data b1, data b2, data b3 and data b4 can each occupy a time slot. For example, in the example shown in Figure 3A, the value of N1 is 4. It can be seen from this example that data can be expanded in the time domain or at the granularity of the time slot level.

[0185] (3.2) Data is expanded in the frequency domain and / or mapped in the frequency domain with an interval of N3.

[0186] (3.2.1) The data is expanded in the frequency domain.

[0187] In this embodiment, a TB of data may be mapped to one or more frequency domain resource units (eg, one RE or multiple REs), and then expanded. The data obtained after expansion may be mapped to various frequency domain resources.

[0188] Figure 3C exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3C, data g includes data g1, data g2, and data g3. Data g1, data g2, and data g3 each occupy a frequency domain unit. The extended sequence k is [k1, k2, k3, k4]. Please refer to (a) in Figure 3C. The data f obtained after the data g is extended based on the extended sequence k is [f1, f2, f3, f4]. Among them, the extended data f1 is obtained by multiplying the data g by k1, the extended data f2 is obtained by multiplying the data g by k2, the extended data f3 is obtained by multiplying the data g by k3, and the extended data f4 is obtained by multiplying the data g by k4. As shown in (a) in Figure 3C, the data obtained after extension are mapped to the frequency domain resources respectively.

[0189] In the embodiments of the present application, the subscripts of signals or sequences can start from 0 or 1. For example, data g can be written as [g1, g2, g3], or it can be replaced by data [g0, g1, g2]. The extended sequence k is [k1, k2, k3, k4], or it can be replaced by data [k0, k1, k2, k3]. The data f is [f1, f2, f3, f4], or it can be replaced by data [f0, f1, f2, f3].

[0190] In the embodiment of the present application, when a set of data is expanded, the set of data can be considered as a whole and mechanically expanded. Alternatively, individual data in the set of data can be expanded separately. As shown in (b) of Figure 3C, data g1 can be first expanded based on the expansion sequence k (the data obtained by expanding data g1 based on the expansion sequence k are g1*k1, g1*k2, g1*k3, and g1*k4.), and then data g2 and data g3 can be expanded in sequence based on the expansion sequence k.

[0191] In the example, the length of the spread sequence (ie, the number of elements in the spread sequence is 4) is 4, so the SF is 4. The frequency domain spreading factor can also be represented by N2 (for example, N2 can be replaced by N SFf etc., N may also be replaced by other characters), for example, in the example shown in FIG3C , the value of N2 is 4.

[0192] (3.2.2) The data is mapped in the frequency domain with the comb teeth N3 as the interval.

[0193] The data may occupy all resources within the bandwidth of the data, or may occupy part of the resources. For example, the data may occupy frequency domain resources based on the structure of the comb teeth. In the embodiment of the present application, N3 is used to represent the interval of the comb teeth (for example, N3 can be replaced by Ncomb, etc., and N can also be replaced by other characters). In the embodiment of the present application, for Comb-N3, the data appears at intervals of N3 REs in the frequency domain, and the remaining (N3-1) REs are not transmitted. Optionally, in the embodiment of the present application, the frequency domain transmission mode of Comb-N3 may also be referred to as comb teeth, comb tooth structure, comb division, or comb division structure.

[0194] FIG3D exemplarily shows four possible structural diagrams of the frequency domain resources of the data in Comb-4 (or understood as N3 being 4). The data can be transmitted through the comb structure (a), comb structure (b), comb structure (c) or comb structure (d) in FIG3D . Taking (a) in FIG3D as an example, in the case of Comb-4 (or understood as N3 being 4), the REs occupied by the data appear in the frequency domain in an evenly spaced manner of 4, and as shown in (a) in FIG3D , the data will be sent on the first RE, and the three consecutive REs will be left empty for transmission (the specific location of the frequency domain resources occupied by the data is shown in (a) in FIG3D ). The meanings of the other comb results in FIG3D are similar to those in (a) in FIG3D and will not be repeated here.

[0195] (3.2.3) The data is mapped in the frequency domain with the comb teeth N3 as the interval and expanded in the frequency domain.

[0196] This embodiment can be considered as an example of combining the embodiments described in FIG. 3C and FIG. 3D , and therefore, the relevant contents can also be referred to the above description. That is, a set of data (or a single data) is expanded in the frequency domain, and the expanded data is mapped at intervals of comb teeth N3.

[0197] Figure 3E exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. The data g in Figure 3E includes data g1 and data g2. Data g1 and data g2 each occupy a frequency domain unit. The extended sequence k is [k1, k2]. Please refer to Figure 3E. The data obtained after the data g is extended based on the extended sequence k are g1*k1, g1*k2, g2*k3 and g2*k2 respectively. In the example, the length of the extended sequence (that is, the number of elements in the extended sequence is 2) is 2, so SF is 2 and the value of N2 is 2. In the example shown in Figure 3E, the comb teeth N3 is 3, that is, the extended data appears at intervals of three REs in the frequency domain (as shown in Figure 3E).

[0198] (3.3) The data is expanded in the time domain; the data is expanded in the frequency domain and / or mapped with an interval of N3 teeth in the frequency domain.

[0199] (3.3.1) The spreading is performed on a time slot (eg, a single time slot) with symbol granularity and in the frequency domain.

[0200] This implementation can be considered as an embodiment in which the implementations involved in FIG. 3A and (b) in FIG. 3C are combined and used together, so the relevant contents can also refer to the above description.

[0201] Figure 3F exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3F, the expansion factor N1 in the time domain is 4, and the expansion factor N2 in the frequency domain is 4 for example. As shown in Figure 3F, data d includes data d1, data d2, and data d3. The extended sequence a is [a1, a2, a3, a4], and the data b obtained after the data d is extended based on the extended sequence a is [b1, b2, b3, b4]. The data d, extended sequence a, and data b in the example provided in Figure 3F can all refer to the corresponding description in Figure 3A. In Figure 3F, data d1, data d2, and data d3 each occupy a time domain symbol. Data b1, data b2, data b3, and data b4 can each occupy three time domain symbols.

[0202] Please continue to refer to Figure 3F. For the data on a time domain symbol, the data can be expanded in the frequency domain. For example, as shown in Figure 3F, the data d3 in symbol 14 (data d3 includes data g1, data g2 and data g3) can also be expanded in the frequency domain. At this time, d3 is the time domain signal of symbol 14. At this time, in the frequency domain corresponding to symbol 14, assuming that the bandwidth it occupies is one PRB, then on the 12 REs occupied by one PRB, corresponding frequency domain expansion operations can be performed: g1*k1, g1*k2, g1*k3, g1*k4, g2*k1, g2*k2, g2*k3, g2*k4, g3*k1, g3*k2, g3*k3 and g3*k4. The structure of the data on other time domain symbols after expansion in the frequency domain is similar to the data structure on symbol #14, and will not be repeated here. After completing the frequency domain expansion operation on the symbol, as shown in Figure 3F, it is also possible to perform the frequency domain expansion operation on the time domain signal d on each symbol. i To perform the corresponding time domain expansion operation.

[0203] In the embodiment of the present application, the subscripts of the signals or sequences may start from 0 or 1. For example, the data obtained after the corresponding frequency domain expansion operation on data d3 may also be represented in sequence as: g0*k0, g0*k1, g0*k2, g0*k3, g1*k0, g1*k1, g1*k2, g1*k3, g2*k0, g2*k1, g2*k2, g2*k3. The subscripts of the parameters at other positions may also be replaced. The replacement method can be found here and will not be repeated here.

[0204] (3.3.2) Data is spread on a time slot (e.g., a single time slot) with symbol granularity, and data is spread on a frequency domain with comb teeth N comb Mapping for intervals.

[0205] This implementation can be considered as an embodiment in which the implementations involved in FIG. 3A and FIG. 3D are combined and used together, so the relevant contents can also refer to the above description.

[0206] Figure 3G exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3G, the expansion factor N1 in the time domain is 4, and N3 is 3 for example. For the structure of the data in the time domain as shown in Figure 3G, please refer to the description of Figure 3F above, which will not be repeated. As shown in Figure 3G, for the data on a time domain symbol, the data can be mapped in the frequency domain with the comb teeth N3 as an interval. For example, as shown in Figure 3G, the data d3*a4 can appear in the frequency domain with three REs as an interval (as shown in Figure 3G). The data on other time domain symbols in the frequency domain are similar to the data structure on symbol #14, which will not be repeated.

[0207] (3.3.3) Data is spread on a time slot (eg, a single time slot) at a symbol granularity, and data is spread on a frequency domain, and data is mapped on a frequency domain at intervals of comb teeth N3.

[0208] This implementation can be considered as an embodiment in which the implementations involved in FIG. 3A and FIG. 3E are combined and used together, so the relevant contents can also refer to the above description.

[0209] Figure 3H exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3H, the expansion factor N1 in the time domain is 4, the expansion factor N2 in the frequency domain is 2, and N3 is 3 for example. The structure of the data shown in Figure 3H in the time domain refers to the description of Figure 3F above, which will not be repeated. As shown in Figure 3H, for the data on a time domain symbol, the data can be expanded in the frequency domain (the relevant content of the frequency domain expansion can be referred to the above description, which will not be repeated), and the expanded data can be mapped in the frequency domain with comb teeth N3 as the interval. For example, as shown in Figure 3H, the data d3 on symbol #14 can include data: g1*k1, g1*k2, g2*k1, g2*k2 after the corresponding frequency domain expansion operation. Data d3 can appear in the frequency domain at intervals of three REs (as shown in Figure 3H). The data structure of the data on other time domain symbols in the frequency domain is similar to the data structure on symbol #14, which will not be repeated.

[0210] (3.3.4) Data is spread at the time slot granularity and data is spread in the frequency domain.

[0211] This implementation can be considered as an embodiment in which the implementations involved in FIG. 3B and (b) in FIG. 3C are combined and used together, so the relevant contents can also refer to the above description.

[0212] Figure 3I exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3I , the expansion factor N1 in the time domain is 4, and the expansion factor N3 in the frequency domain is 4. The expansion sequence a is [a1, a2, a3, a4], and the data b obtained after expansion processing of data d based on this expansion sequence a is [b1, b2, b3, b4]. For the data d, expansion sequence a, and data b in the example provided in Figure 3I , please refer to the corresponding description in Figure 2B . In Figure 3I , data b1, data b2, data b3, and data b4 can each occupy a time slot.

[0213] Continuing with Figure 3I , the data in a time slot can be expanded in the frequency domain. For example, as shown in Figure 3I , the data d in time slot #3, after undergoing the corresponding frequency domain expansion operation, may include the following data: g1*k1, g1*k2, g1*k3, g1*k4, g2*k1, g2*k2, g2*k3, g2*k4, g3*k1, g3*k2, g3*k3, and g3*k4. The structure of the data in this time slot after frequency domain expansion is similar to that of the data in time slot #3 and will not be further described.

[0214] (3.3.5) Data is expanded with time slot granularity and the data is combed in the frequency domain with N teeth. comb Mapping for intervals.

[0215] This implementation can be considered as an embodiment in which the implementations involved in FIG. 3B and FIG. 3D are combined and used together, so the relevant contents can also refer to the above description.

[0216] Figure 3J exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3J, the expansion factor N1 in the time domain is 4, and N3 is 3 for example. For the structure of the data in the time domain as shown in Figure 3J, please refer to the description of Figure 3I above, and no further details are given. As shown in Figure 3J, for the data on a time slot, the data can be mapped in the frequency domain with comb teeth N3 as an interval. For example, as shown in Figure 3J, data d can appear in the frequency domain with three REs as an interval (as shown in Figure 3J). The data on other time slots in the frequency domain are similar to the data structure on time slot #3, and no further details are given.

[0217] (3.3.6) Data is expanded at a time slot granularity, and data is expanded in the frequency domain, and data is mapped in the frequency domain at intervals of comb teeth N3.

[0218] This implementation can be considered as an embodiment in which the implementations involved in FIG. 3B and FIG. 3E are combined and used together, so the relevant contents can also refer to the above description.

[0219] Figure 3K exemplarily shows a possible structural diagram of data provided by an embodiment of the present application. In Figure 3K, the expansion factor N1 in the time domain is 4, the expansion factor N2 in the frequency domain is 2, and N3 is 3 for introduction. The structure of the data in the time domain shown in Figure 3K refers to the description of Figure 3I above, and will not be repeated here. As shown in Figure 3K, for the data on a time slot, the data can be expanded in the frequency domain, and the expanded data can be mapped in the frequency domain with comb teeth N3 as intervals. For example, as shown in Figure 3H, the data d on time slot #3 can include data: g1*k1, g1*k2, g2*k1, g2*k2 after the corresponding frequency domain expansion operation. Data d can appear in the frequency domain at intervals of three REs (as shown in Figure 3K). The data structure of the data on other time slots in the frequency domain is similar to the data structure on time slot #3, and will not be repeated here.

[0220] (4) Data is transmitted repeatedly.

[0221] In the embodiment of the present application, data can be repeatedly transmitted after expansion, for example, it can be retransmission in the time domain. For example, retransmission can be performed for a single time slot or multiple time slots. The number of repeated data transmissions in the embodiment of the present application can be represented by N4. Repeated data transmission N4 times can also be understood as: after the data is expanded, N4 groups are sent in units of the time domain unit occupied by the expansion. In the embodiment of the present application, N4 can be a positive integer. For example: if data d is expanded to obtain data b, if data b occupies 1 time slot, data b is sent N4 times in units of a single time slot, and the N4 transmissions of data b occupy a total of N4 time slots; for another example, data b occupies two time slots, and data b is sent N4 times in units of two time slots, and the N4 transmissions of data b occupy a total of 2*N4 time slots.

[0222] Figure 4A illustrates a possible structural diagram of possible data. Figure 4A can be considered an implementation method combining the scheme provided in Figure 3B with repeated data transmission. In this implementation method, data d is carried in time slot #0. The extended sequence a is [a1, a2, a3, a4], and the data b obtained after extending data d based on this extended sequence a is [b1, b2, b3, b4]. The data d, extended sequence a, and data b in the example provided in Figure 4A can all refer to the corresponding description in Figure 2B. In Figure 4A, data b1, data b2, data b3, and data b4 can each occupy one time slot, and data b occupies four time slots. Data b can be regarded as one or a group of data, and then data b is transmitted multiple times in the time domain, such as retransmission #1, retransmission #2, retransmission #3, and retransmission #4 shown in Figure 4A. Retransmission #1 refers to the first transmission of data b on time slot #0, time slot #1, time slot #2 and time slot #3. Retransmission #2 refers to the first transmission of data b on time slot #4, time slot #5, time slot #6 and time slot #7. Other retransmissions are similar and will not be repeated here.

[0223] FIG4B illustrates a possible structural diagram of possible data. In FIG4B , data b occupies one time slot. Data b can be considered as one or a group of data, and then data b is transmitted multiple times (e.g., 16 times) in the time domain, such as retransmission #1, retransmission #2, retransmission #3, retransmission #4, retransmission #5, retransmission #6, retransmission #7, retransmission #8, retransmission #9, retransmission #10, retransmission #11, retransmission #12, retransmission #13, retransmission #14, retransmission #15, and retransmission #16 shown in FIG4B . Retransmission #1 refers to the first transmission of data b in time slot #0, and retransmission #2 refers to the second transmission of data b in time slot #1. Other retransmissions are similar and will not be repeated. The solution provided in Figure 4B can be used in combination with the extension solution. For example, the solution provided in Figure 4B can be combined with the solution provided in Figure 3A above. In Figure 4B, data b can be regarded as extended data carried in a time slot. For example, data b is the data obtained by extending data d based on the extension sequence a, that is, b is [b1, b2, b3, b4]. Data d, extension sequence a and data b can all be referred to the corresponding description in Figure 2B and will not be repeated here.

[0224] (4.1)TBoMS.

[0225] When sending a transmission block (TB), it is generally transmitted through a time slot. Before transmitting the block, it is necessary to calculate the resources occupied by the transmission block. Currently, the number of symbols occupied by one transmission is specified to be less than or equal to 14, which is the maximum number of orthogonal frequency division multiplexing (OFDM) symbols that a time slot can provide. In order to use a lower code rate when transmitting data, a mode of carrying one transmission block over multiple slots (TBoMS) is now proposed. TBoMS, that is, carrying a transmission block (actually carrying an encoded transmission block) on the resources of multiple time slots, aims to use a lower code rate when sending the transmission block by integrating the resources on multiple time slots, thereby improving coverage. TBoMS, as a higher-level transmission concept, further has a lower-level transmission granularity, which is called the transmission occasion of TBoMS (ToT). That is, a ToT is understood as a transmission opportunity for TBoMS. A TBoMS may include one or more ToTs, and a ToT may include continuous uplink transmissions.

[0226] Figure 5 exemplarily shows a possible structural diagram of a possible data provided by an embodiment of the present application. As shown in Figure 5, the extended sequence a corresponding to data d is [a1, a2], and the data b obtained after the extended processing of data d based on the extended sequence a is [b1, b2]. B1 is the product of data d and a1, and b2 is the product of data d and a2. As shown in Figure 5, b1 is carried in time slot #0 and time slot #1, and b2 is carried in time slot #2 and time slot #3. In Figure 5, data b1 and data b2 can occupy multiple time slots respectively (for example, the two time slots shown in Figure 5). Data b can be regarded as one or a group of data, and then data b is transmitted multiple times in the time domain, such as retransmission #1, retransmission #2, retransmission #3 and retransmission #4 shown in Figure 5. Retransmission #1 refers to the first transmission of data b on time slot #0, time slot #1, time slot #2 and time slot #3. Retransmission #2 refers to the first transmission of data b on time slot #4, time slot #5, time slot #6 and time slot #7. Other retransmissions are similar and will not be repeated here.

[0227] (5) Sidelink (SL).

[0228] In the embodiment of the present application, the sidelink may refer to a link established between devices of different or same types, such as a link between terminal devices, etc. For the link between terminal devices, there are device-to-device (D2D) links defined in release (Rel)-12 / 13 of the 3rd Generation Partnership Project (3GPP), as well as vehicle-to-vehicle (V2V), vehicle-to-pedestrian (V2P), vehicle-to-infrastructure (V2I), and vehicle-to-network (V2N) defined by 3GPP for the Internet of Vehicles. It also includes V2X links based on NR systems in other future versions such as Rel-14, Rel-15, Rel-16, and Rel-17, as well as Rel-18.

[0229] The side link in the embodiment of the present application can also be called a side link, a side link, a direct link, a side link or an auxiliary link, etc.

[0230] (6) Reference signal.

[0231] In the embodiment of the present application, the reference signal may include (or be) a demodulation reference signal (DMRS), a channel state information reference signal (CSI) reference signal (RS), a synchronization signal block (SSB), a synchronization signal / physical broadcast channel block (SS / PBCH block), or a tracking reference signal (TRS), a phase tracking reference signal (PTRS) or a cell reference signal (CRS). The downlink reference signal may include (or be) at least one of these reference signals. In the embodiment of the present application, SSB and SS / PBCH block may be replaced with each other.

[0232] (7)PDSCH, PUSCH and PSSCH.

[0233] PDSCH is a downlink physical channel, which can refer to the physical channel sent by the network device to the terminal. PUSCH is a downlink physical channel, which can refer to the physical channel sent by the terminal to the network device. PSSCH is a sidelink physical channel, which can refer to the physical channel sent by two terminals via the sidelink.

[0234] Any of the PDSCH, PUSCH, and PSSCH can carry some information, or control information. For example, the PDSCH can carry DCI, etc. For example, the PUSCH can carry UCI, etc. For example, the PSSCH can carry at least one of SCI, data, or a medium access control element (MAC CE).

[0235] Any one of the PDSCH, PUSCH and PSSCH has the capability of carrying data, but in actual applications, any one of these channels may or may not carry data.

[0236] (8) Mapping can also be described as "occupying" or "using". For example, when a communication system maps a channel onto a carrier, it means that the communication system uses or occupies part or all of the time-frequency resources corresponding to the carrier to transmit the information carried by the channel.

[0237] (9) Rate matching.

[0238] Typically used on the transmitter side. For the transmitter, rate matching means determining the code rate for the data to be transmitted and performing channel coding on the data to be transmitted based on the available physical resources. The coded data is then sent on the available physical resources. For example, the total resources are S1, the unusable resources are S2, and both S1 and S2 are positive integers, so the available resources are (S1-S2). Rate matching means directly determining the code block size based on the resources (S1-S2), performing channel coding on the data to be transmitted, and mapping and sending the data to the resources (S1-S2).

[0239] Figure 6A exemplarily illustrates an architectural diagram of a communication system 1000 applicable to an embodiment of the present application. As shown in Figure 6A , the communication system includes a radio access network 100 and a core network 200. Optionally, the communication system 1000 may also include the Internet 300. The radio access network 100 may include at least one radio access network device (such as 110a and 110b in Figure 6A ) and at least one terminal device (such as 120a-120j in Figure 6A ). The terminal device is wirelessly connected to the radio access network device, and the radio access network device is wirelessly or wiredly connected to the core network. The core network device and the radio access network device may be independent and distinct physical devices, or the functions of the core network device and the logical functions of the radio access network device may be integrated into the same physical device, or a single physical device may integrate some of the functions of the core network device and some of the functions of the radio access network device. Terminal devices and radio access network devices may be connected to each other via wired or wireless means. FIG6A is only a schematic diagram. The communication system may further include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG6A .

[0240] The network devices involved in the embodiments of the present application include, for example, radio access network (RAN) devices. The radio access network devices may be base stations, evolved NodeBs (eNodeBs), transmission reception points (TRPs), transmission nodes (TPs), next-generation NodeBs (gNBs) in fifth-generation (5G) mobile communication systems, base stations in future mobile communication systems, or access nodes in WiFi systems. They may also be modules or units that perform some of the functions of a base station, for example, centralized units (CUs) or distributed units (DUs). The CU here completes the functions of the base station's radio resource control protocol and packet data convergence protocol (PDCP), and can also complete the function of the service data adaptation protocol (SDAP); the DU completes the functions of the base station's radio link control layer and medium access control (MAC) layer, and can also complete part of the physical layer or all of the physical layer. For detailed descriptions of the above protocol layers, please refer to the relevant technical specifications of the 3rd Generation Partnership Project (3GPP).

[0241] The wireless access network device can be a macro base station (such as 110a in Figure 6A), a micro base station or an indoor station (such as 110b in Figure 6A), a relay node, a donor node, etc. The embodiments of this application do not limit the specific technology and device form used by the wireless access network device. For ease of description, the following description uses a base station as an example of a wireless access network device.

[0242] Terminal devices may also be referred to as terminal devices, user equipment (UE), mobile stations, mobile terminal devices, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. Terminal devices can be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, sensors, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal devices.

[0243] The above-mentioned terminal device can establish a connection with the operator network through the interface provided by the operator network (such as N1, etc.) and use the data and / or voice services provided by the operator network. The terminal device can also access the domain name system (DNS) through the operator network, use the operator services deployed on the DNS, and / or services provided by a third party. Among them, the above-mentioned third party may be a service provider other than the operator network and the terminal device, and can provide other data and / or voice services to the terminal device. Among them, the specific form of the above-mentioned third party can be determined according to the actual application scenario and is not limited here.

[0244] Terminal devices may also be referred to as terminal devices, user equipment (UE), mobile stations, mobile terminal devices, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. Terminal devices may be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, road side units (RSU), etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal devices.

[0245] Base stations and terminal devices can be fixed or mobile. They can be deployed on land, indoors or outdoors, handheld or vehicle-mounted; on water; or in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of base stations and terminal devices.

[0246] The roles of base stations and terminal devices can be relative. For example, the helicopter or drone 120i in Figure 6A can be configured as a mobile base station. To terminal devices 120j accessing the wireless access network 100 via 120i, terminal device 120i is a base station. However, to base station 110a, 120i is a terminal device, meaning that communication between 110a and 120i occurs via a wireless air interface protocol. Of course, communication between 110a and 120i can also occur via a base station-to-base station interface protocol. In this case, 120i is also a base station relative to 110a. Therefore, base stations and terminal devices can be collectively referred to as communication devices. 110a and 110b in Figure 6A can be referred to as communication devices with base station functionality, while 120a-120j in Figure 6A can be referred to as communication devices with terminal functionality.

[0247] Communication between base stations and terminal devices, between base stations, and between terminal devices can be carried out through authorized spectrum, unauthorized spectrum, or both; communication can be carried out through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz. The embodiments of the present application do not limit the spectrum resources used for wireless communication.

[0248] In the embodiments of the present application, the functions of the base station may also be performed by a module (such as a chip) in the base station, or by a control subsystem that includes the base station functions. The control subsystem that includes the base station functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal device may also be performed by a module (such as a chip or a modem) in the terminal device, or by a device that includes the terminal device functions.

[0249] In this application, a base station sends downlink signals or downlink information to a terminal device, and the downlink information is carried on a downlink channel; the terminal device sends uplink signals or uplink information to the base station, and the uplink information is carried on an uplink channel. In order to communicate with the base station, the terminal device needs to establish a wireless connection with the cell controlled by the base station. The cell with which the terminal device has established a wireless connection is called the serving cell of the terminal device. When the terminal device communicates with the serving cell, it will also be interfered with by signals from neighboring cells.

[0250] The core network involved in the embodiments of the present application may include network equipment that processes and forwards user signaling and data. For example, it includes access and mobility management function (AMF), session management function (SMF), user plane gateway, positioning management equipment and other core network equipment. Among them, the user plane gateway can be a server with functions such as mobility management, routing, and forwarding of user plane data, generally located on the network side, such as a serving gateway (SGW) or a packet data network gateway (PGW) or a user plane network element function entity (UPF). AMF and SMF are equivalent to the mobility management entity (MME) in the long term evolution (LTE) system. AMF is mainly responsible for access, and SMF is mainly responsible for session management. Of course, the core network can also include other network elements, which are not listed here one by one.

[0251] FIG6A is only a schematic diagram. The wireless communication system may further include other devices, such as core network devices, wireless relay devices and / or wireless backhaul devices, which are not shown in FIG6A .

[0252] Referring to Figure 6B, as an example, Figure 6B is another schematic diagram of a wireless communication system applicable to an embodiment of the present application. As shown in Figure 6B, the wireless communication system takes a non-terrestrial network (NTN) as an example. As an example, the system may include: a ground station (gateway, GW), a satellite, a terminal device, or a ground network, etc. In order to distinguish it from a terrestrial communication system, the gateway is referred to as a ground station here. The ground station can provide functions similar to those of a gateway in a terrestrial communication system, for example, establishing a connection with a terminal device and communicating with a server. The ground station also has functions such as monitoring and troubleshooting satellites, packet switching of communication data, and interface protocol conversion. As an example, the link between the ground station and the satellite is called a feeder link, and the link between the satellite and the terminal device is called a service link.

[0253] Satellite network architectures can be categorized into three types based on the deployment scenarios of satellite and terrestrial networks: transparent satellite architecture, satellite backhaul architecture, and regenerative satellite architecture. An architecture in which terminal devices connect to the terrestrial access network via satellite is called a transparent satellite architecture. An architecture in which terminal devices connect to the terrestrial access network and then to the terrestrial network via satellite is called a satellite backhaul architecture. Furthermore, an architecture in which access network equipment is included on the satellite is called a regenerative satellite architecture.

[0254] Based on the embodiments shown in Figures 1, 2A, 2B, 3A, 3B, 3C, 3D, 3E, 3F, 3G, 3H, 3I, 3J, 3K, 4A, 4B, 5, 6A and 6B, Figure 7 exemplifies a possible flow chart of a method for determining transmission parameters provided by an embodiment of the present application. In Figure 7, the first device is introduced as the execution subject. The first device can be the terminal device shown in Figure 6A above, the chip (system) inside the terminal device, the network device or the chip (system) inside the network device. The first device can be the terminal device shown in Figure 6B above, the chip (system) inside the terminal device, the ground station, the chip (system) inside the ground station, the satellite or the chip (system) inside the satellite.

[0255] The first device may be a transmitter of the first channel, configured to transmit the first channel. Alternatively, the first device may be a receiver of the first channel, configured to receive the first channel. If the first device is a transmitter of the first channel, the first device may determine the transmission parameters of the first channel according to the embodiment provided in FIG. 7 , and then transmit the first channel according to the transmission parameters of the first channel. If the first device is a receiver of the first channel, the first device may determine the transmission parameters of the first channel according to the embodiment provided in FIG. 7 , and then recover the content carried on the first channel from the received signal.

[0256] The solution provided in Figure 7 is applicable to a variety of scenarios, such as sidelink scenarios, non-sidelink scenarios (such as cellular communication scenarios (such as communication scenarios via the Uu port)), etc. For example, the transmitting end of the first channel is a terminal device, and the receiving end of the first channel is a network device. For another example, the transmitting end of the first channel is a network device, and the receiving end of the first channel is a terminal device. For another example, the transmitting end and the receiving end of the first channel are two terminal devices respectively.

[0257] The following is an introduction with reference to FIG7 .

[0258] Step 701: The first device obtains a processing method for first information.

[0259] The processing method includes at least one of the following: the first information is expanded N1 times in the time domain, where N1 is a positive integer; the first information is expanded N2 times in the frequency domain, where N2 is a positive integer; the first information is mapped in the frequency domain with comb teeth N3 as the interval, where N3 is a positive integer.

[0260] For example, the first information is expanded N1 times in the time domain. For example, the first information can be expanded in a time domain unit. For related examples, please refer to the implementation methods provided in Figures 3A and / or 3B above. For example, the first information includes data d, and the first information can be expanded at the symbol level of a single time slot (for example, in the embodiment shown in Figure 3A, data d occupies four symbols), or the first information can be expanded across multiple time slots (for example, in the embodiment shown in Figure 3B, data d occupies one time slot). The relevant content will not be repeated.

[0261] For example, N1 may be an integer greater than 1. For example, when N1 is greater than 1, the length of the expansion factor in the time domain is greater than 1, the first information is expanded in the time domain, and the number of time domain units occupied by all the information after the expansion in the time domain corresponding to the first information (for example, data b in FIG3A or FIG3B ) is greater than the number of time domain units occupied by one first information (or the first information before expansion processing in the frequency domain, for example, one data d in FIG3A or FIG3B ).

[0262] For another example, N1 is 1. N1 can be called an expansion factor in the time domain. For example, when N1 is 1, the length of the expansion factor in the time domain is 1, the first information is expanded in the time domain, and the number of time domain units occupied by all the expanded information corresponding to the first information (for example, data b in Figure 3A or Figure 3B) is the same as the number of time domain units occupied by one first information (or the first information before expansion processing in the frequency domain, for example, one data d in Figure 3A or Figure 3B).

[0263] For another example, the first information is expanded N2 times in the frequency domain, for example, the first information can be expanded in the frequency domain unit. For related examples, please refer to the embodiment provided in Figure 3C above. For example, the first information includes data d, and the related content will not be repeated.

[0264] For example, N2 may be an integer greater than 1. For another example, when N2 is greater than 1, the length of the expansion factor in the frequency domain is greater than 1, the first information is expanded in the frequency domain, and the number of frequency domain units occupied by all the information corresponding to the first information after expansion in the frequency domain (for example, data f in FIG3C ) is greater than the number of frequency domain units occupied by one first information (for example, one data g in FIG3C ) (or the first information before expansion processing in the frequency domain, for example, one data g in FIG3C ).

[0265] For another example, N2 is 1. N2 can be called an expansion factor in the frequency domain. For example, when N2 is 1, the length of the expansion factor in the frequency domain is 1, the first information is expanded in the frequency domain, and the number of frequency domain units occupied by all the expanded information corresponding to the first information (for example, data f in Figure 3C) can be the same as the number of frequency domain units occupied by one first information (or the first information before expansion processing in the frequency domain, for example, data g in Figure 3C).

[0266] For another example, the first information is mapped in the frequency domain with the comb teeth N3 as the interval. For the relevant content of this example, please refer to the implementation provided in the aforementioned Figure 3D. For example, the first information includes data d, and the relevant content will not be repeated.

[0267] For example, N3 can be an integer greater than 1. In this case, the first information can be considered to be mapped at intervals in the frequency domain. For another example, N3 is 1. For example, when N3 is 1, the first information is mapped in the frequency domain with an interval of 1 comb tooth. In this case, the first information can also be considered to be mapped continuously in the frequency domain.

[0268] In one possible implementation, at least one of N1, N2, and N3 is an integer greater than 1. In another possible implementation, N1 is an integer greater than 1. In another possible implementation, N2 is an integer greater than 1. In another possible implementation, N3 is an integer greater than 1. These implementations can improve the reliability of data transmission.

[0269] Any multiple of the above three processing methods can be combined. For relevant examples of the processing method of the first data in a combined form, please refer to the implementation methods provided in the aforementioned Figures 3E, 3F, 3J and 3K. For example, the first information may include data d, and the relevant content will not be repeated.

[0270] In this application, after the above processing, the first information may obtain one or more information. The information obtained after the above processing is referred to as the processed first information. For example, when data d is expanded in the time domain (for example, the expansion length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. Data d belongs to the first information (or the first information before processing), and data b (for example, data b1, data b2, data b3, and data b4) can belong to the processed first information.

[0271] In the embodiment of the present application, the first information includes the second information and / or the first data. When the first information includes the first data, the first data may also have multiple transmission modes. For example, the first data is not transmitted using the TBoMS technology. For another example, the first data is transmitted using the TBoMS technology. The two transmission modes can be combined with the above-mentioned processing methods to jointly constitute the application scenario of the embodiment of this application. The solution for transmitting the first data using the TBoMS technology can be referred to the implementation method provided in Figure 5 above. The first data may, for example, include data d, and the first data may occupy two time domain units (for example, two time slots). The relevant content will not be repeated.

[0272] Table 1 below lists several examples of scenarios in which the processing method of the first information and the transmission method of the first information are combined. Scenario 4 of Table 1 below is used for introduction. In scenario 4, the first information is extended in the time domain, and the extension is performed at the symbol level of a single time slot (as shown in FIG3A ). The first information is not extended in the frequency domain, and the first information is not mapped using a comb structure (not mapped in the frequency domain with comb teeth N3 as the interval), and the transmission of the first information does not use TBoMS. The meanings of other scenarios are similar and will not be repeated here.

[0273] Table 1 Examples of scenarios in which the first information processing method and the first information transmission method are combined

[0274] The first information may include the second information and / or the first data. The first information may be carried on the first channel. The second information may be carried on the first channel. The first channel may carry the first data or may not carry the first data (or may not carry data). For example, the first information may be HARQ-ACK, and the second information may be CSI. Optionally, the transmission times of the first information and the second information may be independent of each other. When the transmission times of the first information and the second information overlap in the time domain, the first information and the second information may be transmitted together. Similarly, when the transmission time of the first information and / or the second information overlaps with the transmission time of the first data, the first information and / or the second information and the first data may be transmitted together. The channel transmitted together may be a shared channel. Optionally, the CSI includes one or more of a rank indication (RI), a precoding matrix indicator (PMI), a channel state information reference signal (CSI-RS) resource indicator (CSI-RS Resource Indicator, CRI), a channel quality indicator (CQI), etc. Optionally, HARQ-ACK may represent a positive acknowledgement or a negative acknowledgement of received data.

[0275] For example, the first channel may be a channel on any link (e.g., a shared channel), including / being but not limited to: PUSCH, PDSCH, or PSSCH. For example, the second information may include / be control information (CI). For example, the first channel is PUSCH, and the second information is uplink control information (UCI). For another example, the first channel is PDSCH, and the second information is downlink control information (DCI). For another example, the first channel is PSSCH, and the second information is sidelink control information (SCI).

[0276] For example, the second information may include / be at least one of: HARQ-ACK, CSI-1, CSI-2 and CG-UCI. Optionally, CSI-1 (CSI-1 may also be referred to as CSI part 1 (CSI part 1)) may include one or more of RI, CRI and CQI. Optionally, CSI-2 (CSI-2 may also be referred to as CSI part 2 (CSI part 2)) may include one or more of PMI, CRI and CQI. Optionally, CG-UCI may represent UCI transmitted by way of a configured grant (CG). The CG method includes CG type 1 and CG type 2. CG type 1 may indicate that the network statically configures some transmission resources, and then triggers the first device to transmit on these configured resources through radio resource control (RRC) signaling. CG type 2 may indicate that the network device statically configures some transmission resources, and then triggers the first device to transmit on these configured resources through DCI signaling.

[0277] Step 702: The first device determines a transmission parameter according to a processing method of the first information.

[0278] Step 702 may also be replaced by: the first device determines the transmission parameter according to at least one of N1, N2 and N3.

[0279] The transmission parameter may include / be at least one of: the size of the first information, the number of coded modulation symbols of the second information, and the transmission power of the first channel.

[0280] After the first information is processed in step 701, for example, the expansion (time domain expansion and / or frequency domain expansion) operation is essentially a repeated transmission of the signal or data before expansion, except that each repeated signal or data (or replica) is multiplied by the code element of the expansion sequence. Therefore, the expansion (time domain expansion and / or frequency domain expansion) operation reduces the actual (or equivalent) amount of available resources. Referring to Figure 3A, after data d is expanded in the time domain, data d originally occupies only 3 symbols, but data b obtained after data d is expanded needs to occupy 12 symbols. Compared to data d, data b (expanded data d) occupies more resources. Originally, all 12 symbols in a time slot could be used to transmit data d, but in order to transmit data b, only 3 symbols in a time slot can actually be used to transmit data d. It can be understood that after the first data (data d) is expanded, the number of resources available for transmitting the first information is reduced. Similarly, when the data d is expanded in the frequency domain, or expanded in the time domain and the frequency domain, the amount of resources that can be used to transmit the first information will become smaller.

[0281] For another example, the first information is mapped in the frequency domain with comb teeth N3 as the interval. In this case, some resources cannot be used to map signals or data, so the actual (or equivalent) number of resources that can be used to carry data or signals will be reduced. The above problems will affect some transmission parameters. The transmission parameters determined without considering the processing method of the first information will be inaccurate. In the implementation method provided in the embodiment of the present application, the first device determines the transmission parameters according to the processing method of the first information, so that more accurate transmission parameters can be obtained, thereby improving communication performance.

[0282] In one possible implementation, the number of resources used to transmit the first information in the embodiment of the present application may refer to: the number of resources used to transmit the first information before being processed by the above-mentioned processing method. For example, when data d is expanded in the time domain (for example, the extension length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. In the case where data d is the first information, the number of resources used to transmit the first information (or the number of resources used to transmit the first information before being processed by the above-mentioned processing method) may refer to the number of resources used to transmit data d, rather than the number of resources used to transmit data b. Similarly, the number of resources used to transmit the first information has decreased, which may refer to the number of resources used to transmit the first information before being processed by the above-mentioned processing method. For other location-related content, please refer to the description here and will not be repeated.

[0283] Based on the embodiments shown in Figures 1, 2A, 2B, 3A, 3B, 3C, 3D, 3E, 3F, 3G, 3H, 3I, 3J, 3K, 4A, 4B, 5, 6A, 6B and 7, Figure 8 exemplifies a possible flow chart of a method for determining a transmission parameter provided by an embodiment of the present application. Figure 8 can also be regarded as a possible implementation of Figure 7. In this implementation, the transmission parameter includes the size of the first information as an example for introduction. In Figure 8, the first device is used as the execution subject for introduction. For the relevant content of the first device, please refer to the introduction of Figure 7 and will not be repeated here.

[0284] The following is an introduction with reference to FIG8 .

[0285] Step 801: A first device obtains a processing method for first information.

[0286] The processing method includes at least one of the following: the first information is expanded N1 times in the time domain, where N1 is a positive integer; the first information is expanded N2 times in the frequency domain, where N2 is a positive integer; the first information is mapped in the frequency domain with comb teeth N3 as the interval, where N3 is a positive integer.

[0287] The content of step 801 refers to the relevant description of the aforementioned step 701 and will not be repeated here.

[0288] Step 802: The first device determines the size of the first information according to the first parameter.

[0289] The first parameter of the present application may also be replaced by other names, such as: first value, extension length, etc. Optionally, the extension length may include / be / be determined based on at least one of the following: time domain extension length; frequency domain extension length; comb tooth size; joint length of time domain extension and frequency domain extension (e.g., the product of time domain extension length and frequency domain extension length); joint length of time domain extension and comb division (e.g., the product of time domain extension length and comb tooth size); or joint length of frequency domain extension and comb division (e.g., the product of frequency domain extension length and comb tooth size), etc.

[0290] The first parameter may be associated with at least one of N1, N2, and N3. The first parameter includes any one of N1, N2, and N3. Alternatively, the first parameter is determined based on at least one of N1, N2, and N3.

[0291] For example, the first parameter is obtained by performing a calculation on any number of N1, N2, and N3 (at least one of multiplication, addition, multiplication of each term by a sum of different non-zero coefficients, or sum or product of at least one term with different powers, etc.). For example, the first parameter includes the product of any number of N1, N2, and N3. For example, the first parameter is represented by parameter N0, and N0 can be any one of N1, N2, N3, N1*N2, N1*N3, N2*N3, and N1*N2*N3.

[0292] When calculating the first parameter, the first device may also perform the calculation based on some other parameters, such as values ​​that can be configured, preconfigured, or defined by the protocol. These values ​​can be mathematically calculated with at least one of N1, N2, and N3, and the result obtained is used as the first parameter. For example, the first parameter is represented by parameter N0, and N0 can be any one of (M1*N1), (M1+N1), (M1+N2), (M1+N3), M1*N1*N2, M1*N1*N3, M1*N2*N3, and M1*N1*N2*N3. M1 can be a value that is configured, preconfigured, or defined by the protocol.

[0293] In one possible implementation, the value of the first parameter may correspond to the scenario shown in the aforementioned Table 1. Table 2 below exemplifies the values ​​of the first parameter in various scenarios. Scenario 4 in Table 2 below is used for introduction. In scenario 4, the value of the first parameter N0 is N1. The meanings of the first parameters corresponding to other scenarios are similar. For the relevant introduction to scenario 4, please refer to the description in Table 1 above and will not be repeated here. When the first information is extended in the time domain, when the first information is extended at the symbol level of a single time slot, N1 may be the symbol-level expansion factor of the first parameter; when the first information is extended at the symbol level of multiple time slots, N1 may be the time slot-level expansion factor of the first parameter.

[0294] Table 2 Examples of scenarios in which the first information processing method and the first information transmission method are combined

[0295] The size of the first information can be replaced by: the amount of first information, the size of the first information, the transport block size (TBS) corresponding to the first information, the size of a data packet carrying the first information, the size of a data packet carrying the first information, the size of a data packet corresponding to the first information, or the size of a data packet corresponding to the first information. The first information may include the second information and / or the first data. The size of the first information can also be replaced by: the amount of first data, the TBS corresponding to the first data, the TBS of the data packet corresponding to the first data, or the size of a packet carrying the first data. The first information may be carried in the data packet corresponding to the first information, and the data packet corresponding to the first information may be carried in the corresponding data modulation symbol or OFDM symbol.

[0296] After the first information is processed in step 801, the number of resources (e.g., REs) available for transmitting data (e.g., the first data) is reduced, thereby affecting the size of the data packet corresponding to the first information. Based on this, in step 802, the first device can obtain a more accurate number of resources of the first channel based on the first parameter, thereby more accurately calculating the size of the data packet corresponding to the first information.

[0297] In step 802, the first device may determine the number of resources of the first channel carrying the first information based on the first parameter. The first device may determine the size of the first information based on the number of resources of the first channel. Because the first parameter affects the number of resources of the first channel, the number of resources of the first channel determined by the first device based on the first parameter is more accurate, and the first device may obtain a more accurate size of the first information, thereby improving transmission performance.

[0298] The size of the first information is related to the number (or total number) of resources that can be used to transmit data (e.g., first data) in the first channel. The resource may include: at least one of: time domain resources, frequency domain resources, spatial domain resources, and code domain resources. For related introductions, please refer to the above description and will not be repeated here. For example, the number of resources of the first channel may include / be: the number of REs or the total number of REs of the first channel.

[0299] The embodiments of the present application provide several possible implementations for a first device to determine the number of resources of a first channel through the following implementations A1 and A2. In implementation A1, the first device can determine the number of resources allocated to the first channel on a resource unit based on a first parameter, and then determine the number of resources of the first channel based on the number of resources allocated to the first channel on the resource unit. In implementation A2, the first device determines the number of resources of the first channel based on the first parameter.

[0300] In implementation A1, the first device may determine the number of resources allocated to the first channel on a resource unit according to a first parameter, and then determine the number of resources of the first channel according to the number of resources allocated to the first channel on the resource unit.

[0301] In this implementation, the first device can determine more accurately the number of resources allocated to the first channel on a resource unit based on the first parameter, and then the first device can obtain a more accurate size of the first information, thereby improving transmission performance.

[0302] The scheme of implementation mode A1 may include the following steps A1.1, A1.2, A1.3 and A1.4.

[0303] Step A1.1: The first device may determine the quantity of resources allocated to the first channel on a resource unit according to the first parameter.

[0304] The resource unit may include / be: a frequency domain unit, a time domain unit, a spatial domain unit (indicating a beam in a specific spatial direction, a precoding vector or matrix, etc.). For ease of understanding, the resource unit is PRB and the resource is RE as an example. The number of resources allocated to the first channel on a resource unit may include, for example, the number of REs allocated to the first channel on a PRB. PRB can also be replaced by other content included in the resource unit, and RE can also be replaced by other content included in the resource.

[0305] For example, the first device may calculate the total amount of resources available for the first channel minus the amount of resources occupied by the reference signal and / or overhead information, thereby obtaining the amount of resources that can be allocated to the first channel on one resource unit. Because the first information may have undergone the processing involved in step 801, the total amount of resources available for the first channel calculated by the first device may be reduced.

[0306] In one possible implementation, the number of resources allocated to the first channel in the embodiment of the present application may refer to: the number of resources allocated to the first channel before the first information of the first channel is processed by the above-mentioned processing method. For example, when data d is expanded in the time domain (for example, the extension length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. When data d is the first information, the number of resources allocated to the first channel (or the number of resources allocated to the first channel before the first information of the first channel is processed by the above-mentioned processing method) refers to the number of resources allocated to the first channel based on the number of resources used to transmit data d, rather than the number of resources allocated to the first channel based on the number of resources for data b. For other location-related content, please refer to the description here and will not be repeated.

[0307] In one possible implementation, the first device may calculate the number of resources allocated to the first channel on a resource unit based on the first parameter. The first device may also calculate the number of resources allocated to the first channel on a resource unit based on at least one of the following: the number of resources (e.g., REs) on a resource unit (e.g., PRBs), the number of time domain units (e.g., time domain symbols) of the first channel, the number of reference signals (e.g., DMRS) in a resource unit, and the number of resources occupied by overhead information (which may be configured by a higher layer). Optionally, the overhead information includes control information or a control channel, a reference signal other than DMRS (e.g., one or more of SRS, CSI-RS, PT-RS, etc.).

[0308] For example, the first device may determine the amount of resources allocated to the first channel on one resource unit according to the following formula (3):

[0309] In formula (3), N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, Indicates the number of resources (e.g., REs) on a resource unit (e.g., PRB) (e.g., 12), represents the number of time domain units (eg, time domain symbols) of the first channel, N0 represents a first parameter, Indicates the number of reference signals (such as DMRS) in a resource unit, Parameters configured through signaling.

[0310] For example, a resource unit is a PRB, a resource is a RE, and the first channel is a PUSCH, N′ RE1 It can represent the number of REs allocated for PUSCH in a PRB (this definition can be written as the number of REs allocated for PDSCH within a PRB). The relevant content of this parameter involved in other formulas can be found in the description here and will not be repeated here.

[0311] In the embodiment of the present application, the number of reference signals may include: the number of resources of the reference signal. For example, a resource unit is a PRB, a resource is an RE, and a reference signal is a DMRS. It can represent the number of REs for DMRS per PRB. The DMRS in the embodiment of the present application can also be written as DM-RS. The relevant content of this parameter involved in other formulas can be found in the description here and will not be repeated here.

[0312] In the embodiment of this application, It can be a value configured through high-level parameters. For example, It can be used to indicate the amount of resources occupied by various overhead information on a resource unit. For example, the overhead information may include various reference signals and / or control information other than DMRS. The relevant content of this parameter involved in other formulas can be found in the description here and will not be repeated here.

[0313] Some parameters in the examples of this application (such as ) may be configured. These parameters may be configured by the first device (the first device may be a device for sending or receiving the first channel) or by other devices. For example, when the first device is a device for sending the first channel, these parameters may be configured by the device for receiving the first channel. For another example, when the first device is a device for receiving the first channel, these parameters may be configured by the device for sending the first channel. The device for configuring these parameters may also be a network device or a chip (or chip system) inside the network device. The relevant descriptions of other similar parameters can also be found in the description here and will not be repeated here.

[0314] In the embodiments of this application, the values ​​of some parameters are assigned, such as N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit. For example, the N REIndicates the number of resources allocated to the first channel. The number of these resources (or parameters) can be understood as being allocated by the first device (the first device can be a device for sending or receiving the first channel), or allocated by other devices. For example, when the first device is a device for sending the first channel, these parameters can be allocated by the device for receiving the first channel. For another example, when the first device is a device for receiving the first channel, these parameters can be allocated by the device for sending the first channel. The device that allocates these parameters can also be a network device or a chip (or chip system) inside the network device. The relevant description of other similar parameters can also be found in the description here and will not be repeated here.

[0315] The various formulas given in the embodiments of this application are examples. The parameters in these formulas are not all necessary. In actual applications, parameters can be added or reduced in the formulas, or the writing of parameters can be modified according to actual needs. This will not be repeated in other formulas. For example, in formula (3) and / or It may not be included.

[0316] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of this application are possible examples and are used to distinguish the various parameters. They have no further limiting meanings and the various parameters in the embodiments of this application can be replaced. For example, N′ RE1 The subscript RE of the resource unit can be understood as the resource allocated to the first channel on the resource unit as RE. The parameter can be replaced, such as N′ RE1 It can also be replaced by N′1, etc., and N can also be replaced by other characters. It can also be replaced by other parameters, for example, it can be replaced by N 11 Etc. For another example, The subscript of is introduced by taking the time domain unit of the first channel as the time domain symbol as an example. It can also be replaced by other parameters, for example, it can be replaced by N 12 Etc. For another example, The superscript and subscript of are introduced based on the example that one resource unit is PRB and the reference signal in one resource unit is DMRS. It can also be replaced by other parameters, for example, it can be replaced by N 13 Etc. For another example, The superscript and subscript of are introduced with a resource unit as PRB and the overhead information in a resource unit as OH as an example. It can also be replaced by other parameters, for example, it can be replaced by N 14These parameters may also appear in other locations in the embodiments of the present application, and the superscripts and subscripts of these parameters may be replaced. For related examples, please refer to the description here and will not be repeated here.

[0317] In a possible implementation manner, the number of resources allocated to the first channel in the embodiment of the present application (eg, N′ RE1 ) may refer to: the number of resources that can be allocated to the first channel (the first channel includes the first information before processing). For example, when data d is expanded in the time domain (for example, the extension length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. In the case where data d belongs to the first information, the number of resources allocated to the first channel may refer to the number of resources allocated to the first channel based on the number of resources used to transmit data d (the first information before processing), rather than the number of resources allocated to the first channel based on the number of resources for data b (the first information after processing). For other location-related content, please refer to the description here and will not be repeated.

[0318] In step A1.2, the first device determines the quantity of resources of the first channel according to the quantity of resources allocated to the first channel on the one resource unit.

[0319] For example, the first device may calculate the number of resources of the first channel based on the number of resources (e.g., REs) allocated to the first channel on a resource unit (e.g., PRB) and the number of resource units (e.g., PRBs) of the first channel. For example, after determining the number of resources available for transmitting the first channel on a resource unit, the number of resources may be multiplied by the number of resource units to obtain the total number of resources available for the first channel on the corresponding resource unit.

[0320] For example, the first device may determine the number of resources of the first channel according to the following formula (4):

[0321] N RE =min(M0, N′ RE1 )·n PRB ...Formula (4)

[0322] In formula (4), N RE Indicates the number of resources (eg, REs) allocated to the first channel, where M0 is a positive number and N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, n PRB Indicates the number (e.g., total number) of resource units allocated to the first channel. N' RE1 It can be determined by the implementation disclosed in the above step A1.1, for example, it can be determined according to formula (3).

[0323] In the embodiment of the present application, M0 may be a positive number, for example, M0 is a positive integer. In one possible implementation, M0 may represent the minimum number of resources (e.g., REs) in a resource unit (e.g., PRB) that can be used to transmit the first channel. For example, the value of M0 may be predefined, preconfigured, or configured through signaling. For example, the value of M0 may also be the number of resources N on a frequency domain resource unit. x The minimum number of symbols M available for transmission on the first channel x The product N x *M x For example, the value of M0 can be equal to the values ​​of these formulas: 13*12, 12*12, 11*12, 6*12, or 5*12, etc. In the embodiments of the present application, * in the formulas and formulas represents multiplication. For the relevant introduction of M0 involved in other formulas, please refer to here and will not be repeated here.

[0324] In this way, the number of resources of the first channel can be limited to not exceed the maximum available resource number M0 determined from the system perspective and the resource number N′ calculated in the above manner. RE1 Thus, it is ensured from multiple dimensions that the value of the number of resources of the first channel finally determined is a reasonable and effective value, thereby improving the reliability of transmission.

[0325] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are a possible example to distinguish the various parameters and have no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For example, N RE The subscript RE can be understood as the resource RE is used as an example for the introduction. This parameter can be replaced, for example, N RE Can also be replaced by N 15 N can also be replaced by other characters. For example, M0 can also be replaced by other parameters or other values, such as N 16 Etc. For another example, n PRB The subscripts are introduced with a resource unit as PRB as an example, n PRB It can also be replaced by other parameters, for example, it can be replaced by N 17 Etc. These parameters may also appear in other locations in the embodiments of this application. The superscripts and subscripts of these parameters can be replaced. For relevant examples, please refer to the description here and will not be repeated here. Other parameters in formula (4) can also be replaced. For relevant introductions, please refer to the description in other content and will not be repeated here.

[0326] Not all parameters in formula (4) are necessary. For example, M0 may not be included in formula (4).

[0327] In another possible embodiment, the first data is also transmitted using TBoMS technology. For example, a TB of first data is transmitted over N4 time domain units, and the size of the resources occupied by the TB can be N4 times the size of the resources occupied by the TB over a single time domain unit. Optionally, a larger TB can be transmitted, or a TB of the same size can be transmitted, but the code rate can be reduced by N4 times accordingly. The TBS and code rate can both be reduced, or the TB can be larger while the code rate is reduced, etc. The actual situation depends on the size of the TB transmitted and the number of available resources, and this application does not impose any restrictions on this. In this embodiment, the first device can determine the number of resources of the first channel based on at least one of the number of resources (e.g., REs) allocated to the first channel on a resource unit (e.g., PRB), the number of resource units (e.g., PRBs) of the first channel, and the number N4 of time domain units (e.g., time slots) occupied by the first data. For example, N4 can be a positive integer. For another example, N4 is an integer greater than 1. For details about N4, please refer to the previous related examples and will not be repeated here. For ease of understanding, the subsequent content may be introduced by taking N4 time domain units as N4 time slots as an example, and the time slots may also be replaced by other contents included in the time domain unit.

[0328] For example, the first device may determine the number of resources of the first channel according to the following formula (5):

[0329] N RE =N4·min(M0, N′ RE1 )·n PRB ...Formula (5)

[0330] In formula (5), N RE represents the number of resources allocated to the first channel, N4 represents the number of time domain units (such as time slots) occupied by the first data in the first information, M0 is a positive number, N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, n PRB Indicates the number of resource units allocated to the first channel, N′ RE2 Indicates the number of resources allocated to the first channel in one resource unit.

[0331] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are a possible example to distinguish the various parameters and have no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For example, N4 can also be replaced by N SEtc., N can also be replaced with other characters. These parameters may also appear in other locations in the embodiments of this application. The superscripts and subscripts of these parameters can be replaced. For relevant examples, please refer to the description here and will not be repeated here. Other parameters in formula (5) can also be replaced. For relevant introductions, please refer to the description in other content and will not be repeated here.

[0332] In a possible implementation manner, the number of resources used to transmit the first information (eg, N RE ) may refer to: the number of resources used to transmit the first information before processing. For example, when data d is expanded in the time domain (for example, the extension length is 4) to obtain data b, data b includes four elements, each of which is the result of multiplying data d by a code element. For example, when data d belongs to the first information, the number of effective resources used to transmit the first information refers to the number of resources used to transmit data d (the first information before processing), rather than the number of resources used to transmit data b (the first information after processing). Similarly, the number of resources used to transmit the first information has decreased, which may mean that the number of resources that can be used to transmit the first information before processing (i.e., data d) has decreased. For other location-related content, please refer to the description here and will not be repeated.

[0333] Step A1.3: The first device determines the size of the first information according to the amount of resources of the first channel.

[0334] For example, the first device determines the number of bits of the first channel based on the number of resources of the first channel. For example, the first device further determines the number of bits of the first channel based on at least one of a target code rate of the first channel, a modulation order of the first channel, and a number of layers.

[0335] For example, the first device may determine the number of bits of the first channel according to the following formula (6):

[0336] N info =N RE ·R·Q m ·υ……Formula (6)

[0337] In formula (6), N info represents the number of bits of the first channel, R is the target code rate of the first channel, Q m is the modulation order of the first channel, v is the number of layers, N RE represents the number of resources of the first channel (which can be calculated by formula (4) or formula (5)).

[0338] Furthermore, the first device may be configured to receive the first channel bit number N according to the first channel bit number N. info Perform operations such as quantization table lookup to obtain the size of the transmission block of the first data of the first information.

[0339] In implementation A2, the first device may determine the number of resources allocated to the first channel on one resource unit, and then determine the number of resources of the first channel based on the first parameter and the number of resources allocated to the first channel on the one resource unit.

[0340] The scheme of implementation mode A2 may include the following steps A2.1, A2.2, A2.3 and A2.4.

[0341] In step A2.1, the first device may determine the amount of resources allocated to the first channel on a resource unit.

[0342] The concepts of resources and resource units are as described in the above examples and will not be repeated here. For ease of understanding, the resource units are PRBs and the resources are REs.

[0343] For example, the first device may calculate the total amount of resources available for the first channel minus the amount of resources occupied by the reference signal and / or overhead information, thereby obtaining the amount of resources that can be allocated to the first channel on a resource unit.

[0344] In one possible implementation, the first device may calculate the number of resources allocated to the first channel on a resource unit. The first device may also calculate the number of resources allocated to the first channel on a resource unit based on at least one of the following: the number of resources (e.g., REs) on a resource unit (e.g., PRBs), the number of time domain units (e.g., time domain symbols) of the first channel, the number of reference signals (e.g., DMRSs) in a resource unit, and the number of resources occupied by overhead information (which may be configured by a higher layer).

[0345] For example, the first device may determine the amount of resources allocated to the first channel on one resource unit according to the following formula (7):

[0346] In formula (7), N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, Indicates the number of resources (e.g., REs) on a resource unit (e.g., PRB) (e.g., 12), represents the number of time domain units (eg, time domain symbols) of the first channel, Indicates the number of reference signals in a resource unit, Parameters configured through signaling. The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of this application are possible examples and are used to distinguish the various parameters. They have no further limiting meaning. The various parameters in the embodiments of this application can be replaced. For related examples, please refer to the above description and will not be repeated here.

[0347] Not all parameters in formula (7) are necessary. For example, and / or It may not be included.

[0348] Step A2.2: The first device determines the quantity of resources of the first channel according to the first parameter and the quantity of resources allocated to the first channel on the one resource unit.

[0349] For example, the first device may calculate the number of resources of the first channel based on the first parameter, the number of resources (e.g., REs) allocated to the first channel on a resource unit (e.g., PRB), and the number of resource units (e.g., PRBs) of the first channel. For example, the first device determines the number of resources of the first channel that can carry data payload based on the number of pre-expansion resources that can actually be used to carry data.

[0350] For example, the first device may determine the number of resources of the first channel according to the following formula (8):

[0351] N RE =min(M0, N′ RE2 )·n PRB / N0……Formula (8)

[0352] In formula (8), N RE Indicates the number of resources (eg, REs) allocated to the first channel, where M0 is a positive number and N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, n PRB N′ represents the number of resource units allocated to the first channel, and N0 represents the first parameter. RE2 The determination can be made using the implementation method disclosed in step A2.1 above, for example, according to formula (7). The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of this application are one possible example, intended to distinguish the various parameters, and have no further limiting meaning. The various parameters in the embodiments of this application can be replaced. For related examples, please refer to the above description and will not be repeated here.

[0353] Not all parameters in formula (8) are necessary. For example, M0 may not be included in formula (8).

[0354] In another possible embodiment, the first data is also transmitted using TBoMS technology. For example, a TB of first data is transmitted over N4 time domain units, and the size of the resources occupied by the TBS of the TB can be N4 times the size of the resources occupied by the TBS of the TB over a single time domain unit. Optionally, a larger TB can be transmitted, or a TB of the same size can be transmitted with the code rate correspondingly reduced by N4 times, or both the TBS and the code rate can be reduced, or the TB can be larger while the code rate is reduced, etc. The actual situation depends on the size of the TB transmitted and the number of available resources, and this application does not impose any restrictions on this. In this embodiment, the first device can determine the number of resources of the first channel based on at least one of the number of resources (e.g., REs) allocated to the first channel on a resource unit (e.g., PRB), the number of resource units (e.g., PRBs) of the first channel, and the number N4 of time domain units (e.g., time slots) occupied by the first data. For example, N4 can be a positive integer. For another example, N4 is an integer greater than 1. For details about N4, please refer to the previous examples and will not be repeated here.

[0355] For example, the first device may determine the number of resources of the first channel according to the following formula (9):

[0356] N RE =N4·min(M0, N′ RE2 )·n PRB / N0...Formula (9)

[0357] In formula (9), N RE represents the number of resources allocated to the first channel, N4 represents the number of time domain units (such as time slots) occupied by the first data in the first information, M0 is a positive number, N′ RE1 Indicates the number of resources allocated to the first channel on a resource unit, n PRB Indicates the number of resource units allocated to the first channel, N′ RE2 represents the number of resources allocated to the first channel on a resource unit, and N0 represents a first parameter. The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are possible examples and are intended to distinguish the various parameters. They have no further limiting meanings, and the various parameters in the embodiments of the present application can be replaced. For related examples, please refer to the above description and will not be repeated here.

[0358] Not all parameters in formula (9) are necessary. For example, M0 may not be included in formula (9).

[0359] Step A2.3: The first device determines the size of the first information according to the amount of resources of the first channel.

[0360] For step A2.3, please refer to the relevant solutions of the aforementioned step A1.3 and will not be repeated here.

[0361] It can be seen from the solutions provided in the above embodiments A1 and A2 that the first device can use the first parameter to adjust N′ RE The value of (see implementation A1), the first parameter can also be used to adjust N RE The value of (see embodiment A2), so that the adjusted N' RE or adjusted N RE The size of the data packet corresponding to the first data is determined, thereby preventing the data packet from being set too large, and thereby reducing decoding errors caused by the data packet being set too large.

[0362] For the first information processed by the processing method involved in step 801, the first device can flexibly choose to use the first parameter to adjust N′ RE Or adjust N RE In another possible implementation manner, the first device may select a corresponding implementation manner according to an actual processing method.

[0363] For example, if the processing method of the first data includes at least one of the following, the first device may choose to use the first parameter to adjust N′ RE (Using Implementation A1): The first data is expanded N1 times in the time domain (e.g., at the symbol level of a single time slot), the first data packet is expanded N2 times in the frequency domain, and the first data is mapped in the frequency domain with comb teeth N3 as the interval. In this way, the first device can determine the size of the first information based on the number of available time domain units (e.g., the number of symbols) in the first channel during actual transmission, thereby avoiding oversizing the data packet and reducing decoding errors caused by oversizing the data packet.

[0364] For another example, if the processing method of the first data includes at least one of the following, the first device may choose to use the first parameter to adjust N RE (Implementation A2): The first data is expanded N1 times in the time domain, for example, at the multi-slot symbol level. In this way, the first device can determine the size of the first information based on the number of time domain units occupied by the first channel during actual transmission (for example, the number of available time slots), thereby avoiding overly large data packets and reducing decoding errors caused by such overly large data packets.

[0365] Based on the embodiments shown in Figures 1, 2A, 2B, 3A, 3B, 3C, 3D, 3E, 3F, 3G, 3H, 3I, 3J, 3K, 4A, 4B, 5, 6A, 6B, 7, and 8, Figure 9 exemplifies a possible flow chart of a method for determining a transmission parameter provided by an embodiment of the present application. Figure 9 can also be regarded as a possible implementation of Figure 7. In this implementation, the transmission parameter includes the number of coded modulation symbols of the second information. In Figure 9, the first device is used as the execution subject for the introduction. For the relevant content of the first device, please refer to the introduction of Figure 7 and will not be repeated here.

[0366] The following is an introduction with reference to FIG9 .

[0367] Step 901: The first device obtains a processing method of the first information.

[0368] The processing method includes at least one of the following: the first information is expanded N1 times in the time domain, where N1 is a positive integer; the first information is expanded N2 times in the frequency domain, where N2 is a positive integer; the first information is mapped in the frequency domain with comb teeth N3 as the interval, where N3 is a positive integer.

[0369] The first information may include the second information and / or the first data. The first information is carried on the first channel, which may or may not carry data. For example, the first information may or may not include the first data. The description of the first information, the second information, and the first channel is as described above and is not repeated here.

[0370] The content of step 901 refers to the relevant description of the aforementioned step 701 and will not be repeated here.

[0371] Step 902: The first device determines the number of coded modulation symbols of the second information according to the first parameter.

[0372] The relevant concepts of the first parameter can be found in the above description and will not be repeated here.

[0373] The number of coded modulation symbols of the second information may be replaced by the number of coded modulation symbols per layer of the second information.

[0374] The first device may perform rate matching on the first channel based on the number of coded modulation symbols of the second information. For example, the first device may remove the resources occupied by the coded modulation symbols corresponding to the second information from the resources of the first channel, and determine the amount of data (e.g., the first data) available for transmission on the first channel using the remaining resources. This process may be referred to as rate matching.

[0375] After the first information undergoes the relevant processing in step 901, the resources used to carry the data in the first information increase, and the corresponding number of resources on the first channel that can be used to carry the second information will decrease. If this impact is not taken into account when performing rate matching on the first channel, the first device will configure too many resources for the second information, resulting in a corresponding reduction in the resources available for transmitting data on the first channel, which will affect the transmission performance and reliability of the first channel.

[0376] Based on the above problem, in the solution provided in the embodiment of the present application, the first device can determine the number of coded modulation symbols of the second information based on the first parameter, and then the first device performs rate matching on the first channel based on the number of coded modulation symbols of the second information.

[0377] In step 902, in a possible implementation, the first device determines the number of resources used to transmit the second information in the first channel according to the first parameter, and determines the number of coded modulation symbols of the second information according to the number of resources used to transmit the second information in the first channel.

[0378] In the embodiment of the present application, the "number of resources in the first channel used to transmit the second information" may be the number of resources occupied by the second information in the first information before the first information is processed in step 901. For example, the number of resources occupied by the second information may include / be the number of resources of the second information in all scheduled time-domain symbols.

[0379] For example, the first device can determine the number of resources used to transmit the second information in the first channel based on the first parameter and the number of resources that can be used to carry the second information on the first channel. The number of resources that can be used to carry the second information on the first channel can be the number of resources that can originally be used to carry the second information on the first channel without considering the relevant processing method in step 901 of the first information. The first device reduces the number of resources that can originally be used to carry the second information on the first channel based on the first parameter, and the result can be regarded as the number of resources used to transmit the second information in the first channel. This solution can avoid configuring an excessive number of resources for the second information, thereby improving the transmission performance and reliability of the first channel.

[0380] For example, the first device may determine the number of resources used (or usable) for transmitting the second information in the first channel according to the calculation result of the following formula (10):

[0381] In formula (10), N0 represents the first parameter, represents the number of resources of the first channel, Indicates the number of resources (eg, REs) used to transmit the second information in a time domain unit 1 (eg, time domain symbol 1) in the first channel. For ease of understanding, the following is an example of a resource unit being a PRB and a resource being a RE.

[0382] In the embodiment of this application, Indicates the number of resources of the first channel. It can represent the total number of resources of the first channel. For example, It can represent the total number of OFDM symbols of the first channel.

[0383] For example, "the number of resources used (or available for use) in the first channel to transmit the second information" may indicate the number (e.g., the total number) of resources that can be used (or available for use) in the first channel to transmit the second information. This number may be the same as or different from the number of resources actually used to transmit the second information. The number of resources used (or available for use) in the first channel to transmit the second information may be, for example, the result calculated by formula (10).

[0384] For example, in an embodiment of the present application, "the number of resources in the first channel used (or can be used) to transmit the second information" may also be: the number of resources used (or can be used) to transmit the first channel.

[0385] For example, It can represent the number of resources (e.g., REs) available on the first channel for carrying the second information. In the embodiment of the present application, the number of resources (e.g., REs) available on the first channel for carrying the second information is reduced based on the number of valid resources before expansion through formula (10). In this way, the subsequent calculation result based on formula (10) can more accurately determine the number of coded modulation symbols of the second information based on the actually available valid first channel resources. The impact of formula (10) on the number of coded modulation symbols of the second information can be further explained by the subsequent formula.

[0386] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are a possible example, which is to distinguish the various parameters and has no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For example, the superscripts or subscripts of the various parameters in some formulas in the embodiments of the present application are SCH, which can represent the first channel. The SCH can be replaced by PUSCH, PDSCH or PSSCH. For example, when the first channel is PUSCH, the parameter Can be replaced by In the embodiments of the present application, the superscript or subscript of some parameters is CI, which can represent the second information. The CI can be replaced by DCI, UCI, etc. For example, when the second information is UCI, the parameter Can be replaced by For example Can also be replaced by N 16 N can also be replaced by other characters. It can also be replaced by M(l), etc.

[0387] In another possible implementation, the data on the first channel may be transmitted using TBoMS technology. In this case, when the first device calculates the number of resources that can be used to carry the second information in the first channel, it can also be calculated based on the number N4 of time domain units (such as time slots) occupied by the first data. Optionally, it can be a larger TB transmitted, or a TB of the same size can be transmitted, but the code rate is correspondingly reduced by N4 times, it can be that both the TBS and the code rate are reduced, or the TB becomes larger and the code rate becomes smaller, etc. The actual situation depends on the size of the TB transmitted and the number of available resources, and this application does not impose any restrictions on this. For example, the number of time domain units (such as time slots) occupied by the first data increases (for example, N4 is an integer greater than 1). In this case, the size of the data packet corresponding to the first data transmitted on a time domain unit (such as a time slot) will become smaller, and then the first device can reduce the number of bits before encoding of the data on the first channel based on N4, so that the number of resources occupied by the second information in the first channel can be more accurately determined. For further and more detailed examples, please refer to the relevant description of the subsequent formulas, which will not be elaborated here.

[0388] The first device may consider the number of resources in the first channel used to transmit the second information as the number of coded modulation symbols for the second information. Alternatively, the first device may determine the number of coded modulation symbols for the second information based on the total number of valid resources on the first channel before expansion and the number of resources in the first channel used to transmit the second information. For example, the first device may determine the number of coded modulation symbols for the second information based on the smaller of the total number of resources on the first channel and the number of resources in the first channel used to transmit the second information. This ensures that the number of resources occupied by the second information does not exceed the total number of resources in the first channel.

[0389] For example, the second information may include / be at least one of: HARQ-ACK, CG-UCI, CSI-1, and CSI-2. The following examples illustrate schemes for determining coded modulation symbols for HARQ-ACK, CG-UCI, CSI-1, and CSI-2, respectively, through Implementation B1, Implementation B2, Implementation B3, and Implementation B4.

[0390] In implementation mode B1, the first device calculates the number of coded modulation symbols of HARQ-ACK.

[0391] The first channel carries the second information. The first channel may carry data or may not carry data. Several possible implementations are introduced below through implementation B1.1, implementation B1.2, implementation B1.3 and implementation B1.4 respectively.

[0392] In implementation B1.1, when the first channel carries data (e.g., first data), the number of coded modulation symbols of HARQ-ACK can be calculated using the following formula (11):

[0393] In formula (11), Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O ACK Indicates the number of HARQ-ACK bits, L ACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, and α represents the adjustment coefficient.

[0394] It can be seen from the above formula (11) that formula (10) belongs to the two parts of formula (11). Formula (10) is for Q′ ACK The calculation results of the two parts have an impact. In the embodiment of the present application, Q′ in formula (11) is replaced by formula (10). ACK The calculation results of the two parts are reduced, so that the number of coded modulation symbols of the second information can be determined more accurately.

[0395] In the embodiment of this application, It can indicate the size of the data packet on the first channel before encoding. The meaning of this parameter in other positions can be similar and will not be repeated here.

[0396] In the embodiment of the present application, min{·} is a minimum value operation. is rounded up, ∑· is the summation operation, and the meanings of these symbols in the other formulas are similar and will not be repeated here.

[0397] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are a possible example, which is to distinguish the various parameters and has no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For example, in the embodiments of the present application, the superscript or subscript of some symbols is SCH, which can represent the first channel. The SCH can be replaced by PUSCH, PDSCH or PSSCH. For example, when the first channel is PUSCH, the parameter Can be replaced by β or other characters. For example, Q′ ACK , O ACK , L ACK The subscript ACK can represent the parameters corresponding to the HARQ-ACK in the second information. The subscripts of these parameters can also be replaced by other characters, such as the parameter Q′ ACK It can be replaced by Q1′, etc. The replacement of other parameters is similar and will not be repeated here.

[0398] For example, (O ACK +L ACK ) is 30 bits, (i.e. the code block size is 100 bits), is 72 (i.e. the first data after expansion occupies 72 REs), is 1, α is 0.5, the first data occupies 24 REs, and the expansion factor of the first data is 3.

[0399] In implementation B1.2, the first channel carries first data, and the first data on the first channel is transmitted using the TBoMS technology.

[0400] In another possible implementation, the first data is further transmitted using TBoMS technology. For example, if a TB of first data is transmitted over N4 time domain units, the size of the resources occupied by the TBS of the TB may be N4 times the size of the resources occupied by the TBS of the TB over a single time domain unit. Based on this, the first device considers this effect when calculating the number of coded modulation symbols for the second information, thereby more accurately determining the number of coded modulation symbols for the second information.

[0401] The first channel carries the first data. When the first data on the first channel is transmitted using the TBoMS technology, the number of coded modulation symbols of HARQ-ACK can be calculated using the following formula (12):

[0402] In formula (12), Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O ACK Indicates the number of HARQ-ACK bits, LACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, and N4 represents the number of time domain units (e.g., time slots) occupied by the first data in the first information. ACK The influence of can be seen in the above formula (10) on Q' in formula (11). ACK For example, in the embodiment of this application, It can represent the bit rate adjustment factor. The introduction of this parameter in other formulas can be found here and will not be repeated here.

[0403] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are examples for the purpose of distinguishing the parameters and have no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For related examples, please refer to the above description and will not be repeated here.

[0404] In implementation B1.3, the first channel does not carry data, and the number of coded modulation symbols of HARQ-ACK can be calculated using the following formula (13):

[0405] In formula (13), Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O ACK Indicates the number of HARQ-ACK bits, L ACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, R represents the code rate of the first channel, Q m represents the modulation order of the first channel, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in the time domain unit 1 in the first channel, N0 represents the first parameter, and α represents the adjustment coefficient.

[0406] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are examples for the purpose of distinguishing the parameters and have no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For related examples, please refer to the above description and will not be repeated here.

[0407] In implementation B1.4, when the second information includes HARQ-ACK and CG-UCI, the number of coded modulation symbols of HARQ-ACK can be calculated by the following formula (14):

[0408] In formula (14), Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, O CG-UCI Indicates the number of CG-UCI bits, O ACK Indicates the number of HARQ-ACK bits, L ACK Indicates the number of bits of the HARQ-ACK cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, and N4 represents the number of time domain units (such as time slots) occupied by the first data.

[0409] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of the present application are examples for the purpose of distinguishing the parameters and have no further limiting meaning. The various parameters in the embodiments of the present application can be replaced. For related examples, please refer to the above description and will not be repeated here.

[0410] In implementation mode B2, the first device calculates the number of coded modulation symbols of the CG-UCI.

[0411] The first channel carries data (e.g., first data). When the first data on the first channel is transmitted using the TBoMS technology, the number of coded modulation symbols of the CG-UCI can be calculated using the following formula (15):

[0412] In formula (15), Q′ CG-UCI Indicates the number of coded modulation symbols of CG-UCI, O CG-UCI Indicates the number of CG-UCI bits, L CG-UCI Indicates the number of bits of CG-UCI cyclic redundancy check, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in a time domain unit (eg, time domain symbol) l in the first channel, C represents the number of code blocks in the first channel, and K rrepresents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, and N4 represents the number of time slots occupied by the first data.

[0413] In another possible implementation, the first data on the first channel may not use the TBoMS technology. In this case, the parameter N4 is not included in formula (15), for example: The parameters of this formula can be

[0414] Please refer to the description of the relevant parameters in formula (15) and will not be repeated here.

[0415] In implementation B3, the first device calculates the number of coded modulation symbols of CSI-1. CSI-1 may also be referred to as the first part of CSI (CSI part 1).

[0416] The first channel carries CSI-1. The first channel may carry data or may not carry data. Several possible implementations are introduced below through implementation B3.1, implementation B3.2, implementation B3.3 and implementation B3.4 respectively.

[0417] In implementation B3.1, the first channel carries data (e.g., first data). When the first data on the first channel is transmitted using the TBoMS technology, the number of coded modulation symbols of CSI-1 can be calculated using the following formula (16):

[0418] In formula (16), Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, O CSI-1 Indicates the number of CSI-1 bits, L CSI-1 Indicates the number of bits of the cyclic redundancy check of CSI-1, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in a time domain unit (eg, time domain symbol) l in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, N4 represents the number of time domain units (such as time slots) occupied by the first data, and Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI.

[0419] In this application, Q′ACK / CG-UCI can be replaced by: Q′ ACK , Q′ CG-UCI , can also be replaced by: (Q′ ACK+Q′ CG-UCI ). This content is also applicable to other formulas and will not be repeated here.

[0420] In another possible implementation, the first data on the first channel may not use the TBoMS technology. In this case, the parameter N4 does not need to be included in formula (16), for example:

[0421] The parameters of this formula can be found in the description of the relevant parameters in formula (16), which will not be repeated here.

[0422] In the embodiment of the present application, Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI. The number of coded modulation symbols of HARQ-ACK may be a value determined by the aforementioned formula (11), formula (12), formula (13) or formula (14), and the number of coded modulation symbols of CG-UCI may be a value determined by the aforementioned formula (15). Q′ACK / CG-UCI may include / be: Q′ ACK , Q′ CG-UCI or (Q′ ACK +Q′ CG-UCI For example, when the second information includes HARQ-ACK and CG-UCI, Q′ACK / CG-UCI may be (Q′ ACK +Q′ CG-UCI ). For another example, when the second information includes HARQ-ACK but does not include CG-UCI, Q'ACK / CG-UCI can be Q' ACK For another example, when the second information does not include HARQ-ACK but includes CG-UCI, Q'ACK / CG-UCI can be Q' CG-UCI The parameter contents in other locations are similar and will not be repeated here.

[0423] The superscripts and / or subscripts of the parameters in the various formulas in the embodiments of this application are a possible example to distinguish the various parameters. They have no further limiting meanings. The various parameters in the embodiments of this application can be replaced. For example, Q′ CSI-1 , O CSI-1 , L CSI-1 The subscript CSI-1 can represent the parameters corresponding to CSI-1 in the second information. The subscripts of these parameters can also be replaced by other characters, such as parameter Q′ CSI-1 It can be replaced by Q′2, etc. The replacement of other parameters is similar and will not be repeated here.

[0424] In implementation B3.2, the number of coded modulation symbols of CSI-1 can be calculated using the following formula (17):

[0425] In formula (17), Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, O CSI-1 Indicates the number of CSI-1 bits, L CSI-1 Indicates the number of bits of the cyclic redundancy check of CSI-1, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in a time domain unit (eg, time domain symbol) l in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, and Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI.

[0426] In a possible implementation, in the application scenario of formula (17), the first data carried on the first channel uses repeated transmission of type B.

[0427] In another possible implementation, the first data on the first channel may use the TBoMS technology. In this case, the number of coded modulation symbols of CSI-1 can be calculated using the following formula:

[0428] Formula N4 represents the number of time domain units (eg, time slots) occupied by the first data. For the remaining parameters, please refer to the description of the relevant parameters in formula (17) and will not be repeated here.

[0429] In implementation B3.3, when the second information includes CSI-1 and CSI-2, the number of coded modulation symbols of CSI-1 can be determined by the following formula (18):

[0430] In formula (18), Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, O CSI-1 Indicates the number of CSI-1 bits, L CSI-1 Indicates the number of bits of the cyclic redundancy check of CSI-1, represents the adjustment factor, R represents the code rate of the first channel, Q m represents the modulation order of the first channel, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ ACKIndicates the number of coded modulation symbols of HARQ-ACK. If the second information does not include HARQ-ACK, the parameter Q′ may not be included in formula (18) ACK Q′ in formula (18) ACK It can also be replaced by Q′ACK / CG-UCI. For related meanings, please refer to the descriptions elsewhere and will not be repeated here.

[0431] In implementation B3.4, when the first channel does not carry CSI-2, the number of coded modulation symbols of CSI-1 can be determined by the following formula (19):

[0432] In formula (19), Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ ACK Indicates the number of coded modulation symbols of HARQ-ACK. If the second information does not include HARQ-ACK, the parameter Q′ may not be included in formula (19) ACK Q′ in formula (19) ACK It can also be replaced by Q′ACK / CG-UCI. For related meanings, please refer to the descriptions elsewhere and will not be repeated here.

[0433] In implementation B4, the first apparatus calculates the number of coded modulation symbols of CSI-2, which may also be referred to as the second part of CSI (CSI part 2).

[0434] The first channel carries CSI-2. The first channel may carry data or may not carry data. Several possible implementations are introduced below through implementation B4.1, implementation B4.2 and implementation B4.3 respectively.

[0435] In implementation B4.1, the first data on the first channel uses the TBoMS technology, and the number of coded modulation symbols of CSI-2 can be calculated using the following formula (20):

[0436] In formula (20), Q′ CSI-2 Indicates the number of coded modulation symbols of CSI-2, O CSI-2 Indicates the number of CSI-2 bits, L CSI-2 Indicates the number of bits of the CSI-2 cyclic redundancy check. represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources (eg, REs) used to transmit the second information in a time domain unit (eg, time domain symbol) l in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, min{·} is the minimum value operation, is rounded up, ∑· is a summation operation, N4 represents the number of time domain units (e.g., time slots) occupied by the first data, and Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI. In one possible implementation, in the application scenario of formula (20), the first data carried on the first channel does not use type B repeated transmission.

[0437] In another possible implementation, the first data on the first channel may not use the TBoMS technology. In this case, the parameter N4 is not included in formula (20), for example:

[0438] The parameters of this formula can be found in the description of the relevant parameters in formula (20), which will not be repeated here.

[0439] If the second information does not include CSI-1, the parameter Q′ may not be included in formula (20) CSI-1 The description of other parameters can be found in the above content and will not be repeated here.

[0440] In implementation B4.2, the first data on the first channel uses the TBoMS technology, and the number of coded modulation symbols of CSI-2 can be calculated using the following formula (21):

[0441] In formula (21), Q′ CSI-2 Indicates the number of coded modulation symbols of CSI-2, O CSI-2 Indicates the number of CSI-2 bits, L CSI-2 Indicates the number of bits of the CSI-2 cyclic redundancy check. represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI, Q′CSI-1 represents the number of coded modulation symbols of CSI-1, and N4 represents the number of time domain units (e.g., time slots) occupied by the first data. In one possible implementation, in the application scenario of formula (21), the first data carried on the first channel uses type B repeated transmission.

[0442] In another possible implementation, the first data on the first channel may not use the TBoMS technology. In this case, the parameter N4 is not included in formula (21), for example:

[0443] The parameters of this formula can be found in the description of the relevant parameters in formula (21), which will not be repeated here.

[0444] If the second information does not include CSI-1, the parameter Q′ may not be included in formula (21) CSI-1 The description of other parameters can be found in the above content and will not be repeated here.

[0445] In implementation B4.4, when the first channel does not carry data (for example, does not carry the first data), the number of coded modulation symbols of CSI-2 can be determined by formula (22):

[0446] In formula (22), Q′ CSI-2 Indicates the number of coded modulation symbols of CSI-2, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit l in the first channel, N0 represents the first parameter, Q′ ACK Indicates the number of coded modulation symbols of HARQ-ACK, Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1. Q′ in formula (22) ACK It can also be replaced by Q′ACK / CG-UCI. For related meanings, please refer to the descriptions elsewhere and will not be repeated here.

[0447] If the second information does not include CSI-1, the parameter Q′ may not be included in formula (22) CSI-1 If the second information does not include HARQ-ACK, the parameter Q′ may not be included in formula (22) ACK The description of other parameters can be found in the above content and will not be repeated here.

[0448] Based on the embodiments shown in Figures 1, 2A, 2B, 3A, 3B, 3C, 3D, 3E, 3F, 3G, 3H, 3I, 3J, 3K, 4A, 4B, 5, 6A, 6B, 7, 8 and 9, Figure 10 is used below to illustrate a possible flow chart of a method for determining a transmission parameter provided by an embodiment of the present application. Figure 10 can also be regarded as a possible implementation method of Figure 7. In this implementation method, the transmission parameter includes the transmission power of the first channel as an example for introduction. In Figure 10, the first device is used as the execution subject for introduction. For the relevant content of the first device, please refer to the introduction of Figure 7 and will not be repeated here.

[0449] The following is an introduction with reference to FIG10 .

[0450] Step 1001: A first device obtains a processing method for first information.

[0451] The processing method includes at least one of the following: the first information is expanded N1 times in the time domain, where N1 is a positive integer; the first information is expanded N2 times in the frequency domain, where N2 is a positive integer; the first information is mapped in the frequency domain with comb teeth N3 as the interval, where N3 is a positive integer.

[0452] The relevant content of step 1001 can be found in the relevant description of the aforementioned step 701 and will not be repeated here.

[0453] Step 1002: The first device determines the transmission power of a first channel for carrying first data according to a second parameter.

[0454] The second parameter of the present application may also be replaced by other names, for example, by: second value, extension length, etc. Optionally, the extension length may include / be / be determined according to: time domain extension length; frequency domain extension length; the inverse of the comb tooth size; the combined length of time domain extension and frequency domain extension (for example, the product of the time domain extension length and the frequency domain extension length); the combined length of time domain extension and comb division (for example, the product of the time domain extension length and the inverse of the comb tooth size); or the combined length of frequency domain extension and comb division (for example, the product of the frequency domain extension length and the inverse of the comb tooth size), etc.

[0455] For example, the second parameter can be combined with N1, N2 and The second parameter includes N1, N2 and Alternatively, the second parameter is a function of N1, N2 and At least one of them is determined.

[0456] For example, the second parameter is a parameter for N1, N2 and For example, the second parameter includes N1, N2 and For example, the second parameter is represented by parameter N0, which can be N1, N2, N1*N2, as well as Any one of .

[0457] When calculating the second parameter, the first device may also calculate based on some other parameters, such as values ​​that can be configured, pre-configured or defined through a protocol, and these correction values ​​are consistent with the values ​​of N1, N2 and Perform mathematical calculation on at least one of the parameters, and use the result as the second parameter. For example, the second parameter is represented by parameter N0, which can be (M2*N1), (M2+N1), (M2+N2), M 21 *N1*N2, as well as M2 can be a protocol-configured, pre-configured, or defined value.

[0458] The first device may calculate the transmission power of the first channel at the transmission time (or occasion) i based on the implementation scheme provided in FIG. 10 .

[0459] In one possible implementation, the value of the first parameter may correspond to the scenario shown in the aforementioned Table 1. Table 3 below exemplifies the values ​​of the first parameter in various scenarios. Scenario 4 in Table 3 below is used for introduction. In scenario 4, the value of the second parameter N5 is N1. The meanings of the first parameters corresponding to other scenarios are similar. For the relevant introduction to scenario 4, please refer to the description in Table 1 above and will not be repeated here. When the first information is extended in the time domain, when the first information is extended at the symbol level of a single time slot, N1 may be the symbol-level expansion factor of the first parameter; when the first information is extended at the symbol level of multiple time slots, N1 may be the time slot-level expansion factor of the first parameter.

[0460] Table 3 Examples of scenarios in which the first information processing method and the first information transmission method are combined

[0461] After the first information undergoes the relevant processing in step 1001, the resources used to carry the data in the first information increase, and the number of REs corresponding to one TB of the first data on the corresponding first channel will change. For example, mapping the first information in the frequency domain with comb teeth N3 as intervals will cause the total RE to decrease when transmitting one TB of the first data, thereby increasing the BPRE. For another example, expanding the first information by a factor of N1 in the time domain will cause the total RE to increase when transmitting one TB of the first data, thereby decreasing the BPRE. The BRPE will affect the transmission power of the first channel. Based on this, if the impact of the processing method of the first information is not taken into account when determining the transmission power of the first channel, the transmission power of the first channel will be inaccurate, thereby affecting the transmission performance and reliability of the first channel.

[0462] Based on the above problems, in the solution provided in the embodiment of the present application, the first device can determine the transmission power of the first channel based on the second parameter, so as to determine a more accurate transmission power of the first channel, thereby improving the transmission performance and reliability of the first channel.

[0463] In step 1002, the first device may determine the number of resources for the first channel based on the second parameter, and determine the transmit power of the first channel based on the number of resources. This allows for a more accurate transmit power to be determined for the first information to be transmitted and subjected to the aforementioned processing operation. This can prevent the transmit power from being too low, thereby improving transmission performance and reliability, and prevent the transmit power from being too high, thereby reducing energy waste.

[0464] The following describes an example of a first device determining the transmit power of a first channel through steps 1, 2, and 3.

[0465] In step 1, the first device calculates BPRE according to the second parameter.

[0466] The BPRE includes the number of bits on each resource, and the BPRE is determined according to the number of resources carrying the first data.

[0467] For example, BPRE is determined according to the following formula (23):

[0468] In formula (23), BPRE represents the number of bits per resource element, N5 represents the second parameter, and N RE represents the number of resources in the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel.

[0469] In another possible implementation, the first data is also transmitted using TBoMS technology. In this case, the first device can determine BPRE according to the following formula (24):

[0470] In formula (24), BPRE represents the number of bits per resource element, N5 represents the second parameter, and N RE represents the number of resources of the first channel, N4 represents the number of time domain units (such as time slots) occupied by the first data on the first channel, C represents the number of code blocks in the first channel, K r represents the size of the rth code block in the first channel.

[0471] In formula (23) and formula (24), the parameter N RE Satisfies the following formula: represents the number of resource blocks (e.g., PRBs) in the first channel frequency domain at the transmission time i, represents the number of resources (eg, REs) in the time domain unit (eg, time domain symbol) j of the first channel at the transmission time i, wherein N symb (i) represents the number of time domain units (eg, time domain symbols) of the first channel at transmission time i (or transmission occasion i).

[0472] Step 2: The first device calculates a power offset value according to BPRE.

[0473] The power offset value may include / be a power offset value based on a modulation and coding strategy. The power offset value may be determined according to formula (25):

[0474] In formula (25), Δ TF (i) represents the power offset value, BPRE represents the number of bits per resource element, β represents the adjustment factor, K s It is a real number configured by signaling or predefined.

[0475] In step three, the first device calculates the transmit power value of the first channel according to the power offset value.

[0476] The transmit power value of the first channel can be determined according to formula (26):

[0477] In formula (26), P(i,l) represents the transmit power of the first channel, i represents the transmit time, l represents the power control adjustment state index of the first channel, and P CMAX (i) represents the maximum transmit power, P O represents the power parameter, μ represents the subcarrier spacing of the first channel, M RB (i) represents the number of resource blocks in the first channel frequency domain at the transmission time i, α0 represents the path loss factor, PL represents the path loss, Δ TF(i) represents the power offset value, and f(i, l) represents the power control adjustment state of the first channel.

[0478] The above steps 1, 2, and 3 provide a possible example. In actual applications, the formulas in each step may contain more or fewer parameters, and the superscripts or subscripts of the parameters in each formula, or the parameters themselves, may be changed. For related examples, please refer to the previous description and will not be repeated here.

[0479] It is understood that in order to implement the functions in the above embodiments, the first device, the second device, and the positioning management device may include hardware structures and / or software modules that perform the corresponding functions. Those skilled in the art should readily appreciate that, in combination with the units and method steps of the various examples described in the embodiments disclosed in this application, this application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in hardware or in a manner driven by computer software depends on the specific application scenario and design constraints of the technical solution.

[0480] In an embodiment of the present application, the embodiments shown in Figures 8 and 9 above can be applied to the sending end of the first information, and can also be applied to the receiving end of the first information. The embodiment shown in Figure 10 above can be applied to the sending end of the first information. For example, a first communication device and a second communication device communicate with each other, the first communication device sends the first information to the second communication device, and the corresponding second communication device receives the first information. Any one of the first communication device and the second communication device can be the terminal device shown in Figure 6A above, the chip (system) inside the terminal device, the network device or the chip (system) inside the network device, and any one of the first communication device and the second communication device can be the terminal device shown in Figure 6B above, the chip (system) inside the terminal device, the ground station, the chip (system) inside the ground station, the satellite or the chip (system) inside the satellite.

[0481] The solutions provided in FIG8 , FIG9 and FIG10 can be executed independently.

[0482] For example, the first communication device may execute the scheme (e.g., steps 801 and 802) performed by the first device shown in FIG8 to determine the size of the first information, and then send the first information based on the size of the first information. For another example, the second communication device may execute the scheme (e.g., steps 801 and 802) performed by the first device shown in FIG8 to determine the size of the first information, and then obtain the first information from the received signal based on the size of the first information.

[0483] For another example, the first communications device may execute the scheme (e.g., steps 901 and 902) executed by the first device shown in FIG. 9 to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information. For another example, the second communications device may execute the scheme (e.g., steps 901 and 902) to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information.

[0484] For another example, the first communication device may execute the scheme executed by the first device shown in FIG10 (eg, steps 1001 and 1002) to determine the transmission power of the first channel, and then send the first information based on the transmission power of the first channel.

[0485] Any multiple solutions provided in FIG. 8 , FIG. 9 and FIG. 10 may be implemented in combination.

[0486] For example, the embodiments provided in Figures 8 and 9 can be performed in combination. For example, a first communication device can execute the scheme performed by the first device shown in Figure 8 (such as steps 801 and 802) to determine the size of the first information, and execute the scheme performed by the first device shown in Figure 9 (such as steps 901 and 902) to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information, and send the first information based on the size of the first information. For another example, a second communication device can execute the scheme performed by the first device shown in Figure 8 (such as steps 801 and 802) to determine the size of the first information, and execute the scheme performed by the first device shown in Figure 9 (such as steps 901 and 902) to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information, and obtain the first information from the received signal based on the size of the first information. There is no absolute order for the first communication device (or the second communication device) to execute the schemes of Figures 8 and 9. For example, the scheme of Figure 8 may be executed first and then the scheme of Figure 9, or the scheme of Figure 9 may be executed first and then the scheme of Figure 8.

[0487] For example, the embodiments provided in Figures 8 and 10 can be performed in combination. For example, the first communication device can execute the scheme executed by the first device shown in Figure 8 (such as steps 801 and 802) to determine the size of the first information, and execute the scheme executed by the first device shown in Figure 10 (such as steps 1001 and 1002) to determine the transmission power of the first channel, and then send the first information based on the transmission power of the first channel and the size of the first information. There is no absolute order in which the first communication device executes the schemes of Figures 8 and 10. For example, the scheme of Figure 8 can be executed first and then the scheme of Figure 10, or the scheme of Figure 10 can be executed first and then the scheme of Figure 8. For another example, the second communication device can execute the scheme executed by the first device shown in Figure 8 (such as steps 801 and 802) to determine the size of the first information, and then obtain the first information from the received signal based on the size of the first information.

[0488] For example, the embodiments provided in Figures 9 and 10 can be performed in combination. For example, the first communication device can execute the scheme performed by the first device shown in Figure 9 (such as steps 901 and 902) to determine the number of coded modulation symbols of the second information, and execute the scheme performed by the first device shown in Figure 10 (such as steps 1001 and 1002) to determine the transmit power of the first channel, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information, and send the first information based on the transmit power of the first channel. There is no absolute order in which the first communication device executes the schemes of Figures 9 and 10. For example, the scheme of Figure 8 can be executed first and then the scheme of Figure 10, or the scheme of Figure 10 can be executed first and then the scheme of Figure 9. For another example, the second communication device can execute the scheme (such as steps 901 and 902) to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information.

[0489] For example, the embodiments provided in Figures 8, 9, and 10 may be performed in combination. For example, the first communication device may execute the scheme executed by the first device shown in Figure 8 (e.g., steps 801 and 802) to determine the size of the first information, and execute the scheme executed by the first device shown in Figure 9 (e.g., steps 901 and 902) to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information, and execute the scheme executed by the first device shown in Figure 10 (e.g., steps 1001 and 1002) to determine the transmit power of the first channel, and send the first information based on the size of the first information and the transmit power of the first channel. For another example, the second communication device may execute the scheme executed by the first device shown in FIG8 (e.g., steps 801 and 802) to determine the size of the first information, and execute the scheme executed by the first device shown in FIG9 (e.g., steps 901 and 902) to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information, and obtain the first information from the received signal based on the size of the first information. There is no absolute order in which the first communication device executes the schemes of FIG8, FIG9, and FIG10. For another example, the second communication device may execute the scheme executed by the first device shown in FIG8 (e.g., steps 801 and 802) to determine the size of the first information, and execute the scheme executed by the first device shown in FIG9 (e.g., steps 901 and 902) to determine the number of coded modulation symbols of the second information, and then perform rate matching on the second information based on the number of coded modulation symbols of the second information, and obtain the first information from the received signal based on the size of the first information.

[0490] Figures 11 and 12 are schematic diagrams of the structures of possible communication devices provided by the embodiments of the present application. These communication devices can be used to implement the function of the first device in the above-mentioned method embodiment, and therefore can also achieve the beneficial effects possessed by the above-mentioned method embodiment. In the embodiments of the present application, the communication device can be the terminal device shown in Figure 6A above, the chip (system) inside the terminal device, the network device or the chip (system) inside the network device, and the communication device can also be the terminal device shown in Figure 6B above, the chip (system) inside the terminal device, the ground station, the chip (system) inside the ground station, the satellite or the chip (system) inside the satellite.

[0491] As shown in Figure 11, communication device 1300 includes a processing unit 1310 and a transceiver unit 1320. Communication device 1300 is used to implement the functions of the first device in the method embodiments shown in Figures 7, 8, 9, or 10. Transceiver unit 1320 may also be referred to as a communication unit. Transceiver unit 1320 may include a transmitting unit and a receiving unit.

[0492] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 7, in one possible implementation, the processing unit 1310 is used to: obtain a processing method for the first information, and determine the transmission parameter according to the processing method for the first information.

[0493] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in FIG8 , in one possible implementation, the processing unit 1310 is used to: obtain a processing method for the first information, and determine a size of the first information according to the first parameter.

[0494] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 8, in one possible implementation, the processing unit 1310 is used to: determine the number of resources of the first channel carrying the first information based on the first parameter, and determine the size of the first information based on the number of resources of the first channel.

[0495] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 8, in one possible implementation, the processing unit 1310 is used to: determine the number of resources allocated to the first channel on a resource unit based on the first parameter, and determine the number of resources of the first channel based on the number of resources allocated to the first channel on a resource unit.

[0496] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 8, in one possible implementation, the processing unit 1310 is used to: determine the number of resources of the first channel based on the first parameter and the number of time domain units occupied by the first data in the first channel.

[0497] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 9, in one possible implementation, the processing unit 1310 is used to: obtain a processing method for the first information, and determine the number of coded modulation symbols for the second information according to the first parameter.

[0498] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 9, in one possible implementation, the processing unit 1310 is used to: determine the number of resources used to transmit the second information in the first channel based on the first parameter, and determine the number of coded modulation symbols for the second information based on the number of resources used to transmit the second information in the first channel.

[0499] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 9, in one possible implementation, the processing unit 1310 is used to: perform rate matching on the first channel carrying the second information according to the number of coded modulation symbols of the second information.

[0500] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 10, in one possible implementation, the processing unit 1310 is used to: obtain a processing method for the first information, and determine the transmission power of the first channel used to carry the first information based on the second parameter.

[0501] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 10, in one possible implementation, the processing unit 1310 is used to: determine the number of resources of the first channel, and determine the transmission power of the first channel based on the second parameter and the number of resources of the first channel.

[0502] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 10, in one possible implementation, the processing unit 1310 is used to: determine the number of bits per resource element based on the second parameter and the number of resources of the first channel, and determine the transmission power of the first channel based on the number of bits per resource element.

[0503] When the communication device 1300 is used to implement the function of the first device in the method embodiment shown in Figure 10, in one possible implementation, the processing unit 1310 is used to: determine a power offset value based on the number of bits per resource element, and determine the transmission power of the first channel based on the power offset value.

[0504] For a more detailed description of the processing unit 1310 and the transceiver unit 1320 , please refer to the relevant description in the method embodiments shown in FIG. 7 , FIG. 8 , FIG. 9 or FIG. 10 .

[0505] As shown in Figure 12, the communication device 1400 includes a processor 1410 and an interface circuit 1420. The processor 1410 and the interface circuit 1420 are coupled to each other. It is understandable that the interface circuit 1420 can be a transceiver or an input-output interface. The transceiver includes a transmitter and a receiver. The transmitter can be used to send information, the receiver can be used to receive information, and other functions can be implemented by the processor. The input-output interface is used to input and / or output information. Output can be understood as sending, and input can be understood as receiving. Other functions can be implemented by the processor. Optionally, the communication device 1400 may also include a memory 1430 for storing instructions executed by the processor 1410 or storing input data required by the processor 1410 to execute instructions or storing data generated after the processor 1410 executes instructions.

[0506] When the communication device 1400 is used to implement the method shown in Figure 7, Figure 8, Figure 9 or Figure 10, the processor 1410 is used to implement the functions of the above-mentioned processing unit 1310, and the interface circuit 1420 is used to implement the functions of the above-mentioned transceiver unit 1320.

[0507] When the above-mentioned communication device is a chip applied to a terminal, the terminal chip implements the functions of the terminal device in the above-mentioned method embodiment. When the terminal chip receives information from the base station, it can be understood that the information is first received by other modules in the terminal (such as a radio frequency module or antenna) and then sent to the terminal chip by these modules. When the terminal chip sends information to the base station, it can be understood that the information is first sent to other modules in the terminal (such as a radio frequency module or antenna) and then sent to the base station by these modules.

[0508] When the above-mentioned communication device is a chip applied to a base station, the base station chip implements the functions of the network device in the above-mentioned method embodiment. When the base station chip receives information from the terminal, it can be understood that the information is first received by other modules in the base station (such as a radio frequency module or antenna) and then sent to the base station chip by these modules. When the base station chip sends information to the terminal, it can be understood that the information is sent to other modules in the base station (such as a radio frequency module or antenna) and then sent to the terminal by these modules.

[0509] In this application, when entity A sends information to entity B, it can be done directly from A to B or indirectly through another entity. Similarly, when entity B receives information from entity A, it can be done directly from entity B or indirectly through another entity. Entities A and B herein can be RAN nodes or terminals, or modules within a RAN node or terminal. The sending and receiving of information can be information exchange between a RAN node and a terminal, for example, between a base station and a terminal; the sending and receiving of information can also be information exchange between two RAN nodes, for example, between a CU and a DU; the sending and receiving of information can also be information exchange between different modules within a device, for example, between a terminal chip and other modules in the terminal, or between a base station chip and other modules within the base station.

[0510] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0511] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions that can be executed by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, mobile hard disks, compact disc read-only memory (CD-ROM) or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a base station or a terminal. The processor and the storage medium can also be present in a base station or a terminal as discrete components.

[0512] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. A computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, all or part of the processes or functions of the embodiments of the present application are performed. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media, such as floppy disks, hard disks, or magnetic tapes; optical media, such as digital video disks; or semiconductor media, such as solid-state drives. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0513] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0514] In this application, "at least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship; in the formula of this application, the character " / " indicates that the previous and next associated objects are in a "division" relationship. "Including at least one of A, B and C" can mean: including A; including B; including C; including A and B; including A and C; including B and C; including A, B and C.

[0515] It is understood that the various numbers involved in the embodiments of this application (such as the numerical numbers "first" and "second", and the letter numbers "A1, A2", "B1, B2", "C1, C2", etc.) are only for the convenience of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic.

Claims

1. A method for determining transmission parameters, characterized in that: The method comprises: Obtaining a processing method for the first information, the processing method comprising at least one of the following: expanding the first information by a factor of N1 in the time domain, where N1 is a positive integer; expanding the first information by a factor of N2 in the frequency domain, where N2 is a positive integer; and mapping the first information in the frequency domain with a comb tooth interval of N3, where N3 is a positive integer; The size of the first information is determined according to a first parameter, where the first parameter is associated with at least one of the N1, the N2, and the N3.

2. The method according to claim 1, wherein At least one of N1, N2, and N3 is an integer greater than 1.

3. The method according to claim 1 or 2, wherein: The first information includes second information and / or first data.

4. The method according to claim 3, wherein The first information is carried on a first channel, the second information is carried on the first channel, and the first channel may or may not carry the first data.

5. The method according to claim 3 or 4, wherein: The first channel includes: a physical uplink shared channel PUSCH, a physical downlink shared channel PDSCH or a physical sidelink shared channel PSSCH.

6. The method according to any one of claims 3 to 5, characterized in that The second information includes control information.

7. The method according to any one of claims 3 to 6, wherein: The second information may include: at least one of hybrid automatic repeat request-acknowledgement information HARQ-ACK, channel state information CSI-1, CSI-2 and configuration grant uplink control information CG-UCI.

8. The method according to any one of claims 1 to 7, wherein: The first parameter includes any one of N1, N2, and N3; or the first parameter includes the product of any multiple values of N1, N2, and N3.

9. The method according to any one of claims 1 to 8, wherein The determining the size of the first information according to the first parameter includes: determining, according to the first parameter, the number of resources of the first channel carrying the first information; The size of the first information is determined according to the amount of resources of the first channel.

10. The method according to claim 9, wherein The amount of resources used to transmit the first information includes: the amount of resources used to transmit the first information before processing.

11. The method according to claim 9 or 10, wherein: The determining, according to the first parameter, the number of resources of the first channel carrying the first information includes: determining, according to the first parameter, the quantity of resources allocated to the first channel on a resource unit; The number of resources of the first channel is determined according to the number of resources allocated to the first channel on the one resource unit.

12. The method according to claim 11, wherein The number of resources allocated to the first channel on the one resource unit satisfies the following formula: Wherein, the N′ RE1 represents the number of resources allocated to the first channel on the one resource unit, Indicates the number of resources on a resource unit. represents the number of time domain units of the first channel, the N0 represents the first parameter, the represents the number of reference signals in a resource unit, Parameters configured through signaling.

13. The method according to claim 11, wherein The number of resources of the first channel satisfies the following formula: N RE =min(M0, N′ RE1 ).n PRB Among them, the N RE represents the number of resources allocated to the first channel, M0 is an integer, and N′ RE1 represents the number of resources allocated to the first channel on a resource unit, wherein n PRB Indicates the number of resource units allocated to the first channel.

14. The method according to claim 11, wherein The number of resources of the first channel satisfies the following formula: N RE =min(M0, N′ RE2 ).n PRB / N0 Among them, the N RE represents the number of resources allocated to the first channel, M0 is a positive number, and N′ RE2 represents the number of resources allocated to the first channel on a resource unit, wherein n PRB represents the number of resource units allocated to the first channel, and the N0 represents the first parameter.

15. The method according to claim 11, wherein The number of resources allocated to the first channel on a resource unit satisfies the following formula: Wherein, the N′ RE2 represents the number of resources allocated to the first channel on a resource unit, Indicates the number of resources on a resource unit. represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of reference signals in a resource unit, Parameters configured through signaling.

16. The method according to claim 9 or 10, wherein: The method further comprises: The number of resources of the first channel is determined according to a first parameter and the number of time domain units occupied by first data in the first channel.

17. The method according to claim 16, wherein The number of resources of the first channel satisfies one of the following: N RE =N4.min(M0,N′ RE1 ).n PRB ; or, N RE =N4.min(M0,N′ RE2 ).n PRB / N0; Among them, the N RE represents the number of resources allocated to the first channel, the N4 represents the number of time domain units (eg, time slots) occupied by the first data in the first information, the M0 is an integer, and the N R ′ E1 represents the number of resources allocated to the first channel on a resource unit, wherein n PRB represents the number of resource units allocated to the first channel, the N R ′ E2 represents the number of resources allocated to the first channel on a resource unit, and the N0 represents the first parameter.

18. The method according to any one of claims 1 to 17, wherein: The method further comprises: The number of coded modulation symbols of the second information is determined according to the first parameter, where the first parameter is associated with at least one of the N1, the N2, and the N3.

19. The method according to any one of claims 1 to 18, wherein: The method comprises: The transmit power of the first channel used to carry the first information is determined according to a second parameter, where the second parameter is associated with at least one of the N1, the N2, and the N3.

20. The method according to any one of claims 1 to 19, wherein The method further comprises: The first information is received.

21. The method according to any one of claims 1 to 19, wherein: The method further comprises: The first information is sent.

22. A method for determining transmission parameters, characterized in that: The method comprises: Obtaining a processing method for the first information, the processing method comprising at least one of the following: expanding the first information by a factor of N1 in the time domain, where N1 is a positive integer; expanding the first information by a factor of N2 in the frequency domain, where N2 is a positive integer; and mapping the first information in the frequency domain with a comb tooth interval of N3, where N3 is a positive integer; The number of coded modulation symbols of the second information is determined according to a first parameter, where the first parameter is associated with at least one of the N1, the N2, and the N3.

23. The method according to claim 22, wherein The method further comprises: The first information is received.

24. The method according to any one of claims 22, wherein: The method further comprises: The first information is sent.

25. The method according to any one of claims 22 to 24, wherein: The first information includes second information and / or first data.

26. The method according to any one of claims 22 to 25, wherein: The determining the number of coded modulation symbols of the second information according to the first parameter includes: determining, according to the first parameter, a quantity of resources in the first channel for transmitting the second information; The number of coded modulation symbols for the second information is determined according to the number of resources in the first channel used to transmit the second information.

27. The method according to claim 26, wherein The amount of resources in the first channel used to transmit the second information is determined by the result of the following formula: Wherein, the N0 represents the first parameter, the represents the number of time domain units of the first channel, represents the amount of resources used to transmit the second information in the time domain unit 1 in the first channel; Indicates the number of resources on the first channel that can be used to carry the second information.

28. The method of claim 26, wherein: The second information includes HARQ-ACK, the first channel carrying the second information carries data, and the number of coded modulation symbols of the HARQ-ACK satisfies the following formula: Wherein, the Q′ ACK represents the number of coded modulation symbols of the HARQ-ACK, the O ACK Indicates the number of HARQ-ACK bits, the L ACK represents the number of bits of the cyclic redundancy check of the HARQ-ACK, represents the adjustment factor, represents the number of time domain units of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, and ∑·is the summation operation.

29. The method of claim 26, wherein: The second information includes HARQ-ACK, the first channel carrying the second information carries data, the data on the first channel is transmitted using a multi-slot transport block TBoMS technology, and the number of coded modulation symbols of the HARQ-ACK satisfies the following formula: Wherein, the Q′ ACK represents the number of coded modulation symbols of the HARQ-ACK, the O ACK Indicates the number of HARQ-ACK bits, the L ACK represents the number of bits of the cyclic redundancy check of the HARQ-ACK, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time domain units (eg, time slots) occupied by the first data in the first information.

30. The method of claim 26, wherein: The second information includes the HARQ-ACK. When the first channel carrying the second information does not carry data, the number of coded modulation symbols of the HARQ-ACK satisfies the following formula: Wherein, the Q′ ACK represents the number of coded modulation symbols of the HARQ-ACK, the O ACK Indicates the number of HARQ-ACK bits, the L ACK represents the number of bits of the cyclic redundancy check of the HARQ-ACK, represents the adjustment factor, the R represents the code rate of the first channel, and the Q m represents the modulation order of the first channel, represents the number of time domain units of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, and ∑·is the summation operation.

31. The method of claim 26, wherein: The second information includes HARQ-ACK and CG-UCI, and the number of coded modulation symbols of the HARQ-ACK satisfies the following formula: Wherein, the Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, wherein CG-UCI Indicates the number of CG-UCI bits, the O ACK Indicates the number of HARQ-ACK bits, the L ACK Indicates the number of bits of the cyclic redundancy check of HARQ-ACK, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time domain units occupied by the first data.

32. The method of claim 26, wherein: The second information includes CG-UCI. When the first channel carrying the second information carries data, the number of coded modulation symbols of the CG-UCI satisfies the following formula: Wherein, the Q′ CG-UCI represents the number of coded modulation symbols of the CG-UCI, the O CG-UCI Indicates the number of CG-UCI bits, the L CG-UCI Indicates the number of bits of the cyclic redundancy check of the CG-UCI, represents the adjustment factor, represents the number of time domain units of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time slots occupied by the first data.

33. The method of claim 26, wherein: The second information includes CSI-1, and the number of coded modulation symbols of the CSI-1 satisfies the following formula: Wherein, the Q′ CSI-1 represents the number of coded modulation symbols of CSI-1, wherein CSI-1 Indicates the number of CSI-1 bits, the L CSI-1 Indicates the number of bits of the cyclic redundancy check of CSI-1, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, N0 represents the first parameter, α represents the adjustment coefficient, min{·} represents the minimum value operation, is rounded up, ∑·is a summation operation, the N4 represents the number of time domain units (e.g., time slots) occupied by the first data, and the Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI.

34. The method of claim 26, wherein: The second information includes CSI-1, and the number of coded modulation symbols of the CSI-1 satisfies the following formula: Wherein, the Q′ CSI-1 represents the number of coded modulation symbols of the CSI-1, the O CSI-1 Indicates the number of CSI-1 bits, the L CSI-1 Indicates the number of bits of the cyclic redundancy check of the CSI-1, represents the adjustment factor, represents the number of time domain units of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, the N0 represents the first parameter, the α represents the adjustment coefficient, the Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI, min{·} represents the minimum value operation, is rounded up, and ∑·is the summation operation.

35. The method of claim 26, wherein: When the second information includes CSI-1 and CSI-2, the number of coded modulation symbols of CSI-1 satisfies the following formula: Wherein, the Q′ CSI-1 represents the number of coded modulation symbols of the CSI-1, the O CSI-1 Indicates the number of CSI-1 bits, the L CSI-1 Indicates the number of bits of the cyclic redundancy check of the CSI-1, represents the adjustment factor, the R represents the code rate of the first channel, and the Q m represents the modulation order of the first channel, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, the N0 represents the first parameter, the α represents the adjustment coefficient, and the Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, min{·} is the minimum value operation, is rounded up, and ∑·is the summation operation.

36. The method of claim 26, wherein: The second information includes CSI-1. When the first channel carrying the second information does not carry CSI-2, the number of coded modulation symbols of the CSI-1 satisfies the following formula: Wherein, the Q′ CSI-1 Indicates the number of coded modulation symbols of the CSI-1, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, the N0 represents the first parameter, the α represents the adjustment coefficient, and the Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, min{·} is the minimum value operation, is rounded up, and ∑·is the summation operation.

37. The method of claim 26, wherein: The second information includes CSI-2, and the number of coded modulation symbols of the CSI-2 satisfies the following formula: Wherein, the Q′ CSI-2 represents the number of coded modulation symbols of the CSI-2, the O CSI-2 Indicates the number of CSI-2 bits, the L CSI-2 Indicates the number of bits of the cyclic redundancy check of the CSI-2, represents the adjustment factor, represents the number of time domain units (eg, time domain symbols) of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, the N0 represents the first parameter, α represents the adjustment coefficient, and Q′ CSI-1 represents the number of coded modulation symbols of the CSI-1, min{·} is the minimum value operation, is rounded up, ∑·is a summation operation, the N4 represents the number of time domain units (eg, time slots) occupied by the first data, and the Q′ACK / CG-UCI represents the number of coded modulation symbols of the HARQ-ACK and / or the number of coded modulation symbols of the CG-UCI.

38. The method of claim 26, wherein: The second information includes CSI-2, and the number of coded modulation symbols of the CSI-2 satisfies the following formula: Wherein, the Q′ CSI-2 represents the number of coded modulation symbols of the CSI-2, the O CSI-2 Indicates the number of CSI-2 bits, the L CSI-2 Indicates the number of bits of the cyclic redundancy check of the CSI-2, represents the adjustment factor, represents the number of time domain units of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel, the N0 represents the first parameter, the α represents the adjustment coefficient, the Q′ACK / CG-UCI represents the number of coded modulation symbols of HARQ-ACK and / or the number of coded modulation symbols of CG-UCI, the Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, min{·} is the minimum value operation, is rounded up, ∑·is a summation operation, and N4 represents the number of time domain units (eg, time slots) occupied by the first data.

39. The method of claim 26, wherein: The second information includes CSI-2. When the first channel carrying the second information does not carry data, the number of coded modulation symbols of the CSI-2 satisfies the following formula: Wherein, the Q′ CSI-2 Indicates the number of coded modulation symbols of the CSI-2, represents the number of time domain units of the first channel, represents the number of resources used to transmit the second information in the time domain unit 1 in the first channel, the N0 represents the first parameter, and the Q′ ACK represents the number of coded modulation symbols of HARQ-ACK, the Q′ CSI-1 Indicates the number of coded modulation symbols of CSI-1, min{·} is the minimum value operation, is rounded up, and ∑·is the summation operation.

40. A method for determining transmission power, characterized in that: The method comprises: Obtaining a processing method for the first information, the processing method comprising at least one of the following: expanding the first information by a factor of N1 in the time domain, where N1 is a positive integer; expanding the first information by a factor of N2 in the frequency domain, where N2 is a positive integer; and mapping the first information in the frequency domain with a comb tooth interval of N3, where N3 is a positive integer; The transmit power of the first channel used to carry the first information is determined according to a second parameter, where the second parameter is associated with at least one of the N1, the N2, and the N3.

41. The method of claim 40, wherein: The method further comprises: The first information is sent.

42. The method of claim 40, wherein: The method further comprises: The first information is received.

43. The method according to any one of claims 40 to 42, wherein The second parameters include N1, N2 and Any one of, or, the second parameter includes N1, N2 and The product of any number of values in .

44. The method according to any one of claims 40 to 43, wherein The method further comprises: determining a quantity of resources of the first channel; The transmit power of the first channel is determined according to the second parameter and the quantity of resources of the first channel.

45. The method according to any one of claims 40 to 43, wherein The method comprises: determining the number of bits per resource element according to the second parameter and the number of resources of the first channel; The transmit power of the first channel is determined according to the number of bits per resource element (BPRE).

46. The method of claim 45, wherein The BPRE satisfies the following formula: or, Wherein, the BPRE represents the number of bits per resource element, the N5 represents the second parameter, and the N RE represents the number of resources of the first channel, N4 represents the number of time domain units occupied by the first data on the first channel, C represents the number of code blocks in the first channel, and K r represents the size of the rth code block in the first channel.

47. The method according to any one of claims 40 to 43, wherein The method comprises: Determining a power offset value based on the number of bits per resource element; Determine the transmit power of the first channel according to the power offset value.

48. A communication device, characterized in that Comprising means for performing the method as claimed in any one of claims 1 to 47.

49. A communication device, characterized in that The device comprises a processor, wherein the processor implements the method according to any one of claims 1 to 47 through logic circuits or executing computer programs or instructions.

50. A computer-readable storage medium, characterized in that The storage medium stores a computer program or instruction, and when the computer program or instruction is executed by the communication device, the method according to any one of claims 1 to 47 is implemented.

51. A computer program product, characterized in that The computer program product stores a computer program, which includes program instructions. When the program instructions are executed by a computer, the computer is caused to perform the method according to any one of claims 1 to 47.

52. A chip or a chip system, characterized in that: The chip or chip system includes at least one processor and one or more interface circuits, the interface circuit and the at least one processor are interconnected via lines, and the processor executes the method described in any one of claims 1 to 47 by running instructions.

Images