Repeat transmission method in communication system

Abstract

Methods, systems, and devices relate to digital wireless communications, and more specifically, to techniques related to improved repetitive transmission methods. In one exemplary method, a method for wireless communication is disclosed. This method may include receiving a first message from a network node at a terminal configured to perform a repetitive transmission number according to rules, the first message including an indication to modify at least one repetitive transmission of the repetitive transmission number identified in the first message. The method may also include the terminal modifying at least one repetitive transmission of the repetitive transmission number identified in the first message.

Description

Technical Field

[0001] This patent document generally relates to wireless communication. Background Technology

[0002] Mobile communication technology is propelling the world towards an increasingly connected and networked society. The rapid growth of mobile communications and technological advancements are leading to greater demands for capacity and connectivity. Other factors, such as energy consumption, equipment cost, spectrum efficiency, and latency, are also important for meeting the needs of various communication scenarios. Various technologies are being discussed, including new methods for providing higher quality services. Summary of the Invention

[0003] This document discloses methods, systems, and apparatus relating to digital wireless communication, and more specifically to techniques related to improved repetitive transmission methods.

[0004] In one exemplary aspect, a method for wireless communication is disclosed. The method includes receiving a first message from a network node at a terminal configured to perform a number of repeated transmissions according to a rule, the first message including an indication to modify at least one repeated transmission of the number of repeated transmissions according to the rule. The method also includes the terminal modifying at least one repeated transmission of the number of repeated transmissions identified in the first message.

[0005] In another exemplary aspect, a method for wireless communication is disclosed. The method includes receiving, at a network node, a transmission of a number of repetitions from a terminal, the number of repetitions being configured to be executed according to a rule. The method also includes sending a first message from the network node to the terminal, the first message including an indication to modify at least one repetition of the number of repetitions according to the rule.

[0006] In another exemplary aspect, a wireless communication device including a processor is disclosed. The processor is configured to implement the methods described herein.

[0007] In yet another exemplary aspect, the various techniques described herein may be embodied in processor-executable code and stored on a computer-readable program medium.

[0008] Some embodiments may preferably implement the solutions written in the following clause format.

[0009] 1. A solution for wireless communication, comprising: receiving a first message from a network node at a terminal configured to perform a number of repeated transmissions according to a rule, the first message including an indication to modify at least one repeated transmission of the number of repeated transmissions according to the rule, and the terminal modifying at least one repeated transmission of the number of repeated transmissions identified in the first message.

[0010] 2. The solution according to Clause 1, wherein the repeated transmission is a Physical Uplink Shared Channel (PUSCH) repeated transmission or a Physical Uplink Control Channel (PUCCH) repeated transmission.

[0011] 3. The solution according to any one of Clauses 1 and 2, wherein the modification of the duplicate transmission includes preventing the duplicate transmission from occurring at a symbol after a time period that begins at the end of the first message.

[0012] 4. The solution according to any one of Clauses 1 and 2, wherein the modification of the duplicate transmission includes preventing the duplicate transmission from occurring at the start of a duplicate transmission after a time period beginning at the end of the first message.

[0013] 5. The solution according to any one of Clauses 1 and 2, wherein the first message indicates that the number of repeated transmissions is equal to 0.

[0014] 6. The solution described in Clause 5, wherein a first message indicating that the number of repeated transmissions is equal to 0 is included in the Radio Resource Control (RRC) message configured for the terminal.

[0015] 7. The solution according to Clause 5, wherein the number of repeated transmissions equal to 0 is included in a predefined set of repeated transmissions.

[0016] 8. The solution according to Clause 5, wherein the number of repeated transmissions indicated by the first message being equal to 0 is included in the downlink control information (DCI) of the first message.

[0017] 9. The solution according to Clause 5, wherein the first message is jointly encoded in a Time Domain Resource Allocation (TDRA) table, wherein the first message indicates a row in the TDRA table having a repeat transmission count equal to 0.

[0018] 10. The solution according to any one of Clauses 1 and 2, wherein the repeated transmission includes one of dynamically authorized PUSCH transmission or configuration authorized PUSCH transmission.

[0019] 11. The solution according to any one of Clauses 1 and 2, wherein the first message includes the repeated transmission acknowledgment (ACK) feedback message, wherein the first message includes explicit ACK signaling, which includes sequence-based signaling.

[0020] 12. The solution according to any one of Clauses 1 and 2, wherein the first message includes DCI scheduling information, the DCI scheduling information including a new transport block (TB) having the same Hybrid Automatic Repeat Transport Request Identifier (HARQ-ID) as the repeat.

[0021] 13. The solution according to Clause 12, wherein the first message includes a first New Data Indicator (NDI) in the DCI scheduling information, the first New Data Indicator being identical to a second NDI indicated in the DCI scheduling during the PUSCH retransmission.

[0022] 14. The solution according to any one of Clauses 12 and 13, wherein the terminal ignores at least one bit segment of the first message other than at least one of the HARQ process bit segment, the NDI bit segment, and the bit segment indicating that the number of repeated transmissions is equal to 0.

[0023] 15. The solution according to any one of Clauses 1 and 2, wherein the first message indicates a modification to the number of repeated transmissions to the network node.

[0024] 16. The solution according to Clause 15, wherein the modification of the number of repeated transmissions to the network node includes the remaining number of repeated PUSCH or PUCCH transmissions to the network node.

[0025] 17. The solution described in Clause 15 further includes:

[0026] The terminal initializes a redundant version (RV) sequence in response to determining that a first message indicates a modification to the number of repeated transmissions to the network node.

[0027] 18. The solution described in Clause 15 further includes:

[0028] The terminal initializes a frequency hopping position to modify the frequency of PUSCH repetitions in response to determining that the first message indicates a modification to the number of repetitions to the network node.

[0029] 19. The solution according to any one of Clauses 1 and 2, wherein the first message includes a gap between repeated transmissions, the gap being included in an RRC message configured in the first message or dynamically indicated in the DCI of the first message.

[0030] 20. The solution according to Clause 19, wherein the gap between the repeated transmissions is co-encoded with the DCI of the first message or one or more bit segments in the RRC message configured in the first message.

[0031] 21. The solution according to any one of Clauses 1 and 2, wherein the first message includes gaps between multiple sets of repeated transmissions, the gaps being configured in the first message's RRC or dynamically indicated in the first message's DCI.

[0032] 22. The solution according to Clause 1, wherein the first message includes an orthogonal code or orthogonal code index for the terminal.

[0033] 23. The solution according to Clause 22, wherein the orthogonal code includes the length of the orthogonal code and is configured in the RRC message.

[0034] 24. The solution according to Clause 22, wherein either the orthogonal code or the orthogonal code index is jointly encoded in the TDRA table for either PUSCH or PUCCH or Physical Downlink Shared Channel (PDSCH).

[0035] 25. The solution described in Clause 22 further includes:

[0036] The terminal sends repeated transmissions to the network node along the time domain according to the orthogonal code.

[0037] 26. The solution according to Clause 25, wherein the terminal transmits the number of retransmissions to the network node according to the RV for each retransmission, wherein the RV is configured by an RRC message or dynamically indicated in a DCI.

[0038] 27. The solution according to Clause 26, wherein the RV is the same for each repetition using the same orthogonal code.

[0039] 28. The solution according to Clause 1, wherein the first message comprises a set of repeating orthogonal codes or orthogonal code indices, wherein each set has one or more repetitions.

[0040] 29. The solution described in Clause 28, wherein the orthogonal codes are the same or different between different groups.

[0041] 30. The solution according to Clause 29, wherein the RV used for each repetition within a set is the same for each repetition within the set.

[0042] 31. A solution for wireless communication, comprising: receiving at a network node a transmission of a number of repetitions from the terminal, the number of repetitions being configured to be performed according to a rule; and sending from the network node to the terminal a first message, the first message including an indication to modify at least one repetition of the number of repetitions according to the rule.

[0043] 32. The solution according to Clause 31, wherein the repeated transmission includes Physical Uplink Shared Channel (PUSCH) transmission or Physical Uplink Control Channel (PUCCH) transmission to the network node.

[0044] 33. The solution according to any one of clauses 31 and 32, wherein the first message indicates that the number of repeated transmissions is equal to 0.

[0045] 34. The solution according to any one of clauses 31 and 32, wherein the first message includes an acknowledgment (ACK) feedback message for the repeated transmission, wherein the terminal is configured to determine that the network node has decoded the repeated PUSCH transmission made by the terminal by inspecting the first message.

[0046] 35. The solution according to any one of Clauses 31 and 32, wherein the first message includes downlink control information (DCI) scheduling information, the DCI scheduling information including a new transport block (TB) having the same Hybrid Automatic Repeat Request Identifier (HARQ-ID) as the repeated transmission.

[0047] 36. The solution according to any one of clauses 31 and 32, wherein the first message indicates a modification to the number of repeated transmissions to the network node.

[0048] 37. The solution according to any one of clauses 31 and 32, wherein the first message includes a gap between the number of repeated transmissions, the gap being configured in the first message's RRC or dynamically indicated in the first message's DCI.

[0049] 38. The solution according to any one of clauses 31 and 32, wherein the number of repeated transmissions is jointly encoded in the bit fields of the DCI or RRC signaling.

[0050] 39. The solution according to any one of Clauses 31 and 32, wherein the number of repeated transmissions is jointly encoded in either the downlink time-domain resource allocation (TDRA) table or the modulation and coding scheme (MCS) table.

[0051] 40. The solution described in Clause 31 further includes:

[0052] The network node sends a unique set of orthogonal codes for each of a series of terminals to enable multiplexing among the terminals, wherein the set of orthogonal codes enables the series of terminals to send various repetitive transmissions to the network node according to the orthogonal codes.

[0053] 41. The solution according to Clause 40, wherein the set of orthogonal codes sent to each of the series of terminals includes a redundant version (RV) for each repeated transmission of the orthogonal codes sent to the network node, wherein the RV is configured by an RRC message or dynamically indicated by a DCI.

[0054] 42. The solution described in Clause 31, wherein the repeated transmission is a PUSCH repeated transmission defined by a data symbol.

[0055] 43. The solution according to Clause 31, wherein the first message includes a mapping pattern of resource elements (REs) in the frequency domain assigned to the terminal.

[0056] 44. An apparatus for wireless communication, comprising a processor configured to perform a solution according to any one of claims 1 to 43.

[0057] 45. A non-transitory computer-readable medium having code stored thereon, said code, when executed by a processor, causing the processor to implement the solution according to any one of clauses 1 to 43.

[0058] Details of one or more implementations are set forth in the appended claims, drawings, and the following description. Other features will be apparent from the description, drawings, and claims. Attached Figure Description

[0059] Figure 1 This is a block diagram of the first example bit segment used for the initial number of repeated transmissions and jump boundaries.

[0060] Figure 2 This is a block diagram of a second example bit field used for the initial number of repeated transmissions and jump boundaries.

[0061] Figure 3 This is a sample block diagram illustrating the termination / cancellation timeline.

[0062] Figure 4 This is an example block diagram of using multiple terminals to multiplex orthogonal codes.

[0063] Figure 5 This is an example block diagram showing multiple UEs with a repeat transmission count of 4.

[0064] Figure 6 This is an example block diagram of repeated data symbols.

[0065] Figure 7 This is a block diagram of an example method for an improved repetitive transmission method.

[0066] Figure 8Examples of wireless communication systems in which one or more embodiments of the present technology can be applied are shown.

[0067] Figure 9 It is a block diagram representation of a part of a hardware platform. Detailed Implementation

[0068] For ease of understanding, chapter headings are used in this document. Therefore, the technologies described in one chapter can be combined with those described in other chapters. Furthermore, while the terminology of 5G is used to describe some aspects, the disclosed technologies can be embodied in wireless systems and devices implementing protocols other than 5G or 3GPP protocols.

[0069] The development of next-generation wireless communication—5G New Radio (NR) communication—is part of the ongoing evolution of mobile broadband to meet growing network demands. NR will offer greater throughput to allow more users to connect simultaneously. Other aspects such as energy consumption, equipment cost, spectrum efficiency, and latency are also important for meeting the needs of various communication scenarios.

[0070] Reliable coverage within a network is a key factor for the commercialization of wireless communication networks, as it directly impacts service quality as well as capital expenditure (CAPEX) and operating expenses (OPEX). Compared to previous systems, NR can be designed to operate at higher frequencies, such as 28 GHz or 39 GHz in FR2 (frequency range 2).

[0071] Furthermore, many locations are offering more available spectrum in FR1 (Frequency Range 1), such as 3.5 GHz, which is typically higher than previous systems. Due to these higher frequencies, wireless channels may suffer from higher path loss, making it more challenging to maintain at least the same quality of service as older systems.

[0072] Furthermore, the NR requirements associated with the data rate of the cell-edge UE (or "terminal") are higher than those of previous systems (e.g., LTE systems), indicating that the cell-edge UE requires a higher signal-to-noise ratio (SNR). NR requirements may also indicate some enhancements to NR physical channel transmission to make cell coverage comparable to other systems (e.g., LTE systems).

[0073] System Overview

[0074] In one aspect, this embodiment relates to an improved retransmission method. Specifically, a UE configured to perform a certain number of retransmissions according to rules can receive a first message from a network node (e.g., a gNB). The first message may include an indication to modify at least one retransmission of the number of retransmissions according to the rules. For example, the first message may include an indication to cancel one or more retransmissions. The UE can modify at least one retransmission of the number of retransmissions identified in the first message.

[0075] Early termination of PUSCH repeat

[0076] This embodiment relates to an improved repetition method that may include early termination of Physical Uplink Shared Channel (PUSCH) repetition. In many cases, PUSCH repetition is a direct way to enhance PUSCH coverage. For example, it can be assumed that the overall reliability of the PUSCH is 0.9, and the reliability of each repetition is P. If inter-slot frequency hopping is enabled, the probability of successful decoding for each repetition can be considered independent. Taking 4 repetitions as an example, 1-(1-P)^4 = 0.9, P = 0.4377. The probability of successful decoding based on the first 2 and 3 repetitions are 1-(1-P)^2 = 0.6838 and 1-(1-P)^3 = 0.8222, respectively. Therefore, in this example, there may be some remaining unnecessary repetitions, which can be canceled to improve system efficiency and save UE power.

[0077] Instruction to terminate early signaling

[0078] In the first case, indicating a repetition count K=0 can represent termination signaling. The repetition count K of the PUSCH can be dynamically indicated or configured to the UE's Radio Resource Control (RRC). For example, K is co-encoded with other time-domain scheduling information in the Time Domain Resource Allocation (TDRA) table, and then the TDRA bit field in the DCI is used to indicate to the UE a row containing the K factor. In many cases, K can only be 1, 2, 4, or 8. One approach is to introduce K=0 for PUSCH repetition. K=0 can represent termination signaling. In other words, if the UE receives an indication of K=0, the UE can terminate the repetition.

[0079] In some embodiments, K=0 is indicated by RRC. In other embodiments, K=0 is configured via RRC in a set of repetitions, or K=0 is predefined in a set of repetitions, and then K=0 can be indicated using downlink control information (DCI). In still other embodiments, K=0 is directly indicated by DCI.

[0080] In some embodiments, K=0 is jointly encoded in the TDRA table. If a base station (e.g., a gNB) wants to cancel PUSCH repetitions, the gNB can indicate cancellation by indicating a row in the TDRA table with a repetition count of 0. The gNB uses DCI or RRC to indicate rows in the TDRA table.

[0081] In some embodiments, if K=0 is indicated by the DCI, the Hybrid Automatic Repeat Request (HARQ) process ID indicated by the DCI may be the same as the initial PUSCH transmission. In other embodiments, if K=0 is indicated by the DCI, the New Data Indicator (NDI) indicated by the DCI may be the same as the NDI in the DCI scheduling the initial PUSCH transmission. In other embodiments, if K=0 is indicated by the DCI, all bit fields in the DCI may be the same as the DCI scheduling the initial PUSCH transmission. In some embodiments, if K=0 is indicated by the DCI, the UE ignores at least one bit field other than one of the following: the HARQ process bit field, the NDI, and the bit field indicating K=0. For example, the UE may ignore the frequency domain resource allocation bit field. In some embodiments, the UE uses one or more bit fields to verify the termination of the DCI. For example, the UE may use the frequency domain resource allocation bit field to verify the termination of the DCI.

[0082] In some embodiments, if K=0 is indicated by the DCI, the DCI can schedule another PUSCH with a new transport block (TB). In some embodiments, the DCI scheduling the new TB has the same HARQ-ID as the PUSCH transmission to be cancelled. The DCI scheduling of the new TB may include the same NDI bit field as the DCI scheduling the PUSCH transmission to be cancelled.

[0083] PUSCH retransmissions can include dynamically licensed PUSCHs or configuration-licensed PUSCHs. The termination signaling for dynamically licensed PUSCHs can be the same as that for Type 2 configuration-licensed PUSCHs. The termination signaling for dynamically licensed PUSCHs can be different from that for Type 1 configuration-licensed PUSCHs.

[0084] In the second scenario, the termination signaling may include an ACK feedback for the PUSCH transmission. If the gNB indicates an ACK for repeated PUSCH transmissions, the UE can assume that the gNB has successfully decoded the gNB, and the UE can stop its transmission. The termination signaling may then include explicit ACK signaling, which may be indicated by the DCI. In some embodiments, explicit ACK signaling may be sequence-based signaling. For example, taking N bits for ACK a, one of 2^N sequences can be selected for transmission, each representing a bit state from all 2^N states.

[0085] Typically, termination signaling can be indicated by DCI. In some embodiments, one or more termination bits are indicated for a PUSCH transport or a HARQ process.

[0086] In the third scenario, the termination signaling can be a DCI scheduling in a new TB with the same HARQ-ID as the PUSCH transmission to be cancelled. If the UE receives a DCI scheduling a new TB with the same HARQ-ID as the ongoing PUSCH transmission, the UE can cancel / stop the PUSCH transmission.

[0087] In some embodiments, at least the NDI indicated by the termination DCI is the same as the NDI in the DCI that schedules the PUSCH transmission to be cancelled. In other embodiments, all bits in the termination DCI may be the same as the DCI that schedules the PUSCH transmission to be cancelled. In other embodiments, the UE ignores at least one or more bits in addition to one of the following: HARQ process bits, NDI, and bits indicating K=0. For example, the UE ignores frequency domain resource allocation bits. In some embodiments, the UE uses one or more bits to verify the termination DCI. For example, the UE may use frequency domain resource allocation bits to verify the termination DCI.

[0088] In the fourth case, the gNB can change the number of repetitions of an ongoing PUSCH transmission.

[0089] More specifically, the gNB can reduce the number of repetitions in an ongoing PUSCH transmission, or the gNB can increase the number of repetitions in an ongoing PUSCH transmission. For example, if the initial number of repetitions is 8, after 2 repetitions, the gNB assumes that only 2 additional repetitions are sufficient. The gNB can change the remaining number of repetitions to 2. Alternatively, the gNB can assume that 8 repetitions are insufficient. The gNB can change the remaining number of repetitions to 8.

[0090] In some embodiments, gNB indicates the remaining number of repetitions. The number of repetitions may not include previously sent or ongoing repetitions. In some embodiments, gNB indicates the total number of repetitions. The number of repetitions may include previously sent or ongoing repetitions. In some embodiments, the number of repetitions is the actual total number of repetitions.

[0091] In some embodiments, the number of repetitions includes a repetition factor K = 0. In other embodiments, the features described in the first case may be applicable to the fourth case.

[0092] In some embodiments, the RV sequence is initialized when the repetition count changes or when previous repetitions are still looped. For example, if the initial repetition count is 4, then RV is 0, 2, 3, 1. During the third repetition, the UE can receive 4 remaining repetitions, and then initialize RV during the third or next (fourth) repetition, i.e., RV is 0, 2, 0, 2, 3, 1, 0 or 0, 2, 3, 0, 2, 3, 1. Alternatively, RV can still loop through previous repetition counts, being 0, 2, 3, 1, 0, 2, 3.

[0093] In some embodiments, the frequency hopping position / boundary is initialized when the number of repetitions changes or remains the same as the previous repetitions or is determined based on the total / remaining number of repetitions.

[0094] Figure 1 This is a block diagram of the first example bit field 100 used for the initial repetition count and jump boundaries. (See diagram for example.) Figure 1 As shown, the initial number of repetitions can be 8, and the hopping boundary can be between the fourth and fifth repetitions. The UE can determine that the remaining number of repetitions becomes 2. Therefore, the frequency hopping position / boundary can be initialized and executed based on the remaining repetitions. Alternatively, the frequency hopping position / boundary can be determined based on the remaining 2 repetitions.

[0095] Figure 2 This is a block diagram of a second example bit field 200 used for the initial repetition count and jump boundaries. (See diagram for example.) Figure 2 As shown, the UE can determine that the remaining number of repetitions becomes 4. Therefore, frequency hopping positions / boundaries can be initialized and executed based on the remaining repetitions.

[0096] Termination / Cancellation Timeline

[0097] When the UE receives a termination / cancellation instruction, the timeline can be T_proc2 as the UL punching indicator. In some cases, one question is whether the termination takes effect immediately after T_proc2 or from the start of the next repetition.

[0098] Figure 3 This is an example block diagram 300 illustrating the termination / cancellation timeline. (See diagram 300.) Figure 3 As shown, T1 may include the decoding timeline of the first repetition, and the gNB may send a cancellation indication at the start of the third repetition. The decoding and cancellation execution timeline may be at time T2. Then, the UE may stop transmission at the end of the third repetition or the start of the fourth repetition.

[0099] In some embodiments, to avoid potentially discarding the UCI on the third PUSCH repetition, the current repetition may not be canceled and only the remaining repetitions may be canceled.

[0100] In some embodiments, when the UE receives a termination / cancellation instruction, the UE cancels the PUSCH transmission from the symbols following timeline T after the end of the termination / cancellation instruction. In some embodiments, when the UE receives a termination / cancellation instruction, if the symbols following timeline T after the end of the termination / cancellation instruction are within the (n)th repetition, the UE cancels the transmission from the start of the (n+1)th repetition or from the end of the (n)th repetition.

[0101] In some cases, gaps may exist between repetitions. Based on the analysis of cancellation instructions, a timeline may be required (e.g., Figure 3 As shown in T1+T2), to cancel the remaining transmissions / duplicates. This may result in some unnecessary transmissions (e.g., Figure 3 (The second and third repetitions in the text).

[0102] The gap between repetitions can be defined. The gap between different repetitions may be the same. This gap can be configured by RRC or dynamically indicated in the DCI. In some embodiments, the gap is co-encoded with one or more bit fields in the DCI or RRC signaling. For example, the gap is co-encoded with the TDRA field. The gap can be in units of symbols, time slots, or absolute time. In some embodiments, the starting time slot or symbol of each repetition can be directly configured by RRC or dynamically indicated in the DCI.

[0103] You can define one or more groups for all repetitions. Each group can have one or more repetitions, and the number of repetitions in each group can be the same or different. You can define the intervals between each group.

[0104] The gaps between different groups can be the same. These gaps can be configured by RRC or dynamically indicated in the DCI. In some embodiments, the gaps are co-coded with one or more bit segments in the DCI or RRC signaling. Gap units can be symbols, time slots, or absolute time. Group configuration can be configured by RRC or dynamically indicated in the DCI. In some embodiments, the starting time slot or symbol for each group is directly configured by RRC or dynamically indicated in the DCI.

[0105] This embodiment can be applied to PUSCH, PDSCH, PUCCH, PRACH, PDCCH, etc.

[0106] Dynamic PUCCH repetition

[0107] In many cases, the number of repetitions for a long PUCCH format can be configured by RRC. However, this approach lacks adaptability for coverage enhancement. Therefore, this embodiment introduces a dynamic indication of PUCCH repetition.

[0108] In some embodiments, a separate bit field can be used in the DCI to indicate the number of times the PUCCH repeats. The DCI can be a UE-specific DL DCI or a group-common DCI.

[0109] In some embodiments, the number of PUCCH repetitions is jointly encoded with one or more bit fields in the DCI or RRC signaling. In other embodiments, the number of PUCCH repetitions is jointly encoded with the DL TDRA. The number of PUCCH repetitions may include K=0 repetitions. In other embodiments, the DL TDRA includes the repetitions of both PDSCH and PUCCH. In other embodiments, the number of PUCCH repetitions is jointly encoded in the MCS table. In many cases, a lower coding rate MCS requiring (more) repetitions may further enhance coverage. In other embodiments, the number of PUCCH repetitions is jointly encoded with the TPC.

[0110] As described herein, the early termination of PUSCH repetitions can also be applied to PUCCH repetitions. As described herein, the intervals for PUSCH repetitions can also be applied to PUCCH repetitions. PUCCH repetitions can include long PUCCH repetitions and / or short PUCCH repetitions.

[0111] CDM between different repetitions

[0112] System efficiency may decrease with increasing repetition count. Therefore, this embodiment provides enhancements to improve system efficiency in repetitive scenarios.

[0113] Code division multiplexing between different PUSCH repetitions can be defined. For example, this could include introducing orthogonal overlay codes in different repetitions to achieve multiplexing between UEs.

[0114] In some embodiments, the code or code index is configured by RRC. The code length can be configured by RRC or determined by the number of repetitions.

[0115] In some embodiments, the code or code index is indicated in the DCI. The code length may be indicated by the DCI or determined by the number of repetitions.

[0116] In some embodiments, the code or code index is jointly encoded with one or more bit fields in the DCI or RRC signaling. In some embodiments, the code or code index is jointly encoded in the TDRA table used for PUSCH or PDSCH.

[0117] Figure 4 This is an example block diagram of using multiple terminals to multiplex orthogonal codes. For example... Figure 4As shown, the first block diagram 400a can indicate that three UEs (e.g., UE1, UE2, UE3) are multiplexing each other using different orthogonal codes. For example, UE1 transmits four repetitions in the time domain using the orthogonal code [1,1,1,1] between different repetitions. The information transmitted on one repetition can be represented as A. In this example, UE2 transmits four repetitions in the time domain using the orthogonal code [1,1,-1,-1] between different repetitions. The information transmitted on one repetition is represented as B. Furthermore, in this example, UE3 transmits two repetitions in the time domain using the orthogonal code [1,-1] between different repetitions. The information transmitted on one repetition is represented as C. Figure 4 As shown, transmissions from different UEs can partially overlap. Figure 4 A similar example is given in the second figure 400b.

[0118] One or more groups can be defined for all repetitions. Each group can have one or more repetitions, and the number of repetitions for each group can be the same or different. Orthogonal codes or code indices can be indicated for each group. Orthogonal codes between different groups can be the same or different. The RV used for each repetition within a group can be the same. The RV used for each repetition between different groups can be different. Group configuration can be configured by RRC or dynamically indicated in DCI. RV configuration can be configured by RRC or dynamically indicated in DCI or determined by predefined rules.

[0119] Figure 5 This is an example block diagram 500 showing multiple UEs repeated 4 times. Figure 5 In this configuration, each UE can have two groups, and each group can have two repetitions. The orthogonal codes of the first and second groups of UE1 can both be [1,1], while the orthogonal codes of the first and second groups of UE1 can both be [1,-1]. The RVs used for the first and second groups of UE1 can be RV#0 and RV#2, respectively. The RVs used for the first and second groups of UE2 can be RV#0 and RV#3, respectively.

[0120] For PUSCH repetition, symbol-level repetition can be defined. Each data symbol can be repeated by a symbol-level repetition factor M. The repetition factor can be different from the number of PUSCH repetitions K. M can be configured by RRC or indicated by DCI. In some embodiments, one or more groups of all data symbols used for PUSCH transmission can be defined. Each group can have one or more symbols, and the number of symbols in each group can be the same or different. Orthogonal codes or code indices can be indicated for each group. Orthogonal codes between different groups can be the same or different. The RV used for each repetition within a group can be the same. The RV used for each repetition between different groups can be the same or different. Group configuration can be configured by RRC or dynamically indicated in DCI. RV configuration can be configured by RRC or dynamically indicated in DCI or determined by predefined rules.

[0121] In some embodiments, orthogonal codes in the frequency domain are assigned to the UE by RRC or DCI. Different UEs can use different orthogonal codes. In some embodiments, a mapping pattern for REs in the frequency domain is assigned to the UE by RRC or DCI. Different UEs can use different mapping patterns. For example, the mapping pattern is interleaved mapping. Different UEs can use different interleaved REs in the frequency domain.

[0122] Figure 6 This is an example block diagram 600 showing repeated data symbols. For example... Figure 6 As shown, data symbols can be repeated by a factor of 2. There are two groups, each with two symbols. For the first and second groups, the information transmitted on a symbol can be represented as A and B, respectively. The orthogonal codes for the first and second groups can be [1,1] and [1,-1], respectively.

[0123] Figure 7 This is a block diagram of an example method for an improved repetition method. The method may include receiving a first message (block 702) from a network node at a terminal configured to perform a repetition number of transmissions according to a rule. The terminal may include the UE described herein, and the network node may include a base station or gNB described herein. The first message may include a cancellation indication as described herein. The first message may include an indication to modify at least one repetition transmission according to the rule's repetition number of transmissions. The rule may include a configuration indicating when to send each repetition transmission. The rule (or "predefined rule") may instruct the terminal and network node to have a predetermined priority scheduling in data transmission between the terminal and the network node.

[0124] The method may also include at least one repeat transmission modified by the terminal to the number of repeat transmissions identified in the first message (box 704). For example, modifying at least one repeat transmission may include canceling one or more scheduled repeat transmissions.

[0125] In some embodiments, the retransmission is a Physical Uplink Shared Channel (PUSCH) retransmission or a Physical Uplink Control Channel (PUCCH) retransmission.

[0126] In some embodiments, modifying duplicate transmissions includes preventing duplicate transmissions from occurring at a symbol after a time period that begins at the end of the first message.

[0127] In some embodiments, modifying duplicate transmissions includes preventing duplicate transmissions from occurring at the start of a repeat after a time period that begins at the end of the first message.

[0128] In some embodiments, the first message indicates that the number of repeated transmissions is equal to 0.

[0129] In some embodiments, a first message indicating that the number of repeated transmissions is equal to 0 is included in a Radio Resource Control (RRC) message configured for the terminal.

[0130] In some embodiments, the number of repeated transmissions equal to 0 is included in a predefined set of repeated transmission counts.

[0131] In some embodiments, a first message indicating that the number of repeated transmissions equals 0 is included in the downlink control information (DCI) of the first message.

[0132] In some embodiments, the number of repeated transmissions equal to 0 in the first message is jointly encoded in the Time Domain Resource Allocation (TDRA) table, wherein the first message indicates a row in the TDRA table with a number of repeated transmissions equal to 0.

[0133] In some embodiments, repeated transmissions include either dynamically licensed PUSCH transmissions or configuration-licensed PUSCH transmissions.

[0134] In some embodiments, the first message includes a repeatedly transmitted acknowledgment (ACK) feedback message, wherein the first message includes explicit ACK signaling, which includes sequence-based signaling.

[0135] In some embodiments, the first message includes DCI scheduling information, which includes a new transport block (TB) having the same Hybrid Automatic Repeat Request Identifier (HARQ-ID) as the repeat transport.

[0136] In some embodiments, the first message includes a first New Data Indicator (NDI) in the DCI scheduling information, which is the same as the second NDI indicated in the DCI scheduling during PUSCH retransmission.

[0137] In some embodiments, the terminal ignores at least one bit segment of the first message other than at least one bit segment from the HARQ process bit segment, the NDI bit segment, and the bit segment indicating that the number of repeated transmissions is equal to 0.

[0138] In some embodiments, the first message indicates a modification to the number of repeated transmissions to the network node.

[0139] In some embodiments, modifying the number of retransmissions to a network node includes the remaining number of PUSCH or PUCCH retransmissions to the network node.

[0140] In some embodiments, the method includes initializing a redundant version (RV) sequence by a terminal in response to determining a first message indicating a modification to the number of repeated transmissions to a network node.

[0141] In some embodiments, the method includes the terminal initializing a frequency hopping position to modify the frequency of PUSCH repetitions in response to determining that a first message indicates a modification to the number of repetitions to the network node.

[0142] In some embodiments, the first message includes a gap between repeated transmissions, the gap being included in an RRC message configured in the first message or dynamically indicated in the DCI of the first message.

[0143] In some embodiments, the gap between repeated transmissions is co-coded with the DCI of the first message or one or more bit segments in the RRC message configured in the first message.

[0144] In some embodiments, the first message includes gaps between multiple sets of repeated transmissions, which are configured in the first message's RRC or dynamically indicated in the first message's DCI.

[0145] In some embodiments, the first message includes an orthogonal code or orthogonal code index for the terminal.

[0146] In some embodiments, the orthogonal code includes the length of the orthogonal code and is configured in the RRC message.

[0147] In some embodiments, either the orthogonal code or the orthogonal code index is jointly encoded in the TDRA table used for either PUSCH or PUCCH or the Physical Downlink Shared Channel (PDSCH).

[0148] In some embodiments, the method includes the terminal sending repeated transmissions to the network node once along the time domain according to the orthogonal code.

[0149] In some embodiments, the terminal transmits the number of retransmissions to the network node according to the RV for each retransmission, wherein the RV is configured by an RRC message or dynamically indicated in the DCI.

[0150] In some embodiments, RV is the same for each repetition using the same orthogonal code.

[0151] In some embodiments, the first message includes a set of repeating orthogonal codes or orthogonal code indices, wherein each set has one or more repetitions.

[0152] In some embodiments, orthogonal codes may be the same or different across different groups.

[0153] In some embodiments, the RV used for each repetition within a group is the same for each repetition within that group.

[0154] In another exemplary embodiment, a method for wireless communication includes receiving, at a network node, a transmission of a number of repetitions from the terminal, the number of repetitions being configured to be performed according to a rule. The method further includes sending a first message from the network node to the terminal, the first message including an indication to modify at least one repetition of the number of repetitions according to the rule.

[0155] In some embodiments, repeated transmissions include Physical Uplink Shared Channel (PUSCH) transmissions or Physical Uplink Control Channel (PUCCH) transmissions to network nodes.

[0156] In some embodiments, the first message indicates that the number of repeated transmissions is equal to 0.

[0157] In some embodiments, the first message includes an acknowledgment (ACK) feedback message for the repeated transmission, wherein the terminal is configured to determine that the network node has decoded the PUSCH repeated transmission made by the terminal by checking the first message.

[0158] In some embodiments, the first message includes downlink control information (DCI) scheduling information, which includes a new transport block (TB) having the same Hybrid Automatic Repeat Request Identifier (HARQ-ID) as the repeated transmission.

[0159] In some embodiments, the first message indicates a modification to the number of repeated transmissions to the network node.

[0160] In some embodiments, the first message includes a gap between repeated transmissions, which is configured in the RRC in the first message or dynamically indicated in the DCI of the first message.

[0161] In some embodiments, the number of repeated transmissions is jointly encoded in bit fields in DCI or RRC signaling.

[0162] In some embodiments, the number of repeated transmissions is jointly encoded in either the downlink time-domain resource allocation (TDRA) table or the modulation and coding scheme (MCS) table.

[0163] In some embodiments, the method includes a network node sending a unique set of orthogonal codes for each of a series of terminals to enable multiplexing among the multiple terminals, wherein the set of orthogonal codes enables the series of terminals to send various repetitive transmissions to the network node based on the orthogonal codes.

[0164] In some embodiments, the set of orthogonal codes sent to each of a series of terminals includes a redundant version (RV) sent to the network node for each repeated transmission based on the orthogonal codes, wherein the RV is configured by an RRC message or dynamically indicated by a DCI.

[0165] In some embodiments, the repeat transmission is a PUSCH repeat transmission defined by data symbols.

[0166] In some embodiments, the first message includes a mapping pattern for resource elements (REs) in the frequency domain assigned to the terminal.

[0167] Example wireless system

[0168] Figure 8 An example of a wireless communication system in which one or more embodiments of the present technology can be applied is shown. The wireless communication system 800 may include one or more base stations (BS) 805a, 805b; one or more wireless devices 810a, 810b, 810c, 810d; and a core network 825. Base stations 805a, 805b may provide wireless services to wireless devices 810a, 810b, 810c, and 810d in one or more wireless sectors. In some implementations, base stations 805a, 805b include directional antennas to generate two or more directional beams to provide wireless coverage in different sectors.

[0169] The core network 825 can communicate with one or more base stations 805a and 805b. The core network 825 provides connectivity with other wireless and wired communication systems. The core network may include one or more service subscription databases to store information related to subscribed wireless devices 810a, 810b, 810c, and 810d. The first base station 805a can provide wireless services based on a first radio access technology, while the second base station 805b can provide wireless services based on a second radio access technology. Depending on the deployment scenario, base stations 805a and 805b can be installed side-by-side or separately in the field. Wireless devices 810a, 810b, 810c, and 810d can support multiple different radio access technologies.

[0170] In some implementations, a wireless communication system may include multiple networks using different wireless technologies. Dual-mode or multi-mode wireless devices include two or more wireless technologies that can be used to connect to different wireless networks.

[0171] Figure 9 This is a block diagram representation of a hardware platform. Hardware platform 905, such as a network device, base station, or wireless device (or UE), may include processor electronics 910, such as a microprocessor, implementing one or more technologies presented herein. Hardware platform 905 may include transceiver electronics 915 to transmit and / or receive wired or wireless signals via one or more communication interfaces, such as antenna 920 or a wired interface. Hardware platform 905 may implement other communication interfaces using defined protocols for transmitting and receiving data. Hardware platform 905 may include one or more memories (not explicitly shown) configured to store information such as data and / or instructions. In some implementations, processor electronics 910 may include at least a portion of transceiver electronics 915. In some embodiments, at least some of the disclosed technologies, modules, or functions are implemented using hardware platform 905.

[0172] in conclusion

[0173] As can be understood from the foregoing, specific embodiments of the currently disclosed technology have been described for illustrative purposes; however, various modifications can be made without departing from the scope of the invention. Therefore, the currently disclosed technology is not limited beyond the scope of the appended claims.

[0174] The disclosed and other embodiments, modules, and functional operations described herein can be implemented in digital electronic circuits, or in computer software, firmware, or hardware that includes the structures disclosed herein and their structural equivalents, or in a combination of one or more of these. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more computer program instruction modules encoded on a computer-readable medium for execution by or control of the operation of a data processing apparatus. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of substances that influences machine-readable propagation signals, or a combination of one or more of these. The term "data processing apparatus" encompasses all means, devices, and machines for processing data, including, for example, a programmable processor, a computer, or multiple processors or computers. In addition to hardware, the apparatus may also include code that creates an execution environment for the computer program in question, for example, code constituting processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of these. Propagation signals are artificially generated signals, such as machine-generated electrical, optical, or electromagnetic signals, generated to encode information for transmission to a suitable receiver device.

[0175] A computer program (also called a program, software, software application, script, or code) can be written in any programming language, including compiled or interpreted languages, and can be deployed in any form, including as a standalone program, or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored as part of a file containing other programs or data (e.g., one or more scripts stored in a markup language document), as a single file dedicated to the program in question, or as multiple coordinating files (e.g., a file storing one or more modules, subroutines, or portions of code). A computer program can be deployed to execute on a single computer or on multiple computers located at a site or distributed across multiple sites and interconnected by a communication network.

[0176] The processes and logic flows described herein can be executed by one or more programmable processors, which execute one or more computer programs to perform functions by manipulating input data and generating outputs. The processes and logic flows can also be executed by dedicated logic circuits, and the devices can be implemented as dedicated logic circuits, such as FPGAs (Field-Programmable Gate Arrays) or ASICs (Application-Specific Integrated Circuits).

[0177] Processors suitable for executing computer programs include, for example, general-purpose and special-purpose microprocessors, and any one or more processors of any type of digital computer. Typically, a processor receives instructions and data from read-only memory or / or random access memory. The basic components of a computer are a processor for executing instructions and one or more storage devices for storing instructions and data. Typically, a computer will also include one or more mass storage devices (e.g., magneto-optical, magneto-optical, or optical discs) for storing data or operatively coupled to such mass storage devices to receive data from and / or send data to them. However, a computer does not need to have such devices. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, such as semiconductor memory devices like EPROM, EEPROM, and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM discs. The processor and memory may be supplemented by or integrated into special-purpose logic circuitry.

[0178] While this patent document contains numerous details, these should not be construed as limiting the scope of any invention or what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of a particular invention. Certain features described in the context of individual embodiments in this patent document may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented individually or in any suitable sub-combination in multiple embodiments. Furthermore, although features may be described above as functioning in certain combinations, and even initially claimed in this way, in some cases one or more features from the claimed combination may be removed from the combination, and the claimed combination may involve sub-combinations or variations of sub-combinations.

[0179] Similarly, although the operations are depicted in a specific order in the accompanying drawings, this should not be construed as requiring these operations to be performed in the specific order shown or sequentially, or that all shown operations be performed to obtain the desired result. Furthermore, the separation of the various system components in the embodiments described in this patent document should not be construed as requiring such separation in all embodiments.

[0180] Only a few implementations and examples are described, and other implementations, enhancements and variations may be made based on what is described and illustrated in this patent document.

Claims

1. A method for wireless communication, comprising: A first message is received at a terminal configured to perform a number of repeated transmissions according to a rule from a network node. The first message includes an indication to modify at least one repeated transmission of the number of repeated transmissions according to the rule. The first message indicates modification of the number of repeated transmissions to the network node and the modification of the number of repeated transmissions to the network node includes the remaining number of repeated transmissions to the network node. as well as The terminal modifies at least one duplicate transmission of the number of duplicate transmissions identified in the first message. The method further includes: in response to determining that the first message indicates a modification to the number of repeated transmissions to the network node, initializing a redundant version RV sequence or initializing a frequency hopping position to modify the frequency of repeated transmissions of the Physical Uplink Shared Channel (PUSCH).

2. The method according to claim 1, wherein the repeated transmission is the PUSCH repeated transmission or the Physical Uplink Control Channel (PUCCH) repeated transmission.

3. The method according to any one of claims 1 and 2, wherein modifying the repeated transmission includes preventing the repeated transmission from occurring at a symbol after a time period that begins at the end of the first message.

4. The method according to any one of claims 1 and 2, wherein modifying the repetitive transmission includes preventing the repetitive transmission from occurring at the start of a repetition after a time period beginning at the end of the first message.

5. The method according to any one of claims 1 and 2, wherein the first message indicates that the number of repeated transmissions is equal to 0.

6. The method of claim 5, wherein a first message indicating that the number of repeated transmissions is equal to 0 is included in a Radio Resource Control (RRC) message configured for the terminal.

7. The method of claim 5, wherein the number of repeated transmissions equal to 0 is included in a predefined set of repeated transmission numbers.

8. The method of claim 5, wherein the number of repeated transmissions indicated by the first message being equal to 0 is included in the downlink control information (DCI) of the first message.

9. The method of claim 5, wherein the first message is jointly encoded in a Time Domain Resource Allocation (TDRA) table, wherein the first message indicates a row in the TDRA table having a repeat transmission count equal to 0.

10. The method according to any one of claims 1 and 2, wherein the repeated transmission includes either a dynamically authorized PUSCH transmission or a configuration-authorized PUSCH transmission.

11. The method of any one of claims 1 and 2, wherein the first message includes the repeated transmission of the acknowledgment (ACK) feedback message, wherein the first message includes explicit ACK signaling, which includes sequence-based signaling.

12. The method of any one of claims 1 and 2, wherein the first message includes DCI scheduling information, the DCI scheduling information including a new transport block (TB) having the same Hybrid Automatic Repeat Request Identifier (HARQ-ID) as the repeated transport.

13. The method of claim 12, wherein the first message includes a first New Data Indicator (NDI) in the DCI scheduling information, the first New Data Indicator being the same as a second NDI indicated in the DCI scheduling during the PUSCH retransmission.

14. The method of claim 13, wherein the terminal ignores at least one bit segment of the first message other than at least one bit segment from the HARQ process bit segment, the NDI bit segment, and the bit segment indicating that the number of repeated transmissions is equal to 0.

15. The method according to claim 1, wherein, The frequency hopping position responds to determining that the first message indicates a modification to the number of repeated transmissions to the network node, and modifies the frequency of the repeated transmissions.

16. The method of any one of claims 1 and 2, wherein the first message includes a gap in units of symbols, time slots, or absolute time to indicate the duration between repeated transmissions, the gap being configured based on an RRC message or dynamically indicated in the DCI of the first message.

17. The method of claim 16, wherein the gap between the repeated transmissions is co-coded with one or more bit segments in the DCI or the RRC message.

18. The method of any one of claims 1 and 2, wherein the first message includes gaps between multiple sets of repeated transmissions, the gaps being configured in the first message's RRC or dynamically indicated in the first message's DCI.

19. The method of claim 1, wherein the first message includes an orthogonal code or an orthogonal code index for the terminal.

20. The method of claim 19, wherein the orthogonal code includes the length of the orthogonal code and is configured in the RRC message.

21. The method of claim 19, wherein the orthogonal code or the orthogonal code index is jointly encoded in a TDRA table for any of PUSCH, PUCCH, or Physical Downlink Shared Channel (PDSCH).

22. The method of claim 19, further comprising: The terminal sends repeated transmissions to the network node along the time domain according to the orthogonal code.

23. The method of claim 22, wherein the terminal transmits the number of retransmissions to the network node according to the RV for each retransmission, wherein the RV is configured by an RRC message or dynamically indicated in a DCI.

24. The method of claim 23, wherein the RV is the same for each repetition using the same orthogonal code.

25. The method of claim 1, wherein the first message comprises a set of repeating orthogonal codes or orthogonal code indices, wherein each set has one or more repetitions.

26. The method of claim 25, wherein the orthogonal codes may be the same or different between different groups.

27. The method of claim 26, wherein the RV used for each repetition within a set is the same for each repetition within the set.

28. A method for wireless communication, comprising: At the network node, a number of repeated transmissions are received from the terminal, the number of repeated transmissions being configured to be executed according to rules; as well as The network node sends a first message to the terminal, the first message including an indication to modify at least one repeated transmission according to the number of repeated transmissions specified in the rule. The first message indicates a modification to the number of repeated transmissions to the network node, and the modification includes the remaining number of repeated transmissions to the network node. Wherein, the first message causes the terminal to respond to determining that the first message indicates a modification to the number of repeated transmissions to the network node, initialize a redundant version RV sequence or initialize a frequency hopping position to modify the frequency of repeated transmissions of the Physical Uplink Shared Channel (PUSCH).

29. The method of claim 28, wherein the repeated transmission includes a Physical Uplink Shared Channel (PUSCH) transmission or a Physical Uplink Control Channel (PUCCH) transmission to the network node.

30. The method of any one of claims 28 and 29, wherein the first message includes an acknowledgment (ACK) feedback message for the repeated transmission, wherein the terminal is configured to determine that the network node has decoded the repeated PUSCH transmission made by the terminal by inspecting the first message.

31. The method of any one of claims 28 and 29, wherein the first message includes downlink control information (DCI) scheduling information, the DCI scheduling information including a new transport block (TB) having the same Hybrid Automatic Repeat Request Identifier (HARQ-ID) as the repeated transmission.

32. The method of any one of claims 28 and 29, wherein the first message includes a gap between the number of repeated transmissions, the gap being configured in an RRC in the first message or dynamically indicated in a DCI of the first message.

33. The method according to any one of claims 28 and 29, wherein the number of repeated transmissions is jointly encoded in a bit field in the DCI or RRC signaling.

34. The method according to any one of claims 28 and 29, wherein the number of repeated transmissions is jointly encoded in either a downlink time-domain resource allocation (TDRA) table or a modulation and coding scheme (MCS) table.

35. The method of claim 28, further comprising: The network node sends a unique set of orthogonal codes for each of a series of terminals to enable multiplexing among the terminals, wherein the set of orthogonal codes enables the series of terminals to send various repetitive transmissions to the network node according to the orthogonal codes.

36. The method of claim 35, wherein the set of orthogonal codes sent to each of the series of terminals includes a redundant version (RV) for each repeated transmission based on the orthogonal codes sent to the network node, wherein the RV is configured by an RRC message or dynamically indicated by a DCI.

37. The method of claim 28, wherein the repeated transmission is a PUSCH repeated transmission defined by data symbols.

38. The method of claim 28, wherein the first message includes a mapping pattern of resource elements (REs) in the frequency domain assigned to the terminal.

39. An apparatus for wireless communication, comprising a processor configured to perform the method according to any one of claims 1 to 38.

40. A non-transitory computer-readable medium having 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 38.

Images