A method and apparatus in a node for wireless communication

Abstract

The application discloses a method and device in a node for wireless communication. The node receives a first information block, which is used to determine a first factor; the node sends a target PUCCH, which carries at least a first bit sub-block; the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block; the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine a first RB number value; the resources occupied by the target PUCCH belong to target resources, and the number of RBs included in the target resources in the frequency domain is equal to a second RB number value; the size relationship between the first RB number value and the second RB number value is used together with the first factor to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH. The application improves the resource utilization rate when HARQ multiplexing.

Description

Technical Field

[0001] This application relates to transmission methods and apparatus in wireless communication systems, and more particularly to transmission schemes and apparatus for information with different priority levels in wireless communication. Background Technology

[0002] The application scenarios of future wireless communication systems are becoming increasingly diversified, and different application scenarios place different performance requirements on the system. To meet the diverse performance needs of various application scenarios, the 3GPP (3rd Generation Partner Project) RAN (Radio Access Network) #72 plenary meeting decided to conduct research on New Radio (NR) (or 5G). The 3GPP RAN #75 plenary meeting approved the WI (Work Item) for NR, initiating standardization work for NR. The 3GPP RAN #86 plenary meeting decided to begin work on the SI (Study Item) and WI (Work Item) for NR Rel-17.

[0003] In new air interface technologies, enhanced mobile broadband (eMBB), ultra-reliable and low-latency communications (URLLC), and massive machine-type communications (mMTC) are three main application scenarios. Summary of the Invention

[0004] In URLLC communication, data or control information with different priority levels can be transmitted. In NR Rel-16, when UCIs (Uplink Control Information) with different priority levels collide in the time domain, the lower-priority UCI is abandoned to ensure the transmission of the higher-priority UCI. In NR Rel-17, multiplexing UCIs with different priority levels onto the same PUCCH or the same PUSCH is supported.

[0005] This application discloses a solution to the problem of UCI multiplexing associated with different priority levels. It should be noted that URLLC is only used as a typical application scenario or example in the description of this application; this application is also applicable to other scenarios facing similar problems (such as scenarios with multiple services coexisting, or other scenarios with multiplexing of information with different priority levels, or scenarios with multiplexing of services with different QoS requirements, or for different application scenarios, such as vehicle-to-everything (V2X) and eMBB multiplexing), and can achieve similar technical effects. Furthermore, adopting a unified solution for different scenarios (including but not limited to URLLC scenarios) also helps reduce hardware complexity and cost. Where there is no conflict, the embodiments and features in the first node device of this application can be applied to the second node device, and vice versa. In particular, the interpretation of terms, nouns, functions, and variables in this application (unless otherwise specified) can be found in the definitions in the 3GPP specification protocols TS36, TS38, and TS37 series.

[0006] This application discloses a method for a first node in wireless communication, characterized by comprising:

[0007] Receive a first information block, which is used to determine a first factor;

[0008] Send a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit;

[0009] The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, and the first bit sub-block and the second bit sub-block are different; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, and the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value; the resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0010] As an example, the number of bits in the second bit sub-block carried by the target PUCCH is determined by the relationship between the first RB quantity value and the second RB quantity value together with the first factor. This supports determining the number of low-priority HARQ-ACK bits carried based on the maximum coding rate of low-priority HARQ-ACK bits or the scaling factor. Under the premise of satisfying the transmission performance of high-priority HARQ-ACK, low-priority HARQ-ACK bits are carried as much as possible, avoiding unnecessary discarding of low-priority HARQ-ACK bits, thereby improving PUCCH resource utilization and HARQ-ACK performance.

[0011] According to one aspect of this application, the method is characterized in that the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; when the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, are used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0012] As an example, the same maximum coding rate (e.g., the maximum coding rate of high priority) is used to determine the number of PRBs in the PUCCH for high and low priority HARQ-ACK bits. When the number of determined PRBs exceeds the number of configured PRBs, the coding rate or expansion factor of low priority HARQ-ACK bits is considered to finally determine whether to carry low priority HARQ-ACK bits and how many low priority HARQ-ACK bits to carry, thereby improving the multiplexing efficiency of high and low priority bits.

[0013] According to one aspect of this application, the above method is characterized by comprising:

[0014] Receive the first signaling;

[0015] The first signaling is used to determine the target resource from the target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

[0016] According to one aspect of this application, the method is characterized in that a first HARQ bit block is used to generate a second bit sub-block, the first HARQ bit block including at least one HARQ-ACK bit, a first bit quantity value equal to the number of bits included in the first HARQ bit block; a second bit quantity value equal to the number of bits included in the second bit sub-block, the second bit quantity value equal to one of X1 candidate quantity values, any one of the X1 candidate quantity values ​​being a non-negative integer, and X1 being a positive integer greater than 1; the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

[0017] As an example, the number of low-priority HARQ-ACK bits is rounded to a predefined or configured reference number, thereby avoiding the ambiguity of the number of low-priority HARQ-ACK bits and the resulting ambiguity in resource selection caused by the missed detection of DCI corresponding to low-priority HARQ-ACK, effectively protecting the robustness of high-priority HARQ-ACK bits.

[0018] According to one aspect of this application, the method is characterized in that when the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

[0019] According to one aspect of this application, the method is characterized in that the value of the priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the value of the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; and the value of the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

[0020] As an example, the PUCCH resources configured for high-priority HARQ-ACK are used to transmit PUCCHs that multiplex high- and low-priority HARQ-ACK bits, further ensuring the transmission performance of high-priority HARQ-ACK.

[0021] According to one aspect of this application, the method is characterized in that the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine a first sum; a first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, a first modulation order is equal to the modulation order of the target PUCCH, and a first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum.

[0022] This application discloses a method for a second node in wireless communication, characterized by comprising:

[0023] Send a first information block, which is used to indicate a first factor;

[0024] Receive a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit;

[0025] The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, and the first bit sub-block and the second bit sub-block are different; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, and the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value; the resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0026] According to one aspect of this application, the method is characterized in that the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; when the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, are used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0027] According to one aspect of this application, the above method is characterized by comprising:

[0028] Send the first signaling;

[0029] The first signaling is used to indicate the target resource from the target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

[0030] According to one aspect of this application, the method is characterized in that a first HARQ bit block is used to generate a second bit sub-block, the first HARQ bit block including at least one HARQ-ACK bit, a first bit quantity value equal to the number of bits included in the first HARQ bit block; a second bit quantity value equal to the number of bits included in the second bit sub-block, the second bit quantity value equal to one of X1 candidate quantity values, any one of the X1 candidate quantity values ​​being a non-negative integer, and X1 being a positive integer greater than 1; the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

[0031] According to one aspect of this application, the method is characterized in that when the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

[0032] According to one aspect of this application, the method is characterized in that the value of the priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the value of the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; and the value of the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

[0033] According to one aspect of this application, the method is characterized in that the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine a first sum; a first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, a first modulation order is equal to the modulation order of the target PUCCH, and a first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum.

[0034] This application discloses a first node device for wireless communication, characterized in that it includes:

[0035] A first receiver receives a first information block, which is used to determine a first factor.

[0036] A first transmitter transmits a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit;

[0037] The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, and the first bit sub-block and the second bit sub-block are different; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, and the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value; the resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0038] This application discloses a second node device for wireless communication, characterized in that it includes:

[0039] The second transmitter sends a first information block, which is used to indicate the first factor.

[0040] The second receiver receives a target PUCCH, which carries at least a first bit sub-block, the first bit sub-block including at least one bit;

[0041] The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, and the first bit sub-block and the second bit sub-block are different; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, and the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value; the resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0042] As an example, the method in this application has the following advantages:

[0043] The method in this application supports determining the number of low-priority HARQ-ACK bits to be carried based on the maximum coding rate or scaling factor of the low-priority HARQ-ACK bits. Under the premise of satisfying the transmission performance of high-priority HARQ-ACK, it carries as many low-priority HARQ-ACK bits as possible, avoids unnecessary discarding of low-priority HARQ-ACK bits, and improves PUCCH resource utilization and HARQ-ACK performance.

[0044] The method in this application uses the same maximum coding rate (e.g., the maximum coding rate of high priority) to determine the number of PRBs in the PUCCH for both high and low priority HARQ-ACK bits. When the number of determined PRBs exceeds the number of configured PRBs, the coding rate or expansion factor of low priority HARQ-ACK bits is considered to finally determine whether to carry low priority HARQ-ACK bits and how many low priority HARQ-ACK bits to carry, thereby improving the multiplexing efficiency of high and low priorities.

[0045] - The method in this application rounds the number of low-priority HARQ-ACK bits to a predefined or configured reference number, thereby avoiding the ambiguity in the number of low-priority HARQ-ACK bits and the resulting ambiguity in resource selection caused by the missed detection of DCI corresponding to low-priority HARQ-ACK bits, and effectively protecting the robustness of high-priority HARQ-ACK bits.

[0046] The method in this application uses PUCCH resources configured for high-priority HARQ-ACK to transmit PUCCH that multiplexes high- and low-priority HARQ-ACK bits, further ensuring the transmission performance of high-priority HARQ-ACK. Attached Figure Description

[0047] Other features, objects, and advantages of this application will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings:

[0048] Figure 1 A flowchart illustrating a first information block and a target PUCCH according to an embodiment of this application is shown;

[0049] Figure 2 A schematic diagram of a network architecture according to an embodiment of this application is shown;

[0050] Figure 3 A schematic diagram of a wireless protocol architecture for the user plane and control plane according to an embodiment of this application is shown;

[0051] Figure 4 A schematic diagram of a first node device and a second node device according to an embodiment of this application is shown;

[0052] Figure 5 A flowchart illustrating a wireless signal transmission process according to an embodiment of this application is shown;

[0053] Figure 6 A schematic diagram illustrating the relationship between the second RB quantity value and the third RB quantity value according to an embodiment of this application is shown;

[0054] Figure 7 A schematic diagram illustrating the relationship between a target resource and a set of target resources according to an embodiment of this application is shown;

[0055] Figure 8 A schematic diagram showing X1 alternative quantity values ​​according to an embodiment of this application is illustrated;

[0056] Figure 9 A schematic diagram illustrating the relationship between a first HARQ bit block and a second bit sub-block according to an embodiment of this application is shown;

[0057] Figure 10 A schematic diagram of a first-level index value and a second-level index value according to an embodiment of this application is shown;

[0058] Figure 11 A schematic diagram of the first RB quantity value according to an embodiment of this application is shown;

[0059] Figure 12 A structural block diagram of a processing apparatus in a first node device according to an embodiment of this application is shown;

[0060] Figure 13 A structural block diagram of a processing apparatus in a second node device according to an embodiment of this application is shown. Detailed Implementation

[0061] The technical solution of this application will be further described in detail below with reference to the accompanying drawings. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of this application can be arbitrarily combined with each other.

[0062] Example 1

[0063] Example 1 illustrates a flowchart 100 of a first information block and a target PUCCH according to an embodiment of this application, as shown in the attached diagram. Figure 1 As shown. In the appendix Figure 1 In the diagram, each box represents a step. It is particularly important to emphasize that the order of the boxes in the diagram is an example of the sequential order of the steps they represent, and does not restrict the temporal sequence of the steps.

[0064] In Embodiment 1, the first node device of this application receives a first information block in step 101, and the first information block is used to determine a first factor; in step 102, the first node device of this application sends a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; wherein, the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, the first bit sub-block and the second bit sub-block are not the same; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine a first RB quantity value; the resource occupied by the target PUCCH belongs to a target resource, the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the size relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0065] As one embodiment, the first information block is transmitted via an air interface or a wireless interface.

[0066] As one embodiment, the first information block includes all or part of a higher-layer signaling or physical-layer signaling.

[0067] As one embodiment, the first information block includes all or part of an RRC (Radio Resource Control) layer signaling or a MAC (Medium Access Control) layer signaling.

[0068] As an example, the first information block is carried via PDSCH (Physical Downlink Shared Channel).

[0069] As one embodiment, the first information block is either cell-specific or user equipment-specific.

[0070] As an example, the first information block is configured per BWP (Bandwidth Part).

[0071] As an example, the first information block includes all or part of the fields in a DCI (Downlink Control Information) format.

[0072] As one embodiment, the first information block includes more than one sub-information block, each of which is an IE (Information Element) or a field in the RRC signaling to which the first information block belongs; the one or more sub-information blocks included in the first information block are used to determine the first factor.

[0073] As one example, the first information block includes all or part of the fields in the IE (Information Element) "PUCCH-Config".

[0074] As one example, the first information block includes all or part of the fields in the IE (Information Element) "BWP-UplinkDedicated".

[0075] As one example, the first information block includes all or part of the fields in the IE (Information Element) "PUCCH-ConfigurationList".

[0076] As one embodiment, the first information block includes all or part of the fields in the first "PUCCH-Config" IE included in the IE (Information Element) "PUCCH-ConfigurationList".

[0077] As an example, the first information block includes all or part of the fields in the second "PUCCH-Config" IE included in the IE (Information Element) "PUCCH-ConfigurationList".

[0078] As an example, the first information block includes the "maxCodeRate" field in the "PUCCH-FormatConfig" field of the IE (Information Element) "PUCCH-Config".

[0079] As an example, the first information block includes the "maxCodeRate-r17" field in the "PUCCH-FormatConfig" field of the IE (Information Element) "PUCCH-Config".

[0080] As an example, the statement "the first information block is used to determine the first factor" in the claims includes the following meaning: the first information block is used by the first node device in this application to determine the first factor.

[0081] As an example, the statement "the first information block is used to determine the first factor" in the claim includes the following meaning: the first information block is used to explicitly or implicitly indicate the first factor.

[0082] As an example, the statement "the first information block is used to determine the first factor" in the claim includes the following meaning: the first information block explicitly or implicitly indicates a second coding rate value, which is used to calculate the first factor.

[0083] As an example, the statement in the claim "the first information block is used to determine the first factor" includes the following meaning: the first information block explicitly or implicitly indicates a second coding rate value, and the first factor is equal to the ratio between the first coding rate value and the second coding rate value in this application.

[0084] As an example, the statement in the claim "the first information block is used to determine the first factor" includes the following meaning: the first information block explicitly or implicitly indicates a second coding rate value, and the first factor is equal to the ratio between the second coding rate value and the first coding rate value in this application.

[0085] As an example, the statement in the claim "the first information block is used to determine the first factor" includes the following meaning: the first information block explicitly or implicitly indicates a second coding rate value, and the ratio between the first coding rate value and the second coding rate value in this application is used to determine the first factor.

[0086] As an example, the statement in the claim "the first information block is used to determine the first factor" includes the following meaning: the first information block explicitly or implicitly indicates a second coding rate value, and the ratio between the second coding rate value and the first coding rate value in this application is used to determine the first factor.

[0087] As an example, the first factor is equal to a configured maximum coding rate value.

[0088] As an example, the first factor is equal to a configured maximum coding rate value whose corresponding priority index value is "0".

[0089] As an example, the first factor is equal to the value configured in the "maxCodeRate" field of the second "PUCCH-Config" IE included in the IE (Information Element) "PUCCH-ConfigurationList".

[0090] As an example, the first factor is equal to the maximum coding rate value configured in the field other than the "maxCodeRate" field in the second "PUCCH-Config" IE included in the IE (Information Element) "PUCCH-ConfigurationList".

[0091] As an example, the first factor is equal to the value configured in the "maxCodeRate-r17" field of the second "PUCCH-Config" IE included in the IE (Information Element) "PUCCH-ConfigurationList".

[0092] As an example, the first factor is equal to the value configured in a "maxCodeRate" field.

[0093] As an example, the first factor is equal to the value of a maximum encoding rate configured in the "PUCCH-FormatConfig" field of the second "PUCCH-Config" IE included in the "PUCCH-ConfigurationList" of the IE (Information Element).

[0094] As an example, the first factor is equal to the value of a maximum encoding rate configured in the "PUCCH-FormatConfig" field of the first "PUCCH-Config" included in the IE (Information Element) "PUCCH-ConfigurationList".

[0095] As an example, the first factor is equal to the ratio between the maximum coding rate values ​​of the two configurations.

[0096] As an example, the ratio between the maximum coding rate values ​​of the two configurations is used to determine the first factor.

[0097] As an example, the first factor is equal to the ratio between the two maximum encoding rate values ​​configured in the same "PUCCH-Config" IE.

[0098] As an example, the ratio between two maximum encoding rate values ​​configured for the same "PUCCH-Config" IE is used to determine the first factor.

[0099] As an example, the first factor is greater than or equal to 0.

[0100] As an example, the first factor is less than or equal to 1.

[0101] As an example, the first factor is less than 1.

[0102] As an example, the first factor is greater than 1.

[0103] As an example, the first factor is equal to the ratio between a maximum coding rate value with a corresponding priority index value of "1" and a maximum coding rate value with a corresponding priority index value of "0".

[0104] As an example, the first factor is equal to the ratio between a maximum coding rate value with a corresponding priority index value of "0" and a maximum coding rate value with a corresponding priority index value of "1".

[0105] As an example, the first factor is equal to the ratio between the maximum coding rate value corresponding to the first priority level index value in this application and the maximum coding rate value corresponding to the second priority level index value in this application.

[0106] As an example, the first factor is equal to the ratio between the maximum coding rate value corresponding to the second priority level index value in this application and the maximum coding rate value corresponding to the first priority level index value in this application.

[0107] As an example, the first factor is equal to the ratio between the maximum encoding rate configured in the "PUCCH-FormatConfig" field of the first "PUCCH-Config" included in the IE "PUCCH-ConfigurationList" and the maximum encoding rate configured in the "PUCCH-FormatConfig" field of the second "PUCCH-Config" included in the IE "PUCCH-ConfigurationList".

[0108] As an example, the first factor is equal to the ratio between the maximum encoding rate configured in the "PUCCH-FormatConfig" field of the second "PUCCH-Config" included in the IE "PUCCH-ConfigurationList" and the maximum encoding rate configured in the "PUCCH-FormatConfig" field of the first "PUCCH-Config" included in the IE "PUCCH-ConfigurationList".

[0109] As an example, the first factor is equal to the ratio between the values ​​of the two maximum encoding rates configured by the second "PUCCH-Config" IE included in the IE "PUCCH-ConfigurationList".

[0110] As an example, the target PUCCH includes the radio frequency signal of PUCCH (Physical Uplink Control Channel) or the baseband signal of PUCCH.

[0111] As an example, the target PUCCH carries UCI (Uplink Control Information).

[0112] As an example, a UCI payload in a UCI format is used to generate the target PUCCH.

[0113] As an example, the target PUCCH adopts PUCCH format 2.

[0114] As an example, the target PUCCH uses PUCCH format 3 or 4.

[0115] As an example, the target PUCCH occupies only one PRB (Physical Resource Block) in the frequency domain within an OFDM symbol.

[0116] As an example, the target PUCCH occupies more than one PRB (Physical Resource Block) in the frequency domain within an OFDM symbol.

[0117] As an example, the first bit sub-block includes information bits and CRC bits.

[0118] As an example, the first bit sub-block includes only information bits.

[0119] As an example, the first bit sub-block consists of only 1 bit.

[0120] As one example, the first bit sub-block includes more than one bit.

[0121] As one embodiment, the first bit sub-block includes bits other than the HARQ-ACK bits.

[0122] As an example, any one bit included in the first bit sub-block is a HARQ-ACK bit.

[0123] As an example, the first bit sub-block includes only HARQ-ACK bits and CRC bits.

[0124] As an example, the first bit sub-block is a UCI payload.

[0125] As an example, the first bit sub-block includes CSI (Channel Status Information) bits.

[0126] As an example, any one of the bits included in the first bit sub-block is a coded bit.

[0127] As an example, any one bit included in the first bit sub-block is an unencoded bit.

[0128] As an example, the first bit sub-block is obtained by compressing, bundling, dropping, padding, shortening, or extending HARQ-ACK bits.

[0129] As an example, the first bit sub-block is obtained by compressing, bundling, dropping, padding, shortening, or extending the HARQ-ACK codebook.

[0130] As an example, the first bit sub-block is obtained by changing or processing the HARQ-ACK bits.

[0131] As an example, the first bit sub-block is obtained by changing or processing the HARQ-ACK bits, and any bit included in the first bit sub-block is a bit that has not been channel-coded.

[0132] As an example, the statement "the target PUCCH carries at least a first bit sub-block" in the claim includes the following meaning: the target PUCCH is at least used for the transmission of the first bit sub-block.

[0133] As an example, the statement in the claim that "the target PUCCH carries at least a first bit sub-block" includes the following meaning: the payload of the target PUCCH includes at least the bits in the first bit sub-block.

[0134] As an example, the statement "the target PUCCH carries at least a first bit sub-block" in the claim includes the following meaning: the payload of the UCI format adopted by the target PUCCH includes at least the first bit sub-block.

[0135] As an example, the statement in the claim "the target PUCCH carries at least a first bit sub-block" includes the following meaning: at least the first bit sub-block is used to generate the target PUCCH.

[0136] As an example, the statement in the claim "the target PUCCH carries at least a first bit sub-block" includes the following meaning: the first bit sub-block is transmitted in the target PUCCH.

[0137] As an example, the statement in the claim that "the target PUCCH carries at least a first bit sub-block" includes the following meaning: the target PUCCH may also carry bits other than the first bit sub-block.

[0138] As an example, the second bit sub-block includes information bits and CRC bits.

[0139] As one embodiment, the second bit sub-block includes only information bits.

[0140] As an example, the second bit sub-block consists of only 1 bit.

[0141] As one example, the second bit sub-block includes more than one bit.

[0142] As one embodiment, the second bit sub-block includes bits other than the HARQ-ACK bits.

[0143] As an example, the second bit sub-block is the UCI payload.

[0144] As an example, the second bit sub-block is a HARQ-ACK codebook.

[0145] As an example, the second bit sub-block is a type-1 HARQ-ACK codebook.

[0146] As an example, the second bit sub-block is a type-2 HARQ-ACK codebook.

[0147] As an example, the second bit sub-block is a referenced HARQ-ACK bit sub-block.

[0148] As an example, the second bit sub-block is a referenced HARQ-ACK codebook.

[0149] As one embodiment, the second bit sub-block includes padding bits and HARQ bits.

[0150] As an example, any one of the bits included in the second bit sub-block is a HARQ-ACK bit.

[0151] As an example, the second bit sub-block includes CSI (Channel Status Information) bits.

[0152] As an example, any one of the bits included in the second bit sub-block is a coded bit.

[0153] As an example, any one bit included in the second bit sub-block is an unencoded bit.

[0154] As an example, any bit included in the second bit sub-block is a bit encoded using the HARQ-ACK codebook.

[0155] As an example, any bit included in the second bit sub-block is a bit encoded by HARQ-ACK bits.

[0156] As an example, the priority index associated with the first bit sub-block is equal to "1", and the priority index associated with the second bit sub-block is equal to "0".

[0157] As an example, the priority index associated with the first bit sub-block is greater than the priority index associated with the second bit sub-block.

[0158] As an example, the first bit sub-block has a higher priority than the second bit sub-block.

[0159] As an example, the second bit sub-block is obtained by compressing, bundling, dropping, padding, shortening, or extending the HARQ-ACK bits.

[0160] As an example, the second bit sub-block is obtained by compressing, bundling, dropping, padding, shortening, or extending the HARQ-ACK codebook.

[0161] As an example, the second bit sub-block is obtained by changing or processing the HARQ-ACK bits.

[0162] As an example, the second bit sub-block is obtained by changing or processing the HARQ-ACK bits, and any bit included in the second bit sub-block is a bit that has not been channel-coded.

[0163] As an example, the number of bits belonging to the second bit sub-block carried by the target PUCCH is equal to 0.

[0164] As an example, the number of bits belonging to the second bit sub-block carried by the target PUCCH is greater than 0.

[0165] As one example, the target PUCCH carries all or part of the bits in the second bit sub-block.

[0166] As an example, the target PUCCH does not carry any bit from the second bit sub-block.

[0167] As an example, the statement in the claim "the target PUCCH carries a non-negative integer number of bits belonging to the second bit sub-block" includes the following meanings: the target PUCCH carries all or part of the bits in the second bit sub-block, or the target PUCCH does not carry any bits in the second bit sub-block.

[0168] As an example, the statement in the claim that "the target PUCCH carries a non-negative integer number of bits belonging to the second bit sub-block" includes the following meanings: the target PUCCH carries all or part of the bits in the second bit sub-block, or the target PUCCH does not carry any bits in the second bit sub-block; when the target PUCCH carries all or part of the bits in the second bit sub-block, the payload of the target PUCCH includes at least one bit in the second bit sub-block.

[0169] As an example, the statement in the claim "the target PUCCH carries a non-negative integer number of bits belonging to the second bit sub-block" includes the following meanings: the target PUCCH carries all or part of the bits in the second bit sub-block, or the target PUCCH does not carry any bits in the second bit sub-block; when the target PUCCH carries all or part of the bits in the second bit sub-block, at least one bit in the second bit sub-block is used to generate the target PUCCH.

[0170] As an example, the statement in the claim that "the target PUCCH carries a non-negative integer number of bits belonging to the second bit sub-block" includes the following meanings: the target PUCCH carries all or part of the bits in the second bit sub-block, or the target PUCCH does not carry any bits in the second bit sub-block; when the target PUCCH carries all or part of the bits in the second bit sub-block, the second bit sub-block is transmitted in the target PUCCH.

[0171] As an example, the statement in the claim that "the target PUCCH carries a non-negative integer number of bits belonging to the second bit sub-block" includes the following meanings: the target PUCCH carries all or part of the bits in the second bit sub-block, or the target PUCCH does not carry any bits in the second bit sub-block; when the target PUCCH carries all or part of the bits in the second bit sub-block, any one bit included in the second bit sub-block is transmitted in the target PUCCH as an encoded bit.

[0172] As an example, the statement in the claim that "the target PUCCH carries a non-negative integer number of bits belonging to the second bit sub-block" includes the following meanings: the target PUCCH carries all or part of the bits in the second bit sub-block, or the target PUCCH does not carry any bits in the second bit sub-block; when the target PUCCH carries all or part of the bits in the second bit sub-block, any one bit included in the second bit sub-block is transmitted in the target PUCCH as a bit before encoding.

[0173] As an example, the statement "the first bit sub-block and the second bit sub-block are not the same" in the claim includes the following meanings: the type of the first bit sub-block and the type of the second bit sub-block.

[0174] As an example, the statement "the first bit sub-block and the second bit sub-block are not the same" in the claim includes the following meaning: the first bit sub-block and the second bit sub-block are independent of each other.

[0175] As an example, the statement "the first bit sub-block and the second bit sub-block are not the same" in the claim includes the following meanings: any bit included in the first bit sub-block is a HARQ-ACK bit, and any bit included in the second bit sub-block is a bit after processing or transformation of the HARQ-ACK bit.

[0176] As an example, the statement "the first bit sub-block and the second bit sub-block are not the same" in the claims includes the following meaning: the first bit sub-block and the second bit sub-block are two independent HARQ-ACK codebooks.

[0177] As an example, the statement "the first bit sub-block and the second bit sub-block are not the same" in the claim includes the following meaning: the first bit sub-block and the second bit sub-block are respectively coded by two independent channels.

[0178] As one example, the bits associated with the second bit sub-block are the bits used to generate the second bit sub-block.

[0179] As one example, the bit associated with the second bit sub-block is the HARQ-ACK bit used to generate the second bit sub-block.

[0180] As one example, any bit associated with the second bit sub-block is a bit included in the HARQ-ACK codebook used to generate the second bit sub-block.

[0181] As an example, any bit associated with the second bit sub-block is the bit included in the second bit sub-block.

[0182] As an example, the bit block composed of the bits associated with the second bit sub-block is the second bit sub-block.

[0183] As one embodiment, "the bits associated with the second bit sub-block" and "the bits included in the second bit sub-block" are interchangeable.

[0184] As an example, "the bit associated with the second bit sub-block" and "the bit that generates the second bit sub-block" can be interchanged.

[0185] As an example, "the bits associated with the second bit sub-block" and "the bits included in the HARQ-ACK codebook that generated the second bit sub-block" can be interchanged.

[0186] As one embodiment, the number of bits associated with the second bit sub-block is equal to the number of bits included in the second bit sub-block.

[0187] As one embodiment, the number of bits associated with the second bit sub-block is not equal to the number of bits included in the second bit sub-block.

[0188] As one embodiment, the number of bits associated with the second bit sub-block is greater than the number of bits included in the second bit sub-block.

[0189] As one embodiment, the number of bits associated with the second bit sub-block is less than the number of bits included in the second bit sub-block.

[0190] As an example, the number of bits associated with the second bit sub-block is the same as the number of bits included in the second bit sub-block.

[0191] As an example, the number of bits associated with the second bit sub-block is equal to the number of bits included in the HARQ-ACK codebook used to generate the second bit sub-block.

[0192] As an example, the number of bits associated with the second bit sub-block refers to the number of bits included in the second bit sub-block.

[0193] As an example, the number of bits associated with the second bit sub-block refers to the number of bits included in the HARQ-ACK codebook used to generate the second bit sub-block.

[0194] As one embodiment, the number of bits associated with the second bit sub-block is equal to the number of bits included in the HARQ-ACK codebook used to generate the second bit sub-block.

[0195] As an example, the number of bits associated with the second bit sub-block refers to the number of bits included in the reference HARQ-ACK codebook used to generate the second bit sub-block.

[0196] As an example, the number of bits associated with the second bit sub-block refers to the number of bits included in the HARQ-ACK codebook, including padding bits, used to generate the second bit sub-block.

[0197] As an example, the first RB quantity value is a positive integer.

[0198] As an example, the first RB quantity value is used to represent the quantity of PRB (Physical Resource Block).

[0199] As an example, the first RB quantity value is used to represent the number of VRBs (Virtual Resource Blocks).

[0200] As an example, the first RB quantity value is used to represent the number of PRBs in a time-domain symbol.

[0201] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value" includes the following meaning: the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together by the first node device or the second node device in this application to determine the first RB quantity value.

[0202] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value" includes the following meaning: the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to calculate the first RB quantity value.

[0203] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value" is implemented by claim 7 of this application.

[0204] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value" includes the following meaning: the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is used to determine the first RB quantity value.

[0205] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value" includes the following meaning: for a given maximum coding rate value corresponding to the first bit sub-block, the first RB quantity value is linearly related to the number of bits included in the first bit sub-block, and the first RB quantity value is linearly related to the number of bits associated with the second bit sub-block.

[0206] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value" includes the following meaning: the first RB quantity value is equal to the minimum number of RBs that can carry the first bit sub-block and the second bit sub-block.

[0207] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value" includes the following meaning: the first RB quantity value is equal to the minimum number of RBs that can carry the first bit sub-block and the second bit sub-block, and the first bit sub-block and the second bit sub-block correspond to the same maximum coding rate.

[0208] As an example, the resources occupied by the target PUCCH include at least one of frequency domain resources, time domain resources, and code domain resources.

[0209] As an example, the resources occupied by the target PUCCH include at least one of frequency domain resources, time domain resources, and sequence resources.

[0210] As an example, the resources occupied by the target PUCCH include only time-frequency resources.

[0211] As an example, the target resource is a PUCCH resource.

[0212] As an example, the target resource is a configured PUCCH resource.

[0213] As an example, the target resource is a PUCCH resource configured in the first information block.

[0214] As an example, the target resource is the second "PUCCH-Config" resource configured by IE, which is included in IE's "PUCCH-ConfigurationList".

[0215] As an example, the target resource is the first "PUCCH-Config" resource configured by IE, which is included in IE's "PUCCH-ConfigurationList".

[0216] As an example, the target resources include only the resources occupied by the target PUCCH.

[0217] As an example, the target resources also include resources other than those occupied by the target PUCCH.

[0218] As an example, when the first RB quantity value is not less than the second RB quantity value, the target resource only includes the resources occupied by the target PUCCH; when the first RB quantity value is not less than the second RB quantity value, the target resource also includes resources other than those occupied by the target PUCCH.

[0219] As an example, a PRI (PUCCH resource Indicator) value is used to determine the target resource.

[0220] As an example, the second RB quantity value is a positive integer.

[0221] As an example, the second RB quantity value is equal to the number of PRBs included in the frequency domain within a time domain symbol of the target resource.

[0222] As an example, the second RB quantity value is equal to the number of VRBs included in the frequency domain within a time domain symbol of the target resource.

[0223] As an example, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meaning: the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used by the first node device in this application to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0224] As an example, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meaning: the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to calculate the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0225] As an example, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meaning: the target PUCCH carries all bits in the second bit sub-block, and the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits included in the second bit sub-block.

[0226] As an example, the statement in the claim that "the relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: when the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits in the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the first factor is used to determine the number of bits included in the second bit sub-block carried by the target PUCCH.

[0227] As an example, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" is implemented by claim 2 of this application.

[0228] As an example, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: when the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all bits in the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the first factor is used to determine whether the target PUCCH carries at least one bit in the second bit sub-block.

[0229] As an example, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the target PUCCH carries all bits in the second bit sub-block; when the first RB quantity value is not greater than the second RB quantity value, the second bit sub-block is a HARQ-ACK codebook; when the first RB quantity value is greater than the second RB quantity value, the first factor is used to determine the number of bits included in the second bit sub-block, and the second bit sub-block is generated by a HARQ-ACK codebook.

[0230] As an example, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the target PUCCH carries all bits in the second bit sub-block; when the first RB quantity value is not greater than the second RB quantity value, the second bit sub-block is a HARQ-ACK codebook with CRC bits attached; when the first RB quantity value is greater than the second RB quantity value, the first factor is used to determine the number of bits included in the second bit sub-block, and the second bit sub-block is generated by a HARQ-ACK codebook.

[0231] As an embodiment, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: when the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all bits in the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the first product value is equal to the product of the first factor and the number of bits included in the second bit sub-block, and the sum of the first product value and the number of bits included in the first bit sub-block is used to determine whether the target PUCCH carries at least one bit in the second bit sub-block.

[0232] As an embodiment, the statement in the claim that "the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the target PUCCH carries all bits in the second bit sub-block; when the first RB quantity value is not greater than the second RB quantity value, the second bit sub-block is a HARQ-ACK codebook (or a HARQ-ACK codebook with CRC bits attached); when the first RB quantity value is greater than the second RB quantity value, the first product value is equal to the product of the first factor and the number of bits associated with the second bit sub-block, and the sum of the first product value and the number of bits included in the first bit sub-block is used to determine the number of bits included in the second bit sub-block, which is generated by a HARQ-ACK codebook.

[0233] Example 2

[0234] Example 2 illustrates a schematic diagram of a network architecture according to this application, as shown in the attached diagram. Figure 2 As shown. (Attached) Figure 2This diagram illustrates the network architecture 200 of 5G NR, LTE (Long-Term Evolution), and LTE-A (Long-Term Evolution Advanced) systems. The 5G NR or LTE network architecture 200 may be referred to as 5GS (5G System) / EPS (Evolved Packet System) 200 or some other suitable term. 5GS / EPS 200 may include one or more UE (User Equipment) 201, NG-RAN (Next Generation Radio Access Network) 202, 5GC (5G Core Network) / EPC (Evolved Packet Core) 210, HSS (Home Subscriber Server) / UDM (Unified Data Management) 220, and Internet services 230. 5GS / EPS can interconnect with other access networks, but these entities / interfaces are not shown for simplicity. As shown in the figure, 5GS / EPS provides packet-switched services; however, those skilled in the art will readily understand that the various concepts presented throughout this application can be extended to networks providing circuit-switched services or other cellular networks. NG-RAN includes NR / Evolved Node B (gNB / eNB) 203 and other gNBs (eNBs) 204. gNBs (eNBs) 203 provide user and control plane protocol termination to UE 201. gNBs (eNBs) 203 can connect to other gNBs (eNBs) 204 via Xn / X2 interfaces (e.g., backhaul). gNBs (eNBs) 203 may also be referred to as a base station, base transceiver station, radio base station, radio transceiver, transceiver function, Basic Services Set (BSS), Extended Services Set (ESS), TRP (Transmitter Receiver Node), or some other suitable terminology. gNBs (eNBs) 203 provide UE 201 with an access point to the 5GC / EPC 210. Examples of UE201 include cellular phones, smartphones, Session Initiation Protocol (SIP) phones, laptops, personal digital assistants (PDAs), satellite radios, non-terrestrial base station communications, satellite mobile communications, global positioning systems, multimedia devices, video devices, digital audio players (e.g., MP3 players), cameras, game consoles, drones, aircraft, narrowband IoT devices, machine-type communication devices, land vehicles, automobiles, wearable devices, test equipment, test instruments, test tools, or any other similar functional devices.Those skilled in the art may also refer to UE201 as a mobile station, subscriber station, mobile unit, subscriber unit, radio unit, remote unit, mobile device, radio device, wireless communication device, remote device, mobile subscriber station, access terminal, mobile terminal, radio terminal, remote terminal, handheld device, user agent, mobile client, client, or any other suitable term. gNB (eNB)203 connects to 5GC / EPC210 via the S1 / NG interface. 5GC / EPC210 includes MME (Mobility Management Entity) / AMF (Authentication Management Field) / SMF (Session Management Function) 211, other MME / AMF / SMF 214, S-GW (Service Gateway) / UPF (User Plane Function) 212, and P-GW (Packet Data Network Gateway) / UPF 213. The MME / AMF / SMF211 is the control node that handles signaling between UE201 and 5GC / EPC210. ​​Essentially, the MME / AMF / SMF211 provides bearer and connection management. All user IP (Internet Protocol) packets are transmitted through the S-GW / UPF212, which is itself connected to the P-GW / UPF213. The P-GW provides UE IP address allocation and other functions. The P-GW / UPF213 connects to Internet service 230. Internet service 230 includes operator-compliant Internet Protocol services, specifically including the Internet, intranet, IMS (IP Multimedia Subsystem), and packet-switched streaming services.

[0235] As an example, the UE201 corresponds to the first node device in this application.

[0236] As an example, the UE201 supports multiplexed transmissions of UCIs associated with different priority levels.

[0237] As an example, the gNB(eNB)201 corresponds to the second node device in this application.

[0238] As an example, the gNB (eNB) 201 supports multiplexed transmissions associated with different priority levels of UCI.

[0239] Example 3

[0240] Example 3 illustrates a schematic diagram of an embodiment of a wireless protocol architecture for a user plane and a control plane according to this application, as shown in the attached diagram. Figure 3 As shown. Figure 3 This is a schematic diagram illustrating an embodiment of a radio protocol architecture for the user plane 350 and the control plane 300. Figure 3The radio protocol architecture for the control plane 300 between the first node device (UE or gNB) and the second node device (gNB or UE) is illustrated using three layers: Layer 1, Layer 2, and Layer 3. Layer 1 (L1 layer) is the lowest layer and implements various PHY (Physical Layer) signal processing functions. L1 layer will be referred to herein as PHY301. Layer 2 (L2 layer) 305 sits above PHY301 and is responsible for the link between the first and second node devices via PHY301. L2 layer 305 includes the MAC (Medium Access Control) sublayer 302, the RLC (Radio Link Control) sublayer 303, and the PDCP (Packet Data Convergence Protocol) sublayer 304, which terminate at the second node device. The PDCP sublayer 304 provides multiplexing between different radio bearers and logical channels. The PDCP sublayer 304 also provides security through encrypted data packets and supports cross-regional mobility between the second node devices and the first node device. RLC sublayer 303 provides upper-layer packet segmentation and reassembly, retransmission of lost packets, and packet reordering to compensate for out-of-order reception due to HARQ. MAC sublayer 302 provides multiplexing between the logical and transport channels. MAC sublayer 302 is also responsible for allocating various radio resources (e.g., resource blocks) within a cell among first-node devices. MAC sublayer 302 is also responsible for HARQ operations. The RRC (Radio Resource Control) sublayer 306 in Layer 3 (L3) of the control plane 300 is responsible for acquiring radio resources (i.e., radio bearers) and configuring the lower layer using RRC signaling between the second-node devices and the first-node devices. The radio protocol architecture of user plane 350 includes Layer 1 (L1 layer) and Layer 2 (L2 layer). The radio protocol architecture for the first and second node devices in user plane 350 is largely the same as the corresponding layers and sublayers in control plane 300 for Physical Layer 351, PDCP sublayer 354 in L2 layer 355, RLC sublayer 353 in L2 layer 355, and MAC sublayer 352 in L2 layer 355. However, PDCP sublayer 354 also provides header compression for upper layer packets to reduce radio transmission overhead. L2 layer 355 in user plane 350 also includes SDAP (Service Data Adaptation Protocol) sublayer 356. SDAP sublayer 356 is responsible for mapping between QoS flows and Data Radio Bearers (DRBs) to support service diversity.Although not illustrated, the first node device may have several upper layers above the L2 layer 355, including a network layer (e.g., IP layer) terminating at the P-GW on the network side and an application layer terminating at the other end of the connection (e.g., remote UE, server, etc.).

[0241] As an example, Appendix Figure 3 The wireless protocol architecture described herein is applicable to the first node device in this application.

[0242] As an example, Appendix Figure 3 The wireless protocol architecture described herein is applicable to the second node device in this application.

[0243] As an example, the first information block in this application is generated in RRC306, or MAC302, or MAC352, or PHY301, or PHY351.

[0244] As an example, the target PUCCH in this application is generated in RRC306, or MAC302, or MAC352, or PHY301, or PHY351.

[0245] As an example, the first signaling in this application is generated in the RRC306, or MAC302, or MAC352, or PHY301, or PHY351.

[0246] Example 4

[0247] Example 4 illustrates a schematic diagram of a first node device and a second node device according to an embodiment of this application, as shown in the attached diagram. Figure 4 As shown.

[0248] The first node device (450) may include a controller / processor 490, a data source / buffer 480, a receiver processor 452, a transmitter / receiver 456 and a transmitter processor 455, wherein the transmitter / receiver 456 includes an antenna 460.

[0249] The second node device (410) may include a controller / processor 440, a data source / buffer 430, a receiver processor 412, a transmitter / receiver 416 and a transmitter processor 415, wherein the transmitter / receiver 416 includes an antenna 420.

[0250] In the downlink (DL), upper-layer packets, such as the upper-layer information included in the first information block of this application and the upper-layer information included in the first signaling (when the first signaling includes upper-layer information), are provided to the controller / processor 440. The controller / processor 440 implements L2 and higher-layer functions. In the DL, the controller / processor 440 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation for the first node device 450 based on various priority metrics. The controller / processor 440 is also responsible for HARQ operations, retransmission of lost packets, and the generation of signaling to the first node device 450, such as the higher-layer information included in the first information block of this application and the higher-layer information included in the first signaling (when the first signaling includes higher-layer information), in the controller / processor 440. Transmit processor 415 implements various signal processing functions for the L1 layer (i.e., the physical layer), including encoding, interleaving, scrambling, modulation, power control / allocation, precoding, and physical layer control signaling generation. For example, the generation of the first signaling (when the first signaling only includes physical layer information) and the physical layer signal carrying the first information block is completed in transmit processor 415. The generated modulation symbols are divided into parallel streams and each stream is mapped to a corresponding multicarrier subcarrier and / or multicarrier symbol, and then transmitted by transmit processor 415 via transmitter 416 to antenna 420 in the form of radio frequency signals. At the receiving end, each receiver 456 receives the radio frequency signal through its corresponding antenna 460. Each receiver 456 recovers the baseband information modulated onto the radio frequency carrier and provides the baseband information to receiver processor 452. Receiver processor 452 implements various signal reception processing functions for the L1 layer. The signal reception and processing function includes receiving the physical layer signal carrying the first information block and the first signaling in this application; demodulating the multi-carrier symbols in the multi-carrier symbol stream based on various modulation schemes (e.g., Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK)); subsequently descrambling, decoding, and deinterleaving to recover the data or control transmitted by the second node device 410 on the physical channel; and then providing the data and control signals to the controller / processor 490. The controller / processor 490 is responsible for the L2 layer and above, and interprets the higher-layer information included in the first information block and the higher-layer information included in the first signaling (when the first signaling includes upper-layer information). The controller / processor may be associated with a memory 480 that stores program code and data. The memory 480 may be referred to as computer-readable media.

[0251] In uplink (UL) transmission, similar to downlink transmission, after higher-layer information is generated by controller / processor 490, it undergoes various signal transmission processing functions for L1 layer (i.e., physical layer) by transmitter processor 455. The target PUCCH in this application is generated by transmitter processor 455 and then mapped to antenna 460 by transmitter 455 as a radio frequency signal. Receiver 416 receives the radio frequency signal through its corresponding antenna 420. Each receiver 416 recovers the baseband information modulated onto the radio frequency carrier and provides the baseband information to receiver processor 412. Receiver processor 412 implements various signal reception processing functions for L1 layer (i.e., physical layer), including receiving and processing the physical layer signal of the target PUCCH in this application, and subsequently providing data and / or control signals to controller / processor 440. The L2 layer functions implemented in controller / processor 440 include interpreting higher-layer information. Controller / processor may be associated with buffer 430 storing program code and data. Buffer 430 may be a computer-readable medium.

[0252] As one embodiment, the first node device 450 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used with the at least one processor, and the first node device 450 at least: receives a first information block, the first information block being used to determine a first factor; transmits a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; wherein the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit. The first bit sub-block and the second bit sub-block are not the same; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, and the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value; the resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the size relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0253] As one embodiment, the first node device 450 includes: a memory storing a computer-readable instruction program that, when executed by at least one processor, produces actions including: receiving a first information block used to determine a first factor; transmitting a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; wherein the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, the first bit sub-block and the second bit sub-block being different; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block being greater than 2, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block being used together to determine a first RB quantity value; the resource occupied by the target PUCCH belongs to a target resource, the number of RBs included in the target resource in the frequency domain being equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, being used to determine the number of bits carried by the target PUCCH belonging to the second bit sub-block.

[0254] As one embodiment, the second node device 410 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code are configured to be used with the at least one processor. The second node device 410 includes at least: transmitting a first information block, the first information block being used to indicate a first factor; receiving a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; wherein the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, the first bit sub-block and the second bit sub-block being different; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block being used together to determine a first RB quantity value; the resource occupied by the target PUCCH belongs to a target resource, the number of RBs included in the target resource in the frequency domain being equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, being used to determine the number of bits carried by the target PUCCH belonging to the second bit sub-block.

[0255] As one embodiment, the second node device 410 includes: a memory storing a computer-readable instruction program that, when executed by at least one processor, produces actions including: transmitting a first information block used to indicate a first factor; receiving a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; wherein the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, the first bit sub-block and the second bit sub-block being different; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block being greater than 2, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block being used together to determine a first RB quantity value; the resource occupied by the target PUCCH belongs to a target resource, the number of RBs included in the target resource in the frequency domain being equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, being used to determine the number of bits carried by the target PUCCH belonging to the second bit sub-block.

[0256] As an example, the first node device 450 is a user equipment (UE).

[0257] As an example, the first node device 450 is a user equipment that supports information multiplexing transmission associated with different priority levels.

[0258] As one embodiment, the second node device 410 is a base station device (gNB / eNB).

[0259] As one embodiment, the second node device 410 is a base station device that supports information multiplexing transmission associated with different priority levels.

[0260] As one embodiment, receiver 456 (including antenna 460), receiver processor 452 and controller / processor 490 are used to receive the first information block in this application.

[0261] As one embodiment, transmitter 456 (including antenna 460) and transmitter processor 455 are used to transmit the target PUCCH described in this application.

[0262] As one embodiment, receiver 456 (including antenna 460) and receiver processor 452 are used to receive the first signaling in this application.

[0263] As one embodiment, receiver 456 (including antenna 460), receiver processor 452 and controller / processor 490 are used to receive the first signaling in this application.

[0264] As one embodiment, transmitter 416 (including antenna 420), transmitter processor 415 and controller / processor 440 are used to transmit the first information block in this application.

[0265] As one embodiment, receiver 416 (including antenna 420) and receiver processor 412 are used to receive the target PUCCH described in this application.

[0266] As one embodiment, transmitter 416 (including antenna 420) and transmitter processor 415 are used to transmit the first signaling in this application.

[0267] As one embodiment, transmitter 416 (including antenna 420), transmitter processor 415 and controller / processor 440 are used to transmit the first signaling in this application.

[0268] Example 5

[0269] Example 5 illustrates a wireless signal transmission flowchart according to an embodiment of this application, as shown in the attached diagram. Figure 5 As shown. In the appendix Figure 5 In this example, the second node device N500 is the base station maintaining the serving cell of the first node device U550. It should be noted that the order in this example does not limit the signal transmission order or the order of implementation in this application.

[0270] for Second node device N500 In step S501, the first information block is sent; in step S502, the first signaling is sent; and in step S503, the target PUCCH is received.

[0271] for First node device U550 In step S551, the first information block is received; in step S552, the first signaling is received; and in step S553, the target PUCCH is sent.

[0272] In embodiment 5, the first information block is used to determine the first factor; the target PUCCH carries at least a first bit sub-block, the first bit sub-block including at least one bit; wherein, the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, the first bit sub-block and the second bit sub-block are not the same; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, and the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value; the target PUCCH carries at least a first bit sub-block, the first bit sub-block including at least one bit, the second bit sub-block including at least one bit ... The resources occupied by the CCH belong to the target resources, and the number of RBs included in the target resources in the frequency domain is equal to the second RB count value; the relationship between the first RB count value and the second RB count value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH; the first signaling is used to determine the target resources from the target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

[0273] As one embodiment, the first signaling is transmitted via an air interface or a wireless interface.

[0274] As one embodiment, the first signaling includes all or part of a higher-layer signaling or physical-layer signaling.

[0275] As one embodiment, the first signaling includes all or part of an RRC (Radio Resource Control) layer signaling or a MAC (Medium Access Control) layer signaling.

[0276] As one embodiment, the first signaling is cell-specific or UE-specific.

[0277] As an example, the first signaling is configured per BWP (Bandwidth Part).

[0278] As one embodiment, the first signaling includes all or part of a DCI (Downlink Control Information) signaling field.

[0279] As an example, the first signaling includes a PRI in a DCI format.

[0280] As an example, the first signaling is carried via PDCCH.

[0281] As an example, the first signaling is carried by the latest PDCCH associated with the target PUCCH.

[0282] As an example, the statement in the claim "the first signaling is used to determine the target resource from the target resource set" includes the following meaning: the first signaling is used by the first node device in this application to determine the target resource from the target resource set.

[0283] As an example, the statement in the claim "the first signaling is used to determine the target resource from the target resource set" includes the following meaning: the first signaling is used to explicitly or implicitly indicate the target resource from the target resource set.

[0284] As an example, the statement in the claim "the first signaling is used to determine the target resource from the target resource set" includes the following meaning: the first signaling is used to explicitly or implicitly indicate the index or ID of the target resource in the target resource set.

[0285] As an example, the statement in the claim "the first signaling is used to determine the target resource from the target resource set" includes the following meaning: the PRI field carried by the first signaling and the index of the starting CCE (Control Channel Element) occupied by the PDCCH carrying the first signaling are used together to determine the index or ID of the target resource in the target resource set.

[0286] Example 6

[0287] Example 6 illustrates a schematic diagram of the relationship between the second RB quantity value and the third RB quantity value according to an embodiment of this application, as shown in the attached diagram. Figure 6 As shown. In the appendix Figure 6 In the diagram, the horizontal axis represents the frequency or the index direction of the PRB, each rectangle represents an RB, each rectangle filled with diagonal lines represents an RB carrying the first bit sub-block, and each rectangle filled with intersecting lines represents an RB carrying the second bit sub-block.

[0288] In Embodiment 6, the coding rate value corresponding to the first bit sub-block in this application and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; when the first RB quantity value in this application is not greater than the second RB quantity value in this application, the target PUCCH in this application carries all the bits belonging to the second bit sub-block in this application; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, are used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0289] As an example, the statement "the coding rate value corresponding to the first bit sub-block" in the claim includes: the coding rate value corresponding to the priority level index value of the first bit sub-block.

[0290] As an example, the statement "the coding rate value corresponding to the first bit sub-block" in the claim includes: the maximum coding rate value configured for rate matching of the first bit sub-block.

[0291] As an example, the statement "the encoding rate value corresponding to the first bit sub-block" in the claim includes: the maximum encoding rate value of a Rel-16 (version 16) configured by the second "PUCCH-Config" IE included in the IE "PUCCH-ConfigurationList" that configures the target resource.

[0292] As an example, the statement "the coding rate value corresponding to the first bit sub-block" in the claim includes: a maximum coding rate value of Rel-16 (version 16) configured by the "PUCCH-Config" IE that configures the resources of the PUCCH carrying the first bit sub-block.

[0293] As an example, the statement "the coding rate value corresponding to the first bit sub-block" in the claim includes: the first maximum coding rate value configured by the "PUCCH-Config" IE that configures the resources carrying the first bit sub-block.

[0294] As an example, the statement "the coding rate value corresponding to the first bit sub-block" in the claim includes: a maximum coding rate value other than a maximum coding rate value configured in Rel-17 (version 17) by the "PUCCH-Config" IE that configures the resources carrying the first bit sub-block PUCCH.

[0295] As an example, the coding rate value corresponding to the first bit sub-block is a configured maximum coding rate value.

[0296] As an example, the first information block is used to explicitly or implicitly indicate the coding rate value corresponding to the first bit sub-block.

[0297] As an example, signaling or IE or field outside the first information block is used to implicitly or explicitly indicate the coding rate value corresponding to the first bit sub-block.

[0298] As an example, the statement in the claim that "the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value" includes the following meaning: the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together by the first node device or the second node device in this application to determine the third RB quantity value.

[0299] As an example, the statement in the claim that "the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value" includes the following meaning: the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to directly or indirectly calculate the third RB quantity value.

[0300] As an example, the statement in the claim that "the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value" includes the following meaning: the third RB quantity value is equal to the minimum number of RBs required to satisfy the transmission of the first bit sub-block at the coding rate value corresponding to the first bit sub-block.

[0301] As an example, the statement in the claim that "the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value" includes the following meaning: the third RB quantity value is equal to the minimum number of RBs required to carry the first bit sub-block with the coding rate value corresponding to the first bit sub-block.

[0302] As an example, the statement in the claim that "the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value" includes the following meaning: the third RB quantity value is equal to the quantized value of the ratio between the number of bits included in the first bit sub-block and the coding rate value corresponding to the first bit sub-block.

[0303] As an example, the statement in the claim that "the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value" includes the following meaning: the third RB quantity value is equal to the floor value of the ratio between the number of bits included in the first bit sub-block and the number of bits in the first bit sub-block that each RB can carry, and the coding rate value corresponding to the first bit sub-block is used to determine the number of bits in the first bit sub-block that each RB can carry.

[0304] As an example, the statement in the claim that "the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value" includes the following meaning: the third RB quantity value is equal to the floor value of the ratio between the number of bits included in the first bit sub-block and the number of bits in the first bit sub-block that each RB can carry; the number of bits in the first bit sub-block that each RB can carry is equal to the product of the coding rate value corresponding to the first bit sub-block, the modulation order of the target PUCCH, and the number of resource units used for control information bits included in one RB of the target resource.

[0305] As an example, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meaning: the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used by the first node device or the second node device in this application to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0306] As an example, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meaning: the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to calculate the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0307] As an example, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meaning: the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine whether the target PUCCH carries at least one bit belonging to the second bit sub-block.

[0308] As an embodiment, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the first factor and the number of bits included in the second bit sub-block are used together to determine the fourth RB quantity value; when the fourth RB quantity value is greater than the difference between the second RB quantity value and the third RB quantity value, the target PUCCH does not carry any bit belonging to the second bit sub-block; when the fourth RB quantity value is not greater than the difference between the second RB quantity value and the third RB quantity value, the target PUCCH carries all bits belonging to the second bit sub-block.

[0309] As an embodiment, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the first factor and the number of bits included in the second bit sub-block are used together to determine the fourth RB quantity value; when the fourth RB quantity value is greater than the difference between the second RB quantity value and the third RB quantity value, the first factor is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH; when the fourth RB quantity value is not greater than the difference between the second RB quantity value and the third RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block.

[0310] As an embodiment, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the first factor and the number of bits included in the second bit sub-block are used together to determine the fourth RB quantity value; when the fourth RB quantity value is greater than the difference between the second RB quantity value and the third RB quantity value, the target PUCCH carries a portion of the bits belonging to the second bit sub-block; when the fourth RB quantity value is not greater than the difference between the second RB quantity value and the third RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block.

[0311] As an example, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meaning: the number of bits belonging to the second bit sub-block carried by the target PUCCH is equal to the maximum number of bits in the second bit sub-block that can be carried by the RB set whose first factor is equal to the second RB quantity value.

[0312] As an example, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the difference between the second RB quantity value and the third RB quantity value is equal to the fifth RB quantity value; the number of bits belonging to the second bit sub-block carried by the target PUCCH is equal to the maximum number of bits in the second bit sub-block that can be carried by the RB set whose quantity is equal to the fifth RB quantity value.

[0313] As an example, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the difference between the second RB quantity value and the third RB quantity value is equal to the fifth RB quantity value; for a given first factor, the number of bits belonging to the second bit sub-block carried by the target PUCCH and the fifth RB quantity value are linearly correlated, and the first factor is used to determine the linear correlation coefficient between the number of bits belonging to the second bit sub-block carried by the target PUCCH and the fifth RB quantity value.

[0314] As an embodiment, the statement in the claim that "the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH" includes the following meanings: the difference between the second RB quantity value and the third RB quantity value is equal to the fifth RB quantity value; the first factor is used to determine the coding rate value corresponding to the first bit sub-block; for a given coding rate value corresponding to the first bit sub-block, the number of bits belonging to the second bit sub-block carried by the target PUCCH is linearly correlated with the fifth RB quantity value, and the coding rate value corresponding to the first bit sub-block is used to determine the linear correlation coefficient between the number of bits belonging to the second bit sub-block carried by the target PUCCH and the fifth RB quantity value.

[0315] Example 7

[0316] Example 7 illustrates a schematic diagram of the relationship between a target resource and a set of target resources according to an embodiment of this application, as shown in the attached diagram. Figure 7 As shown. In the appendix Figure 7 In the diagram, each small square represents a PUCCH resource included in the target resource set, and the small squares filled with diagonal lines represent target resources.

[0317] In Embodiment 7, the first signaling in this application is used to determine the target resource in this application from the target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors are used to determine the target resource set: the number of bits included in the first bit sub-block in this application, the number of bits associated with the second bit sub-block in this application, and the first factor in this application.

[0318] As an example, the target resource set is a PUCCH resource set.

[0319] As an example, the target resource set corresponds to a range of UCI load bits.

[0320] As an example, the target resource set corresponds to a range of UCI load bits.

[0321] As an example, the range of the number of UCI load bits corresponding to the target resource set is configurable.

[0322] As an example, the range of the number of UCI load bits corresponding to the target resource set is configured by the first information block in this application.

[0323] As an example, the target resource set includes multiple PUCCH resources.

[0324] As an example, the PUCCH resources included in the target resource set are configured by the first information block in this application.

[0325] As an example, the statement in the claim that "at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meaning: at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used by the first node device in this application to determine the target resource set.

[0326] As an example, the statement in the claim that "at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meaning: only the first two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

[0327] As an example, the statement in the claim that "at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meaning: the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is used to determine the target resource set.

[0328] As an example, the statement in the claim that "at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meaning: the sum of the product between the number of bits associated with the second bit sub-block and the first factor and the number of bits included in the first bit sub-block is used to determine the target resource set.

[0329] As an example, the statement in the claim that "at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meaning: the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor are all used to determine the target resource set.

[0330] As an embodiment, the statement in the claim that "at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meanings: the target resource set is one of K1 resource sets, the K1 resource sets are signaling configured or predefined, and K1 is a positive integer greater than 1; at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set from the K1 resource sets according to a correspondence or mapping relationship.

[0331] As an embodiment, the statement in the claim that "at least two of the following three—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meanings: the target resource set is one of K1 resource sets, the K1 resource sets are configured by signaling or predefined, and K1 is a positive integer greater than 1; the K1 resource sets each correspond to K1 numerical intervals, the sum between the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block belongs to the target numerical interval, the target numerical interval is one of the K1 numerical intervals, and the target resource set is the resource set among the X1 resource sets that corresponds to the target numerical interval. As a supplementary embodiment of the above embodiment, the K1 numerical intervals are configurable. As a supplementary embodiment of the above embodiment, the K1 numerical intervals are predefined. As a supplementary embodiment of the above embodiment, the K1 numerical intervals are configured by one or more fields included in the first information block.

[0332] As an embodiment, the statement in the claim that "at least two of the following three—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set" includes the following meanings: the target resource set is one of K1 resource sets, the K1 resource sets are configured by signaling or predefined, and K1 is a positive integer greater than 1; the K1 resource sets each correspond to K1 numerical intervals, the sum of the product of the number of bits associated with the second bit sub-block and the first factor and the number of bits included in the first bit sub-block belongs to the target numerical interval, the target numerical interval is one of the K1 numerical intervals, and the target resource set is the resource set among the X1 resource sets corresponding to the target numerical interval. As a supplementary embodiment of the above embodiment, the K1 numerical intervals are configurable. As a supplementary embodiment of the above embodiment, the K1 numerical intervals are predefined. As a supplementary embodiment of the above embodiment, the K1 numerical intervals are configured by one or more fields included in the first information block.

[0333] Example 8

[0334] Example 8 illustrates a schematic diagram of X1 alternative quantity values ​​according to an embodiment of this application, as shown in the attached diagram. Figure 8 As shown. In the appendix Figure 8 In the diagram, the horizontal axis represents numerical values, each dashed line represents one of the X1 candidate quantity values, and the thick solid line represents the first bit quantity value.

[0335] In embodiment 8, a first HARQ bit block is used to generate the second bit sub-block in this application. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

[0336] As an example, the first HARQ bit block is a HARQ-ACK codebook or a part of a HARQ-ACK codebook.

[0337] As an example, the first HARQ bit block includes a HARQ-ACK codebook and attached CRC bits.

[0338] As an example, the first HARQ bit block is a HARQ-ACK sub-codebook.

[0339] As an example, the first HARQ bit block includes only HARQ-ACK bits.

[0340] As an example, the first HARQ bit block also includes bits other than the HARQ-ACK bits.

[0341] As an example, the first HARQ bit block also includes CRC bits.

[0342] As an example, the first HARQ bit block further includes padding bits.

[0343] As an example, the statement "the first HARQ bit block is used to generate the second bit sub-block" in the claim includes the following meaning: the first HARQ bit block is used by the first node device in this application to generate the second bit sub-block.

[0344] As an example, the statement in the claim that "the first HARQ bit block is used to generate the second bit sub-block" includes the following meaning: the second bit sub-block is the first HARQ bit block.

[0345] As an example, the statement in the claim that "the first HARQ bit block is used to generate the second bit sub-block" includes the following meaning: the bits included in the first HARQ bit block are processed or transformed to generate the second bit sub-block.

[0346] As an example, the statement in the claim that "the first HARQ bit block is used to generate the second bit sub-block" includes the following meaning: the bits included in the first HARQ bit block are encoded to generate the second bit sub-block.

[0347] As an example, the first bit count is not greater than the second bit count.

[0348] As an example, the first bit count is not less than the second bit count.

[0349] As an example, the first bit count may or may not be equal to the second bit count.

[0350] As an example, the statement in the claim that "the first HARQ bit block is used to generate the second bit sub-block" includes the following meanings: the first bit quantity value is not greater than the second bit quantity value; when the first bit quantity value is less than the second bit quantity value, the first HARQ bit block is used to generate the second bit sub-block through bit padding; when the first bit quantity value is equal to the second bit quantity value, the second bit sub-block is the first HARQ bit block.

[0351] As an example, the statement in the claim that "the first HARQ bit block is used to generate the second bit sub-block" includes the following meanings: the first bit quantity value is not less than the second bit quantity value; when the first bit quantity value is greater than the second bit quantity value, the first HARQ bit block is bit compressed to generate the second bit sub-block; when the first bit quantity value is equal to the second bit quantity value, the second bit sub-block is the first HARQ bit block.

[0352] As an example, the statement in the claim that "the first HARQ bit block is used to generate the second bit sub-block" is implemented by claim 5 of this application.

[0353] As an example, the statement in the claim that "the first HARQ bit block is used to generate the second bit sub-block" includes the following meanings: when the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is padded to generate the second bit sub-block; when the first bit count is equal to the second bit count, the second bit sub-block is the first HARQ bit block.

[0354] As an example, the X1 alternative quantity values ​​are predefined.

[0355] As an example, the X1 alternative quantity values ​​are configured by signaling.

[0356] As an example, the X1 alternative quantity values ​​are configured by one or more fields in the first information block.

[0357] As an example, any one of the X1 candidate quantity values ​​is greater than 0.

[0358] As an example, one of the X1 candidate quantity values ​​is equal to 0.

[0359] As an example, any two of the X1 candidate quantity values ​​are not equal.

[0360] As an example, the X1 candidate quantity values ​​are evenly distributed.

[0361] As an example, the X1 candidate quantity values ​​are distributed at unequal intervals.

[0362] As an example, the interval between any two adjacent candidate quantity values ​​in the X1 candidate quantity values ​​is equal.

[0363] As an example, the X1 candidate quantity values ​​are arranged in ascending order, and any two adjacent candidate quantity values ​​among the X1 candidate quantity values ​​are equal to the target interval value, which is predefined or configured by signaling.

[0364] As an example, the statement in the claim "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values" includes the following meaning: the first bit quantity value is used by the first node device in this application to determine the second bit quantity value from the X1 candidate quantity values.

[0365] As an example, the statement in the claim "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values" includes the following meaning: the first bit quantity value is used to calculate the second bit quantity value from the X1 candidate quantity values.

[0366] As an example, the statement in the claim that "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values" includes the following meanings: the second bit quantity value is the candidate quantity value among the X1 candidate quantity values ​​that is closest to the first bit quantity value; when there are multiple candidate quantity values ​​among the X1 candidate quantity values ​​whose intervals with the second bit quantity value are equal, the second bit quantity value is the candidate quantity value among the multiple candidate quantity values ​​that is greater than the first bit quantity value.

[0367] As an example, the statement in the claim that "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values" includes the following meanings: the second bit quantity value is the candidate quantity value among the X1 candidate quantity values ​​that is closest to the first bit quantity value; when there are multiple candidate quantity values ​​among the X1 candidate quantity values ​​whose intervals with the second bit quantity value are equal, the second bit quantity value is the candidate quantity value among the multiple candidate quantity values ​​that is less than the first bit quantity value.

[0368] As an example, the statement in the claim that "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate bit quantity values" includes the following meanings: the second bit quantity value is the candidate bit quantity value with the smallest absolute value of the difference between the X1 candidate bit quantity values ​​and the first bit quantity value; when there are multiple candidate bit quantity values ​​among the X1 candidate bit quantity values ​​with equal absolute values ​​of the difference between them and the second bit quantity value, the second bit quantity value is the candidate bit quantity value among the multiple candidate bit quantity values ​​that is greater than the first bit quantity value.

[0369] As an example, the statement in the claim that "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate bit quantity values" includes the following meanings: the second bit quantity value is the candidate bit quantity value with the smallest absolute value of the difference between the X1 candidate bit quantity values ​​and the first bit quantity value; when there are multiple candidate bit quantity values ​​among the X1 candidate bit quantity values ​​with equal absolute values ​​of the difference between them and the second bit quantity value, the second bit quantity value is the candidate bit quantity value among the multiple candidate bit quantity values ​​that is less than the first bit quantity value.

[0370] As an example, the statement in the claim that "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values" includes the following meaning: the second bit quantity value is the candidate quantity value among the X1 candidate quantity values ​​that is not greater than the first bit quantity value and is closest to the first bit quantity value.

[0371] As an example, the statement in the claim that "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values" includes the following meaning: the second bit quantity value is the candidate quantity value among the X1 candidate quantity values ​​that is not less than the first bit quantity value and is closest to the first bit quantity value.

[0372] As an example, the statement in the claim "the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values" includes the following meaning: the first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values ​​by rounding.

[0373] Example 9

[0374] Example 9 illustrates a schematic diagram of the relationship between a first HARQ bit block and a second bit sub-block according to an embodiment of this application, as shown in the attached diagram. Figure 9 As shown. In the appendix Figure 9In Case A, each rectangle represents a bit in the first HARQ bit block, and each diagonally filled rectangle represents a bit in the second bit sub-block; in Case B, each cross-line filled rectangle represents a bit in the first HARQ bit block, each rectangle represents a bit in the second bit sub-block, and each cross-line filled rectangle represents a bit in the second bit block that is outside the first HARQ bit block.

[0375] In Embodiment 9, when the first bit quantity value in this application is greater than the second bit quantity value in this application, the first HARQ bit block in this application is compressed to generate the second bit sub-block in this application; when the first bit quantity value is less than the second bit quantity value, the first HARQ bit block is expanded to generate the second bit sub-block.

[0376] As an example, the compression includes at least one of bundling, dropping, shortening, and encoding.

[0377] As an example, the statement in the claim "the first HARQ bit block is compressed to generate the second bit sub-block" includes the following meaning: the second bit sub-block is generated after some bits in the first HARQ bit block are discarded.

[0378] As one embodiment, the statement in the claim "the first HARQ bit block is compressed to generate the second bit sub-block" includes the following meaning: two or more bits in the first HARQ bit block are bundled to generate the second bit sub-block. As a supplementary embodiment of the above embodiments, the bundling is a logical XOR between bits. As a supplementary embodiment of the above embodiments, the bundling is a logical AND between bits.

[0379] As an example, the statement in the claim "the first HARQ bit block is compressed to generate the second bit sub-block" includes the following meaning: the first HARQ bit block is reduced in size to generate the second bit sub-block.

[0380] As one embodiment, the statement "the first HARQ bit block is compressed to generate the second bit sub-block" in the claim includes the following meaning: the first HARQ bit block is compressed and encoded to generate the second bit sub-block. As a supplementary embodiment of the above embodiments, the compression encoding employs FFT transform. As a supplementary embodiment of the above embodiments, the compression encoding employs wavelet transform. As a supplementary embodiment of the above embodiments, the compression encoding employs frequency domain compression or time domain compression.

[0381] As an example, the extension includes at least one of bit padding, repetition, and extended encoding.

[0382] As one embodiment, the statement in the claim "the first HARQ bit block is expanded to generate the second bit sub-block" includes the following meaning: the first HARQ bit block is expanded by adding padding bits to generate the second bit sub-block. As a supplementary embodiment of the above embodiment, the bit value of each padding bit is equal to "0". As a supplementary embodiment of the above embodiment, the bit value of each padding bit is equal to "1".

[0383] As an embodiment, the statement "the first HARQ bit block is expanded to generate the second bit sub-block" in the claim includes the following meaning: the second bit sub-block is generated by repeating all or part of the bits included in the first HARQ bit block. As a supplementary embodiment of the above embodiment, at least one LSB (Least Significant Bit) in the first HARQ bit block is repeated. As a supplementary embodiment of the above embodiment, at least one MSB (Most Significant Bit) in the first HARQ bit block is repeated. As a supplementary embodiment of the above embodiment, a positive integer multiple of the number of repeated bits in the first HARQ bit block is equal to the difference between the number of the second bit and the number of the first bit.

[0384] As an embodiment, the statement "the first HARQ bit block is expanded to generate the second bit sub-block" in the claim includes the following meaning: the first HARQ bit block is expanded and encoded to generate the second bit sub-block. As a supplementary embodiment of the above embodiment, the expansion encoding uses FFT transform. As a supplementary embodiment of the above embodiment, the expansion encoding uses wavelet transform. As a supplementary embodiment of the above embodiment, the expansion encoding uses frequency domain expansion or time domain expansion.

[0385] Example 10

[0386] Example 10 illustrates a schematic diagram of a first-level index value and a second-level index value according to an embodiment of this application, as shown in the attached diagram. Figure 10 As shown. In the appendix Figure 10 In the diagram, the rectangle filled with intersecting lines represents the target resource, and the two unfilled rectangles represent the resources mapped to the first bit sub-block and the second bit sub-block in the target resource, respectively. The first bit sub-block and the second bit sub-block are associated with the first-level index value and the second-level index value, respectively.

[0387] In Embodiment 10, the priority level index associated with the first bit sub-block in this application is equal to the first level index value, which is a non-negative integer; the priority level index associated with the second bit sub-block in this application is equal to the second level index value, which is a non-negative integer; the first level index value and the second level index value are not equal; the priority level index associated with the target resource in this application is equal to the larger of the first level index value and the second level index value.

[0388] As an example, the first level index value is equal to either 0 or 1.

[0389] As an example, the second level index value is equal to either 0 or 1.

[0390] As an example, the first level index value is equal to 1, and the second level index value is equal to 0.

[0391] As an example, the first level index value is greater than the second level index value.

[0392] As an example, the first level index value is less than the second level index value.

[0393] As an example, the priority index associated with the first bit sub-block is the priority index of the PDSCH (Physical Downlink Shared Channel) corresponding to at least one bit included in the first bit sub-block.

[0394] As an example, the value of the priority index associated with the first bit sub-block is the value of the priority indicator carried by the DCI format associated with at least one bit included in the first bit sub-block.

[0395] As an example, at least one bit included in the first bit sub-block is used to determine whether the target PDSCH is correctly decoded, and the value of the priority index associated with the first bit sub-block is the value of the priority index of the target PDSCH.

[0396] As an example, at least one bit included in the first bit sub-block is used to determine whether the target PDSCH is correctly decoded, and the value of the priority index associated with the first bit sub-block is the value of the priority indicator carried by the DCI format of the scheduling target PDSCH.

[0397] As an example, the value of the priority index associated with the first bit sub-block is configured via signaling.

[0398] As an example, the value of the priority index associated with the first bit sub-block is a default or predefined priority index value.

[0399] As an example, the priority index associated with the first bit sub-block is the priority index of the HARQ codebook to which at least one bit included in the first bit sub-block belongs.

[0400] As an example, the priority index associated with the first bit sub-block is the priority index corresponding to the ID of the HARQ codebook to which at least one bit of the first bit sub-block belongs.

[0401] As an example, the value of the priority index associated with the second bit sub-block is the value of the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

[0402] As an example, the value of the priority index associated with the second bit sub-block is the value of the priority indicator carried by the DCI format associated with at least one bit included in the second bit sub-block.

[0403] As an example, at least one bit included in the second bit sub-block is used to determine whether the feature PDSCH is correctly decoded, and the value of the priority index associated with the second bit sub-block is the value of the priority index of the feature PDSCH.

[0404] As an example, at least one bit included in the second bit sub-block is used to determine whether the feature PDSCH is correctly decoded, and the value of the priority index associated with the second bit sub-block is the value of the priority indicator carried by the DCI format of the scheduling feature PDSCH.

[0405] As an example, the value of the priority index associated with the second bit sub-block is configured via signaling.

[0406] As an example, the value of the priority index associated with the second bit sub-block is a default or predefined priority index value.

[0407] As an example, the priority index associated with the second bit sub-block is the priority index of the HARQ codebook to which at least one bit included in the second bit sub-block belongs.

[0408] As an example, the priority index associated with the second bit sub-block is the priority index corresponding to the ID of the HARQ codebook to which at least one bit of the second bit sub-block belongs.

[0409] As an example, the value of the priority level index associated with the target resource is the value of the priority level index corresponding to the signaling that configures the target resource.

[0410] As an example, the value of the priority index associated with the target resource is the value of the priority index associated with the HARQ-ACK codebook used by the target resource.

[0411] As an example, the value of the priority index associated with the target resource is the value of the priority index of the PUCCH associated with the HARQ-ACK codebook used by the target resource.

[0412] As an example, the value of the priority index associated with the target resource is the value of the priority index associated with the HARQ-ACK codebook to which the signaling configured for the target resource is applied.

[0413] As an example, the value of the priority index associated with the target resource is the value of the priority index of the PUCCH associated with the HARQ-ACK codebook to which the signaling of the target resource is configured.

[0414] As an example, the "PUCCH-ConfigurationList" IE includes a first PUCCH configuration and a second PUCCH configuration. The first PUCCH configuration is applied to a first HARQ-ACK codebook, and the second PUCCH configuration is applied to a second HARQ-ACK codebook. The value of the priority index associated with the target resource is the value of the priority index of the PUCCH associated with the second HARQ-ACK codebook.

[0415] As an example, the value of the priority index associated with the target resource is the value of the priority index of the PUCCH associated with the HARQ-ACK codebook applied by the "PUCCH-Config" IE that configures the target resource.

[0416] Example 11

[0417] Example 11 illustrates a schematic diagram of a first RB quantity value according to an embodiment of this application, as shown in the attached diagram. Figure 11 As shown. In the appendix Figure 11 In the diagram, the horizontal axis represents the index of the RB, each rectangle represents an RB, the solid line with an arrow represents the mapping of the first bit sub-block and the second bit sub-block according to the first coding rate value, and the first RB quantity value represents the minimum number of RBs required when the first bit block and the second bit block are mapped according to the first coding rate value.

[0418] In Embodiment 11, the number of bits included in the first bit sub-block of this application and the number of bits associated with the second bit sub-block of this application are used together to determine the first sum value; the first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, the first modulation order is equal to the modulation order of the target PUCCH in this application, and the first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource in this application; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum value, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum value.

[0419] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum value" includes the following meaning: the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together by the first node device in this application to determine the first sum value.

[0420] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum" includes the following meaning: the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to calculate the first sum.

[0421] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum" includes the following meaning: the first sum is equal to the sum between the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block.

[0422] As an example, the statement in the claim that "the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum" includes the following meaning: the first sum is equal to the sum of the number of bits included in the first bit sub-block, the number of CRC bits attached to the first bit sub-block (if there are CRC bits attached to the first bit sub-block), the number of bits associated with the second bit sub-block, and the number of CRC bits attached to the second bit sub-block (if there are CRC bits attached to the second bit sub-block).

[0423] As an example, the first sum is a positive integer.

[0424] As an example, the first modulation order is a positive integer.

[0425] As an example, the first modulation order is equal to a non-negative integer power of 2.

[0426] As an example, the modulation order of the target PUCCH is equal to 1.

[0427] As an example, the modulation order of the target PUCCH is equal to 2.

[0428] As an example, the modulation order of the target PUCCH is equal to the modulation order of one of the modulation schemes BPSK, QPSK, 16QAM, 64QAM, 256QAM, and 1024QAM.

[0429] As an example, the first resource quantity value is a positive integer.

[0430] As an example, the number of resource units used for control information bits included in the target resource within a RB is equal to the number of resource units used for control information bits in the frequency domain belonging to a RB included in the target resource.

[0431] As an example, the number of resource units used for control information bits included in a target resource within an RB is equal to the number of REs used for control information bits in a frequency domain belonging to an RB included in the target resource.

[0432] As an example, the number of resource units used for control information bits included in the target resource within an RB is equal to... and The product of, where, This represents the number of subcarriers used to control information bits within one RB encompassed by the target resource in the frequency domain. This represents the number of time-domain symbols outside the time-domain symbols occupied by the reference signal (when the reference signal is included) in the time domain of the target resource set.

[0433] As an example, the number of resource units used for control information bits included in the target resource within an RB is equal to... and The product of, where, Represents a positive integer determined by the format of the target PUCCH. This represents the number of time-domain symbols outside the time-domain symbols occupied by the reference signal (when the reference signal is included) in the time domain of the target resource set.

[0434] As an example, the number of resource units used for control information bits included in the target resource within an RB is equal to... and The product of, where, This represents the number of subcarriers, excluding those occupied by the reference signal (when the reference signal is included), within a single RB in the frequency domain encompassed by the target resource. This represents the number of time-domain symbols outside the time-domain symbols occupied by the reference signal (when the reference signal is included) in the time domain of the target resource set.

[0435] As an example, the number of resource units used for control information bits included in the target resource within an RB is equal to... and The product of, where the number of first subcarriers is equal to the number of subcarriers other than those occupied by the reference signal (when the reference signal is included) within one RB of the target resource in the frequency domain. This represents the quotient between the number of the first subcarriers and the spreading factor of the target PUCCH. This represents the number of time-domain symbols outside the time-domain symbols occupied by the reference signal (when the reference signal is included) in the time domain of the target resource set.

[0436] As an example, the number of resource units used for control information bits included in the target resource within an RB is equal to... and The product of, where the number of first subcarriers is equal to the number of subcarriers other than those occupied by the reference signal (when the reference signal is included) within one RB of the target resource in the frequency domain. This represents the quotient between the number of the first subcarriers and the spreading factor of the target PUCCH (when the format of the target PUCCH does not include an orthogonal cover code (OCC), the spreading factor of the target PUCCH is equal to 1). This represents the number of time-domain symbols outside the time-domain symbols occupied by the reference signal (when the reference signal is included) in the time domain of the target resource set.

[0437] Example 12

[0438] Example 12 illustrates a structural block diagram of a processing device in a first node device according to an embodiment, as shown in the attached diagram. Figure 12 As shown. In the appendix Figure 12 In the first node device processing unit 1200, there are a first receiver 1201 and a first transmitter 1202. The first receiver 1201 includes the components specified in the appendix of this application. Figure 4 The transmitter / receiver 456 (including antenna 460), receiver processor 452, and controller / processor 490 are included; the first transmitter 1202 includes the appendix to this application. Figure 4 The transmitter / receiver 456 (including antenna 460) and the transmitter processor 455 are included.

[0439] In embodiment 12, a first receiver 1201 receives a first information block, which is used to determine a first factor; a first transmitter 1202 transmits a target PUCCH, which carries at least a first bit sub-block, the first bit sub-block including at least one bit; wherein, the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, the first bit sub-block and the second bit sub-block are not the same; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine a first RB quantity value; the resource occupied by the target PUCCH belongs to a target resource, the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0440] As an example, the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; when the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, are used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0441] As an example, a first receiver 1201 receives a first signaling; wherein the first signaling is used to determine the target resource from a target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

[0442] As an example, a first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. A first bit count value is equal to the number of bits included in the first HARQ bit block. A second bit count value is equal to the number of bits included in the second bit sub-block. The second bit count value is equal to one of X1 candidate count values, where any one of the X1 candidate count values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit count value is used to determine the second bit count value from the X1 candidate count values.

[0443] As an example, when the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

[0444] As an example, the priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

[0445] As an example, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum; the first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, the first modulation order is equal to the modulation order of the target PUCCH, and the first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum.

[0446] Example 13

[0447] Example 13 illustrates a structural block diagram of a processing device in a second node device according to an embodiment, as shown in the attached diagram. Figure 13 As shown. In the appendix Figure 13 In the second node device processing unit 1300, there are a second transmitter 1301 and a second receiver 1302. The second transmitter 1301 includes the components specified in the appendix to this application. Figure 4 The transmitter / receiver 416 (including antenna 460), the transmitter processor 415, and the controller / processor 440 are included; the second receiver 1302 includes the appendix to this application. Figure 4 The transmitter / receiver 416 (including antenna 460), receiver processor 412, and controller / processor 440 are included.

[0448] In embodiment 13, the second transmitter 1301 transmits a first information block, which is used to indicate a first factor; the second receiver 1302 receives a target PUCCH, which carries at least a first bit sub-block, the first bit sub-block including at least one bit; wherein, the target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, the second bit sub-block including at least one bit, the first bit sub-block and the second bit sub-block are not the same; the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine a first RB quantity value; the resource occupied by the target PUCCH belongs to a target resource, the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value; the magnitude relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0449] As an example, the coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; when the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, are used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

[0450] As an example, the second transmitter 1301 transmits a first signaling; wherein the first signaling is used to indicate the target resources from a target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

[0451] As an example, a first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. A first bit count value is equal to the number of bits included in the first HARQ bit block. A second bit count value is equal to the number of bits included in the second bit sub-block. The second bit count value is equal to one of X1 candidate count values, where any one of the X1 candidate count values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit count value is used to determine the second bit count value from the X1 candidate count values.

[0452] As an example, when the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

[0453] As an example, the priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

[0454] As an example, the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum; the first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, the first modulation order is equal to the modulation order of the target PUCCH, and the first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum.

[0455] Those skilled in the art will understand that all or part of the steps in the above methods can be implemented by a program instructing related hardware, and the program can be stored in a computer-readable storage medium, such as a read-only memory, hard disk, or optical disk. Optionally, all or part of the steps in the above embodiments can also be implemented using one or more integrated circuits. Correspondingly, each module unit in the above embodiments can be implemented in hardware or in the form of software functional modules. This application is not limited to any specific combination of software and hardware. The first node device or second node device or UE or terminal in this application includes, but is not limited to, mobile phones, tablets, laptops, network cards, low-power devices, eMTC devices, NB-IoT devices, vehicle communication devices, aircraft, airplanes, drones, remote-controlled airplanes, testing devices, testing equipment, testing instruments, etc. The base station device or base station or network-side device in this application includes, but is not limited to, macrocell base stations, microcell base stations, home base stations, relay base stations, eNBs, gNBs, Transmitter Receiver Nodes (TRPs), relay satellites, satellite base stations, airborne base stations, testing devices, testing equipment, testing instruments, etc.

[0456] Those skilled in the art will understand that the present invention can be practiced in other specified forms without departing from its core or essential characteristics. Therefore, the embodiments disclosed herein should in any way be considered descriptive rather than restrictive. The scope of the invention is defined by the appended claims rather than the foregoing description, and all modifications within their equivalent meaning and scope are considered to be included therein.

Claims

1. A first node device for wireless communication, characterized in that, include: A first receiver receives a first information block, which is used to determine a first factor. A first transmitter transmits a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, which includes at least one bit. The first bit sub-block and the second bit sub-block are different. The priority index associated with the first bit sub-block is equal to "1", and the priority index associated with the second bit sub-block is equal to "0". The sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2. The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value. The resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value. The relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

2. The first node device according to claim 1, characterized in that, The coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; When the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

3. The first node device according to claim 1 or 2, characterized in that, The first receiver receives a first signaling; wherein the first signaling is used to determine the target resource from a target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

4. The first node device according to claim 3, characterized in that, The target resource set is one of K1 resource sets, which are either signaling configurations or predefined, and K1 is a positive integer greater than 1. The K1 resource sets correspond to K1 numerical intervals, and the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block belongs to the target numerical interval. The target numerical interval is one of the K1 numerical intervals, and the target resource set is the resource set among the X1 resource sets that corresponds to the target numerical interval.

5. The first node device according to any one of claims 1, 2, and 4, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

6. The first node device according to claim 3, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

7. The first node device according to claim 5, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

8. The first node device according to claim 6, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

9. The first node device according to any one of claims 1, 2, 4, 6-8, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

10. The first node device according to claim 3, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

11. The first node device according to claim 5, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

12. The first node device according to claim 9, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

13. The first node device according to any one of claims 10 or 11, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

14. The first node device according to any one of claims 1, 2, 4, 6-8, 10-12, characterized in that, The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum value; the first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, the first modulation order is equal to the modulation order of the target PUCCH, and the first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum value, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum value.

15. The first node device according to any one of claims 1, 2, 4, 6-8, 10-12, characterized in that, The first bit sub-block and the second bit sub-block are respectively coded by two independent channels. Any bit included in the first bit sub-block is a HARQ-ACK bit, and any bit included in the second bit sub-block is a HARQ-ACK bit.

16. A second node device for wireless communication, characterized in that, include: The second transmitter sends a first information block, which is used to indicate the first factor. The second receiver receives a target PUCCH, which carries at least a first bit sub-block, the first bit sub-block including at least one bit; The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, which includes at least one bit. The first bit sub-block and the second bit sub-block are different. The priority index associated with the first bit sub-block is equal to "1", and the priority index associated with the second bit sub-block is equal to "0". The sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2. The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value. The resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value. The relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

17. The second node device according to claim 16, characterized in that, The coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; When the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

18. The second node device according to claim 16 or 17, characterized in that, The second transmitter sends a first signaling message; wherein the first signaling message is used to determine the target resource from a target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

19. The second node device according to claim 18, characterized in that, The target resource set is one of K1 resource sets, which are either signaling configurations or predefined, and K1 is a positive integer greater than 1. The K1 resource sets correspond to K1 numerical intervals, and the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block belongs to the target numerical interval. The target numerical interval is one of the K1 numerical intervals, and the target resource set is the resource set among the X1 resource sets that corresponds to the target numerical interval.

20. The second node device according to any one of claims 16, 17, and 19, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

21. The second node device according to claim 18, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

22. The second node device according to claim 20, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

23. The second node device according to claim 21, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

24. The second node device according to any one of claims 16, 17, 19, and 21-23, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

25. The second node device according to claim 18, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

26. The second node device according to claim 20, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

27. The second node device according to claim 24, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

28. The second node device according to any one of claims 25 or 26, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

29. The second node device according to any one of claims 16, 17, 19, 21-23, and 25-27, characterized in that, The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum value; the first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, the first modulation order is equal to the modulation order of the target PUCCH, and the first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum value, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum value.

30. The second node device according to any one of claims 16, 17, 19, 21-23, and 25-27, characterized in that, The first bit sub-block and the second bit sub-block are respectively coded by two independent channels. Any bit included in the first bit sub-block is a HARQ-ACK bit, and any bit included in the second bit sub-block is a HARQ-ACK bit.

31. A method for a first node in wireless communication, characterized in that, include: Receive a first information block, which is used to determine a first factor; Send a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, which includes at least one bit. The first bit sub-block and the second bit sub-block are different. The priority index associated with the first bit sub-block is equal to "1", and the priority index associated with the second bit sub-block is equal to "0". The sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2. The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value. The resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value. The relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

32. The method in the first node according to claim 31, characterized in that, The coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; When the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

33. The method in the first node according to claim 31 or 32, characterized in that, include: Receive the first signaling; The first signaling is used to determine the target resource from the target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

34. The method in the first node according to claim 33, characterized in that, The target resource set is one of K1 resource sets, which are either signaling configurations or predefined, and K1 is a positive integer greater than 1. The K1 resource sets correspond to K1 numerical intervals, and the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block belongs to the target numerical interval. The target numerical interval is one of the K1 numerical intervals, and the target resource set is the resource set among the X1 resource sets that corresponds to the target numerical interval.

35. The method in the first node according to any one of claims 31, 32, and 34, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

36. The method in the first node according to claim 33, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

37. The method in the first node according to claim 35, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

38. The method in the first node according to claim 36, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

39. The method in the first node according to any one of claims 31, 32, 34, 36-38, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

40. The method in the first node according to claim 33, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

41. The method in the first node according to claim 35, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

42. The method in the first node according to claim 39, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

43. The method in the first node according to any one of claims 40 or 41, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

44. The method in the first node according to any one of claims 31, 32, 34, 36-38, 40-42, characterized in that, The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum value; the first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, the first modulation order is equal to the modulation order of the target PUCCH, and the first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum value, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum value.

45. The method in the first node according to any one of claims 31, 32, 34, 36-38, 40-42, characterized in that, The first bit sub-block and the second bit sub-block are respectively coded by two independent channels. Any bit included in the first bit sub-block is a HARQ-ACK bit, and any bit included in the second bit sub-block is a HARQ-ACK bit.

46. ​​A method for a second node in wireless communication, characterized in that, include: Send a first information block, which is used to indicate a first factor; Receive a target PUCCH, the target PUCCH carrying at least a first bit sub-block, the first bit sub-block including at least one bit; The target PUCCH carries a non-negative integer number of bits belonging to a second bit sub-block, which includes at least one bit. The first bit sub-block and the second bit sub-block are different. The priority index associated with the first bit sub-block is equal to "1", and the priority index associated with the second bit sub-block is equal to "0". The sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block is greater than 2. The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first RB quantity value. The resources occupied by the target PUCCH belong to the target resource, and the number of RBs included in the target resource in the frequency domain is equal to the second RB quantity value. The relationship between the first RB quantity value and the second RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

47. The method in the second node according to claim 46, characterized in that, The coding rate value corresponding to the first bit sub-block and the number of bits included in the first bit sub-block are used together to determine the third RB quantity value; When the first RB quantity value is not greater than the second RB quantity value, the target PUCCH carries all the bits belonging to the second bit sub-block; when the first RB quantity value is greater than the second RB quantity value, the difference between the second RB quantity value and the third RB quantity value, together with the first factor, is used to determine the number of bits belonging to the second bit sub-block carried by the target PUCCH.

48. The method in the second node according to claim 46 or 47, characterized in that, include: Send the first signaling; The first signaling is used to determine the target resource from the target resource set, the target resource set including at least one PUCCH resource, and at least two of the following three factors—the number of bits included in the first bit sub-block, the number of bits associated with the second bit sub-block, and the first factor—are used to determine the target resource set.

49. The method in the second node according to claim 48, characterized in that, The target resource set is one of K1 resource sets, which are either signaling configurations or predefined, and K1 is a positive integer greater than 1. The K1 resource sets correspond to K1 numerical intervals, and the sum of the number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block belongs to the target numerical interval. The target numerical interval is one of the K1 numerical intervals, and the target resource set is the resource set among the X1 resource sets that corresponds to the target numerical interval.

50. The method in the second node according to any one of claims 46, 47, and 49, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

51. The method in the second node according to claim 48, characterized in that, A first HARQ bit block is used to generate the second bit sub-block. The first HARQ bit block includes at least one HARQ-ACK bit. The first bit quantity value is equal to the number of bits included in the first HARQ bit block. The second bit quantity value is equal to the number of bits included in the second bit sub-block. The second bit quantity value is equal to one of X1 candidate quantity values, where any one of the X1 candidate quantity values ​​is a non-negative integer, and X1 is a positive integer greater than 1. The first bit quantity value is used to determine the second bit quantity value from the X1 candidate quantity values.

52. The method in the second node according to claim 50, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

53. The method in the second node according to claim 51, characterized in that, When the first bit count is greater than the second bit count, the first HARQ bit block is compressed to generate the second bit sub-block; when the first bit count is less than the second bit count, the first HARQ bit block is expanded to generate the second bit sub-block.

54. The method in the second node according to any one of claims 46, 47, 49, and 51-53, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

55. The method in the second node according to claim 48, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

56. The method in the second node according to claim 50, characterized in that, The priority index associated with the first bit sub-block is equal to the first priority index value, which is a non-negative integer; the priority index associated with the second bit sub-block is equal to the second priority index value, which is a non-negative integer; the first priority index value and the second priority index value are not equal; the priority index associated with the target resource is equal to the larger of the first priority index value and the second priority index value.

57. The method in the second node according to claim 54, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

58. The method in the second node according to any one of claims 55 or 56, characterized in that, The priority index associated with the first bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the first bit sub-block, and the priority index associated with the second bit sub-block is the priority index of the PDSCH corresponding to at least one bit included in the second bit sub-block.

59. The method in the second node according to any one of claims 46, 47, 49, 51-53, 56-58, characterized in that, The number of bits included in the first bit sub-block and the number of bits associated with the second bit sub-block are used together to determine the first sum value; the first coding rate value is equal to the coding rate value corresponding to the first bit sub-block, the first modulation order is equal to the modulation order of the target PUCCH, and the first resource quantity value is equal to the number of resource units used for control information bits included in one RB of the target resource; the product of the first RB quantity value, the first coding rate value, the first modulation order, and the first resource quantity value is not less than the first sum value, and the product of the difference between the first RB quantity value and 1, the first coding rate value, the first modulation order, and the first resource quantity value is less than the first sum value.

60. The method in the second node according to any one of claims 46, 47, 49, 51-53, 56-58, characterized in that, The first bit sub-block and the second bit sub-block are respectively coded by two independent channels. Any bit included in the first bit sub-block is a HARQ-ACK bit, and any bit included in the second bit sub-block is a HARQ-ACK bit.

Images