This patent document generally relates to systems, devices, and techniques for wireless communications.
Wireless communication technologies are moving the world toward an increasingly connected and networked society. The rapid growth of wireless communications and advances in technology has led to greater demand for capacity and connectivity. Other aspects, such as energy consumption, device cost, spectral efficiency, and latency are also important to meeting the needs of various communication scenarios. In comparison with the existing wireless networks, next generation systems and wireless communication techniques need to provide support for an increased number of users and devices.
This document relates to methods, systems, and devices for feedback schemes for multiple channels in wireless communication devices.
In one aspect, a wireless communication method is disclosed. The wireless communication method includes determining, by a communication device, one or more candidate transmission occasions based on a modified parameter set, wherein the modified parameter set includes one or more valid indicators that are valid according to a pre-determined rule.
In another aspect, a communication apparatus comprising a processor configured to implement the above-described method is disclosed.
In another aspect, a computer readable medium having code stored thereon, the code, when executed, causing a processor to implement the above-described method is disclosed.
These, and other features, are described in the present document.
The disclosed technology provides implementations and examples of schemes for determining candidate transmission occasion in wireless communications.
In FR 2-2 (52.6-71 GHz), single DCI can schedule multiple PDSCH and the multiple PDSCH can be non-continuous in time-domain. For a DCI that can schedule multiple PDSCHs, the time domain resource allocation (TDRA) table is configured with at least one row with multiple SLIVs (Start and Length Indicator value for the time domain allocation for PDSCH) and each SLIV corresponds a time domain resource allocation for a PDSCH. Single DCI can schedule a row with multiple PDSCHs and some of the PDSCHs can be collided with uplink symbol(s) indicated by tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-ConfigurationDedicated. The collided PDSCH is called as invalid PDSCH or invalid SLIV and the user equipment (UE) does not receive the invalid PDSCH. When the configured SLIV is invalid, the gNB does not transmit the corresponding PDSCH of the invalid SLIV and the UE does not receive the invalid PDSCH.
According to the current regulation, if the last configured SLIV of a row of a TDRA (time domain resource allocation) table designed for transmitting the plurality of downlink transmissions scheduled by downlink control information (DCI) is invalid but the row includes one or more valid SLIVs, the last configured SLIV still participates in the determining of candidate PDSCH occasion and the HARQ-ACK information for all the PDSCH receptions corresponds to valid SLIV bundling with 1 bit when time domain bundling operation for semi-static HARQ-ACK codebook is enabled. If the last configured SLIV of row 1 with multiple SLIVs is invalid and the last configured SLIV of row 1 is overlapped with the last configured SLIV of row 2 in time domain which is valid, gNB may schedule both row 1 and row 2. However, in this case, candidate PDSCH occasion cannot be correctly determined according to the pruning procedure based on the last configured SLIV. According to the current pruning procedure based on the last configured SLIV, gNB shall not schedule both row 1 and row 2 and only one candidate PDSCH occasion is determined. HARQ-ACK can only feedback for row 1 or row 2. However, the last configured SLIV of row 1 is not actually transmitted and both row 1 and row 2 can be scheduled.
The pruning procedure refers to identification of the non-overlapping transmissions within a slot to determine candidate PDSCH occasion based on the SLIV set in a slot and whether the slot supports receiving multiple PDSCHs. The pruning procedure is well known in the art and the detailed explanations will be omitted. According to the pruning procedure, a candidate PDSCH occasion corresponds to a SLIV set, where each SLIV in the SLIV set overlaps with a SLIV which ends with the smallest last OFDM symbol index. In the SLIV set, only one PDSCH reception can be scheduled at the same time and the HARQ-ACK feedback corresponding to the candidate PDSCH occasion is used for feedback decoding result of the PDSCH reception if one of the PDSCH reception corresponding to the SLIV set is transmitted.
For example, in
Various implementations of the disclosed technology suggest schemes for determining one or more candidate PDSCH occasions. Some implementations of the disclosed technology allow a UE and/or a network device to accurately determine candidate PDSCH occasions. By determining the candidate PDSCH occasions accurately, it is also possible to more accurately provide HARQ-ACK feedback when the last configured SLIV in a row of TDRA table is invalid.
For the semi-static HARQ-ACK codebook determination, UE feeds back a bitmap of bits and each bit of bitmap corresponds to a candidate PDSCH occasion. Under some scenarios, a PDSCH reception shall be included in the semi-static HARQ-ACK codebook, even though the actual PDSCH reception is not present. In this case, the semi-static HARQ-ACK feedback contains redundant HARQ-ACK feedback information. If the PDSCH reception is present, UE receives the PDSCH reception and decodes the PDSCH reception and the corresponding HARQ-ACK feedback bit feeds back the decoding result of the PDSCH reception. If the PDSCH reception is not present, the corresponding HARQ-ACK feedback bit feeds back non-acknowledgement or the non-acknowledgement is padded in the corresponding HARQ-ACK feedback bit.
In some implementations of the disclosed technology, for semi-static HARQ-ACK codebook determination, the parameter set is configured to include the last configured SLIV of each target row in a target slot when time domain bundling operation for semi-static HARQ-ACK codebook is enabled and the time domain resource assignment (TDRA) table is configured with at least one row with multiple SLIVs. The target slot is determined based on a slot including PUCCH transmission which feeds backs HARQ-ACK information to gNB and a K1 value, which corresponds to the timing interval between the slot where the HARQ-ACK information feedback is located and a slot where the PDSCH reception ends. The target row is the row that at least contains a valid SLIV based on the target slot. For example, Table 1 shows the TDRA table including 4 rows.
Based on the example as shown in
After the parameter set is configured, validity of each SLIV in the parameter set is checked. For example, the last configured SLIV of a row is invalid when at least one symbol of the PDSCH reception corresponding the configured SLIV is configured as UL by tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-ConfigurationDedicated. Referring to
Based on the checking of the validity, one or more SLIVs checked as invalid are removed from the parameter set. Thus, SLIV 0-1 and SLIV 3-1, which collide with the UL symbol, are removed from the parameter set, which makes the parameter set include only valid last configured SLIVs of all rows in the TDRA table for the slot derived by the slot of HARQ-ACK feedback information and the timing interval K1.
When checking the validity of the last configured SLIV of each row in the TDRA table, the number of occurrences that the last configured SLIV is invalid is counted as the count value, jinvalid. The count value, jinvalid, is initially set to be equal to 0 and increases by 1 for each occurrence of invalid SLIV. In the example of
The total number of candidate PDSCH occasions is determined differently based on whether a UE can support a single PDSCH reception within a slot only or whether the UE can support multiple PDSCH receptions within the slot. In the below, two different implementations are discussed depending on the UE's capability for receiving a single PDSCH reception or multiple PDSCH receptions.
The present implementation is when the UE can support a single slot receiving only a single PDSCH reception.
After the removal of the invalid SLIVs, if the parameter set is the empty set, the total number of candidate PDSCH occasions is set to be equal to jinvalid. If the parameter set is not the empty set, the total candidate PDSCH occasion is jinvalid+jpp. Since the total number of candidate PDSCH occasions corresponds to the HARQ-ACK feedback bit, if the parameter set is the empty set, the HARQ-ACK feedback bit is set to be equal to jinvalid and if the parameter set is not the empty set, the HARQ-ACK feedback bit is jinvalid+jpp. In this implementation, since the UE can only support single slot receiving single PDSCH reception, the variable jpp is 1. Thus, if the parameter set is not the empty set, the total number of candidate PDSCH occasions or HARQ-ACK information feedback bit is jinvalid+1.
In the example of
Implementation 2—Single Slot Receiving Multiple PDSCHs
The present implementation is when the UE can support a single slot receiving multiple PDSCH receptions.
After the removal of the invalid SLIVs, if the parameter set is the empty set, the total number of candidate PDSCH occasion or HARQ-ACK information feedback bit is set to be equal to jinvalid. If the parameter set is not the empty set, the total number of candidate PDSCH occasion or HARQ-ACK information feedback bit is jinvalid+jpp. The variable jpp corresponds to the number of candidate PDSCH occasions obtained from the pruning procedure that is performed based on the parameter set after the removal of the invalid SLIVs.
In the example of
This implementation discusses how to determine an order of corresponding candidate PDSCH occasions or HARQ-ACK information feedback for different PDSCH receptions. This implementation corresponds to an additional procedure of Implementation 1 and/or Implementation 2 and the descriptions to determine the total number of candidate PDSCH occasions as discussed above can be applied hereto. The same descriptions as those discussed with reference to Implementations 1 and 2 are omitted and the descriptions below mainly discuss the additional operations in addition to those discussed with reference to Implementations 1 and 2.
Based on the checking of the validity of each SLIV in the parameter set, one or more SLIVs checked as invalid are removed from the parameter set and moved to another parameter set. Thus, SLIV 0-1 and SLIV 3-1, which collide with the UL symbol, are removed from the parameter set and moved to another parameter set. Thus, the another parameter set is configured to include SLIV 0-1 and SLIV 3-1. The SLIVs in another parameter set are ordered based on the last OFDM symbol index of the SLIV or PDSCH reception. For example, the smaller last OFDM symbol index corresponds to the smaller index of candidate PDSCH occasion or more significant bits of HARQ-ACK information feedback bit.
In the example of
For example, the last OFDM symbol index of SLIV 3-1 is 12 and the last OFDM symbol index of SLIV 0-1 is 13. Therefore, between two SLIVs included in the another parameter set, SLIV 3-1 corresponds to the first candidate PDSCH occasion and SLIV 0-1 corresponds to the second candidate PDSCH occasion. If UE can support the single slot receiving single PDSCH reception, since the total number of candidate PDSCH occasions is 3 as discussed above, UE feeds back the bitmap with 3 bits. When UE feeds back the bitmap, the SLIVs included in the another parameter set configure corresponding bits of the HARQ-ACK feedback based on the last OFDM symbol indices of corresponding SLIV receptions. As discussed above, the SLIVs in another parameter set are ordered based on the last OFDM symbol index of the SLIV or PDSCH reception and the smaller last OFDM symbol index corresponds to the smaller index of candidate PDSCH occasion or more significant bits of HARQ-ACK feedback bit. In the example of
Implementation 3 can be applied to following three cases:
For Case 2, the order of candidate PDSCH occasions for the last configured invalid SLIV set is determined based on the last symbol index of the corresponding invalid SLIV set and the smaller symbol index corresponds the smaller candidate PDSCH occasion index.
When Case 1 or Case 2 appear with Case 3 for the same PUCCH transmission which feeds back HARQ-ACK information, one or more candidate PDSCH occasions for the last configured invalid SLIV set correspond to first one or more candidate PDSCH occasions and one or more candidate PDSCH occasions for the last configured valid SLIV set is appended. The order of one or more candidate PDSCH occasions for Case 3 is determined by pruning procedure.
In some implementations, the method 300 further includes checking a validity of the each indicator based on the predetermined rule; and removing the one or more invalid indicators from a first parameter set a first parameter set including 1) the one or more valid indicators or 2) one or more invalid indicators to provide the modified parameter set.
In some implementations, each indicator corresponds to a SLIV (start and length indicator for a time domain allocation for a corresponding physical downlink shared channel (PDSCH)) that is a last configured SLIV in each row of a time domain resource allocation (TDRA) table.
In some implementations, the determining determines the one or more candidate transmission occasions based on a capability of a user device for receiving multiple transmissions within a slot.
In some implementations, the multiple transmissions correspond to multiple PDSCH (physical downlink shared channel) receptions.
In some implementations, the method 300 further comprises: counting a number of the one or more invalid indicators, jinvalid.
In some implementations, the determining determines a total number of the one or more candidate transmission occasions is set to be equal to jinvalid in case that the modified parameter set is an empty set, and the determining determines the total number of the one or more candidate transmission occasions is jinvalid+jpp in case that the modified parameter set is not the empty set, where jpp corresponds to a number of candidate transmission occasion obtained by a pruning procedure that identifies a non-overlapping transmission within the slot based on the modified parameter set.
In some implementations, wherein jpp is set to 1 for a user device capability of receiving a single candidate transmission occasion only within the slot and jpp is set to a value equal to or greater than 1 for the user device capability of receiving multiple candidate transmission occasions within the slot.
In some implementations, the method 300 further comprises: configuring a second parameter set to include the one or more invalid indicators that are removed from the first parameter set, wherein the one or more invalid indicators in the second parameter set are used to determine the one or more candidate transmission occasions.
In some implementations, each invalid indicator in the second parameter set corresponds a candidate transmission occasion.
In some implementations, the method 300 further comprises: determining an order of the one or more invalid indicators based on a last OFDM symbol index of each of the one or more invalid indicators.
In some implementations, the order is determined such that an invalid indicator with a smaller last OFDM symbol index corresponds to a candidate transmission occasion with a smaller index or a more significant bit of the feedback information as compared to another invalid indicator in the second parameter set.
In some implementations, the communication device is a user device or a base station.
The implementations as discussed above will apply to a wireless communication.
It is intended that the specification, together with the drawings, be considered exemplary only, where exemplary means an example and, unless otherwise stated, does not imply an ideal or a preferred embodiment. As used herein, the use of “or” is intended to include “and/or”, unless the context clearly indicates otherwise.
Some of the embodiments described herein are described in the general context of methods or processes, which may be implemented in one embodiment by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by computers in networked environments. A computer-readable medium may include removable and non-removable storage devices including, but not limited to, Read Only Memory (ROM), Random Access Memory (RAM), compact discs (CDs), digital versatile discs (DVD), etc. Therefore, the computer-readable media can include a non-transitory storage media. Generally, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer- or processor-executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.
Some of the disclosed embodiments can be implemented as devices or modules using hardware circuits, software, or combinations thereof. For example, a hardware circuit implementation can include discrete analog and/or digital components that are, for example, integrated as part of a printed circuit board. Alternatively, or additionally, the disclosed components or modules can be implemented as an Application Specific Integrated Circuit (ASIC) and/or as a Field Programmable Gate Array (FPGA) device. Some implementations may additionally or alternatively include a digital signal processor (DSP) that is a specialized microprocessor with an architecture optimized for the operational needs of digital signal processing associated with the disclosed functionalities of this application. Similarly, the various components or sub-components within each module may be implemented in software, hardware or firmware. The connectivity between the modules and/or components within the modules may be provided using any one of the connectivity methods and media that is known in the art, including, but not limited to, communications over the Internet, wired, or wireless networks using the appropriate protocols.
While this document contains many specifics, these should not be construed as limitations on the scope of an invention that is claimed or of what may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features that are described in this document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or a variation of a sub-combination. Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results.
Only a few implementations and examples are described and other implementations, enhancements and variations can be made based on what is described and illustrated in this disclosure.
This application is a continuation and claims priority to International Application No. PCT/CN2021/141854, filed on Dec. 28, 2021, the disclosure of which is hereby incorporated by reference herein in its entirety.
Number | Date | Country | |
---|---|---|---|
Parent | PCT/CN2021/141854 | Dec 2021 | WO |
Child | 18673152 | US |