Transmitter, transceiver and method for processing data to be mapped to transport blocks

Abstract

The present disclosure relates to a transmitter, transceiver and method for processing data to be mapped to a transport block transmitted over a wireless physical shared channel. In one embodiment, a code block determination circuit determines a size of a code block of data mapped across at least one slot boundary of a slot of the wireless physical shared channel. A rate matching circuit rate matches bits of the code block to a number of bits available in the transport block across one or more slots of the wireless physical shared channel. An interleaver interleaves an output of the rate matching circuit such that the code block across the slot boundary between a first slot and a second slot is interleaved between the first slot and the second slot.

Description

TECHNICAL FIELD

[0001] The subject matter disclosed herein relates to the field of wireless communications. More specifically, the subject matter disclosed herein relates to mapping transport blocks across slots allocated for uplink transmissions in a wireless physical shared channel. BACKGROUND

[0002] A wireless network, such as a fifth generation (5G) wireless network, can allocate resources for transmission over a physical shared channel. The form of the allocation can be resources in multiple slots, in which case the allocation corresponds to transmission of a physical shared channel with repetition (e.g., Type A or Type B repetition). Resources can be indicated to a transmitter dynamically (e.g., via downlink control information (DCI)) or semi-statically (e.g., through a process of Configured Grant (CG) Physical Uplink Shared Channel (PUSCH) transmission). Resources can include a set of orthogonal frequency division multiplexing (OFDM) symbols and a set of subcarriers (SCs) and additional configurations for the physical shared channel transmission. The set of OFDM symbols can be contiguous or non-contiguous in time. The OFDM symbols can also be indicated in the form of a set of symbols in one or more slots. The set of subcarriers can be a contiguous or non-contiguous set of subcarriers and can be indicated in the form of a resource block (RB) or a subset of resource blocks. The combination of OFDM symbols and subcarriers corresponds to resource elements (REs) that carry coded bits of the PUSCH. SUMMARY

[0003] Example embodiments provide a transmit block processing chain for a transmitter, which can include a code block determination circuit and a rate matching circuit. The code block determination circuit determines a size of a code block mapped across at least one slot boundary of a slot of a wireless physical shared channel, and the rate matching circuit can rate match bits of the code block with a number of bits available in a transport block across one or more slots of the wireless physical shared channel. In one embodiment, the transmit block processing chain can further include an interleaver that interleaves consecutive outputs of the rate matching circuit based on a slot, such that a code block across a slot boundary between a first slot and a second slot is interleaved within the first slot and the second slot. In another embodiment, the code block across the slot boundary between the first slot and the second slot is segmented with a redundancy version corresponding to the second slot, the output of the rate matching circuit can be limited for a predetermined number of slots, and the interleaver can further interleave the output of the rate matching circuit across the predetermined number of slots. In yet another embodiment, the rate matching circuit can rate match the bits of the code block with the number of bits available in the transport block consecutively, and the interleaver can interleave the consecutive outputs of the rate matching circuit across a predetermined number of slots, which is less than a number of slots allocated to the transmit block processing chain. In one embodiment, the transmit block processing chain can further include an interleaver that can interleave the consecutive outputs of the rate matching circuit without redundancy version segmentation. In another embodiment, the transmit block processing chain can further include an interleaver that interleaves the consecutive outputs of the rate matching circuit based on a slot, which, in response to a cancellation indication, interleaves the output of the rate matching circuit in slots remaining after the cancellation indication, or, in response to uplink control information (UCI) with multi-slot physical uplink shared channel (PUSCH) being scheduled in a transport block spanning one or more slots, interleaves the output of the rate matching circuit in one or more slots before a slot to which the UCI is scheduled. In yet another embodiment of the transmit block processing chain, information scheduling the UCI can be received at a first predetermined time before a first slot of the one or more slots spanned by the transport block, and information related to bits of the UCI can be received at a second predetermined time period before the first slot of the one or more slots spanned by the transport block.

[0004] Example embodiments provide a transceiver that can include receive processing circuitry and transmit processing circuitry. The receive processing circuitry can receive an indication of resources allocated for transmission over a wireless physical shared channel, where the indication of resources can include one or more allocated slots of the wireless physical shared channel. The transmit processing circuitry can include code block determination circuitry and rate matching circuitry. The code block determination circuitry can determine a size of a code block mapped across at least one slot boundary of the allocated slots of the wireless physical shared channel, and the rate matching circuitry can rate match bits of the code block to a number of bits available in a transport block spanning the one or more allocated slots of the wireless physical shared channel. In one embodiment, the transceiver can further include an interleaver that interleaves consecutive outputs of the rate matching circuitry based on a slot, such that the code block across the slot boundary between a first allocated slot and a second allocated slot is interleaved within the first allocated slot and the second allocated slot. In another embodiment, the code block across the slot boundary between the first allocated slot and the second allocated slot can be segmented with a redundancy version corresponding to the second allocated slot, the output of the rate matching circuitry can be limited to a predetermined number of allocated slots, and the interleaver can further interleave the output of the rate matching circuitry across the predetermined number of allocated slots. In another embodiment, the rate matching circuitry can rate match the bits of the code block to the number of bits available in the transport block consecutively, and the interleaver can interleave the consecutive outputs of the rate matching circuitry across a predetermined number of slots, the predetermined number of slots being less than the number of slots allocated to the transmit block processing chain. In another embodiment, the transmit processing circuitry can further include an interleaver that interleaves the consecutive outputs of the rate matching circuitry without redundancy version segmentation. In another embodiment, the transmit processing circuitry can further include an interleaver that interleaves the consecutive outputs of the rate matching circuitry based on a slot, which, in response to a cancellation indication, interleaves the output of the rate matching circuitry in slots remaining after the cancellation indication, or, in response to uplink control information (UCI) with multi-slot physical uplink shared channel (PUSCH) being scheduled in a transport block spanning one or more slots, interleaves the output of the rate matching circuitry in one or more slots preceding a slot to which the UCI is scheduled. In one embodiment, information scheduling the UCI can be received a first predetermined time period before a first slot of the one or more slots spanned by the transport block, and information related to bits of the UCI can be received a second predetermined time period before the first slot of the one or more slots spanned by the transport block.

[0005] Example embodiments provide a method for processing data to be mapped to a transport block, which can include determining, by a code block determination circuit, a size of a code block mapped across at least one slot boundary of a slot of a wireless physical shared channel; and rate matching, by a rate matching circuit, bits of the code block with a number of bits available in the transport block across one or more slots of the wireless physical shared channel. In one embodiment, the method can further include interleaving, by an interleaver, a continuous output of the rate matching circuit based on a slot such that the code block across the slot boundary between a first slot and a second slot is interleaved within the first slot and the second slot. In another embodiment, the method can further include segmenting, by the code block determination circuit, the code block across the slot boundary between the first slot and the second slot with a redundancy version corresponding to the second slot, where the output of the rate matching circuit can be limited to a predetermined number of slots, in which case the method can further include interleaving, by the interleaver, the output of the rate matching circuit across the predetermined number of slots. In another embodiment, the method can further include rate matching, by the rate matching circuit, the bits of the code block with the number of bits available in the transport block continuously, and interleaving, by the interleaver, a continuous output of the rate matching circuit across a predetermined number of slots, the predetermined number of slots being less than a number of slots allocated to the transmit block processing chain. In yet another embodiment, the method can further include interleaving, by the interleaver, the continuous output of the rate matching circuit without redundancy version segmentation. In yet another embodiment, the method can further include interleaving, by the interleaver, a continuous output of the rate matching circuit based on a slot, which includes interleaving the output of the rate matching circuit in one or more slots preceding a slot to which uplink control information (UCI) is scheduled in response to a cancellation indication, or in response to the UCI having a multi-slot physical uplink shared channel (PUSCH) being scheduled in the transport block across one or more slots. In one embodiment, information scheduling the UCI can be received a first predetermined time period before a first slot of the one or more slots across which the transport block spans, and information related to bits of the UCI can be received a second predetermined time period before the first slot of the one or more slots across which the transport block spans. BRIEF DESCRIPTION OF DRAWINGS

[0006] Aspects of the subject matter disclosed herein will now be described with reference to the following example embodiments, which are illustrated in the accompanying drawings, in which:

[0007] Figure 1 An example embodiment of a wireless communication network in accordance with the subject matter disclosed herein is depicted;

[0008] Figure 2 An example embodiment of a base station in accordance with the subject matter disclosed herein is depicted;

[0009] Figure 3An example embodiment of a user equipment according to the subject matter disclosed herein is depicted;

[0010] Figure 4A An example embodiment of a downlink slot structure is depicted;

[0011] Figure 4B An example embodiment of an uplink slot structure for physical uplink shared channel transmission or physical uplink control channel transmission is depicted;

[0012] Figure 5A A block diagram of an example embodiment of a transmitter structure using OFDM according to the subject matter disclosed herein is depicted;

[0013] Figure 5B A block diagram of an example embodiment of an OFDM receiver structure according to the subject matter disclosed herein is depicted;

[0014] Figure 6 A typical legacy processing flow in Release 16 at the transmitter for uplink and downlink of physical shared channels is shown;

[0015] Figure 7 An example of physical and virtual resources that can be allocated to a UE in Release 16 is depicted;

[0016] Figure 8 Multiplexing of uplink control information on a physical uplink shared channel when scheduling resources overlap in Release 16 is depicted;

[0017] Figure 9 Some details of a codeword that can be transmitted across K slots depending on the size of the data block according to the subject matter disclosed herein are shown;

[0018] Figure 10 An example case according to the subject matter disclosed herein where a data block B that is small enough to fit in a single code block across a slot boundary is shown;

[0019] Figure 11 An example case according to the subject matter disclosed herein where a data block B that is relatively large fits in two code blocks is depicted;

[0020] Figure 12 An example case according to the subject matter disclosed herein where a data block B that is relatively very large fits in many code blocks is shown;

[0021] Figure 13 An example case according to the subject matter disclosed herein when K does not divide P is depicted;

[0022] Figure 14An example scenario is depicted in which resources available for mapping across slot PUSCH transmission are non-contiguous, according to the subject matter disclosed herein;

[0023] Figure 15 Three locations in which cancellation indication can be performed in operation of a transport block processing chain are depicted, according to the subject matter disclosed herein;

[0024] Figures 16A-16E An example scenario is described in which a cancellation indication in one slot of an uplink cross-slot mapping transmission is received and processed by a transmitter, according to the subject matter disclosed herein;

[0025] Figure 17A An example cross-slot mapping transmission of two code block groups across three slots is depicted, according to the subject matter disclosed herein;

[0026] Figure 17B An example cross-slot mapping transmission of two code block groups across three slots in the case of code block segmentation is depicted, according to the subject matter disclosed herein;

[0027] Figure 18 An example operation of a transport block processing chain is depicted, according to the subject matter disclosed herein;

[0028] Figure 19A An example cross-slot mapping transmission of code blocks in two code block groups across three slots is depicted, according to the subject matter disclosed herein;

[0029] Figure 19B An example cross-slot mapping transmission of code blocks in two code block groups across three slots with segmentation is depicted, according to the subject matter disclosed herein;

[0030] Figure 20 A configured grant period in a configured grant configuration that can include a set of regular transmission occasions and cross-slot mapping transmission occasions is depicted, according to the subject matter disclosed herein;

[0031] Figure 21A An example case is depicted in which the codeword length L is too small;

[0032] Figure 21B An example case is depicted in which an additional redundancy version is added to a transport block, according to the subject matter disclosed herein;

[0033] Figure 22A And 22B An example case is depicted in which fewer redundancy versions can be used in a transport block, according to the subject matter disclosed herein;

[0034] Figure 23A And 23BExample contiguous rate matched output of code blocks with known cross-slot boundaries and corresponding interleaver output according to the subject matter disclosed herein are depicted respectively;

[0035] Figure 24A and 24B Example segmented code block rate matched output with new redundancy version and corresponding interleaver output according to the subject matter disclosed herein are depicted respectively;

[0036] Figure 25A and 25B Example restricted contiguous rate matched output of code blocks and corresponding restricted contiguous interleaver output according to the subject matter disclosed herein are depicted respectively;

[0037] Figure 26A and 26B Example contiguous rate matched output across each slot and corresponding interleaver output according to the subject matter disclosed herein are depicted respectively;

[0038] Figure 27A and 27B Example segmented code block rate matched output with new redundancy version and corresponding interleaver output independently across each slot according to the subject matter disclosed herein are depicted respectively;

[0039] Figure 28A and 28B Example rate matched output and corresponding interleaver output according to the subject matter disclosed herein in which systematic bits and parity bits are processed separately when determining input to an interleaver for different slots are depicted respectively;

[0040] Figure 29 An example rate matched output according to the subject matter disclosed herein divided into multiple parts is shown;

[0041] Figure 30 An example case in which a multi-slot PUSCH is scheduled and uplink control information has been scheduled to be multiplexed in one of the slots forming the multi-slot PUSCH is depicted;

[0042] Figure 31 An example case of Figure 30 is depicted from a timeline perspective;

[0043] Figure 32 An example punctured slot for a first embodiment of rate matching and interleaver operation according to the subject matter disclosed herein is depicted;

[0044] Figure 33 An example punctured slot for a first embodiment of rate matching and interleaver operation according to the subject matter disclosed herein is depicted;

[0045] Figure 34 a timeline adaptation for a multi-slot shared channel with four slots and four code blocks for uplink control information multiplexing according to the subject matter disclosed herein is depicted;

[0046] Figure 35 an example rate matching output for a multi-slot PUSCH spanning two slots with three code blocks, RV3, and UCI multiplexing according to the subject matter disclosed herein is depicted;

[0047] Figure 36 an example rate matching output for a multi-slot PUSCH with two slots, three code blocks, RV3, and UCI multiplexing with a keep code block according to the subject matter disclosed herein is depicted;

[0048] Figure 37 an example rate matching output for a multi-slot PUSCH with two slots, three code blocks, RV3, and UCI multiplexing with a keep code block according to the subject matter disclosed herein is depicted;

[0049] Figure 38 an example rate matching output for a multi-slot PUSCH spanning four slots with three CBs with RV0 according to the subject matter disclosed herein is depicted;

[0050] Figure 39 a corresponding rate matching output according to the subject matter disclosed herein is depicted, where the amount of available coded bits is reduced evenly between the affected bits; Figure 38

[0051] a corresponding rate matching output according to the subject matter disclosed herein is depicted, where the affected code block keeps system bits; and Figure 40 Figure 38

[0052] Figure 41 a corresponding rate matching output according to the subject matter disclosed herein is depicted, where the affected code block keeps system bits; and DETAILED DESCRIPTION

[0053] In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the disclosure. However, it will be understood by those skilled in the art that the disclosed aspects can be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the subject matter disclosed herein.

[0054] ​​Reference within this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment. The appearances of the phrase “in one embodiment” or “in an embodiment” or “according to one embodiment” (or other similar phrases) within this specification does not necessarily refer to the same embodiment. Further, to the extent that a particular feature, structure, or characteristic is described in connection with one or more embodiments, it is submitted that it is within the purview of one of ordinary skill in the art to effect such feature, structure, or characteristic in connection with another embodiment. In this regard, the word “exemplary” is used herein merely to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments. Additionally, in one or more embodiments, the particular features, structures, or characteristics can be combined in any suitable manner. Moreover, according to the context of discussion herein, a singular term can include its plural aspect, and a plural term can include its singular aspect. Similarly, a hyphenated term (e.g., “two- dimensional”) can be occasionally used in conjunction with its non-hyphenated counterpart (e.g., “two dimensional”) merely to aid in identification of the term, and does not necessarily connote a separate or different aspect of the term. Such occasional use of the hyphenated term in conjunction with a non-hyphenated counterpart should not be taken to imply a difference between the two in meaning. Likewise, a capitalized term (e.g., “Counter Clock”) can be occasionally used in conjunction with its non-capitalized counterpart (e.g., “counter clock”) merely to aid in identification of the term, and does not necessarily connote a separate or different aspect of the term. Such occasional use of the capitalized term in conjunction with a non-capitalized counterpart should not be taken to imply a difference between the two in meaning.

[0055] Further, according to the context of the discussion herein, a singular term can include its plural aspect, and a plural term can include its singular aspect. Further note that the various figures (including component figures) illustrated herein are not drawn to scale. Rather, the dimensions of some of the elements can have been exaggerated relative to other elements for clarity. Further, if considered appropriate, reference numerals have been repeated among the figures to indicate corresponding elements.

[0056] The terminology used herein is for the purpose of describing some example embodiments only and is not intended to be limiting of the claimed subject matter. As used herein, the singular forms “a,” “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and / or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0057] It will be understood that when an element or layer is referred to as being "on" or "coupled to" another element or layer, it can be directly on, coupled to or be connected to the other element or layer, or intervening elements or layers can be present. In contrast, when an element is referred to as being "directly on," "directly connected to," or "directly coupled to" another element or layer, there are no intervening elements or layers present. Like reference numerals refer to like elements throughout. As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items.

[0058] The terms "first," "second," and the like, as used herein, are used as labels for nouns that they precede, and do not necessarily describe a relationship with, or order of, those entities. Moreover, the terms "first," "second," and the like, can be used interchangeably with "one," "the," and / or "said" to describe various embodiments. Furthermore, the use of these terms in the description is merely intended to distinguish the various components, regions, layers and / or elements being described and is not intended to or should be construed to limit the scope of the disclosure. In addition, the use of relative terms, such as "beneath," "below," "lower," "above," "upper," and the like, are intended to be interpreted variably as the relative position of the components, regions, layers and / or elements being described, and are not intended to or should be construed to limit the scope of the disclosure.

[0059] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this subject matter belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.

[0060] As used herein, the term "module" refers to any combination of software, firmware, and / or hardware configured to provide the functionality described herein with respect to the module. For example, software can be embodied in software packages, code, and / or instructions sets or instruction, and the term "hardware" as used herein in any implementation described herein can include, for example, components, hardwired circuitry, programmable circuitry, state machine circuitry, and / or firmware that stores instructions to be executed by the programmable circuitry. These modules can be individually and / or collectively embodied as a circuit that forms part of a larger system, for example, but not limited to, an integrated circuit (IC), system-on-a-chip (SoC), component, etc.

[0061] Figures 1-40 The various embodiments illustrated and described herein are by way of example only, and should not be construed in any way to limit the scope of the subject matter disclosed herein. It should be understood that the subject matter disclosed herein can be implemented in any suitable arrangement.

[0062] At least the following documents are incorporated herein by reference, as fully set forth herein: 3GPP TS 38.211 v15.6.0, “NR; Physical Channels and Modulation”; 3GPP TS 38.212 v15.6.0, “NR; Multiplexing and Channel Coding”; 3GPP TS 38.213 v15.6.0, “NR; Physical Layer Procedures for Control”; 3GPP TS 38.214 v15.6.0, “NR; Physical Layer Procedures for Data”; 3GPP TS 38.321 v15.6.0, “NR; Media Access Control (MAC) Protocol Specification”; and 3GPP TS 38.331 v15.6.0, “NR; Radio Resource Control (RRC) Protocol Specification”.

[0063] Figure 1 -5 describes various example implementations in wireless communication systems and the use of orthogonal frequency division multiplexing (OFDM) or orthogonal frequency division multiple access (OFDMA) communication technologies. Figures 1-3 The description herein does not imply any physical or architectural limitation on the different implementations. Different embodiments of the subject matter disclosed herein can be implemented in any suitably arranged communication system.

[0064] Figure 1 An example embodiment of a wireless communication network 100 according to the subject matter disclosed herein is depicted. Figure 1 The example embodiments of the wireless network depicted herein are for illustrative purposes only. Other embodiments of the wireless network 100 may be used without departing from the principles of the subject matter disclosed herein.

[0065] like Figure 1 As shown, the wireless network 100 includes gNB 101 (e.g., a base station BS), gNB 102, and gNB 103. gNB 101 can communicate with gNB 102 and gNB 103. gNB 101 can also communicate with at least one network 130, such as the Internet, a proprietary Internet Protocol (IP) network, or other data network.

[0066] The gNBs 102 can provide wireless broadband access to the network 130 for a first plurality of UEs within a coverage area 120 of the gNBs 102. The first plurality of UEs can include a UE 111, which can be located in a small business (SB); a UE 112, which can be located in a enterprise I; a UE 113, which can be located in a WiFi hotspot (HS); a UE 114, which can be located in a first residence I; a UE 115, which can be located in a second residence I; and a UE 116, which can be a mobile device (M), such as a mobile phone, a wireless laptop, a wireless PDA, etc. The gNB 103 can provide wireless broadband access to the network 130 for a second plurality of UEs within a coverage area 125 of the gNB 103. The second plurality of UEs can include the UE 115 and the UE 116. In some embodiments, one or more of the gNBs 101-103 can communicate with each other as well as with the UEs 111-116 using 5G / NR, LTE, LTE-A, WiMAX, WiFi, and / or other wireless communication techniques.

[0067] Depending on the network type, the term "base station" or "BS" can refer to any component (or collection of components) configured to provide wireless access to a network, such as a transmit point (TP), transmit-receive point (TRP), an enhanced base station (eNodeB or eNB), a 5G / NR base station (gNB), a macrocell, a femtocell, a WiFi access point (AP), or other wireless-enabled devices. Base stations can provide wireless access in accordance with one or more wireless communication protocols, such as 5G / NR 3GPP New Radio Interface / Access (NR), Long Term Evolution (LTE), LTE Advanced (LTE-A), High Speed Packet Access (HSPA), Wi-Fi 802.11a / b / g / n / ac, etc. For the sake of convenience, the terms "BS" and "TRP" can be used interchangeably herein to refer to a network infrastructure component that provides wireless access to remote terminals. Further, depending on the network type, the term "user equipment" or "UE" can refer to any component such as a "mobile station," "subscriber station," "remote terminal," "wireless terminal," "receive point," or "user device." For the sake of convenience, the terms "user equipment" and "UE" are used interchangeably herein to refer to a remote wireless equipment that wirelessly accesses a base station, whether the UE is a mobile device such as a mobile phone or smartphone, or is a typically considered a stationary device such as a desktop computer or vending machine.

[0068] Dotted lines show the approximate extents of the coverage areas 120 and 125, which are shown as approximately circular for the purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with gNBs, such as the coverage areas 120 and 125, can have other shapes, including irregular shapes, depending upon the configuration of the gNBs and the variation of the radio environment associated with natural and man-made obstructions.

[0069] As described in more detail below, one or more of the UEs 111-116 include circuitry, programming, or a combination thereof, for efficient control signaling designed to improve resource utilization. In some embodiments, one or more of the gNBs 101-103 include circuitry, programming, or a combination thereof, for efficient control signaling designed to improve resource utilization.

[0070] Although Figure 1 various changes can be made to Figure 1 the wireless network depicted. For example, the wireless network can include any number of gNBs and any number of UEs in any suitable arrangement. In addition, the gNBs 101 can communicate directly with any number of UEs and provide those UEs with wireless broadband access to the network 130. Similarly, each gNB 102-103 can communicate directly with the network 130 and provide UEs with direct wireless broadband access to the network 130. Further, the gNBs 101, 102, and / or 103 can provide access to other or additional external networks, such as external telephone networks or other types of data networks.

[0071] Figure 2 An example embodiment of a gNB 102 in accordance with the subject matter disclosed herein is depicted. Figure 2 The embodiment of the gNB 102 depicted in Figure 1 The gNBs 101 and 103 can have the same or similar configuration. However, gNBs have a wide variety of configurations and Figure 2 the scope of the subject matter disclosed herein is not limited to any particular implementation of a gNB.

[0072] As Figure 2 illustrated, the gNB 102 includes multiple antennas 201a-201n, multiple radio frequency (RF) transceivers 202a-202n, receive (RX) processing circuitry 203, and transmit (TX) processing circuitry 204. The gNB 102 also includes a controller / processor 225, a memory 230, and a backhaul or network interface 235.

[0073] The RF transceivers 202a-202n can receive, from the antennas 201a-201n, incoming RF signals transmitted by UEs in the network 100. The received RF signals can be down-converted to generate IF or baseband signals. The IF or baseband signals can be sent to the RX processing circuitry 203, which can generate processed baseband signals by filtering, decoding, and / or digitizing the baseband or IF signals. The RX processing circuitry 203 can send the processed baseband signals to the controller / processor 205 for further processing.

[0074] The TX processing circuitry 204 receives analog or digital data, such as but not limited to voice data, web data, e-mail, or interactive video game data, from the controller / processor 225. The TX processing circuitry 204 encodes, multiplexes, and / or digitizes the outgoing baseband data to generate processed baseband or IF signals. The RF transceivers 202a-202n receive the outgoing processed baseband or IF signals from the TX processing circuitry 204 and up-convert the baseband or IF signals to RF signals that are transmitted via the antennas 201a-201n.

[0075] The controller / processor 205 can include one or more processors or other processing devices to manage the overall operation of the gNB 102. For example, the controller / processor 205 can control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceivers 202a-202n, the RX processing circuitry 203, and the TX processing circuitry 204 in accordance with well-known principles. The controller / processor 205 can support additional functions as well, such as more advanced wireless communication functions. For instance, the controller / processor 205 can support beam forming or directional routing operations in which outgoing signals from different antennas 201a-201n are weighted and combined. The controller / processor 205 can also support any of a variety of other functions.

[0076] The controller / processor 205 is also capable of executing programs and other processes resident in the memory 206, such as an operating system (OS). The controller / processor 205 can move data into or out of the memory 206 as required by the processes executing on the controller / processor 205. A portion of the memory 206 can include non- volatile memory, such as flash memory, or other suitable data storage.

[0077] The controller / processor 205 is also coupled to the backhaul or network interface 207. The backhaul or network interface 207 can allow the gNB 102 to communicate with other devices or systems over a backhaul connection or over a network. It can support communication via wired or wireless connection(s) as appropriate. For example, when the gNB 102 is implemented as part of a cellular communication system such as a system supporting 5G, LTE, or LTE-A, the interface 207 can allow the gNB 102 to communicate with other gNBs via a wired or wireless backhaul connection. When the gNB 102 is implemented as an access point, the interface 207 can allow the gNB 102 to communicate with other gNBs via a wired or wireless local area network or via a wired or wireless connection to a larger network such as the Internet. The interface 207 can include any suitable structure supporting communications over wired or wireless connections, such as an Ethernet or RF transceiver.

[0078] Although Figure 2 various changes can be made to the gNB 102 depicted. Figure 2 For example, the gNB 102 could include any number of Figure 2 each of the components shown. As a particular example, an access point could include multiple interfaces 207, and the controller / processor 205 could support routing functions to route data between different network addresses. As another particular example, while shown as including a single instance of TX processing circuitry 204 and a single instance of RX processing circuitry 203, the gNB 102 could include multiple instances of each (such as one per RF transceiver). Figure 2 The various components illustrated in the system 200 can be combined, further subdivided, or omitted

[0079] Figure 3 An example embodiment of a UE 116 according to the subject matter disclosed herein is depicted. Figure 3 The embodiment of the UE 116 depicted in FIG. 1 is for illustration only and Figure 1 The UEs 111-UE 115 could have the same or similar configuration. However, UEs have a wide variety of configurations and Figure 3 The scope of the disclosure is not limited to any particular embodiment of a UE.

[0080] As Figure 3As shown, the UE 116 includes an antenna 301, a RF transceiver 302, TX processing circuitry 303, a microphone 304, and receive (RX) processing circuitry 305. The UE 116 can also include a speaker 360, a processor 307, an input / output (I / O) interface (IF) 308, a touchscreen 309, a display 310, and a memory 311. The memory 311 can include an OS 312 and one or more applications 313.

[0081] The RF transceiver 302 receives, from the antenna 301, an incoming RF signal transmitted by a gNB of the network 100. The RF transceiver 302 down-converts the incoming RF signal to generate an intermediate frequency (IF) or baseband signal. The IF or baseband signal is passed to the RX processing circuitry 305, which filters, decodes, and / or digitizes the baseband or IF signal to generate a processed baseband signal. The RX processing circuitry 305 transmits the processed baseband signal to the speaker 360, such as for voice data, or to the processor 307 for further processing, such as for web browsing data.

[0082] The TX processing circuitry 303 can receive analog or digital voice data from the microphone 304, or other outgoing baseband data (such as web browsing data, e-mail, or interactive video game data) from the processor 307. The TX processing circuitry 303 encodes, multiplexes, and / or digitizes the outgoing baseband data to generate a processed baseband or IF signal. The RF transceiver 302 receives the outgoing processed baseband or IF signal from the TX processing circuitry 303 and up-converts the baseband or IF signal to an RF signal that is transmitted via the antenna 301.

[0083] The processor 307 can include one or more processors or other processing devices and execute the OS 312 stored in the memory 311 in order to control the overall operation of the UE 116. For example, the processor 307 could be responsible for managing request from a network 100, according to well known principles. The processor 307 can include at least one microprocessor or microcontroller.

[0084] The processor 307 is also capable of executing other processes and programs resident in the memory 311, such as processes for beam management. The processor 307 can move data into or out of memory 311 as required by the executing processes. In some embodiments the processor 307 is configured to execute the applications 313 based on the OS 312 or in response to signals received from gNBs or an operator. The processor 307 is also coupled to the I / O interface 308 that provides the UE 116 with the ability to connect to other devices such as portable computers and handheld computers. The I / O interface 308 is the communication path between these accessories and the processor 307.

[0085] The processor 307 is also coupled to the touchscreen 309 and the display 310. The touchscreen 309 can be used by the operator of the UE 116 to input data into the UE 116. The display 310 can be a liquid crystal display, light emitting diode display, or other display capable of rendering text and / or at least limited graphics, such as from web sites.

[0086] The memory 311 can be coupled to the processor 307. Portions of the memory 311 can include a RAM, and portions of the memory 311 can include a flash memory or other ROM.

[0087] Although Figure 3 one example of a UE 116 is shown, various changes can be made Figure 3 to Figure 3 the components of the UE 116. For example, various components in Figure 3 the UE 116 can be combined, further subdivided, or omitted and additional components can be added according to particular needs. As a particular example, the processor 340 can be divided into multiple processors such as one or more Central Processing Units (CPUs) and one or more Graphics Processing Units (GPUs). Also, while the UE 116 is illustrated as being configured as a mobile phone or smartphone, the UE can be configured to operate as other types of mobile or stationary devices.

[0088] To meet the demand for wireless data traffic having increased since deployment of 4G communication systems, efforts have been made to develop an improved 5G / NR or pre-5G / NR communication system. Therefore, the 5G / NR or pre-5G / NR communication system is also called a 'Beyond 4G Network' or a 'Post LTE System'. The 5G / NR communication system can be considered as a 'Beyond 4G Network' or a 'Post LTE System' from a perspective of improvement of a 4G communication system. The 5G / NR communication system is also called a 5G system, a 5G network, or the like. The 5G / NR communication system is a system for supporting higher data rates beyond 4G communication systems, and is also called a 5G network. The 5G / NR communication system can be implemented in higher frequency (mmWave) bands, such as 28 GHz or 60 GHz bands, to support higher data rates beyond 4G communication systems. In the 5G / NR communication system, the beamforming, the massive Multiple-Input Multiple-Output (MIMO), the Full Dimensional MIMO (FD-MIMO), the array antenna, the analog beam forming, the large scale antenna technology, and the improvement of the network infrastructure are discussed. In addition, the 5G / NR communication system is developed to support the Advanced Small Cell, the cloud Radio Access Network (RAN), the ultra-dense network, the device-to-device (D2D) communication, the wireless backhaul, the moving network, the cooperative communication between / among base stations, the Coordinated Multi-Points (CoMP), the reception-end interference cancellation, and the support of a super-wide bandwidth in the above-mentioned frequency band, and the like.

[0089] A communication system can include a downlink (DL) referring to a transmission from a base station or one or more transmission points to a UE, and an uplink referring to a transmission from a UE to a base station or one or more reception points.

[0090] A unit for DL signaling or UL signaling on a cell can be referred to as a slot, and can include one or more symbols. A symbol can also be used as an additional time unit. A frequency (or bandwidth (BW)) unit can be referred to as a resource block (RB). One RB can include a plurality of subcarriers (SCs). For example, a slot can have a duration of 0.5 msec or 1 msec, include 14 symbols, and an RB can include 12 SCs with an interval of 30 KHz or 15 KHz between the SCs, respectively. A unit of one RB in frequency and one symbol in time can be referred to as a physical RB (PRB).

[0091] DL signals can include data signals that transmit information content, control signals that transmit DL control information (DCI), and reference signals (RS), which can also be referred to as pilot signals. gNBs transmit data information or DCI through their respective Physical DL Shared Channel (PDSCH) or Physical DL Control Channel (PDCCH). PDSCH or PDCCH can be transmitted using a variable number of time slot symbols, each including one time slot symbol. For simplicity, the DCI format used to schedule UE PDSCH reception can be referred to as the DL DCI format, and the DCI format used to schedule PUSCH transmission from the UE can be referred to as the ULDCI format.

[0092] The gNB can transmit one or more types of RS, including Channel State Information RS (CSI-RS) and Demodulated RS (DM-RS). CSI-RS is primarily used by the UE to perform measurements and provide Channel State Information (CSI) to the gNB. For channel measurements, Non-Zero Power CSI-RS (NZP CSI-RS) resources can be used. For interference measurement reports (IMR), CSI Interference Measurement (CSI-IM) resources can be used. A CSI procedure may involve both NZP CSI-RS and CSI-IM resources.

[0093] The UE can determine the CSI-RS transmission parameters via DL control signaling or higher-layer signaling (such as Radio Resource Control (RRC) signaling) from the gNB. The transmission instance of CSI-RS can be indicated by DL control signaling or configured by higher-layer signaling. DM-RS can typically be transmitted only within the BW of each PDCCH or PDSCH, and the UE can use DM-RS to demodulate data or control information.

[0094] Figure 4A An example embodiment of a DL time slot structure 400 according to the subject matter disclosed herein is depicted. Figure 4A The example embodiment of the DL time slot structure 400 depicted in Figure 4 is for illustrative purposes only. Figure 4 does not limit the scope of the subject matter disclosed herein to any particular implementation. It should be noted that in the DL time slot structure 400 described below, DCI information is not required as... Figure 4A The location shown is positioned, and it can be appropriately positioned elsewhere.

[0095] like Figure 4A As shown, DL time slot 401 may include Symbol 402, gNB can transmit, for example, data information, DCI, or DM-RS. DL system BW can include Each RB may include 1 RB. One SC. The UE is assigned M PDSCH RBs, used for a total of The PDCCH carrying the DCI can be transmitted over control channel elements (CCEs) that are substantially spread over the DL system BW. The first slot symbol 404 can be used by the gNB for transmission of PDCCH. The second slot symbol 405 can be used by the gNB for transmission of PDCCH or PDSCH. The remaining slot symbols 406 can be used by the gNB for transmission of PDSCH and CSI-RS. In some slots, the gNB can also transmit channels for synchronization signals and transmission of system information, such as synchronization signal and primary broadcast channel (SS / PBCH) blocks.

[0096] The UL signals can also include data signals conveying information content, control signals conveying UL control information (UCI), DM-RS associated with data or UCI demodulation, sounding RS (SRS) to enable the gNB to perform UL channel measurement, and random access (RA) preamble to enable the UE to perform random access. The UE can transmit data information or UCI over a respective physical UL shared channel (PUSCH) or physical UL control channel (PUCCH). The PUSCH or PUCCH can be transmitted over a variable number of symbols in a slot including one symbol. When the UE transmits data information and UCI simultaneously, the UE can multiplex both in the PUSCH.

[0097] The UCI can include: hybrid automatic repeat request acknowledgement (HARQ-ACK) information indicating correct or incorrect detection of data transport blocks (TBs) or code block groups (CBGs) in the PDSCH; a scheduling request (SR) indicating whether the UE has data to the UE in a buffer; and a CSI report to enable the gNB to select appropriate parameters for PDSCH or PDCCH transmission to the UE.

[0098] The CSI report from the UE can include: a channel quality indicator (CQI) informing the gNB of a maximum modulation and coding scheme (MCS) for the UE to detect a TB with a predetermined block error rate (BLER), such as a 10% BLER; a precoding matrix indicator (PMI) informing the gNB how to combine signals from multiple transmitter antennas according to multiple-input multiple-output (MIMO) transmission principles; a CSI-RS resource indicator (CRI) indicating a CSI-RS resource associated with the CSI report; and a rank indicator (RI) indicating a transmission rank of the PDSCH.

[0099] The UL RSs can include DM-RS and SRS. The DM-RS can only be transmitted within the BW of the corresponding PUSCH or PUCCH transmission. The gNB can use the DM-RS to demodulate the information in the corresponding PUSCH or PUCCH. The SRS can be transmitted by the UE to provide the gNB with an UL CSI, and for a TDD system, the SRS transmission can also provide a PMI for a DL transmission. In addition, to establish synchronization or an initial higher layer connection with the gNB, the UE can transmit a physical random access channel (PRACH).

[0100] Figure 4B An example embodiment of an UL slot structure 410 for a PUSCH transmission or a PUCCH transmission is depicted in accordance with the subject matter disclosed herein. Figure 4B The embodiment of the UL slot structure 410 depicted in Figure 4B The scope of the subject matter disclosed herein is not limited to any particular implementation. Figure 4B The UCI information does not need to be positioned as shown in the UL slot structure 410 described below, and can be positioned elsewhere as appropriate.

[0101] As shown in Figure 4B The slot 411 can include symbols 412 in which the gNB can transmit, for example, data information, DCI, or DM-RS. The UL system BW can include N RBs. Each RB can include a total of M RBs for a PUSCH transmission BW (“X” = “S”) or for a PUCCH transmission BW (“X” = “C”). The total number of SCs 413 can be allocated to the UE for the M RBs. For example, the last symbol or symbols of the slot can be used to multiplex SRS transmissions 414 or short PUCCH transmissions from one or more UEs. PUXCH

[0102] Figure 5A A block diagram of an example embodiment of a transmitter structure 501 using OFDM in accordance with the subject matter disclosed herein is depicted. Figure 5A The embodiment of the transmitter structure 501 depicted in Figure 5A The scope of the subject matter disclosed herein is not limited to any particular implementation.

[0103] As shown in Figure 5A ​As shown, information bits, such as DCI bits or data information bits 502 can be encoded by an encoder module 503, rate matched by a rate matcher module 504 to allocated time / frequency resources, and modulated by a modulator module 505. Subsequently, modulated coded symbols and DM-RS or CSI-RS module 506 can be mapped to SCs by a SC mapping module 507 controlled by a transmission bandwidth module 508. Inverse fast Fourier transform (IFFT) can be performed by a filter module 509. A cyclic prefix (CP) can be added to the output of the filter module 509. The resulting signal can be filtered by a common interface unit (CIU) filter module 510 and transmitted as a transmitted signal 512 by an RF module 511.

[0104] Figure 5B A block diagram depicting an example embodiment of an OFDM receiver structure 531 is shown. Figure 5B The embodiment of the receiver structure 531 depicted is for illustration only, and actual implementations can have the same or similar configurations. Figure 5B The scope of the subject matter disclosed herein is not limited to any particular implementation. As Figure 5B As shown, a received signal 532 can be filtered by a filter module 533. A CP removal module 534 can remove a cyclic prefix. A filter module 535 can apply a fast Fourier transform (FFT). A SC de-mapping module 536 can de-map BWs selected by a selector module 537. Received symbols can be demodulated by a channel estimator and demodulator module 538. A rate de-matcher module 539 can recover rate matching, and a decoder module 540 can decode resulting bits to provide data information bits 541. DL transmissions and UL transmissions can be based on an orthogonal frequency division multiplexing (OFDM) waveform including a variant before DFT known as DFT-spread-OFDM (DFT-spread-OFDM).

[0105] As previously mentioned, the purpose of the 3GPP Rel-17 SID on RedCap NR devices is to support the same set of use cases in FR2 as in FR1. Beam refinement can be a key feature for FR2 operation in NR. An important issue involves enabling beam refinement procedures for RedCap UEs in RRC_INACTIVE state (also referred to herein as RRC inactive state or inactive mode). Accordingly, the subject matter disclosed herein provides a set of beam refinement procedures to enable RedCap in inactive mode transmissions in FR2.

[0106] Figure 6A typical legacy procedure flow 600 in Rel-16 at a transmitter for uplink and downlink of a physical shared channel (PUSCH / PDSCH) is shown. At 601, an allocation can be made in the form of resources in a single slot corresponding to a transmission of one physical shared channel transmission. The form of the allocation can be resources in multiple slots, in which case the allocation corresponds to a transmission of a physical shared channel with repetition (e.g., Type A or Type B repetition). The resources can be indicated to the transmitter dynamically (e.g., via DCI) or semi-statically (e.g., by a procedure of a CG PUSCH transmission). The resources can include a set of OFDM symbols and a set of subcarriers and additional configurations for the physical shared channel transmission. The set of OFDM symbols can be contiguous or non-contiguous in time. The OFDM symbols can also be indicated in the form of a set of symbols in one or more slots. The set of subcarriers can be a set of contiguous or non-contiguous subcarriers and can be indicated in the form of resource blocks or subsets of resource blocks. The combination of OFDM symbols and subcarriers corresponds to resource elements that carry coded bits of the PUSCH.

[0107] Most of the physical shared channel processing can primarily involve virtual resources and slots, except at the mapping procedure 607 at the end of the procedure flow 600. Resources can be grouped into physical resources and virtual resources. Physical resources can be resources that correspond to actual time / frequency resources used by the transmitter for RF transmission of signals corresponding to the physical shared channel. Virtual resources can be resources used by the transmitter in the process of generating coded bits and modulated symbols corresponding to the physical shared channel. As used herein, a reference to a “slot,” “symbol,” or “resource” indicates a virtual version of the term. Only when the term “physical” is explicitly attached does such a reference in this document indicate the physical term.

[0108] At 602, the transmitter determines a transport block size (TBS) based on the allocated resources and configured resources for transmission overhead, such as demodulation reference signal (DMRS) resources. At 603, information bits contained in transport blocks (TBs) and code blocks (CBs) are determined. At 604, low density parity check (LDPC) encoding is performed on different code blocks that can form a transport block. At 605, the output codeword of each code block is rate matched (RM) with the number of available coded bits for transmission of the code block in the physical shared channel. At 606, an interleaver maps the rate matched output onto modulated symbols. At 607, mapping from virtual symbols to physical symbols is performed, which are then transmitted on different resource elements of the allocated physical shared channel.

[0109] When Rel-16 physical shared channel is scheduled with repetition / aggregation, the procedure 600 can be repeated substantially, with some differences for each repetition. For example, each repetition can be used to transmit the same TB; and in each repetition, a different redundancy version (RV) index can be used, which can change the RM output for each repetition.

[0110] Figure 7 Examples of physical and virtual resources that can be allocated to a UE in Rel-16 are depicted. In Figure 7 , time resources have been allocated as three (3) UL slots 701a-701c for PUSCH transmission. In each slot, there are six (6) consecutively allocated OFDM symbols, starting from the second symbol (symbol number 2) in the slot. According to a time division duplex (TDD) configuration, the UL slots can be allocated as consecutive, non-consecutive, or a combination of consecutive slots and non-consecutive slots. In Figure 7 , if a TDD configuration is assumed that results in the pattern DDSUU (S: 10D, 4U), this TDD configuration corresponds to the UE with the allocated physical slots 701a-701c.

[0111] When performing the procedure involved in PUSCH in Rel-16, the UE can use Figure 7 the virtual allocations 702a-702c that correspond to the three consecutive UL slots 701a-701c, respectively. Therefore, a mapping 703 exists between the virtual resources 702a-702c and the physical resources 701a-701c, as shown in Figure 7 .

[0112] Determination of TBS and maximum data rate

[0113] In Rel-16, the TBS of a transport block can be determined using the following equation (1),

[0114] N info = v * Q * r * N RE (1)

[0115] where v is the number of layers used for physical shared channel transmission, Q and r are the modulation order and coding rate specified by the modulation and coding scheme (MCS) index, respectively, and N RE is the total number of available resources in the scheduled slot. The TBS is approximately equal to N info where the difference in size between TBS and N info is related to the addition of a cyclic redundancy code (CRC), code block segmentation, and the finiteness of allowed TBS values in the specification.

[0116] For PUSCH (TS 38.214 Section 6.1.4.2):

[0117]

[0118] For PDSCH (TS 38.214 Section 5.1.3.2):

[0119]

[0120]

[0121] The New Radio (NR) standard specifies a maximum data rate that can be reached given certain UE capabilities. The following text from the 38.306 specification specifies the procedure to calculate the maximum data rate.

[0122]

[0123]

[0124] The following example rate matching and interleaving procedures applied to PUSCH are described in 3GPP TS 38.212.

[0125]

[0126]

[0127]

[0128] For slot aggregation, Rel-16 follows Table 6.1.2.1-2 to determine the redundancy version (RV) index for the registration management (RM) output of each slot.

[0129]

[0130]

[0131] TDD configuration

[0132] In Rel-16, the network can provide to the UE a set of configurations (semi-statically, e.g., radio resource control (RRC) or dynamically, both) indicating specific configurations of UL slots and resources, the configurations indicating the possible transmission direction on these slots and resources. The configuration of resources can be referred to as a TDD configuration.

[0133] In a TDD configuration, each OFDM symbol (OS) in the UL frame structure can have one of three possible indications: uplink (UL), downlink (DL), or flexible (F). If an OS has an indication of UL or DL, the possible transmission direction on that symbol can be only UL or DL, respectively, while an indication of F provides for transmission in both directions on the OS, while the actual transmission depends on other factors, such as the type of scheduling of the transmission.

[0134] The TDD configuration can be set in a semi-static manner. That is, the UE can be provided an RRC configuration that indicates a certain slot structure that repeats with a configured periodicity. The slot structure can span one or more slots and can provide a configuration of UL / DL / F indication for the OSs in those slots. The semi-static TDD configuration can be a common configuration for all UEs in a cell or a dedicated configuration for each UE. When both a common and a dedicated TDD configuration exist, the role of the dedicated configuration can be to override the indication for the OSs indicated as F in the common configuration only. In such a case, the overall indication for the OSs of a UE would be specified as follows. If the common TDD configuration provides an UL indication, or the common TDD configuration provides an F indication and the dedicated TDD configuration provides an UL indication, UL is indicated. If the common TDD configuration provides a DL indication, or the common TDD configuration provides an F indication and the dedicated TDD configuration provides a DL indication, DL is indicated. If both the common and dedicated TDD configurations provide an F indication, F is indicated.

[0135] The UE can also be provided a dynamic TDD configuration. The dynamic TDD configuration can be referred to as a slot format indication (SFI). Providing a dynamic TDD configuration can be performed by first configuring the UE with an indication that the UE should monitor for a DCI format 2 0 carrying an SFI field. The SFI field indicates one UL / DL / F configuration for one or more slots. The UL / DL / F configuration is intended to override the OS indication in those slots that are semi-statically indicated as F. Thus, if the UE is configured to monitor for an SFI, the overall indication for the OSs of a UE would be specified as follows. If semi-statically indicated as UL or F and the dynamic TDD configuration provides an UL indication, UL is indicated. If semi-statically indicated as DL or F and the dynamic TDD configuration provides a DL indication, DL is indicated. If both the semi-static and dynamic TDD configurations are indicated as F, F is indicated.

[0136] The actual transmission in the OS can depend on the transmitted signal (e.g., PDSCH, PUSCH, PDCCH, PUCCH, RS, etc.) and the scheduling type (e.g., dynamic scheduling, configured grant Type 1 or Type 2, semi-persistent scheduling, scheduling with repetition Type A or Type B). For PUSCH transmission, the PUSCH UL transmission can be cancelled due to a conflict with the TDD configuration of the OS allocated to the PUSCH.

[0137] Cancellation indication

[0138] For cancellation indication in Rel-16, the network can provide a dynamic indication to the UE to cancel / suppress UL transmission in certain resources. The network can choose to perform cancellation of UL transmission of some UEs to release the corresponding resources for other transmissions (e.g., data transmission with low latency requirement). The UE can receive the cancellation indication via DCI format 2_4, which contains an indication of time / frequency resources in which the UE should cancel / avoid UL transmission.

[0139] UL transmission overlap

[0140] Regarding the overlap of UL transmissions in Rel-16, the UE can encounter a situation in which multiple UL signals can be scheduled in resources that can overlap in time and / or frequency. In such a situation, the UE can have to handle such a situation by transmitting all signals simultaneously, multiplexing the information of one UL transmission onto the other UL transmission, and / or cancelling the transmission of one or more UL transmissions.

[0141] The behavior of the UE depends on the type of UL transmission. That is, the UE can be scheduled with different types of PUSCH (dynamic grant or configured grant transmission). In addition, the UE can be scheduled with PUSCH or PUCCH transmission, which can be associated with a priority index. When such signals overlap in time, the priority index can allow the UE to determine the appropriate behavior. For example, if the UE has PUCCH and / or PUSCH overlap in time, and if the overlapping signals have the same priority index, it can be appropriate to multiplex the information of one or more PUCCH onto the other PUCCH or other PUSCH in the overlapping signal set. Or, if the UE has PUCCH and / or PUSCH overlap in time, and if the overlapping signals have different priority indices, the UE can have to cancel some UL signals with lower priority index and continue transmitting the UL signals with higher priority index.

[0142] Thus, in some cases, the UE can have to cancel a PUSCH transmission if it collides in time with other UL signals that can have a higher priority index than the PUSCH, for example. The UE can also cancel a CG-PUSCH transmission if the transmission overlaps in time with a DG-PUSCH with the same HARQ process ID.

[0143] Overlap between dynamically scheduled DL signals and higher layer scheduled UL signals

[0144] In Rel-16, a UE can be scheduled to transmit UL signals either dynamically (e.g., through a scheduling DCI received from a gNB) or via higher layers (e.g., through configured grant Type 1 or 2). Within unpaired spectrum, a case can subsequently occur when a UE can be indicated by higher layers to transmit a PUSCH and subsequently receive a dynamic scheduling of a DL signal, such as a PDSCH or a CSI-RS. In Rel-16, the UE drops the UL transmission based on a specific timeline that allows the UE to process the DL reception request. The following text in the specification describes such operation. Thus, a dynamically scheduled PDSCH and / or CSI-RS can be a cancellation source for some UL PUSCH.

[0145]

[0146] In Rel-16, a UE can be scheduled to receive DL signals either dynamically (e.g., through a scheduling DCI received from a gNB) or via higher layers (e.g., through semi-persistent scheduling). Within unpaired spectrum, a case can subsequently occur when a UE can be indicated by higher layers to receive a PDSCH and subsequently receive a dynamic scheduling of an UL signal, such as a PUSCH, PUCCH, SRS-RS, or PRACH. Rel-16 indicates the UE to continue the UL transmission and cancel the DL reception request in such a case. The following text in the specification describes this operation. Thus, a dynamically scheduled UL signal can be a cancellation source for some DL-PDSCH.

[0147]

[0148] UCI multiplexing on PUSCH

[0149] Figure 8 A UE multiplexing uplink control information (UCI) on PUSCH is depicted when scheduled resources overlap, which is allowed in Rel-16. As shown in Figure 8 , UCI carrying DL HARQ feedback can be scheduled in overlapping resources using PUSCH and multiplexed on PUSCH, e.g., at 801. When PUCCH and PUSCH are multiplexed, Rel-16 specifies timeline 1 and timeline 2 limits between different signals. Timeline 2 represents the minimum time between all scheduled PDSCHs multiplexed with HARQ feedback, and the resources of the multiplexed signals. The following is from TS 38.213.

[0150]

[0151]

[0152] Figure 8Timeline 2 in Figure 2 can account for the decoding time needed to decode the PDSCH and determine the HARQ feedback value to multiplex. Figure 8 Timeline 1 in Figure 1 is the minimum duration between all DCIs scheduling multiplexed PUCCH and / or PUSCH signals and the scheduled resources themselves. The following is from TS 38.214.

[0153]

[0154]

[0155] Figure 8 Timeline 1 in Figure 1 accounts for the duration used to prepare the PUSCH signal and can be specified between each DCI of any signals involved in the first symbol of the overlapping resources and the scheduling multiplexing case. This can ensure that the UE is aware of the multiplexed signal early enough to prepare the corresponding PUSCH. It should be noted that the UE can technically continue to prepare the PUSCH by determining the TBS based on the allocated PUSCH resources, building the code blocks, and performing the encoding (as shown in Figure 3) without knowing that the effect of the multiplexing has not occurred. However, determining the RM output should not be performed until knowing the effect of the multiplexing. Therefore, it can be considered that timeline 2 is intended to allow enough time to process the RM output rather than the entire PUSCH preparation time. Figure 6

[0156] When handling UCI multiplexing with scheduled PUSCH with repetition, there seems to be no difference between the different PUSCHs in the repetition; that is, considering the actual PUSCH is affected by the multiplexing, Figure 8 Timeline 1 and 2 in Figure 1 and 2 remain unchanged.

[0157] UE capability

[0158] Another aspect of Rel-16 NR is the ability to perform Carrier Aggregation (CA). In CA, the UE is able to transmit using multiple component carriers (CCs), allowing the UE to utilize a larger bandwidth than possible using a single component carrier. Rel-16 NR allows multiple carrier aggregation modes, which include intra-band frequency aggregation with contiguous component carriers, intra-band frequency aggregation with non-contiguous component carriers; and inter-band frequency aggregation with non-contiguous component carriers.

[0159] ​The categorization of CA modes can depend on the set of frequency bands that contain the component carriers used. The set of frequency bands can be referred to as a band combination. In NR, carrier aggregation is applied across cells. A UE initially connects to one cell in CA, which is referred to as the primary cell (PCell). Then, the UE discovers and connects to multiple other cells in CA, which are referred to as secondary cells (SCells). The UE in CA is able to use each cell to transmit and receive different combinations of signals. For example, a UE can transmit / receive a PUSCH on one cell and a sounding reference signal (SRS) signal on another cell.

[0160] However, the standard specifies certain timeline rules and conditions for transmitting / receiving signals simultaneously in CA. Even with the timeline rules and requirements, the standard does not require every UE connected in NR to be able to perform such simultaneous use of component carriers in CA. In fact, a UE can have the capability to perform certain transmit / receive tasks in CA, but not the capability to perform other tasks.

[0161] Another factor that affects UE capability is whether the assumption is frequency division duplex (FDD) or time division duplex (TDD). A UE can or can not perform a task on an FDD band / band combination, while the UE can or can not perform the same task on a TDD band / band combination. To take full advantage of the UE’s capabilities and better optimize the use of the network, when a gNB schedules the transmission / reception of a UE in the network, the UE’s capabilities can be informed to the gNB, and then these capabilities are taken into account.

[0162] UE capability refers to the mechanism by which a UE informs a gNB of its capability to perform certain transmit / receive tasks. One UE capability reported to a gNB informs the gNB of the UE’s capability to perform a particular task. The UE capability mechanism provides the UE with flexibility to report its capabilities in different transmission scenarios.

[0163] A UE can report its capability to perform a certain task in any scenario, in which case the UE reports its capability on a per-UE basis. A UE can report its capability to perform a certain task in a certain frequency band, in which case the UE reports its capability on a per-frequency band basis. A UE can report its capability to perform a certain task in a certain frequency band combination in CA, in which case the UE reports its capability on a per-frequency band combination or per-BC basis. A UE can report its capability to perform a certain task in CA in a certain scenario, i.e., not necessarily always for a given frequency band combination. In such a case, a mechanism known as feature set can be used to allow such flexibility in reporting, in which case the UE reports its capability on a per-feature set or per-FS basis. Other methods of reporting UE capability are possible.

[0164] A UE capability can inform the gNB that the UE is capable / incapable of transmitting a certain UL signal in a certain frequency band. The UE capability mechanism has the flexibility to indicate that a UE is capable of performing a certain task in a certain scenario and that the UE is not capable of performing the same task in other scenarios. For example, a certain UE capability can be signaled to the gNB on a per-frequency band basis, i.e., a UE can have different capabilities for different frequency bands for a given task. Some UE capabilities can be generic functions across frequency bands / frequency band combinations, i.e., these capabilities can be on a per-UE basis. In the case of CA, a UE capability can be signaled on a per-frequency band combination basis. With respect to CA, the capability of a UE to perform certain tasks can depend on the combination of frequency bands involved in the CA. For example, a UE can perform simultaneous transmission of two UL signals when the frequency band combination in the CA is intra-band, but the UE can not be able to perform the transmission in the case of inter-band CA.

[0165] In Release-15 NR, simultaneous transmission of UL signals in CA is not always allowed. In fact, the allowance of simultaneous transmission of UL signals in CA can be governed by the UE capability for the particular frequency band combination used in the CA.

[0166] The following specific rules apply for Rel-15. In case of intra-band carrier aggregation or inter-band CA band-band combinations where simultaneous SRS and PUCCH / PUSCH transmission is not allowed, the UE is not expected to be configured with SRS from a carrier and PUSCH / UL DM-RS / UL PT-RS / PUCCH format from a different carrier in the same symbol. In case of intra-band CA or inter-band CA band combinations where simultaneous SRS and PRACH transmission is not allowed, the UE shall not transmit SRS resource from a carrier and PRACH from a different carrier simultaneously. In case of inter-band carrier aggregation, the UE can transmit SRS and PUCCH / PUSCH simultaneously across component carriers in different bands according to the UE’s capability. In case of inter-band carrier aggregation, the UE can transmit PRACH and SRS simultaneously across component carriers in different bands according to the UE’s capability.

[0167] Table 1 provides a list of UE capabilities in Rel-15 as parameters related to simultaneous transmission of UL signals in CA.

[0168] Table 1

[0169]

[0170]

[0171]

[0172]

[0173]

[0174]

[0175]

[0176]

[0177]

[0178]

[0179]

[0180]

[0181]

[0182]

[0183]

[0184]

[0185]

[0186]

[0187] Mapping Across Slots (MAS)

[0188] The subject matter of the present disclosure provides a mapping across slots (MAS) processing technique for a transport block that can be used by a transmitter (UE or gNB) in a wireless network, such as a 5G wireless network. The MAS processing spans resources across K slots, maps a TB of size B, and the transmitter continuously transmits a transmission that crosses K-1 slot boundaries that carries the TB of size B. In one embodiment, the TBS determination for the MAS processing sets an encoding rate equal to r, the available resources correspond to K slots, and the resulting TBS is B. The MAS processing can be performed by a TB processing chain that is similar to the processing chain depicted in Figure 6 but modified as described herein in Figures 9-40 relation to the MAS processing. The TB processing chain that provides the MAS processing for a transport block can include circuitry and / or modules that perform functions associated with the MAS processing. That is, functions associated with TBS determination, TB selection and CB determination, encoding, rate matching, interleaving, and mapping from virtual resources to physical resources can be performed by one or more circuits and / or one or more modules.

[0189] Figure 9 Some details of a codeword that can be transmitted across K slots according to a size of a data block B are shown in accordance with the subject matter disclosed herein. If the number of code blocks P, for each of Q code block groups (CBGs), the number of code blocks belonging to a CBG is P / Q. The condition that the code blocks do not cross slot boundaries is that K divides P (K divides P). For the MAS processing as disclosed herein, if the number of information bits is B and the target rate is r, the total number of encoded bits is B / r, which can be allocated across REs of K slots. The size of a code block and the number of code blocks are B / P and P, respectively. The number of encoded bits per code block is B / (r*P). When the code blocks cross slot boundaries, the MAS technique can provide greater opportunities for the code blocks that cross the slot boundaries to maintain sudden degradations in channel quality in certain slots.

[0190] Figure 10An example case 1000 is shown in which a data block B that is sufficiently small to fit into a single code block CB1 across a slot boundary, in accordance with the subject matter disclosed herein. Using a multi-slot TBS (M-TBS) determination procedure, the code block CB1 can be mapped across slots into a single transport block 1001, such that in Figure 10 In the example, one code block 1001 spans two consecutive slots (e.g., slots 1002 and 1003). Rate matching can be used to allow the code block CB1 to exist on both slots 1002 and 1003 (e.g., crossing the slot boundary 1004).

[0191] Figure 11 An example case 1100 is depicted in which a data block B that is relatively large to fit into two code blocks CB1 and CB2, in accordance with the subject matter disclosed herein. That is, two code blocks CB1 and CB2 are mapped into a single transport block 1101 that spans two consecutive slots (e.g., slots 1102 and 1103). The transport block 1101 crosses the slot boundary 1104 between slots 1102 and 1103.

[0192] Figure 12 An example case 1200 is shown in which a data block B that is relatively very large to fit into many code blocks CB1-CB P P code blocks CB1-CB P are mapped into a single transport block 1201 that spans (in this example) three consecutive slots 1202-1204. The transport block 1201 crosses the slot boundaries 1205 and 1206.

[0193] Figure 13 An example case 1300 is depicted in which P does not divide K, in accordance with the subject matter disclosed herein. In this example, the MAS selects code blocks CB1-CB4 that are mapped across three consecutive slots 1302-1304 into a single transport block 1301. The MAS allows for the use of a longer RM output in order to transmit all of the data bits of the code blocks CB1-CB4 in one transport block. When CBGs are enabled, retransmissions by the MAS involve retransmission of CBGs that failed in the transmission. Figure 13

[0194] TB mapping across non-consecutive resources

[0195] Resource allocation for MAS-PUSCH transmissions can include resources that are non-consecutive in time. Figure 14 An example of a scenario 1400 in which resources available for MAS PUSCH transmissions are non-consecutive is depicted. The scenario 1400 depicts two slots 1401 and 1402, each of which includes 14 symbols. Non-consecutive resources that have been allocated to the MAS PUSCH at 1403 are indicated. ​

[0196] Non-contiguous resource allocation can be, for example, a result of PDSCH / PUSCH retransmission Type-B resource allocation mechanism, where some intermediate resources are not available based on a collision with a TDD symbol configuration. In such non-contiguous resource allocation cases, the UE can utilize the set of resources available for Type-B repetition to transmit one MAS transmission that spans all available resources, for example, as shown by resources 1404. Based on the capability of the MAS PUSCH transmission, the allocation of non-contiguous resources can be a specific resource allocation technique for MAS transmission that allows such non-contiguous resource allocation to be configured.

[0197] If the allocated resources are a result of repetition Type-B scheduling, the determination of the transport block can be the same as the original transmission. Alternatively, if the allocated resources are indicated to the UE as resources for the original transmission, the transport block can be determined based on the allocated resources. The transport block determination can follow the Rel-16 TBS determination technique, or a multi-slot TBS (M-TBS) determination technique. The encoding and code block segmentation can follow the Rel-16 procedure. The rate matching can be provided by the techniques described below.

[0198] Embodiment 1

[0199] A first example embodiment disclosed herein provides Multi-slot TBS Mapping- With-Repetition (M-MWR). M-MWR includes the possibility of scheduling higher TBS values that are not achievable using the typical MWR or Rel-16 based TBS determination procedures. The TBS value determined by M-MWR is mapped to the allocated resources of one slot, such that the coding rate of each slot is higher than the coding rate indicated via the typical configured MCS index.

[0200] A TBS determination using the typical MWR procedure sets the coding rate to r*K, the available resources correspond to a single slot, and the resulting TBS is B. In contrast, the TBS determination of M-MWR calculates the sum of intermediate TBS values, where each intermediate TBS value corresponds to a TBS determined for each of the K slots, by setting the coding rate of a slot to equal r and the available resources to the available resources in a slot.

[0201] Embodiment 2

[0202] The MAS can be configured such that the MAS mapping of the transport block avoids crossing the slot boundary. One condition to not let a code block cross the slot boundary is to ensure that the rate-matched output of each code block fits into the resources of one slot. This case can be represented as follows. Let be the number of coded bits available in slot i. Let and Then, the condition of not having a code block crossing a slot boundary can be equal to the following. For each code block j = 1,..., P, there exists k such that

[0203]

[0204] and

[0205]

[0206] In such a case, the value of k can correspond to the slot containing the code block, and the condition ensures that the code block number j is fully present in the slot k. The gNB can ensure that these conditions are met when scheduling / configuring MAS based transmissions.

[0207] Embodiment 3

[0208] Figure 15 Three locations in a MAS transport block processing chain 1500 are depicted in which the processing of a cancellation indication (CI) can be performed, in accordance with the subject matter disclosed herein. Figure 15 The MAS transport block processing chain depicted in Figure 3 may be part of the TX processing circuitry 303 in an example embodiment of the UE 116 depicted in Figure 15 The operation of the MAS TB processing chain depicted in Figure 15 may be controlled by the processor 307 of the UE 116.

[0209] The operation 1500 of the MAS transport block processing chain can include a TBS determination operation 1501, a code block segmentation operation 1502, a channel coding operation 1503, a rate matching operation 1504, and a puncturing operation 1505. In one embodiment, the channel coding operation 1503 can be performed by the encoder 503, the rate matching operation 1504 can be performed by the rate matcher 504 in the transmitter structure 501 shown. Figure 5A One or more of the operations 1501-1505 can be performed by circuitry and / or modules.

[0210] Figure 16A An example scenario 1600a is depicted in which a cancellation indication in one slot of a UL MAS transmission is received by a UE, in accordance with the subject matter disclosed herein. In Figure 16A In the example shown, six slots 1601-1606 have been allocated for the MAS based transmission. Code blocks CB1-CB 13 have been mapped to the slots 1601-1606. A CI 1607 indicating a cancellation of the transmission in slot 1604 has been received.

[0211] The cancellation indication can be processed at various sources. In the case of UL transmission (e.g., MAS PUSCH), examples of cancellation sources include, but are not limited to, reception by the UE of DCI format 2_0 carrying SFI values of slot format indicating collision with UL transmission; collision with semi-static DL / UL slot format; reception by the UE of DCI format 2_4 carrying CI request explicitly indicating cancellation of UL transmission in the specified slot; collision in time with other UL signals having different priority index than PUSCH; collision between CG-PUSCH and DG-PUSCH of the same HARQ process; and collision between dynamically scheduled PDSCH and / or CSI-RS and CG-PUSCH. While there can be different cancellation mechanisms for DL transmission (e.g., MAS-PDSCH), the main mechanism for handling cancellation can be the same as for UL transmission.

[0212] Returning to Figure 15 , the first location 1510 at which the cancellation indication can be processed is at the rate matching operation 1504 by changing the output of the rate matching operation 1504. The remaining resources after applying the cancellation indication at the slot level can be determined first. For example, some entire slots can be cancelled based on the cancellation indication. For the set of code blocks that have been determined, the output of the rate matching can be changed based on the remaining resources. In the context of the present example, 13 code blocks are redistributed over the remaining resources of the MAS transmission.

[0213] The second location 1511 at which the cancellation indication can be processed is at the output of the rate matching operation 1504 by performing puncturing on the output of the rate matching operation 1504. This approach can maintain the original code blocks that have been determined based on the scheduled MAS transmission, and the transmission of some or all of the code blocks. There are four variants of the approach using the second location 1511.

[0214] As shown in Figure 16B , the first variant of processing the CI by performing puncturing involves the cancellation of all CB transmissions within the slot of the cancellation indication. If a portion of the encoded sequence corresponds to a cancelled CB that extends into an adjacent slot, the portion of the CB that extends into the adjacent slot is transmitted. As shown in the example scenario 1600b in Figure 16B , the portion of CB7 in slot 1603 and the portion of CB9 in slot 1605 are transmitted.

[0215] The second variant of processing the CI by performing puncturing involves the cancellation of CB transmissions within the indicated slot. That is, if a portion of the encoded sequence corresponds to a cancelled CB that extends into an adjacent slot, they are also cancelled. As shown in the example scenario 1600b in Figure 16CAs shown in the example scenario 1600c in FIG. 16, the portion of CB7 in slot 1603 and the portion of CB9 in slot 1605 are cancelled.

[0216] A third variant of handling CI by performing puncturing involves cancelling all CB transmissions within the indicated slot, and if a portion of the coded sequence corresponds to cancelled CBs extending into adjacent slots, all transmissions in these adjacent slots are also cancelled. The cancellation continues to adjacent cells until there are no CBs with extending portions that are cancelled. As shown in the example scenario 1600d in FIG. 16, all transmissions in slot 1602 are cancelled up to slot 1605. Figure 16D

[0217] A fourth variant of handling CI by performing puncturing as depicted in the example scenario 1600e in FIG. 16 involves cancelling all slots within the MAS-PUSCH transmission. Figure 16E

[0218] For the four variants of handling CI by performing puncturing as depicted in the example scenario 1600e in FIG. 16, the indication of cancelling transmissions in a slot should be received sufficiently in advance of the slot being cancelled so that the transmitter (at the UE) has sufficient time to perform the appropriate cancellation. Notably, such an approach can provide robust handling of the cancellation indication. For example, in the case that the transmitter (e.g., UE in the case of MAS PUSCH) misses the cancellation indication, the receiver (e.g., gNB) can make a decision to ignore the CBs in the cancelled slot of transmission without affecting the transmission of the remaining CBs in other resources. Figures 16B-16E

[0219] A third location 1512 at which the cancellation indication can be handled is at the TBS determination operation 1501 and the code block segmentation operation 1502 by changing the TBS determination and / or the CB segmentation output. The UE can not necessarily follow the previously determined CBs and can perform a different physical shared channel transmission in the available resources after the cancellation. In such a case, after applying the cancellation indication at the slot level, the remaining resources are first determined, i.e., some entire slots are cancelled based on the cancellation indication. Thus, the cancelled slots within the set of allocated slots for the MAS transmission will result in two separate groups of consecutive slots, and the transmitter can treat the two separate groups of slots as resources available for physical shared channel transmission. For example, in the example scenario 1600a depicted in FIG. 16, the cancellation of slot 1604 results in slots 1601, 1602, and 1603 to be one group of available slots, and slots 1605 and 1606 to be another group of available slots. The transmitter can then use these resources for physical shared channel transmission. Figure 16A

[0220] ​​​​For the physical shared channel transmissions in the contiguous set of resources remaining after the cancellation indication, several options can be provided. A first option is that the transmitter can transmit Rel-16 transmissions in each slot. In such a case, the transmissions can all be repetitions of the originally intended TB for the MAS transmission. If the TBS of the original MAS transmission is larger than the maximum allowed TBS threshold for a single Rel-16 transmission, the transmission of that TB can be cancelled. Furthermore, repeating the transmission of the original TB in the set of Rel-16 physical shared channel transmissions can not be successful unless the condition on achievable coding rate is met.

[0221] Alternatively, for the first option of the contiguous set of resources remaining after the cancellation indication, the TB transmitted in the remaining slots can be determined separately for each slot. The parameters used to determine the TB, such as the MCS index and the coding rate, can be set to the values provided for the original MAS transmission. As a further alternative to the first option, the coding rate used for each physical shared channel transmission can be set to the effective coding rate that would have been achieved for each slot in case the original MAS transmission was performed.

[0222] For the second option of the contiguous set of resources remaining after the cancellation indication, the transmitter can transmit MAS transmissions in the set of available contiguous slots. For example, in the example given above, the transmitter can transmit two MAS transmissions, one spanning slots 1601-1603 and one spanning slots 1605-1606. For the first option of the contiguous set of resources remaining after the cancellation indication, a similar handling of the TB determination is as follows. If the TBS is larger than the maximum allowed TBS threshold, the TB can be set to the originally determined TB and the MAS transmission is cancelled. As described elsewhere herein, the determination of the amount of resources used for each MAS transmission can also depend on the limitation on achievable coding rate. As an alternative to the second option, a new TB can be determined for each new MAS transmission.

[0223] For the third option of the contiguous set of resources remaining after the cancellation indication, the transmitter can determine the type of physical shared channel to be transmitted in the available resources (regular or MAS). That is, the transmitter can decide to perform regular transmissions in some slots and MAS transmissions across some other slots. The decision to do so can be based on the target TB and select the minimum amount of resources matching the TBS for a given coding rate, for example.

[0224] Embodiment 3a

[0225] The decision to perform PUSCH transmission in response to the cancellation indication can be configured in different ways, e.g., RRC configuration or dynamic indication. If the cancellation is RRC configured, all MAS PUSCH transmissions can be configured to be handled in case of cancellation according to one specific method. Alternatively, different kinds of MAS-PUSCH transmissions (e.g., dynamically scheduled MAS-PUSCH transmissions, CG-based MAS-PUSCH, etc.) can be handled in different ways (e.g., dynamically scheduled MAS-PUSCH transmissions, CG-based MAS-PUSCH, etc.). For dynamically scheduled MAS PUSCH or CG2-based MAS PUSCH, the way to handle the cancellation can be indicated in the scheduling / active PDCCH.

[0226] Limitations related to scheduling MAS PUSCH after cancellation indication

[0227] There can be limitations on the determination of the scheduling of MAS transmissions in response to the cancellation indication. Two cases can be distinguished. The first case is that there is a TBS threshold on the scheduled MAS transmission. The second case is that there is a limitation on the achievable overall coding rate when scheduling a MAS transmission with the original TBS after receiving the cancellation indication.

[0228] TBS threshold on scheduling MAS PUSCH

[0229] The TBS determination for a MAS transmission can include resources from multiple slots, and thus the resulting TBS can be very large (e.g., due to implementation issues). Therefore, the final TBS that can be used in the MAS transmission can be upper-bounded by a value TH TBS . Consider the TBS determination procedure, the result of which is a value that can be denoted as TBS', which is an intermediate value obtained from the procedure that determines the TBS. Then, the final TBS value can be given as the minimum between the intermediate value TBS' and the threshold value as

[0230] TBS = min(TH TBS , TBS') (4)

[0231] The value of the threshold can be, for example, a multiplicative factor of the maximum TBS value obtained from the Rel-16 TBS determination procedure. It can be calculated that the maximum TBS value obtained from the Rel-16 TBS determination procedure is equal to M = 1,277,992 (corresponding to the maximum resource allocation for PUSCH, and four (4) transmission layers and the highest available coding rate). Thus, for some suitable value C, TH TBS may be equal to C · M.

[0232] Limitation on achievable overall coding rate

[0233] Upon receiving the cancellation indication for some slots, the transmitter can refrain from transmitting the original MAS transmission and can select to transmit a set of physical shared channel transmissions in the remaining resources, where each transmission conveys a TB determined based on the resources of the original MAS transmission. The newly determined transmissions can be Rel-16 transmissions (i.e., one physical shared channel transmission per slot) or MAS transmissions (i.e., each transmission can span more than one slot and the number of slots in each such transmission can be determined).

[0234] Due to the natural reduction in the amount of resources available after the cancellation, the achievable coding rate of each transmission of the newly determined physical shared channel transmissions can be greater than the original achievable coding rate. More specifically, if the number of available coded bits per transmission is less than the TBS, the achievable coding rate of each physical shared channel can be greater than 1. In such a case, one transmission can not be able to convey the TBS.

[0235] When such a case occurs, the receiver can decode the TB depending on the set of transmissions (and not just one physical shared channel transmission). However, the success of the decoding operation of the TB can also depend on the RV indices used for these transmissions.

[0236] To make this point clear, consider the case where the TBS of the original TB is equal to B. After the slot cancellation, assume that the number of available coded bits in all resources is equal to C, where B / C = 1. In such a case, if the newly determined set of transmissions includes two physical shared channel transmissions, where each transmission includes half of the resources, the coding rate of each transmission is equal to 2. Two cases can be distinguished.

[0237] In the first case, if the RV indices of the two transmissions are the same, the overall coding rate of the two transmissions remains unchanged, and thus, the decoding attempt of the TB based on the two transmissions can fail. In the second case, if the RV indices of the two transmissions are different, the overall coding rate can be less than or equal to 1, and thus, the decoding attempt of the TB based on the two transmissions can have a chance of success.

[0238] These two cases highlight the importance of determining the coding rate of each slot in relation to the designated RV index of the newly determined transmissions, which will be formalized next. However, first assume that the newly determined transmissions inherit some configuration properties from the original MAS transmission configuration (such as the modulation order, the DMRS configuration, the number of transmission layers, the overhead, etc.).

[0239] Let the set of new physical shared channel transmissions be indicated by a set of indices P, where the first transmission corresponds to index 1 e P, the second transmission corresponds to index 2 e P, and so on. When determining the set of new transmissions, the transmitter can be configured to use a fixed RV version for all new transmissions, or the transmitter can be configured with a sequence of RV indices, where each transmission uses one index from the sequence in turn. Let the set of unique RV indices used by the transmissions be denoted by V. For each v e V, let be the index of the transmission in the set of new transmissions using RV index v. Let C p denote the amount of coded bits available for transmission at index p.

[0240] For successful decoding, the overall coding rate of the TB should be less than or equal to 1. This can be translated into the following condition:

[0241]

[0242] or

[0243]

[0244] This condition translates to the sum of unique coded bits in all transmissions being greater than B. Depending on the type of transmissions being scheduled, this condition can be further simplified. For example, in the first case, when the newly determined transmissions are MAS (multi-slot based) transmissions, the amount of available coded bits for each transmission can depend on the number of slots that the MAS transmissions are scheduled to use. In such a case, the number of slots included in each transmission can be chosen such that the above condition is satisfied.

[0245] In the second case, when the newly determined PUSCH is a Rel-16 (one-slot based) PUSCH transmission, all transmissions include a fixed number of resource elements, and hence, each transmission can have a fixed number of available coded bits. Let this number be denoted by C Rel-16 In such a case, the condition simplifies to

[0246] |V| · C Rel-16 ≥ B (7)

[0247] Embodiment 4

[0248] In one embodiment, MAS can be allowed to further segment the RM output sequence across the slot boundary around which the boundary is crossed. For example, Figure 17A depicts an example of a MAS transmission of two CBs, CBG1 and CBG2, across three slots 1701-1703. The segmentation can result in the RM output sequence corresponding to the CBs being split into multiple parts, as Figure 17BThe segmented portions can be considered as completely independent transmissions (i.e., the receiver can use them separately when decoding the CBs), or the segmented portions can be jointly used for decoding in a similar RV manner.

[0249] Given the resultant segmentation of the related CBs, the RV version of each transmission portion can be determined. According to the subject matter disclosed herein, the RV version of each portion can be determined as using the same RV index of the original CB. Alternatively, a sequence of RV indexes can be specified, and the RV index of a consecutive CB portion is determined based on the specified sequence of RV indexes. For example, a sequence of RV indexes can be configured, such as 0, 2, 1, 3. Then, the RV index of each portion of the CB is iterated on this sequence in order (and cyclically) starting from the RV index of the original CB. In Figure 17B , it is considered that the RV index of the original CB2RV1 is 0. Then, the first portion of the CB can have an RV index equal to 0, while the second portion of the CB can have an RV index equal to 2.

[0250] Implementing the segmentation can take different approaches. Referring to the TB processing chain 1800 in Figure 18 , one approach for segmenting a code block can be as follows. The TBS determination operation 1801 computes the TBS based on the resources of all K slots. The CB segmentation operation 1802 receives the TBS as input and provides the CBs specified in Rel-16 (using the same K cb ) as output. The encoding operation 1803 encodes the CBs into codewords specified in Rel-16, followed by the rate matching operation 1804.

[0251] Operations 1801-1804 can be performed by one or more circuits and / or modules. The RM operation 1804 can be changed according to the subject matter disclosed herein as follows. Initially, the RM operation 1804 can be provided with the set of K slots in which the coded bits are to be allocated, and the number of coded bits available for each slot, denoted as for the i-th slot. The total number of available coded bits is and the ratio for each CB can be determined as G / P = G' according to G. For each CB, a pointer is reserved, to which specific bits are allocated during the RM process. For j = 1,..., P, the pointer can be called s j . All pointers are initialized to the bits corresponding to the RV index. L j denotes the length of the encoder output as the j-th CB (which should be the same). The index i is set equal to 1 and the index j is set equal to 1. The next bit to be allocated in the i-th slot is denoted as b i , which is set to 1.

[0252] While i < (cyclic over slots) and j < P (cyclic over CBs): bit number s j is assigned from the encoder output of the jth CB to the bit number b from the ith slot i The pointer sj is set to s j = ((s j - 1) mod L j ) + 1. If then set i = i + 1, set b i = 1, and set s j to the RV index of the designated index for the portion of CB number j in slot i + 1. Otherwise, if set b i = b i + 1. If k = G', then j = j + 1 and k = 1. If k ≠ G', then set k = k + 1.

[0253] Alternatively, the RM operation can be changed as follows. The RM operation 1804 can be provided with a set of K slots in which to allocate coded bits, and the number of coded bits available per slot, labeled for the ith slot, i = 1,..., K. The total number of coded bits available is and the ratio per CB can be determined as G / P = G' according to G. For each CB, j = 1,..., P, if there exists k > 0 and n ≥ 0 such that

[0254]

[0255]

[0256] is the largest n satisfying the condition, the RM size of CBj is split into n + 2 values corresponding to slots k - 1, k,..., k + n as follows

[0257]

[0258] If n = 0, then CBj is split into 2 RM sizes as follows

[0259]

[0260] For multiple RM blocks for multiple slots, the RV index for each portion can be determined as described herein with respect to the segmentation of CBs across slots.

[0261] In one embodiment, a CB that crosses a slot boundary can change to be limited to only one of the slots it originally spanned. The slot in which the CB is limited can be the slot that originally contained the largest portion of the CB, or a slot based on some other rule for selecting which slot the CB is limited to. Determining the RM output for each CB in each slot follows the concepts disclosed herein.

[0262] When a portion of a segmented CB is only transmitted in an actual transmission, here referred to as a transmission portion, the determination of the RV index for the transmission portion can follow the RV determination disclosed herein. Figure 19A An example of MAS transmission of CBs across three slots 1901-1903 in two CB groups CBG1 and CBG2 is depicted. Figure 19B Segmentation and transmission of transmission portions of CB CB2RV1 and CB3RV1 are depicted, respectively.

[0263] Embodiment 5

[0264] The MAS process can also be used to handle retransmissions. For the case of retransmission, consider the case where CBGs are not configured. Then, a retransmission MAS transmission involves repetition of all CBs. The retransmission can be scheduled in the same slots (in number and available REs) as the original transmission. In such a case, the retransmission can be performed the same as the original transmission of K slots. Alternatively, the retransmission can be scheduled in a different set of slots with different number of available REs. In this embodiment, it can be up to the gNB to ensure the TBS determination, encoding and rate matching processes and the retransmission of the exact TB transmitted in the initial transmission. In the case that the gNB is interested in such a retransmission (e.g., to perform Chase Combining), it can also be up to the gNB to ensure that the resource allocation in the scheduled slots and the encoding process results in the same retransmission of the originally sent RV version of the CB.

[0265] In an alternative embodiment, the same TB used in the original transmission can be transmitted by the transmitter. In this alternative embodiment, certain resource allocations of the scheduled slots can be determined. Knowing the scheduled resources for the retransmission, the transmitter knows that the TB can be the same TB determined in the original transmission, so the transmitter does not determine a new TB according to the TBS determination process. Assuming the number of layers and modulation order are indicated to be the same as the original transmission, the transmitter can infer the effective coding rate according to the number of available resources and TBS. The transmitter can then proceed with the encoding and rate matching process to perform the retransmission. When determining the resource allocation for the retransmission, it can be up to the gNB to ensure that this process generates the necessary RV transmission of the original code word.

[0266] When a time-slot cancellation occurs on an original MAS transmission, retransmission of the MAS transmission can be as follows. If the transmission in the time-slot that indicates cancellation of the MAS transmission is indicated, various techniques for handling the transmission in the remaining resources can be used. The techniques can involve transmitting the original TB in one or more other regular and / or MAS transmissions, or transmitting a different and independent set of TBs in one or more other regular and / or MAS transmissions.

[0267] In the case of transmission of the original TB, the repetition request can naturally correspond to the TB transmission. The type of transmission (regular / MAS) and the resources used for retransmission can follow the procedures described above for transmission repetition.

[0268] In the case of transmission involving multiple different TBs, the repetition request should provide an indication of which TB is requested. This indication can be in the form of an additional indication in the scheduling request for repetition, or as a separate resource indicating the repetition request for each TB transmitted. Since the TBs are formed at the time of receiving the time-slot cancellation indication, the explicit configuration of feedback for each of these TBs can be indicated together with the time-slot cancellation indication. Implicit rules can be used to determine the resources for feedback for each of the transmitted TBs.

[0269] Embodiment 6

[0270] The resources for MAS transmissions can be dynamically configured. That is, the MAS transmission can be scheduled by a scheduling DCI conveyed in the PDCCH. The DCI can include the resource allocation and configuration for all K time-slots in the MAS. For a MAS allocation of K time-slots, the DCI information can include K sets of configuration parameters, each parameter containing the resource allocation and configuration for a time-slot. This can provide the maximum flexibility in scheduling at the cost of high signaling overhead. Alternatively, the system can restrict the MAS transmission to include only time-slots with the same resource allocation; in such a case, the DCI can include only the resource allocation and configuration corresponding to one time-slot, and one number K indicating the number of time-slots included in the MAS transmission. This can limit the signaling overhead at the cost of limited flexibility in scheduling.

[0271] To further limit the signaling overhead, the configuration for MAS transmissions can be RRC configured. For example, some information, such as the number of time-slots K for the MAS transmission and / or some resource allocation information (e.g., time, frequency, DMRS configuration, etc.) can be RRC configured, while other information can be dynamically conveyed via the scheduling DCI. Alternatively, all information can be RRC configured, with the DCI only carrying an indication of whether the DCI schedules a regular transmission or a MAS transmission.

[0272] For configured grant (CG) transmissions of both types, information about MAS transmissions can be configured similarly as described above. In such cases, the CG configuration can indicate the slot of the first slot in the MAS transmission, the remaining (K-1) slots follow the indicated slot. Or, the CG configuration can indicate the time location of different transmission occasions within the CG period. Figure 20 A CG period 2001 in an example CG configuration is depicted, which can include a set of regular transmission occasions and a set of MAS transmission occasions in accordance with the subject matter disclosed herein.

[0273] Multiple CG configurations can be configured to allow for multiple variants of CG configurations with and / or without MAS transmissions by the transmitter. For CG Type 2 (Semi-Persistent Scheduling), one CG configuration can be used to indicate both regular transmission occasions and MAS transmission occasions. For example, the CG configuration can provide an indication of a particular slot. An active PDCCH can have an additional indication that the CG is to be used for regular transmissions. Or, if the PDCCH indicates that the CG is to be used for MAS transmissions, the indicated slot can be considered to be the first slot in the MAS transmission occasion of the additional K-1 slots following each indicated slot.

[0274] Enhancements of Redundancy Version (RV)

[0275] One embodiment disclosed herein provides enhancements of RV-based transmissions to address the following issues. Consider a TBS size of B. The TB can generally be segmented into P CBs, where The size of each CB is C = B / P. Each CB is encoded into a codeword of size b B / P, where for an LDPC base Figure 1 , b = 3 and for an LDPC base Figure 2 , b = 5. The codeword is then provided as input to a rate matching block, which produces an allocated segment of codeword of length L.

[0276] When L is very small, as shown in Figure 21A , RV-based retransmissions can not optimally use the encoded bits. In such cases, it can be beneficial to incorporate more RV indices, as shown in Figure 21B . In contrast, if L is very large, it can be very beneficial to use only a few RV indices, as shown in Figure 22A and 22B . For example, consider L of length as shown in Figure 21A . Figure 22A An example RM output corresponding to Figure 21A is shown, but with L of length as shown in Figure 22A . Specifically, Figure 22AAn example case where L is approximately larger than the length of the entire code word (e.g., half of B*b / P) is shown. RV1 and RV3 will slightly overlap and will cover the entire code word completely, and RV2 and RV4 can be removed. Figure 22B An example RM output corresponding to Figure 22A where RV2 and RV4 are removed is shown.

[0277] Therefore, the following rule can be adopted to determine the optimal number of RV versions:

[0278] V is the smallest integer such that V*L ≥ C*b (12)

[0279] or

[0280]

[0281] where C is the size of the code block, which is equal to B / P.

[0282] The number of RV indices can be chosen freely according to equation (12) or (13). Note that if L changes across slots, one of the most suitable values of V can be chosen (e.g., the minimum value among all slots).

[0283] Another approach can be to select the value of V from a set of possible RV indices. The selection can be explicitly indicated by the gNB. Or, the selection can be the closest value in the set of values . The set of possible RV indices can be chosen to be a power of 2 to ensure that the RV boundary does not change with the dynamic selection of V.

[0284] TBS Limitation

[0285] The TBS for a TB scheduled for transmission by a TBoMS (also referred to as MAS herein) can result in a corresponding TBS based on the TBS determination rule. In this regard, the TBS value for a TBoMS can have an upper limit which is the maximum TBS value that can be achieved in legacy NR (Rel-16). Another upper limit X can be based on a corresponding maximum data rate. That is, the maximum data rate cannot exceed the corresponding maximum data rate in legacy NR (Rel-16). Yet another upper limit X can be based on a corresponding data rate where the achieved data rate for a TBoMS should not exceed the corresponding achieved data rate for a legacy PDSCH / PUSCH for the same configuration parameters. The configuration parameters can be the scheduling parameters for the TBoMS. Examples of such parameters include, but are not limited to, rank, BW, number of layers, and MCS, and can be based on the indicated UE capability.

[0286] The parameters indicated in the UE capability do not necessarily equal the configured parameters of the TBoMS. When using the parameters indicated in the UE capability, it should be noted that the UE capability can be indicated per frequency range, per CC, per frequency band, per frequency band combination, and / or per feature set. Limit values can be calculated per each case of the set of parameters provided. For example, a limit value can be calculated for each feature set containing parameters related to TBoMS. Alternatively, one or more limit values can be calculated by taking a representative value of each parameter across the corresponding values of the parameters for different combinations, such as feature sets.

[0287] Embodiment 1 of RM and interleaver operations

[0288] A first example embodiment of RM determination and interleaver operations includes a continuous RM determination and a continuous interleaver. The RM output for a CB can be determined for all slots, and the interleaver operation can be performed across all slots. In such a case, the interleaver size will be determined based on the entire CB RM output for all slots. Figure 23A and 23B Operation of a first example embodiment of RM and interleaver operations for a continuous RM determination and a continuous interleaver, respectively, in accordance with the subject matter disclosed herein is described. In Figure 23A and 23B In

[0289] In Figure 23A , the RM output for CB2 is known to span the slot boundary between slots 1 and 2. It can be assumed that the RM output for CB2 is a continuous RM output. This embodiment applies the interleaver operation over the entire RM output. Since the modulation order is 4, the interleaver operation for CB2 results in the coded bits being transmitted in both of the interleaved slots, as shown in Figure 23B .

[0290] Embodiment 1a of RM and interleaver operations

[0291] A first variation of the embodiment shown by Figure 23A and 23B may be to segment the RM output with new RVs for determining the RM output for each slot. As shown by Figure 24A and 24B in accordance with the subject matter disclosed herein, which respectively show the RM and interleaver output for a multi-slot physical shared channel with two slots and three CBs, a modulation order of 4, and CB RM outputs segmented with new RVs for slot 2. The RM output for CB2 can be assumed to be the RM output segmented with a new RV for slot 2. The first variation applies the interleaver operation over the entire RM output. Since the modulation order is 4, the interleaver operation for CB2 results in the coded bits being transmitted in both of the interleaved slots, as shown in Figure 24B .

[0292] Embodiment 1b of RM and interleaver operation

[0293] Figure 23A and 23B A second variant of the embodiment shown can be similar to Figure 25A and 25B the first variant, but within an explicitly limited number of slots during a multi-slot physical shared channel transmission. This second variant (limited consecutive RM, limited consecutive interleaver) can be characterized by a limit L on the number of slots. More specifically, Figure 25A and 25B show the RM and interleaver output for L = 2 for a multi-slot physical shared channel with four slots, three CBs, and a modulation order of 4. In this variant, the RM operation takes the entire codeword of a CB as input and provides encoded bits that are rate matched on the physical shared channel resources in a separate set of L slots. The RM operation provides a set of consecutive encoded bits as input to the interleaver, which also operates on the RM output of the set of L slots to provide a mapping of encoded bits onto symbols of every L slots. This variant allows that the RM output for different sets of L slots can be consecutive RM outputs or RM outputs with new RVs. It can also be provided to the gNB to not schedule multi-slot physical shared channel transmissions where CBs experience a crossing of the boundary between the set of L slots.

[0294] Embodiment 2 of RM and interleaver operation

[0295] Figure 26A and 26B A second example embodiment of RM determination and interleaver operation for a multi-slot physical shared channel with two slots, three CBs, a modulation order of 4, and consecutive CB RM outputs is depicted in FIGS. 7A and 7B. The interleaver operation is performed independently across each slot. In such a case, the interleaver size will be determined based on the CB RM output of the particular slot. This can work when the RM output is determined for all slots or when the RM output is determined independently for each slot. When the RM output is determined for all slots, the rate matching procedure described herein can be applied by considering E r as the RM size across all slots is expanded. However, in such a case, the interleaving procedure disclosed herein cannot be directly extended because the slot boundary should still be accounted for with respect to the interleaver operation. Let the number of slots that a certain CB is mapped to be M. For i ∈ {1, …, M}, the available encoded bits in the ith slot are E i and The interleaving procedure disclosed herein can then be applied to each E i respectively by replacing E with Ei .

[0296] In Figure 26A , the RM output for CB2 is a contiguous RM output. This variant applies only the interleaver operation in Figure 26B for each CB's RM output.

[0297] When the RM output is an output segmented with new RV indices, there is a similar behavior as shown in Figure 27A and 27B , which are respectively the RM and interleaver outputs for a multi-slot physical shared channel with two slots, three CBs, modulation order 4, and segmented CB RM output with new RV according to the subject matter disclosed herein.

[0298] The system bits available in the code word corresponding to a CB are important bits for the decoding operation. Therefore, it is beneficial for the interleaver to be able to map the system bits to reliable bits according to the modulation scheme used (e.g., 16QAM). One possible issue with the present example embodiment of the RM and interleaver is that, compared to the example embodiments of Figure 23A and 23B , it can end up that a small number of system bits are mapped to reliable bits. This possible issue can be circumvented by using the first variant of the following example embodiments of Figure 23A and 23B .

[0299] Example 2a of RM and interleaver operation

[0300] Example 2a of RM and interleaver operation is similar to the example embodiments of Figure 27A and 27B . In the example embodiments of Figure 27A and 27B , the interleaver operation can be performed independently across each slot, and the interleaver size can be determined based on the CB RM output for a particular slot. The RM output can allocate information bits across slots in order to map the information bits to reliable bit locations via the interleavers of different slots. Examples of the operation of example 2a of RM and interleaver operation are shown in Figure 28A and 28B , respectively, where it can be assumed that the multi-slot physical shared channel transmission has two slots and three CBs, and the modulation order is 4.

[0301] The RM operation for the variant of Figure 28A and 28B may be based on treating the system bits and parity bits separately when determining the input to the interleaver for different slots. Let the number of slots in the multi-slot PUSCH be M. For i e {1,..., M}, the number of coded bits available in the ith slot is E iThe bits of the code word corresponding to the CB are numbered from 0 to N-1, where N is the length of the code word. The bits from 0 to K-1 correspond to the K systematic bits used for the code word. Let j e {0,..., N-1} indicate the bit corresponding to the beginning of the RM output (e.g., indicated by the RV index of the multi-slot physical shared channel transmission). Since the output bits of the RM operation are Let The subset of systematic bits of size B will be part of the RM operation output in all slots of the multi-slot physical shared channel transmission. B is determined S This can vary depending on how the total amount of output bits is selected by the RM operation. For example, when performing the module N operation, the RM output for M slots can be determined by successively selecting bits from the code word starting at the jth bit of the total E bits.

[0302] The RM operation can be described as follows: First, determine the M fraction x i = E i / E. Alternatively, x i = 1 / M. These fractions determine the ratio of systematic bits to be allocated in each slot. Next, successively allocate the systematic bits to the slots according to the ratio of systematic bits. The number of systematic bits allocated to slot i is B-x i . Finally, the remaining E-B bits from the RM output are allocated to the slots according to the ratio of systematic bits. The number of bits allocated to slot i can be subject to an appropriate rounding operation to determine an integer number of bits.

[0303] Another way to describe the RM operation is to map the bits in the M slots successively interleaved, as follows. For all code word bits from 0 to successively allocate x i = E i / M bits for slot i of all M slots. In other words, the bits from 0 to (E1 / M)-1 are allocated in the first slot, the bits from E1 / M to (E1+E2 / M)-1 are allocated in the second slot. The bits from to are allocated in slot i. After bits have been allocated, repeat the previous process starting with the bits from until This continues for k < M, for the bits from to .

[0304] This procedure divides the RM output into M parts, based on the respective RM size, where the fraction of each part can be allocated a time slot. This procedure can be generalized to any number T of parts as follows.

[0305] First, for all code word bits from 0 to x i = E i *M is allocated in consecutive order in time slot i for all M time slots. In other words, bits from 0 to (E1 / M)-1 are allocated in the first time slot, bits from E1 / M to (E1+E2 / M)-1 are allocated in the second time slot. Bits from to are allocated in time slot i.

[0306] Next, after bits have been allocated, the previous procedure is repeated starting from bits until This continues for k≤M for bits from to .

[0307] The value of T can be chosen to allow for uniform distribution of information bits in the M time slots. The number T can be chosen based on different criteria, e.g., T = round(E / B), and others. Figure 29 An example of the RM output method is shown in which 6E1= 4E2= 4E3= 3E4and B = (3 / 10)E. T = round(E / B) can be chosen at this point.

[0308] RV selection

[0309] Figure 26A and 26B The RM operation of the example embodiment is based on time slots and the RM output of each CB is based on the selected RV index. The RM operation can be enhanced by the set of RV indices (set of RV indices used in Rel-16 PUSCH) or a different set of RV indices that can be increased. In this enhancement, the RM output of a CB in a time slot can be based on the RV index. The enhancement includes techniques to select such indices. The following by multiple options.

[0310] The first option includes that the RV index of a CB in each slot follows the RV index selected by the Rel-16 procedure per slot aggregation. Another option provides that for each slot in a multi-slot physical shared channel transmission, the RV index of a CB can be incremented. Another alternative option includes that the RV index of a CB in each slot can be the largest RV index whose starting position is less than the ending position of the RM output from the previous slot. That is, for a set of N slots in a given multi-slot physical shared channel transmission, for a CB, E i is the RM size for slot number i, and p st is the starting position of the RM output of the first slot (this can be the starting position corresponding to the particular RV index specified for the multi-slot physical shared channel transmission). Then, for slot i, the value is calculated, and then the RV index is used with the starting position that is the largest one less than or equal to x. This alternative option can include selecting the RV index whose starting position is closest to x.

[0311] Another option includes letting S be the RM size corresponding to the difference between the starting positions of two consecutive RV indexes. Then, T = round(E / S) (or T = ceil(E / S) or T = floor(E / S)) can be calculated, and the RV index is incremented by T for each consecutive slot.

[0312] Another option is that the transmitter can be configured with multiple possible sequences of RV selection, where the RV indexes of different CB segments follow the pattern of one of the sequences. For example, the selection of the sequence to be used can be performed as follows. The DCI scheduling the multi-slot physical shared channel transmission can include a field for selecting an index of the RV sequence to be used in the multi-slot physical shared channel transmission. This field can be the same RV index field in DCI format 0_1. Or, this field can be a different field or the same field but with an increased number of bits to accommodate a larger number of RV sequences. The transmitter can be configured with a set of multiple RV sequences. Then, only a subset of such sequences used by the transmitter can be configured by the gNB. The selection of such a subset can use RRC configuration or via MAC-CE. In the selected subset, the particular sequence to be used by the transmitter is indicated via a field indicated in the scheduling DCI of the multi-slot physical shared channel transmission. The selection of this field can be the same or different from the same RV index field in DCI format 0_1. Or, this field can be a different field or the same field but with an increased number of bits to accommodate more RV sequences.

[0313] When a CB crosses a slot boundary, the RV index of the newly formed segment can follow the order indicated by the DCI, as previously described. An example of this operation will be explained below, where it is assumed that the transmitter is configured with a set of RV sequences as shown in the table below. Assume that the UE is indicated by the RV index 0 via the scheduling DCI. In case one encoded CB crosses three slots, the RM output for the three slots will use the RV indexes 0, 1 and 2.

[0314] The table that the UE follows in order to determine the RV sequence for the CB segment across slots can be the Rel-16 table for determining the RV sequence for cross-slot aggregation. Alternatively, a new table can be defined for determining the RV sequence for the CB segment across slots, similar to (but not limited to) Table 2 below.

[0315] Table 2

[0316]

[0317]

[0318] As an alternative, the transmitter can select the RV index for a slot that spans a CB to ensure that the largest number of information bits are mapped to higher order symbols with high reliability. For example, in case of using 16QAM modulation, some bits have higher decoding reliability than others depending on their respective position in the 16QAM symbol. If all information bits are transmitted in the encoded bit position of one slot, approximately half of the information bits will be mapped to unreliable bit positions. In such a case, the RV index of the next slot can be selected so that half of the transmitted unreliable bits are retransmitted in the new slot, instead of selecting an RV index that can result in the transmission of non-transmitted encoded bits.

[0319] In general, for M-QAM modulation schemes, the reliability level of information bits can be different. Let the number of levels be K Q Each level identifies a different reliability level for correct decoding. Ideally, information bits will be mapped to the most reliable bit positions. However, if such a mapping is not possible within one slot, RV index selection can be made to ensure that information bits that are not mapped to the most reliable bits will be mapped to the most reliable information bits in the upcoming slot.

[0320] As an alternative to this case, each information bit will be "guaranteed" to be transmitted with a certain reliability. The "guarantee" concept used herein can be a function of the number of repeated transmissions of an information bit and the reliability level of each repeated transmission. For example, in a 16-QAM setup with two reliability levels, an information bit can be considered to be satisfactorily transmitted if it is transmitted once in the most reliable position, or twice in two less reliable positions. RV index selection can then be performed to ensure the maximum number of bits are transmitted with the guaranteed reliability.

[0321] As a simplification alternative, there are reliability levels of rank 1 to K Q The reliability level K Q corresponds to most reliable to least reliable, if an information bit is mapped to any bit with reliability of 1 to K' Q for a given rank K' Q , the information bit can be considered reliable. RV index selection can be performed to ensure the maximum number of information bits are mapped to reliable bits.

[0322] Embodiment 3 of RM and interleaver operation

[0323] For embodiment 3 of RM and interleaver operation, the interleaver operation is similar to the contiguous interleaver operation described previously. However, the size of the interleaver can be limited. That is, the interleaver operation can be a contiguous interleaver operation, but with a maximum interleaver size. The interleaver size limit can be implemented by resetting the interleaver operation after every set of interleaver input bits equal to the maximum interleaver size. In such a case, multiple interleaver operations can be performed on the entire RM output (e.g., when the RM output size is greater than the maximum interleaver size).

[0324] Alternatively, the interleaver size limit can be implemented by limiting the RM output size to be equal to the maximum interleaver size. In such a case, the number of bits of the RM output can be limited to the maximum interleaver size.

[0325] Yet another method of implementing the interleaver size limit can be by implementing the resource allocation of TBoMS such that both the RM output and the interleaver input are within the maximum interleaver size limit.

[0326] The interleaver size limit can be in the form of a value X that sets the maximum interleaver size. The value X can be specified in different ways. For example, the value X can be specified as an absolute value independent of other configurations of the TBoMS. In such a case, the specified absolute value can be explicitly mentioned in the Rel-16 specification. Or, the absolute value can be in the form of a numerical value. For example, the numerical value can be in the form of X = 1000 bits, where the value 1000 is just an example. Other alternatives are that the absolute value can be specified as a function of one or more other parameters in the Rel-16 specification, where these parameters can be independent of any configuration of the TBoMS. For example, X can be a fraction of other parameters in the specification, such as the maximum TBS value reached in Rel-16, or any other function of other parameters in the specification.

[0327] Another approach is that the value X is specified as a function of the specific configuration of the scheduled TBoMS or the specific configuration of the UE capability indicated by the UE related to the use of the TBoMS. For example, the value X can depend on any one or more of the parameters such as the scheduled MCS, the scheduled resources in time and / or frequency, the number of scheduled layers, the number of scheduled slots, the resource allocation mechanism, the scheduling type of the TBoMS (dynamic, configured grant, etc.), the transport block size, the number of CBs per TB, the configured CBG, and / or the UE capability.

[0328] For example, the value X can depend on the scheduled BW, the MCS, the number of layers, and the UE capability. The value X can also be specified as a function of the corresponding interleaver size reached in legacy NR (e.g., Rel-15 / 16). The corresponding value can be the value that can be reached using the same / similar scheduling parameters when scheduling a transmission in legacy NR (e.g., Rel-15 / 16).

[0329] The value X can be determined based on the scheduling parameters of the TBoMS such as the rank, the modulation order, the coding rate, the MCS, the bandwidth, the number of layers, etc. For example, if the TBoMS is scheduled in a 50 MHz bandwidth, the value X can be determined based on the scheduled bandwidth. Or the value X can be determined based on the UE capability indicated for the supported parameters of the TBoMS such as the rank, the modulation order, the coding rate, the MCS, the bandwidth, the number of layers, etc. For example, if the TBoMS is scheduled in a 50 MHz bandwidth, but the UE indicates a capability of supporting up to 100 MHz, the value X can be computed based on 100 MHz.

[0330] In the case where the determination of X depends on the UE capability, the value used in the determination can be for each frequency band in each band combination indicated by the UE capability.

[0331] X can be calculated as a TBS value corresponding to a legacy (Rel-16) counterpart of the scheduled TBoMS. The legacy counterpart of TBS can mean a TBS value calculated according to the legacy specification procedure and using the scheduled / configured parameters and UE capabilities. For example, X can be a TBS value calculated according to the legacy procedure using the scheduled parameters of TBoMS such as, but not limited to, rank, modulation order, code rate, MCS, bandwidth, and number of layers; or, the values of these parameters can be indicated by their respective UE capabilities.

[0332] X can be calculated as an expected input interleaver size using the legacy specification procedure. For example, X can be equal to the number of available coded bits in a legacy PDSCH / PUSCH scheduling using the same scheduled / configured parameters for TBoMS. The number of available coded bits can be given by N RE *Q, where the Rel-16 TBS determination equation for all parameters is given.

[0333] Operation alternatives for the interleaver of the third embodiment

[0334] As a first operation alternative, the UE can not expect to process an interleaver input size larger than the Rel-15 / 16 limit corresponding to the parameters the UE declares to support for each of the frequency bands in the band combination, and in section 5.4.2.1 of 38.212 V16.4.0, the limit corresponds to the amount of available coded bits G or available coded bits per CB G / C’.

[0335] As a second operation alternative, the UE can not expect to process an interleaver input size G max / C’, where C’ is given in section 5.4.2.1 of 38.212, and G max may be determined as N RE Q m v, assuming the number of REs (N RE ), the modulation order (Q m ), and the number of layers (v) are as follows, as shown in 5.4.2.1 in 38.212:

[0336] The maximum number of layers for one TB of UL-SCH is given by X, where:

[0337] If the higher layer parameter maxMIMO-Layers of PUSCH-ServingCellConfig of the serving cell is configured, X is given by this parameter,

[0338] Otherwise, X is given by the maximum number of layers supported by the UE for PUSCH of the serving cell.

[0339] Otherwise, X is given by the maximum number of layers supported by the UE for PUSCH of the serving cell.

[0340] The maximum number of layers for one TB of DL-SCH / PCH is given by the minimum of X, where:

[0341] If the higher layer parameter maxMIMO-Layers of PDSCH-ServingCellConfig of the serving cell is configured, X is given by this parameter,

[0342] Otherwise, X is given by the maximum number of layers supported by the UE for PDSCH of the serving cell.

[0343] If the higher layer parameter mcs-Table given by pdsch-Config of at least one DL BWP of the serving cell is set to "qam256", the maximum modulation order Q m = 8 is assumed for DL-SCH; otherwise the maximum modulation order Q m = 6 is assumed for DL-SCH.

[0344] If the higher layer parameter mcs-Table or mcs-TableTransformPrecoder given by pusch-Config or configuredGrantConfig of at least one UL BWP of the serving cell is set to "qam256", the maximum modulation order Q m = 8 is assumed for UL-SCH; otherwise the maximum modulation order Q m = 6 is assumed for UL-SCH.

[0345] η PRB = η PRB,LBRM is given by Table 5.4.2.1-1 (Table 3), where the value of η PRB,LBRM for DL-SCH is determined according to the initial downlink bandwidth part if no other downlink bandwidth part is configured to the UE.

[0346] N RE = 156 · η PRB .

[0347] Table 3. (Table 5.4.2.1-1): Values of η PRB,LBRM

[0348]

[0349] ​As a third operational alternative, the UE can not expect to process an interleaver input size G max / C', where C' is given in 38.212 section 5.4.2.1, and G max may be determined as N RE Q m v, assuming the number of REs (N RE ), the modulation order (Q m ), and the number of layers (v) as follows.

[0350] The maximum number of layers for one TB for DL-SCH / PCH is given by the maximum number of layers for PDSCH supported by the UE for the serving cell;

[0351] The maximum number of layers for one TB for DL-SCH / PCH is given by the maximum number of layers for PDSCH supported by the UE for the serving cell;

[0352] If the UE supports 256QAM for the serving cell, the maximum modulation order Q m = 8 is assumed for DL-SCH; otherwise the maximum modulation order Q m = 6 is assumed for DL-SCH;

[0353] If the UE supports 256QAM for the serving cell, the maximum modulation order Q m = 8 is assumed for UL-SCH; otherwise the maximum modulation order Q m = 6 is assumed for UL-SCH;

[0354] η PRB = η PRB,LBRM is given by Table 5.4.2.1-1 (Table 4); and

[0355] N RE = 156 · η PRB .

[0356] Table 4. (Table 5.4.2.1-1): PRB,LBRM The value of

[0357]

[0358] As a fourth operational alternative for configured TBoMS, a configured TBoMS satisfies the feature set if the parameters associated with the TBoMS satisfy the UE capabilities indicated in the feature set. The UE can not expect to process an interleaver input size G max / C′, where C′ is given in Section 5.4.2.1 of 38.212, and according to 6.1.4.2 of 38.214 regarding UL-SCH and 5.1.3.2 of TS38.214 regarding DL-SCH / PCH, G max It can be determined as N RE Q m v, assuming the number of REs (N) RE ), modulation order (Q) m The number of layers (υ) and the number of layers are as follows.

[0359] The maximum number of layers in a TB of UL-SCH is given by the maximum number of layers of PUSCH supported by the UE within the set of satisfied feature sets;

[0360] The maximum number of layers in a TB of DL-SCH / PCH is given by the maximum number of layers of PDSCH supported by the UE within the set of satisfied feature sets;

[0361] If the UE supports 256QAM within the set of features that must be satisfied, then the maximum modulation order Q of DL-SCH is... m =8 is assumed; otherwise, the maximum modulation order Q of DL-SCH is assumed. m =6 is assumed;

[0362] If the UE supports 256QAM within the set of features that it satisfies, then the maximum modulation order Q of UL-SCH is... m =8 is assumed; otherwise, the maximum modulation order Q of UL-SCH is assumed. m =6 is assumed;

[0363] η PRB =η PRB,LBRM As given in Table 5.4.2.1-1 (Table 5); and

[0364] N RE =156·η PRB .

[0365] Table 5. (Table 5.4.2.1-1): PRB,LBRM value

[0366]

[0367] In other words, this workable alternative corresponds to calculating the interleaver size limit using parameters selected from the satisfied feature set in a way that maximizes the limit value.

[0368] As a fifth operational alternative for configured TBoMS, the configured TBoMS satisfies the feature set if the parameters associated with TBoMS satisfy the UE capabilities indicated in the feature set. For each satisfied feature set, the UE does not expect to process an interleaver input size G max / C', where C' is given in 38.212 section 5.4.2.1, and G max may be determined as N RE Q m v, assuming the number of REs (N RE ), the modulation order (Q m ), and the number of layers (v) are as follows.

[0369] The maximum number of layers for one TB of UL-SCH is given by the maximum number of layers of PUSCH supported by the UE within the satisfied feature set;

[0370] The maximum number of layers for one TB of DL-SCH / PCH is given by the maximum number of layers of PDSCH supported by the UE within the satisfied feature set;

[0371] If the UE supports 256QAM within the satisfied feature set, the maximum modulation order Q m = 8 is assumed for DL-SCH; otherwise the maximum modulation order Q m = 6 is assumed for DL-SCH;

[0372] If the UE supports 256QAM within the satisfied feature set, the maximum modulation order Q m = 8 is assumed for UL-SCH; otherwise the maximum modulation order Q m = 6 is assumed for UL-SCH;

[0373] η PRB = η PRB,LBRM is given by Table 5.4.2.1-1 (Table 6); and

[0374] N RE = 156 · η PRB .

[0375] Table 6. (Table 5.4.2.1-1): Values of η PRB,LBRM

[0376]

[0377] In other words, the fifth operational alternative corresponds to selecting the smallest interleaver size limit

[0378] Embodiment 4 of RM and interleaver operation​

[0379] In the fourth embodiment, the interleaver operation can be a continuous interleaver operation, but across a certain resource unit. The resource unit can be a time slot, in which case the fourth embodiment is similar to Embodiment 2 of RM and interleaver operations. The resource unit can be a set of entire time slots for TBoMSB, in which case the fourth embodiment becomes similar to Embodiment 1 of RM and interleaver operations. The resource unit may be different from the time slots or the set of entire time slots of TBOMS. For example, the unit of resources can be a set of time - continuous or non - continuous resources, which may or may not span different time slots.

[0380] In some cases, the RM output can include multiple such resource units. In some cases, the definition of a unit may depend on its relative position with respect to the RM output. For example, the first unit in the RM output may correspond to a specific resource with a specific configuration, while the second or higher units in the RM output may correspond to resources with different configurations. In such a case, the interleaver operation can be continuous within the context of one unit, while independent interleaver operations can occur across different units.

[0381] Mapping from virtual resources to physical resources

[0382] The subject matter disclosed herein includes a method for performing a mapping from virtual resources to physical resources in the context of multi - time - slot physical shared channel transmission processing. That is, a transmitter can be indicated by a set of physical resources for the transmission of a multi-time - slot physical shared channel. It can be assumed that the set of resources includes time slots. Each time slot of the time slots can be associated with a global identifier of the time slot position in the system, for example, an identifier based on the System Frame Number (SFN). For the i - th time slot, the set can include the indices of OFDM symbols assigned to the transmitter for use in multi - time - slot physical shared channel transmission, where each symbol corresponds to a set of REs of each assigned SC. The set of time slots can be continuous or non-continuous. It can be assumed that the time slots are sorted in time according to their time indices (i.e., time slots), that is, if i < j, time slot i comes before time slot j in time. The set of symbols can have UL symbols, DL symbols, or F symbols. No assumptions are made regarding the rules related to the forced transmission direction of these symbols for the indication of the set. For example, some of the symbols in the set can have DL / UL symbols. However, the transmitter should comply with the transmission rules indicated by the network or gNB for the assigned symbols.

[0383] The transmitter can also be indicated a set of virtual resources to use in the processing of the multi-slot physical shared channel transmission. It can be assumed that the set of resources includes slots. For the i-th slot, the set includes indices of OFDM symbols allocated to the transmitter to use in the multi-slot physical shared channel transmission. The number of virtual sets may be the same or different from the number of physical slots . The set of virtual symbols may be the same or different from the set of physical symbols . The sets can be indicated dynamically or semi-statically.

[0384] The indication of virtual resources can be separate from the indication of physical resources. Alternatively, the indication of virtual resources can be implicitly derived from the set of physical resources. For example, the set of virtual resources can be determined by considering the set of physical resources and omitting resources corresponding to physical resources that are not allowed to transmit in a predetermined direction (e.g., in case of multi-slot PUSCH with DL and / or F transmission directions indicated by a TDD configuration).

[0385] Based on the allocation of physical resources and virtual resources, there are several mapping methods from virtual resources to physical resources.

[0386] In the case where the virtual set and the physical set are the same, i.e., and and all slots in the set of physical slots are consecutive, the resources corresponding to the symbols in may be mapped to the resources corresponding to the symbols in .

[0387] When the virtual set and the physical set are the same, i.e., and and not all slots in the set of physical slots are consecutive, the set of physical slots includes several subsets, where each subset includes consecutive slots. In such a case, the resources corresponding to the symbols in may be mapped to the resources corresponding to the symbols in . For example, And the four slots set includes two subsets, each containing two consecutive slots. This can be the case of multi-slot PUSCH, for example, and for a TDD configuration of the form DDDSUUDDSUU, where all U slots are allocated to multi-slot PUSCH. This can also happen due to dynamic indication of slot format. For example, consider the TDD configuration FFFFFFFF. The UE can be indicated via SFI indication the following pattern of this configuration UUUUDD. After performing the necessary PUSCH processing for multi-slot PUSCH, the UE receives another SFI indication changing the pattern to UUDDUU, in such a case, the UE can perform multi-slot PUSCH transmission on the newly determined set of physical slots. As another example, And none of the four slots are consecutive. This can be the case of multi-slot PUSCH, for example, and for a TDD configuration of the form DDDSUDDSUDDSUDDSU, where all U slots are allocated to multi-slot PUSCH.

[0388] In the case where the number of physical slots is less than the number of virtual slots, i.e., This can correspond to the following use case in Rel-16, the UE can be allocated a set of physical slots for the transmission of multi-slot PUSCH. The UE can then determine that all physical slots are feasible for transmission, and therefore, the corresponding virtual slots are the same as the physical slots. After that, due to dynamic changes in the TDD configuration for example, some physical slots can be rendered as not suitable for transmission. In such a case, the UE has different mapping options. For the first option, the UE can map the virtual slots consecutively in their respective order to the physical slots. Therefore, there is no additional The virtual slot ends up being the last For the second option, the UE can map the virtual slots consecutively in their respective order to the physical slots. If the determination of the virtual slots is based on the physical slots, the UE can also skip the virtual slots with the original physical slots no longer available.

[0389] In the case where the number of physical slots is greater than the number of virtual slots, i.e., For example, this can happen if the slots are indicated to the UE for multi-slot PUSCH processing, and when the UE determines the virtual slots from the physical slots, some slots are determined as not suitable for UL transmission. In such a case, the UE has different mapping options.

[0390] For the first option, the UE can map the virtual slots to the physical slots consecutively in their respective order. If a physical slot is not suitable for transmission, then the physical slot is skipped without skipping the corresponding virtual slot. For example, assume the set of virtual slots is numbered 1 to 4 and the physical slots are numbered 1 to 5 with the third slot not suitable. Then, the mapping from virtual to physical is: 1-1, 2-2, 3-4, 4-5.

[0391] For the second option, the UE can map the virtual slots to the physical slots consecutively in their respective order. If a physical slot is not suitable for transmission, then the slot is skipped and the corresponding virtual slot is also skipped. For example, assume the set of virtual slots is numbered 1 to 4 and the physical slots are numbered 1 to 5 with the third slot not suitable. Then, the mapping from virtual to physical is: 1-1, 2-2, 4-4, nothing-5.

[0392] As can be seen from the examples, some physical slots can end up with nothing mapped from the virtual slots. In such cases, the UE can refrain from transmitting anything in those particular slots. Alternatively, the UE can retransmit other virtual slots in those physical slots. For example, in the above example of the mapping result of nothing-5, the mapping of nothing-5 can be replaced by 1-5 or 4-5. Another possibility is that some virtual slots can not be mapped to any physical slots.

[0393] UCI multiplexing with multi-slot PUSCH

[0394] One technique that can prevent UCI multiplexing with multi-slot PUSCH is that the UE can not expect to have a UCI multiplexing case with multi-slot PUSCH. Alternatively, the UE can be instructed to handle a UCI multiplexing with multi-slot PUSCH in a way that does not result in actual UCI multiplexing. For example, if such a multiplexing case occurs, the UE can cancel the UCI transmission or the multi-slot PUSCH transmission. In the case of cancelling the multi-slot PUSCH transmission, then the affected slots can be cancelled or the affected slots and all subsequent slots can be cancelled. In the event of such cancellation, the UE should expect to cancel the transmission in the OFDM symbols within the appropriate cancellation timeline.

[0395] Figure 30 An example case is depicted in which a multi-slot PUSCH is scheduled and UCI has been scheduled to be multiplexed in one of the slots forming the multi-slot PUSCH. In Figure 30 In, for slots 3002-3004, multi-slot PUSCH scheduling occurs at 3001. After the multi-slot PUSCH scheduling, for slots 3006 and 3003, UCI PDSCH is scheduled at 3005.

[0396] Figure 30 The cases depicted in Figure 31 are then considered from a timeline perspective and then from a performance perspective. Different approaches to handle UCI multiplexing are as follows. That is, when a UE determines that a UCI multiplexing case will occur with one or more slots in a multi-slot PUSCH, the following options can be performed.

[0397] As a first option, the UE can adapt the interleaver output for all slots in the multi-slot PUSCH. For this option, the Rel-16 timeline associated with UCI multiplexing on a multi-slot PUSCH (indicated as timeline 1 in Figure 31 ) should be adapted to provide sufficient time before the slot where UCI multiplexing occurs to adapt the possibly earlier slots in the multi-slot PUSCH. Only the timeline 1 in Figure 31 is sufficient in order to determine the interleaver behavior in case UCI multiplexing is effective. Figure 31 The timeline 2 in Figure 31 allows the UE to determine the exact value of the UCI bits to be multiplexed, which can not require a similar adaptation as the Rel-16 timeline 1 in Figure 31 . Alternatively, Both timelines 1 and 2 in

[0398] can be adapted similarly to the adaptation provided for timeline 1. This approach applies to all previously described embodiments of RM and interleaver operation.

[0399] From a performance perspective, this can allow the UE to naturally inherit the multiplexing behavior in Rel-16, i.e., the UE can recalculate the RM output and the interleaver output for the updated amount of resources available after UCI multiplexing. This can also allow to easily handle UCI multiplexing from a UE implementation perspective. However, from a scheduling perspective, this can be quite limiting. Figure 32 33 depicts the puncturing slots for embodiment 1 and embodiment 2 for RM and interleaver operation, respectively.

[0400] For embodiment 1 and la, the interleaving for the entire slot for the affected CBs has already occurred and cannot be redone. In other words, for the CBs mapped on M slots, the interleaved input sequence can be given as e0, e1, …, e E-1 where and E i This represents the number of coded bits available in the i-th time slot. Then, the interleaved output sequence is f0, f1, ..., f E-1 , among which arrive The bits correspond to the bits mapped in time slot i. If UCI multiplexing occurs in time slot i and the resulting rate match size becomes E′ i Then the UE should from arrive Select E′ from the bits i Bits are transmitted. One way to do this might be from... arrive The transmission of this corresponds to the selection / cleavage of consecutive bits from the interleaver output. Another method can be used for the selection / cleavage of consecutive bits from the interleaver input, which can be implemented as follows: First, with... arrive The original interleaver output corresponds to the original interleaver input sequence e0, e1, ..., e E-1 China E i The bit positions are selected. Then, it is possible to select from these E... i Select a specific E′ value i Bits, and the corresponding E′ in the original interleaver output. i Values ​​can be transmitted. A possible E′ i Bit selection can be done by pressing e i The bit positions are in ascending order. In this case, as mentioned above, due to the change in rate-matched size, the interleaver operation may no longer be performed. E′ i The general selection of bits can be achieved by selecting bits. This is achieved by using the function Φ(i), which is the selection function used to determine which bit to choose at position i. The function Φ(i) = i corresponds to one of the possible choices described above.

[0401] If UCI multiplexing occurs in time slot i and if the resulting rate match size becomes E i If the condition is not met, another alternative is to perform interleaving again. One way to perform interleaving again is to... arrive The original interleaver output corresponds to the original interleaver input sequence e0, e1, ..., e E-1 Select E′ i The bit positions are used as a new interleaver input sequence. Interleaver operations can then be applied to this sequence to obtain a new interleaver output sequence. This corresponds to consecutive bit selection / pruning from the interleaver output. Another option might be to use... arrive The original interleaver output corresponds to the original interleaver input sequence e0, e1, ..., e E-1 Select E i Bit position. This corresponds to the consecutive bit selection / cleaning from the interleaver input. Then, the new length E′ i Interleaved sequence The sequence is restricted, and interleaver operations can be applied to it to obtain a new interleaver output sequence. In such a case, re-execution of the interleaver operation can be restricted to slot i. E′ i The general selection of bit positions can be accomplished using a function Φ(i) similar to that described earlier.

[0402] If UCI multiplexing occurs in time slot i and if the resulting rate match size becomes E′ i Another alternative could be to utilize length The sequence is used as a new interleaver input and interleaved together with all subsequent time slots. Such an interleaver input sequence can be derived from the original interleaver input sequence e0, e1, ..., e1 from the continuous interleaver inputs or outputs as described above. E-1 Select specific It is formed by the bit positions. One possible method is to combine it with the bit positions from... to f E-1 The original interleaver output corresponds to the original interleaver input sequence e0, e1, ..., e E-1 Select Bit position. One possible method is to utilize... arrive This corresponds to the selection / cubing of consecutive bits from the interleaver output. Alternatively, as mentioned earlier, the selection / cubing of consecutive bits from the interleaver input can be used, or a generalized selection function Φ(i) can be employed.

[0403] Another consideration might involve what happens if time slot i contains multiple CBs, for each CBE′ i How it is calculated. For example, consider E respectively. i,1 and E i,2 Two CBs mapped in slot i with the original RM size, corresponding to the total RM size E. i =E i,1 +E i,2 And due to UCI reuse considerations, the total RM size is reduced to E′. i Then, there are several possible methods to calculate E′ of the new RM size for each CB. i,1 and E′ i,2 Satisfy E′ i =E′ i,1 +E′ i,2 for:

[0404] Equal size: E' i,1 = E' i,2 = E' i / 2

[0405] Equal reduction: E' i,1 = E i,1 - (E i - E' i ) / 2 i,2 = E i,2 - (E i - E' i ) / 2

[0406] Weighted size: (or ) or ), (or E' i，2 = E' i - E' i，1 ) or weighted reduction: (or ) or ), (or E' i,2 = E' i - E' i，1 ).

[0407] From a UE implementation perspective and from the impact on the specification, this solution can be quite complex.

[0408] An alternative to the previous approach can be to have the UE re-determine the RM output for all slots containing CBs affected by UCI multiplexing. This involves timeline accommodation to allow sufficient time for the UE to perform the relevant processing before the first slot containing the affected CBs. There are three options for timeline accommodation, two of which are depicted in Figure 34 , Figure 34 depicts a multi-slot shared channel with four slots 3401-3404 and four code blocks CB1-CB4.

[0409] The first option can be that the timeline providing sufficient time to perform the relevant processing starts from the first slot containing the affected CBs. In Figure 34 , the timeline 3405 of the first option starts from the slot 3403 containing the start of CB4. The second option can be that the timeline 3406 starts from the first slot containing a CB that is not present in an earlier slot. In Figure 34In this case, the timeline starts from slot 3402, and the first slot before slot 3404 contains a code block (i.e., CB2) that is not present in the earlier slot. The third option can be a timeline that starts from the first slot of the multi-slot PUSCH that allows sufficient time to perform the related processing.

[0410] For embodiments 2 and 2a that depend on the slot-based interleaver configuration, the UE can re-determine the RM output for the affected slot and possibly later slots. This can be done after the Rel-16 operation of RM determination due to UCI multiplexing, which is facilitated based on the slot-based operation of the interleaver. In such a case, when slot ii is affected by UCI multiplexing, resulting in E'2 i a new RM size compared to the original E i The new interleaver input sequence can be selected from the original input sequence Ei by selecting In such a case, the interleaving of the input sequence for all later slots k can be adjusted according to or remain the same as before Alternatively, the new interleaver input sequence is selected from the original input sequence using the generalized selection function Φ(i) as described earlier. Another consideration can involve how E'2 i is calculated for each CB if slot i contains multiple CBs, and the variants described earlier can be applied.

[0411] With such an implementation, the UE can also perform a smart RM determination operation that allows better decoding performance for the affected CBs. This operation can be explained in the following example. Consider the example shown in Figure 35 where a multi-slot PUSCH spans two slots with three CBs, RV3, and the RM output is shown for each CB.

[0412] Assume that UCI multiplexing occurs on the second slot of the multi-slot PUSCH, which results in a portion of the encoded bits in slot 2 no longer being available for the CBs in the PUSCH. When adapting the RM output for the CBs affected by the no longer available bits, one option can be to reduce the amount of available encoded bits equally among those affected bits. However, such an approach can not provide the best decoding performance for the TB, as Figure 36 illustrated, Figure 36 depicts the RM output for a multi-slot PUSCH with two slots, three CBs, RV3, and UCI multiplexing. The affected RM outputs are treated equally. In such a case, CB2 is fairly disadvantaged due to the system bits of the RM output being omitted. CB3 does not suffer as badly.

[0413] CB2 is fairly disadvantaged due to the system bits of the RM output being omitted. CB3 does not suffer as badly. Figure 36A better technique, as described, could be to adapt the RM outputs of the two CBs differently depending on the type of coded bits included. For example, an RM output could be an equal reduction in the amount of parity bits from both CBs until all parity bits are omitted from one CB, then all remaining omissions could be distributed between the CBs with the remaining parity bits, and so on. Figure 37 The method is described, which depicts the RM output with two time slots, three CBs and RV3, and a multi-slot PUSCH with UCI multiplexing. The RM output of the affected CBs holds the system bits.

[0414] exist Figure 38 The example shown depicts the RM output of each CB in a multi-slot PUSCH that spans four slots, with three CBs having RV0.

[0415] Consider an example where UCI multiplexing occurs on the third slot of a multi-slot PUSCH, which results in a portion of the encoded bits in slot 3 no longer being used for CBS in the PUSCH. Figure 39 Depicting and Figure 38 The corresponding RM output, where the number of available coded bits is reduced equally in the affected bits. In this case, CB3 is negatively affected by the omission of system bits in the RM output (even for such a small number of omitted bits). CB2 does not exhibit this effect. Figure 40 Depicting and Figure 38 The corresponding RM output, where the affected CB holds the system bits. Implementing a smart RM determination method might involve determining the new RM output size E′ for each CB in the affected time slot i. i The problem is that if the RM output of the CB at time slot i before UCI multiplexing is... Then the RM output of CB after UCI multiplexing is Then, the following options can be used to determine the E′ of each CB in slot i. i value.

[0416] The first option might determine E′ for each CB in the affected time slot i. i The values ​​are equal.

[0417] The second option might be to set the number of CBs in time slot i to K. For a CB number k among the K CBs, let the amount of information bits and parity bits originally scheduled to be transmitted in time slot i be b respectively. k and p k E′ i Also re-marked as To differentiate the new RM size for each CB, let the new RM size for slot i be equal to E′.i Then, set... Equals min(E′) i / K,p1,p2,…,p K ).if Then p k All values ​​decrease And consider having non-zero p k The value of CB is a new set of CBs of size K. Therefore, the set of CBs is... Increase equals The amount. If Then if for all the original K CBs, p k =0, for all the original K CBs The amount increased until If p k ≠0, then determine whether repeat.

[0418] For all embodiments disclosed herein, if the transmission block comprises a single code block, the operation can be performed on each transmission block; or if the transmission block comprises multiple code blocks, the operation can be performed on each code block. The described operations do not depend on how the coded bits corresponding to the code blocks are mapped to time resources. Figure 41 An example illustrating the potential mapping of coded bits to time resources is given, where a transmission block comprises three code blocks and the coded bits are mapped to four time slots 4101-4104. Figure 41 In the first example mapping mechanism depicted at the top, distributed code block mapping distributes the coded bits from each code block across all time slots. Figure 41 In the second example mapping mechanism depicted at the bottom, contiguous / local code block mapping sequentially maps the coded bits from a code block to all time slots. In both example mapping mechanisms (and those not explicitly described), the operations described herein can be performed on a per-code-block basis, where the output of the operations described herein is mapped to time slots according to the mapping mechanism used. For example, for a contiguous rate matching operation, the contiguous amount of coded bits for each code block to be mapped to all time slots is selected, regardless of whether the code block exists in two or four time slots. As another example, for a segmented rate matching operation based on RV indexes, the rate matching operation can select a specific set of coded bits to be mapped to each time slot for each code block, where for each time slot, the set of coded bits is selected based on the RV index. This is independent of whether the code block exists in two or four time slots. Similar behavior may exist for other rate matching operations and interleaver operations, for example. Furthermore, although the other figures in this document are to be understood as describing different embodiments in a contiguous / local code block mapping manner, it should be understood that other mappings may be applicable, including but not limited to distributed code block mapping.

[0419] Embodiments of the subject matter and operations described in this specification can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions encoded on a computer storage medium for execution by, or to control the operation of, data processing apparatus. Alternatively or additionally, the program instructions can be encoded as propagated signals, e.g., machine-generated electrical, optical, or electromagnetic signals, that are generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. The computer storage medium can be, or be included in, a computer-readable storage device, a computer-readable storage substrate, a random or serial access memory array or device, or a combination of one or more of them. Moreover, while a computer storage medium is not a propagated signal, a computer storage medium can be a source or destination of computer program instructions encoded in an artificially generated propagated signal. The computer storage medium can also be, or be included in, one or more separate physical components or media (e.g., multiple CDs, disks, or other storage devices). Additionally, the operations described in this specification can be implemented as operations performed by a data processing apparatus on data stored on one or more computer-readable storage devices or received from other sources.

[0420] While this specification can include many specific implementation details, these should not be construed as limitations on any requirements for any claimed subject matter, but rather as descriptions of particular implementations. Certain features described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features can be described above as acting in particular 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 can be directed to a subcombination or variation of a subcombination.

[0421] Similarly, while operations are described in a particular order, this should not be understood as requiring such an order, nor requiring all illustrated operations to be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing can be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated in a single software product or packaged into multiple software products.

[0422] Accordingly, specific embodiments of the subject matter are described herein. Other embodiments within the scope of the following claims are possible. In some instances, the acts outlined in the claims can be performed in a different order and still achieve desirable results. Additionally, the process described in the figures can not necessarily be required to be performed in the particular order described and illustrated herein. In some implementations, multitasking and parallel processing can be advantageous.

[0423] As will be recognized by those skilled in the art, the innovative concepts described in this application can be modified and varied greatly. Accordingly, the scope of the subject matter claimed should not be limited to any of the specific exemplary teachings discussed above, but is instead defined by the following claims.

Claims

1. A transmitter comprising a transmit block processing chain, the transmit block processing chain comprising: code block determination circuitry to determine a size of a code block mapped across at least one slot boundary of a slot of a physical shared channel; rate matching circuitry to rate match bits of the code block to a number of bits available in a transport block spanning one or more slots of the physical shared channel; and an interleaver to interleave consecutive outputs of the rate matching circuitry based on slots such that a code block across a slot boundary between a first slot and a second slot is interleaved within the first slot and the second slot.

2. The transmitter of claim 1, wherein, the code block across the slot boundary between the first slot and the second slot is segmented with a redundancy version corresponding to the second slot, wherein the outputs of the rate matching circuitry are limited to a predetermined number of slots, and wherein the interleaver further interleaves the outputs of the rate matching circuitry across the predetermined number of slots.

3. The transmitter of claim 1, wherein, the rate matching circuitry rate matches bits of the code block to the number of bits available in the transport block consecutively, and wherein the interleaver interleaves the consecutive outputs of the rate matching circuitry across a predetermined number of slots, the predetermined number being less than a number of slots allocated to the transmit block processing chain.

4. The transmitter of claim 1, wherein, the interleaver interleaves the consecutive outputs of the rate matching circuitry without segmentation with a redundancy version.

5. The transmitter of claim 1, wherein, the interleaver interleaves consecutive outputs of the rate matching circuitry based on slots in response to a cancellation indication by interleaving the outputs of the rate matching circuitry in slots remaining after the cancellation indication, or in response to uplink control information, UCI, with multi-slot physical uplink shared channel, PUSCH, being scheduled in one or more slots spanned by the transport block by interleaving the outputs of the rate matching circuitry in one or more slots preceding slots in which the UCI is scheduled.

6. The transmitter of claim 5, wherein, information scheduling the UCI is received a first predetermined time period before a first slot of the one or more slots spanned by the transport block.

7. The transmitter of claim 6, wherein, information relating to bits of the UCI is received a second predetermined time period before the first slot of the one or more slots spanned by the transport block.

8. A transceiver comprising: receive processing circuitry to receive an indication of resources allocated for transmission on a physical shared channel, the indication of resources comprising one or more allocated slots of the physical shared channel; and transmit processing circuitry comprising: code block determination circuitry to determine a size of a code block mapped across at least one slot boundary of an allocated slot of a physical shared channel; rate matching circuitry to rate match bits of the code block to a number of bits available in a transport block spanning one or more allocated slots of the physical shared channel; and an interleaver to interleave consecutive outputs of the rate matching circuitry based on slots such that a code block across a slot boundary between a first allocated slot and a second allocated slot is interleaved within the first allocated slot and the second allocated slot.

9. The transceiver of claim 8, wherein, the code block across the slot boundary between the first allocated slot and the second allocated slot is segmented with a redundancy version corresponding to the second allocated slot, wherein the outputs of the rate matching circuitry are limited to a predetermined number of allocated slots, and wherein the interleaver further interleaves the outputs of the rate matching circuitry across the predetermined number of allocated slots.

10. The transceiver of claim 9, wherein, The rate matching circuit rate matches bits of the code block with a number of bits available in the transport block consecutively, and wherein the interleaver interleaves the consecutive output of the rate matching circuit across a predetermined number of allocated slots, the predetermined number being less than a number of slots allocated to the transceiver.

11. The transceiver of claim 8, wherein, The interleaver interleaves the consecutive output of the rate matching circuit without segmenting with a redundancy version.

12. The transceiver of claim 8, wherein, The interleaver, in response to a cancellation indication, interleaves the output of the rate matching circuit in slots remaining after the cancellation indication, or, in response to uplink control information, UCI, for a multi-slot physical uplink shared channel, PUSCH, being scheduled in one or more allocated slots spanned by the transport block, interleaves the output of the rate matching circuit in one or more slots preceding slots to which the UCI is scheduled, based on the consecutive output of the rate matching circuit being time-slotted.

13. The transceiver of claim 12, wherein, Information scheduling the UCI is received a first predetermined time period before a first slot of the one or more slots spanned by the transport block.

14. The transceiver of claim 13, wherein, Information relating to bits of the UCI is received a second predetermined time period before the first slot of the one or more slots spanned by the transport block.

15. A method for processing data to be mapped to a transport block, the method comprising: determining, by a code block determination circuit, a size of a code block of the data mapped across at least one slot boundary of slots of a physical shared channel; rate matching, by a rate matching circuit, bits of the code block with a number of bits available in the transport block spanning one or more slots of the physical shared channel; and and interleaving, by an interleaver, the code block across the slot boundary between the first slot and the second slot within the first slot and the second slot based on the consecutive output of the rate matching circuit being time-slotted.

16. The method of claim 15, further comprising segmenting, by the code block determination circuit, the code block across the slot boundary between the first slot and the second slot with a redundancy version corresponding to the second slot, and wherein the output of the rate matching circuit is limited to a predetermined number of slots, the method further comprising interleaving, by the interleaver, the output of the rate matching circuit across the predetermined number of slots.

17. The method of claim 15, further comprising rate matching, by the rate matching circuit, bits of the code block with the number of bits available in the transport block consecutively, and the interleaver interleaves the consecutive output of the rate matching circuit across a predetermined number of allocated slots, the predetermined number being less than a number of allocated slots.

18. The method of claim 15, further comprising interleaving, by the interleaver, the consecutive output of the rate matching circuit without segmenting with a redundancy version.

19. The method of claim 15, further comprising interleaving, by the interleaver, the consecutive output of the rate matching circuit based on the consecutive output of the rate matching circuit being time-slotted, in response to a cancellation indication, by interleaving the output of the rate matching circuit in slots remaining after the cancellation indication, or, in response to uplink control information, UCI, for a multi-slot physical uplink shared channel, PUSCH, being scheduled in one or more allocated slots spanned by the transport block, by interleaving the output of the rate matching circuit in one or more slots preceding slots to which the UCI is scheduled.

20. The method of claim 19, wherein, The information scheduling the UCI is received a first predetermined time period before the first of the one or more time slots spanned by the transport block, and wherein the information relating to the bits of the UCI is received a second predetermined time period before the first of the one or more time slots spanned by the transport block.

Images