SYSTEMS AND METHODS FOR IMPROVING UPLINK TRANSMISSIONS - Patent application

Abstract

Systems and methods for wireless communication are disclosed herein. Example implementations include a wireless communication method in which a wireless communication device divides an uplink transmission into multiple virtual uplink transmissions based on one or more time-domain parameters, and the wireless communication device determines, for each of the multiple virtual uplink transmissions, a time-domain location of one or more demodulation reference signals. Example implementations also include a wireless communication method in which the wireless communication device determines, for the uplink transmission, a number of valid symbols, and the wireless communication device determines, for the uplink transmission, a time-domain location of one or more demodulation reference signals.

Description

[Technical field]

[0001] TECHNICAL FIELD The present implementations relate generally to the field of telecommunications, and more specifically, to improving uplink transmissions. [Background technology]

[0002] As the degree of social digitalization advances, wireless communication services cover more and more application scenarios. Among them, enhanced mobile broadband, ultra-reliable and low-latency communication, and large-scale machine-type communication have become the three major scenarios supported by the fifth generation (5G) system. However, traditional systems may not effectively meet the coverage requirements for uplink transmission to transmit low-latency and high-reliability services within a short transmission time. Therefore, technical solutions for improving uplink transmission are desired. Summary of the Invention [Means for solving the problem]

[0003] Exemplary implementations disclosed herein are directed to solving problems associated with one or more of the problems presented in the prior art, and providing additional features that will be readily apparent by reference to the following detailed description when considered in conjunction with the accompanying drawings. According to various implementations, exemplary systems, methods, devices, and computer program products are disclosed herein. However, it will be understood that these implementations are presented by way of example, not limitation, and it will be apparent to those skilled in the art upon reading this disclosure that various modifications to the disclosed implementations can be made while remaining within the scope of this disclosure.

[0004] An example implementation includes a wireless communication method in which a wireless communication device divides an uplink transmission into a plurality of virtual uplink transmissions based on one or more domain parameters, and the wireless communication device determines, for each of the plurality of virtual uplink transmissions, a time domain position of each of one or more demodulation reference signals.

[0005] Exemplary implementations also include a wireless communication method for determining, by a wireless communication device, a number of useful symbols for an uplink transmission and determining, by the wireless communication device for the uplink transmission, a time domain position of each of one or more demodulation reference signals.

[0006] Example implementations also include a wireless communication method in which the wireless communication device identifies one or more useful symbols for an uplink transmission; the wireless communication device splits the uplink transmission into a first uplink transmission and a second uplink transmission, the first uplink transmission and the second uplink transmission being separated by one or more useful symbols; and the wireless communication device determines, for each of the first and second uplink transmissions, a time domain position of each of one or more demodulation reference signals. The present invention further provides, for example, the following: (Item 1) A wireless communication method, the wireless communication method comprising: dividing, by the wireless communication device, an uplink transmission into a plurality of virtual uplink transmissions based on one or more time domain parameters; determining, by the wireless communication device, respective time domain positions of one or more demodulation reference signals for each of the plurality of virtual uplink transmissions; A wireless communication method comprising: (Item 2) 2. The wireless communication method of claim 1, further comprising repeatedly transmitting the uplink transmission by the wireless communication device to a wireless communication node. (Item 3) 2. The wireless communication method of claim 1, wherein the one or more time domain parameters include a duration of the uplink transmission and a threshold. (Item 4) Each of one or more of the plurality of virtual uplink transmissions has a duration equal to the threshold, and the method further comprises: 4. The wireless communication method of claim 3, further comprising: determining, by the wireless communication device, for each of the one or more virtual uplink transmissions, the time domain positions of the respective one or more demodulation reference signals by using the duration of the one or more virtual uplink transmissions as a duration parameter indicated in a preconfigured table. (Item 5) Remaining ones of the plurality of virtual uplink transmissions have durations less than the threshold, the method comprising: 5. The wireless communication method of claim 4, further comprising: determining, by the wireless communication device, the time domain positions of the respective one or more demodulation reference signals by using, for the remaining virtual uplink transmissions, the duration of the remaining virtual uplink transmissions as the duration parameter indicated in the preconfigured table. (Item 6) 2. The wireless communication method of claim 1, wherein the one or more time domain parameters include a duration of the uplink transmission and a divisor. (Item 7) One or more of the plurality of virtual uplink transmissions each have a duration equal to (floor(the duration of the uplink transmission)), and the method further comprises: 7. The wireless communication method of claim 6, further comprising: determining, by the wireless communication device, for each of the one or more virtual uplink transmissions, the time domain positions of the respective one or more demodulation reference signals by using the duration of the one or more virtual uplink transmissions as a duration parameter indicated in the preconfigured table. (Item 8) The remaining ones of the plurality of virtual uplink transmissions have a duration equal to (the duration of the uplink transmission-floor(the duration of the uplink transmission)), and the method further comprises: 8. The wireless communication method of claim 7, further comprising: determining, by the wireless communication device, for the remaining virtual uplink transmissions, the time domain positions of the respective one or more demodulation reference signals by using the duration of the remaining virtual uplink transmission as the duration parameter indicated in the preconfigured table. (Item 9) One or more of the plurality of virtual uplink transmissions each have a duration equal to (ceil(the duration of the uplink transmission)), and the method further comprises: 7. The wireless communication method of claim 6, further comprising: determining, by the wireless communication device, for each of the one or more virtual uplink transmissions, the time domain positions of the respective one or more demodulation reference signals by using the duration of the one or more virtual uplink transmissions as a duration parameter indicated in the preconfigured table. (Item 10) The remaining ones of the plurality of virtual uplink transmissions have a duration equal to (the duration of the uplink transmission-ceil(the duration of the uplink transmission)), and the method further comprises: 8. The wireless communication method of claim 7, further comprising: determining, by the wireless communication device, for the remaining virtual uplink transmissions, the time domain positions of the respective one or more demodulation reference signals by using the duration of the remaining virtual uplink transmission as the duration parameter indicated in the preconfigured table. (Item 11) 2. The wireless communication method of claim 1, wherein the one or more time domain parameters include the duration of the uplink transmission and at least one of a slot boundary and an invalid symbol. (Item 12) a first and a second of the plurality of virtual uplink transmissions are separated by the slot boundary or the invalid symbol, the first virtual uplink transmission having a first duration and the second virtual uplink transmission having a second duration, the method comprising: determining, by the wireless communication device, for the first virtual uplink transmission, a time domain location of each of the one or more demodulation reference signals by using the first duration as a duration parameter indicated in the preconfigured table; determining, by the wireless communication device, for the second virtual uplink transmission, the respective time domain positions of the one or more demodulation reference signals by using the second duration as the duration parameter indicated in the preconfigured table; 10. The wireless communication method of claim 9, further comprising: (Item 13) A wireless communication method, the wireless communication method comprising: determining, by the wireless communication device, a number of useful symbols for uplink transmission; determining, by the wireless communication device, a time domain position of each of one or more demodulation reference signals with respect to the uplink transmission; A wireless communication method comprising: (Item 14) Item 14. The wireless communication method of item 13, further comprising repeatedly transmitting the uplink transmission by the wireless communication device to the wireless communication node. (Item 15) 14. The wireless communication method of claim 13, further comprising: determining, by the wireless communication device, for the uplink transmission, a time domain position of each of the one or more demodulation reference signals by using the number of useful symbols as a duration parameter indicated in the preconfigured table. (Item 16) A wireless communication method, the wireless communication method comprising: identifying, by the wireless communication device, one or more invalid symbols for an uplink transmission; splitting, by the wireless communication device, the uplink transmission into a first uplink transmission and a second uplink transmission, the first uplink transmission and the second uplink transmission being separated by the one or more invalid symbols; determining, by the wireless communication device, a time domain position of each of the one or more demodulation reference signals for each of the first and second uplink transmissions; A wireless communication method comprising: (Item 17) Item 17. The wireless communication method of item 16, further comprising determining, by the wireless communication device, that a transmitted demodulation reference signal is not associated with the second uplink transmission. (Item 18) 17. The wireless communication method of claim 16, further comprising determining, by the wireless communication device, that the time domain location of the one or more demodulation reference signals for the second uplink transmission includes a symbol immediately following the one or more invalid symbols. (Item 19) comparing, by the wireless communication device, a number of the one or more invalid symbols to a threshold; determining, by the wireless communication device, if the number is less than or equal to the threshold, that the transmitted demodulation reference signal is not associated with the second uplink transmission; determining, by the wireless communication device, if the number exceeds the threshold, that the time domain location of the one or more demodulation reference signals for the second uplink transmission includes a symbol immediately following the one or more invalid symbols; Item 17. The wireless communication method according to item 16, further comprising: (Item 20) A wireless communication device comprising a processor and a memory, the processor configured to read code from the memory and to implement a method as defined in items 1-19. (Item 21) A computer program product comprising a computer readable program medium code stored thereon, the code, when executed by a processor, causing the processor to implement the method defined in items 1-19. [Brief description of the drawings]

[0007] Various exemplary embodiments of the present solution are described in detail below with reference to the following figures or drawings. The drawings are provided for illustrative purposes only and merely depict exemplary embodiments of the present solution to facilitate the reader's understanding of the present solution. Thus, the drawings should not be considered as limiting the scope, scope, or applicability of the present solution. Please note that for clarity and ease of illustration, the drawings are not necessarily drawn to scale.

[0008] [Figure 1] FIG. 1 illustrates an example cellular communication network in which the techniques and other aspects disclosed herein may be implemented according to certain embodiments of the present disclosure.

[0009] [Diagram 2] FIG. 2 is a schematic diagram illustrating an example generation of at least one virtual PUSCH including at least one invalid symbol and according to a threshold value in accordance with some implementations of the present disclosure.

[0010] [Diagram 3] FIG. 3 is a schematic diagram illustrating an example generation of at least one virtual PUSCH including at least one invalid symbol and according to a virtual PUSCH number in accordance with some implementations of the present disclosure.

[0011] [Figure 4] FIG. 4 is a schematic diagram illustrating an example generation of at least one DMRS symbol according to a number of communicable symbols in accordance with some implementations of the present disclosure.

[0012] [Diagram 5] FIG. 5 is a schematic diagram illustrating an example generation of at least one virtual PUSCH that excludes at least one invalid symbol according to some implementations of the present disclosure.

[0013] [Figure 6] FIG. 6 is a schematic diagram illustrating an example generation of at least one DMRS symbol according to a number of invalid symbols in accordance with some implementations of the present disclosure.

[0014] [Figure 7] FIG. 7 is a schematic diagram illustrating an example generation of at least one virtual PUSCH that excludes at least one invalid symbol and spans at least one slot boundary in accordance with some implementations of the present disclosure.

[0015] [Figure 8A] FIG. 8A illustrates a block diagram of an example base station in accordance with some implementations of the present disclosure.

[0016] [Figure 8B] FIG. 8B illustrates a block diagram of an example UE in accordance with some implementations of the present disclosure.

[0017] [Figure 9] FIG. 9 illustrates a first example method according to some implementations of the present disclosure.

[0018] [Figure 10] FIG. 10 illustrates a second example method according to some implementations of the present disclosure.

[0019] [Figure 11] FIG. 11 illustrates a third example method according to some implementations of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0020] The present implementations will now be described in detail with reference to the drawings, which are provided as illustrative examples of implementations, to enable those skilled in the art to practice implementations and alternatives that are obvious to those skilled in the art. It should be noted that the following figures and examples are not meant to limit the scope of the present implementations to a single implementation, and other implementations are possible with replacement of some or all of the elements described or illustrated. Furthermore, certain elements of the present implementations may be implemented partially or fully using known components, and only those parts of such known components that are necessary for understanding the present implementations will be described, and detailed descriptions of other parts of such known components will be omitted so as not to obscure the present implementations. An implementation described as being implemented in software should not be limited thereto, and may include implementations implemented in hardware, or a combination of software and hardware, and vice versa, unless otherwise specified herein, as would be apparent to one skilled in the art. In this specification, implementations showing a singular component should not be considered limiting, but rather the present disclosure is intended to encompass other implementations, including multiples of the same components, and vice versa, unless otherwise expressly stated herein. Moreover, applicants do not intend that any term in this specification or claims should be ascribed an uncommon or special meaning unless expressly stated as such. Moreover, the present implementations encompass current and future known equivalents to known components referenced herein by way of example.

[0021] In various wireless implementations, it is advantageous to ensure coverage and transmit low latency and high reliability services within short transmission times. Thus, in some implementations, it is advantageous to transmit by one or more methods of uplink (UL) transmission. As an example, the transmission may include dynamic scheduling based aggregate transmission (transport block aggregation for uplink transmission). As another example, the transmission may include unscheduled repetitive transmission (transport block repetition for uplink transmission with configured grant). Furthermore, in some implementations, it is advantageous to enhance repetitive transmission of at least one physical uplink shared channel (PUSCH) or transport block (TB). Thus, in some implementations, the same PUSCH or TB is repeatedly transmitted one or more times in the same time slot. In some implementations, at least one of the same PUSCH and the same TB is repeatedly transmitted across slot boundaries in multiple consecutive slots. In some implementations, the Msg3 PUSCH scheduled by the RAR UL grant in the type-1 random access procedure under various protocols is transmitted only once. Furthermore, in some implementations, under the Type-2 random access procedure, the PUSCH of MsgA is transmitted only once.

[0022] In some implementations, it is advantageous to repeat transmission of at least one of the PUSCH and TB under various protocols to meet at least one coverage requirement. As an example, the repeated transmission may include allowing the PUSCH to transmit an invalid symbol and the PUSCH time domain duration across a slot boundary. In some implementations, the PUSCH time domain duration is more than 14 symbols. However, it should be understood that the PUSCH time domain duration may be 14 symbols or less in some implementations. Thus, it is advantageous to determine a location of a demodulation reference signal (DMRS) in the time domain under various protocols. In some implementations, it is advantageous to meet one or more coverage requirements under various protocols with one or more of the Msg3 PUSCH and Msg A PUSCH. In some implementations, the coverage requirement for one or more of the Msg3 PUSCH and Msg A PUSCH includes introducing multiple repetitions. Furthermore, it is advantageous to meet the coverage requirement with one or more alternate, complementary, etc. repeated transmission types.

[0023] In some implementations, it is advantageous to ensure coverage and transmit low-latency and high-reliability services within short transmission times under various protocols. In some implementations, aggregation for uplink transmissions by downlink control information (DCI) is based at least in part on one or more of dynamic scheduling and repetition without scheduling. In some implementations, a particular repetitive transmission pattern is obtained based on one or more exemplary processes. As an example, a time domain resource allocation (TDRA) can be used to signal, set, determine, etc., at least one of a starting symbol and a time domain duration of a first nominal repetition and a number of repetitive transmissions. In this example, the remaining nominal repetitions may be consecutive consecutive transmissions. As another example, a nominal repetition that crosses a slot boundary may be split into multiple actual transmissions. As another example, a nominal repetition that encounters a symbol that cannot be transmitted may be split into multiple actual transmissions.

[0024] In some implementations, if under various protocols, the transmission of the PUSCH is allowed to cross slot boundaries or invalid symbols and / or if the time domain duration of the PUSCH transmission exceeds 14 symbols, the existing protocols cannot determine the DMRS location of the demodulated PUSCH. This is because, in some implementations, under various protocols, the DMRS defined by the various protocols introduces various restrictions on transmission. As an example, the restrictions on transmission may include limiting the PUSCH time domain duration to 14 symbols or less. As another example, the restrictions on transmission may include preventing the PUSCH from crossing slot boundaries. It should be understood that the terms "non-transmittable" and "invalid" are used synonymously throughout.

[0025] FIG. 1 illustrates an example wireless communication network and / or system 100 in which techniques disclosed herein according to embodiments of the present disclosure may be implemented. In the following discussion, the wireless communication network 100 may be any wireless network, such as a cellular network or a narrowband Internet of Things (NE-IoT) network, and is referred to herein as "network 100." Such an example network 100 includes a base station 102 (hereinafter "BS 102"), user equipment devices 104 (hereinafter "UE 104") that may communicate with each other using communication links 110 (e.g., wireless communication channels), and a cluster of cells 126, 130, 132, 134, 136, 138, and 140 that overlay a geographic area 101. In FIG. 1, the BS 102 and the UE 104 are included within the respective geographic boundaries of the cell 126. Each of the other cells 130, 132, 134, 136, 138, and 140 may include at least one base station operating in its allocated bandwidth and providing sufficient wireless coverage to its intended users.

[0026] For example, the BS 102 may operate with an allocated channel transmission bandwidth to provide sufficient coverage to the UE 104. The BS 102 and the UE 104 may communicate using a downlink radio frame 118 and an uplink radio frame 124, respectively. Each radio frame 118 / 124 may be further divided into subframes 120 / 127, which may include data symbols 122 / 128. In this disclosure, the BS 102 and the UE 104 are generally described herein as non-limiting examples of "communication nodes" that may practice the methods disclosed herein. Such communication nodes may be capable of wireless and / or wired communication according to various embodiments of the present solution.

[0027] FIG. 2 is a schematic diagram illustrating an example generation of at least one virtual PUSCH including at least one invalid symbol and subject to a threshold according to some implementations of the present disclosure. The example implementation 200 describes a first example schematic for determining a DMRS location according to a time domain duration of the PUSCH. In some implementations, the example implementation 200 includes at least a portion of a slot sequence 210, one or more time domain symbols 220, one or more invalid time domain symbols 222, a first PUSCH 230, and a second PUSCH 240. In some implementations, the slot sequence 210 includes a slot boundary 212. In some implementations, the first PUSCH 230 includes a first virtual PUSCH 232, a second virtual PUSCH 234, and a third virtual PUSCH 236.

[0028] In some implementations, the exemplary system determines the DMRS location according to a time domain threshold X. In some implementations, the time domain duration of the first PUSCH 230 is divided into a number of virtual PUSCHs according to the threshold X. In some implementations, the first PUSCH 230 is divided into three virtual PUSCHs 232, 234, and 236. It should be understood that the PUSCH 230 may be divided into any number of virtual PUSCHs. In some implementations, each virtual PUSCH 232, 234, and 236 is determined according to a PUSCH DMRS location rule defined by a predefined value. In some implementations, the location rule is defined by one or more various telecommunication protocols, etc. In some implementations, the threshold X is a natural number equal to or greater than 1. As an example, the threshold X may be equal to 7, as illustrated as an example in FIG. 2. In this example, the first PUSCH 230 is divided into three virtual PUSCHs 232, 234, and 234. The first virtual PUSCH 232 includes seven symbols, the second virtual PUSCH includes seven symbols, and the third virtual PUSCH includes all of the remaining three symbols of the first PUSCH 230.

[0029] In some implementations, the exemplary system determines one or more DMRS locations for each virtual PUSCH 232, 234, and 236 based on the correspondence in Table 1. Table 1 provides the following for disabled single symbol DMRS and intra-slot frequency hopping: 1 illustrates an example correspondence between PUSCH symbols and DMRS positions in a slot, and parameter “l d " and "l0" refer to the time-domain duration of a (virtual) PUSCH transmission and the time-domain position of the first symbol of the (virtual) PUSCH transmission, respectively. [Table 1]

[0030] FIG. 3 is a schematic diagram illustrating an example generation of at least one virtual PUSCH according to a virtual PUSCH number, including at least one invalid symbol, according to some implementations of the present disclosure. The example implementation 300 describes a second example schematic for determining a DMRS location according to a time domain duration of the PUSCH. In some implementations, the example implementation 300 includes at least a portion of a slot sequence 310, one or more time domain symbols 320, one or more invalid time domain symbols 320, a first PUSCH 330, and a second PUSCH 340. In some implementations, the slot sequence 310 includes a slot boundary 312. In some implementations, the first PUSCH 330 includes a first virtual PUSCH 332 and a second virtual PUSCH 334.

[0031] In some implementations, the time domain of the first PUSCH 330 is divided equally into several virtual PUSCHs, each PUSCH being determined according to a PUSCH DMRS location rule defined by one or more various telecommunication protocols, etc. In some implementations, the average cardinality is N. In some implementations, N is a natural number equal to or greater than 1. As an example, when N is 2, the first PUSCH 330 is divided into two virtual PUSCHs, namely, the first virtual PUSCH 332 and the second virtual PUSCH 334. In this example, the time domain length of the first virtual PUSCH is 8 symbols, by floor(17 / 2)=8. In this example, the time domain length of the second virtual PUSCH 334 is 9 symbols, by 17-floor(17 / 2)=9. As another example, the time domain length of the first virtual PUSCH is 9 symbols, by ceil(17 / 2)=9. In this example, the time domain length of the second virtual PUSCH is 8 symbols, since 17-ceil(17 / 2)=8.

[0032] 4 is a schematic diagram illustrating an example generation of at least one DMRS symbol according to a number of communicable symbols according to some implementations of the present disclosure. The example implementation 400 describes a third example schematic for determining a DMRS location according to a time domain duration of a PUSCH. In some implementations, the example implementation 400 includes at least a portion of a slot sequence 410, one or more time domain symbols 420, one or more invalid time domain symbols 422, a first PUSCH 430, and a second PUSCH 440. In some implementations, the slot sequence 410 includes a slot boundary 412. In some implementations, the first PUSCH 430 includes one or more DMRS positions 424.

[0033] In some implementations, the time domain duration is the number of symbols actually transmitted for the PUSCH. Thus, in some implementations, the time domain duration does not include non-transmittable, invalid, etc. symbols 422. In some implementations, the transmittable symbols 420 in the first PUSCH 430 are based on PUSCH DMRS location rules defined by one or more various telecommunications protocols, etc. As illustrated as an example in FIG. 4, an exemplary time domain duration is 14 symbols, which does not include the three non-transmittable or invalid symbols 422. It should be understood that the first PUSCH 430 may include more or fewer total symbols. It should be further understood that the first PUSCH 430 may include more or fewer invalid symbols 422.

[0034] FIG. 5 is a schematic diagram illustrating an example generation of at least one virtual PUSCH excluding at least one invalid symbol according to some implementations of the present disclosure. The example implementation 500 describes a fourth example schematic for determining a DMRS location according to at least one of a slot boundary and one or more invalid symbols. In some implementations, the example implementation 500 includes at least a portion of a slot sequence 510, one or more time domain symbols 520, one or more invalid time domain symbols 522, a first PUSCH 530, and a second PUSCH 540. In some implementations, the slot sequence 510 includes a slot boundary 512. In some implementations, the first PUSCH 530 includes a first virtual PUSCH 532, a second virtual PUSCH 534, and a third virtual PUSCH 536. In some implementations, the first PUSCH 530 is divided into several virtual PUSCHs according to at least one of a time slot boundary and one or more invalid symbols. In some implementations, the example system determines each virtual PUSCH 532, 534, and 536 according to PUSCH DMRS location rules defined by various protocols. It should be understood that the first PUSCH 530 may be divided into more or fewer virtual PUSCHs.

[0035] FIG. 6 is a schematic diagram illustrating an example generation of at least one DMRS symbol according to a number of invalid symbols according to some implementations of the present disclosure. The example implementation 600 illustrates a fifth example schematic for determining a DMRS location according to at least one DMRS location. In some implementations, the example implementation 600 includes at least a portion of a slot sequence 610, one or more time domain symbols 620, one or more invalid time domain symbols 622, a first PUSCH 630, and a second PUSCH 640. In some implementations, the slot sequence 610 includes a slot boundary 612. In some implementations, the first PUSCH 630 includes one or more DMRS locations 624. In some implementations, the first PUSCH 630 includes one or more DMRS locations 626 corresponding to the invalid symbols 624.

[0036] In some implementations, the time domain duration of the first PUSCH 630, which includes a symbol index determined by at least one of the one or more non-transmittable or invalid symbols 622 and the DMRS location 624, also includes one or more non-transmittable symbols 626. Thus, in some implementations, the exemplary system enters a state in which the DMRS location is on a non-transmittable symbol, and there is no DMRS in the first PUSCH 630 immediately following the invalid symbol 626 in the time domain. In some implementations, the rear of the first PUSCH 630 shares the DMRS of the front of the first PUSCH 630. Alternatively, in some implementations, the exemplary system places the DMRS 624 on the first symbol of the rear of the first PUSCH 630. In some implementations, the placement of the DMRS is based at least in part on a threshold Y and a number of invalid symbols. As an example, in response to a number of invalid symbols 624 or 626 below the threshold Y, the rear of the first PUSCH 630 shares the DMRS of the front of the first PUSCH 630. As another example, in response to a number of invalid symbols exceeding a threshold Y, the exemplary system places the DMRS 624 on the first symbol of the first PUSCH 630.

[0037] FIG. 7 is a schematic diagram illustrating an example generation of at least one virtual PUSCH excluding at least one invalid symbol and straddling at least one slot boundary according to some implementations of the present disclosure. The example implementation 700 describes some implementations for determining a DMRS location according to at least one of a slot boundary and one or more invalid symbols. In some implementations, the example implementation 700 includes at least a portion of a slot sequence 710, one or more time domain symbols 720, one or more invalid time domain symbols 722, a first PUSCH 730, and a second PUSCH 740. In some implementations, the slot sequence 710 includes a slot boundary 712. In some implementations, the first PUSCH 730 includes a first virtual PUSCH 732 and a second virtual PUSCH 734. In some implementations, the first PUSCH 730 is split into several virtual PUSCHs according to at least one of a time slot boundary and one or more invalid symbols. In some implementations, the example system determines each virtual PUSCH 732 and 734 according to PUSCH DMRS location rules defined by various protocols. It should be understood that the first PUSCH 730 may be divided into more or fewer virtual PUSCHs.

[0038] In some implementations, under various protocols, the symbols in a time slot may include uplink symbols (DL, downlink symbols), downlink symbols (UL, uplink symbols), and flexible symbols (F, flexible symbols), which are configured in a semi-static frame structure. In some implementations, for uplink information to be transmitted by a terminal, only the uplink symbols and some flexible symbols configured in the semi-static frame structure may be used. In some implementations, a collision will occur when the transmitted uplink information encounters a dynamic SFI (dynamic slot format indicator) indicating a D symbol or an F symbol. In some implementations, under various protocols, when a PUSCH in an uplink transmission with a configured grant encounters a dynamic SFI indication D or F, the PUSCH will be discarded.

[0039] In some implementations, under various protocols, as shown as an example in Figure 7, some transmissions of PUSCH are allowed to cross slot boundaries or cannot transmit symbols and the time domain duration exceeds 14 symbols. In some implementations, when symbols #10 and #11 (indicated as D or F by the dynamic SFI) of slot #3 corresponding to PUSCH Rep #1 are directly discarded under various protocols, the coverage performance of PUSCH may be affected.

[0040] Thus, in some implementations, the terminal obtains configuration information for completing an unscheduled PUSCH transmission. In some implementations, the terminal obtains the configuration information through RRC signaling or DCI. Once the configuration information is configured or enabled, rate matching is performed for the PUSCH transmission. Once the configuration information is configured or enabled, the terminal does not receive or detect a dynamic SFI. In response, the terminal continues to transmit PUSCH Rep#1. Additionally, in some implementations, rate matching is performed for the PUSCH transmission. For example, PUSCH Rep#1 removes the first two symbols and uses the remaining symbols for transmission.

[0041] In some implementations, under various protocols, a transmission of PUSCH is allowed to cross a slot boundary where symbols cannot be transmitted, and the time domain duration exceeds 14 symbols. In some implementations, when PUSCH transmission and PUCCH transmission overlap in the time domain, the time domain overlap area includes PUSCH transmittable symbols and non-transmittable symbols. After PUSCH Rep#1 encounters a non-transmittable symbol, PUSCH Rep#1 is virtualized into two PUSCHs, and then UCI carried on PUCCH is multiplexed in the earlier virtual PUSCH#1 that satisfies the timeline. The timeline refers to the provisions of Section 9.2.5 of Standard 38.213. For example, in some implementations, the starting symbol of PUSCH or PUCCH to be transmitted first must satisfy the following timeline conditions: The starting symbol is the time after the end of any PDSCH.

number

[0042] Further, in some implementations, the PUSCH transmission and the PUCCH transmission overlap in the time domain. In response, it is determined that when the UCI carried on the PUCCH is multiplexed into the earliest virtual PUSCH#1 that fills the timeline, for each layer of the UCI, the number of all coded modulation symbols is determined based on the PUSCH. Further, in some implementations, for each layer of information of the UCI, the number of coded modulation symbols used is limited so as not to exceed the total number of resources multiplexed onto the virtual PUSCH. In some implementations, the number of all modulation symbols in each layer of information refers to HARQ-ACK (Hybrid ARQ), CSI part 1 (Channel-State Information, Channel State Information), and CSI part 2. In some implementations, the PUSCH Rep#1 including the non-transmittable symbol crosses a slot boundary. The number of all modulation symbols defining each layer of information of the UCI does not exceed the total number of resources multiplexed onto the virtual PUSCH. In some implementations, the PUSCH is split into two virtual PUSCHs according to non-transmittable symbols, which does not exceed the number of resources multiplexed in the virtual PUSCH #1. Furthermore, the PUSCH transmission carries the TB or the UL-SCH.

[0043] In some implementations, the PUSCH is repeatedly transmitted multiple times, and a transmission of the PUSCH is allowed to cross a slot boundary or cannot transmit a symbol, and the time domain duration exceeds 14 symbols. In some implementations, for these uplink repeated transmissions, the PUSCH transmission opportunity i and the corresponding transmit power may be determined by the following methods. The PUSCH transmission opportunity i refers to a virtual segmented PUSCH. Thus, in some implementations, the virtual segmented PUSCH may be determined by at least one of the following methods.

[0044] In some implementations, the exemplary system determines the division according to a time domain threshold X. The time domain duration of the PUSCH is divided into several virtual PUSCHs according to the threshold X. In some implementations, the exemplary system divides the PUSCH into several virtual PUSCHs according to a time slot boundary or an invalid symbol. Thus, in some implementations, the transmission power of each virtual PUSCH is the same. Furthermore, in some implementations, the PUSCH is repeatedly transmitted multiple times, and some transmissions of the PUSCH are allowed to cross the slot boundary or cannot transmit symbols, and the time domain duration exceeds 14 symbols. For these uplink repeated transmissions, the transport block size (Transport Block Size, TBS) of the PUSCH may be determined according to the PUSCH with the longest virtual segment time domain in some implementations. The virtual segmented PUSCH may be determined by the method in the above embodiment. In some implementations, the TBS may also be determined according to the PUSCH with the shortest virtual segment time domain.

[0045] 8A illustrates a block diagram of an example base station 802 according to some implementations of the present disclosure. FIG. 8B illustrates a block diagram of an example UE 801 according to some implementations of the present disclosure. With reference to FIG. 1-7B, UE 801 (e.g., a wireless communication device, terminal, mobile device, mobile user, etc.) is an example implementation of a UE described herein, and base station 802 is an example implementation of a base station described herein.

[0046] The base station 802 and the UE 801 may include components and elements configured to support known or conventional operational features that need not be described in detail herein. In one illustrative implementation, the base station 802 and the UE 801 may be used to communicate (e.g., transmit and receive) data symbols in a wireless communication environment, as described above. For example, the base station 802 may be a base station (e.g., gNB, eNB, etc.), a server, a node, or any suitable computing device used to implement various network functions.

[0047] The base station 802 includes a transceiver module 810, an antenna 812, a processor module 814, a memory module 816, and a network communication module 818. The modules 810, 812, 814, 816, and 818 are operatively coupled and interconnected with each other using a data communication bus 820. The UE 801 includes a UE transceiver module 830, a UE antenna 832, a UE memory module 834, and a UE processor module 836. The modules 830, 832, 834, and 836 are operatively coupled and interconnected with each other using a data communication bus 840. The base station 802 communicates with the UE 801 or another base station using a communication channel, which may be any wireless channel or other medium suitable for the transmission of data as described herein.

[0048] As would be understood by one skilled in the art, the base station 802 and the UE 801 may further include any number of modules other than those shown in Figures 8A and 8B. The various illustrative blocks, modules, circuits, and processing logic described in connection with the embodiments disclosed herein may be implemented in hardware, computer readable software, firmware, or any practical combination thereof. To illustrate this interchangeability and compatibility of hardware, firmware, and software, the various illustrative components, blocks, modules, circuits, and steps are generally described in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software may depend on the particular application and design constraints imposed on the overall system. The implementations described herein may be implemented in a suitable manner for each particular application, but any implementation decisions should not be construed as limiting the scope of the disclosure.

[0049] According to some implementations, the UE transceiver 830 includes a radio frequency (RF) transmitter and an RF receiver, each with circuitry coupled to an antenna 832. A duplex switch (not shown) may alternatively couple the RF transmitter or receiver to the antenna in a time-duplex manner. Similarly, according to some embodiments, the transceiver 810 includes an RF transmitter and an RF receiver, each with circuitry coupled to an antenna 812 or an antenna of another base station. The duplex switch may alternatively couple the RF transmitter or receiver to the antenna 812 in a time-duplex manner. The operation of the two transceiver modules 810 and 830 can be coordinated in time such that the receiver circuitry is coupled to the antenna 832 at the same time that the transmitter is coupled to the antenna 812 for reception of transmissions over the wireless transmission link. In some implementations, there is close time synchronization with minimal guard time between changes in duplex direction.

[0050] The UE transceiver 830 and the transceiver 810 are configured to communicate using a wireless data communication link and cooperate with a suitably configured RF antenna arrangement 812 / 832 that may support a particular wireless communication protocol and modulation scheme. In some illustrative implementations, the UE transceiver 810 and the transceiver 810 are configured to support industry standards such as Long Term Evolution (LTE) and the emerging 5G standard. However, it should be understood that the present disclosure is not necessarily limited in application to a particular standard and associated protocol. Rather, the UE transceiver 830 and the base station transceiver 810 may be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.

[0051] The transceiver 810 and other base station transceivers (such as, but not limited to, the transceiver 810) are configured to communicate using a wireless data communications link and cooperate with a suitably configured RF antenna arrangement that may support a particular wireless communications protocol and modulation scheme. In some illustrative implementations, the transceiver 810 and other base station transceivers are configured to support industry standards such as LTE and the emerging 5G standard. However, it should be understood that the present disclosure is not necessarily limited in application to a particular standard and associated protocol. Rather, the transceiver 810 and other base station transceivers may be configured to support alternative or additional wireless data communications protocols, including future standards or variants thereof.

[0052] According to various implementations, the base station 802 may be a base station such as, for example, but not limited to, an eNB, a serving eNB, a target eNB, a femto station, or a pico station. The base station 802 may be an RN, a regular, a DeNB, or a gNB. In some implementations, the UE 801 may be embodied in various types of user devices, such as a mobile phone, a smartphone, a personal digital assistant (PDA), a tablet, a laptop computer, a wearable computing device, etc. The processor modules 814 and 836 may be implemented or realized with a general purpose processor, an associative memory, a digital signal processor, an application specific integrated circuit, a field programmable gate array, any suitable programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. In this manner, the processor may be realized as a microprocessor, a controller, a microcontroller, a state machine, etc. The processor may also be implemented as a combination of computing devices, such as a combination of a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other such configuration.

[0053] Furthermore, the methods or algorithms disclosed herein may be embodied in hardware, firmware, software modules, or any practical combination thereof, executed directly by the processor modules 814 and 836, respectively. The memory modules 816 and 834 may be realized as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art. In this regard, the memory modules 816 and 834 may be coupled to the processor modules 810 and 830, respectively, such that the processor modules 810 and 830 may read information from and write information to the memory modules 816 and 834, respectively. The memory modules 816 and 834 may also be integrated into their respective processor modules 810 and 830. In some implementations, each of the memory modules 816 and 834 may include a cache memory for storing temporary variables or other intermediate information during execution of instructions to be executed by the processor modules 810 and 830, respectively. Memory modules 816 and 834 may include non-volatile memory for storing instructions for execution by processor modules 810 and 830, respectively.

[0054] The network communications module 818 generally represents hardware, software, firmware, processing logic, and / or other components of the base station 802 that enable bidirectional communications between the transceiver 810 and other network components and communication nodes that communicate with the base station 802. For example, the network communications module 818 may be configured to support Internet or WiMAX traffic. In some deployments, but not by way of limitation, the network communications module 818 provides an 802.3 Ethernet interface so that the transceiver 810 may communicate with conventional Ethernet-based computer networks. As such, the network communications module 818 may include a physical interface for connection to a computer network (e.g., a Mobile Switching Center (MSC)). In some implementations, the network communications module 818 includes a fiber carrier connection configured to connect the base station 802 to a core network. As used herein in relation to a specified operation or function, the terms "configured for," "configured to," and variations thereof refer to a device, component, circuit, structure, machine, signal, etc. that is physically constructed, programmed, formatted, and / or arranged to perform the specified operation or function.

[0055] FIG. 9 illustrates an exemplary method according to some implementations of the present disclosure. In some implementations, at least one of the base station 802 and the UE 801 performs the method 900 in accordance with the present implementation. In some implementations, the method 900 begins at step 910. In step 910, the exemplary system divides an uplink transmission into multiple virtual uplink transmissions based on one or more time domain parameters. In some implementations, step 910 includes step 912. The method 910 then proceeds to step 920. In step 920, the exemplary system determines a time domain position of each of the one or more demodulation reference signals. In some implementations, the method 900 ends at step 920.

[0056] FIG. 10 illustrates an exemplary method according to some implementations of the present disclosure. In some implementations, at least one of the base station 802 and the UE 801 performs the method 1000 in accordance with the present implementation. In some implementations, the method 1000 starts at step 1010. In step 1010, the exemplary system determines a number of valid symbols for uplink transmission. The method 1000 then proceeds to step 1020. In step 1020, the exemplary system determines a time domain position of each of the one or more demodulation reference signals. In some implementations, the method 1000 ends at step 1020.

[0057] FIG. 11 illustrates an exemplary method according to some implementations of the present disclosure. In some implementations, at least one of the base station 802 and the UE 801 performs the method 1100 according to the present implementation. In some implementations, the method 1100 starts at step 1110. In step 1110, the exemplary system identifies one or more invalid symbols for an uplink transmission. The method 1100 then proceeds to step 1120. In step 1120, the exemplary system splits the uplink transmission into a first uplink transmission and a second uplink transmission, the first uplink transmission and the second uplink transmission being separated by one or more invalid symbols. In some implementations, step 1120 includes step 1122. The method 1100 proceeds to step 1130. In step 1130, the exemplary system determines a time domain position of each of the one or more demodulation reference signals. In some implementations, the method 1100 ends at step 1130.

[0058] The subject matter described herein sometimes illustrates different components that are included within or connected to different other components. It should be understood that such depicted architectures are illustrative, and that in fact many other architectures that achieve the same functionality can be implemented. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively "associated" such that the desired functionality is achieved. Thus, any two components herein that are combined to achieve a particular functionality can be considered to be "associated" with one another such that the desired functionality is achieved, regardless of the architecture or intermediate components. Similarly, any two components so associated can also be considered to be "operably connected" or "operably coupled" to one another to achieve the desired functionality, and any two components capable of being so associated can also be considered to be "operably coupled" to one another to achieve the desired functionality. Specific examples of what can be operably coupled include, but are not limited to, physically interoperable and / or physically interacting components and / or wirelessly interoperable and / or wirelessly interacting components and / or logically interoperable and / or logically interacting components.

[0059] For use of plural and / or singular terms herein, one of skill in the art may convert from plural to singular and / or from singular to plural as appropriate to the context and / or application. Enumerations of the various singular / plural forms may be expressly set forth herein for purposes of clarity.

[0060] It will be understood by those of ordinary skill in the art that, in general, the terms used in this specification, and particularly in the appended claims (e.g., the body of the appended claims), are generally intended as "open" terms (e.g., the term "including" should be interpreted as "including but not limited to," the term "having" should be interpreted as "having at least," the term "includes" should be interpreted as "includes but is not limited to," etc.).

[0061] Although the figures and description may illustrate a specific order of method steps, the order of such steps may differ from that depicted and described unless otherwise specified above. Also, two or more steps may be performed in parallel or partially simultaneously unless otherwise specified above. Such variations may depend, for example, on the selected software and hardware systems and designer choices. All such variations are within the scope of this disclosure. Similarly, software implementations of the described methods may be performed using standard programming techniques involving rule-based logic and other logic to perform the various connection, processing, comparison, and decision steps.

[0062] It will be further understood by those skilled in the art that, if a specific number of introduced claim recitations are intended, such intent will be explicitly recited in the claim, and that in the absence of such recitations, no such intent exists. For example, as an aid to understanding, the following appended claims may contain the use of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be construed as implying that the introduction of a claim recitation with the indefinite article "a" or "an" limits any particular claim that includes such an introduced claim recitation to an invention that includes only one such recitation, even when the same claim includes the introductory phrases "one or more" or "at least one" and an indefinite article such as "a" or "an" (e.g., "a" and / or "an" should typically be construed to mean "at least one" or "one or more"), and the same applies to the use of definite articles used to introduce claim recitations. In addition, even if a claim recitation introducing a specific number is explicitly recited, one of ordinary skill in the art will recognize that such recitation should typically be interpreted to mean at least the number recited (e.g., the bare recitation of "two recitations" without other modifiers means at least two recitations or more than two recitations).

[0063] Furthermore, in those cases where notation similar to "at least one of A, B, and C, etc." is used, such structures are generally intended in the sense that one of ordinary skill in the art would understand the notation (e.g., "a system having at least one of A, B, C" would include, without limitation, systems having "A only," "B only," "C only," "both A and B," "both A and C," "both B and C," or "both A, B, and C"). In those cases where notation similar to "at least one of A, B, or C, etc." is used, such structures are generally intended in the sense that one of ordinary skill in the art would understand the notation (e.g., "a system having at least one of A, B, or C" would include, without limitation, systems having "A only," "B only," "C only," "both A and B," "both A and C," "both B and C," and / or "both A, B, and C," etc.). It will be further understood by those skilled in the art that virtually any disjunctive word and / or phrase expressing two or more alternative terms, whether in the description, claims, or drawings, should be understood to consider the possibility of including one of the terms, either of the terms, or both of the terms. For example, the phrase "A or B" will be understood to include the possibilities of "A," or "B," or "A and B."

[0064] Further, unless otherwise stated, use of the words "approximate," "about," "around," "substantially," and the like, means plus or minus ten percent.

[0065] The foregoing description of exemplary implementations has been presented for purposes of illustration and description. It is not intended to be exhaustive or limited to the precise form disclosed, and modifications and variations may be possible in light of the above teachings or may be acquired from practice of the disclosed implementations. It is intended that the scope of the invention be defined by the claims appended hereto and their equivalents.

Claims

1. A wireless communication method, the wireless communication method comprising: a wireless communication device dividing an uplink transmission into a plurality of virtual uplink transmissions based on one or more time domain parameters, the one or more time domain parameters including a time domain threshold, a duration of the uplink transmission, and at least one of a slot boundary or an invalid symbol, each of one or more of the plurality of virtual uplink transmissions having a duration equal to the time domain threshold; determining, by the wireless communication device, a time domain location of each of one or more demodulation reference signals for each of the plurality of virtual uplink transmissions; A wireless communication method comprising:

2. The method of claim 1 , further comprising: the wireless communication device repeatedly transmitting the uplink transmission to a wireless communication node.

3. The wireless communication method includes:

2. The wireless communication method of claim 1, further comprising: the wireless communication device determining a time domain location of each of the one or more demodulation reference signals by using a duration of the one or more virtual uplink transmissions as a duration parameter indicated in a preconfigured table for each of the one or more virtual uplink transmissions.

4. a remaining virtual uplink transmission of the plurality of virtual uplink transmissions having a duration less than the time domain threshold; The wireless communication method includes:

4. The wireless communication method of claim 3, further comprising: the wireless communication device determining the time domain positions of each of the one or more demodulation reference signals by using a duration of the remaining virtual uplink transmission as the duration parameter indicated in the preconfigured table for the remaining virtual uplink transmission.

5. The method of claim 1 , wherein the one or more time domain parameters include a duration of the uplink transmission and a number of the plurality of virtual uplink transmissions.

6. one or more of the plurality of virtual uplink transmissions each have a duration equal to (floor(duration of the uplink transmission) / (number of the plurality of virtual uplink transmissions)); The wireless communication method includes:

6. The wireless communication method of claim 5, further comprising: the wireless communication device determining a time domain location of each of the one or more demodulation reference signals by using a duration of the one or more virtual uplink transmissions as a duration parameter indicated in a preconfigured table for each of the one or more virtual uplink transmissions.

7. a remaining virtual uplink transmission of the plurality of virtual uplink transmissions has a duration equal to (duration of the uplink transmission-floor(duration of the uplink transmission) / (number of the plurality of virtual uplink transmissions)); The wireless communication method includes:

7. The wireless communication method of claim 6, further comprising: the wireless communication device determining the time domain positions of each of the one or more demodulation reference signals by using a duration of the remaining virtual uplink transmission as the duration parameter indicated in the preconfigured table for the remaining virtual uplink transmission.

8. one or more of the plurality of virtual uplink transmissions each have a duration equal to (ceil((duration of the uplink transmission) / (number of the plurality of virtual uplink transmissions))); The wireless communication method includes:

6. The wireless communication method of claim 5, further comprising: the wireless communication device determining a time domain location of each of the one or more demodulation reference signals by using a duration of the one or more virtual uplink transmissions as a duration parameter indicated in a preconfigured table for each of the one or more virtual uplink transmissions.

9. a remaining virtual uplink transmission of the plurality of virtual uplink transmissions has a duration equal to (duration of the uplink transmission-ceil((duration of the uplink transmission) / (number of the plurality of virtual uplink transmissions))); The wireless communication method includes:

9. The wireless communication method of claim 8, further comprising: the wireless communication device determining the time domain location of each of the one or more demodulation reference signals by using a duration of the remaining virtual uplink transmission as the duration parameter indicated in the preconfigured table for the remaining virtual uplink transmission.

10. a first virtual uplink transmission and a second virtual uplink transmission of the plurality of virtual uplink transmissions are separated by the slot boundary or the invalid symbol, the first virtual uplink transmission having a first duration and the second virtual uplink transmission having a second duration; The wireless communication method includes: determining, by the wireless communication device, for the first virtual uplink transmission, a time domain location of each of the one or more demodulation reference signals by using the first duration as a duration parameter indicated in a preconfigured table; determining, by the wireless communication device, for the second virtual uplink transmission, the time domain positions of the respective one or more demodulation reference signals by using the second duration as the duration parameter indicated in the preconfigured table; The wireless communication method of claim 1 , further comprising:

11. 1. A wireless communication device, comprising: The wireless communication device comprises at least one processor; The at least one processor partitioning an uplink transmission into a plurality of virtual uplink transmissions based on one or more time domain parameters, the one or more time domain parameters including a time domain threshold, a duration of the uplink transmission, and at least one of a slot boundary or an invalid symbol, each of one or more of the plurality of virtual uplink transmissions having a duration equal to the time domain threshold; determining a time domain location of each of one or more demodulation reference signals for each of the plurality of virtual uplink transmissions; 16. A wireless communication device configured to:

12. 12. The wireless communication device of claim 11, wherein the at least one processor is further configured to repeatedly send, via a transmitter, the uplink transmission to a wireless communication node.

13. The at least one processor 12. The wireless communication device of claim 11, further configured to determine the respective time domain positions of the one or more demodulation reference signals by using a duration of the one or more virtual uplink transmissions as a duration parameter indicated in a preconfigured table for each of the one or more virtual uplink transmissions.

Images