WO2021229257A1

WO2021229257A1 - Apparatus and method of pusch transmission in shared spectrum

Info

Publication number: WO2021229257A1
Application number: PCT/IB2020/000724
Authority: WO
Inventors: Hao Lin
Original assignee: Orope France Sarl
Priority date: 2020-05-15
Filing date: 2020-05-15
Publication date: 2021-11-18

Abstract

An apparatus and a method of physical uplink shared channel (PUSCH) transmission in a shared spectrum are provided. The method of PUSCH transmission by a user equipment (UE) in a shared spectrum includes being configured by a base station with K PUSCH repetitions and N PUSCH resources and performing M PUSCH repetitions in M PUSCH resources of the N PUSCH resources, wherein K, M, and N are integers. This can provide a method of performing CG-PUSCH repetitions and a selection of redundancy version (RV) values.

Description

APPARATUS AND METHOD OF PUSCH TRANSMISSION IN SHARED SPECTRUM

BACKGROUND OF DISCLOSURE

1. Field of the Disclosure

[0001] The present disclosure relates to the field of communication systems, and more particularly, to an apparatus and a method of physical uplink shared channel (PUSCH) transmission in a shared spectrum, which can provide a good communication performance and high reliability.

2. Description of the Related Art

[0002] In an unlicensed band, an unlicensed spectrum is a shared spectrum. Communication equipments in different communication systems can use the unlicensed spectrum as long as the unlicensed meets regulatory requirements set by countries or regions on a spectrum. There is no need to apply for a proprietary spectrum authorization from a government.

[0003] In order to allow various communication systems that use the unlicensed spectrum for wireless communication to coexist friendly in the spectrum, some countries or regions specify regulatory requirements that must be met to use the unlicensed spectrum. For example, a communication device follows a listen before talk (LBT) procedure, that is, the communication device needs to perform a channel sensing before transmitting a signal on a channel. When an LBT outcome illustrates that the channel is idle, the communication device can perform signal transmission; otherwise, the communication device cannot perform signal transmission. In order to ensure fairness, once a communication device successfully occupies the channel, a transmission duration cannot exceed a maximum channel occupancy time (MCOT).

[0004] On an unlicensed carrier, for a channel occupation time obtained by a base station, it may share the channel occupation time to a user equipment (UE) for transmitting an uplink signal or an uplink channel. In other words, when the base station shares its own channel occupancy time with the UE, the UE can use an LBT mode with higher priority than that used by the UE itself to obtain the channel, thereby obtaining the channel with greater probability. LBT is also called channel access procedure. UE performs the channel access procedure before the transmission, if the channel access procedure is successful, i.e. the channel is sensed to be idle, the UE starts to perform the transmission. If the channel access procedure is not successful, i.e. the channel is sensed to be not idle, the UE cannot perform the transmission.

[0005] Up to now, a mechanism for a UE to perform configured grant (CG)- physical uplink shared channel (PUSCH) repetitions is still an open issue.

[0006] Therefore, there is a need for an apparatus and a method of physical uplink shared channel (PUSCH) transmission in a shared spectrum, which can solve issues in the prior art, provide a method of performing CG-PUSCH repetitions and a selection of redundancy version (RV) values.

SUMMARY

[0007] An object of the present disclosure is to propose an apparatus such as a user equipment (UE) and a method of physical uplink shared channel (PUSCH) transmission in a shared spectrum, which can solve issues in the prior art, provide a method of performing CG-PUSCH repetitions and a selection of redundancy version (RV) values.

[0008] In a first aspect of the present disclosure, a method of physical uplink shared channel (PUSCH) transmission by a user equipment (UE) in a shared spectrum includes being configured by a base station with K PUSCH repetitions and N PUSCH resources and performing M PUSCH repetitions in M PUSCH resources of the N PUSCH resources, wherein K, M, and N are integers.

[0009] In a second aspect of the present disclosure, a UE includes a memory, a transceiver, and a processor coupled to the memory and the transceiver. The processor is configured by a base station with K PUSCH repetitions and N PUSCH resources and the processor is configured to perform M PUSCH repetitions in M PUSCH resources of the N PUSCH resources, wherein K, M, and N are integers.

[0010] In a third aspect of the present disclosure, a non-transitory machine-readable storage medium has stored thereon instructions that, when executed by a computer, cause the computer to perform the above method.

[0011] In a fourth aspect of the present disclosure, a chip includes a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the above method.

[0012] In a fifth aspect of the present disclosure, a computer readable storage medium, in which a computer program is stored, causes a computer to execute the above method.

[0013] In a sixth aspect of the present disclosure, a computer program product includes a computer program, and the computer program causes a computer to execute the above method.

[0014] In a seventh aspect of the present disclosure, a computer program causes a computer to execute the above method.

BRIEF DESCRIPTION OF DRAWINGS

[0015] In order to more clearly illustrate the embodiments of the present disclosure or related art, the following figures will be described in the embodiments are briefly introduced. It is obvious that the drawings are merely some embodiments of the present disclosure, a person having ordinary skill in this field can obtain other figures according to these figures without paying the premise.

[0016] FIG. 1 is a block diagram of a user equipments (UE) and a base station (BS) (e.g., gNB) of communication in a communication network system according to an embodiment of the present disclosure.

[0017] FIG. 2 is a flowchart illustrating a method of communication of a UE according to an embodiment of the present disclosure.

[0018] FIG. 3 is a schematic diagram illustrating that a network (e.g., gNB) configures 14 CG-PUSCH resources (CG0-CG14), each resource contains 2 symbols according to an embodiment of the present disclosure.

[0019] FIG. 4 is a schematic diagram illustrating one example of fixed repetition bundle, whose location and length depend on configured CG-PUSCH resources N and configured repetition number K according to an embodiment of the present disclosure.

[0020] FIG. 5 is a schematic diagram illustrating that if a UE starts to transmit a first repetition in CG0, the UE can transmit K repetitions in the fixed repetition bundle, e.g. in repetition bundle 0 according to an embodiment of the present disclosure.

[0021] FIG. 6 is a schematic diagram illustrating an example of a repetition bundle 0 according to an embodiment of the present disclosure.

[0022] FIG. 7 is a schematic diagram illustrating that a fourth repetition is another repetition bundle is not allowed according to an embodiment of the present disclosure.

[0023] FIG. 8 is a schematic diagram illustrating an example of floating repetition bundle according to an embodiment of the present disclosure. [0024] FIG. 9 is a schematic diagram illustrating that an example of floating repetition bundle according to another embodiment of the present disclosure.

[0025] FIG. 10 is a schematic diagram illustrating that a UE is required to set RV=0 for a first repetition according to an embodiment of the present disclosure.

[0026] FIG. 11 is a schematic diagram illustrating that a first repetition is not mandated to be RV=0, but at least one repetition among (up to) K transmitted repetitions is set RV=0 according to an embodiment of the present disclosure.

[0027] FIG. 12 is a block diagram of a system for wireless communication according to an embodiment of the present disclosure.

DETAILED DESCRIPTION OF EMBODIMENTS

[0028] Embodiments of the present disclosure are described in detail with the technical matters, structural features, achieved objects, and effects with reference to the accompanying drawings as follows. Specifically, the terminologies in the embodiments of the present disclosure are merely for describing the purpose of the certain embodiment, but not to limit the disclosure.

[0029] New radio (NR) Release 15 configured grant (CG) uplink transmission:

[0030] In NR Releasel5, in order to support ultra-low latency and high reliable service, CG transmission is supported for uplink physical uplink shared channel (PUSCH) transmission. The concept of CG is that a base station configures uplink time frequency resources which are periodically present. The necessary information for a UE to prepare the PUSCH as well as for the base station to decode the PUSCH are configured semi-statically, e.g. transport block size (TBS), modulation coding scheme (MCS), redundancy version (RV), time frequency resources, periodicity and repetition times. Moreover, a hybrid automatic repeat request (HARQ) process identifier (ID) is bounded with the periodic time-frequency resources and periodicity. Once the UE has transmitted the CG-PUSCH in the configured resources, it will start a timer. Before the timer expires, if the UE received a scheduled downlink control information (DCI) scrambled with a particular radio network temporary identifier (RNTI) and the same HARQ process ID, the UE will understand that the previous HARQ process in CG-PUSCH has failed. Otherwise, the UE will consider the previous HARQ process in CG-PUSCH is successfully received by base-station.

[0031] CG in Release 16:

[0032] In Release 16 new radio-based access to unlicensed spectrum (NRU), tCG transmission is enhanced that the UE will include an uplink control information (CG-UCI) in each CG-PUSCH transmission, where the CG-UCI contains the HARQ process number, the new data indicator (NDI) and the redundancy version (RV). The NDI is used to indicate if the transmission in the CG-PUSCH is anew transmission or retransmission.

[0033] Up to now, a mechanism for a UE to perform CG-PUSCH repetitions is still an open issue. Some embodiments of the present disclosure provide a method of UE performing CG-PUSCH repetitions and a selection of RV values.

[0034] FIG. 1 illustrates that, in some embodiments, a user equipment (UE) 10 and abase station (BS) (e.g., gNB) 20 of communication in a communication network system 30 according to an embodiment of the present disclosure are provided. The communication network system 30 includes one or more UEs 10 of a cell and the BS 20. The UE 10 may include a memory 12, a transceiver 13, and a processor 11 coupled to the memory 12, the transceiver 13. The base station 20 may include a memory 22, a transceiver 23, and a processor 21 coupled to the memory 22, the transceiver 23. The processor 11 or 21 may be configured to implement proposed functions, procedures and/or methods described in this description. Layers of radio interface protocol may be implemented in the processor 11 or 21. The memory 12 or 22 is operatively coupled with the processor 11 or 21 and stores a variety of first information to operate the processor 11 or 21. The transceiver 13 or 23 is operatively coupled with the processor 11 or 21, and the transceiver 13 or 23 transmits and/or receives a radio signal.

[0035] The processor 11 or 21 may include application-specific integrated circuit (ASIC), other chipset, logic circuit and/or data processing device. The memory 12 or 22 may include read-only memory (ROM), random access memory (RAM), flash memory, memory card, storage medium and/or other storage device. The transceiver 13 or 23 may include baseband circuitry to process radio frequency signals. When the embodiments are implemented in software, the techniques described herein can be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The modules can be stored in the memory 12 or 22 and executed by the processor 11 or 21. The memory 12 or 22 can be implemented within the processor 11 or 21 or external to the processor 11 or 21 in which case those can be communicatively coupled to the processor 11 or 21 via various means as is known in the art.

[0036] In some embodiments, the processor 11 is configured by the base station 20 with K PUSCH repetitions and N PUSCH resources and the processor 11 is configured to perform M PUSCH repetitions in M PUSCH resources of the N PUSCH resources, wherein K, M, and N are integers. This can solve issues in the prior art, provide a method of performing CG-PUSCH repetitions and a selection of redundancy version (RV) values. In some embodiments, the processor 11 is configured with a CG retransmission timer (cg-RetrasnmissionTimer-rl6 or cg-RetrasnmissionTimer), which is used for Rel.16 user equipment. In some embodiments, the processor 11 is configured with a parameter, where the parameter indicates the repetition number K. In some embodiments, the parameter is repK, where repK is an integer and can configured to be 1 or greater than 1. In some embodiments, repK=l indicates 1 CG-PUSCH transmission without repetition. In some embodiments, repK> 1 indicates, UE is configured to transmit K CG-PUSCH transmissions (or K CG-PUSCH repetitions) in K PUSCH resources, where K is equal to repK. It is to note that in present disclosure, transmitting K CG-PUSCH repetitions in K CG-PUSCH resources is equivalent to transmitting K CG-PUSCH transmissions in K CG-PUSCH resources, respectively. It is to note that hereafter CG-PUSCH indicates a PUSCH transmission configured by a network or a base station, which is also known as configured grant. In present disclosure, PUSCH and CG-PUSCH are inter-changeable, unless explicitly explained. In some embodiments, a UE is configured to transmit PUSCH or CG-PUSCH in a shared spectrum, the CG retransmission timer is always provided. It is to note that in some embodiments of the present disclosure, if the CG retransmission timer is provided, it indicates operating in a shared spectrum. Hence, the condition of operation in a shared spectrum is equivalent to the CG retransmission timer that is provided in some embodiments of the present disclosure.

[0037] FIG. 2 illustrates a method 200 of physical uplink shared channel (PUSCH) transmission by a user equipment (UE) in a shared spectrum according to an embodiment of the present disclosure. In some embodiments, the method 200 includes: a block 202, being configured by a base station with K PUSCH repetitions and N PUSCH resources, and a block 204, performing M PUSCH repetitions in M PUSCH resources of the N PUSCH resources, wherein K, M, and N are integers. This can solve issues in the prior art, provide a method of performing CG-PUSCH repetitions and a selection of redundancy version (RV) values. In some embodiments, one PUSCH resource comprises one or more symbols in time domain.

[0038] In some embodiments, N is equal to or greater than K, and M is equal to or smaller than K. In some embodiments, the M PUSCH repetitions comprise M PUSCH transmissions in M consecutive PUSCH resources. In some embodiments, M consecutive PUSCH resources are physically consecutive in time domain without a gap, wherein a gap is at least one symbol. In some embodiments, at least two consecutive PUSCH resources of the M consecutive PUSCH resources are separated in time domain by the gap.

[0039] In some embodiments, the M PUSCH repetitions are corresponding to the same hybrid automatic repeat request (HARQ) process number and the same new data indicator (NDI) value. In some embodiments, a PUSCH transmission contains a CG-UCI, which includes a HARQ process number, a NDI value, and a RV value corresponding to the PUSCH transmission. In some embodiments, performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises performing a first PUSCH repetition in a first PUSCH resource. In some embodiments, the first PUSCH repetition comprises the earliest PUSCH repetition of the M PUSCH repetitions. In some embodiments, the first PUSCH resource is relevant to K and/or N. In some embodiments, the first PUSCH resource is pre-configured. In some embodiments, the first PUSCH resource is one of the N PUSCH resources. [0040] In some embodiments, the first PUSCH resource is relevant to a channel access procedure outcome. In some embodiments, the first PUSCH resource, in which the first PUSCH repetition is transmitted, is allowed by a channel access procedure. In some embodiments, performing the transmission of the first PUSCH repetition in the first PUSCH resource is allowed by the channel access procedure and comprises performing the channel access procedure of the first PUSCH resource and sensing that a channel of the first PUSCH resource is idle. In details, in one embodiment, the channel access procedure is performed before the first symbol of the first PUSCH resource. In details, in one embodiment, when the channel is sensed to be idle for the transmission in the first PUSCH resource, the channel access procedure is terminated before the first symbol of the first PUSCH resource, or is terminated at latest at the start of the first symbol of the first PUSCH resource.

[0041] In some embodiments, performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises performing a second PUSCH repetition in a second PUSCH resource. In some embodiments, the second PUSCH repetition comprises the last PUSCH repetition of the M PUSCH repetitions. In some embodiments, the second PUSCH resource is earlier than a third PUSCH resource, the third PUSCH resource is relevant to the first PUSCH resource and/or K and/or N. In details, in one embodiment, the third PUSCH resource is the earliest PUSCH resource in the next repetition bundle. In details, in one embodiment, the M PUSCH repetitions should happen in the same repetition bundle and should not across different repetition bundle. In this example, the repetition bundles are fixed with regard to the configured PUSCH resources. In some embodiments performing the M PUSCH repetitions in the M PUSCH resources indicates that the M PUSCH repetitions are consecutive in time domain. It means that the M PUSCH repetitions are transmitted in M consecutive PUSCH resources and there is no gap between M PUSCH resources. Optionally, performing the M PUSCH repetitions in the M PUSCH resources indicates that the M PUSCH repetitions are transmitted in the M consecutive PUSCH resources in ordering, where the M PUSCH resources are not physically consecutive in time domain. Some embodiments of the present disclosure cover both cases.

[0042] In some embodiments, the second PUSCH resource or the third PUSCH resource is pre-configured. In some embodiments, the second PUSCH resource or the third PUSCH resource is one of the N PUSCH resources. In some embodiments, the second PUSCH resource or the third PUSCH resource is relevant to a channel access procedure outcome. In some embodiments, the second PUSCH resource or the third PUSCH resource is allowed by a channel access procedure for transmission. In some embodiments, performing the transmission of the second PUSCH resource or the third PUSCH resource allowed by the channel access procedure comprises performing the channel access procedure of the second PUSCH resource or the third PUSCH resource and sensing that a channel of the second PUSCH resource or the third PUSCH resource is idle.

[0043] In some embodiments, performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting a first redundancy version (RV) value for PUSCH of the first PUSCH repetition. In some embodiments the UE selects a second RV value for a fourth PUSCH repetition by its own, where the second RV value is at least one of the following: 0 or 1 or 2 or 3. In some embodiments the fourth PUSCH repetition is one of the M PUSCH repetitions, and the fourth PUSCH repetition is different from the first PUSCH repetition. In some embodiments performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting the first RV value for a fifth PUSCH repetition, wherein the fifth PUSCH repetition is one of the M PUSCH repetitions.

[0044] In some embodiments, performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting at least one redundancy version (RV) value for at least one PUSCH repetition of the M PUSCH repetitions. In some embodiments, the first RV value or the at least one RV value is pre-defined. In some embodiments, the first RV value or the at least one RV value comprises at least one of the following: RV of the first RV value or the at least one RV value is equal to 0 or the RV of the first RV value or the at least one RV value is equal to 3.

[0045] FIG. 3 illustrates that a network (e.g., gNB) configures 14 CG-PUSCH resources (CG0-CG14), each resource contains 2 symbols according to an embodiment of the present disclosure. FIG. 3 illustrates that, in some embodiments, a UE is configured by the network with one or more resources for configured grant physical uplink shared channel (CG-PUSCH) transmissions, the embodiment calls them CG-PUSCH resources. Each CG-PUSCH resource contains one or more symbols in time domain and one or more resource blocks in frequency domain. The one or more CG-PUSCH resources are consecutive in time domain as illustrated in FIG. 3, where CG0-CG13 represent the 14 CG-PUSCH resources in time domain, and each CG-PUSCH resource can contain further one or more symbols. The 14 CG-PUSCH resources are consecutive in time. Note that these 14 CG-PUSCH resources may cross one or more slots. FIG. 3 illustrates that, in some embodiments, each CG-PUSCH resource contains two symbols, and one slot contains 14 symbols. Optionally, the 14 CG-PUSCH resources are not physically consecutive in time domain. It indicates that at least two CG-PUSCH resources are separated by at least one symbol in time domain that is not configured for CG-PUSCH transmission.

[0046] FIG. 4 is a schematic diagram illustrating one example of fixed repetition bundle, whose location and length depend on configured CG-PUSCH resources N and configured repetition number K according to an embodiment of the present disclosure. FIG. 4 illustrates that, in some embodiments, at the same time, it is assume that the UE is also configured to perform repetitions for CG-PUSCH transmission, where the repetition number is configured as K. It means that the UE will perform K CG-PUSCH repetitions for a transport block. Here this embodiment defines that UE perform K repetitions means that the UE will transmit K CG-PUSCH transmissions, where each CG-PUSCH contains a CG-UCI, and the CG-UCI contains HARQ process number, NDI and RV. For K CG-PUSCH repetitions, the HARQ process number and the NDI for the respective CG-PUSCH, are the same; while the RV may be different or same. In what follows, some embodiments present a method for the UE to set the RV value, where the possible RV values are 0, 1, 2, 3. When a UE performs K CG-PUSCH repetitions, the UE transmits K CP-PUSCH repetitions in K consecutive CG-PUSCH resources, where the K CG-PUSCH resources may be consecutive in time domain without a gap, or there may be gaps between K CG-PUSCH resources. The gap is at least one symbol. [0047] FIG. 4 illustrates that, in some embodiments, there are several options to perform repetition. In the following we take K=4 as an example. The first option uses a fixed repetition bundle method. A repetition bundle is a K CG- PUSCH resources, e.g. in an example, a repetition bundle is 4 CG-PUSCH resources as illustrated in FIG. 4. Where 14 CG-PUSCH resources are divided into 4 repetition bundles, thus the starting location and the duration of the repetition bundle is fixed with respect to the configured CG-PUSCH resources and K value.

[0048] FIG. 5 is a schematic diagram illustrating that if a UE starts to transmit a first repetition in the first CG- PUSCH resource (CG0), the UE can transmit K repetitions in the fixed repetition bundle, e.g. in repetition bundle 0 according to an embodiment of the present disclosure. FIG. 5 illustrates that, in some embodiments, with this option, the UE can only perform up to K repetitions within the same bundle. For instance, if the UE starts to transmit the first repetition in CG0, then the UE shall complete the K (K=4) repetitions within the repetition bundle 0 and all the K CG- PUSCH transmissions are in consecutive CG-PUSCH resources, as illustrated in FIG. 5.

[0049] FIG. 6 is a schematic diagram illustrating an example of a repetition bundle 0 according to an embodiment of the present disclosure. FIG. 7 is a schematic diagram illustrating that a fourth repetition is another repetition bundle is not allowed according to an embodiment of the present disclosure. FIG. 6 illustrates that, in some embodiments, in the repetition bundle 0, if the UE misses the transmission occasion for CG0 (e.g. due to channel access failure or if the channel is sensed busy by the channel access procedure), the UE can maximally transmit 3 repetitions to maintain all repetitions in the same repetition bundle. On the other hand, if the channel access procedure performed by the UE for CG0 is not successful (e.g. the channel is sensed busy), potentially the UE can still transmit 3 repetitions in the repetition bundle 0 as illustrated in FIG. 6. This means that the repetitions across repetition bundles is not allowed for example FIG. 7, where transmitting repetitions over two repetition bundles is not allowed.

[0050] FIG. 8 is a schematic diagram illustrating an example of floating repetition bundle according to an embodiment of the present disclosure. FIG. 9 is a schematic diagram illustrating that an example of floating repetition bundle according to another embodiment of the present disclosure. FIG. 8 illustrates that, in some embodiments, an example of floating repetition bundle, where the repetition bundle starting location depends on the channel access procedure outcome. When the channel access is successful, the UE starts to transmit the first repetition, the repetition bundle starts, too. FIG. 9 illustrates that, in some embodiments, for the floating repetition bundle, if there are M remaining CG-PUSCH resources (M<K) after the channel access procedure is successful, the UE continues transmitting M repetitions; optionally, if there are M remaining CG-PUSCH resources (M<K) after the channel access procedure is successful, the UE cancels the CG-PUSCH transmission in the M remaining CG-PUSCH resources. In our example, M=3, K=4. FIG. 8 and FIG. 9 illustrate that, in some embodiments, optionally, the network can mandate the UE to transmit always K repetitions. This means that FIG. 6 is not allowed. Thus, if the UE cannot initiate the first repetition in CG0 in the repetition bundle 0 (due to CG0 is not sensed to be idle by the channel access procedure), the UE has to wait for the next repetition bundle (repetition bundle 1) to initiate the first repetition from CG4 in our example. This option implies that the first repetition is always starting from a fixed CG-PUSCH resource for each repetition bundle. Moreover, it also means that in this case the UE cannot transmit in repetition bundle 3 because there are not enough CG-PUSCH resources to accomplish K repetitions.

[0051] FIG. 8 and FIG. 9 illustrate that, in some embodiments, alternatively, a floating repetition bundle method is used, where the starting location of the repetition bundle is not fixed but it depends on the outcome of the channel access procedure performed by the UE. In this case, there is no repetition bundle number, and once the channel access procedure is successful and the UE starts to transmit the first repetition, and the repetition bundle starts too. As illustrated in FIG. 8, where each CG-PUSCH can be used to start transmitting the first repetition as long as the channel access procedure is successful. And the UE transmits K repetitions in K consecutive CG-PUSCH resources. Optionally, in case the remaining CG-PUSCH resources are not enough to complete K repetitions, for example in FIG. 9, where the remaining number of the CG-PUSCH resources is 3 while K=4, the UE may apply the following two options. In option 1, the UE cancels the transmission in the remaining 3 CG-PUSCH resources, i.e. once the UE starts a repetition bundle, the transmitted number of repetitions in the bundle is always K. Alternatively in option 2, the UE can still transmit in the remaining resources, i.e., the UE transmits the repetitions and initiates a repetition bundle, in which the number of repetitions is smaller than K. Optionally, the fixing repetition bundle or the floating repetition bundle can be configured by the network.

[0052] FIG. 10 is a schematic diagram illustrating that a UE is required to set RV=0 for a first repetition according to an embodiment of the present disclosure. FIG. 10 illustrates that, in some embodiments, as presented previously, when a UE transmits a CG-PUSCH, it also includes a CG-UCI, which comprises RV value. In the following, some embodiments present how a UE selects the RV value. Note that the presented method works together with any of the previous examples. When a UE is transmitting CG repetitions in a repetition bundle. The repetition bundle can contain up to K repetitions (either fixed bundle or floating bundle can be considered), and the up to K repetitions are in consecutive CG-PUSCH resources. For RV value selection, the UE is mandated to set always RV=0 for the first repetition, and then the UE can select the same or different RV values by itself for the remaining repetitions. FIG. 10 gives an example that if the UE passes the channel access for CG0 resource, the UE starts to transmit the first repetition in CG0 and the RV is set to 0 for the first repetition, then the UE can freely select the RV value for the remaining 3 repetitions. In FIG. 10, RV=x means that the RV value can be selected by the UE freely without any restrictions, note that the possible RV values are x=0,l,2 or 3. In case the channel in CG0 is not idle sensed by the channel access procedure, the UE holds the transmission in CG0, and waits for the next CG-PUSCH transmission occasion, i.e. in CGI. If the channel for CGI is idle determined by the channel access procedure, the UE starts to transmit the first repetition in CGI and continues up to K repetitions, which ends in CG4, then the RV is set to 0 for the first repetition in CGI. The advantage of this method is that the transmission with RV=0 is self-decodable by the receiver (i.e. the base station), thus if the base station can successfully decode the CG-PUSCH with only the first repetition, the network can skip decoding the remaining repetitions for saving the computational complexity; moreover the network can inform the UE to stop the repetition as soon as possible. Therefore, the method requires the UE to transmit the CG- PUSCH with RV=0 in the first repetition.

[0053] FIG. 11 is a schematic diagram illustrating that a first repetition is not mandated to be RV=0, but at least one repetition among (up to) K transmitted repetitions is set RV=0 according to an embodiment of the present disclosure. FIG. 11 illustrates that, in some embodiments, on the other hand, the CG-PUSCH preparation is often done before the channel access procedure. Therefore, if the UE has prepared a CG-PUSCH (first repetition) with RV=0 in CG0 and a CG-PUSCH (second repetition) with RV=1 in CGI, but due to channel access failure in CG0, the UE has to re-prepare a new CG-PUSCH with RV=0 in CGI. This might require a very quick signal processing capability for the UE. In this case, not all the UEs in the market can support such advanced implementation. Thus, an alternative option is that a UE transmits one or more repetitions in consecutive CG-PUSCH resources in a bundle, for which at least one repetition should contain a CG-PUSCH with RV=0. This means that it is not allowed that a UE transmits one or more repetitions (up to K repetitions) in a bundle, and none of the repetitions contains CG-PUSCH with RV=0. With this option, the previous requirement (i.e. RV=0 should be used for the first repetition) is loosen. As shown in FIG 11, if a UE prepared 4 repetitions with RV=0, 1, 2, 3 for 4 consecutive repetitions, before the channel access procedure, and if it turns out that the channel access is not successful for transmission in CG0, the UE can still have time to prepare a CG-PUSCH with RV=0 in CG4 resource. Compared to the option in FIG. 10, , this alternative relieves the implementation pressure or challenge for user devices implementation. Optionally in FIG. 10 and FIG. 11, where RV=0 may also be replaced with RV=3.

[0054] Optionally, to keep the advantages of both options, the network can envision two type of capability UEs in future market, e.g. moderate UE and advanced UE. The advanced UE can support very short processing time so that the UE can support the first option. While the moderate UE can only support the second option. In this case the respective UE can report their capability to the network. Then the network can receive the CG-PUSCH according to their reported capability. Moreover, once reported, the advanced UE will use the first option to select the RV for the CG repetitions and the moderate UE will use the second option to select RV for the CG repetitions.

[0055] Commercial interests for some embodiments are as follows. 1. solving issues in the prior art. 2. providing a method of performing CG-PUSCH repetitions and a selection of redundancy version (RV) values. 3. providing a good communication performance. 4. providing a high reliability. 5. Some embodiments of the present disclosure are used by 5G-NR chipset vendors, V2X communication system development vendors, automakers including cars, trains, trucks, buses, bicycles, moto-bikes, helmets, and etc., drones (unmanned aerial vehicles), smartphone makers, communication devices for public safety use, AR/VR device maker for example gaming, conference/seminar, education purposes. Some embodiments of the present disclosure are a combination of “techniques/processes” that can be adopted in 3GPP specification to create an end product. Some embodiments of the present disclosure could be adopted in the 5G NR unlicensed band communications. Some embodiments of the present disclosure propose technical mechanisms.

[0056] FIG. 12 is a block diagram of an example system 700 for wireless communication according to an embodiment of the present disclosure. Embodiments described herein may be implemented into the system using any suitably configured hardware and/or software. FIG. 12 illustrates the system 700 including a radio frequency (RF) circuitry 710, a baseband circuitry 720, an application circuitry 730, a memory/storage 740, a display 750, a camera 760, a sensor 770, and an input/output (I/O) interface 780, coupled with each other at least as illustrated. The application circuitry 730 may include a circuitry such as, but not limited to, one or more single-core or multi-core processors. The processors may include any combination of general-purpose processors and dedicated processors, such as graphics processors, application processors. The processors may be coupled with the memory/storage and configured to execute instructions stored in the memory/storage to enable various applications and/or operating systems running on the system.

[0057] The baseband circuitry 720 may include circuitry such as, but not limited to, one or more single-core or multi-core processors. The processors may include a baseband processor. The baseband circuitry may handle various radio control functions that enables communication with one or more radio networks via the RF circuitry. The radio control functions may include, but are not limited to, signal modulation, encoding, decoding, radio frequency shifting, etc. In some embodiments, the baseband circuitry may provide for communication compatible with one or more radio technologies. For example, in some embodiments, the baseband circuitry may support communication with an evolved universal terrestrial radio access network (EUTRAN) and/or other wireless metropolitan area networks (WMAN), a wireless local area network (WLAN), a wireless personal area network (WPAN). Embodiments in which the baseband circuitry is configured to support radio communications of more than one wireless protocol may be referred to as multi-mode baseband circuitry. [0058] In various embodiments, the baseband circuitry 720 may include circuitry to operate with signals that are not strictly considered as being in a baseband frequency. For example, in some embodiments, baseband circuitry may include circuitry to operate with signals having an intermediate frequency, which is between a baseband frequency and a radio frequency. The RF circuitry 710 may enable communication with wireless networks using modulated electromagnetic radiation through a non-solid medium. In various embodiments, the RF circuitry may include switches, filters, amplifiers, etc. to facilitate the communication with the wireless network. In various embodiments, the RF circuitry 710 may include circuitry to operate with signals that are not strictly considered as being in a radio frequency. For example, in some embodiments, RF circuitry may include circuitry to operate with signals having an intermediate frequency, which is between a baseband frequency and a radio frequency.

[0059] In various embodiments, the transmitter circuitry, control circuitry, or receiver circuitry discussed above with respect to the user equipment, eNB, or gNB may be embodied in whole or in part in one or more of the RF circuitry, the baseband circuitry, and/or the application circuitry. As used herein, “circuitry” may refer to, be part of, or include an Application Specific Integrated Circuit (ASIC), an electronic circuit, a processor (shared, dedicated, or group), and/or a memory (shared, dedicated, or group) that execute one or more software or firmware programs, a combinational logic circuit, and/or other suitable hardware components that provide the described functionality. In some embodiments, the electronic device circuitry may be implemented in, or functions associated with the circuitry may be implemented by, one or more software or firmware modules. In some embodiments, some or all of the constituent components of the baseband circuitry, the application circuitry, and/or the memory/storage may be implemented together on a system on a chip (SOC). The memory/storage 740 may be used to load and store data and/or instructions, for example, for system. The memory/storage for one embodiment may include any combination of suitable volatile memory, such as dynamic random access memory (DRAM)), and/or non-volatile memory, such as flash memory.

[0060] In various embodiments, the FO interface 780 may include one or more user interfaces designed to enable user interaction with the system and/or peripheral component interfaces designed to enable peripheral component interaction with the system. User interfaces may include, but are not limited to a physical keyboard or keypad, a touchpad, a speaker, a microphone, etc. Peripheral component interfaces may include, but are not limited to, a non volatile memory port, a universal serial bus (USB) port, an audio jack, and a power supply interface. In various embodiments, the sensor 770 may include one or more sensing devices to determine environmental states and/or location first information related to the system. In some embodiments, the sensors may include, but are not limited to, a gyro sensor, an accelerometer, a proximity sensor, an ambient light sensor, and a positioning unit. The positioning unit may also be part of, or interact with, the baseband circuitry and/or RF circuitry to communicate with components of a positioning network, e.g., a global positioning system (GPS) satellite.

[0061] In various embodiments, the display 750 may include a display, such as a liquid crystal display and a touch screen display. In various embodiments, the system 700 may be a mobile computing device such as, but not limited to, a laptop computing device, a tablet computing device, a netbook, an ultrabook, a smartphone, a AR/VR glasses, etc. In various embodiments, system may have more or less components, and/or different architectures. Where appropriate, methods described herein may be implemented as a computer program. The computer program may be stored on a storage medium, such as a non-transitory storage medium.

[0062] A person having ordinary skill in the art understands that each of the units, algorithm, and steps described and disclosed in the embodiments of the present disclosure are realized using electronic hardware or combinations of software for computers and electronic hardware. Whether the functions run in hardware or software depends on the state of application and design requirement for a technical plan. A person having ordinary skill in the art can use different ways to realize the function for each specific application while such realizations should not go beyond the scope of the present disclosure. It is understood by a person having ordinary skill in the art that he/she can refer to the working processes of the system, device, and unit in the above-mentioned embodiment since the working processes of the above-mentioned system, device, and unit are basically the same. For easy description and simplicity, these working processes will not be detailed.

[0063] It is understood that the disclosed system, device, and method in the embodiments of the present disclosure can be realized with other ways. The above-mentioned embodiments are exemplary only. The division of the units is merely based on logical functions while other divisions exist in realization. It is possible that a plurality of units or components are combined or integrated in another system. It is also possible that some characteristics are omitted or skipped. On the other hand, the displayed or discussed mutual coupling, direct coupling, or communicative coupling operate through some ports, devices, or units whether indirectly or communicatively by ways of electrical, mechanical, or other kinds of forms.

[0064] The units as separating components for explanation are or are not physically separated. The units for display are or are not physical units, that is, located in one place or distributed on a plurality of network units. Some or all of the units are used according to the purposes of the embodiments. Moreover, each of the functional units in each of the embodiments can be integrated in one processing unit, physically independent, or integrated in one processing unit with two or more than two units.

[0065] If the software function unit is realized and used and sold as a product, it can be stored in a readable storage medium in a computer. Based on this understanding, the technical plan proposed by the present disclosure can be essentially or partially realized as the form of a software product. Or, one part of the technical plan beneficial to the conventional technology can be realized as the form of a software product. The software product in the computer is stored in a storage medium, including a plurality of commands for a computational device (such as a personal computer, a server, or a network device) to run all or some of the steps disclosed by the embodiments of the present disclosure. The storage medium includes a USB disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a floppy disk, or other kinds of media capable of storing program codes.

[0066] While the present disclosure has been described in connection with what is considered the most practical and preferred embodiments, it is understood that the present disclosure is not limited to the disclosed embodiments but is intended to cover various arrangements made without departing from the scope of the broadest interpretation of the appended claims.

Claims

What is claimed is:

1. A method of physical uplink shared channel (PUSCH) transmission by a user equipment (UE) in a shared spectrum, comprising: being configured by a base station with K PUSCH repetitions and N PUSCH resources; and performing M PUSCH repetitions in M PUSCH resources of the N PUSCH resources, wherein K, M, and N are integers.

2. The method of claim 1, wherein N is equal to or greater than K, and M is equal to or smaller than K.

3. The method of claim 1 or 2, wherein the M PUSCH repetitions comprise M PUSCH transmissions in M consecutive PUSCH resources.

4. The method of claim 3, wherein M consecutive PUSCH resources are physically consecutive in time domain without a gap, wherein a gap is at least one symbol.

5. The method of claim 3 wherein at least two consecutive PUSCH resources of the M consecutive PUSCH resources are separated in time domain by the gap.

6. The method of any one of claims 1 to 5, wherein the M PUSCH repetitions are corresponding to a same hybrid automatic repeat request (HARQ) process number and a same new data indicator (NDI) value.

7. The method of any one of claims 1 to 6, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises performing a first PUSCH repetition in a first PUSCH resource.

8. The method of claim 7, wherein the first PUSCH repetition comprises the earliest PUSCH repetition of the M PUSCH repetitions.

9. The method of claim 7 or 8, wherein the first PUSCH resource is relevant to K and/or N.

10. The method of any one of claims 7 to 9, wherein the first PUSCH resource is pre-configured.

11. The method of any one of claims 7 to 10, wherein the first PUSCH resource is one of the N PUSCH resources.

12. The method of any one of claims 7 to 11, wherein the first PUSCH resource is relevant to a channel access procedure outcome.

13. The method of claim 12, wherein the first PUSCH resource is allowed by the channel access procedure for transmission.

14. The method of claim 13, wherein performing the transmission of the first PUSCH resource allowed by the channel access procedure comprises performing the channel access procedure of the first PUSCH resource and sensing that a channel of the first PUSCH resource is idle.

15. The method of any one of claims 1 to 14, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises performing a second PUSCH repetition in a second PUSCH resource.

16. The method of claim 15, wherein the second PUSCH repetition comprises the last PUSCH repetition of the M PUSCH repetitions.

17. The method of claim 15 or 16, wherein the second PUSCH resource is earlier than a third PUSCH resource, the third PUSCH resource is relevant to the first PUSCH resource and/or K and/or N.

18. The method of any one of claims 15 to 17, wherein the second PUSCH resource or the third PUSCH resource is pre-configured.

19. The method of any one of claims 15 to 18, wherein the second PUSCH resource or the third PUSCH resource is one of the N PUSCH resources.

20. The method of claim 19, wherein the second PUSCH resource or the third PUSCH resource is relevant to a channel access procedure outcome.

21. The method of claim 19 or 20, wherein the second PUSCH resource or the third PUSCH resource is allowed by a channel access procedure for transmission.

22. The method of claim 21, wherein performing the transmission of the second PUSCH resource or the third PUSCH resource allowed by the channel access procedure comprises performing the channel access procedure of the second PUSCH resource or the third PUSCH resource and sensing that a channel of the second PUSCH resource or the third PUSCH resource is idle.

23. The method of any one of claims 7 to 22, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting a first redundancy version (RV) value for the first PUSCH repetition.

24. The method of claim 23, wherein the UE selects a second RV value for a fourth PUSCH repetition by its own, where the second RV value is at least one of the following: 0 or 1 or 2 or 3.

25. The method of claim 24, wherein the fourth PUSCH repetition is one of the M PUSCH repetitions, and the fourth PUSCH repetition is different from the first PUSCH repetition.

26. The method of any one of claims 7 to 25, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting the first RV value for a fifth PUSCH repetition, wherein the fifth PUSCH repetition is one of the M PUSCH repetitions.

27. The method of any one of claims 1 to 26, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting at least one redundancy version (RV) value for PUSCH of at least one PUSCH repetition of the M PUSCH repetitions.

28. The method of any one of claims 23 to 27, wherein the first RV value or the at least one RV value is pre-defined.

29. The method of any one of claims 23 to 28, wherein the first RV value or the at least one RV value comprises at least one of the following: RV of the first RV value or the at least one RV value is equal to 0 or the RV of the first RV value or the at least one RV value is equal to 3.

30. The method of any one of claims 1 to 29, wherein the UE is configured with a CG retransmission timer (cg- RetransmissionTimer-rl6 or cg-RetrasnmissionTimer).

31. A user equipment (UE), comprising: a memory; a transceiver; and a processor coupled to the memory and the transceiver; wherein the processor is configured by a base station with K PUSCH repetitions and N PUSCH resources; and the processor is configured to perform M PUSCH repetitions in M PUSCH resources of the N PUSCH resources, wherein K, M, and N are integers.

32. The UE of claim 31, wherein N is equal to or greater than K, and M is equal to or smaller than K.

33. The UE of claim 31 or 32, wherein the M PUSCH repetitions comprise M PUSCH transmissions in M consecutive PUSCH resources.

34. The UE of claim 33, wherein M consecutive PUSCH resources are physically consecutive in time domain without a gap, wherein a gap is at least one symbol.

35. The UE of claim 33 wherein at least two consecutive PUSCH resources of the M consecutive PUSCH resources are separated in time domain by the gap.

36. The UE of any one of claims 31 to 35, wherein the M PUSCH repetitions are corresponding to a same hybrid automatic repeat request (HARQ) process number and a same new data indicator (NDI) value.

37. The UE of any one of claims 31 to 36, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises performing a first PUSCH repetition in a first PUSCH resource.

38. The UE of claim 37, wherein the first PUSCH repetition comprises the earliest PUSCH repetition of the M PUSCH repetitions.

39. The UE of claim 37 or 38, wherein the first PUSCH resource is relevant to K and/or N.

40. The UE of any one of claims 37 to 39, wherein the first PUSCH resource is pre-configured.

41. The UE of any one of claims 37 to 40, wherein the first PUSCH resource is one of the N PUSCH resources.

42. The UE of any one of claims 37 to 41, wherein the first PUSCH resource is relevant to a channel access procedure outcome.

43. The UE of claim 42, wherein the first PUSCH resource is allowed by the channel access procedure for transmission.

44. The UE of claim 43, wherein performing the transmission of the first PUSCH resource allowed by the channel access procedure comprises performing the channel access procedure of the first PUSCH resource and sensing that a channel of the first PUSCH resource is idle.

45. The UE of any one of claims 31 to 44, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises performing a second PUSCH repetition in a second PUSCH resource.

46. The UE of claim 45, wherein the second PUSCH repetition comprises the last PUSCH repetition of the M PUSCH repetitions.

47. The UE of claim 45 or 46, wherein the second PUSCH resource is earlier than a third PUSCH resource, the third PUSCH resource is relevant to the first PUSCH resource and/or K and/or N.

48. The UE of any one of claims 45 to 47, wherein the second PUSCH resource or the third PUSCH resource is pre configured.

49. The UE of any one of claims 45 to 48, wherein the second PUSCH resource or the third PUSCH resource is one of the N PUSCH resources.

50. The UE of claim 49, wherein the second PUSCH resource or the third PUSCH resource is relevant to a channel access procedure outcome.

51. The UE of claim 49 or 50, wherein the second PUSCH resource or the third PUSCH resource is allowed by a channel access procedure for transmission.

52. The UE of claim 51, wherein performing the transmission of the second PUSCH resource or the third PUSCH resource allowed by the channel access procedure comprises performing the channel access procedure of the second PUSCH resource or the third PUSCH resource and sensing that a channel of the second PUSCH resource or the third PUSCH resource is idle.

53. The UE of any one of claims 37 to 52, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting a first redundancy version (RV) value for the first PUSCH repetition.

54. The UE of claim 53, wherein the UE selects a second RV value for a fourth PUSCH repetition by its own, where the second RV value is at least one of the following: 0 or 1 or 2 or 3.

55. The UE of claim 54, wherein the fourth PUSCH repetition is one of the M PUSCH repetitions, and the fourth PUSCH repetition is different from the first PUSCH repetition.

56. The UE of any one of claims 37 to 55, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting the first RV value for a fifth PUSCH repetition, wherein the fifth PUSCH repetition is one of the M PUSCH repetitions.

57. The UE of any one of claims 31 to 56, wherein performing the M PUSCH repetitions in the M PUSCH resources of the N PUSCH resources comprises setting at least one redundancy version (RV) value for PUSCH of at least one PUSCH repetition of the M PUSCH repetitions.

58. The UE of any one of claims 53 to 57, wherein the first RV value or the at least one RV value is pre-defined.

59. The UE of any one of claims 53 to 58, wherein the first RV value or the at least one RV value comprises at least one of the following: RV of the first RV value or the at least one RV value is equal to 0 or the RV of the first RV value or the at least one RV value is equal to 3.

60. The UE of any one of claims 31 to 59, wherein the UE is configured with a CG retransmission timer (cg- RetransmissionTimer-rl6 or cg-RetrasnmissionTimer).

61. A non-transitory machine-readable storage medium having stored thereon instructions that, when executed by a computer, cause the computer to perform the method of any one of claims 1 to 30.

62. A chip, comprising: a processor, configured to call and run a computer program stored in a memory, to cause a device in which the chip is installed to execute the method of any one of claims 1 to 30.

63. A computer readable storage medium, in which a computer program is stored, wherein the computer program causes a computer to execute the method of any one of claims 1 to 30.

64. A computer program product, comprising a computer program, wherein the computer program causes a computer to execute the method of any one of claims 1 to 30.

65. A computer program, wherein the computer program causes a computer to execute the method of any one of claims 1 to 30.