Systems and methods for enhancing uplink transmissions

Abstract

This document discloses systems and methods for wireless communication. 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 determines, for each virtual uplink transmission, a corresponding time-domain position of one or more demodulation reference signals by the wireless communication device. Example implementations also include a wireless communication method in which a wireless communication device determines the number of valid symbols in the uplink transmission; and determines, for each uplink transmission, a corresponding time-domain position of one or more demodulation reference signals by the wireless communication device.

Description

Technical Field

[0001] This implementation relates generally to the telecommunications field, and more specifically to enhanced uplink transmission. Background Technology

[0002] With the increasing digitalization of society, wireless communication services are covering more and more application scenarios. Among them, enhanced mobile broadband, ultra-reliable low-latency communication, and massive machine-type communication have become the three major scenarios supported by fifth-generation (5G) systems. However, conventional systems may not be able to effectively meet the uplink transmission coverage requirements to transmit low-latency and high-reliability services in a short transmission time. Therefore, a technical solution for enhancing uplink transmission is needed. Summary of the Invention

[0003] The exemplary implementations disclosed herein are intended to address difficulties related to one or more of the problems presented in the prior art, and to provide additional features that will become readily apparent when viewed in conjunction with the accompanying drawings and by referring to the following detailed description. Exemplary systems, methods, apparatuses, and computer program products are disclosed herein according to various implementations. However, it should be understood that these implementations are presented by way of example and not as limiting, and various modifications can be made to the disclosed implementations by those skilled in the art who read this disclosure while remaining within the scope of this disclosure.

[0004] An example implementation includes a wireless communication method comprising: dividing an uplink transmission into multiple virtual uplink transmissions by a wireless communication device based on one or more time-domain parameters; and determining, for each of the multiple virtual uplink transmissions, a corresponding time-domain location of one or more demodulation reference signals by the wireless communication device.

[0005] The example implementation also includes a wireless communication method comprising: determining, by a wireless communication device, the number of valid symbols in the uplink transmission; and determining, by the wireless communication device, the corresponding time-domain position of one or more demodulation reference signals for the uplink transmission.

[0006] The example implementation also includes a wireless communication method comprising: identifying one or more valid symbols of an uplink transmission by a wireless communication device; dividing the uplink transmission into a first uplink transmission and a second uplink transmission by the wireless communication device, wherein the first uplink transmission and the second uplink transmission are separated by one or more valid symbols; and determining, for each of the first uplink transmission and the second uplink transmission, a corresponding time-domain location of one or more demodulation reference signals by the wireless communication device. Attached Figure Description

[0007] Various exemplary embodiments of this solution are described in detail below with reference to the figures or accompanying drawings. The drawings are provided for illustrative purposes only and depict only exemplary embodiments of the solution to aid the reader's understanding. Therefore, the drawings should not be construed as limiting the breadth, scope, or applicability of this solution. It should be noted that these drawings are not necessarily drawn to scale for clarity and ease of explanation.

[0008] Figure 1 An example cellular communication network is shown, in which the techniques and other aspects disclosed herein can be implemented according to embodiments of the present disclosure.

[0009] Figure 2 This is a schematic diagram illustrating an example of generating at least one virtual PUSCH that includes at least one invalid symbol and meets a threshold, according to some implementations of this disclosure.

[0010] Figure 3 This is a schematic diagram illustrating an example of generating at least one virtual PUSCH that includes at least one invalid symbol and conforms to the number of virtual PUSCHs according to some implementations of this disclosure.

[0011] Figure 4 This is a schematic diagram illustrating an example of at least one DMRS symbol generated according to some implementations of this disclosure, conforming to the number of transmittable symbols.

[0012] Figure 5 This is a schematic diagram illustrating an example of generating at least one virtual PUSCH that excludes at least one invalid symbol according to some implementations of this disclosure.

[0013] Figure 6 This is a schematic diagram illustrating an example of the generation of at least one DMRS symbol conforming to the number of invalid symbols according to some implementations of this disclosure.

[0014] Figure 7 This is a schematic diagram illustrating an example of generating at least one virtual PUSCH that excludes at least one invalid symbol and spans at least one time slot boundary according to some implementations of this disclosure.

[0015] Figure 8A A block diagram of an example base station according to some implementations of this disclosure is shown.

[0016] Figure 8B A block diagram of an example UE according to some implementations of this disclosure is shown.

[0017] Figure 9 A first example method based on some implementations of this disclosure is shown.

[0018] Figure 10 A second example method based on some implementations of this disclosure is shown.

[0019] Figure 11 A third example method based on some implementations of this disclosure is shown. Detailed Implementation

[0020] The present implementation will now be described in detail with reference to the accompanying drawings, which are provided as illustrative examples of the implementation to enable those skilled in the art to practice implementations and alternatives that are readily apparent to them. The drawings and examples below do not imply limitation of the scope of the present implementation to a single implementation; rather, other implementations are possible by interchangeing some or all of the elements described or illustrated. Furthermore, where certain elements of the present implementation are implemented partially or entirely using known components, only those portions of such known components necessary for understanding the present implementation will be described, and detailed descriptions of other portions of such known components will be omitted to avoid obscuring the present implementation. An implementation described as being implemented in software should not be limited thereto, but may include implementations implemented in hardware or a combination of software and hardware, and vice versa, as will be apparent to those skilled in the art, unless otherwise specified herein. In this specification, the depiction of implementations of a single component should not be considered limiting; rather, this disclosure is intended to cover other implementations comprising multiple identical components, and vice versa, unless expressly stated herein. Furthermore, the applicant does not intend to assign any terminology in the specification or claims an unusual or special meaning unless expressly stated otherwise. Furthermore, this implementation covers current and future known equivalents of known components mentioned herein by way of description.

[0021] In various wireless implementations, ensuring coverage and delivering low-latency, high-reliability services in short transmission times is advantageous. Therefore, in some implementations, transmission via one or more methods of uplink (UL) transmission is advantageous. As an example, transmission may include dynamically scheduled aggregation transmission (transport block aggregation for uplink transmission). As another example, transmission may include unscheduled repetitive transmission (transport block repetition with configured authorization for uplink transmission). Furthermore, in some implementations, enhancing the repetitive transmission of at least one Physical Uplink Shared Channel (PUSCH) or Transport Block (TB) is advantageous. Therefore, in some implementations, the same PUSCH or TB is retransmitted once or multiple times in the same time slot. In some implementations, at least one of the same PUSCH and the same TB is repeatedly transmitted across time slot boundaries in multiple consecutive time slots. In some implementations, the Msg3 PUSCH, authorized and scheduled by RAR UL, is transmitted only once in Type 1 random access procedures under various protocols. Furthermore, in some implementations, the Msg A PUSCH is transmitted only once in Type 2 random access procedures.

[0022] In some implementations, under various protocols, it is advantageous to repeat the transmission of at least one of PUSCH and TB to satisfy at least one coverage requirement. As an example, repeated transmissions may include allowing PUSCH to be transmitted across time slot boundaries, invalid symbols, and PUSCH time-domain duration. In some implementations, the PUSCH time-domain duration exceeds 14 symbols. However, it should be understood that in some implementations, the PUSCH time-domain duration may be equal to or less than 14 symbols. Therefore, under various protocols, it is advantageous to determine the location of the demodulation reference signal (DMRS) in the time domain. In some implementations, under various protocols, it is advantageous to satisfy one or more coverage requirements of one or more of Msg3 PUSCH and Msg A PUSCH. In some implementations, the coverage requirements of one or more of Msg3 PUSCH and Msg A PUSCH include introducing multiple repetitions. Furthermore, it is advantageous to satisfy coverage requirements (or multiple requirements) with one or more alternative, complementary, or similar repeated transmission types.

[0023] In some implementations, it is advantageous to ensure coverage and deliver low-latency, high-reliability services within short transmission times under various protocols. In some implementations, the aggregation of uplink transmissions via downlink control information (DCI) is based at least in part on one or more of dynamic scheduling and unscheduled repetitions. In some implementations, a specific repetition transmission pattern is obtained based on one or more example procedures. As an example, Time Domain Resource Allocation (TDRA) can be used to notify, set, determine, etc., the starting symbol and time domain duration of the first nominal repetition, and at least one of the number of repetitions. In this example, the remaining nominal repetitions can be back-to-back continuous transmissions. As another example, nominal repetitions spanning time slot boundaries can be divided into multiple actual transmissions. As yet another example, nominal repetitions encountering symbols that cannot be transmitted can be divided into multiple actual transmissions.

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

[0025] Figure 1An example wireless communication network and / or system 100 according to embodiments of this disclosure is illustrated, in which the technologies disclosed herein may be implemented. In the following discussion, wireless communication network 100 may be any wireless network, such as a cellular network or a narrowband Internet of Things (NB-IoT) network, and is referred to herein as "network 100". Such an example network 100 includes a base station 102 (hereinafter referred to as "BS 102") and a user equipment device 104 (hereinafter referred to as "UE 104"), which can communicate with each other via a communication link 110 (e.g., a wireless communication channel), and such an example network 100 also includes clusters of cells 126, 130, 132, 134, 136, 138, and 140 covering a geographic area 101. Figure 1 In this context, BS102 and UE 104 are included within the respective geographical boundaries of cell 126. Each of the other cells 130, 132, 134, 136, 138, and 140 may include at least one base station that operates with its allocated bandwidth to provide sufficient radio coverage to its intended users.

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

[0027] Figure 2 This is a schematic diagram illustrating example generation of at least one virtual PUSCH, including at least one invalid symbol and meeting a threshold, according to some implementations of this disclosure. Example implementation 200 describes a first example schematic diagram for determining the DMRS location based on the temporal duration of the PUSCH. In some implementations, example implementation 200 includes at least a portion of a slot sequence 210, one or more temporal symbols 220, one or more invalid temporal 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 example system determines the DMRS location based on a time-domain threshold X. In some implementations, the time-domain duration of the first PUSCH 230 is divided into multiple virtual PUSCHs based on the threshold X. In some implementations, PUSCH 230 can be divided into three virtual PUSCHs 232, 234, and 236. It should be understood that PUSCH 230 can be divided into any number of virtual PUSCHs. In some implementations, each virtual PUSCH 232, 234, and 236 is determined according to a PUSCHDMRS location rule specified by a predetermined value. In some implementations, the location rule is defined by one or more various telecommunications protocols, etc. In some implementations, the threshold X is a natural number greater than or equal to 1. As an example, the threshold X can be equal to 7, such as... Figure 2 The following example illustrates this. In this example, the first PUSCH 230 is divided into three virtual PUSCHs 232, 234, and 234. The first virtual PUSCH 232 includes 7 symbols, the second virtual PUSCH includes 7 symbols, and the third virtual PUSCH includes all the remaining 3 symbols of the first PUSCH 230.

[0029] In some implementations, the example systems determine one or more DMRS locations for each virtual PUSCH 232, 234, and 236 based on the correspondences in Table 1. Table 1 shows an example correspondence between PUSCH symbols and DMRS locations within a time slot for a single-symbol DMRS, where intra-slot frequency hopping is disabled, and the parameter "l" is used. d "l0" and "l0" refer to the time-domain duration of the (virtual) PUSCH transmission and the time-domain position of the first symbol of the (virtual) PUSCH transmission, respectively.

[0030]

[0031] Table 1

[0032] Figure 3 This is a schematic diagram illustrating example generation of at least one virtual PUSCH, including at least one invalid symbol and conforming to the number of virtual PUSCHs, according to some implementations of this disclosure. Example implementation 300 describes a second example schematic diagram for determining the DMRS location based on the time-domain duration of the PUSCH. In some implementations, 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.

[0033] In some implementations, the time domain of the first PUSCH 330 is equally divided into several virtual PUSCHs, and each PUSCH is determined according to a PUSCH DMRS location rule specified by one or more various telecommunications protocols, etc. In some implementations, the average cardinality is N. In some implementations, N is a natural number greater than or equal to 1. For example, if N is 2, then 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. In this example, the time-domain length of the second virtual PUSCH 334 is 9 symbols. As another example, the time-domain length of the first virtual PUSCH is 9 symbols. In this example, the time-domain length of the second virtual PUSCH is 8 symbols. .

[0034] Figure 4 This is a schematic diagram illustrating example generation of at least one DMRS symbol conforming to the number of transmittable symbols according to some implementations of this disclosure. Example implementation 400 describes a third example schematic diagram of determining the DMRS position based on the time-domain duration of the PUSCH. In some implementations, example implementation 400 includes at least a portion of a time 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 time slot sequence 410 includes a time slot boundary 412. In some implementations, the first PUSCH 430 includes one or more DMRS positions 424.

[0035] In some implementations, the time-domain duration is the number of symbols actually transmitted for a given PUSCH. Therefore, in some implementations, the time-domain duration does not include non-transferable, invalid, or similar symbols 422. In some implementations, the transferable symbols 420 in the first PUSCH 430 are based on PUSCH DMRS location rules specified by one or more various telecommunications protocols, etc. For example... Figure 4 As an example, the example time-domain duration is 14 symbols, excluding the 3 non-transferable 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.

[0036] Figure 5This is a schematic diagram illustrating example generation of at least one virtual PUSCH excluding at least one invalid symbol according to some implementations of this disclosure. Example implementation 500 describes a fourth example schematic diagram of determining the DMRS location based on slot boundaries and at least one of one or more invalid symbols. In some implementations, 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 multiple virtual PUSCHs based on slot boundaries and at least one of 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 specified by various protocols. It should be understood that the first PUSCH 530 can be divided into more or fewer virtual PUSCHs.

[0037] Figure 6 This is a schematic diagram illustrating example generation of at least one DMRS symbol conforming to the number of invalid symbols according to some implementations of this disclosure. Example implementation 600 describes a fifth example schematic diagram of determining DMRS positions based on at least one DMRS position. In some implementations, 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 positions 624. In some implementations, the first PUSCH 630 includes one or more DMRS positions 624 corresponding to invalid symbols 626.

[0038] In some implementations, the temporal duration of a first PUSCH 630, including one or more nontransferable or invalid symbols 626 and a symbol index determined by at least one DMRS position 624, also includes one or more nontransferable symbols 628. Therefore, in some implementations, the example system enters a state where the DMRS position is located on a nontransferable symbol and there are no DMRS in the temporal domain immediately following the invalid symbol 626 in the first PUSCH 630. In some implementations, the latter part of the first PUSCH 630 shares the DMRS of the former part of the first PUSCH 630. Alternatively, in some implementations, the example system places DMRS 624 on a first symbol at the latter part of the first PUSCH 630. In some implementations, the placement of DMRS is based at least in part on a threshold Y and the number of invalid symbols. As an example, in response to the number of invalid symbols 626 being less than or equal to the threshold Y, the latter part of the first PUSCH 630 shares the DMRS of the former part of the first PUSCH 630. As another example, in response to the number of invalid symbols exceeding the threshold Y, the example system places DMRS 624 on the first symbol of the first PUSCH 630.

[0039] Figure 7 This is a schematic diagram illustrating example generation of at least one virtual PUSCH that excludes at least one invalid symbol and crosses at least one time slot boundary according to some implementations of this disclosure. Example implementation 700 describes some implementations for determining DMRS location based on at least one of time slot boundaries and one or more invalid symbols. In some implementations, example implementation 700 includes at least a portion of a time 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 time slot sequence 710 includes a time 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 divided into multiple virtual PUSCHs based on at least one of time slot boundaries 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 specified by various protocols. It should be understood that the first PUSCH 730 can be divided into more or fewer virtual PUSCHs.

[0040] In some implementations, under various protocols, multiple symbols in a time slot may include uplink symbols (DL, downlink symbols), downlink symbols (UL, uplink symbols), and flexible symbols (F, flexible symbols) configured with a semi-static frame structure. In some implementations, only uplink symbols configured with a semi-static frame structure and some flexible symbols can be used for uplink information to be transmitted by the terminal. In some implementations, a conflict will occur when the transmitted uplink information encounters a dynamic SFI (Dynamic Slot Format Indicator) indicating a D or F symbol. In some implementations, under various protocols, when a specific PUSCH in an uplink transmission with configuration authorization encounters a dynamic SFI indicating D or F, the PUSCH will be discarded.

[0041] In some implementations, under various protocols, specific PUSCH transmissions are allowed to cross time slot boundaries or cannot transmit symbols, and the time domain duration is greater than 14 symbols, such as... Figure 7 As shown in the example, in some implementations, when symbols #10 and #11 of slot #3 corresponding to PUSCHRep #1 are dynamically indicated as D or F by the SFI, they are directly discarded under various protocols, which may affect the coverage performance of PUSCH.

[0042] Therefore, in some implementations, the terminal acquires configuration information to complete unscheduled PUSCH transmissions. In some implementations, the terminal acquires configuration information via RRC signaling or DCI. When configuration information is configured or enabled, rate matching is performed on the PUSCH transmission. When configuration information is configured or enabled, the terminal does not receive or detect dynamic SFI. In response, the terminal continues to send PUSCH Rep#1. Furthermore, in some implementations, rate matching is performed on the PUSCH transmission. For example, the first two symbols of PUSCH Rep#1 are deleted, and the remaining symbols are used for transmission.

[0043] In some implementations, under various protocols, specific PUSCH transmissions are allowed to cross slot boundaries where symbols cannot be transmitted, and the duration in the time domain is greater than 14 symbols. In some implementations, when PUSCH and PUCCH transmissions overlap in the time domain, the overlap includes both transmittable and non-transmittable PUSCH symbols. After PUSCH Rep#1 encounters a non-transmittable symbol, it is virtualized into two PUSCHs, and then the UCI carried on the PUCCH is multiplexed on the earliest virtual PUSCH #1 that satisfies the timeline. The timeline refers to the specification in Section 9.2.5 of standard 38.213. For example, in some implementations, the start symbol of the first PUSCH or PUCCH to be transmitted must satisfy the following timeline condition: the start symbol is not earlier than any PDSCH time. The time after the end. In some implementations, any PDSCH refers to one or more PDSCHs corresponding to the HARQ-ACK codebook included in the UCI.

[0044] Furthermore, in some implementations, PUSCH and PUCCH transmissions overlap in the time domain. In response, when the UCI carried on the PUCCH is multiplexed on the earliest virtual PUSCH#1 satisfying the timeline, the number of all coded modulation symbols for each layer of the UCI is determined based on the PUSCH. Additionally, in some implementations, the number of coded modulation symbols for each information layer of the UCI is limited to the total number of resources multiplexed on the virtual PUSCH. In some implementations, the number of all modulation symbols in each information layer refers to HARQ-ACK (hybrid ARQ), CSI Part 1 (channel saturation information, channel state information), and CSI Part 2. In some implementations, PUSCH Rep#1 (including non-transmittable symbols) spans time slot boundaries. The number of all modulation symbols for each information layer of the UCI is defined to not exceed the total number of resources multiplexed on the virtual PUSCH. In some implementations, the PUSCH is divided into two virtual PUSCHs based on non-transmittable symbols, which does not exceed the number of resources multiplexed in virtual PUSCH#1. Furthermore, the PUSCH transmission carries either TB or UL-SCH.

[0045] In some implementations, the PUSCH is repeatedly transmitted multiple times, a particular PUSCH transmission is allowed to cross time slot boundaries or cannot transmit symbols, and the time domain duration is greater than 14 symbols. In some implementations, for these uplink repeated transmissions, the PUSCH transmission opportunity i and the corresponding transmission power can be determined by the following methods. PUSCH transmission opportunity i refers to a virtually partitioned PUSCH. Therefore, in some implementations, the virtually partitioned PUSCH can be determined by at least one of the following methods.

[0046] In some implementations, the example system determines the partitioning based on a time-domain threshold X. The time-domain duration of a PUSCH is divided into a certain number of virtual PUSCHs based on the threshold X. In some implementations, the example system divides a PUSCH into several virtual PUSCHs based on slot boundaries or invalid symbols. Therefore, in some implementations, each virtual PUSCH has the same transmission power. Furthermore, in some implementations, a PUSCH is repeatedly transmitted multiple times, a transmission of a PUSCH is allowed to cross slot boundaries or cannot transmit symbols, and the time-domain duration is greater than 14 symbols. For these uplink repeated transmissions, in some implementations, the transport block size (TBS) of the PUSCH can be determined based on the PUSCH with the longest virtual segment time domain. The virtual partitioned PUSCHs can be determined using the methods described in the above embodiments. In some implementations, the TBS can also be determined based on the PUSCH with the shortest virtual segment time domain.

[0047] Figure 8A A block diagram of an example base station 802 according to some implementations of this disclosure is shown. Figure 8B A block diagram of an example UE 801 according to some implementations of this disclosure is shown. References Figures 1-7 UE 801 (e.g., wireless communication device, terminal, mobile device, mobile user, etc.) is an example implementation of the UE described herein, and base station 802 is an example implementation of the base station described herein.

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

[0049] 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. Modules 810, 812, 814, 816, and 818 are operably coupled and interconnected with each other via a data communication bus 820. UE 801 includes a UE transceiver module 830, a UE antenna 832, a UE memory module 834, and a UE processor module 836. Modules 830, 832, 834, and 836 are operably coupled and interconnected with each other via a data communication bus 840. Base station 802 communicates with UE 801 or another base station via a communication channel, which can be any wireless channel or other medium suitable for data transmission as described herein.

[0050] As will be understood by those skilled in the art, base station 802 and UE 801 may also include, in addition to Figure 8A and Figure 8B Any number of modules other than those shown. The various illustrative blocks, modules, circuits, and processing logic described in conjunction with the implementations disclosed herein can 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 according to their functionality. Whether such functionality is implemented as hardware, firmware, or software can depend on the specific application and design constraints imposed on the system as a whole. The implementations described herein can be implemented in a manner suitable for each specific application, but any implementation decision should not be construed as limiting the scope of this disclosure. According to some implementations, UE transceiver 830 includes a radio frequency (RF) transmitter and an RF receiver, each of which includes a circuitry coupled to 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 implementations, transceiver 810 includes an RF transmitter and an RF receiver, each of which has a circuitry coupled to antenna 812 or an antenna of another base station. A duplex switch can alternatively couple an RF transmitter or receiver to antenna 812 in a time-duplex manner. The operation of the two transceiver modules 810 and 830 can be time-coordinated, such that the receiver circuitry is coupled to antenna 832 to receive a transmission via the wireless link at the same time the transmitter is coupled to antenna 812. In some implementations, there is tight time synchronization and a minimum guard time between changes in duplex direction.

[0051] UE transceiver 830 and transceiver 810 are configured to communicate via a wireless data communication link and cooperate with a suitably configured RF antenna arrangement 812 / 832 that can support specific wireless communication protocols and modulation schemes. In some illustrative implementations, UE transceiver 830 and transceiver 810 are configured to support industry standards such as Long Term Evolution (LTE) and emerging 5G standards. However, it should be understood that this disclosure is not necessarily limited to application to specific standards and related protocols. Rather, UE transceiver 830 and base transceiver 810 can be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.

[0052] Transceiver 810 and transceivers of another base station (such as, but not limited to, transceiver 810) are configured to communicate via a wireless data communication link and cooperate with a suitably configured RF antenna arrangement that can support specific wireless communication protocols and modulation schemes. In some illustrative implementations, transceiver 810 and the transceiver of the other base station are configured to support industry standards such as LTE and emerging 5G standards. However, it should be understood that this disclosure is not necessarily limited to application to specific standards and related protocols. Rather, transceiver 810 and the transceiver of the other base station may be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.

[0053] Depending on the implementation, for example, base station 802 can be a base station such as, but not limited to, an eNB, serving eNB, target eNB, femtocell, or picocell. Base station 802 can be an RN, conventional, DeNB, or gNB. In some implementations, UE 801 can be embodied in various types of user equipment, such as mobile phones, smartphones, personal digital assistants (PDAs), tablets, laptops, wearable computing devices, etc. Processor modules 814 and 836 can be implemented or implemented using a general-purpose processor, content-addressable memory, digital signal processor, application-specific integrated circuit, 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 way, the processor can be implemented as a microprocessor, controller, microcontroller, state machine, etc. The processor can 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 combined with a digital signal processor core, or any other such configuration.

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

[0055] Network communication module 818 typically represents the hardware, software, firmware, processing logic, and / or other components of base station 802 that enable bidirectional communication between transceiver 810 and other network components and communication nodes communicating with base station 802. For example, network communication module 818 may be configured to support Internet or WiMAX services. In deployment, but not limited to, network communication module 818 provides an 802.3 Ethernet interface, enabling transceiver 810 to communicate with conventional Ethernet-based computer networks. In this way, network communication module 818 may include a physical interface for a connection to a computer network (e.g., a mobile switching center (MSC)). In some implementations, network communication module 818 includes a fiber optic transmission connection configured to connect base station 802 to the core network. The terms “configured for,” “configured as,” and their variations, as used herein in relation to a specified operation or function, refer to devices, components, circuits, structures, machines, signals, etc., that are physically constructed, programmed, formatted, and / or arranged to perform a specified operation or function.

[0056] Figure 9Example methods according to some implementations of this disclosure are illustrated. In some implementations, at least one of base station 802 and UE 801 performs method 900 according to this implementation. In some implementations, method 900 begins at step 910. In step 910, the example system divides the uplink transmission into multiple virtual uplink transmissions based on one or more time-domain parameters. In some implementations, step 910 includes step 912. Method 910 then continues to step 920. In step 920, the example system determines the corresponding time-domain positions of one or more demodulation reference signals. In some implementations, method 900 ends at step 920.

[0057] Figure 10 Example methods according to some implementations of this disclosure are illustrated. In some implementations, at least one of base station 802 and UE 801 performs method 1000 according to this implementation. In some implementations, method 1000 begins at step 1010. In step 1010, the example system determines the number of valid symbols transmitted in the uplink. Then, method 1000 continues to step 1020. In step 1020, the example system determines the corresponding time-domain positions of one or more demodulation reference signals. In some implementations, method 1000 ends at step 1020.

[0058] Figure 11 Example methods according to some implementations of this disclosure are illustrated. In some implementations, at least one of base station 802 and UE 801 performs method 1100 according to the implementation. In some implementations, method 1100 begins at step 1110. In step 1110, the example system identifies one or more invalid symbols in the uplink transmission. Then, method 1100 continues to step 1120. In step 1120, the example system divides the uplink transmission into a first uplink transmission and a second uplink transmission, wherein the first uplink transmission and the second uplink transmission are separated by one or more invalid symbols. In some implementations, step 1120 includes step 1122. Method 1100 continues to step 1130. In step 1130, the example system determines the corresponding time-domain positions of one or more demodulation reference signals. In some implementations, method 1100 ends at step 1130.

[0059] The topics described herein sometimes illustrate different components contained within or connected to different other components. It should be understood that the architectures described in this way are illustrative, and in fact, many other architectures capable of achieving the same functionality can be implemented. Conceptually, any arrangement of components that achieves the same functionality is a valid “association” such that the desired functionality is achieved. Therefore, any two components combined in this document to achieve a particular functionality can be considered as “associated” with each other such that the desired functionality is achieved, regardless of the architecture or intermediate components. Similarly, any two components so associated can also be considered as “operably connected” or “operably coupled” with each other to achieve the desired functionality, and any two components that can be so associated can also be considered as “operably coupled” with each other to achieve the desired functionality. Specific examples of operational coupling include, but are not limited to, physically matable and / or physically interactive components and / or wirelessly interactive and / or logically interactive and / or logically interactive components.

[0060] Regarding the use of plural and / or singular terms in this document, those skilled in the art can translate plural to singular and / or singular to plural depending on the context and / or application. For clarity, various singular / plural arrangements may be explicitly described herein.

[0061] Those skilled in the art will understand that, generally, the terms used herein and particularly in the appended claims (e.g., the body of the appended claims) are intended to be “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 “including but not limited to”, etc.).

[0062] Although the accompanying drawings and descriptions may illustrate a specific order of method steps, the order of these steps may differ from that depicted and described unless otherwise specified above. Furthermore, two or more steps may be performed simultaneously or partially simultaneously, unless otherwise specified above. For example, such variations may depend on the chosen software and hardware system and the designer's choices. All such variations are within the scope of this disclosure. Similarly, the software implementation of the described method can be accomplished using standard programming techniques with rule-based logic and other logic to perform various connection steps, processing steps, comparison steps, and decision steps.

[0063] Those skilled in the art will further understand that if there is an intention to introduce a specific number of claim statements, such intention will be explicitly stated in the claims, and without such a statement, there is no such intention. For example, to aid understanding, the following appended claims may contain the use of the introductory phrases “at least one” and “one or more” to introduce claim statements. However, the use of such phrases should not be construed as implying that the introduction of claim statements by the indefinite article “a (a)” or “an” limits any particular claim that includes such an introductory claim statement to an invention containing only one such statement, even if the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a (a)” or “an” (e.g., “a (a)” and / or “an” should generally be interpreted as “at least one” or “one or more”); the same applies to the use of definite articles used to introduce claim statements. Furthermore, even if a specific number of the introduced claim statements are explicitly listed, those skilled in the art will recognize that such statements should generally be interpreted as indicating at least the number listed (e.g., a simple statement of "two statements" without other modifiers generally indicates at least two statements, or two or more statements).

[0064] Furthermore, when using conventions such as "at least one of A, B, and C," such a construction is generally intentional in the sense that a person skilled in the art would understand from the meaning of the convention (e.g., "a system having at least one of A, B, and C" includes, but is not limited to, systems having only A, only B, only C, A and B together, A and C together, B and C together, and / or A, B, and C together, etc.). When using conventions such as "at least one of A, B, or C," such a construction is intentional in the sense that a person skilled in the art would understand from the meaning of the convention (e.g., "a system having at least one of A, B, or C" includes, but is not limited to, systems having only A, only B, only C, A and B together, A and C together, B and C together, and / or A, B, and C together, etc.). A person skilled in the art will further understand that any extractive words and / or phrases presenting two or more alternative terms, whether in the specification, claims, or drawings, should be understood to presuppose the possibility of including one of these terms, none of these terms, or both terms. For example, the phrase “A or B” would be understood to include the possibility of “A” or “B” or “A and B”.

[0065] In addition, unless otherwise stated, the use of words such as “approximately,” “about,” “around,” and “basically” indicates plus or minus ten percent.

[0066] For purposes of illustration and description, the above description of illustrative implementations has been given. It is not intended to be exhaustive or limiting regarding the precise forms disclosed, and modifications and variations are possible, or may be derived from the practice of the disclosed implementations, in accordance with the above teachings. The scope of the invention is intended to be defined by the appended claims and their equivalents.

Claims

1. A wireless communication method, comprising: A wireless communication device divides an uplink transmission into multiple virtual uplink transmissions based on one or more time-domain parameters, wherein the one or more time-domain parameters include a time-domain threshold, the duration of the uplink transmission, and at least one of the following: time slot boundaries and invalid symbols, wherein one or more of the multiple virtual uplink transmissions each have a duration equal to the time-domain threshold, and another virtual uplink transmission among the multiple virtual uplink transmissions has a duration less than the time-domain threshold; as well as The wireless communication device determines the corresponding time-domain position of one or more demodulation reference signals for each of the plurality of virtual uplink transmissions.

2. The wireless communication method according to claim 1, further comprising: The uplink transmission is repeatedly sent from the wireless communication device to the wireless communication node.

3. The wireless communication method according to claim 1, wherein the wireless communication method further comprises: The wireless communication device determines the corresponding time-domain position of the one or more demodulation reference signals for each of the one or more virtual uplink transmissions by using the duration of the one or more virtual uplink transmissions as a duration parameter indicated in a pre-configuration table.

4. The wireless communication method according to claim 3, further comprising: The wireless communication device determines the corresponding time-domain position of the one or more demodulation reference signals by using the duration of the other virtual uplink transmission as the duration parameter indicated in the pre-configuration table for that other virtual uplink transmission.

5. The wireless communication method according to claim 1, wherein the one or more time-domain parameters include the duration of the uplink transmission and the number of virtual uplink transmissions.

6. The wireless communication method of claim 5, wherein one or more of the plurality of virtual uplink transmissions each has a duration equal to (floor((the duration of the uplink transmission) / (the number of virtual uplink transmissions))), the method further comprising: The wireless communication device determines the corresponding time-domain position of the one or more demodulation reference signals for each of the one or more virtual uplink transmissions by using the duration of the one or more virtual uplink transmissions as a duration parameter indicated in a pre-configuration table.

7. The wireless communication method of claim 6, wherein the remaining virtual uplink transmissions in the plurality of virtual uplink transmissions have a duration equal to (the duration of the uplink transmission - floor((the duration of the uplink transmission) / (the number of virtual uplink transmissions))), the method further comprising: The wireless communication device determines the corresponding time-domain position of the one or more demodulation reference signals by using the duration of the remaining virtual uplink transmission as the duration parameter indicated in the pre-configuration table.

8. The wireless communication method of claim 5, wherein one or more of the plurality of virtual uplink transmissions each has a duration equal to (ceil((the duration of the uplink transmission) / (the number of virtual uplink transmissions))), the method further comprising: The wireless communication device determines the corresponding time-domain position of the one or more demodulation reference signals for each of the one or more virtual uplink transmissions by using the duration of the one or more virtual uplink transmissions as a duration parameter indicated in a pre-configuration table.

9. The wireless communication method of claim 8, wherein the remaining virtual uplink transmissions in the plurality of virtual uplink transmissions have a duration equal to (the duration of the uplink transmission - ceil((the duration of the uplink transmission) / (the number of virtual uplink transmissions))), the method further comprising: The wireless communication device determines the corresponding time-domain position of the one or more demodulation reference signals by using the duration of the remaining virtual uplink transmission as the duration parameter indicated in the pre-configuration table.

10. The wireless communication method according to claim 1, wherein the first virtual uplink transmission and the second virtual uplink transmission in the plurality of virtual uplink transmissions are separated by the time slot boundary or the invalid symbol, the first virtual uplink transmission has a first duration, and the second virtual uplink transmission has a second duration, the method further comprising: The wireless communication device, for the first virtual uplink transmission, determines the corresponding time-domain position of the one or more demodulation reference signals by using the first duration as a duration parameter indicated in a pre-configuration table; and The wireless communication device determines the corresponding time-domain position of the one or more demodulation reference signals for the second virtual uplink transmission by using the second duration as the duration parameter indicated in the pre-configuration table.

11. A wireless communication device comprising a processor and a memory, wherein the processor is configured to read code from the memory and implement the method according to any one of claims 1 to 10.

12. A computer program product comprising computer-readable program medium code stored thereon, the code, when executed by a processor, causing the processor to implement the method according to any one of claims 1 to 10.

Images