Embodiments of the present application relate to wireless communication technology, especially to a method and an apparatus for mapping physical uplink shared channel (PUSCH) repetitions.
New radio (NR) R16 introduced a new type of PUSCH repetition scheme, i.e., PUSCH repetition type B transmission, wherein multiple actual repetitions can be in one slot.
In NR R17, it is proposed to identify and specify features to improve reliability and robustness for channels other than physical downlink shared channel (PDSCH), which are: physical downlink control channel (PDCCH), PUSCH, and physical uplink control channel (PUCCH), using multiple transmission reception points (TRP) and/or multi-panel, with Rel.16 reliability features. Specifically, regarding PUSCH, PUSCH repetitions with multiple beams, or multiple TRPs can utilize the spatial diversity of multiple beams or TRPs of PUSCH transmission to increase the reliability and robustness. However, it is not determined how to map the repetitions of PUSCH repetition type B transmission.
Therefore, it is desirable to provide a technical solution to map the repetitions of PUSCH repetition type B.
An embodiment of the present application provides a method, which includes: receiving configuration information indicating a mapping pattern of a plurality of spatial relation information and a number of nominal PUSCH repetitions of a PUSCH transmission using the plurality of spatial relation information; determining a plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the number of the nominal PUSCH repetitions; and transmitting the plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the mapping pattern and a mapping scheme, wherein the mapping scheme is one of: beam mapping per slot, beam mapping per nominal repetition and beam mapping per actual repetition.
Another embodiment of the present application provides a method, which includes: transmitting configuration information indicating a mapping pattern of a plurality of spatial relation information and a number of nominal PUSCH repetitions of a PUSCH transmission using the plurality of spatial relation information; determining a plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the number of the nominal PUSCH repetitions; and receiving the plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the mapping pattern and a mapping scheme, wherein the mapping scheme is one of: beam mapping per slot, beam mapping per nominal repetition and beam mapping per actual repetition.
Yet another embodiment of the present application provides an apparatus, comprising: at least one non-transitory computer-readable medium having stored thereon computer-executable instructions; at least one receiving circuitry; at least one transmitting circuitry; and at least one processor coupled to the at least one non-transitory computer-readable medium, the at least one receiving circuitry and the at least one transmitting circuitry. The computer-executable instructions can cause the at least one processor to implement a method, which includes: receiving configuration information indicating a mapping pattern of a plurality of spatial relation information and a number of nominal PUSCH repetitions of a PUSCH transmission using the plurality of spatial relation information; determining a plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the number of the nominal PUSCH repetitions; and transmitting the plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the mapping pattern and a mapping scheme, wherein the mapping scheme is one of: beam mapping per slot, beam mapping per nominal repetition and beam mapping per actual repetition.
Still another embodiment of the present application provides an apparatus, comprising: at least one non-transitory computer-readable medium having stored thereon computer-executable instructions; at least one receiving circuitry; at least one transmitting circuitry; and at least one processor coupled to the at least one non-transitory computer-readable medium, the at least one receiving circuitry and the at least one transmitting circuitry. The computer-executable instructions can cause the at least one processor to implement a method, which includes: transmitting configuration information indicating a mapping pattern of a plurality of spatial relation information and a number of nominal PUSCH repetitions of a PUSCH transmission using the plurality of spatial relation information; determining a plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the number of the nominal PUSCH repetitions; and receiving the plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the mapping pattern and a mapping scheme, wherein the mapping scheme is one of: beam mapping per slot, beam mapping per nominal repetition and beam mapping per actual repetition.
In order to describe the manner in which advantages and features of the present disclosure can be obtained, a description of the present disclosure is rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. These drawings depict only exemplary embodiments of the present disclosure and are not therefore intended to limit the scope of the present disclosure.
The detailed description of the appended drawings is intended as a description of the currently preferred embodiments of the present disclosure and is not intended to represent the only form in which the present disclosure may be practiced. It is to be understood that the same or equivalent functions may be accomplished by different embodiments that are intended to be encompassed within the spirit and scope of the present disclosure.
Reference will now be made in detail to some embodiments of the present disclosure, examples of which are illustrated in the accompanying drawings. To facilitate understanding, embodiments are provided under specific network architecture and new service scenarios, such as 3GPP 5G, 3GPP LTE Release 8 and so on. Persons skilled in the art know very well that, with the development of network architecture and new service scenarios, the embodiments in the present disclosure are also applicable to similar technical problems.
As shown in
The BS 101 may also be referred to as an access point, an access terminal, a base, a macro cell, a node-B, an enhanced node B (eNB), a gNB, a home node-B, a relay node, or a device, or described using other terminology used in the art. The BS 101 is generally part of a radio access network that may include a controller communicably coupled to the BS 101.
The UE 102 may include computing devices, such as desktop computers, laptop computers, personal digital assistants (PDAs), tablet computers, smart televisions (e.g., televisions connected to the Internet), set-top boxes, game consoles, security systems (including security cameras), vehicle on-board computers, network devices (e.g., routers, switches, and modems), or the like. According to an embodiment of the present application, the UE 102 may include a portable wireless communication device, a smart phone, a cellular telephone, a flip phone, a device having a subscriber identity module, a personal computer, a selective call receiver, or any other device that is capable of sending and receiving communication signals on a wireless network. In some embodiments, the UE 102 may include wearable devices, such as smart watches, fitness bands, optical head-mounted displays, or the like. Moreover, the UE 102 may be referred to as a subscriber unit, a mobile, a mobile station, a user, a terminal, a mobile terminal, a wireless terminal, a fixed terminal, a subscriber station, a user terminal, or a device, or described using other terminology used in the art.
The wireless communication system 100 is compatible with any type of network that is capable of sending and receiving wireless communication signals. For example, the wireless communication system 100 is compatible with a wireless communication network, a cellular telephone network, a time division multiple access (TDMA)-based network, a code division multiple access (CDMA)-based network, an orthogonal frequency division multiple access (OFDMA)-based network, an LTE network, a 3GPP-based network, a 3GPP 5G network, a satellite communications network, a high altitude platform network, and/or other communications networks.
For PUSCH, PUSCH repetitions with multiple beams or TRPs can utilize the spatial diversity of multiple beams or TRPs of PUSCH transmission, and thus can greatly increase the reliability and robustness of uplink data transmissions. Different from PUSCH repetition Type A, wherein a PUSCH transmission in a slot of a multi-slot PUSCH transmission is omitted according to the conditions in Clause 11.1 of [6, TS38.213], a new type of PUSCH repetition scheme, i.e., PUSCH repetition type B transmission is specified in NR R16.
Specifically, in PUSCH repetition type B, concepts “nominal repetition” and “actual repetition” are introduced so that multiple repetitions within one slot will be identified. According to TS 38.214, for PUSCH repetition Type B, the number of nominal repetitions is given by the parameter numberofrepetitions, for the nth nominal repetition, wherein the value of n ranges from 0 to numberofrepetitions-1, the starting slot, starting symbol, ending slot, and ending symbol of the nth nominal repetition are calculated as follows:
mod(S+n·L,Nsymbslot) (2)
mod(S+(n+1)·L−1,Nsymbslot) (4)
Wherein KS is the slot where the PUSCH transmission starts, and Nsymbslot is the number of symbols per slot, S is the starting symbol S relative to the start of the slot, and L is the number of consecutive symbols L counting from the symbol S allocated for each nominal repetition of a PUSCH repetition Type B transmission. S and L are respectively provided by the parameters: startSymbol and length of the indexed row of the resource allocation table.
Meanwhile, for PUSCH repetition Type B, among the starting symbol to the ending symbol, there might be one or more invalid symbols. The UE determines these invalid symbols for PUSCH repetition Type B transmission based on the following rules:
After determining the invalid symbol(s) for PUSCH repetition type B transmission for each nominal repetition, the remaining symbols are considered as potentially valid symbols for PUSCH repetition Type B transmission. If the number of potentially valid symbols for PUSCH repetition type B transmission is greater than zero for a nominal repetition, the nominal repetition consists of one or more actual repetitions, where each actual repetition consists of a consecutive set of potentially valid symbols that can be used for PUSCH repetition Type B transmission within a slot. An actual repetition with a single symbol is omitted except for the case of the number of consecutive symbols L is one, e.g., L=1. An actual repetition is omitted according to the conditions in Clause 11.1 of [6, TS38.213]. The redundancy version to be applied on the nth actual repetition (with the counting including the actual repetitions that are omitted) is determined according to table 6.1.2.1-2.
The above descriptions on nominal repetition and actual repetition are provided according to TS 38.214, which may be changed or updated as the evolution of 3GPP specifications or other related specifications/protocols, and thus should not be limited to the above.
However, since multiple slots may be used to transmit a PUSCH repetition Type B transmission while multiple actual PUSCH repetitions can be within a single slot, mapping repetitions of the PUSCH repetition Type B cannot be performed in a similar way to a slot level time-division multiplexing (TDM) scheme, i.e., the PDSCH ultra reliable low latency communications (URLLC) scheme 4. Given that, embodiments of the present application at least propose a technical solution of mapping PUSCH repetitions when multiple spatial relation information, which may represent beam in embodiments of the present application are configured to utilize the spatial diversity to increase the robustness and reliability.
In the exemplary method shown in
For example, for two spatial relationship information, e.g., spatial relation information #1, and spatial relation information #2, when the cyclical mapping pattern is enabled, the first and second spatial relationship information are applied to the first and second transmit units, respectively, and the same mapping pattern continues to the remaining transmit units. Accordingly, the cyclical mapping pattern might be #1 #2 #1 #2 #1 #2 #1 #2 . . . . When the sequential mapping pattern is enabled, the first spatial relationship information is applied to the first and second transmit units, and the second spatial relationship information is applied to the third and fourth transmit units, and the same TCI mapping pattern continues to the remaining transmit units. Accordingly, the sequential mapping pattern might be #1 #1 #2 #2 #1 #1 #2 #2 . . . .
In step 204, a plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the number of the nominal PUSCH repetitions may be determined by the UE.
In step 206, the plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the mapping pattern and a mapping scheme may be transmitted. The mapping scheme may be one of: beam mapping per slot, beam mapping per nominal repetition and beam mapping per actual repetition. In other words, the plurality of actual PUSCH repetitions are mapped to the plurality of spatial relation information based on the mapping pattern, e.g., the cyclical mapping pattern or the sequential mapping pattern, and also based on beam mapping per slots, beam mapping per nominal repetition, or beam mapping per actual repetition.
For example, in some embodiments of the present application, when the mapping scheme is beam mapping per slot, a UE may associate each slot of a plurality of allocated slots for the PUSCH transmission with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern, and transmit all actual PUSCH repetitions within each single slot using the corresponding spatial relation information associated with the single slot. More specific embodiments can refer to
In some other embodiments of the present application, when the mapping scheme is beam mapping per nominal repetition, the UE may associate each nominal PUSCH repetition of the PUSCH transmission with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern, and transmit all actual PUSCH repetitions within each single nominal PUSCH repetition using the corresponding spatial relation information associated with the single nominal PUSCH repetition. More specific embodiments can refer to
In yet some other embodiments of the present application, when the mapping scheme is beam mapping per actual repetition, the UE may associate each of the plurality of actual PUSCH repetitions with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Each of the plurality of actual PUSCH repetitions will be transmitted with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. More specific embodiments can refer to
Similarly, in the network side, in step 203, a plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the number of the nominal PUSCH repetitions may be determined in the network side, e.g., by the BS. In step 205, the BS may receive the plurality of actual PUSCH repetitions using the plurality of spatial relation information based on the mapping pattern and a mapping scheme. The mapping scheme adopted in the BS is consistent with that applied in the UE, and may be one of: beam mapping per slot, beam mapping per nominal repetition and beam mapping per actual repetition.
For example, in some embodiments of the present application, when the mapping scheme is beam mapping per slot, the BS may associate each slot of a plurality of allocated slots for the PUSCH transmission with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern, and receive all actual PUSCH repetitions within each single slot using the corresponding spatial relation information associated with the single slot.
In some other embodiments of the present application, when the mapping scheme is beam mapping per nominal repetition, the BS may associate each nominal PUSCH repetition of the PUSCH transmission with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern, and receive all actual PUSCH repetitions within each single nominal PUSCH repetition using the corresponding spatial relation information associated with the single nominal PUSCH repetition.
In yet some other embodiments of the present application, when the mapping scheme is beam mapping per actual repetition, the BS may associate each of the plurality of actual PUSCH repetitions with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Each of the plurality of actual PUSCH repetitions will be received with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern.
From the perspective of slots, actual repetition 3000 is in slot 1000, actual repetitions 3001 and 3002 are in slot 1001, actual repetitions 3003 and 3004 are in slot 1002, and actual repetition 3005 is in slot 1003.
From the perspective of nominal repetitions, actual repetitions 3000 and 3001 are in nominal repetition 2000, actual repetitions 3002 and 3003 are in nominal repetition 2001, actual repetition 3004 is in nominal repetition 2002, and actual repetition 3005 is in nominal repetition 2003.
It should be noted that there may be other numbers of slots, other number of nominal repetitions, and other number of actual repetitions, and the solutions of the present application also apply to the scenarios with other numbers of slots, nominal repetitions and actual repetitions.
Specifically,
As stated above, when the mapping scheme is beam mapping per slot, a UE may associate each slot of a plurality of allocated slots for the PUSCH transmission with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Accordingly, in
Furthermore, when the mapping scheme is beam mapping per slot, all actual PUSCH repetitions within each single slot will be transmitted using the corresponding spatial relation information associated with the single slot. Based on the above, slot 1000 and slot 1002 are associated with spatial relation information 401, and actual repetition 3000 is in slot 1000, actual repetitions 3003 and 3004 are in slot 1002. Accordingly, spatial relation information 401 is used to transmit actual repetitions 3000, 3003, and 3004. Similarly, slot 1001 and slot 1003 are associated with spatial relation information 402, and actual repetitions 3001 and 3002 are in slot 1001, and actual repetition 3005 is in slot 1003. Accordingly, spatial relation information 402 is used to transmit actual repetitions 3001, 3002, and 3005.
Other number of spatial relation information is also supported in the present application, for example, when there are three spatial relation information, e.g., #1, #2 and #3, then the cyclical mapping pattern is #1 #2 #3 #1 #2 #3 . . . . Then slot 1000 and slot 1003 are associated with spatial relation information 401, slot 1001 is associated with spatial relation information 402, and slot 1002 is associated with spatial relation information 403.
Similarly, when the mapping scheme is beam mapping per slot, a UE may associate each slot of a plurality of allocated slots for the PUSCH transmission with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Accordingly, in
Furthermore, when the mapping scheme is beam mapping per slot, all actual PUSCH repetitions within each single slot will be transmitted using the corresponding spatial relation information associated with the single slot. Based on the above, slot 1000 and slot 1001 are associated with spatial relation information 401, actual repetition 3000 is in slot 1000, and actual repetitions 3001 and 3002 are in slot 1001. Accordingly, spatial relation information 401 is used to transmit actual repetitions 3000, 3001, and 3002. Similarly, slot 1002 and slot 1003 are associated with spatial relation information 402, actual repetitions 3003 and 3004 are in slot 1002, and actual repetition 3005 is in slot 1003. Accordingly, spatial relation information 402 is used to transmit actual repetitions 3003, 3004, and 3005.
As stated above, when the mapping scheme is beam mapping per nominal repetition, a UE may associate each nominal repetition with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Accordingly, in
Furthermore, when the mapping scheme is beam mapping per nominal repetition, all actual PUSCH repetitions within each single nominal repetition will be transmitted using the corresponding spatial relation information associated with the single nominal repetition. Based on the above, nominal repetition 2000 and nominal repetition 2002 are associated with spatial relation information 401, e.g., beam 401, and actual repetitions 3000 and 3001 are in nominal repetition 2000, actual repetition 3004 is in nominal repetition 2002, thus spatial relation information 401 is used to transmit actual repetitions 3000, 3001, and 3004. Similarly, nominal repetition 2001 and nominal repetition 2003 are associated with spatial relation information 402, e.g., beam 402, and actual repetitions 3002 and 3003 are in nominal repetition 2001, and actual repetition 3005 is in nominal repetition 2003. Accordingly, spatial relation information 402 is used to transmit actual repetitions 3002, 3003, and 3005.
Other number of spatial relation information is also supported in the present application, for example, when there are three spatial relation information, e.g., #1, #2 and #3, then the cyclical mapping pattern is #1 #2 #3 #1 #2 #3 . . . . Then nominal repetition 2000 and nominal repetition 2003 are associated with spatial relation information 401, nominal repetition 2001 is associated with spatial relation information 402, and nominal repetition 2002 is associated with spatial relation information 403.
Similarly, when the mapping scheme is beam mapping per nominal repetition, a UE may associate each nominal repetition with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Accordingly, in
Furthermore, when the mapping scheme is beam mapping per nominal repetition, all actual PUSCH repetitions within each single nominal repetition will be transmitted using the corresponding spatial relation information associated with the single nominal repetition. Based on the above, actual repetitions 3000 and 3001 are in nominal repetition 2000, actual repetitions 3002 and 3003 are in nominal repetition 2001. Accordingly, spatial relation information 401 is used to transmit actual repetitions 3000, 3001, 3002, and 3003. Similarly, actual repetition 3004 is in nominal repetition 2002, and actual repetition 3005 is in nominal repetition 2003. Accordingly, spatial relation information 402 is used to transmit actual repetitions 3004 and 3005.
As stated above, when the mapping scheme is beam mapping per actual repetition, a UE may associate each actual repetition with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Accordingly, in
In conclusion, spatial relation information 401 is used to transmit actual repetitions 3000, 3002, and 3004; and spatial relation information 402 is used to transmit actual repetitions 3001, 3003, and 3005.
Other number of spatial relation information is also supported in the present application, for example, when there are three spatial relation information, e.g., #1, #2 and #3, then the cyclical mapping pattern is #1 #2 #3 #1 #2 #3 . . . . Then spatial relation information 401 is associated with actual repetition 3000 and actual repetition 3003, spatial relation information 402 is associated with actual repetition 3001 and actual repetition 3004, and spatial relation information 403 is associated with actual repetition 3002 and actual repetition 3005.
Similarly, when the mapping scheme is beam mapping per slot, a UE may associate each slot of a plurality of allocated slots for the PUSCH transmission with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Accordingly, in
In conclusion, spatial relation information 401 is used to transmit actual repetitions 3000, 3001, 3004, and 3005; and spatial relation information 402 is used to transmit actual repetitions 3002 and 3003.
Other number of spatial relation information is also supported in the present application, for example, when there are three spatial relation information, e.g., #1, #2 and #3, then the cyclical mapping pattern is #1 #1 #2 #2 #3 #3 . . . . Then spatial relation information 401 is associated with actual repetition 3000 and actual repetition 3001, spatial relation information 402 is associated with actual repetition 3002 and actual repetition 3003, and spatial relation information 403 is associated with actual repetition 3004 and actual repetition 3005.
The UE may include a receiving circuitry, a processor, and a transmitting circuitry. In one embodiment, the UE may include a non-transitory computer-readable medium having stored thereon computer-executable instructions; a receiving circuitry; a transmitting circuitry; and a processor coupled to the non-transitory computer-readable medium, the receiving circuitry and the transmitting circuitry. The computer executable instructions can be programmed to implement a method (e.g., the method in
The BS may include a receiving circuitry, a processor, and a transmitting circuitry. In one embodiment, the UE may include a non-transitory computer-readable medium having stored thereon computer-executable instructions; a receiving circuitry; a transmitting circuitry; and a processor coupled to the non-transitory computer-readable medium, the receiving circuitry and the transmitting circuitry. The computer executable instructions can be programmed to implement a method (e.g., the method in
The method of the present application can be implemented on a programmed processor. However, controllers, flowcharts, and modules may also be implemented on a general purpose or special purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit elements, an integrated circuit, a hardware electronic or logic circuit such as a discrete element circuit, a programmable logic device, or the like. In general, any device that has a finite state machine capable of implementing the flowcharts shown in the figures may be used to implement the processing functions of the present disclosure.
While the present disclosure has been described with specific embodiments thereof, it is evident that many alternatives, modifications, and variations will be apparent to those skilled in the art. For example, various components of the embodiments may be interchanged, added, or substituted in other embodiments. Also, all of the elements shown in each figure are not necessary for operation of the disclosed embodiments. For example, one skilled in the art of the disclosed embodiments would be capable of making and using the teachings of the present disclosure by simply employing the elements of the independent claims. Accordingly, the embodiments of the present disclosure as set forth herein are intended to be illustrative, not limiting. Various changes may be made without departing from the spirit and scope of the present disclosure.
In this disclosure, relational terms such as “first,” “second,” and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The terms “comprises,” “comprising,” or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by “a,” “an,” or the like does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises the element. Also, the term “another” is defined as at least a second or more. The terms “including,” “having,” and the like, as used herein, are defined as “comprising.”
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/CN2020/098485 | 6/28/2020 | WO |