CN115706624A

CN115706624A - Trans-slot transport block mapping

Info

Publication number: CN115706624A
Application number: CN202210937229.2A
Authority: CN
Inventors: ***.卡尔莫斯; 裵正铉
Original assignee: Samsung Electronics Co Ltd
Current assignee: Samsung Electronics Co Ltd
Priority date: 2021-08-06
Filing date: 2022-08-05
Publication date: 2023-02-17

Abstract

The present disclosure relates to systems and methods relating to a transport block processing chain for a transmitter. The code block determination circuit may be configured to determine a size of a code block mapped across a plurality of time slots of a wireless physical shared channel configured according to a multi-slot transport block (TBoMS), and the rate matching circuit may be configured to rate match bits of the code block to a number of bits available in a transport block spanning a predetermined number of time slots of the wireless physical shared channel. In addition, the interleaver may be configured to interleave successive outputs of the rate matching circuit on a slot basis such that code blocks across slot boundaries between the first and second slots are interleaved within the first and second slots.

Description

Trans-slot transport block mapping

Technical Field

The subject matter disclosed herein relates generally to wireless communication systems. More specifically, the subject matter disclosed herein relates to mapping transport blocks across time slots that have been allocated for uplink transmission in a wireless physical shared channel.

Background

A wireless network, such as a fifth generation (5G) wireless network, may allocate resources for transmission over a physical shared channel. The allocation may be in the form of resources in a plurality of time slots, in which case the allocation corresponds to transmission of a physical shared channel with repetitions (e.g., type a or type B repetitions). The resources may be indicated to the 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). The resources may include a set of Orthogonal FreqUEncy Division Multiplexing (OFDM) symbols and a Set of Subcarriers (SCs) and additional configurations for physical shared channel transmission. The set of OFDM symbols may be contiguous or non-contiguous in time. The OFDM symbols may also be indicated in the form of a set of symbols in one or more slots. The set of subcarriers may be a contiguous or non-contiguous set of subcarriers and may be indicated in the form of Resource Blocks (RBs) or subsets of Resource blocks. The combination of OFDM symbols and subcarriers corresponds to a Resource Element (RE) carrying coded bits of PUSCH.

Disclosure of Invention

Example embodiments provide a transport block processing chain for a transmitter that may include a code block determination circuit and a rate matching circuit. The code block determination circuit may be configured to determine a size of a code block mapped across a plurality of time slots of a wireless physical shared channel configured according to a multi-slot transport block (TBoMS). The rate matching circuit may be configured to rate match bits of the code block to a number of bits available in a transport block spanning multiple slots of a wireless physical shared channel. In one embodiment, the plurality of time slots of the wireless physical shared channel configured according to the TBoMS may be based at least in part on a legacy (legacy) maximum Transport Block Size (TBS). In another embodiment, the plurality of time slots of the wireless physical shared channel configured according to TBoMS may be based at least in part on a predetermined number of code blocks. In yet another embodiment, the predetermined number of code blocks may be based at least in part on a legacy maximum number of code blocks. In yet another embodiment, the plurality of time slots of the wireless physical shared channel configured according to TBoMS may be based at least in part on a maximum TBS set forth in a standards document. In one embodiment, the transport block processing chain may further comprise an interleaver configured to interleave successive outputs of the rate matching circuit on a slot basis such that code blocks spanning a slot boundary between the first slot and the second slot are interleaved within the first slot and the second slot.

Example embodiments provide a transport block processing chain for a transmitter that may include a code block determination circuit, a rate matching circuit, and an interleaver. The code block determination circuit may be configured to determine a size of a code block mapped across at least one slot boundary of a slot of the wireless physical shared channel. The rate matching circuit may be configured 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 wireless physical shared channel. The interleaver may be configured to interleave the code blocks across the slot boundaries between the first and second slots within the first and second slots based on successive outputs of the slot interleaving rate matching circuit. In one embodiment, the code block spanning a 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 is limited to a predetermined number of slots, and the interleaver may be further configured to interleave the output of the rate matching circuit across the predetermined number of slots. In another embodiment, the code block determination circuit may be further configured to determine a size of the code block mapped across the plurality of time slots of the wireless physical shared channel configured according to TBoMS, and the rate of the rate matching circuit may be further configured to match bits of the code block to a number of bits available in a transport block spanning the plurality of time slots of the wireless physical shared channel. In yet another embodiment, the plurality of time slots of the TBoMS configured wireless physical shared channel may be based at least in part on a predetermined number of code blocks, a maximum TBS set forth in a standard document, or a combination thereof.

A method for processing data to be mapped to transport blocks, the method may comprise: determining, by a code block determination circuit, a size of a data code block mapped across a plurality of time slots of a wireless physical shared channel configured according to TBoMS; and rate matching, by the rate matching circuit, bits of the code block to a number of bits available in a transport block spanning multiple slots of the wireless physical shared channel. In one embodiment, the plurality of time slots of the wireless physical shared channel configured according to TBoMS may be based at least in part on a legacy maximum TBS. In another embodiment, the plurality of time slots of the wireless physical shared channel configured according to the TBoMS may be based at least in part on a predetermined number of code blocks. In yet another embodiment, the predetermined number of code blocks may be based at least in part on a legacy maximum number of code blocks. In yet another embodiment, the plurality of time slots of the wireless physical shared channel configured according to TBoMS may be based at least in part on a maximum TBS set forth in a standards document. In one embodiment, the method may further include interleaving, by the interleaver, code blocks across slot boundaries between the first slot and the second slot within the first slot and the second slot based on the successive outputs of the slot interleaving rate matching circuit.

An example embodiment provides a method for processing data to be mapped to a transport block, wherein the method comprises: determining, by code block determination circuitry, a size of a data code block mapped across at least one slot boundary of a slot of a wireless physical shared channel; rate matching, by a rate matching circuit, bits of a code block to a number of bits available in a transport block spanning one or more time slots of a wireless physical shared channel; and interleaving, by the interleaver, code blocks across slot boundaries between the first slot and the second slot within the first slot and the second slot based on successive outputs of the slot interleaving rate matching circuit. In one embodiment, the method may further include segmenting, by the code block determination circuit, a code block that spans a slot boundary between the first slot and the second slot with a redundancy version corresponding to the second slot, and wherein an output of the rate matching circuit is limited to a predetermined number of slots, and wherein the method may further include interleaving, by the interleaver, the output of the rate matching circuit across the predetermined number of slots. In another embodiment, the method may further comprise: the method further includes determining, by the code block determination circuit, a size of a code block mapped across a plurality of time slots of the wireless physical shared channel configured according to the TBoMS, and rate matching, by the rate matching circuit, bits of the code block to a number of bits available in a transport block spanning the plurality of time slots of the wireless physical shared channel. In yet another embodiment, the plurality of time slots of the wireless physical shared channel configured according to TBoMS may be based at least in part on a predetermined number of code blocks, a maximum TBS set forth in a standard document, or a combination thereof

Drawings

In the following sections, aspects of the subject matter disclosed herein will be described with reference to exemplary embodiments shown in the drawings, in which:

fig. 1 depicts an example embodiment of a wireless communication network according to the subject matter disclosed herein;

fig. 2 depicts an example embodiment of a base station according to the subject matter disclosed herein;

FIG. 3 depicts an example embodiment of a user device according to the subject matter disclosed herein;

fig. 4A depicts an example embodiment of a downlink slot structure;

fig. 4B depicts an example embodiment of an uplink slot structure for physical uplink shared channel transmission or physical uplink control channel transmission;

FIG. 5A depicts a block diagram of an example embodiment of a transmitter structure using OFDM in accordance with the subject matter disclosed herein;

fig. 5B depicts a block diagram of an example embodiment of an OFDM receiver structure according to the subject matter disclosed herein;

fig. 6 shows a typical conventional processing flow in release 16 at the transmitter for the uplink and downlink of the physical shared channel;

fig. 7 depicts an example of physical and virtual resources that may be allocated to a UE in release 16;

fig. 8 depicts multiplexing of uplink control information on a physical uplink shared channel when scheduling resources overlap in Release 16 (Release 16);

fig. 9 shows some details of a codeword that may be transmitted across K slots depending on the size of a data block according to the subject matter disclosed herein;

fig. 10 illustrates an example scenario in which a data block B is small enough to fit within a single code block across a slot boundary according to the subject matter disclosed herein;

fig. 11 depicts an example scenario in which a relatively large data block B is suitable for two code blocks in accordance with the subject matter disclosed herein;

fig. 12 illustrates an example scenario in which a relatively very large data block B is suitable for many code blocks in accordance with the subject matter disclosed herein;

FIG. 13 depicts an example case when K does not divide P according to the subject matter disclosed herein;

fig. 14 depicts an example of a scenario in which resources available for a cross-slot mapped (mapped across slot) PUSCH transmission are non-contiguous in accordance with the subject matter disclosed herein;

fig. 15 depicts three positions where processing to cancel an indication may be performed in an operation of a transport block processing chain according to the subject matter disclosed herein;

16A-16E depict example scenarios in which a cancellation indication in one slot of an uplink cross-slot map transmission is received and processed by a transmitter according to the subject matter disclosed herein;

fig. 17A depicts an example cross-slot mapped transmission of two code block groups across three slots according to the subject matter disclosed herein;

fig. 17B depicts an example cross-slot map transmission of two code block groups across three slots with code block segmentation according to the subject matter disclosed herein;

fig. 18 depicts example operations of a transport block processing chain according to the subject matter disclosed herein;

fig. 19A depicts an example cross-slot mapped transmission of code blocks in two code block groups across three slots according to the subject matter disclosed herein;

fig. 19B depicts an example cross-slot map transmission of code blocks in two code block groups with segmentation across three slots according to the subject matter disclosed herein;

fig. 20 depicts configured grant periods in an example configured grant configuration that may include a set of regular transmission opportunities and cross-slot mapped transmission opportunities according to the subject matter disclosed herein;

FIG. 21A depicts an example case where the codeword length L is too small;

fig. 21B depicts an example scenario in which an additional redundancy version is added to a transport block in accordance with the subject matter disclosed herein;

22A and 22B depict example scenarios where fewer redundancy versions may be used in a transport block according to the subject matter disclosed herein;

fig. 23A and 23B depict an example continuous rate matching output and a corresponding interleaver output, respectively, of a code block known to cross a slot boundary between slots according to the subject matter disclosed herein;

fig. 24A and 24B depict an example segmented code block rate matching output with a new redundancy version and a corresponding interleaver output, respectively, according to the subject matter disclosed herein;

fig. 25A and 25B depict an example constrained continuous rate matching output and a corresponding constrained continuous interleaver output, respectively, of a code block according to the subject matter disclosed herein;

26A and 26B each independently depict an example continuous rate matching output and corresponding interleaver output across each time slot in accordance with the subject matter disclosed herein;

27A and 27B respectively depict an example segmented code block rate matching output with a new redundancy version and corresponding interleaver output independently across each time slot, in accordance with the subject matter disclosed herein;

28A and 28B depict an example rate matching output and corresponding interleaver output, respectively, in which systematic bits and parity bits are processed separately when determining the input to the interleaver for different time slots in accordance with the subject matter disclosed herein;

FIG. 29 illustrates an example of a rate matching output divided into a plurality of portions according to the subject matter disclosed herein;

fig. 30 depicts an example case where 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;

FIG. 31 depicts the example scenario of FIG. 30 from a timeline perspective;

fig. 32 depicts an example punctured (punctured) slot of a first embodiment of a rate matching and interleaver operation according to the subject matter disclosed herein;

fig. 33 depicts an example punctured slot of a first embodiment of rate matching and interleaver operation according to the subject matter disclosed herein;

fig. 34 depicts 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;

fig. 35 depicts an example of a rate matching output across each code block of a multi-slot PUSCH with three code blocks, RV3, and two slots of UCI multiplexing, according to the subject matter disclosed herein;

fig. 36 depicts an example of a rate matching output with two slots, three code blocks, RV3, and a multi-slot PUSCH with UCI multiplexing in accordance with the subject matter disclosed herein;

fig. 37 depicts an example of a rate matching output of a UCI multiplexed multi-slot PUSCH with two slots, three code blocks, RV3, and systematic bits with preserved code blocks in accordance with the subject matter disclosed herein;

fig. 38 depicts an example rate matching output across a four-slot PUSCH with three CBs with RV0 in accordance with the subject matter disclosed herein;

FIG. 39 depicts a rate matching output corresponding to FIG. 38, wherein the amount of available coded bits is reduced on average between affected bits, in accordance with the subject matter disclosed herein;

fig. 40 depicts a rate matching output corresponding to fig. 38, where the affected code blocks retain systematic bits, in accordance with the subject matter disclosed herein; and

fig. 41 depicts an alternative code block mapped to each code block of a slot if a transport block includes one or more code blocks in accordance with the subject matter disclosed herein.

Detailed Description

In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. However, it will be understood by those skilled in the art that the disclosed aspects may 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.

Reference in the 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 disclosed herein. Thus, appearances of the phrases "in one embodiment" or "in an embodiment" or "according to an embodiment" (or other phrases having similar meanings) in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In this regard, the word "exemplary" as used herein means "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. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. Furthermore, depending on the context of the discussion herein, singular terms may include the corresponding plural forms, and plural terms may include the corresponding singular forms. Similarly, hyphenated terms (e.g., "two-dimensional," "predetermined," "pixel-specific," etc.) may occasionally be used interchangeably with corresponding non-hyphenated versions (e.g., "two-dimensional," "predetermined," "pixel-specific," etc.), and capitalized entries (e.g., "counter clock," "row select," "PIXOUT," etc.) may be used interchangeably with corresponding non-capitalized versions (e.g., "counter clock," "row select," "PIXOUT," etc.). Such occasional interchangeable usage should not be considered inconsistent with one another.

Furthermore, depending on the context of the discussion herein, singular terms may include the corresponding plural forms, and plural terms may include the corresponding singular forms. It is further noted that the various figures (including component diagrams) shown and discussed herein are for illustrative purposes only and are not drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals have been repeated among the figures to indicate corresponding and/or analogous elements.

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, and/or components, and/or groups thereof.

It will be understood that when an element or layer is referred to as being "connected to" or "coupled to" other elements or layers, it can be directly connected, connected or coupled to the other elements or layers, or intervening elements or layers may be present. In contrast, when an element is referred to as being "directly on," "directly connected to," or "directly coupled to" other elements or layers, there are no intervening elements or layers present. Like numbers 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.

As used herein, the terms "first," "second," and the like are used as labels before the noun and do not imply any type of ordering (e.g., spatial, temporal, logical, etc.) unless explicitly defined as such. Furthermore, the same reference numbers may be used in two or more drawings to identify components, assemblies, blocks, circuits, units, or modules having the same or similar functionality. However, such use is for simplicity of illustration and ease of discussion only; it is not intended that the construction or architectural details of these components or units be the same in all embodiments or that these commonly referenced parts/modules are the only way to implement some example embodiments disclosed herein.

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.

As used herein, the term "module" refers to any combination of software, firmware, and/or hardware configured to provide the functionality described herein in connection with the module. For example, software may be embodied as a software package, code and/or instruction set or instructions, and the term "hardware" as used in any implementation described herein may include, for example, singly or in any combination, components, hardwired circuitry, programmable circuitry, state machine circuitry, and/or firmware that stores instructions executed by programmable circuitry. These modules may be collectively or individually embodied as circuitry forming part of a larger system, such as, but not limited to, an Integrated Circuit (IC), a system-on-a-chip (SoC), a component, and the like.

Fig. 1-40, along with the various embodiments used to illustrate the subject matter disclosed 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 appreciated that the subject matter disclosed herein may be implemented in any suitably arranged system or apparatus.

At least the following documents are hereby incorporated by reference into the present disclosure as if fully set forth herein: 3GPP TS38.211v15.6.0, "NR; physical channel and modulation ";3GPP TS 38.212v15.6.0, "NR; multiplexing and channel coding ";3GPP TS 38.213v15.6.0, "NR; controlled physical layer processes ";3GPP TS 38.214v15.6.0, "NR; physical layer process of data ";3GPP TS 38.321v15.6.0, "NR; medium Access Control (MAC) protocol specification "; and 3GPP TS 38.331v15.6.0, "NR; radio Resource Control (RRC) protocol specification. "

Fig. 1-5 depict various example embodiments implemented in a wireless communication system and the use of Orthogonal Frequency Division Multiplexing (OFDM) or Orthogonal Frequency Division Multiple Access (OFDMA) communication techniques. The descriptions of fig. 1-3 are not meant to imply physical or architectural limitations to the implementation of different embodiments. Various embodiments of the subject matter disclosed herein may be implemented in any suitably arranged communication system.

Fig. 1 depicts an example embodiment of a wireless communication network 100 according to the subject matter disclosed herein. The exemplary embodiment of the wireless network depicted in fig. 1 is for illustration only. Other embodiments of wireless network 100 may be used without departing from the principles of the subject matter disclosed herein.

As shown in fig. 1, wireless network 100 includes a gNB101 (e.g., a base station BS), a gNB 102, and a gNB 103.gNB 101 may communicate with gNB 102 and gNB 103. The gNB101 may also communicate with at least one network 130, such as the internet, a proprietary Internet Protocol (IP) network, or other data network.

gNB 102 may provide wireless broadband access to network 130 for a first plurality of UEs within coverage area 120 of gNB 102. The first plurality of UEs may include: UE 111, which may be located in Small Business (SB); UE 112, which may be located in enterprise I; UE 113, which may be located in a WiFi Hotspot (HS); UE 114, which may be located in a first residence I; a UE 115, which may be located in a second residence I; and a UE 116, which may be a mobile device (M) such as, but not limited to, a mobile phone, a wireless laptop, a wireless PDA, and the like. gNB 103 may provide wireless broadband access to network 130 for a second plurality of UEs within coverage area 125 of gNB 103. The second plurality of UEs may include UE 115 and UE 116. In some embodiments, one or more of the gNBs 101-103 may communicate with each other and with UEs 111-116 using 5G/NR, LTE-A, wiMAX, wiFi, and/or other wireless communication technologies.

Depending on the network type, the term "base station" or "BS" may refer to any component (or collection of components) configured to provide wireless Access to a network, such as a Transmit Point (TP), a 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 device. The base station may provide wireless Access according to one or more wireless communication protocols (e.g., 5G/NR3GPP new air 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 convenience, the terms "BS" and "TRP" are used interchangeably herein to refer to network infrastructure components that provide wireless access to a remote terminal. Furthermore, the term "user equipment" or "UE" may refer to any component, such as a "mobile station," "subscriber station," "remote terminal," "wireless terminal," "reception point," or "user device," depending on the type of network. For convenience, the terms "user equipment" and "UE" are used herein to refer to a remote wireless device that wirelessly accesses a base station, whether the UE is a mobile device (such as, but not limited to, a mobile phone or smartphone) or is generally considered a stationary device (such as, but not limited to, a desktop computer or vending machine).

The dashed lines illustrate the general extent of

coverage areas

120 and 125, which are shown as being generally circular for purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with the gnbs (such as coverage areas 120 and 125) may have other shapes, including irregular shapes, depending on the configuration of the gNB and the changes in the radio environment associated with natural and man-made obstructions.

As described in more detail below, one or more of 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 gnbs 101-gNB 103 include circuitry, programming, or a combination thereof for efficient control signaling designed to improve resource utilization.

Although fig. 1 depicts one example of a wireless network, various changes may be made to fig. 1. For example, a wireless network may include any number of gnbs and any number of UEs in any suitable arrangement. Further, the gNB101 may communicate directly with any number of UEs and provide these UEs with wireless broadband access to the network 130. Similarly, each of gnbs 102-gNB 103 may communicate directly with network 130 and provide UEs with direct wireless broadband access to network 130. Further, gNB101, gNB 102, and/or gNB 103 may provide access to other or additional external networks, such as an external telephone network or other types of data networks.

Fig. 2 depicts an example embodiment of a gNB 102 according to the subject matter disclosed herein. The embodiment of gNB 102 depicted in fig. 2 is for illustration only, and gNB101 and gNB 103 of fig. 1 may have the same or similar configuration. However, the gNB has a wide variety of configurations, and fig. 2 does not limit the scope of the subject matter disclosed herein to any particular implementation of the gNB.

As shown in fig. 2, the gNB 102 includes a plurality of antennas 201a-201n, a plurality of 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.

The RF transceivers 202a-202n may receive incoming RF signals from the antennas 201a-201 n. The received RF signal may be a signal transmitted by a UE in the network 100. RF transceivers 202a-202n may down-convert the incoming RF signals to generate IF or baseband signals. The IF or baseband signal may be passed to RX processing circuitry 203 that generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal. RX processing circuitry 203 sends the processed baseband signal to controller/processor 255 for further processing.

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

Controller/processor 205 may include one or more processors or other processing devices that may control the overall operation of gNB 102. For example, the controller/processor 205 may 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 may also support additional functions, such as more advanced wireless communication functions. For example, the controller/processor 205 may support beamforming or directional routing operations in which outgoing signals from multiple antennas 201a-201n are weighted differently to effectively steer the outgoing signals in a desired direction. Any of a wide variety of other functions may be supported in the gNB 102 by controller/processor 205.

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 may move data into and out of a memory 206, which may be coupled to the controller/processor 205, as needed to perform a process. A portion of the memory 206 may include Random Access Memory (RAM) and another portion of the memory 206 may include flash memory or other Read Only Memory (ROM).

The controller/processor 205 is also coupled to a backhaul or network interface 207. Backhaul or network interface 207 may allow gNB 102 to communicate with other devices or systems over a backhaul connection or over a network. The interface 207 may support communication over any suitable wired or wireless connection(s). For example, when gNB 102 is implemented as part of a cellular communication system (such as a system supporting 5G, LTE or LTE-a), interface 207 may allow gNB 102 to communicate with other gnbs over wired or wireless backhaul connections. When gNB 102 is implemented as an access point, interface 207 may allow gNB 102 to communicate over a wired or wireless local area network or over a wired or wireless connection to a larger network, such as the internet. The interface 207 may include any suitable structure that supports communication over a wired or wireless connection, such as an ethernet or RF transceiver.

Although fig. 2 depicts one example of a gNB 102, various changes may be made to fig. 2. For example, the gNB 102 may include any number of each of the components shown in fig. 2. As a particular example, an access point may include multiple interfaces 207 and the controller/processor 205 may support routing functions to route data between different network addresses. As another particular example, although shown as including a single instance of TX processing circuitry 204 and a single instance of RX processing circuitry 203, gNB 102 may include multiple instances of each (such as one per RF transceiver). In addition, various components in FIG. 2 may be combined, further subdivided, or omitted, and additional components may be added according to particular needs.

Fig. 3 depicts an example embodiment of a UE 116 according to the subject matter disclosed herein. The embodiment of UE 116 depicted in fig. 3 is for illustration only, and UE 111-UE 115 of fig. 1 may have the same or similar configuration. However, UEs have a wide variety of configurations, and fig. 3 does not limit the scope of the disclosure to any particular implementation of a UE.

As shown in fig. 3, the UE 116 includes an antenna 301, an RF transceiver 302, TX processing circuitry 303, a microphone 304, and Receive (RX) processing circuitry 305. The UE 116 may also include a speaker 360, a processor 307, an Input/Output (I/O) InterFace (InterFace, IF) 308, a touch screen 309, a display 310, and a memory 311. The memory 311 may include an OS 312 and one or more applications 313.

RF transceiver 302 receives incoming RF signals from antenna 301 that are transmitted by the gNB of network 100. RF transceiver 302 downconverts the incoming RF signal to generate an Intermediate Frequency (IF) or baseband signal. The IF or baseband signal is passed to RX processing circuitry 305 that generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal. The RX processing circuit 305 sends the processed baseband signal to the speaker 360 (such as for voice data) or the processor 307 for further processing (such as for web browsing data).

TX processing circuitry 303 may receive analog or digital voice data from microphone 304 or other outgoing baseband data (such as network data, email, or interactive video game data) from processor 307. TX processing circuitry 303 encodes, multiplexes, and/or digitizes the outgoing baseband data to generate a processed baseband or IF signal. RF transceiver 302 receives the outgoing processed baseband or IF signal from TX processing circuitry 303 and upconverts the baseband or IF signal to an RF signal, which is transmitted via antenna 301.

Processor 307 may include one or more processors or other processing devices and executes OS 312 stored in memory 311 to control overall operation of UE 116. For example, processor 307 may control the reception of forward channel signals and the transmission of reverse channel signals by RF transceiver 302, TX processing circuitry 303, and RX processing circuitry 305 in accordance with well-known principles. In some embodiments, processor 307 comprises at least one microprocessor or microcontroller.

Processor 307 is also capable of executing other processes and programs resident in memory 311, such as processes for beam management. Processor 307 may move data into or out of memory 311 as needed for the execution process. In some embodiments, processor 307 is configured to execute application 313 based on OS 312 or in response to a signal received from the gNB or operator. The processor 307 is also coupled to an I/O interface 308 that provides the UE 116 with the ability to connect to other devices, such as portable computers and handheld computers. I/O interface 308 is the communication path between these accessories and processor 307.

The processor 307 may also be coupled to a touch screen 309 and a display 310. The operator of the UE 116 may input data into the UE 116 using the touch screen 309. The display 310 may be a liquid crystal display, a light emitting diode display, or other display capable of presenting text (such as from a website) and/or at least limited graphics.

A memory 311 may be coupled to the processor 307. One portion of memory 311 may include RAM and another portion of memory 311 may include flash memory or other ROM.

Although fig. 3 shows one example of the UE 116, various changes may be made to fig. 3. For example, various components in FIG. 3 may be combined, further subdivided, or omitted, and additional components may be added according to particular needs. As a particular example, processor 340 may be divided into multiple processors, such as one or more Central Processing Units (CPUs) and one or more Graphics Processing Units (GPUs). Further, while fig. 3 shows the UE 116 configured as a mobile phone or smartphone, the UE may be configured to operate as other types of mobile or stationary devices.

To meet the increasing demand for wireless data traffic since the deployment of 4G communication systems, efforts have been made to develop improved 5G/NR or pre-5G/NR communication systems. Thus, a 5G/NR or pre-5G/NR communication system is also referred to as a "super 4G network" or a "post-LTE system". 5G/NR communication systems may be considered to be implemented in a higher frequency (mmWave) band (e.g., 28GHz or 60GHz band or generally higher than 6GHz band) in order to achieve higher data rates or lower frequency bands (such as lower than 6GHz band) for robust coverage and mobility support. In order to reduce propagation loss of radio waves and increase transmission distance, beamforming, massive Multiple-Input Multiple-Output (MIMO), full-Dimensional MIMO (FD-MIMO), array antenna, analog beamforming, and massive antenna techniques are discussed in the 5G communication system. In addition, in the 5G communication system, development of improvement of a system Network is proceeding based on an advanced small cell, a cloud Access Network (RAN), an ultra-dense Network, device-to-Device (D2D) communication, a wireless backhaul, a mobile Network, cooperative communication, coordinated Multi-point (CoMP), reception end interference cancellation, and the like. .

A communication system may include a Downlink (DL), which refers to transmission from a base station or one or more transmission points to a UE, and an uplink, which refers to transmission from a UE to a base station or one or more reception points.

A unit for DL signaling or UL signaling on a cell may be referred to as a slot and may include one or more symbols. Symbols may also be used as additional time units. A frequency (or Bandwidth (BW)) unit may be referred to as a Resource Block (RB). One RB may include a plurality of Subcarriers (SCs). For example, a slot may have a duration of 0.5 milliseconds or 1 millisecond, including 14 symbols, and an RB may include 12 SCs spaced 30KHz or 15KHz apart, respectively. One RB in frequency and a unit of one symbol in time may be referred to as a Physical RB (PRB).

The DL signal may include a data signal conveying information content, a control signal conveying DL Control Information (DCI), and a Reference Signal (RS), which may also be referred to as a pilot signal. The gNB transmits data information or DCI through a respective Physical DL Shared Channel (PDSCH) or physical DL control channel (pdcch). The PDSCH or PDCCH may be transmitted through a variable number of slot symbols including one slot symbol. For simplicity, the DCI format scheduling PDSCH reception of a UE may be referred to as a dl DCI format, and the DCI format scheduling PUSCH transmission from a UE is referred to as a UL DCI format.

The gNB may transmit one or more of a plurality of types of RSs, including channel state information RS (CSI-RS) and demodulation RS (DM-RS). The CSI-RS may be used primarily for the UE to perform measurements and provide Channel State Information (CSI) to the gNB. For channel measurement, non-zero power CSI-RS (NZP CSI-RS) resources may be used. For Interference Measurement Report (IMR), a CSI interference measurement (CSI-IM) resource may be used. The CSI process may include NZP CSI-RS and CSI-IM resources.

The UE may determine the CSI-RS transmission parameters through DL control signaling or higher layer signaling from the gNB, such as Radio Resource Control (RRC) signaling. The transmission instance of the CSI-RS may be indicated by DL control signaling or configured by higher layer signaling. The DM-RS may be generally transmitted only within a BW of each PDCCH or PDSCH, and the UE may demodulate data or control information using the DM-RS.

Fig. 4A depicts an example embodiment of a DL slot structure 400 according to the subject matter disclosed herein. The exemplary embodiment of the DL slot structure 400 depicted in fig. 4A is for illustration only. Fig. 4 does not limit the scope of the subject matter disclosed herein to any particular implementation. It should be noted that in the DL slot structure 400 described below, DCI information need not be located as shown in fig. 4A and may be located elsewhere as appropriate.

As shown in FIG. 4A, DL slot 401 may include

The individual symbols 402, gNB may have transmitted therein, for example, data information, DCI, or DM-RS. The DL system BW may include

And (4) one RB. Each RB may include

And (6) SC. UE is assigned M _PDSCH One RB for total

SC 403 for PDSCH transmission BW. The PDCCH conveying the DCI may be transmitted over Control Channel Elements (CCEs) spread over substantially the DL system BW. The first slot symbol 404 may be used by the gNB for transmitting PDCCH. The second slot symbol 405 may be used by the gNB for transmitting PDCCH or PDSCH. The remaining slot symbols 406 may be used by the gNB for transmitting PDSCH and CSI-RS. In some time slots, the gNB may also transmit synchronization signals and channels that transmit system information, such as synchronization signals and primary broadcast channel (SS/PBCH) blocks.

The UL signals may also include data signals conveying informational content, control signals conveying UL Control Information (UCI), DM-RS associated with data or UCI demodulation, sounding RS (SRS) enabling the gNB to perform UL channel measurements, and Random Access (RA) preamble enabling the UE to perform random access. The UE may transmit data information or UCI through a corresponding Physical UL Shared Channel (PUSCH) or Physical UL Control Channel (PUCCH). The PUSCH or PUCCH may be transmitted through a variable number of symbols in a slot including one symbol. When the UE simultaneously transmits data information and UCI, the UE may multiplex both in the PUSCH.

The UCI may 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 PDSCH; a Scheduling Request (SR) indicates whether the UE has data in a buffer to the UE; and CSI reporting enables the gNB to select appropriate parameters for PDSCH or PDCCH transmission to the UE.

The CSI report from the UE may include: a Channel Quality Indicator (CQI) informing the gNB of a maximum Modulation and Coding Scheme (MCS) for the UE to detect TBs with a predetermined block error rate (BLER), such as 10%; precoding Matrix Indicators (PMIs) that inform 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 CSI-RS resources associated with the CSI report; and a Rank Indicator (RI) indicating a transmission rank of the PDSCH.

The UL RS may include a DM-RS and an SRS. DM-RS can typically only be transmitted within the BW of the corresponding PUSCH or PUCCH transmission. The gNB may demodulate information in a corresponding PUSCH or PUCCH using the DM-RS. SRS may be transmitted by the UE to provide UL CSI to the gNB, and for TDD systems SRS transmission may also provide PMI for DL transmissions. In addition, the UE may transmit a Physical Random Access Channel (PRACH) in order to establish synchronization or an initial higher layer connection with the gNB.

Fig. 4B depicts an example embodiment of a UL slot structure 410 for PUSCH transmission or PUCCH transmission according to the subject matter disclosed herein. The embodiment of the UL slot structure 410 depicted in fig. 4B is for illustration only. Fig. 4B does not limit the scope of the subject matter disclosed herein to any particular implementation. It should be noted that in the UL slot structure 410 described below, UCI information need not be located as shown in fig. 4B, and may be located elsewhere as appropriate.

As shown in FIG. 4B, time slot 411 may include

The individual symbols 412, gNB may have transmitted therein, for example, data information, DCI, or DM-RS. The UL system BW may include N RBs. Each RB may include

Total for PUSCH transmission BW ("X" = "S") or for PUCCH transmission BW ("X" = "C

The SC 413 allocates M for the UE _PUXCH And (4) one RB. For example, SRS transmissions 414 or short PUCCH transmissions from one or more UEs may be multiplexed using the last symbol or symbols of the slot.

Fig. 5A depicts a block diagram of an example embodiment of a transmitter architecture 501 using OFDM in accordance with the subject matter disclosed herein. The embodiment of the transmitter structure 501 depicted in fig. 5A is for illustration only, and actual implementations may have the same or similar configurations. Fig. 5A does not limit the scope of the subject matter disclosed herein to any particular implementation.

As shown in fig. 5A, information bits, such as DCI bits or data information bits 502, may be encoded by an encoder module 503, rate-matched by a rate matcher module 504 on the allocated time/frequency resources, and modulated by a modulator module 505. The modulated coded symbols and DM-RS or CSI-RS module 506 may then be mapped to SCs by SC mapping module 507 controlled by transmission bandwidth module 508. An Inverse Fast Fourier Transform (IFFT) may be performed by the filter module 509. A Cyclic Prefix (CP) may be added to the output of the filter module 509. The resulting signal (deactivating signal) may be a signal 512 filtered by a Common Interface Unit (CIU) filter module 510 and sent as a transmission by an RF module 511.

Fig. 5B depicts a block diagram of an example embodiment of an OFDM receiver structure 531 according to the subject matter disclosed herein. The embodiment of the receiver structure 531 depicted in fig. 5B is for illustration only, and actual implementations may have the same or similar configurations. Fig. 5B does not limit the scope of the subject matter disclosed herein to any particular implementation. As shown in fig. 5B, the received signal 532 may be filtered by a filter module 533. The CP removal module 534 may remove the cyclic prefix. The filter module 535 may apply a Fast Fourier Transform (FFT). The SC demapping module 536 may demap the SCs of BW selected by the selector module 537. The received symbols may be demodulated by a channel estimator and demodulator block 538. The rate matcher module 539 may recover the rate matching and the decoder module 540 may decode the resulting bits to provide data information bits 541.DL transmission and UL transmission may be based on Orthogonal Frequency Division Multiplexing (OFDM) waveforms that include a variant prior to using a DFT called DFT-spread OFDM (DFT-spread-OFDM).

As previously described, the purpose of the 3GPP Rel-17 SID on a Carrier (RedCap) NR device is to support the same set of use cases in FR2 as in FR 1. Beam refinement may be a key feature of FR2 operation in NR. An important issue relates to enabling the beam refinement procedure for a reccap UE in an RRC _ INACTIVE state (also referred to herein as an RRC INACTIVE state or INACTIVE mode). Thus, the subject matter disclosed herein provides a set of beam refinement procedures to enable a reccap in inactive mode transmission in FR 2.

Fig. 6 shows a typical legacy process flow 600 in Rel-16 at the transmitter for uplink and downlink of a physical shared channel (PUSCH/PDSCH). At 601, the allocation may be in the form of resources in a single time slot corresponding to the transmission of one physical shared channel transmission. The allocation may be in the form of resources in a plurality of time slots, in which case the allocation corresponds to transmission of a physical shared channel with repetitions (e.g., type a or type B repetitions). The resources may be indicated to the transmitter dynamically (e.g., via DCI) or semi-statically (e.g., through the process of CG PUSCH transmission). The resources may include a set of OFDM symbols and a set of subcarriers and additional configurations for physical shared channel transmission. The set of OFDM symbols may be contiguous or non-contiguous in time. The OFDM symbols may also be indicated in the form of a set of symbols in one or more slots. The set of subcarriers may be a contiguous or non-contiguous set of subcarriers and may be indicated in the form of resource blocks or subsets of resource blocks. The combination of OFDM symbols and subcarriers corresponds to the resource elements carrying the coded bits of PUSCH.

Most physical shared channel processing may involve mainly virtual resources and time slots except at the end of the process sequence 600 at the mapping process 607. Resources may be grouped into physical resources and virtual resources. The physical resource may be a resource corresponding to an actual time/frequency resource used by the transmitter for RF transmission of a signal corresponding to the physical shared channel. The virtual resources may be resources used by the transmitter in generating coded bits and modulation symbols corresponding to the physical shared channel. As used herein, references to "slots," "symbols," or "resources" indicate virtual versions of these terms. Such references herein are to physical terms only if the term "physical" is explicitly appended.

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 (TB) and Code Blocks (CB) are determined. At 604, low Density Parity Check (LDPC) encoding is performed on different code blocks that may form a transport block. At 605, the output codeword for each code block is Rate Matched (RM) to a number of available code bits for transmitting the code block in a physical shared channel. At 606, the interleaver maps the rate matched output onto modulation 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.

When Rel-16 physical shared channels are scheduled with repetition/aggregation, process 600 may essentially repeat, with some differences for each repetition. For example, each repetition may be used to transmit the same TB; and in each repetition, a different Redundancy Version (RV) index may be used, which may change the RM output of each repetition.

Fig. 7 depicts an example of physical and virtual resources that may be allocated to a UE in Rel-16. In fig. 7, time resources have been allocated as three (3) UL slots 701a-701c for PUSCH transmission. In each slot, there are six (6) consecutive allocated OFDM symbols starting from the second symbol (symbol number 2) in the slot. According to a Time Division Duplex (TDD) configuration, UL slots may be allocated as contiguous, non-contiguous, or a combination of contiguous and non-contiguous slots. In the example of FIG. 7, if it is assumed that the TDD configuration results in a mode DDSUU (S: 10D, 4U), the TDD configuration corresponds to the UEs of the allocated physical slots 701a-701c.

When performing the procedures involved in PUSCH in Rel-16, the UE may use virtual allocations 702a-702c in fig. 7 corresponding to three consecutive UL slots 701a-701c, respectively. Thus, a mapping 703 exists between virtual resources 702a-702c and physical resources 701a-701c, as shown in FIG. 7.

Determination of TBS and maximum data Rate

In Rel-16, the TBS of a transport block may be determined using equation (1) below,

N _info ＝ν*Q*r*N _RE (1)

where v is the number of layers used for physical shared channel transmission, Q and r are the modulation order and coding rate, respectively, specified by the Modulation and Coding Scheme (MCS) index, and N _RE Is the total number of resources available in the scheduled time slot. TBS approximately equal to N _info Wherein TBS and N _info The difference in size between is related to the added Cyclic Redundancy Code (CRC), the code block segmentation and the limited allowable TBS values in the specification.

For PUSCH (TS 38.214 section 6.1.4.2):

for PDSCH (TS 38.214 section 5.1.3.2):

the new air interface (NR) standard specifies the maximum data rate that can be achieved (attached) given a particular UE capability. The following text of specification 38.306 specifies the procedure for calculating the maximum data rate.

The following example rate matching and interleaving procedure applied to PUSCH is described in 3gpp TS 38.212.

For slot aggregation, rel-16 follows table 6.1.2.1-2 to determine the Redundancy Version (RV) index of the Registration Management (RM) output for each slot.

TDD configurations

In Rel-16, the network may provide the UE with a set of configurations (semi-statically, e.g., radio Resource Control (RRC), or dynamically both) indicating specific configurations of UL slots and resources, which indicate possible transmission directions on these slots and resources. The configuration of resources may be referred to as TDD configuration.

In a TDD configuration, each OFDM Symbol (OS) in the UL frame structure may have one of three possible indications: uplink (UL), downlink (DL), or Flexible (F). If the OS has an indication of UL or DL, the possible transmission directions on the symbol may be only UL or DL, respectively, while the indication of F provides for both directions of transmission on the OS, with the actual transmission depending on other factors, such as the scheduling type of the transmission.

The TDD configuration may be set in a semi-static manner. That is, the UE may be provided with an RRC configuration indicating a specific slot structure that repeats with a configured period. The slot structure may span one or more slots and may provide configurations of UL/DL/F indications for the OS in those slots. The semi-static TDD configuration may be a common configuration for all UEs in the cell or a dedicated configuration for each UE. When there are both public and private TDD configurations, the role of the private configuration may be to cover only the indication of the OS indicated as F in the public configuration. In such a case, the overall indication of the OS of the UE will 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, then 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, then DL is indicated. F is indicated if both the common and dedicated TDD configurations provide an F indication.

Dynamic TDD configurations may also be provided to the UE. The dynamic TDD configuration may be referred to as Slot Format Indication (SFI). Providing dynamic TDD configuration may be performed by first configuring the UE with an indication that the UE should monitor DCI format 2_0 carrying the SFI field. The SFI field indicates one UL/DL/F configuration for one or more slots. The UL/DL/F configuration is intended to cover the OS indications in those time slots where the semi-static indication is F. Thus, if the UE is configured to monitor the SFI, the overall indication of the UE's OS will be specified as follows. If the semi-static indication is 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 semi-static and dynamic TDD configurations are indicated as F, F is indicated.

The actual transmission in the OS may 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 transmissions, PUSCH UL transmissions may be cancelled due to a collision with the TDD configuration of the OS allocated to the PUSCH.

Cancellation indication

For the cancel indication in Rel-16, the network may provide the UE with a dynamic indication to cancel/prohibit UL transmission in certain resources. The network may choose to perform cancellation of UL transmissions for some UEs to free up corresponding resources for other transmissions (e.g., data transmissions with low latency requirements). The UE may receive the cancellation indication via DCI format 2_4, DCI format 2_4 includes an indication of the time/frequency resources that the UE should cancel/avoid UL transmission.

UL transmission overlap

With respect to the overlap of UL transmissions in Rel-16, a UE may encounter a situation where multiple UL signals may be scheduled in resources that overlap in time and/or frequency. In such a case, the UE may have to handle the situation by transmitting all signals simultaneously, multiplexing information of one UL transmission onto other UL transmissions, and/or canceling transmission of one or more UL transmissions.

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

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

Overlap between dynamically scheduled DL signals and higher layer scheduled UL signals

In Rel-16, a UE may be scheduled to transmit UL signals dynamically (e.g., through scheduling DCI received from the gNB) or via higher layers (e.g., through configured grant type 1 or 2). Within the unpaired spectrum, the situation may then occur when the UE may be instructed by higher layers to transmit PUSCH and then receive dynamic scheduling of DL signals (such as PDSCH or CSI-RS). In the case of Rel-16, the UE discards the UL transmission based on a specific timeline that allows the UE to process DL reception requests. The following text in the specification describes such operations. Thus, dynamically scheduled PDSCH and/or CSI-RS may be a source of cancellation for some UL PUSCH.

In Rel-16, a UE may be scheduled to receive DL signals dynamically (e.g., through scheduling DCI received from the gNB) or via higher layers (e.g., through semi-persistent scheduling). Within the unpaired spectrum, the situation may then arise when the UE may be instructed by higher layers to receive PDSCH and then receive dynamic scheduling of UL signals, such as PUSCH, PUCCH, SRS-RS or PRACH. Rel-16 in such a case instructs the UE to continue UL transmission and cancel the DL reception request. The following text in the specification describes this operation. Thus, dynamically scheduled UL signals may be a source of cancellation for some DL-PDSCHs.

UCI multiplexing on PUSCH

Fig. 8 depicts a UE multiplexing Uplink Control Information (UCI) on PUSCH when scheduled resources overlap, which is allowed in Rel-16. As shown in fig. 8, UCI carrying DL HARQ feedback may be scheduled in overlapping resources using PUSCH and multiplexed on PUSCH, e.g., at 801. Rel-16 specifies the timeline 1 and timeline 2 constraints between different signals when PUCCH and PUSCH are multiplexed. Time line 2 represents the minimum time between all scheduled PDSCHs multiplexed with HARQ feedback, and the resources of the multiplexed signal. The following is from TS 38.213.

Time line 2 in fig. 8 may explain decoding time required to decode PDSCH and determine HARQ feedback values to be multiplexed. Timeline 1 in fig. 8 is the minimum duration between all DCI involved in scheduling PUCCH and/or PUSCH signals to be multiplexed and the scheduled resources themselves. The following is from TS 38.214.

Time line 1 in fig. 8 illustrates the duration for preparing the PUSCH signal and may be specified between the first symbol of the overlapping resources and each DCI of any signal involved in the scheduling multiplexing case. This may ensure that the UE is aware of the multiplexed signal early enough to prepare the corresponding PUSCH. It should be noted that the UE may technically continue to prepare PUSCH by determining a TBS based on allocated PUSCH resources, establishing code blocks, and performing encoding (as shown in fig. 6) without knowing that the multiplexing effect has not yet occurred. However, determining the RM output should not be performed until the effect of the multiplexing is known. Thus, timeline 2 may be considered to be intended to allow sufficient time to process RM output rather than the entire PUSCH preparation time.

When UCI multiplexing is processed with PUSCH with repeated scheduling, there seems to be no difference between different PUSCHs in the repetition; that is,

timelines

1 and 2 in fig. 8 remain unchanged considering that the actual PUSCH is affected by multiplexing.

UE capability

Another aspect of Rel-16 NR is the ability to perform Carrier Aggregation (CA). In CA, a UE can use multiple Component Carriers (CCs) for transmission, allowing the UE to utilize a larger bandwidth than is possible using a single component carrier. Rel-16 NR allows multiple carrier aggregation modes including in-band frequency aggregation with contiguous component carriers, in-band frequency aggregation with non-contiguous component carriers; and inter-band frequency aggregation with non-contiguous component carriers.

The classification of the CA pattern may depend on the set of frequency bands that includes the component carriers used. The set of frequency bands may be referred to as a band combination. In NR, carrier aggregation is applied across cells. The UE is initially connected to one Cell in CA, which is called Primary Cell (PCell). The UE then discovers and connects to multiple other cells in CA, called Secondary cells (scells). The UEs in CA can use each cell to transmit and receive different combinations of signals. For example, a UE may transmit/receive PUSCH on one cell and Sounding Reference Signal (SRS) signals on another cell.

However, the standard specifies certain timeline rules and conditions for simultaneous transmission/reception of signals in CA. Even with timeline rules and requirements, the standard does not require that each NR connected UE be able to perform such simultaneous use of component carriers in CA. In fact, the UE may have the ability to perform certain transmit/receive tasks in the CA, but not other tasks.

Another factor affecting the UE capability is whether Frequency Division Duplex (FDD) or Time Division Duplex (TDD) is assumed. The UE may or may not perform the same task on the FDD band/band combination, while the UE may or may not perform the same task on the TDD band/band combination. To fully utilize the capabilities of the UE and better optimize the use of the network, the capabilities of the UE may be notified to the gNB when the gNB schedules the transmission/reception of the UE in the network, and then taken into account.

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

The UE may report its capabilities to perform a particular task in any scenario, in which case the UE reports its capabilities on a per UE basis. The UE may report its capabilities to perform certain tasks in certain frequency bands, in which case the UE reports its capabilities on a per-band basis. The UE may report its capability to perform a specific task in a specific band combination in the CA, in which case the UE reports its capability on a per band combination or per BC basis. The UE may report its capability to perform certain tasks in the CA in certain situations, i.e. not necessarily always for a given band combination. In such cases, a mechanism called feature set may be used to allow such flexibility in reporting, in which case the UE reports its capabilities on a per feature set or per FS basis. Other methods of reporting UE capabilities are also possible.

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

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 may be governed by the UE capabilities for the particular band combination used in CA (govern).

The following specific rules apply to version-15. In the case of intra-band carrier aggregation or inter-band CA band-band combining, which does not allow simultaneous SRS and PUCCH/PUSCH transmissions, the UE is not expected to be configured with SRS from a carrier and PUSCH/ULDM-RS/UL PT-RS/PUCCH formats from a different carrier in the same symbol. In case of intra-band CA or inter-band CA band combinations, which do not allow simultaneous SRS and PRACH transmission, the UE shall not transmit SRS resources from a carrier and PRACH from different carriers simultaneously. In the case of inter-band carrier aggregation, the UE may transmit SRS and PUCCH/PUSCH simultaneously across component carriers in different bands according to the capability of the UE. In the case of inter-band carrier aggregation, the UE may transmit PRACH and SRS simultaneously across component carriers in different bands according to the UE's capabilities.

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

TABLE 1

Cross-slot Mapping (Mapping Across Slots, MAS)

The subject matter of the present disclosure provides a cross-slot Mapping (MAS) processing technique for transport blocks that may be used by a transmitter (UE or gNB) in a wireless network, such as a 5G wireless network. The MAS processes resources across K slots, maps TBs of size B, and the transmitter continuously transmits one transmission conveying a TB of size B across K-1 slot boundaries. In one embodiment, the TBS determination for the MAS process sets the coding rate equal to r, the available resources correspond to K slots, and the resulting TBS is B. The MAS processing may be performed by a TB processing chain similar to that depicted in fig. 6, but modified as described herein in relation to fig. 9-40. A TB processing chain that provides MAS processing for transport blocks may include circuitry and/or modules that perform functions related to MAS processing. That is, the functions associated with TBS determination, TB selection and CB determination, coding, rate matching, interleaving, and mapping from virtual resources to physical resources may be performed by one or more circuits and/or one or more modules.

Fig. 9 shows some details of a codeword that may be transmitted across K slots depending on the size of data block B according to the subject matter disclosed herein. If the number of Code blocks is P, the number of Code blocks belonging to one CBG is P/Q for each of Q Code Block Groups (CBGs). The condition for a code block not to cross a slot boundary is that P divides K (K divideP). For MAS processing as disclosed herein, if the number of information bits is B and the target rate is r, the total number of coded bits is B/r, which can be allocated REs across K slots. The code block size and the number of code blocks are B/P and P, respectively. The number of coded bits per code block is B/(r × P). When code blocks cross slot boundaries, the MAS technique may provide a greater opportunity for code blocks that cross slot boundaries to maintain sudden degradation of channel quality in certain slots.

Fig. 10 illustrates a single code block CB in which a data block B is small enough to fit across a slot boundary according to the subject matter disclosed herein ₁ Example scenario 1000. Using a multi-slot TBS (M-TBS) determination procedure, a code block CB1 may be mapped to a single transport block 1001 across slots such that, in the example of fig. 10, one code block 1001 spans two consecutive slots (e.g., slots 1002 and 1003). Rate matching may be used to allow code block CB1 to exist on both slots 1002 and 1003 (e.g., crossing slot boundary 1004).

Fig. 11 depicts an example scenario 1100 in which a relatively large data block B is suitable for two code blocks CB1 and CB2 according to 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 d slots (e.g., slots 1102 and 1103). The transport block 1101 crosses the slot boundary 1104 between slots 1102 and 1103.

Fig. 12 illustrates a block diagram in which a relatively very large data block B is suitable for many code blocks CB according to the subject matter disclosed herein ₁ -CB _P Example scenario 1200.P code blocks CB ₁ -CB _P Is mapped into a single transport block 1201, which transport block 1201 spans (in this example) three consecutive slots 1202-1204. The transport block 1201 crosses

slot boundaries

1205 and 1206.

Fig. 13 depicts an example scenario 1300 when P divides by K according to the subject matter disclosed herein. In FIG. 13, the MAS selects code blocks CB that are mapped to a single transport block 1301 across three consecutive slots 1302-1304 ₁ -CB ₄ . MAS allows the use of longer RM outputs for the transmission of code blocks CB in one transport block ₁ -CB ₄ All data bits. When CBG is enabled, retransmission of MAS transmissions involves retransmission of CBG that failed in the transmission.

TB mapping across non-contiguous resources

The resource allocation for MAS-PUSCH transmission may include resources that are non-contiguous in time. Fig. 14 depicts an example of a scenario 1400 in which the resources available for MAS PUSCH transmission are non-contiguous. Scenario 1400 depicts two slots 1401 and 1402, where each slot includes 14 symbols. Non-contiguous resources that have been allocated to MAS PUSCH are indicated at 1403.

The non-contiguous resource allocation may be the result of, for example, a PDSCH/PUSCH retransmission type B resource allocation mechanism, where some intermediate resources are not available based on collisions with TDD symbol configurations. In such a non-contiguous resource allocation case, the UE may utilize the aggregate resources available for type B repetition to transmit one MAS transmission that spans all available resources, e.g., as shown by resource 1404. Based on the capabilities of MAS PUSCH transmissions, the allocation of discontinuous resources may be a specific resource allocation technique for MAS transmissions that allows such configuration of discontinuous resource allocations.

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

Example 1

A first example embodiment disclosed herein provides a Multi-slot TBS Mapping-With-Repetition, M-MWR, with Repetition. The M-MWR includes the possibility to schedule higher TBS values, which cannot be achieved using typical MWR-based or Rel-16-based TBS determination procedures. The TBS value determined by the 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 typically configured MCS index.

The TBS using a typical MWR procedure determines to set the coding rate to r x K, the available resources correspond to a single time slot, and the resulting TBS is B. In contrast, the TBS determination for M-MWR calculates a sum of intermediate TBS values by setting the coding rate of the slot equal to r and the available resources as the available resources in the slot, where each intermediate TBS value corresponds to the TBS determined for each of the K slots.

Example 2

The MAS may be configured such that MAS mapping of transport blocks avoids crossing slot boundaries. One condition for not letting code blocks cross slot boundaries is to ensure that the rate-matched output of each code block fits into the resources of one slot. This situation can be expressed as follows. Let

Is the number of coding bits available in slot i. Let

And

then, the condition of having no code block crossing the slot boundary may be equal to the following. For each code block j =1, …, P, there is k such that

And

in such a case, the value of k may correspond to the time slot containing the code block, and the condition ensures that the code block number j is completely present in the time slot k. The gNB may ensure that these conditions are met when scheduling/configuring MAS-based transmissions.

Example 3

Figure 15 depicts three locations in a MAS transport block processing chain 1500 in which the process of canceling an indication (CI) may be performed in accordance with the subject matter disclosed herein. The MAS transport block processing chain depicted in figure 15 may be part of the TX processing circuitry 303 in the example embodiment of the UE 116 depicted in figure 3. In one embodiment, the processor 307 of the UE 116 may control the operation of the MAS TB processing chain depicted in fig. 15. In another embodiment, a processor (not shown) that is part of TX processing circuitry 303 may control the operation of the MAS TB processing chain shown in fig. 15.

The operations 1500 of the MAS transport block processing chain may 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 may be performed by the encoder 503 and the rate matching operation 1504 may be performed by the rate matcher 504 in the transmitter architecture 501 shown in fig. 5A. One or more of operations 1501-1505 may be performed by circuits and/or modules.

Figure 16A depicts an example scenario 1600a where a cancellation indication in one slot of an UL MAS transmission is received by a UE in accordance with the subject matter disclosed herein. In the example shown in FIG. 16A, six slots 1601-1606 have been allocated for MAS-based transmission. Code block CB ₁ -CB ₁₃ Has been mapped to slots 1601-1606. Indicating that CI 1607, which canceled the transmission in time slot 1604, has been received.

Various sources are possible for the cancellation indication. In the case of UL transmissions (e.g., MAS PUSCH), examples of cancellation sources include, but are not limited to, reception by a UE of DCI format 2_0 carrying an SFI value indicating a slot format that conflicts with UL transmissions; conflict with semi-static DL/UL slot format; the UE receives reception of a UE carrying a DCI format 2_4 explicitly indicating a CI request to cancel UL transmission in a specified slot; a collision in time with other UL signals having a different priority index than PUSCH; collision between CG-PUSCH and DG-PUSCH of the same HARQ process; and collisions between dynamically scheduled PDSCH and/or CSI-RS and CG-PUSCH. Although there may be different cancellation mechanisms (e.g., MAS-PDSCH) for DL transmissions, the primary mechanism for handling cancellation may be the same as for UL transmissions.

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

The second location 1511 where the cancellation indication may be processed is at the output of the rate matching operation 1504 by performing puncturing on the output of the rate matching operation 1504. The method may maintain the original code blocks that have been determined based on scheduled MAS transmissions, as well as transmission of some or all code blocks. There are four variants of the method using the second position 1511.

As shown in fig. 16B, a first variant of handling CI by performing puncturing involves cancelling all CB transmissions within the indicated slot. If the portion of the encoded sequence corresponds to a CB that is cancelled within a slot that extends into an adjacent slot, then the portion of the CB that extends into the adjacent slot is transmitted. As shown in the example scenario 1600B in FIG. 16B, CB in slot 1603 ₇ And CB in slot 1605 ₉ Is transmitted.

A second variant of handling CIs by performing puncturing involves cancelling CB transmissions within the indicated time slot. That is, if portions of the code sequence correspond to cancelled CBs that extend to adjacent time slots, they are also cancelled. As shown in the example scenario 1600C in FIG. 16C, CB in slot 1603 ₇ And CB in slot 1605 ₉ Is cancelled.

A third variant of handling CIs by performing puncturing involves cancelling all CB transmissions within the indicated time slot and if part of the coded sequence corresponds to a cancelled CB extending to a neighboring time slot, all transmissions in these neighboring time slots are also cancelled. Cancellation continues to the neighboring cell until no CBs with extensions are cancelled. As shown in the example scenario 1600D in fig. 16D, all transmissions in the time slot 1602 are cancelled until time slot 1605.

A fourth variant of CI is handled by performing puncturing, depicted by example scenario 1600E in fig. 16E, which involves cancelling all slots within a MAS-PUSCH transmission.

For the four variants of CI to be processed by performing the puncturing depicted in fig. 16B-16E, the indication to cancel a transmission in a slot should be received at a sufficient time before the slot is canceled so that the transmitter (at the UE) has sufficient time to perform the appropriate cancellation. Notably, such an approach may provide robust handling of the cancellation indication. For example, in the case where the transmitter (e.g., UE in the case of MAS PUSCH) misses the cancellation indication, the receiver (e.g., gNB) may make a decision to ignore CBs for transmissions in cancelled slots without affecting the transmission of the remaining CBs in other resources.

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

Several options may be provided for physical shared channel transmissions in the set of contiguous resources remaining after the cancellation indication. The first option is that the transmitter can send a Rel-16 transmission in each slot. In such a case, the transmissions may all be repetitions of the original intended TB for MAS transmission. If the TBS of the original MAS transmission is greater than the maximum allowed TBS threshold for a single Rel-16 transmission, the transmission of this TB may be cancelled. Furthermore, repeated transmission of the original TB in a set of Rel-16 physical shared channel transmissions may not succeed unless the conditions on achievable coding rates are met.

Alternatively, for the first option of the consecutive resource groups remaining after the cancellation indication, the TBs transmitted in the remaining slots may be determined separately for each slot. Parameters for determining the TB, such as MCS index and coding rate, may be set to values provided for the original MAS transmission. As yet another alternative to the first option, the coding rate for each physical shared channel transmission may be set to the effective coding rate that would be achieved for each slot if the original MAS transmission were performed.

For the second option for the set of contiguous resources remaining after the cancellation indication, the transmitter may send the MAS transmission in the set of contiguous slots available. For example, in the example given above, the transmitter may send two MAS transmissions, one spanning slots 1601-1603 and one spanning slots 1605-1606. For the first option of the contiguous resource group remaining after the cancel indication, the TB determines a similar process as follows. If the TBS is greater than the maximum allowed TBS threshold, the TB may be set to the originally determined TB and the MAS transmission cancelled. As described elsewhere herein, determining the amount of resources for each MAS transmission may also depend on limitations on the achievable coding rate. As an alternative to the second option, a new TB may be determined for each new MAS transmission.

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

Example 3a

The decision to perform PUSCH transmission in response to a cancellation indication may be configured in different ways, e.g., RRC configuration or dynamic indication. If the cancellation is RRC configured, all MAS PUSCH transmissions may be configured to be processed with cancellation according to one particular method. Alternatively, different kinds of MAS-PUSCH transmissions (e.g., dynamically scheduled MAS-PUSCH transmissions, CG-based MAS-PUSCH, etc.) may be handled in different manners (e.g., dynamically scheduled MAS-PUSCH transmissions, CG-based MAS-PUSCH, etc.). For dynamically scheduled MAS PUSCH or CG2 based MAS PUSCH, the way of processing cancellation may be indicated in the scheduling/active PDCCH.

Restrictions related to scheduling MAS PUSCH after cancellation indication

There may be a limitation on the determination of 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 when the MAS transmission of the original TBS is scheduled after receiving the cancellation indication, there is a limit to the overall coding rate that can be achieved.

Scheduling TBS thresholds on MAS PUSCH

The TBS determination for a MAS transmission may include resources from multiple slots, and thus the resulting TBS may be very large (e.g., due to implementation issues). Thus, the final TBS that can be used in MAS transmission may be determined by the value Th _TBS An upper limit is imposed. Considering the TBS determination procedure, the result value may be labeled TBS', which is an intermediate value obtained from the procedure of determining TBS. The final TBS value may then be given as the minimum between the intermediate value TBS' and the threshold value

TBS＝min(TH _TBS ,TBS′) (4)

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

Limiting of the overall coding rate

Upon receiving a cancellation indication for some slots, the transmitter may refrain from transmitting the original MAS transmission and may choose 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 transmission may be a Rel-16 transmission (i.e., one physical shared channel transmission per slot) or a MAS transmission (i.e., each transmission may span more than one slot, and the number of slots in each such transmission may be determined).

The achievable coding rate per transmission of the newly determined physical shared channel transmission may be greater than the original achievable coding rate due to the natural reduction in the amount of available resources after cancellation. More specifically, if the number of available coding bits per transmission is less than the TBS, the achievable coding rate per physical shared channel may be greater than 1. In such a case, one transmission may not be able to transmit the TBS.

When such a situation occurs, the receiver may rely on the set of transmissions (rather than just one physical shared channel transmission) to decode the TB. However, the success of the decoding operation of the TB may also depend on the RV index used for these transmissions.

To make the previous point clear, consider the case where the TBs of the original TB is equal to B. After slot cancellation, it is assumed 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 comprises two physical shared channel transmissions, where each transmission comprises half of the resources, the coding rate of each transmission is equal to 2. Two cases can be distinguished.

In the first case, if the RV index of two transmissions is the same, the overall coding rate of the two transmissions remains unchanged, and therefore, decoding attempts based on the TBs of the two transmissions may fail. In the second case, if the RV indices of the two transmissions are different, the overall coding rate may be less than or equal to 1, and thus, decoding attempts based on the two transmitted TBs may have a chance of success.

Both cases highlight the importance of determining the code rate of each slot associated with the assigned RV index of the newly determined transmission, which will be formalized next. However, it is first assumed that the newly determined transmission is inherent to some configuration properties from the original MAS transmission configuration (such as modulation order, DMRS configuration, number of transmission layers, overhead, etc.).

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 ∈ P, the second transmission corresponds to index 2 ∈ P, and so on. When determining the set of new transmissions, the transmitter may be configured to use a fixed RV version for all new transmissions, or the transmitter may be configured with a sequence of RV indices, where each transmission uses one index in the sequence in turn. The set of unique RV indices used by the transmission is labeled V. For each V ∈ V, let

Is the index transmitted in the set of new transmissions using RV index v. Let C be _p Representing the amount of coded bits available for transmission of the index p.

For successful decoding, the overall coding rate of the TB should be less than or equal to 1.

Or

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

In the second case where the newly determined PUSCH is a Rel-16 (one slot based) PUSCH transmission, all transmissions include a fixed number of resource elements, and thus, each transmission may have a fixed number of available coded bits. Let this number be denoted C _Rel-16 . In such a case, the conditions are simplified to

|V|·C _Rel-16 ≥B (7)

Example 4

In one embodiment, the MAS may be allowed to further segment the RM output sequences that cross slot boundaries around the boundary. For example, figure 17A depicts an example of a MAS transmission of two CB CBG1 and CBG2 across three slots 1701-1703. Segmentation may result in the RM output sequence corresponding to the CB being partitioned into multiple portions, as shown in FIG. 17B. The segmented portions may be treated as completely independent transmissions (i.e., the receiver may use them separately in decoding the CBs), or the segmented portions may be jointly used for decoding in a similar RV fashion.

The RV version of each transmission section can be determined in consideration of the resulting segmentation (reconstruction) of the relevant CB. According to the subject matter disclosed herein, the RV version of each portion may be determined to use the same RV index of the original CB. Alternatively, a sequence of RV indices may be specified, and RV indices for consecutive CB sections are determined based on the specified sequence of RV indices. For example, the RV index sequence may be configured, such as 0, 2, 1, 3. The RV index for each portion of the CB then iterates over the sequence in turn (and cyclically) starting from the RV index of the original CB. In FIG. 17B, consider the original CB ₂ RV ₁ Is 0. Then, the first portion of the CB may have an RV index equal to 0, and the second portion of the CB may have an RV index equal to 2.

Different approaches may be used to implement segmentation. Referring to TB processing chain 1800 in fig. 18, one method for segmenting code blocks may be as follows. A TBS determination operation 1801 calculates a TBS based on the resources of all K slots. The CB segmentation operation 1802 receives the TBS as input and provides the CB specified in Rel-16 (using the same K) _cb ). An encoding operation 1803 encodes the CB into the codeword specified in Rel-16, followed by a rate matching operation 1804.

Operations 1801-1804 may be performed by one or more circuits and/or modules. The RM operation 1804 may be altered as follows according to the subject matter disclosed herein. Initially, the RM operation 1804 may be provided with K slots in which to allocate code bitsAnd the number of available code bits per slot, marked for the ith slot

Where i =1, …, K. Total number of available code bits is

And the ratio of each CB may be determined as G/P = G' according to G. For each CB, a pointer (pointer) is reserved, which is allocated a specific bit in the RM procedure. For j =1, …, P, the pointer may be called s ^j . All pointers are initialized to the bit corresponding to the RV index. L is ^j The length of the encoder output, denoted as jCB (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 ith slot is denoted b ⁱ The bit is set to 1.

Although i ≦ K (cycled over time slot) and j ≦ P (cycled over CB): bit number s ⁱ Bit number b assigned to the output from the encoder of jCB to the i-th slot ⁱ . Pointer s ^j Is set to s ^j ＝((s ^j -1)mod L ^j ) +1. If it is not

Set i = i +1, set b ⁱ =1, and sets s ^j To the RV index of the designation index for the part of CB number j in slot i +1. Otherwise, if

Set up b ⁱ ＝b ⁱ +1. If k = G', then j = j +1 and k =1. If k ≠ G', then k = k +1 is set.

Alternatively, the RM operation may be changed as follows. The RM operation 1804 may be provided with a set of K slots in which to allocate code bits, and the available code ratio per slotNumber of bits, marked for the ith slot

Where i =1, …, K. Total number of available code bits is

And the ratio of each CB may be determined as G/P = G' according to G. For each CB, j =1, …, P, if k is present>0 and n is not less than 0 so that

Then the maximum n satisfies the condition, and the RM size of CBj is divided into n +2 values corresponding to slots k-1,k, …, k + n as follows

If n =0, then CB j is divided into 2RM sizes as follows

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

In one embodiment, one CB crossing a slot boundary may be changed to be limited to only one of its initially spanned slots. The slot in which the CB is restricted may be the largest portion of the slot to which the CB is initially contained, or a slot based on some other rule for selecting to which slot the CB is restricted. Determining the RM output of each CB in each time slot follows the concepts disclosed herein.

When a portion of the fragmented CB is transmitted only in actual transmission, referred to herein as a transmission portion, the determination of the RV index for the transmission portion may follow the RV determination disclosed herein. Figure 19A depicts an example of MAS transmission of CBs across three slots 1901-1903 in two CB groups CBG1 and CBG 2. FIG. 19B depicts CB separately ₂ RV ₁ And CB ₃ RV ₁ Segmentation and transmission of the transmission part.

Example 5

MAS processing may also be used to process retransmissions. For the retransmission case, consider the case where the CBG is not configured. Then, requesting retransmission of the MAS transmission involves repetition of all CBs. Retransmissions can be scheduled in the same (in number and available REs) time slots as the original time slots. In such a case, the retransmission may be performed the same as the original transmission of the K slots. Alternatively, retransmissions may be scheduled in different sets of time slots with different numbers of available REs. In this embodiment, the TBS determination, coding and rate matching procedures and the process of retransmission where the exact TB is transmitted in the initial transmission can be ensured by the gNB. In case the gNB is interested in such retransmissions (e.g. performing Chase Combining), it may also be ensured by the gNB that the resource allocation in the scheduling time slot and the coding process result in the same retransmission of the originally transmitted RV version of the CB.

In an alternative embodiment, the same TB used in the original transmission may be transmitted by the transmitter. In this alternative embodiment, certain resource allocations for the scheduled time slots may be determined. Knowing the scheduled resources for retransmission, the transmitter knows that the TB may be the same TB determined in the original transmission, and therefore the transmitter does not determine a new TB according to the TBs determination procedure. Assuming that 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 from knowing the number of available resources and the TBS. The transmitter may then continue the encoding and rate matching process to perform the retransmission. When determining the resource allocation for retransmission, the procedure can be ensured by the gNB to generate the necessary RV transmission of the original codeword.

When slot cancellation occurs on the original MAS transmission, the retransmission of the MAS transmission may be as follows. If transmission in a slot indicating cancellation of MAS transmission is indicated, various techniques for handling transmission of transmission in the remaining resources may be used. The techniques may involve sending the original TB in one or more other normal and/or MAS transmissions, or sending a different and independent set of TBs in one or more other normal and/or MAS transmissions.

In case of transmitting the original TB, the repeat request may naturally correspond to TB transmission. The type of transmission (normal/MAS) and the resources used for retransmission may follow the above-described process of transmission repetition.

In case the transmission involves multiple different TBs, the repeat request should provide an indication of which TB is requested. This indication may be in the form of an additional indication in the scheduling request for repetition or as a separate resource indicating a repetition request for each TB transmitted. Since TBs are formed when a slot cancel indication is received, an explicit configuration of feedback for each of these TBs may be indicated along with the slot cancel indication. Implicit rules may be used to determine the resources for feedback for each transmitted TB.

Example 6

Resources for MAS transmission may be dynamically configured. That is, MAS transmissions may be scheduled by scheduling DCI transmitted in PDCCH. The DCI may include resource allocation and configuration for all K slots in the MAS. For MAS allocation of K slots, DCI information may include K sets of configuration parameters, each parameter containing the resource allocation and configuration of a slot. This may provide maximum flexibility in scheduling at the expense of high signaling overhead. Alternatively, the system may limit MAS transmissions to include only slots with the same resource allocation; in such a case, the DCI may include only resource allocation and configuration corresponding to one slot, and one number K indicates the number of slots contained in the MAS transmission. This may limit the signaling overhead at the expense of limited scheduling flexibility.

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

For both types of configured license (CG) transmissions, information about MAS transmissions may be configured similar to the description above. In such a case, the CG configuration may indicate the slot of the first slot in the MAS transmission, with the remaining (K-1) slots following the indicated slot. Alternatively, the CG configuration may indicate the time location of different transmission opportunities within a CG cycle. Fig. 20 depicts a CG period 2001 in an example CG configuration that may include a set of conventional transmission opportunities and a set of MAS transmission opportunities according to the subject matter disclosed herein.

Multiple CG configurations may be configured to allow multiple variations of CG configurations for transmitters with and/or without MAS transmissions. For CG type 2 (semi-persistent scheduling), one CG configuration may be used to indicate both regular and MAS transmission occasions. For example, the CG configuration may provide an indication of a particular time slot. There may be an additional indication on the active PDCCH that the CG is to be used for regular transmissions. Alternatively, if the PDCCH indicates that the CG is to be used for MAS transmission, the indicated slot may be considered to be the first slot included in the MAS transmission opportunity of an additional K-1 slots after each indicated slot.

Enhancement of Redundancy Version (RV)

One embodiment disclosed herein provides enhancements to RV based transmission for addressing the following issues. Consider a TBS size of B. The TB can be generally segmented into P CBs, where

The size of each CB is C = D/P. Each CB is encoded into a codeword of size B · B/P where B =3 for LDPC base 1 and B =5 for LDPC base 2. The codeword is then provided as an input to a rate matching block, which produces an allocated segment of the codeword having a length L.

When L is very small, RV based retransmissions may not optimally use coded bits as shown in fig. 21A. In such a case, it may be beneficial to add more RV indices, as shown in fig. 21B. In contrast, if L is very large, it may be very beneficial to use only some RV indices, as shown in fig. 22A and 22B. For example, consider an L having a length as shown in fig. 21A. Fig. 22A shows an example RM output corresponding to fig. 21A, but with L having a length as shown in fig. 22A. Specifically, fig. 22A shows an example case where L is approximately greater than the length of the entire codeword (e.g., half of B × B/P). RV1 and RV3 will overlap slightly and will completely cover the codeword and RV2 and RV4 may be removed. Fig. 22B shows an example RM output corresponding to fig. 22A with RV2 and RV4 removed.

Thus, the following rules may be employed to determine the optimal number of RV versions:

v is the smallest integer such that V.L.gtoreq.Cb (12)

Or

Where C is the size of the code block, which is equal to B/P.

The number of RV indices can be freely selected according to equation (12) or (13). Note that if L changes across time slots, one value that generates the most appropriate value of V may be selected (e.g., the minimum value in all time slots).

Another approach may be to select the value of V from a set of possible RV indices. The selection may be explicitly indicated by the gNB. Alternatively, the selection may be a value

The closest value in the set. The set of possible RV indices may be selected as a power of 2 to ensure that the RV boundary does not change with the dynamic selection of V.

TBS/CB limitation

TBoMS (multi-slot transport block processing PUSCH, also referred to herein as MAS) scheduling TBs for transmission may generate a corresponding TBs based on a TBs determination rule. In this regard, TBS values for TBoMS may have an upper limit-this is the maximum TBS value that is possible in conventional NR (Rel-16). Another upper limit X may be based on the corresponding maximum data rate achieved. That is, the maximum data rate achieved cannot exceed the corresponding maximum data rate in the conventional NR (Rel-16). Yet another upper bound X may be based on the corresponding data rate, wherein the achieved data rate of TBoMS should not exceed the corresponding achieved data rate of legacy PDSCH/PUSCH for the same configuration parameters. The configuration parameter may be a scheduling parameter of the TBoMS. Examples of such parameters include, but are not limited to, rank, BW, number of layers, MCS, and may be based on the indicated UE capabilities, or a combination thereof.

The parameters indicated in the UE capabilities are not necessarily equal to the parameters of the configuration of the TBoMS. When using the parameters indicated in the UE capabilities, it should be noted that the UE capabilities may be indicated per frequency range, per Component Carrier (CC), per frequency Band Combination (BC), and/or per feature set. The limit value may be calculated for each instance that a set of parameters is provided. For example, a limit value may be calculated for each feature set that contains parameters related to TBoMS. Alternatively, one or more limit values may be calculated by taking a representative value of each parameter across corresponding values of the parameters of different combinations (such as a set of features).

In one embodiment, TBoMS may be limited by the number of CBs reached. That is, the number of CBs that can be configured for TBoMS may be limited. Since the number of CBs is derived from the TBS, limiting the number of CBs may be achieved implicitly by limiting the TBS as described above.

In another embodiment, the number of CBs may be explicitly limited to some maximum value

The maximum limit may be achieved by limiting the number of CBs to a minimum value that is achieved by conventional specification operation

To be implemented.

Can be specified to be applicable to any of the above-mentioned materials havingAbsolute number of TBoMS feature capable UEs. Alternatively, the first and second electrodes may be,

the value of (c) may depend on the UE capability, i.e., the UE may indicate the maximum number of CBs supportable per TBoMS within the TBoMS feature capability. The limitation of the number of CBs may be described as per CC, per frequency band, per BC, per feature set, or per component carrier Feature Set (FSPC). The limitation on the number of CBs may also be part of the TBoMS feature, and thus may follow the UE signaling granularity associated with TBoMS capability.

In one example embodiment, a transport block processing chain of a transmitter may include a code block determination circuit and a rate matching circuit. The code block determination circuit may be configured to determine a size of a code block mapped across a plurality of time slots of a wireless physical shared channel configured according to a multi-slot transport block (TBoMS), and the rate matching circuit may be configured to rate match bits of the code block to a number of bits available in a transport block spanning the plurality of time slots of the wireless physical shared channel. In another example embodiment, the plurality of time slots of the wireless physical shared channel configured according to the TBoMS may be based on a legacy maximum Transport Block Size (TBS). In yet another example embodiment, the plurality of time slots of the wireless physical shared channel configured according to the TBoMS may be based on a predetermined number of code blocks, and the predetermined number of code blocks may be based on a legacy maximum number of code blocks. In yet another example embodiment, the plurality of time slots of the wireless physical shared channel configured according to TBoMS may be based on a maximum Transport Block Size (TBS) set forth in a standards document.

Example 1 of RM and interleaver operation

A first exemplary embodiment of RM determination and interleaver operation includes a continuous RM determination and a continuous interleaver. The RM output of the CB may be determined for all slots and the interleaver operation may be performed across all slots. In such a case, the interleaver size would be determined based on the entire CB RM output for all slots. Fig. 23A and 23B describe the operation of a first example embodiment of RM and interleaver operation for continuous RM determination and continuous interleaver, respectively, according to the subject matter disclosed herein. In fig. 23A and 23B, it is assumed that the multi-slot physical shared channel transmission has two slots and three CBs, and the modulation order is 4.

In fig. 23A, the RM output of CB2 is known to cross the slot boundary between

slots

1 and 2. It can be assumed that the RM output of CB2 is a continuous RM output. The present embodiment applies the interleaver operation over the entire RM output. Since the modulation order is 4, the interleaver operation for CB2 results in coded bits being transmitted in two slots interleaved, as shown in fig. 23B.

Example 1a of RM and interleaver operation

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

Example 1b of RM and interleaver operation

A second variant of the embodiment shown in fig. 23A and 23B may be similar to the first variant of fig. 25A and 25B, but within a well-defined number of time slots during multi-slot physical shared channel transmission. This second variant (restricted consecutive RMs, restricted consecutive interleaver) can be characterized by a limit L on the number of slots. More specifically, fig. 25A and 25B show the RM and interleaver outputs of L =2 for a multi-slot physical shared channel with a modulation order of four slots, three CBs and 4, respectively. In this variant, the RM operation takes as input the entire codeword of the CB and provides the coded bits rate-matched on the physical shared channel resources in a set of individual L slots. The RM operation provides a set of consecutive coded bits as input to the interleaver, which also operates on the RM output of the set of L slots to provide a mapping of the coded bits onto symbols of each L slots. This variant allows the RM outputs for different sets of L slots to be either consecutive RM outputs or RM outputs with a new RV. Restrictions may also be provided for the gNB so that multi-slot physical shared channel transmissions in which the CB experiences a boundary across the set of L slots are not scheduled.

Example 2 of RM and interleaver operation

A second exemplary 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 fig. 26A and 26B. Interleaver operations are performed independently across each slot. In such a case, the interleaver size would be determined based on the CB RM output for the particular slot. This may work when RM outputs are determined for all time slots, or when RM outputs are determined independently for each time slot. The rate matching process described herein may be implemented by considering E when determining RM outputs for all slots _r As an RM size across all slots is extended. However, in such cases, the interleaving process disclosed herein cannot be extended directly, as slot boundaries should still be confirmed for interleaver operation. Let the number of slots to which a CB is mapped be M. For i E {1, …, M }, the available code bits in the ith slot are E _i And is and

the interleaving process disclosed herein may then be performed by using E _i In place of and in consideration of existing processes

To be applied to each E separately _i 。

In fig. 26A, the RM output of CB2 is a continuous RM output. This variant applies the interleaver operation in fig. 26B only to the RM output of each slot.

Similar behavior exists when the RM output is an output indexed with a new RV, as shown in fig. 27A and 27B, which are the RM and interleaver outputs, respectively, for a multi-slot physical shared channel with two slots, three CBs, a modulation order of 4, and a CB RM output with a new RV segmentation according to the subject matter disclosed herein.

The systematic bits available in the codeword corresponding to the CB are important bits for the decoding operation. Therefore, it is beneficial for the interleaver to be able to map the systematic bits to reliable bits according to the modulation scheme used (e.g., 16 QAM). One possible problem with this exemplary embodiment of RM and interleaver is that a small number of systematic bits may end up being mapped to reliable bits compared to the exemplary embodiment of fig. 23A and 23B. This possible problem can be circumvented by using a first variant of the following example embodiment of fig. 23A and 23B.

Example 2a of RM and interleaver operation

Embodiment 2a of the RM and interleaver operation is similar to the exemplary embodiment of fig. 27A and 27B. In the example embodiments of fig. 27A and 27B, the interleaver operation may be performed independently across each slot, and the interleaver size may be determined based on the CB RM output of a particular slot. The RM output may allocate information bits between time slots in order to map the information bits to reliable bit positions via the interleavers of the different time slots. An example of the operation of embodiment 2a of RM and interleaver operation is shown in fig. 28A and 28B, respectively, where it can be assumed that a multi-slot physical shared channel transmission has two slots and three CBs and the modulation order is 4.

The RM operation of the variants of fig. 28A and 28B for a particular CB may be based on separately processing systematic bits and parity bits when determining inputs to the interleaver for different time slots. Let the number of slots in the multi-slot PUSCH be M. For i E {1, …, M }, the number of coding bits available in the ith slot is E _i . The bits corresponding to the codewords of the CB are numbered from 0 to N-1, where N is the length of the codeword. Let the bits from 0 to K-1 correspond to the K systematic bits for the codeword. Let j e {0, …, N-1} indicate the bit corresponding to the start of the RM output (e.g., indicated by the RV index of the multi-slot physical shared channel transmission). Due to output bits from RM operation

Let

A subset indicating that the systematic bits are of size B will be the systematic bits that will be part of the RM operation output in all slots of the multi-slot physical shared channel transmission. Determination of B _S May vary depending on how the RM operation chooses the total number of output bits. For example, in performing the module N operation, the RM output of the M slot may be determined by successively selecting bits from the codeword starting from the j-th bit of the E-bit-total.

The RM operation can be described as follows: first, determine M as x _i ＝E _i And E is used. Or, x _i And (1/M). These fractions determine the ratio of systematic bits to be allocated in each time slot. Next, systematic bits are successively allocated to the slots according to the ratio of the systematic bits. The number of systematic bits allocated to time slot i is B.x _i . Finally, the remaining E-B bits from the RM output are allocated to the time slots according to the ratio of the systematic bits. The number of bits allocated to slot i may be subjected to a proper rounding operation to determine the integer number of bits.

Another way to describe RM operation is to interleave the bits mapped in M slots equally as follows. For the signals from 0 to

All codeword bits of, successively allocate x _i ＝E _i the/M is for slot i of all M slots. In other words, from 0 to (E) ₁ Bits of/M) -1 are allocated in the first time slot, from E ₁ M to (E) ₁ +E ₂ Bits of/M) -1 are allocated in the second slot. From

To

Is allocated in time slot i. In that

After the bits have been allocated, from

The previous process is repeated until the bit in (1) starts

This continues, for k ≦ M, for the slave

To

The bits of (c).

This process divides the RM output into M parts, where slots can be assigned a fraction of each part based on the respective RM size. This process can be generalized to any number T in the following section.

First, for the signals from 0 to

To

Is allocated in time slot i.

Then, at

Bit has been replaced byAfter distribution, from

The previous process is repeated until the bit in (1) starts

This continues, for k ≦ M, for the slave

To

The bits of (c).

The value of T may be selected to allow for a uniform distribution of information bits in the M slots. The number T may be selected based on different criteria, for example, T = round (E/B),

And others. FIG. 29 shows a structure in which 6E ₁ ＝4E ₂ ＝4E ₃ ＝3E ₄ And B = (3/10) an example of an RM output method of E. T = round (E/B) may be selected at this point.

RV selection

The RM operation of the exemplary embodiment of fig. 26A and 26B is slot-based and the RM output of each CB is based on the selected RV index. RM operation may be enhanced by a set of RV indices (the set of RV indices used in Rel-16 PUSCH) or may be a set of different RV indices that may be added. In this enhancement, the RM output of the CBs in a slot may be based on the RV index. Enhancements include techniques to select such indices. A number of options are as follows.

The first option includes that the RV index of the CB in each slot follows the RV index selected according to the Rel-16 procedure of the slot aggregation. Another option provides that the RV index of the CB may be increased for each slot in the multi-slot physical shared channel transmission. Another alternative includes that the RV index of the CB in each slot may be the largest RV index with a starting position smaller than the end position of the RM output from the previous slot. That is, for a givenFor CB, E _i Is the RM size of the slot number i, and p _st Is the starting position of the RM output of the first slot (this may 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 a starting position less than or equal to the maximum one of x. The alternative option may include selecting the RV index with a starting position closest to x.

Yet another option includes letting S be the RM size corresponding to the difference between the starting positions of two consecutive RV indices. Then T = round (E/S) (or T = ceil (E/S) or = floor (E/S)) may be calculated and the RV index for each successive slot is increased by T.

Another option is that the transmitter can be configured with a number of possible sequences of RV selections, where the RV indices of different CB segments follow the pattern of one of the sequences. The selection of the sequence to be used may be performed, for example, as follows. The DCI scheduling the multi-slot physical shared channel transmission may include a field for selecting an index of an RV sequence to be used in the multi-slot physical shared channel transmission. This field may be the same RV index field in DCI format 0_1. Alternatively, the field may 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 may be configured with a multiple set of RV sequences. Then, only a subset of such sequences used by the transmitter may be configured by the gNB. The selection of such a subset may 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 a scheduling DCI of a multi-slot physical shared channel transmission. The selection of this field may be the same, or may be the same RV index field in DCI format 0_1. Alternatively, the field may be a different field or the same field, but the number of bits is increased to accommodate more RV sequences.

When a CB crosses a slot boundary, the RV index of the newly formed segment may follow the order indicated by the DCI, as previously described. An example of this operation will be explained below, assuming that the transmitter is configured with a set of RV sequences as shown in the following table. Assume that the UE is indicated by RV index 0 via the scheduling DCI. In the case where one coded CB traverses three slots, the RM outputs of the three slots will use

RV indices

0, 1, and 2.

The table that the UE follows to determine the RV sequence for the CB segments across slots may be a Rel-16 table for determining the RV sequence for the aggregation across slots. Alternatively, a new table may be defined for determining CB segment RV sequences across slots, similar to (but not limited to) table 2 below.

TABLE 2

Alternatively, the transmitter may select the RV index for the slots across CBs to ensure that the maximum number of information bits are mapped to higher order symbols with high reliability. For example, in the case of using 16QAM modulation, some bits have higher decoding reliability than others depending on their respective positions in the 16QAM symbol. If all information bits are transmitted in the coded bit positions of one slot, about half of the information bits will be mapped to unreliable bit positions. In such a case, instead of selecting the RV index, the RV index for the next slot may be selected to retransmit half of the unreliable bits of the transmission in the new slot, which may result in the transmission of the untransmitted coded bits.

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

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

As a simplified alternative, with a scale of 1 to K _Q Reliability class K of _Q Corresponding to most reliable to least reliable if the information bits are mapped to reliability of 1 to K' _Q Any bit of, then for a given level K' _Q The information bits may be considered reliable. RV index selection may be made to ensure that the maximum number of information bits are mapped to reliable bits.

Example 3 of RM and interleaver operation

For embodiment 3 of RM and interleaver operation, the interleaver operation is similar to the sequential interleaver operation previously described. However, the size of the interleaver may be limited. That is, the interleaver operation may be a continuous interleaver operation, but with a maximum interleaver size. The interleaver size limitation may be enforced by resetting the interleaver operation after each set of interleaver input bits equal to the maximum interleaver size. In such a case, multiple interleaver operations may be performed on the entire RM output (e.g., when the RM output size is greater than the maximum interleaver size).

Alternatively, the interleaver size limitation may 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 may be limited to the maximum interleaver size.

Yet another way to enforce interleaver size limitations may be by enforcing resource allocation for TBoMS such that both RM output and interleaver input are within the maximum interleaver size limitations.

The interleaver size limit may be in the form of a value X that sets the maximum interleaver size. The value X may be specified in different ways. For example, the value X may be specified as an absolute value independent of other configurations of TBoMS. In such a case, the Rel-16 specification may explicitly mention the absolute value of the designation. Alternatively, the absolute value may be in the form of a numerical value. For example, the value may be in the form of X =1000 bits, with a value of 1000 being an example. As a further alternative, the absolute value may be specified as a relation to one or more other parameters in the Rel-16 specification, where these parameters may be independent of the configuration of any TBoMS. For example, X may be a small fraction of other parameters in the specification, such as the maximum TBS value achieved in Rel-16, or any other function of other parameters in the specification.

Yet another approach is that the value X is assigned according to a specific configuration of scheduled TBoMS or a specific configuration of UE capability indicated by the UE in relation to the use of TBoMS. For example, the value X may depend on any one or more parameters such as the scheduled MCS, the scheduled resources in time and/or frequency, the number of scheduled layers, the number of scheduled time slots, the resource allocation mechanism, the scheduling type of TBoMS (dynamic, configured grants, etc.), the transport block size, the number of CBs per TB, the configured CBG and/or the UE capabilities.

For example, the value X may depend on the scheduled BW, MCS, number of layers, and UE capabilities. The value X may also be specified according to the corresponding interleaver size achieved in the legacy NR (e.g., rel-15/16). The corresponding value may be a value that can be reached when scheduling transmissions in a legacy NR (e.g., rel-15/16) using the same/similar scheduling parameters.

The value X may be determined based on scheduling parameters of the TBoMS, such as rank, modulation order, coding rate, MCS, bandwidth, number of layers, etc. For example, if tbomass is scheduled within a 50MHz bandwidth, the value X may be determined based on the scheduled bandwidth. Or the value X may be determined based on the UE capabilities of the indicated supported parameters for TBoMS, such as rank, modulation order, coding rate, MCS, bandwidth, number of layers, etc. For example, if TBoMS is scheduled in 50MHz bandwidth, but the UE indicates support of capability up to 100MHz, the value X may be calculated based on 100 MHz.

In the case where the determination of X depends on the UE capabilities, the value used in the determination may be for each frequency band in each frequency band combination indicated by the UE capabilities.

X may be calculated as the TBS value corresponding to the conventional (Rel-16) counterpart (counter) of the scheduling TBoMS. The legacy counterpart of TBS may mean a TBS value calculated according to legacy specification procedures and using parameters of scheduling/configuration and UE capabilities. For example, X may be a TBS value calculated according to conventional procedures using parameters of the scheduled TBoMS (such as, but not limited to, rank, modulation order, coding rate, MCS, bandwidth, and number of layers); alternatively, the values of these parameters may be indicated by their respective UE capabilities.

X may be calculated as the expected input interleaver size using conventional specification procedures. For example, X may be equal to the number of available code bits in legacy PDSCH/PUSCH scheduling using the same scheduling/configuration parameters for TBoMS. The number of available code bits can be set by N _RE * v Q, where the Rel-16 TBS decision equation for all parameters is given.

Operational alternative of the interleaver of the third embodiment

As a first operational alternative, the UE may not desire to handle interleaver input sizes greater than the Rel-15/16 limit, which corresponds to the parameters the UE declares to support for each band in the band combination, and in section 5.4.2.1 of 38.212V16.4.0, which corresponds to the amount of available coding bits G or the available coding bits G/C' of each CB.

As a second operational alternative, the UE may not desire to process the interleaver input size G _max /C ', where C ' is given in 38.212, section 5.4.2.1, and G ' is given according to 6.1.4.2 in 38.214 for UL-SCH and 5.1.3.2 in TS38.214 for DL-SCH/PCH in 38.214 _max Can be determined as N _RE Q _m v, assume the number of REs (N) _RE ) Modulation order (Q) _m ) And the number of layers (υ) as follows, as indicated by 5.4.2.1 in 38.212:

the maximum number of layers for one TB of the UL-SCH is given by X, where:

if the higher layer parameter maxMIMO-Layers of the PUSCH-ServingCellConfig of the serving cell is configured, X is given by this parameter,

otherwise, if the higher layer parameter maxRank of the serving cell's pusch-Config is configured, X is given by the maximum value of maxRank of the serving cell across all BWPs,

otherwise, X is given by the maximum number of layers of PUSCH for the serving cell supported by the UE.

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

if the higher layer parameter maxMIMO-Layers of the PDSCH-ServingCellConfig of the serving cell is configured, X is given by this parameter,

otherwise, X is given by the maximum number of layers of PDSCH for the serving cell supported by the UE.

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

If a higher layer parameter mcs-Table or mcs-TableTransformRecoder given by a pusch-Config or configredGrantConfig of at least one UL BWP of a serving cell is set to "qam", the maximum modulation order Q of the UL-SCH is set _m =8 is assumed; maximum modulation order Q of UL-SCH otherwise _m =6 is assumed.

η _PRB ＝η _PRB,LBRM Given by Table 5.4.2.1-1 (Table 3), where η for DL-SCH _PRB,LBRM If no other downlink bandwidth part is configured to the UE, is determined from the initial downlink bandwidth part.

N _RE ＝156·η _PRB 。

TABLE 3 (TABLE 5.4.2.1-1): η _PRB,LBRM Value of (2)

As a third operational alternative, the UE may not desire to process the interleaver input size G _max /C ', where C' is given in 38.212, section 5.4.2.1And G is from 6.1.4.2 for UL-SCH in 38.214 and 5.1.3.2 for DL-SCH/PCH in TS38.214 _max Can be determined as N _RE Q _m v, assume the number of REs (N) _RE ) Modulation order (Q) _m ) And the number of layers (. Nu.) are as follows.

The maximum number of layers of one TB for UL-SCH is given by the maximum number of layers of PUSCH for the serving cell supported by the UE;

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

maximum modulation order Q of DL-SCH if UE supports 256QAM for serving cell _m =8 is assumed; maximum modulation order Q of DL-SCH otherwise _m =6 is assumed;

maximum modulation order Q of UL-SCH if the UE supports 256QAM for the serving cell _m =8 is assumed; maximum modulation order Q of UL-SCH _m =6 is assumed;

η _PRB ＝η _PRB,LBRM given by Table 5.4.2.1-1 (Table 4); and

N _RE ＝156·η _PRB 。

TABLE 4 (TABLE 5.4.2.1-1): η _PRB,LBRM Value of (A)

As a fourth operational alternative for the configured TBoMS, the configured TBoMS satisfies the feature set if parameters associated with the TBoMS satisfy the UE capabilities indicated in the feature set. UE does not expect to process interleaver input size G _max /C ', where C ' is given in 38.212, section 5.4.2.1, and G ' is given according to 6.1.4.2 in 38.214 for UL-SCH and 5.1.3.2 in TS38.214 for DL-SCH/PCH in 38.214 _max Can be determined as N _RE Q _m v, assume the number of REs (N) _RE ) Modulation order (Q) _m ) And the number of layers (. Nu.) are as follows.

The maximum number of layers of one TB of the UL-SCH is given by the maximum number of layers of PUSCH the UE supports in the set of met feature sets;

the maximum number of layers of one TB of the DL-SCH/PCH is given by the maximum number of layers of PDSCH supported by the UE in the set of the satisfied feature set;

maximum modulation order Q of DL-SCH if the UE supports 256QAM within the set of satisfied feature sets _m =8 is assumed; maximum modulation order Q of DL-SCH otherwise _m =6 is assumed;

maximum modulation order Q of UL-SCH if the UE supports 256QAM within the set of satisfied feature sets _m =8 is assumed; maximum modulation order Q of UL-SCH otherwise _m =6 is assumed;

η _PRB ＝η _PRB,LBRM given by Table 5.4.2.1-1 (Table 5); and

N _RE ＝156·η _PRB 。

table 5 (Table 5.4.2.1-1): _PRB value of LBRM

In other words, the operational alternative corresponds to computing the interleaver size constraint using parameters selected from the satisfied feature set in a manner that maximizes the constraint value.

As a fifth operational alternative to the configured TBoMS, the configured TBoMS satisfies the feature set if the parameters associated with the TBoMS satisfy the UE capabilities indicated in the feature set. For each satisfied feature set, the UE does not want to process the interleaver input size G _max /C ', where G ' is given in 38.212, section 5.4.2.1, and G ' is given according to 6.1.4.2 in 38.214 for UL-SCH and 5.1.3.2 in TS38.214 for DL-SCH/PCH in 38.214 _max Can be determined as N _RE Q _m v, assume the number of REs (N) _RE ) Modulation order (Q) _m ) And the number of layers (v) are as follows.

The maximum number of layers of one TB of the UL-SCH is given by the maximum number of layers of the PUSCH the UE supports within the set of features that is met;

the maximum number of layers of one TB of the DL-SCH/PCH is given by the maximum number of layers of PDSCH supported by the UE in the satisfied feature set;

maximum modulation order Q of DL-SCH if the UE supports 256QAM within the satisfied feature set _m =8 is assumed; maximum modulation order Q of DL-SCH otherwise _m =6 is assumed;

maximum modulation order Q of UL-SCH if the UE supports 256QAM within the satisfied feature set _m =8 is assumed; maximum modulation order Q of UL-SCH otherwise _m =6 is assumed;

η _PRB ＝η _PRB,LBRM given by Table 5.4.2.1-1 (Table 6); and

N _RE ＝156·η _PRB 。

TABLE 6 (TABLE 5.4.2.1-1): η _PRB,LBRM Value of (A)

In other words, the fifth operational alternative corresponds to selecting the smallest interleaver size limit across all the satisfied feature sets

Example 4 of RM and interleaver operation

In a fourth embodiment, the interleaver operation may be a continuous interleaver operation, but across a certain resource unit. The resource units may be time slots, in which case the fourth embodiment is similar to embodiment 2 of RM and interleaver operation. The resource unit may be a set of whole time slots for tbmsb, in which case the fourth embodiment becomes similar to embodiment 1 of RM and interleaver operation. The resource unit may be different from the time slot of the TBOMS or the set of the entire time slot. For example, a unit of resources may be a collection of time-contiguous or non-contiguous resources, which may or may not span different time slots.

In some cases, the RM output may include a plurality of such resource units. In some cases, the definition of a cell may depend on its relative position with respect to the RM output. For example, a first unit in the RM output may correspond to a particular resource having a particular configuration, while a second or higher unit in the RM output may correspond to a different configured resource. In such a case, the interleaver operations may be sequential in the context of one unit, while independent interleaver operations may occur across different units.

Mapping from virtual resources to physical resources

The subject matter disclosed herein includes a method of performing mapping from virtual resources to physical resources in the context of a multislot physical shared channel transmission process. That is, the transmitter may be indicated with a set of physical resources for transmission of a multi-slot physical shared channel transmission. It may be assumed that the set of resources includes

A time slot.

Each slot of a slot may be associated with a global identifier of the slot location in the System, e.g., an identifier based on the System Frame Number (SFN). For the ith time slot, set

An index of an OFDM symbol assigned to the transmitter for use in multi-slot physical shared channel transmission may be included, where each symbol corresponds to a set of REs for each assigned SC.

The set of time slots may be contiguous or non-contiguous. It can be assumed that the time slots are ordered in time according to their time index (i.e. time slot), i.e. if i<j, time slot i comes before time slot j. Set of symbols

May have UL symbols, DL symbols, or F symbols. For the indication of the set, no assumptions are made about the rules relating to the mandatory transmission directions of the symbols. For example, collections

There may be DL/UL symbols for some of the symbols. However, the transmitter should comply with the transmission rules indicated by the network or the gNB for the allocation symbols.

The transmitter may also be instructed on a set of virtual resources to use in the processing of the multi-slot physical shared channel transmission. It may be assumed that the set of resources includes

A time slot. For the ith time slot, set

Including the index of the OFDM symbol assigned to the transmitter for use in the multi-slot physical shared channel transmission. Number of virtual sets

Number of available physical time slots

The same or different. Set of virtual symbols

Set of symbols compatible with physical

The same or different. The set may be indicated dynamically or semi-statically.

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

There are several mapping methods from virtual resources to physical resources based on the allocation of physical resources and virtual resources.

In the case where the virtual set and the physical set are the same, that is,

and

and all time slots in the set of physical time slots are contiguous, and

the resources corresponding to the symbols in (1) can be mapped to the resources corresponding to the symbols in (2)

The symbol in (1) corresponds to a resource.

When the virtual set and the physical set are the same, that is,

and

and not all time slots in the set of physical time slots are contiguous, the set of physical time slots comprising a number of subsets, wherein each subset comprises a contiguous time slot. In such a case, with

The symbol in (1) corresponds to a resource. For example,

and the set of four time slots comprises two subsets, each subset containing two consecutive time slots. This may be the case for a multi-slot PUSCH, for example, and for a TDD configuration in the form of a ddsuddsuu, where all U slots are allocated to a multi-slot PUSCH. This may also occur due to the dynamic indication of the slot format. For example, inConsider a TDD configuration FFFFFF. The UE may indicate the following mode of the configured UUUUDD via the SFI indication. After performing the necessary PUSCH processing on the multi-slot PUSCH, the UE receives another SFI indication to change the mode to UUDDUU, in which case the UE may perform multi-slot PUSCH transmission on the newly determined set of physical slots. As yet another example of this, the first,

and none of the four time slots are contiguous. This may be the case for a multi-slot PUSCH, for example, and for a TDD configuration in the form of ddsudsuddsudsu, where all U-slots are allocated to a multi-slot PUSCH.

In the case where the number of physical slots is smaller than the virtual slots, that is,

which may correspond to the following use case in Rel-16, the UE may be allocated a set of physical slots for transmission of a multi-slot PUSCH. The UE may then determine that all physical slots are feasible for transmission, and thus, that the corresponding virtual slot is the same as the physical slot. Some physical time slots may then be rendered unsuitable for transmission due to, for example, dynamic changes in the TDD configuration. In such a case, the UE has different mapping options. For the first option, the UE may continuously map the virtual slots to the physical slots in their respective order. Thus, there is no additional physical slot to map to

The virtual slot eventually becomes the last of the set of virtual slots

For the second option, the UE may continuously map the virtual slots to the physical slots in their respective order. The UE may also skip virtual slots having original physical slots no longer available if the determination of the virtual slots is based on the physical slots.

In the case where the number of physical slots is greater than the number of virtual slots, that is,

this may occur, for example, if the UE is indicated with slots for multi-slot PUSCH processing, and when the UE determines virtual slots from physical slots, some slots are determined to be unsuitable for UL transmission, the UE has different mapping options.

For the first option, the UE may successively map virtual slots to physical slots in their respective order. If a physical slot is not suitable for transmission, the physical slot is skipped without skipping the corresponding virtual slot. For example, the set of virtual slots may be numbered from 1 to 4, the physical slots from 1 to 5, the third slot of which is not appropriate. Then, the mapping from virtual to physical is: 1-1, 2-2, 3-4 and 4-5.

For the second option, the UE may continuously map the virtual slots to the physical slots in their respective order. If a physical slot is not suitable for transmission, the slot is skipped and the corresponding virtual slot is also skipped. For example, assume that the virtual slot set is numbered 1 to 4, the physical slot is numbered 1 to 5, and the third slot is not suitable. Then, the mapping from virtual to physical is: 1-1, 2-2, 4-4 and nothing-5 (none of-5).

It is clear from the example that some physical slots may not eventually have any content mapped from the virtual slots. In such a case, the UE may avoid sending anything in those particular time slots. Alternatively, the UE may retransmit other virtual slots of those physical slots. For example, in the above example of the mapping result of nothing-5, the nothing-5 mapping may be replaced with 1-5 or 4-5. Another possibility is that some virtual slots may not be mapped to any physical slots.

UCI multiplexing for multi-slot PUSCH

One technique that may prevent UCI multiplexing with multi-slot PUSCH is that a UE may not expect to have UCI multiplexing with multi-slot PUSCH. Alternatively, the UE may be instructed to process UCI multiplexing with multi-slot PUSCH in a manner that does not result in UCI multiplexing actually occurring. For example, if such a multiplexing situation occurs, the UE may cancel UCI transmission or multi-slot PUSCH transmission. In case of cancellation of multi-slot PUSCH transmission, the affected slot may be cancelled, or both the affected slot and all subsequent slots may be cancelled. In the event that such cancellation occurs, the UE should desire to cancel transmission in the OFDM symbol within the appropriate cancellation timeline.

Fig. 30 depicts an example scenario in which a multi-slot PUSCH is scheduled and UCI has been scheduled for multiplexing in one of the slots forming the multi-slot PUSCH. In fig. 30, for slots 3002-3004, multi-slot PUSCH scheduling occurs at 3001. After multi-slot PUSCH scheduling, the UCI PDSCH is scheduled at 3005 for

slots

3006 and 3003.

The situation depicted in fig. 30 is considered in fig. 31 from the point of view of the timeline and then from the point of view of performance. Different approaches to handling UCI multiplexing are as follows. That is, when the UE determines that UCI multiplexing will occur with one or more slots in a multi-slot PUSCH, the following options may be performed.

As a first option, the UE may adapt the interleaver output for all slots in the multi-slot PUSCH. For this option, the Rel-16 timeline associated with UCI multiplexing on multi-slot PUSCH (indicated as timeline 1 in fig. 31) should be adapted to provide sufficient time to accommodate the possibly earlier slots in the multi-slot PUSCH before the slot where UCI multiplexing takes place. It is sufficient to adjust only timeline 1 in fig. 31 to determine the interleaver behavior in case the UCI multiplexing is valid. Timeline 2 in fig. 31 allows the UE to determine the exact value of the UCI bits to be multiplexed, which may not require similar adaptation as Rel-16 timeline 1 in fig. 31. Alternatively, both

timelines

1 and 2 in FIG. 31 may be adapted similar to the adaptation provided for timeline 1. This method is applicable to all previously described embodiments of RM and interleaver operation.

From a performance perspective, this may allow the UE to inherently have multiplexing behavior in Rel-16, i.e., the UE may recalculate RM output and interleaver output for the updated amount of available resources after UCI multiplexing. This may also allow UCI multiplexing to be easily handled from a UE implementation perspective. However, this may be quite limited from a scheduling perspective.

The UE may adapt the interleaver output for the affected slot and possibly later slots by puncturing the interleaver output at the positions where the REs will be used to transmit symbols carrying UCI bits. This solution may lead to erroneous decoding of the multi-slot PUSCH. That is, puncturing REs for UCI bits may remove important coded bits of CBs carried in punctured slots, which may severely reduce the probability of successful decoding of affected CBs. Such adverse effects associated with unsuccessful decoding may be present in all puncturing instances. Fig. 32 and 33 depict punctured slots of embodiment 1 and embodiment 2 for RM and interleaver operation, respectively.

For embodiments 1 and 1a, interleaving of the entire slot for the affected CB has already occurred and cannot be redone. In other words, for CBs mapped on M time slots, the interleaved input sequence may be e ₀ ,e ₁ ,…,e _E-1 Is given in

And E _i Is the number of coding bits available in the ith slot. The interleaved output sequence is then f ₀ ,f ₁ ,…,f _E-1 Therein from

To

Corresponds to the bits mapped in slot i. If UCI multiplexing occurs in slot i and if the resulting rate match size becomes E' _i Then UE shall be

To

Is selected from the bits of' _i Bits to transmit. One way to do this might be from

To

To be transmitted. This corresponds to successive bit selection/puncturing from the interleaver output. Another method may be used for successive bit selection/puncturing from the interleaver input, which may be implemented as follows. First, with

To

Outputs a corresponding original interleaver input sequence e ₀ ,e ₁ ,…,e _E-1 In E _i A bit position is selected. Then, can be derived from these E _i Selecting specific E 'from the values' _i Bits, and corresponding E 'in the original interleaver output' _i The value may be transmitted. One possible E' _i The selection of bits may be as follows _i The increasing order of the middle bit positions. In such a case, as described above, the interleaver operation may no longer be performed due to the rate matching size change. E' _i The general selection of bits may be by selecting bits

Wherein the function Φ (i) is a selection function for determining which bit is selected at the ith position. The function Φ (i) = i corresponds to one possible choice described earlier.

If UCI multiplexing occurs in slot i and if the resulting rate matching size becomes E' _i Another alternative may be to perform the interleaving again. One way to perform interleaving again may be with the slave

To

Outputs a corresponding original interleaver input sequence e ₀ ,e ₁ ,…,e _E-1 Of medium is selected from E' _i The bit positions serve as a new interleaver input sequence. An interleaver operation may then be applied to the sequence to obtain a new interleaver output sequence. This corresponds to successive bit selection/puncturing from the interleaver output. Another option may be to be from

To

Outputs a corresponding original interleaver input sequence e ₀ ,e ₁ ,…,e _E-1 Middle selection E _i A bit position. This corresponds to successive bit selection/puncturing from the interleaver input. Then, new length E' _i Interleaving sequence

Is restricted and an interleaver operation may be applied to the sequence to obtain a new interleaver output sequence. In such a case, re-execution of the interleaver operation may be limited to slot i. E' _i The general selection of bit positions can be done using a similar function phi (i) as described before.

If UCI multiplexing occurs in slot i and if the resulting rate matching size becomes E' _i Then another alternative may be to use length

The sequence performs interleaving with all subsequent slots as a new interleaver input. Such an interleaver input sequence may be passed through an original interleaver input sequence e from successive interleaver inputs or outputs as described previously ₀ ,e ₁ ,…,e _E-1 In which a particular one is selected

Is formed by the bit positions of (a). One possible method is to slave

To f _E-1 Outputs a corresponding original interleaver input sequence e ₀ ,e ₁ ,…,e _E-1 In selection

A bit position. One possible method is to utilize

To

This corresponds to successive bit selection/puncturing from the interleaver output. Alternatively, as previously described, successive bit selections/punctures from the interleaver input may be utilized, or a generalized selection function Φ (i) may be used.

Another consideration may relate to each CBE 'if slot i contains multiple CBs' _i How to be calculated. For example, consider each E _i,1 And E _i,2 Has two CBs mapped in time slot i of the original RM size, which corresponds to the total RM size E _i ＝E _i,1 +E _i,2 And considering reduction of total RM size to E 'due to UCI multiplexing' _i . Then, there are several possible methods to calculate the new RM size E 'of each CB' _i , ₁ And E' _i , ₂ Satisfy E' _i ＝E′ _i,1 +E′ _i,2 Comprises the following steps:

equal size: e' _i,1 ＝E′ _i,2 ＝E′ _i /2；

Equal reduction: e' _i,1 ＝E _i,1 -(E _i -E′ _i )/2、E′ _i,2 ＝E _i,2 -(E _i -E′ _i )/2；

Weighting size:

(or

) Or is

)、

(or E′ _i , ₂ ＝E′ _i -E′ _i,1 ) (ii) a Or

Weight reduction:

(or

) Or is

)、

(or E' _i,2 ＝E′ _i -E′ _i,1 )。

This solution can be quite complex from a UE implementation point of view and from an impact on the specification.

An alternative to the previous approach may be to let the UE re-determine the RM output for all slots containing CBs affected by UCI multiplexing. This involves timeline adaptation to allow sufficient time for the UE to perform the relevant processing before the first slot containing the affected CB. There are three options for timeline adaptation, two of which are depicted in FIG. 34, with FIG. 34 depicting a timeline having four slots 3401-3404 and four codeblocks CB ₁ -CB ₄ The multi-slot shared channel.

A first option may be to provide enough time to do soThe timeline for performing the correlation process begins with the first slot containing the affected CB. In FIG. 34, the timeline for the first option 3405 is taken from the list containing CB ₄ Beginning slot 3403 begins. A second option may be that the timeline 3406 begins with a first slot containing a CB that is not present in an earlier slot. In fig. 34, the timeline begins with time slot 3402, the first time slot before time slot 3404 containing code blocks that are not present in the earlier time slot (i.e., CB) ₂ ). A third option may be that a timeline allowing sufficient time to perform the correlation process starts from the first slot of the multi-slot PUSCH.

For embodiments 2 and 2a, which depend on the slot-based interleaver configuration, the ue may re-determine the RM output for the affected slot and possibly later slots. This may 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, E 'results when slots i i are affected by UCI multiplexing' _i New RM size and original E _i By contrast, it is possible to select

From the original input sequence

To select a new interleaver input sequence. In such a case, the interleaving of the input sequence for all subsequent time slots k may be based on

Adjusting, or retaining, with

The same is true. Alternatively, as previously described, a new interleaved input sequence is selected from the original input sequence using the generalized selection function Φ (i). Another consideration may relate to each CBE 'if slot i contains multiple CBs' _i How it is calculated and the previously described variants can be applied.

With such an implementation, the UE may also perform intelligent RM determination operations that allow for better decoding performance of the affected CBs. This operation can be explained in the following example. Consider the example shown in fig. 35, where a multislot PUSCH spans two slots with three CBs, RV3, and an RM output is shown for each CB.

It is assumed that UCI multiplexing occurs on the second slot of the multi-slot PUSCH, which results in a portion of the coded bits in slot 2 no longer being available for CBs in PUSCH. When adapting the RM output of CBs affected by bits that are no longer available, one option may be to reduce the amount of available coded bits on average among those affected bits. However, such an approach may not provide optimal decoding performance for TBs, as shown in fig. 36, where fig. 36 depicts RM output for a multi-slot PUSCH with two-slot, three CB, RV3, and UCI multiplexing. The affected RM outputs are treated equally. In such a case, CB2 is considerably adversely affected since the systematic bits output by the RM are omitted. No adverse reaction of CB 3.

A better technique than that depicted in fig. 36 may be to adapt the RM output of the two CBs differently depending on the type of coded bits included. For example, one RM output may be to reduce the amount of parity bits from two CBs equally until all parity bits are omitted for one CB, then all remaining omissions may be distributed among the CBs with the remaining parity bits, and so on. Fig. 37 depicts the method, which depicts RM output with two slots, three CBs and RV3, and a multislot PUSCH with UCI multiplexing. The RM output of the affected CB holds the systematic bits.

In the example shown in fig. 38, the RM output of each CB of a multi-slot PUSCH spanning four slots with three CBs having RV0 is depicted.

Consider the example case where UCI multiplexing occurs on the third slot of a multi-slot PUSCH, which results in a portion of the coded bits in slot 3 no longer being used for CBs in the PUSCH. Fig. 39 depicts an RM output corresponding to fig. 38, where the amount of available coded bits is equally reduced in the affected bits. In such a case, CB3 suffers from a rather negative impact (even for systematic bits like RM output)This small number of omitted bits). No effect of CB2 occurs. Fig. 40 depicts RM output corresponding to fig. 38, with the affected CBs holding systematic bits. Implementation of the Smart RM determination method may be to determine a New RM output size E 'for each CB in the affected time slot i' _i To (3) is described. If RM output of CB at time slot i before UCI multiplexing is as

The RM output of the UCI-multiplexed CB is

Then, E 'of each CB in time slot i may be determined using the following option' _i The value is obtained.

A first option might determine E 'of each CB in an affected time slot i' _i The values are equal.

A second option might be to let the number of CBs in slot i be K. For CB number K in K CBs, let the amount of information bit and parity check bit originally scheduled to be transmitted in time slot i be b respectively _k And p _k 。E′ _i Is also relabeled as

To distinguish the new RM size for each CB. Let the new RM size of slot i equal E' _i . Then, set up

Is equal to min (E' _i /K,p ₁ ,p ₂ ,…,p _K ). If it is not

Then p will be _k All values of (2) are reduced

And consider having a non-zero p _k CB of a value of (a), which is largeA new set of CBs as small as K. Of this set of CBs

Increase is equal to

The amount of (c). If it is not

Then if p is the original K CBs for all _k =0, for all original K CBs

By an amount up to

If p is _k Not equal to 0, and then determining whether or not

And (6) repeating.

For all embodiments disclosed herein, operations may be performed per transport block if the transport block includes a single code block, or per code block if the transport block includes multiple code blocks. The described operations do not depend on how the coded bits corresponding to a code block are mapped to time resources. Fig. 41 depicts an example of a potential mapping of code bits to time resources, where one transport block includes three code blocks and the code bits are mapped to four slots 4101-4104. In a first example mapping mechanism depicted at the top of fig. 41, distributed code block mapping distributes the code bits from each code block to all time slots. In a second example mapping scheme, depicted at the bottom of fig. 41, continuous/localized code block mapping maps the code bits from a code block sequentially to all slots. In both of these example mapping mechanisms (and mapping mechanisms not explicitly described), the operations described herein may be performed per code block, with the output of the operations described herein, if further mapped to a slot, mapped according to the mapping mechanism used. For example, for a continuous rate matching operation, the amount of continuous coded bits to be mapped to each code block of all slots is selected, regardless of whether the code block exists in two slots or four slots. As another example, for a rate matching operation based on segmentation of the RV index, the rate matching operation may select a set of specific coded bits to map into each slot for each code block, where for each slot, the set of coded bits is selected based on the RV index. This is independent of whether a code block is present in two or four time slots. For example, similar behavior may exist for other rate matching operations and interleaver operations. Additionally, although other figures herein may be understood as describing different embodiments in a continuous/localized code block mapping fashion, it should be understood that other mappings may be applicable, including but not limited to distributed code block mapping.

Embodiments of the subject matter and the 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 computer storage media for execution by, or to control the operation of, data processing apparatus. Alternatively or in addition, the program instructions may be encoded on an artificially generated propagated signal (e.g., a machine-generated electrical, optical, or electromagnetic signal) that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. The computer storage medium may 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 thereof. Further, although the computer storage medium is not a propagated signal, the computer storage medium can be a source or destination of computer program instructions encoded in an artificially generated propagated signal. The computer storage medium may 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.

While this specification may include many specific implementation details, the implementation details should not be construed as limitations on the scope of any claimed subject matter, but rather as descriptions of features specific to particular embodiments. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. In contrast, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Furthermore, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In some cases, multitasking and parallel processing may 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 together in a single software product or packaged into multiple software products.

Thus, particular embodiments of the subject matter are described herein. Other embodiments are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some implementations, multitasking and parallel processing may be advantageous.

As will be recognized by those skilled in the art, the innovative concepts described herein can be modified and varied over a wide range of applications. Accordingly, the scope of the claimed subject matter should not be limited to any of the specific exemplary teachings discussed above, but is instead defined by the following claims.

Claims

1. A transport block processing chain for a transmitter, comprising:

code block determination circuitry configured to determine a size of a code block mapped across a plurality of time slots of a wireless physical shared channel configured according to a multi-slot transport block (TBoMS); and

a rate matching circuit configured to rate match bits of the code block to a number of bits available in a transport block spanning the plurality of slots of the wireless physical shared channel.

2. The transport block processing chain of claim 1, wherein the plurality of time slots of the wireless physical shared channel configured in accordance with the TBoMS is based at least in part on a legacy maximum Transport Block Size (TBS).

3. The transport block processing chain of claim 1, wherein the plurality of time slots of the wireless physical shared channel configured in accordance with the TBoMS is based at least in part on a predetermined number of code blocks.

4. The transport block processing chain of claim 3, wherein the predetermined number of code blocks is based at least in part on a legacy maximum number of code blocks.

5. The transport block processing chain of claim 1, wherein the plurality of time slots of the wireless physical shared channel configured according to the TBoMS is based at least in part on a maximum Transport Block Size (TBS) set forth in a standards document.

6. The transport block processing chain of claim 1, further comprising an interleaver configured to interleave successive outputs of the rate matching circuit based on time slots such that code blocks spanning a time slot boundary between a first time slot and a second time slot are interleaved within the first time slot and the second time slot.

7. A transport block processing chain for a transmitter, comprising:

code block determination circuitry configured to determine a size of a code block mapped across at least one slot boundary of a slot of a wireless physical shared channel;

a rate matching circuit configured 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 wireless physical shared channel; and

an interleaver configured to interleave successive outputs of the rate matching circuit based on slots such that code blocks spanning a slot boundary between a first slot and a second slot are interleaved within the first slot and the second slot.

8. The transport block processing chain of claim 7, wherein the code block spanning the slot boundary between the first slot and the second slot is segmented with a redundancy version corresponding to the second slot,

wherein the output of the rate matching circuit is limited to a predetermined number of time slots, and

wherein the interleaver is further configured to interleave the output of the rate matching circuit across the predetermined number of time slots.

9. The transport block processing chain of claim 8, wherein the code block determination circuit is further configured to determine a code block size mapped across multiple time slots of a wireless physical shared channel configured according to a multi-slot transport block (TBoMS), and

wherein the rate of the rate matching circuit is further configured to match bits of the code block to a number of bits available in a transport block spanning the plurality of slots of the wireless physical shared channel.

10. The transport block processing chain of claim 8, wherein the plurality of time slots of the wireless physical shared channel of the tbos configuration is based at least in part on a predetermined number of code blocks, a maximum Transport Block Size (TBS) set forth in a standard document, or a combination thereof.

11. A method for processing data to be mapped to transport blocks, the method comprising:

determining, by a code block determination circuit, a size of a code block of data mapped across a plurality of time slots of a wireless physical shared channel configured according to a multi-slot transport block (TBoMS); and

rate matching, by a rate matching circuit, bits of a code block to a number of bits available in a transport block spanning the plurality of slots of the wireless physical shared channel.

12. The method of claim 11, wherein the plurality of time slots of the wireless physical shared channel configured in accordance with the TBoMS is based at least in part on a legacy maximum Transport Block Size (TBS).

13. The method of claim 11, wherein the plurality of time slots of the wireless physical shared channel configured in accordance with the TBoMS is based at least in part on a predetermined number of code blocks.

14. The method of claim 13, in which the predetermined number of code blocks is based at least in part on a legacy maximum number of code blocks.

15. The method of claim 11, wherein the plurality of time slots of the wireless physical shared channel configured according to the tbos is based, at least in part, on a maximum Transport Block Size (TBS) set forth in a standards document.

16. The method of claim 11, further comprising interleaving, by an interleaver, successive outputs of the rate matching circuit on a slot basis such that code blocks spanning a slot boundary between a first slot and a second slot are interleaved within the first slot and the second slot.

17. A method for processing data to be mapped to transport blocks, the method comprising:

determining, by code block determination circuitry, a size of a code block of data mapped across at least one slot boundary of a slot of a wireless physical shared channel;

rate matching, by a rate matching circuit, bits of a code block to a number of bits available in the transport block across one or more time slots of a wireless physical shared channel; and

interleaving, by an interleaver, successive outputs of the rate matching circuit on a slot basis such that code blocks spanning a slot boundary between a first slot and a second slot are interleaved within the first slot and the second slot.

18. The method of claim 17, further comprising segmenting, by the code block determination circuit, the code block spanning 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 time slots,

the method also includes interleaving, by the interleaver, the output of the rate matching circuit across the predetermined number of time slots.

19. The method of claim 18, further comprising:

determining, by the code block determination circuit, a size of a code block mapped across a plurality of time slots of the wireless physical shared channel configured according to a multi-slot transport block (TBoMS), and

rate matching, by the rate matching circuit, bits of the code block to the number of bits available in the transport block across the plurality of slots of the wireless physical shared channel.

20. The method of claim 19, wherein the plurality of time slots of the wireless physical shared channel configured according to the TBoMS is based at least in part on a predetermined number of code blocks, a maximum Transport Block Size (TBS) set forth in a standard document, or a combination thereof.