CN113439400A

CN113439400A - Resource indication scheme for repeated transmissions

Info

Publication number: CN113439400A
Application number: CN201980092203.9A
Authority: CN
Inventors: 梁春丽; 韩祥辉; 郝鹏; 吴昊
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2019-02-15
Filing date: 2019-02-15
Publication date: 2021-09-24
Also published as: EP3925120A1; EP3925120A4; WO2020164102A1

Abstract

A method of wireless communication comprising: receiving, at a user equipment, indication information associated with a repeated transmission channel; determining, based on the indication information, availability of one or more resources for performing repeated transmissions to the network device on the channel; upon detecting that one or more resources are not available, scheduling a transmission performed on the channel in accordance with a next available resource; upon detecting that one or more resources are available, transmissions performed on the channel are scheduled in accordance with the one or more resources.

Description

Resource indication scheme for repeated transmissions

Technical Field

This patent document relates generally to wireless communications.

Background

Wireless communication technology is pushing the world to an increasingly interconnected and networked society. The rapid growth of wireless communications and advances in technology have led to greater demands for capacity and connectivity. Other aspects such as energy consumption, equipment cost, spectral efficiency and latency are also important to meet the needs of various communication scenarios. Next generation systems and wireless communication technologies need to provide support for more and more users and services with different types of delay requirements and to support multiple repetitions of certain channels in an effort to meet enhanced coverage as compared to existing wireless networks.

Disclosure of Invention

This patent document describes, among other things, techniques for resource determination when a particular channel is repeatedly transmitted from a User Equipment (UE). In an example aspect, the repeatedly transmitted channel may be configured to carry control information and/or user information. In one example aspect, the repeatedly transmitted channel is a downlink transmission from the network to the UE. In an example aspect, repeated transmissions on a shared channel may utilize transmission resources in the time domain or the frequency domain, or both.

In one example aspect, a method of wireless communication is disclosed. The method includes receiving, at a user equipment, indication information associated with repeatedly performing a transmission on a channel. The method also includes determining availability of one or more resources for performing a transmission to the network device on the channel based on the indication information. Upon detecting that one or more resources are not available, scheduling a transmission performed on the channel in accordance with a next available resource. However, upon detecting that one or more resources are available, transmissions performed on the channel are scheduled according to the one or more resources. The method also includes sending or receiving a transmission repeatedly performed on the channel based on the configuration information.

In another example aspect, a wireless communications apparatus is disclosed that includes at least one processor configured to implement the above-described method.

In yet another aspect, a computer-readable medium is disclosed. The computer readable medium stores processor executable code for implementing the above-described method.

These and other aspects are described in this patent document.

Drawings

Fig. 1 shows an example of a wireless communication network.

Fig. 2 shows an example of repeated transmission on a channel.

Fig. 3A-3D illustrate different configurations of repetitive transmissions for example embodiments.

Fig. 4A-4C illustrate different configurations of repeated transmissions for another example embodiment.

Fig. 5A-5D illustrate different configurations of repetitive transmissions for yet another example embodiment.

Fig. 6 is an example flow diagram associated with performing a repeat transmission over a channel.

Fig. 7 is a block diagram of an example implementation of a wireless communication device.

Detailed Description

The section headings are used in this patent document only to improve readability, and not to limit the scope of the embodiments and techniques disclosed in each section to only that section. Some features are described using an example of a 5G wireless protocol. However, the applicability of the disclosed technology is not limited to 5G wireless systems.

Systems, methods, and apparatuses disclosed in this patent document relate to determining how to allocate time and/or frequency resources for repeated transmissions on an uplink shared channel (e.g., PUSCH channel) from a User Equipment (UE). The allocated resources are determined based on an indication parameter received from the base station. The disclosed technique has the advantage of being flexible in scheduling different variations of the duplicate transmission channel, which is beneficial for services with low delay requirements. In contrast to conventional systems, a repeatedly transmitted PUSCH channel may be transmitted in a single slot or multiple slots. In addition, when transmitting in multiple slots, transmission on the PUSCH channel may begin at any suitable symbol in the slot. Although the discussion herein is illustrated from the perspective of performing repeated transmissions "on a channel," this may generally be equivalent to performing repeated transmissions of a "channel. Although this patent document discusses using the example of a PUSCH channel, the disclosed method of determining time domain resources for repeated transmissions is also applicable to channels other than PUSCH, such as PDCCH, PDSCH, PUCCH, PRACH.

Fig. 1 illustrates an example wireless communication network 100. The network 100 comprises a base station, BS 102, and a plurality of user equipments (or UEs) 106 capable of communicating with each other over a transmission medium 104. Transmissions from device 106 to BS 102 are commonly referred to as uplink or uplink transmissions. Transmissions from BS 102 to device 106 are commonly referred to as downlink or downlink transmissions. For example, the base station may transmit an uplink grant (UL grant) to the device 106. The UL grant (e.g., grant information) is configured to schedule the user equipment 106 to perform a Physical Uplink Shared Channel (PUSCH) transmission. The PUSCH of the user equipment 106 occupies a corresponding slot. Respective PUSCH transmissions associated with two or more user equipments 106 may overlap with each other in the frequency domain. The overlap may be partial or complete. Transmission medium 104 is typically a wireless (air) medium. BS 102 may also be communicatively coupled to other base stations or other equipment in the network through a backhaul or access network connection 112.

Fig. 2 shows an example of repeated transmission on a channel. In some embodiments, this channel may be a Physical Uplink Shared Channel (PUSCH) channel, and the number of repeated transmissions on the PUSCH channel may be configured by Radio Resource Control (RRC) signaling techniques. The UE may send repeated transmissions across multiple slots, with at most one PUSCH transmission in a given one slot. Different PUSCH transmissions may have the same starting symbol across multiple slots. In fig. 2, a PUSCH transmission is shown scheduled to be transmitted at slots n, n +1, n +2, where each slot is divided into a plurality of minislots. In one exemplary aspect (without limitation), a slot may be divided into fourteen (14) minislots for uplink symbols. Each micro-slot may correspond to a symbol. For example, minislot 1 corresponds to symbol 0, minislot 2 corresponds to symbol 1, minislot 3 corresponds to symbols 2, … …, and minislot 14 corresponds to symbol 13. Fig. 2 illustrates three PUSCH transmissions (or, synonymously, three transmissions on a PUSCH channel), where the PUSCH transmissions are repeated in slots n +1, n + 2. Three transmissions of the PUSCH channel (shown as micro-slots shaded in grey) start at symbol 10 in slots n, n +1, n +2 at

boundary positions

202, 206, 210, respectively. Regardless of whether there is an uplink symbol at the beginning of slot n +1 (e.g., symbol 0), the PUSCH transmission is repeated at symbol 10 of slots n +1 and n + 2. Three transmissions on the PUSCH channel end at symbol 13 in slots n, n +1, n +2 at

boundary positions

204, 208, 212, respectively. Further, the three transmissions on the PUSCH channel each have the same duration of 4 symbols. Thus, fig. 2 demonstrates that in current 5G systems, when the PUSCH channel is repeatedly transmitted, the same time domain resources (such as the starting position of the PUSCH transmission, the ending position of the PUSCH transmission, the duration of the PUSCH transmission) are utilized in the repeated transmission. However, this approach is detrimental for services with low latency requirements. In addition, the time/frequency resources used in the repetitive transmission are the same. If the starting symbol of the repeated transmission (e.g., symbol 206) occurs relatively late in the slot (e.g., near the end of slot n +1 or slot n + 2), the UE must wait a longer time before retransmitting the PUSCH channel. This may introduce undesirable delays. In the discussion herein, the time slots are shown numbered from the beginning. In an alternative embodiment, the time slots may be numbered starting from zero (0).

To address the above-mentioned problems and others, this patent document discloses the following example embodiments in connection with two candidate PUSCH transmission repetition schemes. According to a first scheme, the repeated transmissions on the PUSCH channel may be in the same slot or in different slots. This scheme is called micro-slotted PUSCH repetition. According to a second scheme, if there is only one uplink period within a given slot, at most one PUSCH transmission is allowed, and repeated PUSCH transmissions on different slots are allowed with different starting symbols and durations. Here, the UL period is the duration of a set of consecutive symbols within a slot of a potential UL transmission as determined by the UE. If there is more than one uplink period within a time slot, one repeat transmission occurs within one UL period. This scheme is called multi-segment transmission. This patent document disclosesIt is opened how to determine or calculate the resources (also referred to as "resource elements") allocated for PUSCH transmission. Assume that the total number of estimated PUSCH transmissions is denoted N, and i denotes the transmission count, such that i ═ 0, 1, 2, … …, N-1. The number N may be estimated by the base station, for example. This patent document discloses determining at least the following resources: (i) start symbol (S) for PUSCH transmission in a slot_i) Number and (ii) duration of PUSCH transmission in slot (L)_i). Other indication parameters that may be determined include a starting symbol (S) of the first PUSCH transmission₀) And individual transmission duration L for each PUSCH transmission_iTotal transmission duration (L), starting symbol number (S) of first transmission in slot j_j) Total transmission duration (L) in total with the transmission on the channel in time slot j_j). Herein, the total transmission duration (L) and the total transmission duration (L) in slot j_j) Are defined in units of symbols and the time slots are counted such that j is 0, 1, 2, … …, N-1, where N is an integer. In some embodiments, the UE is based on the above-mentioned parameter S_i、S_j、L_i、L_j、S₀And L to determine resources to be allocated for PUSCH transmission. These parameters may be included in (or based on) one or more of the following: higher layer configuration, uplink grant information, timeslot configuration, or SFI. That is, in some embodiments, the PUSCH channel in this patent document may be a grant-based PUSCH. In some embodiments, the PUSCH channel in this patent document may be a grant configured PUSCH.

The resources may be in the time domain, the frequency domain, or both. For purposes of illustration, the example embodiments discussed herein are based on the assumption that the total number of symbols in a slot, P, is 14 and the maximum number of PUSCH transmissions is three (3). As a result, the transmission count i takes values 0, 1, 2. However, the values used in the discussion herein are for illustration only. In alternative embodiments, other values for these quantities may be selected. Various features and examples of the above-described scheme will now be described using a number of example embodiments.

_iIllustrative embodimentExample 1: determining resources based on parameters (S, L)

In some embodiments, the UE may be tuple (S) based_iL) to determine the resources used for PUSCH transmission. Table 1 below shows several example values that a tuple may take. In some embodiments, the UE may be based on being a tuple (S)_iL) to determine the resources used for PUSCH transmission.

TABLE 1

Line index	S₀	S₁	S₂	L
					1	10	0	-	12
2	10	12	0	12
					3	10	3	-	10
4	10	3	2	10

Fig. 3A to 3D show different configurations of PUSCH transmission of this example embodiment. The row index 1, the row index 2, and the row index 3 in the above table correspond to the configurations shown in fig. 3A, 3B, and 3C, respectively. S₀Indicating a starting symbol number, S, of a first PUSCH transmission₁Indicating a starting symbol number, S, for a second PUSCH transmission₂A starting symbol number indicating a third PUSCH transmission, and L indicates a total transmission duration in total for PUSCH transmissions. In fig. 3A-3D, PUSCH transmissions are shown as grey shaded minislots. For example, in fig. 3A, two PUSCH transmissions are scheduled starting with symbol 10 in slot n and symbol 0 in slot n +1, respectively. In the first PUSCH transmission, four symbols (symbols 10 to 13) are transmitted in slot n. In the second PUSCH transmission, eight symbols (symbols 0 to 7) are transmitted in slot n + 1. Since the total transmission duration L measured across all transmissions is 12, two PUSCH transmissions are sufficient and no transmission occurs in slot n + 2. This is shown by the dashed line in the above table, with no shaded minislots in slot n +2 in FIG. 3A. In some embodiments, if the starting symbol number at a slot is an invalid value (e.g., a value greater than 13), this may indicate that there is no PUSCH transmission in this slot. Thus, it can be appreciated that one advantage of the disclosed techniques is that latency can be greatly reduced, for example, when PUSCH transmission is completed by slot n +1 in fig. 3A, while PUSCH transmission is completed at slot n +2 in fig. 2.

In fig. 3B, three PUSCH transmissions with a total transmission duration of 12 are scheduled starting with symbol 10 in slot n, symbol 12 in slot n +1, and symbol 0 in slot n +2, respectively. In the embodiments shown in fig. 3A and 3B, all symbols in each slot are available for PUSCH transmission. In these cases, the starting symbol of each transmission is the same as the indicator information in the uplink grant integrated with the higher layer configuration information.

Fig. 3C shows more than one PUSCH transmission scheduled in a slot. For example, fig. 3C shows that there are two PUSCH transmissions in slot n +1 in addition to one PUSCH transmission in slot n. In some embodiments, the symbols in a slot are not necessarily all uplink symbols. For example, fig. 3C shows that in slot n +1, symbols 0 to 2 and symbols 7 to 8 are downlink symbols (shown as shaded textured minislots). These downlink symbols are interspersed with uplink symbols 3 through 6 in slot n + 1. Thus, there are multiple discontinuous uplink symbols in slot n +1, and the symbols in slots n and n +2 are all uplink. If S is_jRepresenting the first transmission in slot n + j, then the first PUSCH transmission is from symbols 10 to 13 in slot n, the second PUSCH transmission is from symbols 3 to 6 in slot n +1, and the third PUSCH transmission is from symbols 9 to 10 in slot n + 2. In some embodiments, the starting symbol is not available due to a change or update of the slot configuration or Slot Format Indicator (SFI), e.g., in case the starting symbol is located on a downlink symbol or a flexible symbol, then the starting symbol of the PUSCH transmission is deferred to the next first available symbol. In some embodiments, a Slot Format Indicator (SFI) information field included as part of a Physical Downlink Control Channel (PDCCH) provides an indication of whether a symbol is an uplink symbol, a downlink symbol, or other flexible symbol. In some embodiments, the SFI is dynamically indicated by the base station.

FIG. 3D illustrates a scenario in which the SFI is dynamically updated according to (e.g., as indicated in the row index 4 of the table above) (S_iL) scenario where PUSCH transmission for tuple scheduling is changed. Row index 4 indicates that three PUSCH transmissions are scheduled to start at symbol 10 in slot n, symbol 3 in slot n +1, and symbol 2 in slot n +2, respectively. The first PUSCH transmission starts at symbol 10 in slot n. However, due to the dynamically changing SFI, the UE modifies the above mentionedThe transmission schedule of (1). In particular, considering that the SFI in slot n +1 indicates that slots 0 through 9 are downlink symbols, the UE transmits a second PUSCH transmission at the first available uplink symbol (e.g., symbol 10) in slot n + 1. In some embodiments, it may be desirable to reserve several symbols as a guard gap for switching from downlink to uplink, i.e., the first available uplink symbol may be a symbol that is several symbols after the first uplink symbol. Thus, the transmission duration in slot n +1 is four (4) symbols starting from symbol 10. Two (2) symbols starting from symbol 2 are scheduled in slot n + 2. The final scheduling of PUSCH transmission is shown in fig. 3D.

In accordance with the disclosed embodiments, the actual time domain resources for each repeated transmission are determined based on higher layer configuration information (e.g., configurations such as those exemplarily listed in table 1), row indices (e.g., row index 1, 2, 3, or 4 of table 1 storing various configurations), and SFI indicated in the Uplink (UL) grant. In the discussion above with respect to table 1, fig. 3C and 3D are shown with different high-level configurations. However, the embodiments in fig. 3C and 3D may share the same high layer configuration and uplink grant, but with different SFIs. If the number of rows (e.g., higher layer configuration) in table 1 increases, the bit field in the uplink grant indicating the row index may correspondingly increase. Fig. 3C may also correspond to a configuration in which the row index is 2, but the SFI in fig. 3C and 3D is different.

In some embodiments, the base station may specify the number of repeated PUSCH transmissions (by the UE) that may be implemented in the high level indication table. Based on the high level table above, in some embodiments, the number of start symbol control fields may be determined according to the maximum number of repetitions supported, and thus, in some configurations, the start symbols are redundant. In some embodiments, to reduce redundancy in the high level indication table, one approach is to configure different tables for different repetition times. For example, one table may be configured for transmissions with a repetition number of 2, and another table may be configured for transmissions with a repetition number of 4.

_i _iExample embodiment 2: determining resources based on parameters (S, L)

In some embodiments, the UE may be tuple (S) based_i，L_i) To determine the resources used for PUSCH transmission. Table 2 below shows several example values that a tuple may take. In some embodiments, the UE may be based on being a tuple (S)_i，L_i) To determine the resources used for PUSCH transmission.

TABLE 2

Line index	S₀	L₀	S₁	L₁	S₂	L₂
							1	2	10	5	9	0	4
2	8	6	0	8	-	-
							3	8	4	2	8	-	-

Fig. 4A to 4C show different configurations of PUSCH transmission of this example embodiment. The line index 1, the line index 2, and the line index 3 correspond to the configurations shown in fig. 4A, 4B, and 4C, respectively. S₀Indicating a starting symbol number, S, of a first PUSCH transmission₁Indicating a starting symbol number for a second PUSCH transmission, and S₂Indicating a starting symbol number for the third PUSCH transmission. Additionally, L₀Indicating duration, L, of first PUSCH transmission₁Indicating duration of second PUSCH transmission, and L₂Indicating a duration of the third PUSCH transmission. In fig. 4A-4C, PUSCH transmissions are shown as grey shaded minislots. For example, in fig. 4A, three PUSCH transmissions are scheduled starting with symbol 2 in slot n, symbol 5 in slot n +1, and symbol 0 in slot n +2, respectively. In the first PUSCH transmission, 10 symbols (e.g., symbols 2 through 11) are transmitted in slot n. In the second PUSCH transmission, 9 symbols (e.g., symbols 5 through 13) are transmitted in slot n + 1. In the third PUSCH transmission, four symbols (e.g., symbols 0 through 3) are transmitted in slot n + 2. In fig. 4B, two PUSCH transmissions are scheduled starting with symbol 2 in slot n and symbol 8 in slot n +1, respectively. Fig. 4C shows a slot structure having downlink symbols and dynamically changing transmission scheduling in consideration of a dynamically changing SFI. For example, the SFI from the base station mayTo indicate that symbols 0 to 2 and symbols 7 to 8 are downlink symbols. Thus, the UE schedules: (i) a first PUSCH transmission of duration 4 symbols starting at symbol 8 in slot n, and (ii) a second PUSCH transmission of duration 4 symbols at symbol 3 (the first available uplink symbol), and a third PUSCH transmission of duration 4 symbols at symbol 9 in slot n + 1.

Example embodiment 1 and example embodiment 2 may be configured differently. Although embodiment 2 may be more flexible because it specifies the duration of each PUSCH transmission, embodiment 2 may consume additional signaling overhead. However, when the signaling overhead is a problem, embodiment 1 may consume lower signaling overhead than embodiment 2.

₀ _iExample embodiment 3: determining resources based on parameters (S, L)

In some embodiments, the UE may be tuple (S) based₀，L_i) To determine the resources used for PUSCH transmission. Table 3 below shows several example values that a tuple may take. In some embodiments, the UE may be based on being a tuple (S)₀，L_i) To determine the resources used for PUSCH transmission.

TABLE 3

Line index	S₀	L₀	L₁	L₂
					1	10	4	4	4
2	0	14	0	0

S₀Indicating a starting symbol number, L, of a first PUSCH transmission₀Indicating duration, L, of first PUSCH transmission₁Indicating duration of second PUSCH transmission, and L₂Indicating a duration of the third PUSCH transmission.

When all symbols in the uplink slot are uplink symbols and the indication parameter in the uplink grant control information received by the UE is indicated as, for example, row index 1 in the table, the UE may determine that the uplink grant control information schedules three PUSCH transmissions in three consecutive slots. The UE schedules the first PUSCH transmission starting with symbol 10 and the number of transmitted symbols is 4. The UE schedules a second PUSCH transmission starting with symbol 0 and the number of transmitted symbols is 4. The UE schedules the third PUSCH transmission starting with symbol 0 and the number of transmitted symbols is 4.

Example embodiment 4: determining resources based on cross-slot transmission indicators

In some embodiments, the UE may determine resources for PUSCH transmission based at least in part on the cross-slot transmission indicator. In some embodiments, the indicator may be associated with a tuple (S)₀L) are included together such that the result tuple is (S)₀L, cross slot transmission indicator). In some embodiments, the indicator may be associated with a tuple (S)₀，L_i) Are included together such thatThe result tuple is (S)₀，L_iThe indicator is transmitted across slots). For simplicity of discussion, assume a transmission duration L for each PUSCH transmission_iAre identical, e.g. 8 symbols. Thus, L₀＝L₁＝L₂...L_i-18. Table 4 below shows the tuples (S)₀，L_iA cross-slot transmission indicator) may take several example values.

TABLE 4

S₀Indicating the starting symbol number, L, of the first PUSCH transmission_iThe duration of each PUSCH transmission is indicated, and the cross-slot transmission indicator may be a binary number (relative to the first PUSCH transmission) indicating whether a PUSCH transmission is performed across consecutive slots. A value of "0" in the field of the cross-slot indicator indicates that cross-slot transmission is disabled, while a value of "1" indicates that cross-slot transmission is enabled. The cross-slot transmission indicator may be N-1 bits long if the maximum number of PUSCH transmissions, N, is 3. In the above table, N is 3. As a result, the cross-slot transmission indicator is 2 bits long. From left to right, a first bit position of the cross-slot transmission indicator indicates whether a PUSCH transmission is to be scheduled in the next slot relative to the first PUSCH transmission, a second bit position indicates whether a PUSCH transmission is to be scheduled in two slots relative to the first PUSCH transmission, and so on. Fig. 5A to 5D show different configurations of PUSCH transmission of this example embodiment. The row index 1, the row index 2, the row index 3, and the row index 4 correspond to the configurations shown in fig. 5A, 5B, 5C, and 5D, respectively. In fig. 5A-5D, the first PUSCH transmission is scheduled to occur at slot n. Depending on the first bit of the cross-slot transmission indicator, the second PUSCH transmission may or may not (e.g., when the first bit is 1) occur in slot n +1 (e.g., when the first bit is 0). Similarly, depending on the second bit of the cross-slot transmission indicator, the third PUSCH transmission may (e.g., when the second bit is 1) or may not (e.g., when the second bit is 0) occur at a timeAt gap n + 1.

If the starting symbol number indicated by the base station as an indication parameter included in the uplink grant control cannot be used for uplink transmission of PUSCH, e.g. when the symbol is a downlink symbol or a flexible symbol, the starting symbol of the transmission defaults to the first valid uplink symbol available. That is, the UE schedules the start symbol as the first valid uplink symbol available for PUSCH transmission. In some embodiments, the starting symbol number and duration of the PUSCH transmission are the same in multiple repetitions of the PUSCH channel. In some embodiments, the resource may be based on another field indicating whether the cross-slot transmission(s) is related to the number of repeated transmissions of the PUSCH channel.

Example embodiment 5: UE determines transport block size (Transmission) block size，TBS)

In some embodiments, the BS sends an uplink grant to the UE, which first determines a Modulation and Coding Scheme (MCS) and time/frequency resources associated with the PUSCH transmission, and then calculates a Transport Block Size (TBS) for each PUSCH transmission based on the determined MCS and time/frequency resources.

In conventional systems, if repeated PUSCH transmissions are configured, the time/frequency resources in each slot are the same each time on a repeated transmission. As a result, the TBS for each PUSCH transmission is the same.

In some embodiments, the UE may determine the TBS as follows:

step 1: determining a number of resource elements, wherein REs represent resource elements, and N_REIndicating the number of resource elements in the slot.

Step 2: determining an intermediate number of information bits

And step 3: the final number of information bits is determined according to a predefined table.

The present patent document discloses details of step 1. Specifically, this patent document discloses calculating N_REDetails of (a). In some embodiments, details of other steps may be found in the NR techniquesAs found in the surgical specifications (e.g., 38.214).

In step 1, N_REThe following can be calculated. First, the UE may determine the number of REs allocated for PUSCH within a PRB by:

then, the number of resource elements allocated for PUSCH (denoted as N)_RE) Can be calculated as:

N_RE＝min(156,N'_RE)·n_PRBwherein

Is the number of sub-carriers in the frequency domain in a physical resource block,

is the number of symbols within a slot allocated for PUSCH transmission,

is the number of REs of the DMRS per Physical Resource Block (PRB) within the duration allocated for PUSCH transmission,

is the amount of overhead, n, configured by one or more higher layer parameters_PRBIs the total number of PRBs allocated for the UE.

With respect to the above equation, this patent document specifically discloses details related to determining the number of symbols allocated for PUSCH transmission on multiple slots to

Replacement of

Therefore, the temperature of the molten metal is controlled,

in accordance with the disclosed technique, a user is provided with,

may be different over multiple slots because the duration of each PUSCH transmission may be different over a slot. Thus, the UE may determine the number of symbols for PUSCH allocation over multiple slots based on several implementation options. Several of them are discussed below:

option 1:

wherein L is a total number of symbols included on all PUSCH transmissions, or L is a total number of symbols of data transmissions included on all PUSCH transmissions; p is a semi-statically configured value or a predetermined fixed value. For example, P-14.

Option 2:

option 3:

is the number of available uplink data symbols for the predefined PUSCH transmission, wherein the predefined PUSCH transmission may be the first PUSCH transmission, or a PUSCH transmission with the largest number of data symbols, or a PUSCH transmission with the largest number of demodulation reference symbols (DMRS).

Option 4:

or

Wherein L is a total number of symbols included in all PUSCH transmissions, N is a total number of PUSCH transmissions, an

And

respectively a round-down and round-up operation.

Option 5:

is the number of available uplink data symbols in each PUSCH transmission.

Option 6: TBS may be related to MCS as shown below. If the MCS is greater than a certain MCS threshold, option 1 calculation can be used

Otherwise option 2 may be used.

To illustrate for determining

Consider the example discussed in fig. 3B. In fig. 3B, three PUSCH transmissions are scheduled with 4, 2, 6 symbols in slots n, n +1, n +2, respectively. The total number of symbols in total for all PUSCH transmissions is 12 and the maximum number of symbols in all PUSCH transmissions is 6. For these options

The values of (a) are given below.

Option 1:

in this example, assume that P is 14.

Option 2:

option 3: if the predefined PUSCH is the first PUSCH transmission, then

If predeterminedIf the defined PUSCH is a PUSCH transmission with the largest number of data symbols, then

Option 4:

option 5: for the first, second and third PUSCH transmissions respectively,

option 6: assuming that the predefined MCS threshold is 6, if the indicated MCS for the PUSCH transmission is 4, option 2 is used, and

however, if the indicated MCS for PUSCH transmission is 10, option 1 is used, and

the examples discussed herein are for illustration only. In alternative embodiments, different formulas or methods may be used to calculate

The value of (c).

Example 6

In the current NR specification, a low density parity check code (LDPC) is used for uplink data transmission. Different Redundancy Versions (RVs) are also defined and a "redundancy version" bit field is included in the uplink scheduling grant. For control information transmission, Polar is used as a channel coding scheme and a redundancy version is not defined. On the other hand, by setting "UL-SCH indicator" control field to "0" in DCI, a-CSI (a form of uplink control information) transmission without UL-SCH can be enabled on PUSCH. In this case, the UL-SCH is present on the PUSCH, but the "redundancy version" bit field is still present in the uplink grant. This bit field is invalid for a-CSI transmission on PUSCH without UL-SCH. Thus, the UE behavior may be specified in connection with processing the "redundancy version" bit field.

The "redundancy version" bit field is not applicable to PUSCH without UL-SCH.

The "redundancy version" bit field (0, 1 or 2 bits) is not suitable for a-CSI transmission.

If the UL-SCH indicator is set to "0", then the "redundancy version" bit field is not applicable to PUSCHs without UL-SCH.

For PUSCH without UL-SCH, the UE ignores the "redundancy version" bit field.

Upon detecting a DCI format 0_1 with a "UL-SCH indicator" set to "0" and with a non-zero "CSI request", where the associated "reportQuantity" in CSI-ReportConfig is not set to "none" for all CSI reports triggered by a "CSI request" in this DCI format 0_1, the UE ignores the bit field "redundancy version" in this DCI and the UE may transmit the corresponding PUSCH as shown in this DCI format 0_ 1.

Upon detecting a DCI format 0_1 with "UL-SCH indicator" set to "0" and with a non-zero "CSI request", the UE ignores the bit field "redundancy version" in this DCI.

Upon detecting DCI format 0_1 with "UL-SCH indicator" set to "0", the UE ignores the bit field "redundancy version" in this DCI.

Example embodiment 7

In the current NR specification, there may be three cases that result in collisions of unlicensed transmissions and slot configurations or Slot Format Indications (SFIs):

case 1: if a set of symbols of a slot is configured for unlicensed PUSCH and the UE detects DCI indicating that the UE is to receive a CSI-RS or PDSCH from a subset of symbols of the set of symbols, the UE cancels PUSCH from remaining symbols of the set of symbolsTransmission, but not expected at PUSCH preparation time T_proc,2The transmission in the symbol from the subset of symbols is cancelled.

Case 2: the UE may cancel PUSCH transmission(s) in a slot if the UE is configured by higher layers to transmit PUSCH in the set of symbols of the slot and if the UE detects a SFI index field value in DCI format 2_0 that indicates that the set of symbols of the slot is downlink or flexible.

Case 3: if the UE is configured with the parameter slotformatdicator by a higher layer, but the UE does not detect DCI format 2_0 providing a slot format for the slot, the UE does not transmit PUSCH configured in the slot starting with symbol X (equal to the number of symbols corresponding to PUSCH preparation time N2 for the corresponding PUSCH timing capability) after the last symbol of the CORESET (where the UE is configured to listen to the PDCCH for DCI format 2_ 0). The UE does not expect to cancel the transmission of PUSCH that starts before symbol X.

To achieve high reliability of URLLC, PUSCH transmission with K repetitions may be a possible implementation. However, in view of the above-mentioned circumstances, a common consequence is that some of the transmission occasions for PUSCH transmission may be cancelled due to collisions with slot configurations or SFIs. This means that K repetitions cannot be guaranteed, since not all Transmission Occasions (TO) are available for transmission, and further enhancements can be considered.

Thus, in some embodiments, it may be assumed that the UE does not expect such collisions to occur. If such a conflict does occur, one of the following options may be employed as the UE behavior:

option 1: conflicting repetitions are cancelled and the cancelled repetitions are not counted among the K repetitions. To ensure K repetitions, the transmission may be deferred until the next available transmission opportunity. In other words, K repetitions are transmitted in consecutive available occasions. Available opportunities do not include conflicting opportunities.

Option 2: conflicting symbols are cancelled, the cancelled symbols not being counted in the total number of symbols for all repetitions. To ensure K repetitions of full length, the transmission may be deferred until the next available transmission symbol. In other words, K repetitions are transmitted in consecutive available symbols. The available symbols do not include conflicting symbols.

Option 3: if only a portion of the symbols collide for repetition, the UE still transmits PUSCH in the remaining symbols at the repetition occasions. Alternatively, if the number of remaining symbols is greater than a threshold T, e.g., T ═ 2, the UE still transmits PUSCH in the remaining symbols at the repetition occasion.

However, conflicting repetitions may be counted among the K repetitions. Alternatively, conflicting repetitions are not counted among the K repetitions. Alternatively, the colliding symbols are counted in the total number of symbols for all repetitions.

Option 4: if a collision occurs, the UE may transmit PUSCH on the collided symbols. In this case, the UE may change the slot configuration or slot format indication.

Fig. 6 is an example flow diagram illustrating steps of a process associated with performing a duplicate transmission on a channel. The process may be performed by, for example, a UE operating in a wireless network. In step 602, the process receives configuration information (or indication information) associated with performing repeated transmissions on a channel (e.g., a PUSCH channel). At step 604, the process determines availability of one or more resources for performing repeated transmissions to a network device (e.g., a base station or another UE) on a channel based on the configuration information. Upon detecting that one or more resources are not available, the process schedules (step 606) a transmission to be performed on the channel based on the next available resource. Upon detecting, however, that one or more resources are available, the process schedules (step 608) transmissions to be performed on the channel in accordance with the one or more resources. In step 610, the process sends or receives a transmission repeatedly performed on the channel (e.g., depending on whether the channel is PUSCH, PDCCH, PDSCH, PUCCH, PRACH, etc.) based on the configuration information.

Fig. 7 depicts a block diagram representing an architecture of a communication device, such as a User Equipment (UE) 700. The UE 700 may include one or more processor electronics 710, such as a microprocessor implementing one or more of the wireless technologies presented in this document. The UE 700 may include transmitter electronics 715 and receiver electronics 720 to transmit and/or receive wireless signals over one or more communication interfaces, such as antennas 720. In some implementations, the transmitter electronics 715 and the receiver electronics 720 may be integrated into a single electronic transceiver unit or module. The UE 700 may include other communication interfaces for transmitting and receiving data. The UE 700 may include one or more memories 705 configured to store information such as data and/or instructions related to the methods disclosed herein. In some implementations, the processor electronics 710 can include at least a portion of the transceiver electronics 715. In some embodiments, at least some of the disclosed techniques, modules, or functions are implemented using the UE 700.

It should be appreciated that this document discloses techniques that may be implemented into a wireless communication system to enable use of uplink grant control information from a base station to indicate configuration parameters to a UE for PUSCH transmission from the UE. The final scheduling may depend on the configuration parameters and the dynamically updated SFI information. The disclosed techniques may be used to determine time and/or frequency resources associated with scheduling PUSCH transmissions. Although this patent document discusses using the example of PUSCH, the disclosed method of determining time domain resources for repeated transmissions is also applicable to channels other than PUSCH, such as PDCCH, PDSCH, PUCCH, PRACH.

The disclosed embodiments and other embodiments, modules, and functional operations described in this document can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this document and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments may be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer-readable medium for execution by, or to control the operation of, 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 matter effecting a machine-readable propagated signal, or a combination of one or more of them. The term "data processing apparatus" includes all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. The propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.

A computer program (also known as a program, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone 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 in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store portions of one or more modules, sub programs, or code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described herein can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. However, a computer does not require such a device. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices (e.g., EPROM, EEPROM, and flash memory devices); magnetic disks (e.g., internal hard disks or removable disks); magneto-optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

While this patent document contains many specifics, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular inventions. Certain features that are described in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments.

Only a few embodiments and examples are described and other implementations, enhancements and variations can be made based on what is described and shown in this patent document.

Claims

1. A method of wireless communication, comprising:

receiving, at a user equipment, configuration information associated with repeatedly performing transmissions on a channel;

determining, based on the configuration information, availability of one or more resources for performing transmissions to network devices on the channel;

upon detecting that the one or more resources are not available, scheduling a transmission performed on the channel in accordance with a next available resource;

upon detecting that the one or more resources are available, scheduling a transmission performed on the channel in accordance with the one or more resources; and

transmitting or receiving a repeatedly performed transmission on the channel based on the configuration information.

2. The method of claim 1, wherein the one or more resources are resources in a time domain or resources in a frequency domain.

3. The method of claim 1, wherein the repeatedly performing transmissions is performed on a shared wireless channel associated with one transport block.

4. The method of claim 1, wherein the configuration information comprises a starting symbol number (S) of a transmission numbered i in a slot_i) And duration (L) of said transmission numbered i in said time slot_i)。

5. The method of claim 1, wherein the configuration information comprises a starting symbol number (S) of a first transmission in a slot j_j) Total transmission duration (L) in total with the transmission on said channel in time slot j_j)。

6. The method of claim 1, wherein the configuration information comprises a starting symbol number (S) of a transmission numbered i in a slot_i) And a total transmission duration (L) in total with the transmission on the channel.

7. The method of claim 1, wherein the configuration information comprises a starting symbol number (S) of a first transmission in a slot j_j) And a total transmission duration (L) in total with the transmission on the channel.

8. The method of claim 1, wherein the configuration information comprises a starting symbol number (S) of a first transmission in a slot₀) And duration of transmission (L) numbered i_i)。

9. The method of claim 1, wherein the configuration information comprises a starting symbol number (S) of a first transmission₀) And a total transmission duration (L) in time slot j, counted for the transmission on said channel.

10. The method of claim 1, wherein the configuration information comprises a starting symbol number (S) of a first transmission₀) And a total transmission duration (L) in total with the transmission on the channel.

11. The method according to any of the preceding claims, wherein the channel corresponds to any of a PDCCH channel, a PDSCH channel, a PUCCH channel, a PRACH channel of 4G mobile communication technologies and 5G mobile communication technologies.

12. The method according to any of the preceding claims, wherein configuration information associated with the duplicate transmission channel is included as part of uplink grant information from the network equipment and/or higher layer configuration information of the user equipment.

13. The method of any preceding claim, wherein the unavailable resource or resources comprise downlink symbols or flexible symbols in a time slot.

14. The method of claim 13, wherein Slot Format Indicator (SFI) information provides an indication of the downlink symbols or the flexible symbols, and wherein the SFI is included as part of the PDCCH channel.

15. The method of claim 14, wherein the SFI is dynamically indicated by the network device.

16. A method of wireless communication, comprising:

calculating parameters at a user equipment

A value of (1), wherein

Representing a number of symbols allocated for shared channel transmission across one or more slots;

at the user equipment at least based on

To determine the parameter N_REA value of (1), wherein N_RERepresenting a number of resource elements allocated for the shared channel transmission; and

based at least on the parameter N_RETo calculate the Transport Block Size (TBS).

17. The method of claim 16, wherein the parameter N_REIs based on N_RE＝min(156,N'_RE)·n_PRBOf which is N'_REIs based on

Wherein N'_REDenotes the number of resource elements allocated for shared channel transmission within a Physical Resource Block (PRB), REs denote resource elements, DMRS denotes demodulation reference symbols,

represents the number of subcarriers in the frequency domain in a PRB,

is the number of REs of the DMRS per Physical Resource Block (PRB) within a duration allocated for shared channel transmission, and

is the amount of overhead configured by one or more higher layer parameters, and n_PRBCorresponding to the total number of PRBs allocated for the user equipment.

18. The method of claim 16, wherein the parameter

Is based on

Where L is the total number of symbols included for all shared channel transmissions or the total number of symbols for data transmissions included for all shared channel transmissions, and P corresponds to a semi-static configuration value or a predetermined fixed value.

19. The method of claim 16, wherein the parameter

Is based on

20. The method of claim 16, wherein the parameter

Is based on

Wherein the predefined shared channel transmission can be any one of: a first shared channel transmission, a shared channel transmission having a maximum number of data symbols, or a shared channel transmission having a maximum number of DMRS symbols.

21. The method of claim 16, wherein the parameter

Is based on

Or

Where L is the total number of symbols included in all shared channel transmissions and N is the shared channelThe total number of transmissions is,

and

respectively a round-down operation and a round-up operation.

22. The method of claim 16, wherein the parameter

Is based on

23. The method of claim 16, wherein the TBS is based at least in part on a Modulation Coding Scheme (MCS), further comprising:

upon determining that the MCS exceeds a threshold, a parameter

Is based on

Where L is the total number of symbols of the data transmission that all shared channel transmissions comprise, and P corresponds to a semi-static configuration value or a predetermined fixed value.

24. The method of claim 16, wherein the TBS is based at least in part on a Modulation Coding Scheme (MCS), further comprising:

upon determining that the MCS is equal to or less than a threshold, a parameter

Is based on

25. The method according to claims 16 to 24, wherein the shared channel is a PUSCH or a PDSCH.

26. A method of wireless communication, comprising:

upon detecting a first uplink grant at a user equipment having an UL-SCH indicator field set to 0 and having a non-zero CSI request field, ignoring a redundancy version bit field in the first uplink grant; and

ignoring a redundancy version bit field in a second uplink grant having a UL-SCH indicator field set to 0 when detecting the second uplink grant.

27. A method of wireless communication, comprising:

transmitting configuration information associated with repeatedly performing transmissions on a channel to at least one user equipment, wherein the configuration information comprises one or more of: (i) starting symbol number (S) of transmission numbered i in a slot_i) (ii) duration (L) of transmission numbered i in said time slot_i) (iii) a total transmission duration (L) in total for transmissions on said channel and (iv) a starting symbol number (S) for the first transmission₀)。

28. A wireless communication apparatus includes a memory and at least one processor configured to implement the above-described method.

29. A computer readable medium having stored thereon processor executable code for implementing the above method.