Channel coding for physical uplink shared channels (PUSCH)

Abstract

The UE includes a computer-readable medium storing instructions for coding PUSCH, and a processor. The processor is configured to determine several PUSCH iterations. The processor selects a first RV sequence containing a first group of unique RVs. If the UE is not configured to group PUSCH iterations, the processor applies a unique RV from the first group of unique RVs to each of the PUSCH iterations. If the UE is configured to group PUSCH iterations, the processor groups the PUSCH iterations into one or more groups of iterations, extending the first RV sequence to a second RV sequence by repeating each unique RV from the first RV sequence multiple times in the second RV sequence, and applying different RVs from the second group of RVs to each group of PUSCH iterations so that the same RV is assigned to each of the group iterations.

Description

[Technical Field]

[0001] This technology generally relates to wireless communication, and more specifically, to identifying and handling uplink transmission collisions. [Background technology]

[0002] Due to the enormous increase in the number of connected devices and the rapid increase in user / network (NW) traffic volume, 5th generation (5 th Various efforts are being made to improve different aspects of wireless communication in next-generation wireless communication systems such as 5G and New Radio (NR). Such improvements include improving data rate, latency, reliability, and mobility.

[0003] The 5G NR system is designed to provide flexibility and configurability for optimizing network services and types, and is therefore suitable for a variety of use cases, including enhanced mobile broadband (eMBB), massive machine-type communication (mMTC), and ultra-reliable and low-latency communication (URLLC).

[0004] However, as the demand for wireless access continues to increase, further improvements in wireless communication are needed in next-generation wireless communication systems. [Overview of the Initiative]

[0005] In one embodiment, user equipment (UE) includes one or more non-temporary computer-readable media storing one or more computer-executable instructions for channel coding of a physical uplink shared channel (PUSCH), and at least one processor coupled to one or more non-temporary computer-readable media, which executes one or more computer-executable instructions to cause the UE to determine a plurality of PUSCH iterations for the UE's uplink (UL) PUSCH transmission, and to channel code the plurality of PUSCH iterations, a first plurality of unique redundant versions (redundancy The system includes at least one processor configured to select a first RV sequence containing version (RV), determine whether the UE is configured to group multiple PUSCH iterations into one or more groups of PUSCH iterations, apply a unique RV from the first multiple unique RV to each PUSCH iteration of the multiple PUSCH iterations if the UE is not configured to group multiple PUSCH iterations, and if the UE is configured to group multiple PUSCH iterations, group the multiple PUSCH iterations into one or more groups of PUSCH iterations, each group of PUSCH iterations containing two or more sets of PUSCH iterations, and extend the first RV sequence into a second RV sequence containing a second multiple RV, where each unique RV from the first RV sequence is repeated multiple times in the second RV sequence, and apply a different RV from the second multiple RV to each group of PUSCH iterations such that the same RV is assigned to each of the two or more sets of PUSCH iterations in the group.

[0006] In one embodiment, a method for channel coding a physical uplink shared channel (PUSCH) involves determining a plurality of PUSCH repetitions for an uplink (UL) PUSCH transmission by a UE; selecting a first RV sequence containing a first plurality of unique redundant versions (RVs) to channel code the plurality of PUSCH repetitions; determining whether the UE is configured to group the plurality of PUSCH repetitions into one or more groups of PUSCH repetitions; and, if the UE is not configured to group the plurality of PUSCH repetitions, applying a unique RV from the first plurality of unique RVs to each PUSCH repetition of the plurality of PUSCH repetitions; and if the UE is configured to group the plurality of PUSCH repetitions If configured to group PUSCH iterations, the configuration includes: grouping multiple PUSCH iterations into one or more groups of PUSCH iterations, each group of PUSCH iterations containing two or more sets of PUSCH iterations; extending a first RV sequence into a second RV sequence containing a second plurality of RVs, each unique RV in the first RV sequence being repeated multiple times in the second RV sequence; and applying different RVs from the second plurality of RVs to each group of PUSCH iterations such that the same RV is assigned to each of the two or more sets of PUSCH iterations in the group. [Brief explanation of the drawing]

[0007] The aforementioned and other objectives, features, and advantages of the technology disclosed herein will be evident from the following more specific description of preferred embodiments, as shown in the accompanying drawings. In the drawings, reference letters refer to the same parts across the various drawings. The drawings are not necessarily to scale, but rather focus on illustrating the principles of the technology disclosed herein. [Figure 1] This is a schematic diagram illustrating a wireless communication system according to an exemplary implementation of the present disclosure. [Figure 2A]This figure shows parameters related to subcarrier spacing (SCS) intrinsic carriers in an exemplary implementation of the present disclosure. [Figure 2B] This figure shows parameters related to subcarrier spacing (SCS) intrinsic carriers in an exemplary implementation of the present disclosure. [Figure 3] This figure shows an exemplary configuration of an SCS-specific carrier in an exemplary implementation of the present disclosure. [Figure 4] This figure shows an exemplary configuration of a resource grid according to the exemplary implementation and modes of this disclosure. [Figure 5] This is a schematic block diagram showing an example configuration of a base station device according to an exemplary implementation of the present disclosure. [Figure 6] This is a schematic block diagram illustrating an example configuration of a terminal device based on an exemplary implementation of the present disclosure. [Figure 7] This figure shows an exemplary configuration of a synchronization signal / physical broadcast channel (SS / PBCH) block, including a primary synchronization signal (PSS) and a secondary synchronization signal (SSS), according to an exemplary implementation of the present disclosure. [Figure 8] This is a time-frequency diagram showing exemplary resource allocation in a serving cell, based on an exemplary implementation of the present disclosure. [Figure 9] This is a time-frequency diagram showing an exemplary PUSCH allocation in a serving cell, according to an exemplary implementation of the present disclosure. [Figure 10] This figure shows an example of a circular buffer for rate matching operation according to an exemplary implementation of the present disclosure. [Figure 11]This is a time-frequency diagram illustrating one embodiment of the handling of collisions between PUCCH and PUSCH when OCC is not applied to PUSCH, according to an exemplary implementation of the present disclosure. [Figure 12] This is a time-frequency diagram illustrating one embodiment of a PUSCH iteration according to an exemplary implementation of the present disclosure. [Figure 13] This is a time-frequency diagram illustrating an example of a collision between PUCCH and PUSCH repeats in an exemplary implementation of the present disclosure. [Figure 14] This is a time-frequency diagram illustrating an example of a collision between PUCCH and PUSCH iterations when OCC is applied to PUSCH iterations, according to an exemplary implementation of the present disclosure. [Figure 15] This is a flowchart of an exemplary method / process by an exemplary implementation of the present disclosure, in which OCC is applied to a PUSCH iteration, and if PUCCH collides with one of the PUSCH iterations, the UE takes action to drop PUCCH and stop sending UCI. [Figure 16] This is a time-frequency diagram illustrating one embodiment of an exemplary implementation of the present disclosure, in which PUSCH iterations are grouped into several groups of iterations. [Figure 17] This time-frequency diagram illustrates one embodiment of an exemplary implementation of the present disclosure, which provides a timeline threshold for the UE to determine whether all PUSCH iterations should be dropped if OCC is applied to PUSCH iterations and there is a conflict between PUCCH and one of the PUSCH iterations. [Figure 18] This is a flowchart of an exemplary method / process according to an exemplary implementation of the present disclosure, in which OCC is applied to PUSCH iterations and executed by the UE to drop all PUSCH iterations if PUCCH conflicts with one of the PUSCH iterations. [Figure 19]This is a flowchart of an exemplary method / process by an exemplary implementation of the present disclosure, in which OCC is applied to a PUSCH iteration, and if PUCCH collides with one of the PUSCH iterations, the PUCCH is dropped and the UCI transmission of PUCCH on the PUSCH iteration is piggybacked, as performed by the UE. [Figure 20] This figure shows an example of a circular buffer for rate matching operation according to an exemplary implementation of the present disclosure. [Figure 21] This is a time-frequency diagram illustrating one embodiment of an exemplary implementation of the present disclosure, in which PUSCH iterations are grouped into several groups of iterations and RV is mapped to the iterations. [Figure 22] This is an exemplary diagram showing a table defining the RV assignment for the nth PUSCH iteration, according to an exemplary implementation of the present disclosure. [Figure 23] This is a flowchart of an exemplary method / process performed by the UE for channel coding of PUSCH, according to an exemplary implementation of the present disclosure. [Modes for carrying out the invention]

[0008] In a first aspect of this application, a user device (UE) is provided. The UE includes one or more non-temporary computer-readable media storing one or more computer-executable instructions for channel coding of a physical uplink shared channel (PUSCH), and at least one processor coupled to one or more non-temporary computer-readable media. The at least one processor executes one or more computer-executable instructions to cause the UE to determine several PUSCH iterations for the UE's uplink (UL) PUSCH transmission, to select a first RV sequence including a first group of unique redundant versions (RVs) for channel coding the several PUSCH iterations, to cause the UE to determine whether the several PUSCH iterations are configured to group into one or more groups of PUSCH iterations, and if the UE is not configured to group the several PUSCH iterations, to apply a unique RV from the first group of unique RVs to each PUSCH iteration of the several PUSCH iterations, and the UE to channel coding several PU If configured to group SCH iterations, the system is configured to group several PUSCH iterations into one or more groups of PUSCH iterations, where each group of PUSCH iterations contains two or more sets of PUSCH iterations, and to extend a first RV sequence into a second RV sequence containing a second group of RVs, where each unique RV in the first RV sequence is repeated multiple times in the second RV sequence, and to apply different RVs from the second group of RVs to each group of PUSCH iterations, where the same RV is assigned to each of the two or more sets of PUSCH iterations in the group.

[0009] In one implementation of the first embodiment, the number of times each unique RV in the first RV sequence is repeated in the second RV sequence is based on radio resource control (RRC) messages received from the base station (BS).

[0010] In another implementation of the first embodiment, grouping several PUSCH iterations into one or more groups includes applying an orthogonal cover code (OCC) to the UL PUSCH transmission.

[0011] In another implementation of the first embodiment, the number of times each unique RV in the first RV sequence is repeated in the second RV sequence is based on the length of the OCC.

[0012] In another implementation of the first embodiment, OCC is applied to the PUSCH transmission to multiplex a UE's PUSCH transmission with one or more other UEs' PUSCH transmissions in the time domain.

[0013] In another implementation of the first embodiment, all PUSCH iterations within each set of two or more PUSCH iterations are required by the receiver to decode the UL data carried by the set of two or more PUSCH iterations.

[0014] In another implementation of the first embodiment, the UL data carried by a set of two or more PUSCH iterations includes a first UL data for a PUSCH transmission of a UE and a second UL data for a second PUSCH transmission of at least one other UE.

[0015] In another implementation of the first embodiment, the UE and at least one other UE transmit the first and second UL data to at least one satellite via a non-terrestrial network (NTN).

[0016] In another implementation of the first embodiment, at least one RV in each of the first and second RV sequences includes several systematic bits that carry UL PUSCH data.

[0017] In another implementation of the first embodiment, at least one RV in each of the first and second RV sequences includes several parity bits to provide reliability for decoding the PUSCH transmission by the receiver.

[0018] In another implementation of the first embodiment, at least one processor is configured to execute one or more computer executable instructions to cause a UE to store some coded bits in a circular buffer to perform a rate matching operation, and, if the UE is not configured to group some PUSCH iterations, further to cause the coded bits in at least a portion of the circular buffer to be assigned to a first group of RVs, and to write the coded bits in the portion of the circular buffer assigned to the first RV sequence to an output sequence of the rate matching operation.

[0019] In another implementation of the first embodiment, the size of the circular buffer and the length of the output sequence of the rate-matching operation determine the number of parity bits written to the output sequence of the rate-matching operation.

[0020] In another implementation of the first embodiment, at least one processor is configured to execute one or more computer executable instructions to cause a UE to store some coded bits in a circular buffer for performing a rate matching operation, and if the UE is configured to group some PUSCH iterations, further to cause the coded bits in at least a portion of the circular buffer to be assigned to a second group of RVs, and to write the coded bits in the portion of the circular buffer assigned to the second RV sequence to an output sequence of the rate matching operation.

[0021] In another implementation of the first embodiment, the size of the circular buffer and the length of the output sequence of the rate-matching operation determine the number of parity bits written to the output sequence of the rate-matching operation.

[0022] A second aspect provides a method for channel coding PUSCH. The method involves determining several PUSCH repetitions for a UE's UL PUSCH transmission; selecting a first RV sequence containing a first group of unique RVs to channel code the several PUSCH repetitions; determining whether the UE is configured to group several PUSCH repetitions into one or more groups of PUSCH repetitions; if the UE is not configured to group several PUSCH repetitions, applying a unique RV from the first group of unique RVs to each PUSCH repetition of the several PUSCH repetitions; and if the UE is configured to group several PUSCH repetitions, The method includes: grouping some PUSCH iterations into one or more groups of PUSCH iterations, each group of PUSCH iterations containing two or more sets of PUSCH iterations; extending a first RV sequence into a second RV sequence containing a second group of RVs, each unique RV in the first RV sequence being repeated multiple times in the second RV sequence; and applying different RVs from the second group of RVs to each group of PUSCH iterations such that the same RV is assigned to each of the two or more sets of PUSCH iterations in the group.

[0023] The following description contains specific information relating to exemplary implementations in this disclosure. The detailed descriptions of the drawings and their appendices in this disclosure are solely for illustrative purposes. However, this disclosure is not limited to these exemplary implementations. Other variations and implementations of this disclosure will be conjured up by those skilled in the art. Unless otherwise noted, similar or corresponding elements between drawings may be indicated by similar or corresponding reference numbers. Furthermore, the drawings and examples in this disclosure are generally not to scale and are not intended to correspond to actual relative dimensions.

[0024] For consistency and ease of understanding, similar features may be identified by the same number in illustrative diagrams (though not illustrated in some examples). However, features in different implementations may differ in other respects and are therefore not strictly limited to those shown in the diagrams.

[0025] The descriptions use the phrases “in one implementation” or “in several implementations,” which may each refer to one or more of the same or different implementations. The term “combined” is defined as being connected, whether directly or indirectly through intervening components, and is not necessarily limited to physical connections. The term “comprising,” when used, means “including, but not necessarily limited to,” specifically indicating open-ended inclusion or membership in such combinations, groups, series, and equivalents. In addition, the terms “system” and “network” may be used interchangeably herein.

[0026] As used herein, the term "and / or" should be interpreted to mean one or more items. For example, the phrase "A, B, and / or C" should be interpreted to mean any of the following: A only, B only, C only, A and B (except C), B and C (except A), A and C (except B), or all of A, B, and C. As used herein, the phrase "at least one of..." should be interpreted to mean one or more items. For example, the phrase "at least one of A, B, and C" or the phrase "at least one of A, B, or C" should be interpreted to mean any of the following: A only, B only, C only, A and B (except C), B and C (except A), A and C (except B), or all of A, B, and C. As used herein, the phrase "one or more of..." should be interpreted to mean one or more items. For example, the phrase "one or more of A, B, and C" or "one or more of A, B, or C" should be interpreted as meaning A only, B only, C only, A and B (excluding C), B and C (excluding A), A and C (excluding B), or all of A, B, and C.

[0027] In addition, for explanatory and non-limiting purposes, specific details such as functional entities, techniques, protocols, and standards are included to provide an understanding of the technology being described. In other cases, detailed descriptions of well-known methods, technologies, systems, and architectures are omitted to avoid obscuring the explanation with unnecessary details.

[0028] A person skilled in the art will immediately recognize that any network function(s) or algorithm(s) described herein can be implemented by hardware, software, or a combination of software and hardware. The described functions or algorithms may correspond to modules that may be software, hardware, firmware, or any combination thereof. Software implementations may include computer-executable instructions stored on a computer-readable medium such as memory or other types of storage devices. For example, one or more microprocessors or general-purpose computers having communication processing capabilities may be programmed with the corresponding executable instructions to perform the described network functions(s) or algorithm(s). The microprocessors or general-purpose computers may include one or more application-specific integrated circuits (ASICs), programmable logic arrays, and / or one or more digital signal processors (DSPs). While some of the exemplary implementations described herein concern software installed and run on computer hardware, alternative exemplary implementations implemented as firmware, hardware, or a combination of hardware and software are also well within the scope of this disclosure.

[0029] Computer-readable media include, but are not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), flash memory, compact disc read-only memory (CD-ROM), magnetic cassettes, magnetic tapes, magnetic disk storage, or any other equivalent media capable of storing computer-readable instructions.

[0030] A wireless communication network architecture (e.g., a Long-Term Evolution (LTE) system, an LTE-Advanced (LTE-A) system, an LTE-Advanced Pro system, or a 5G NR Radio Access Network (RAN)) typically includes at least one base station (BS), at least one UE, and one or more optional network elements that provide connectivity to the network. The UE communicates with the network (e.g., a Core Network (CN), an Evolved Packet Core (EPC) network, an Evolved Universal Terrestrial Radio Access network (E-UTRAN), a 5G Core (5GC), or the Internet) via a wireless communication network established by one or more BS.

[0031] In this disclosure, UE (or terminal device) may include, but is not limited to, a mobile station, mobile terminal or device, or user communication radio terminal. For example, UE may be a portable radio device, including, but not limited to, a mobile phone, tablet, wearable device, sensor, vehicle, or personal digital assistant (PDA) having radio communication capabilities. UE is configured to receive and transmit signals to one or more cells in a radio access network via an air interface.

[0032] BS can be configured to provide communication services according to at least one of the following radio access technologies (RATs): Worldwide Interoperability for Microwave Access (WiMAX), Global System for Mobile communications (GSM, often referred to as 2G), GSM Enhanced Data rates for GSM Evolution (EDGE) Radio Access Network (EDGE Radio Access Network, GERAN), General Packet Radio Service (GPRS), Universal Mobile Telecommunication System (UMTS, often referred to as 3G) based on wideband-code division multiple access (W-CDMA), high-speed packet access (HSPA), LTE, LTE-A, evolved LTE (eLTE), eLTE, evolved LTE,

[0033] A BS may include, but is not limited to, a node B (NB) as in UMTS, an evolved node B (eNB) as in LTE or LTE-A, a radio network controller (RNC) as in UMTS, a base station controller (BSC) as in GSM / GSM Enhanced Data rates for GSM Evolution (EDGE) radio access network (GERAN), a next-generation eNB (ng-eNB) as in Evolved Universal Terrestrial Radio Access (E-UTRA) BS associated with 5GC, a next-generation node B (gNB) as in 5G Access Network (5G-AN), and any other devices capable of controlling radio communications within a cell and managing radio resources. A BS may be connected to serve one or more UEs via a radio interface to the network.

[0034] A BS may operate to provide radio coverage to a specific geographic area using several cells included in a radio communication network. The BS may support the operation of cells. Each cell may operate to serve at least one UE in its radio coverage. Specifically, each cell (often called a serving cell) may provide services to one or more UEs in its radio coverage (for example, each cell may have DL and optionally UL resources to at least one UE in its radio coverage for downlink (DL) and optionally uplink (UL) packet transmission). The BS may communicate with one or more UEs in the radio communication system via cells.

[0035] A cell may support Proximity Service (ProSe) or Vehicle to Everything (V2X) services through sidelink (SL) resources. Each cell may have overlapping coverage areas with other cells.

[0036] As explained above, the frame structure for NR is designed to support flexible configurations to adapt to various next-generation (e.g., 5G) communication requirements such as Extended Mobile Broadband (eMBB), Massive Machine Type Communications (mMTC), and Ultra-Reliable Low-Latency Communications (URLLC), while meeting high reliability, high data rate, and low latency requirements. (3rd Generation Partnership Project (3) rd Orthogonal Frequency-Division Multiplexing (OFDM) techniques agreed upon in the Generation Partnership Project (3GPP) may serve as a baseline for NR waveforms. Scalable OFDM numerology such as adaptive subcarrier spacing, channel bandwidth, and cyclic prefix (CP) may also be used. In addition, two coding schemes for NR are possible: (1) low-density parity-check (LDPC) coding and (2) polarity coding. Adaptation of coding schemes may be configured based on channel state and / or service application.

[0037] Furthermore, it should be noted that a single NR frame's transmission time interval (TTI) may include at least a DL transmission period, a guard period, and UL transmission data, and each portion of the DL transmission data, guard period, and UL transmission data should be configurable, for example, based on the NR's network dynamics. In addition, sidelink resources may also be provided within the NR frame to support ProSe services, (E-UTRA / NR) sidelink services, or (E-UTRA / NR) V2X services.

[0038] A UE configured with multi-connectivity may be connected to a master node (MN) as an anchor and one or more secondary nodes (SN) for data distribution. Each of these nodes may be formed by a cell group containing one or more cells. For example, the MN may form a master cell group (MCG), and the SN may form a secondary cell group (SCG). In other words, for a UE configured with dual connectivity (DC), the MCG may be a set of one or more serving cells containing a PCell and zero or more secondary cells. Conversely, the SCG may be a set of one or more serving cells containing a PSCell and zero or more secondary cells.

[0039] Furthermore, as described above, the Primary Cell (PCell) may be an MCG cell operating on the primary frequency, and the UE performs either the initial connection establishment procedure or initiates the connection re-establishment procedure. In DC mode, the PCell may belong to the MN. The Primary SCG Cell (PSCell) may be an SCG cell on which the UE performs random access (for example, when performing reconfiguration using a synchronization procedure). In Multi-RAT Dual Connectivity (MR-DC), the PSCell may belong to the SN. A Special Cell (SpCell) may be called an MCG PCell or an SCG PSCell, depending on whether the Medium Access Control (MAC) entity is associated with the MCG or SCG. Otherwise, the term Special Cell may refer to a PCell. A Special Cell may support Physical Uplink Control Channel (PUCCH) transmission and competition-based random access, and may always be activated. In addition, a UE in the RRC_CONNECTED state that is not configured with carrier aggregation / dual connectivity (CA / DC) may communicate with only one serving cell (SCell) that may be the primary cell. Conversely, in the case of a UE in the RRC_CONNECTED state configured with CA / DC, a set of serving cells, including one or more special cells and all secondary cells, may communicate with the UE.

[0040] According to one aspect of this embodiment, a waveform formed based on OFDM may be used in a wireless communication system. OFDM symbols define the time-domain units of the waveform. Each OFDM symbol is converted into a time-continuous signal during baseband signal generation. For example, cyclic prefix-OFDM (CP-OFDM) may be used in downlink transmission of a wireless communication system. For example, either CP-OFDM or discrete Fourier transform-spread-orthogonal frequency division multiplexing (DFT-s-OFDM) may be used in uplink transmission of a wireless communication system.

[0041] Figure 1 is a schematic diagram showing a wireless communication system according to an exemplary implementation of the present disclosure. In Figure 1, the wireless communication system 100 includes terminal devices 101A-101C and a base station device 103 (BS103). The terms base station device, base station, and BS may be used interchangeably as used herein. The terms terminal device, user equipment, and UE may be used interchangeably as used herein.

[0042] BS103 may include one or more transmitting and receiving devices. If BS103 consists of multiple transmitting and receiving devices, each of the multiple transmitting and receiving devices may be located in a different position. The transmitting and receiving devices may include a transmitting device and / or a receiving device.

[0043] BS103 may service wireless communication and provide one or more cells. A cell is defined as a set of resources used for wireless communication. A cell may include one or both of a downlink component carrier and / or an uplink component carrier. A serving cell may include a downlink component carrier and two or more uplink component carriers.

[0044] One or more SCS-specific carriers may be associated with one component carrier. Each subcarrier spacing specific (SCS-specific) carrier defines a carrier for subcarrier spacing configuration. For example, one SCS-specific carrier may be associated with either a downlink component carrier or an uplink component carrier. In another example, one SCS-specific carrier may be associated with both a downlink component carrier and an uplink component carrier.

[0045] Figures 2A and 2B are two diagrams showing parameters related to subcarrier spacing (SCS)-specific carriers according to an exemplary implementation of the present disclosure. In Figures 2A and 2B, u201 represents the subcarrier spacing configuration. N slot symb 202 represents the number of OFDM symbols in a slot. N frame,u slot 203 represents the number of slots in a radio frame. N subframe,u slot 204 and N subframe,u slot 205 represents the number of slots in a subframe for normal cyclic prefix and extended cyclic prefix, respectively.

[0046] In Figure 2A, for example, when the subcarrier spacing configuration u201 is set to 2 and the CP configuration is set to normal cyclic prefix (CP), the parameters are N slot symb = 14, N frame,u slot = 40, and N subframe,u slot = 4 are set. Further, in Figure 2B, for example, when the subcarrier spacing configuration u201 is set to 2 and the CP configuration is set to extended CP, the parameters are N slot symb = 12, N frame,u slot = 40, N subframe,u slot = 4 are set.

[0047] Time unit T c This represents the length in the time domain. The time unit T c is 1 / (df max *N f ) may also be calculated by, in the formula, df max This represents 480kHz, N f = 4096. The constant k is df max * N f / (df ref N f,ref ) may be calculated by df ref The frequency is 15kHz, and N f,ref If the constant k is 2048, then the constant k is 64.

[0048] Radio transmission on the downlink and / or radio transmission on the uplink is of length T f It may be organized into wireless frames (or system frames, frames). f (df max N f / 100) * T s Calculated by (df max N f / 100) * T s This is equal to 10ms. One wireless frame may contain 10 subframes. Subframe length T sf df max N f T s Calculated by / 1000, df max N f T s / 1000 is equal to 1ms. Number of OFDM symbols per subframe N subframe,u symb is, N slot symb N subframe,u slot It is calculated by [this method].

[0049] The SCS of an OFDM-based waveform may be calculated by the subcarrier spacing configuration u. For example, the SCS is 15000 * 2u It may also be calculated by this method.

[0050] Figure 3 shows an exemplary configuration of SCS intrinsic carriers according to an exemplary implementation of the present disclosure. The horizontal axis of Figure 3 represents the frequency domain. Figure 3 shows an example configuration of two SCS intrinsic carriers associated with component carrier 350. In Figure 3, it is assumed that u1 = u2 - 1.

[0051] Point 300 is an identifier for a specific subcarrier. Point 300 is also called Point A. Common resource blocks (CRBs) for SCS-specific carriers 310 are defined with respect to point 300. A CRB with index 0 is represented by block 331. A CRB for SCS-specific carriers 320 is defined with respect to point 300. A CRB with index 0 is represented by block 332. A CRB with index 0 is defined as a CRB in which the subcarriers within the CRB match the subcarriers identified by point 300.

[0052] In Figure 3, the bandwidth of one CRB within SCS intrinsic carrier 310 is half the bandwidth of one CRB within SCS intrinsic carrier 320. In other implementations, the bandwidth of one CRB within SCS intrinsic carrier 310 may be the same as the bandwidth of one CRB within SCS intrinsic carrier 320.

[0053] Offset 311 is a resource block level (RB level) offset from the CRB with index 0 of the SCS intrinsic carrier 310 to the reference point 321 of the resource grid 301. The reference point of the resource grid 301 is block 321. Offset 312 is an RB level offset from the CRB with index 0 of the SCS intrinsic carrier 320 to the reference point 322 of the resource grid 302. The reference point of the resource grid 302 is block 322.

[0054] Offset 313 is the RB level offset from the reference point 321 of resource grid 301 to the reference point 341 of the Bandwidth Part (BWP) 303. The reference point of BWP 303 is block 341. Offset 314 is the RB level offset from the reference point 322 of resource grid 301 to the reference point 342 of BWP 304. The reference point of BWP 304 is block 342.

[0055] Figure 4 shows an exemplary configuration of a resource grid according to the exemplary implementation and mode of this disclosure. The horizontal axis represents the OFDM symbol index l. sym This represents the subcarrier index k. The vertical axis is the subcarrier index k. sc This represents the resource grid, N size,u grid1,x N RB sc Individual subcarriers and N subframes,u symb Includes the number of OFDM symbols. Subcarrier index k in the resource grid. sc and OFDM symbol index l sym The resources specified by are also called Resource Elements (RE).

[0056] Resource blocks (RBs) are N RB sc It contains a number of consecutive subcarriers. A resource block is a general term for CRBs, Physical Resource Blocks (PRBs), and / or Virtual Resource Blocks (VRBs). In Figure 4, N RB sc This can be 12. CRBs are indexed in ascending order, starting with the CRB with index 0. PRBs are indexed in ascending order, starting from their base point in the BWP. BWP is defined as a subset of resource blocks contained in a resource grid. BWP is indexed in ascending order, starting from the base point of the BWP. size,u BWP,i Contains individual resource blocks.

[0057] An antenna port may be defined such that the channel through which a symbol on the antenna port is transmitted can be inferred from the channel through which another symbol on the same antenna port is transmitted. A channel may correspond to a physical channel. A symbol may correspond to an OFDM symbol. A symbol may correspond to a resource block unit. A symbol may correspond to a resource element.

[0058] Two antenna ports are said to be quasi-co-located (QCL) if the large-scale characteristics of a channel through which symbols are transmitted on one antenna port can be inferred from the channel through which symbols are transmitted on the other antenna port. Large-scale characteristics include one or more of the following: delay spread, Doppler spread, Doppler shift, average gain, average delay, and spatial Rx parameters. Carrier aggregation is a communication framework that uses multiple aggregated serving cells or multiple component carriers.

[0059] Figure 5 is a schematic block diagram showing an example configuration of a base station device 103 according to an exemplary implementation of the present disclosure. As shown in Figure 5, the base station device 103 may include part or all of a radio transceiver unit (also referred to herein as a physical layer processing unit) 30 and a higher layer processing unit 34. The radio transceiver unit 30 may include part or all of an antenna unit 31, a radio frequency (RF) unit 32, and a baseband unit 33. The higher layer processing unit 34 may include part or all of a media access control (MAC) layer processing unit 35 and a radio resource control (RRC) layer processing unit 36.

[0060] The wireless transceiver 30 may include part (or all) of a wireless transmitter 30a (not shown) and a wireless receiver 30b (not shown). The configuration of the baseband section 33 of the wireless transmitter 30a and the configuration of the baseband section 33 of the wireless receiver 30b may be the same or different. The configuration of the RF section 32 of the wireless transmitter 30a and the configuration of the RF section 32 of the wireless receiver 30b may be the same or different. The configuration of the antenna section 31 of the wireless transmitter 30a and the configuration of the antenna section 31 of the wireless receiver 30b may be the same or different. The wireless transceiver 30 may include at least one processor (not shown) and one or more non-temporary computer-readable media (not shown) storing computer-executable instructions and data.

[0061] The upper layer processing unit 34 may provide downlink data (e.g., transport blocks) to the wireless transceiver unit 30 (or wireless transmitter unit 30a). The upper layer processing unit 34 may perform some or all of the processing of the MAC layer, Packet Data Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer, and RRC layer. The upper layer processing unit 34 may also include at least one processor (not shown) and one or more non-temporary computer-readable media (not shown) storing computer-executable instructions and data.

[0062] The MAC layer processing unit 35 may perform MAC layer processing. The RRC layer processing unit 36 ​​may perform RRC layer processing. The RRC layer processing unit 36 ​​may manage various RRC parameters of the terminal device 101.

[0063] The wireless transceiver 30 (or wireless transmitter 30a) may perform processing such as encoding and modulation. The wireless transceiver 30 (or wireless transmitter 30a) generates a physical signal by encoding and modulating downlink data. The wireless transceiver 30 (or wireless transmitter 30a) converts the OFDM symbols of the physical signal into a baseband signal by converting them into a time-continuous signal. The wireless transceiver 30 (or wireless transmitter 30a) transmits the baseband signal (or physical signal) to the terminal device 101 via the radio frequency. The wireless transceiver 30 (or wireless transmitter 30a) may place the baseband signal (or physical signal) on a component carrier and transmit the baseband signal (or physical signal) to the terminal device 101.

[0064] The wireless transceiver 30 (or wireless receiver 30b) may perform processing such as demodulation and decoding. The wireless transceiver 30 (or wireless receiver 30b) separates, demodulates and decodes the received physical signal and provides the decoded information to the upper layer processing unit 34. The wireless transceiver 30 (or wireless receiver 30b) may perform a channel access procedure before transmitting the physical signal.

[0065] The RF unit 32 demodulates the radio signal received via the antenna unit 31 into an analog signal and / or removes unwanted frequency components. The RF unit 32 provides the processed analog signal to the baseband unit 33.

[0066] The baseband unit 33 converts the analog signal input from the RF unit 32 into a baseband signal. The baseband unit 33 separates the portion corresponding to CP from the baseband signal. The baseband unit 33 performs a Fast Fourier Transform (FFT) on the baseband signal from which CP has been removed. The baseband unit 33 extracts the physical signal component from the baseband signal. The baseband unit 33 performs an Inverse Fast Fourier Transform (IFFT) on the downlink data to generate a time-continuous signal, adds CP to the generated signal to generate a baseband signal, and converts the baseband signal into an analog signal. The baseband unit 33 provides the analog signal to the RF unit 32.

[0067] The RF unit 32 removes extraneous frequency components from the analog signal input from the baseband unit 33, upconverts the analog signal to a radio frequency, and transmits it via the antenna unit 31. The RF unit 32 may also have a function to control the transmission power.

[0068] The terminal device 101 may configure one or more downlink BWPs for each serving cell. The terminal device 101 may configure one or more uplink BWPs for each serving cell.

[0069] The terminal device 101 may attempt to detect the Physical Downlink Shared Channel (PDSCH), the Physical Downlink Control Channel (PDCCH), and the Channel State Information-Reference Signal (CSI-RS) in the active downlink BWP. The terminal device 101 may also transmit the Physical Uplink Control Channel (PUCCH) and the Physical Uplink Shared Channel (PUSCH) in the active uplink BWP. The active downlink BWP and active uplink BWP are also referred to as active BWPs.

[0070] Terminal device 101 may not receive PDSCH, PDCCH, and CSI-RS in downlink BWPs other than active downlink BWPs. Terminal device 101 may not transmit PUCCH and PUSCH in uplink BWPs other than active uplink BWPs. BWPs other than active BWPs are called inactive BWPs.

[0071] Figure 6 is a schematic block diagram showing an example configuration of a terminal device according to an exemplary implementation of the present disclosure. As shown in Figure 6, the terminal device 101 may include part or all of a wireless transceiver unit (also referred to herein as a physical layer processing unit) 10 and a higher layer processing unit 14. The wireless transceiver unit 10 may include part or all of an antenna unit 11, an RF unit 12, and a baseband unit 13. The higher layer processing unit 14 may include part or all of a MAC layer processing unit 15 and an RRC layer processing unit 16. The higher layer processing unit 14 may include at least one processor (not shown) and one or more non-temporary computer-readable media (not shown) storing computer-executable instructions and data.

[0072] The wireless transmitting / receiving unit 10 may include part or all of a wireless transmitting unit 10a (not shown) and a wireless receiving unit 10b (not shown). The wireless transmitting / receiving unit 10 may include at least one processor (not shown) and one or more non-temporary computer-readable media (not shown) that store computer executable instructions and data.

[0073] The configuration of the baseband section 13 of the wireless transmitter 10a and the configuration of the baseband section 13 of the wireless receiver 10b may be the same or different. The configuration of the RF section 12 of the wireless transmitter 10a and the RF section 12 of the wireless receiver 10b may be the same or different. The configuration of the antenna section 11 of the wireless transmitter 10a and the configuration of the antenna section 11 of the wireless receiver 10b may be the same or different.

[0074] The upper layer processing unit 14 provides uplink data (transport blocks) to the wireless transceiver unit 10 (or wireless transmission unit 10a). The upper layer processing unit 14 may also perform processing of the MAC layer, PDCP layer, RLC layer, and / or RRC layer.

[0075] The MAC layer processing unit 15 of the upper layer processing unit 14 may perform MAC layer processing. The RRC layer processing unit 16 of the upper layer processing unit 14 may perform RRC layer processing. The RRC layer processing unit 16 manages various RRC parameters of the terminal device 101 based on RRC messages received from the base station device 103.

[0076] The wireless transceiver 10 (or wireless transmitter 10a) may perform processing such as encoding and modulation. The wireless transceiver 10 (or wireless transmitter 10a) may generate a physical signal by encoding and modulating uplink data. The wireless transceiver 10 (or wireless transmitter 10a) may convert OFDM symbols in the physical signal into a baseband signal by converting to a time-continuous signal. The wireless transceiver 10 (or wireless transmitter 10a) may transmit the baseband signal (or physical signal) to the base station device 103 via a radio frequency. The wireless transceiver 10 (or wireless transmitter 10a) may place the baseband signal (or physical signal) on a BWP (Active Uplink BWP) and transmit the baseband signal (or physical signal) to the base station device 103.

[0077] The wireless transceiver 10 (or wireless receiver 10b) performs processing such as demodulation and decoding. The wireless transceiver 10 (or wireless receiver 10b) may receive a physical signal in the serving cell's BWP (Active Downlink BWP). The wireless transceiver 10 (or wireless receiver 10b) may separate, demodulate, and decode the received physical signal and provide the decoded information to the upper layer processing unit 14. The wireless transceiver 10 (or wireless receiver 10b) may perform a channel access procedure before transmitting the physical signal.

[0078] The RF unit 12 may demodulate the radio signal received via the antenna unit 11 into an analog signal and / or remove extraneous frequency components. The RF unit 12 may provide the processed analog signal to the baseband unit 13. The baseband unit 13 may convert the analog signal input from the RF unit 12 into a baseband signal. The baseband unit 13 may separate the portion corresponding to CP from the baseband signal and perform an FFT on the baseband signal from which CP has been removed. The baseband unit 13 may extract the physical signal components from the baseband signal.

[0079] The baseband unit 13 may perform an IFFT on the uplink data to generate a time-continuous signal, add a CP to the generated signal to generate a baseband signal, and convert the baseband signal to an analog signal. The baseband unit 13 may also provide the analog signal to the RF unit 12.

[0080] The RF unit 12 may remove extraneous frequency components from the analog signal input from the baseband unit 13, upconvert the analog signal to a radio frequency, and transmit it via the antenna unit 11. The RF unit 12 may also have a function to control the transmission power.

[0081] Physical signals are a collective term for physical downlink channels, physical downlink signals, physical uplink channels, and physical uplink signals. Physical channels are a collective term for physical downlink channels and physical uplink channels.

[0082] A physical uplink channel corresponds to a set of REs that carry either or both information originating from higher layers and / or uplink control information (UCI). In a wireless communication system according to one aspect of this embodiment, some or all of the PUCCH, PUSCH, and / or Physical Random Access Channels (PRACH) may be used.

[0083] PUCCH may be used to transmit UCI. PUCCH may be transmitted to deliver (transmit, propagate) uplink control information. UCI may be mapped to PUCCH. Terminal device 101 may transmit PUCCH to which UCI is mapped. Base station device 103 may receive PUCCH to which UCI is mapped.

[0084] Channel State Information (CSI) may be considered a type of UCI. CSI is used to transmit information about the propagation path between terminal device 101 and base station device 103.

[0085] Hybrid Automatic Repeat Request ACKnowledgement (HARQ-ACK) information may also be considered a type of UCI. HARQ-ACK information is used to communicate whether or not downlink data has been successfully decoded.

[0086] A scheduling request (SR) may also be considered a type of UCI. SRs are used to request uplink resources (PUSCH or UL-SCH).

[0087] Uplink control information (uplink control information bits, uplink control information sequence, uplink control information type) includes at least part or all of the CSI, SR, and HARQ-ACK.

[0088] CSI may include at least some or all of the channel quality indicator (CQI), precoder matrix indicator (PMI), and rank indicator (RI). CQI is an indicator related to channel quality (e.g., propagation quality) or physical channel quality, PMI is an indicator related to the precoder, and RI is an indicator related to transmit rank (or number of transmit layers).

[0089] The CSI may be provided based on at least the reception of one or more physical signals (e.g., one or more CSI-RS) used for channel measurement. The CSI may be selected by a terminal device based on at least the reception of one or more physical signals used for channel measurement. The channel measurement may include interference measurement.

[0090] A PUSCH may be used to transmit either or both a transport block and / or UCI. A PUSCH may be transmitted to deliver (transmit, propagate) either or both a transport block and / or uplink control information. Terminal device 101 may transmit a PUSCH on which either or both a transport block and / or UCI are mapped. Base station device 103 may receive a PUSCH on which either or both a transport block and / or UCI are mapped.

[0091] PRACH may be used to transmit a random access preamble. PRACH may be transmitted to deliver (transmit, propagate) the index of the random access preamble. Terminal device 101 may transmit PRACH. Base station device 103 may receive PRACH.

[0092] Given a PRACH opportunity, 64 random access preambles are defined. The random access preamble is a cyclic shift C of PRACH.v And it is specified (determined, given) based on the sequence index u of PRACH.

[0093] The physical uplink signal corresponds to a set of REs. The physical uplink signal does not necessarily carry information generated in the upper layer. Terminal device 101 may transmit the physical uplink signal. Base station device 103 may receive the physical uplink signal. In a wireless communication system according to one aspect of this embodiment, some or all of the Uplink Demodulation Reference Signal (UL DMRS), Sounding Reference Signal (SRS), and Uplink Phase Tracking Reference Signal (UL PTRS) may be used.

[0094] UL DMRS is a general term for DMRS for PUSCH and DMRS for PUCCH. The set of antenna ports for DMRS for PUSCH may be given based on the set of antenna ports for PUSCH. For example, the set of antenna ports for DMRS for PUSCH may be the same as the set of antenna ports for PUSCH.

[0095] PUSCH and DMRS for PUSCH are collectively referred to as PUSCH. The set of antenna ports for DMRS for PUSCH may be given based on the set of antenna ports for PUSCH. For example, the set of antenna ports for DMRS for PUSCH may be the same as the set of antenna ports for PUSCH. PUSCH and DMRS for PUSCH are collectively referred to as PUSCH.

[0096] A physical downlink channel corresponds to a set of REs that carry either or both information originating from higher layers and downlink control information (DCI). In a wireless communication system according to one aspect of this embodiment, some or all of the physical broadcast channel (PBCH), physical downlink control channel (PDCCH), and physical downlink shared channel (PDSCH) may be used.

[0097] A PBCH may be used to transmit a Master Information Block (MIB). A PBCH may be transmitted to deliver (transmit, propagate) an MIB. Terminal device 101 may receive a PBCH. Base station device 103 may transmit a PBCH.

[0098] A PDCCH may be used to transmit a DCI. A PDCCH may be transmitted to deliver (transmit, propagate) a DCI. Terminal device 101 may receive a PDCCH to which a DCI is mapped. Base station device 103 may transmit a PDCCH to which a DCI is mapped.

[0099] The DCI format includes a set of information fields. Each information field may mask a bit sequence of the DCI. Bits masked by an information field are associated with a specific meaning associated with that information field.

[0100] In a wireless communication system according to one aspect of this embodiment, several DCI formats may be used. Several exemplary DCI formats are provided.

[0101] DCI format 0_0 is used to schedule PUSCH for a cell. DCI format 0_0 includes some or all of the information fields 1A to 1E. Information field 1A is the DCI format identification field. Information field 1B is the Frequency Domain Resource Assignment (FDRA) field. Information field 1C is the Time Domain Resource Assignment (TDRA) field. Information field 1D is the frequency hopping flag field. Information field 1E is the Modulation-and-Coding-Scheme (MCS) field.

[0102] The DCI format identification field may indicate whether the DCI format containing the DCI format identification field is an uplink DCI format or a downlink DCI format. The DCI format identification field contained in DCI format 0_0 indicates that DCI format 0_0 is an uplink DCI format.

[0103] The FDRA field in the DCI format may be used to indicate the allocation of frequency resources for physical channels scheduled by the DCI format. For example, the FDRA field may indicate the number of RBs X for PUSCH.

[0104] The TDRA field in the DCI format may be used to indicate the allocation of time resources for physical channels scheduled by the DCI format.

[0105] The frequency hopping flag field in the DCI format may be used to indicate whether frequency hopping is applied to the physical channels scheduled by the DCI format.

[0106] The MCS field in the DCI format may be used to indicate either or both the modulation scheme for the physical channel scheduled by the DCI format, and / or the target code rate for the physical channel. The target code rate is used to determine the transport block size (TBS) for the physical channel.

[0107] DCI format 0_0 does not necessarily have to include fields used in CSI requests. In other words, CSI may not be required by DCI format 0_0.

[0108] DCI format 0_0 does not have to include a carrier indicator field. If the uplink DCI format does not include a carrier indicator field, terminal device 101 may determine that the uplink component carrier to which the PUSCH scheduled by the uplink DCI format is mapped is an uplink component carrier in a serving cell that includes a downlink component carrier to which a PDCCH having an uplink DCI format is mapped.

[0109] DCI format 0_0 does not have to include a BWP indicator field. If the DCI format does not include a BWP indicator field, terminal device 101 may determine that the active BWP change was not triggered by the DCI format.

[0110] DCI format 0_1 ​​may be used for scheduling pushes for cells. DCI format 0_1 ​​includes some or all of the information fields 2A to 2H. Information field 2A is the DCI format identification field. Information field 2B is the FDRA field. Information field 2C is the TDRA field. Information field 2D is the frequency hopping flag field. Information field 2E is the MCS field. Information field 2F is the CSI request field. Information field 2G is the BWP field. Information field 2H is the carrier indicator field.

[0111] The DCI format identifier field of DCI format 0_1 ​​may indicate that DCI format 0_1 ​​is an uplink DCI format.

[0112] The CSI request field may be used to request a CSI report.

[0113] If DCI format 0_1 ​​includes a BWP field, the BWP field may be used to indicate the uplink BWP to which the PUSCH scheduled by DCI format 0_1 ​​is mapped.

[0114] If DCI format 0_1 ​​includes a carrier indicator field, the carrier indicator field may be used to indicate the uplink component carrier to which PUSCH is mapped.

[0115] DCI format 1_0 may be used for scheduling PDSCH for cells. DCI format 1_0 includes some or all of information fields 3A-3F. Information field 3A is the DCI format identification field. Information field 3B is the FDRA field. Information field 3C is the TDRA field. Information field 3D is the MCS field. Information field 3E is the PDSCH-to-HARQ feedback indicator field. Information field 3F is the PUCCH resource indicator field. The DCI format identification field of DCI format 1_0 indicates that DCI format 1_0 is a downlink DCI format.

[0116] The PDSCH-to-HARQ feedback timing indicator field may be used to indicate the offset (K1) from a slot where the last OFDM symbol of a PDSCH scheduled by DCI format is located in another slot where the first OFDM symbol of a PUCCH triggered by DCI format 1_0 is mapped. The PUCCH resource indicator field may be used to indicate a PUCCH resource.

[0117] DCI format 1_0 does not have to include a carrier indicator field. If the downlink DCI format does not include a carrier indicator field, terminal device 101 may determine that the downlink component carrier to which the PDSCH scheduled by the downlink DCI format is mapped is the downlink component carrier to which the PDCCH having DCI format 1_0 is mapped. DCI format 1_0 does not have to include a BWP field.

[0118] DCI format 1_1 may be used for scheduling PDSCH for a cell. DCI format 1_1 includes some or all of the information fields 4A to 4H. Information field 4A is the DCI format identification field. Information field 4B is the FDRA field. 4C is the TDRA field. Information field 4D is the MCS field. Information field 4E is the PDSCH-to-HARQ feedback indicator field. Information field 4F is the PUCCH resource indicator field. Information field 4G is the BWP field. Information field 4H is the carrier indicator field. The DCI format identification field of DCI format 1_1 may indicate that DCI format 1_1 is a downlink DCI format.

[0119] PDSCH may be used to transmit a transport block. PDSCH may be transmitted to deliver (transmit, propagate) a transport block. Base station device 103 may transmit a PDSCH. Terminal device 101 may receive a PDSCH.

[0120] The physical downlink signal corresponds to a set of REs. The physical downlink signal does not necessarily carry information generated in the upper layers. Base station 103 transmits the physical downlink signal. Terminal device 101 may receive the physical downlink signal. In a wireless communication system according to one aspect of this embodiment, at least some or all of the synchronization signal (SS), downlink demodulation reference signal (DL DMRS), channel state information-reference signal (CSI-RS), and downlink phase tracking reference signal (DL PTRS) may be used.

[0121] Synchronization signals may be used to synchronize the downlink in the frequency and time domains. Synchronization signals are a general term for PSS (Primary Synchronization Signal) and SSS (Secondary Synchronization Signal).

[0122] Figure 7 shows an exemplary configuration of a synchronization signal / physical broadcast channel (SS / PBCH) block including a primary synchronization signal (PSS) and a secondary synchronization signal (SSS), according to an exemplary implementation of the present disclosure. In Figure 7, the horizontal axis is the OFDM symbol index l. sym The graph shows the frequency domain on the vertical axis. Shaded blocks represent sets of REs for PSS. Blocks with grid lines represent sets of REs for SSS. Blocks with horizontal lines represent sets of REs for PBCH and sets of REs for PBCH DMRS.

[0123] The SS / PBCH block in Figure 7 includes PSS, SSS, and PBCH. The SS / PBCH block includes four consecutive OFDM symbols and 240 subcarriers. PSS is assigned to subcarriers 57 through 183 in the first OFDM symbol. SSS is assigned to subcarriers 57 through 183 in the third OFDM symbol. Subcarriers 1 through 56 of the first OFDM symbol may be set to zero. Subcarriers 184 through 240 of the first OFDM symbol may be set to zero. Subcarriers 49 through 56 of the third OFDM symbol may be set to zero. Subcarriers 184 through 192 of the third OFDM symbol may be set to zero. In subcarriers 1 through 240 of the second OFDM symbol, PBCH is assigned to subcarriers to which the PBCH DMRS is not assigned. In the third OFDM symbol, subcarriers 1-48, PBCH is assigned to a subcarrier that does not have a DMRS assigned to it. In the third OFDM symbol, subcarriers 193-240, PBCH is assigned to a subcarrier that does not have a DMRS assigned to it. In the fourth OFDM symbol, subcarriers 1-240, PBCH is assigned to a subcarrier that does not have a DMRS assigned to it.

[0124] The antenna ports for PSS, SSS, PBCH, and PBCH DMRS within an SS / PBCH block may be the same. DL DMRS is a general term for PBCH DMRS, PDSCH DMRS, and PDCCH DMRS.

[0125] The set of antenna ports for DMRS for PDSCH may be given based on the set of antenna ports for PDSCH. For example, the set of antenna ports for DMRS for PDSCH may be the same as the set of antenna ports for PDSCH.

[0126] PDSCH and DMRS for PDSCH are collectively referred to as PDSCH. The set of antenna ports for DMRS for PDCCH may be given based on the set of antenna ports for PDCCH. For example, the set of antenna ports for DMRS for PDCCH may be the same as the set of antenna ports for PDCCH. PDCCH and DMRS for PDCCH are collectively referred to as PDCCH.

[0127] BCH (Broadcast Channel), UL-SCH (Uplink-Shared Channel), and DL-SCH (Downlink-Shared Channel) are transport channels. Channels used in the MAC layer are called transport channels. The unit of a transport channel used in the MAC layer is also called a transport block (TB) or MAC PDU (Protocol Data Unit). In the MAC layer, HARQ (Hybrid Automatic Retransmission Request) control is performed for each transport block. A transport block is the unit of data delivered to the physical layer by the MAC layer. In the physical layer, transport blocks are mapped to codewords, and modulation processing is performed for each codeword.

[0128] One UL-SCH and one DL-SCH may be provided per serving cell. BCH may be provided to the PCell. BCH may not be provided to the PSCell and SCell.

[0129] BCCH (Broadcast Control Channel), CCCH (Common Control Channel), and DCCH (Dedicated Control Channel) are logical channels. BCCH is an RRC layer channel used to distribute MIB or system information. CCCH may be used to transmit common RRC messages among multiple terminal devices. DCCH may be used to transmit dedicated RRC messages to terminal devices.

[0130] BCCH in a logical channel may be mapped to BCH or DL-SCH in a transport channel. CCCH in a logical channel may be mapped to DL-SCH or UL-SCH in a transport channel. DCCH in a logical channel may be mapped to DL-SCH or UL-SCH in a transport channel.

[0131] UL-SCH in the transport channel may be mapped to PUSCH in the physical channel. DL-SCH in the transport channel may be mapped to PDSCH in the physical channel. BCH in the transport channel may be mapped to PBCH in the physical channel.

[0132] Higher-level parameters are parameters within RRC messages or MAC CEs (control elements). Higher-level parameters may be cell-specific or UE-specific. Cell-specific parameters are those containing common settings within a cell. UE-specific parameters are those containing settings that may be set differently for each UE.

[0133] The base station device 103 may exhibit changes in cell-specific parameters due to reconfiguration with random access. The base station device 103 may exhibit changes in UE-specific parameters due to reconfiguration with or without random access.

[0134] Figure 8 is a time-frequency diagram showing exemplary resource allocation in a serving cell according to an exemplary implementation of the present disclosure. The horizontal axis represents the time domain. The vertical axis represents the frequency domain. Regions 801, 802, 803, and 804 represent time-frequency resources for the UL subband. Regions 811, 812, 813, and 814 with grid lines represent the DL domain. Regions 821, 822, 823, and 824 represent the UL domain. Lines 831, 832, 833, and 834 represent periods of time-division duplexing (TDD) patterns. Each region represents resources for each SS / PBCH block with a different index. Time-domain guard periods are located at the transition points from DL to UL. Frequency-domain guard bands are located at the boundary between DL and UL.

[0135] A TDD pattern is a pattern that includes parts of all of the DL region, flexible region, and UL region. In Figure 8, the TDD pattern includes the DL region and the UL region. The time-domain guard period between the DL region and the UL region may be part of the DL region, part of the UL region, or as part of the flexible region. The TDD pattern may be constructed based on one or more RRC parameters provided by the RRC layer.

[0136] The UL subband may be composed of either or both the DL region and the time-domain guard period. The time-domain resource of the UL subband may be composed of one or more RRC parameters provided by the RRC layer.

[0137] The time-domain resource of the UL subband may consist of one or more first RRC parameters used to indicate the periodicity of the UL subband, one or more second RRC parameters used to indicate the starting slot of the UL subband in each period, and one or more third RRC parameters used to indicate the length of the UL subband in each period in terms of the number of slots. For example, if the periodicity is 20 slots, the starting slot is the third slot, and the length is 11 slots, the terminal device 101 determines that in each period, there is an UL subband with a length of 11 slots, starting from the third slot.

[0138] One or more first RRC parameters used to indicate periodicity may be different from one or more RRC parameters used to indicate periodicity of the TDD pattern. For example, one or more RRC parameters used to indicate periodicity of the TDD pattern may be reused to indicate periodicity of the UL subband. For example, terminal device 101 may assume that the periodicity of the UL subband is the same as the periodicity of the TDD pattern.

[0139] One or more fourth RRC parameters may be used to indicate the starting OFDM symbol of the UL subband in the starting slot. For example, one or more fifth RRC parameters may be used to indicate the length of the UL subband by the number of symbols. For example, the frequency domain resource of the UL subband may consist of one or more first RRC parameters used to indicate the starting RB of the UL subband and one or more second RRC parameters used to indicate the length of the UL subband by the number of RBs.

[0140] The UL subband may be constructed in the SCS intrinsic carrier. In this case, the RRC parameters used to indicate the UL subband resources may be provided for each SCS intrinsic carrier. The UL subband may also be constructed in the BWP. In this case, the RRC parameters used to indicate the UL subband resources may be provided for each BWP.

[0141] The base station device 103 may use the UL subband to perform simultaneous transmission and reception at the same time. For example, during a time opportunity in the UL subband 801, the base station device 103 may simultaneously transmit on a physical downlink channel in region 811 and receive on a physical uplink channel in region 801. The time opportunity to which the UL subband is mapped is called the Subband Full Duplex (SBFD) region.

[0142] Various physical layer configurations may be provided independently for the SBFD region and the non-SBFD region. For example, the base station device 103 may use different QCL characteristics for the SBFD region and the non-SBFD region. The base station device 103 may use different settings for the components of the RF section 32. For example, the components may include analog filters, amplifiers, or clocks. The terminal device 101 may obtain information about various physical layer configurations from the base station device 103.

[0143] Figure 9 is a time-frequency diagram showing exemplary PUSCH assignments in a serving cell according to an exemplary implementation of the present disclosure. The horizontal axis represents OFDM symbol indices, and the vertical axis represents subcarrier indices. PUSCH may be assigned to 12 subcarriers and 14 OFDM symbols. The resource element is an index set (k sc ,l symResource elements may be identified by the following criteria: For example, resource element 90 has the index set (0,0), resource element 91 has the index set (11,0), resource element 92 has the index set (0,1), resource element 93 has the index set (11,1), resource element 94 has the index set (0,3), and resource element 95 has the index set (11,3). In Figure 9, for simplicity, single-layer transmission is assumed. Embodiments and modes are also applicable to multi-layer transmission.

[0144] Modulation symbol x l The sequence may be mapped to a resource element in the PUSCH assignment, where the modulation symbol x l Each of these can be a complex numerical symbol derived by modulation (e.g., Quadrature Phase Shift Keying (QPSK), Quadrature Amplitude Modulation (QAM), 64 QAM, 256 QAM, 1024 QAM). In some embodiments, the modulation symbol x l Each of these can be a complex-valued symbol derived from at least the modulation and precoder.

[0145] Modulation symbol x l The length L of the sequence may be derived by the number of resource elements excluding resource elements reserved for other purposes (e.g., 9001 and 9002). In the embodiment shown in Figure 9, L is 12 * 12 is equal to 144.

[0146] Modulation symbol x lThe sequence may be mapped to the resource elements allocated for PUSCH transmission in the first frequency manner. In some embodiments, x0 may be mapped to a resource element having an index set (0,0), x1 may be mapped to a resource element having an index set (1,0), x2 may be mapped to a resource element having an index set (2,0), and so on. Further, x 11 may be mapped to a resource element having an index set (11,0), and x 12 may be mapped to a resource element having an index set (0,1), and x 13 may be mapped to a resource element having an index set (1,1), and so on. On the other hand, the modulation symbols may not be mapped to some resource elements reserved for other purposes (for example, resource elements 9001 - 9002 reserved for the DMRS of PUSCH). Therefore, x 23 may be mapped to a resource element having an index set (11,1), and x 24 may be mapped to a resource element having an index set (0,3), and x 25 may be mapped to a resource element having an index set (1,3), and so on.

[0147] An orthogonal cover code (OCC) may be applied to PUSCH. OCC is a coding technique used to reduce interference and improve system performance. By allocating orthogonal codes to different subchannels, OCC enables the simultaneous transmission of data of multiple users without interference and enables multiple UEs to share multiple UL resources. When OCC is applied to PUSCH, the modulation symbols may be applied with spreading. When the OCC of {p0,p1} is applied to PUSCH, the radio transceiver 30 (FIG. 5) may generate two different sequences of p0 * x1 and p1 * x1. Here, p0 and p1 are complex-valued symbols.

[0148] In some implementations, OCC may be applied before transform precoding. When OCC is applied to PUSCH before transform precoding, OCC may be regarded as interleaved frequency division multiplexing.

[0149] In some embodiments, two sequences may be mapped to the resource elements allocated for PUSCH. For example, p0 * x0 may be mapped to a resource element having an index set (0,0), p1 * x0 may be mapped to a resource element having an index set (1,0), p0 * x1 may be mapped to a resource element having an index set (2,0), p1 * x1 may be mapped to a resource element having an index set (3,0), and so on. In this example, p0 * x l and p1 * x l are mapped adjacent to each other in the frequency domain. This type of mapping is called frequency domain OCC.

[0150] In some embodiments, p0 * x0 may be mapped to a resource element having an index set (0,0), p1 * x0 may be mapped to a resource element having an index set (0,1), p0 * x1 may be mapped to a resource element having an index set (1,0), p1 * x1 may be mapped to a resource element having an index set (1,1), and so on. In this example, p0 * x l and p1 * x lThese elements are mapped adjacent to each other in the time domain. This type of mapping is called a time-domain OCC.

[0151] The length of an OCC (Optical Cross Coefficient) is called the diffusion coefficient. The diffusion coefficient of an OCC in {p0,p1} is 2.

[0152] When an OCC with a diffusion coefficient P is applied to PUSCH, the modulation symbol x l The sequence length may also be expressed by dividing the number of resource elements allocated for PUSCH (excluding resource elements reserved for other purposes, e.g., resource elements 9001-9002) by the diffusion coefficient. For example, if the diffusion coefficient is 2 and the PUSCH allocation is as shown in Figure 9, the sequence length is 144 / 2 = 72.

[0153] Modulation symbol x l If the sequence length is divided by the diffusion coefficient, the rate-matching output sequence length may also be divided by the diffusion coefficient, and the rate-matching output sequence length is the modulation symbol x l It is derived by multiplying the length of the sequence by the modulation order of the modulation type.

[0154] As an example, in a single-input single-output (SISO) system, the signals received by the receiver from two UEs (e.g., UE0 and UE1) are r0=p 00 s0+p 10 s1 and r1 = p 01 s0+p 11 It can also be expressed as s1, and p0 = [p 00 ,p 01 ] T and p1=[p 10 ,p 11 ] T is a pair of OCC sequences, and T represents the vector transpose operation. Therefore, the two sequences are orthogonal. That is, p 00 * p' 10 +p 01 *p' 11 = 0, where p' is the conjugate of p, T represents the transpose of the vector, s0 is the transmitted data from UE0, and s1 is the transmitted data from UE1. Thus, the transmissions from the two UEs may be multiplexed using OCC and time-frequency resources of iteration 0 and iteration 1.

[0155] The receiver receives the OCC signal vector r=[r 0, r1] T It may also be multiplied by p. For example, to extract data s0, the receiver multiplies by p H 0 * r=p' 00 * (p 00 s0+p 10 s1)+p' 01 * (p 01 s0+p 11 s1)=|p 00 | 2* s0+|p 01 | 2* s0+p' 00 * p 10 s1+p' 01 * p 11 You may also perform s1, and in the formula, p H 0 indicates the conjugate of p0. The norm of the OCC sequence may be designed to be 1. In this case, |p 00 | 2* s0+|p 01 | 2* s0 = s0. Furthermore, using the orthogonality of the OCC sequence, p' 00 * p 10 s1+p' 01 * p 11 s1=0. Therefore, p H 0 * r=s0. In order to extract (or decode) the desired signal from the signals transmitted by the two UEs using OCC, the receiver must receive both iteration 0 and iteration 1.

[0156] Figure 10 shows an embodiment of a circular buffer for rate-matching operation, according to an exemplary implementation of the present disclosure. The circular buffer illustrates the concept of rate-matching operation. In the circular buffer, coded bits (e.g., bits coded by error correction codes) may be mapped in a clockwise order, where 1001 represents the starting position of the coded bit mapping. Section 1002 represents the portion of the circular buffer used to store the systematic bits of the coded bits. Section 1003 represents the portion of the circular buffer used to store the parity bits of the coded bits. Region 1004 represents the region in which the coded bits in the circular buffer are written to the output sequence of the rate-matching operation. The length of the output sequence may be used to determine the rate-matching output sequence length.

[0157] The size of the circular buffer and the length of the rate-matching output sequence may determine how many parity bits are written to the output sequence of the rate-matching operation. If the size of the circular buffer is not changed and the rate-matching output sequence is shortened, the number of parity bits written to the output sequence may be reduced. Reducing the number of parity bits may cause a degradation in decoding performance. Furthermore, if the output sequence does not contain any parity bits, the receiver cannot decode the data.

[0158] Handling of UL transmission collisions when OCC is applied Some embodiments address the PUCCH-PUSCH collision problem when OCC is applied to PUSCH. The PUCCH-PUSCH collision was a problem stemming from the LTE network architecture. In LTE and NR, PUCCH and PUSCH are designed to have single-carrier characteristics. For example, some PUCCH and PUSCH formats employ the Zadoff-Chu (ZC) sequence, which may maintain single-carrier characteristics and thus result in low Peak-to-Average Power Ratio (PAPR) characteristics. In some other PUCCH and PUSCH formats, DFT-s-OFDM is employed, which also maintains single-carrier characteristics.

[0159] However, if two single-carrier signals overlap in the time domain, the colliding signals no longer exhibit single-carrier characteristics. Because the UE's transmit power may be limited, the power required for simultaneous transmission of PUSCH and PUCCH may exceed the UE's transmit power. Therefore, to maintain single-carrier characteristics, one of the PUCCH or PUSCH signals must be dropped.

[0160] Figure 11 is a time-frequency diagram illustrating one embodiment of the handling of a collision between PUCCH and PUSCH when OCC is not applied to PUSCH, according to an exemplary embodiment of the present disclosure. Figure 11 includes two operational stages 1101 and 1102. Stage 1101 shows the collision between PUCCH 1110 and PUSCH 1120 in the time domain. PUCCH 1110 and PUSCH 1120 may be placed at different frequencies. UCI 1130 may be expected to be transmitted via PUCCH 1110.

[0161] In stage 1102, PUCCH may be dropped. As shown in the diagram, UCI1130, which was expected to be transmitted via PUCCH1110, may be piggybacked on PUSCH1120. This operation is called UCI piggyback on PUSCH. PUCCH is dropped because PUCCH's time-frequency resources are typically smaller than those of PUSCH.

[0162] In some implementations, PUSCH transmission may include repetition. Repetition is a technique for achieving better coverage area by BS by incrementing the time-frequency resources of PUSCH. PUSCH repetition may be used, for example, in non-terrestrial networks (NTN) which may include satellites.

[0163] Figure 12 is a time-frequency diagram showing one embodiment of a PUSCH iteration according to an exemplary embodiment of the present disclosure. As shown by iterations 1210 and 1220, a PUSCH with the same amount of time-frequency resources may be repeated two (or more) times to achieve better coverage.

[0164] Figure 13 is a time-frequency diagram illustrating an example of a collision between PUCCH and at least one of the PUSCH repetitions according to an exemplary embodiment of the present disclosure. Referring to Figure 13, PUCCH 1110 may have partial overlap with at least one of the PUSCH repetitions. For example, PUCCH 1110 may have partial overlap with at least either PUSCH repetition 1220 or repetition 1210 (as shown). As described above, the UE's transmit power may be limited. Therefore, the power required for simultaneous transmission of the PUSCH repetition and PUCCH may exceed the UE's transmit power. Thus, in order to maintain single-carrier characteristics, either PUCCH or PUSCH repetition must be dropped.

[0165] If OCC is not applied to the PUSCH iteration, and the UE transmits PUSCH iteration 1210 and then determines that PUSCH 1110 overlaps with PUSCH iteration 1220, the UE may drop iteration 1220. Since iterations 1210 and 1220 carry the same information, the receiver can decode PUSCH based on iteration 1210 alone.

[0166] Alternatively, the UE may drop PUCCH1110 and piggyback the UCI1130 that was expected to be transmitted via PUCCH1110 on PUSCH iteration 1120. However, if OCC is applied to the PUSCH iteration, the UCI1130 cannot be piggybacked only on PUSCH iteration 1120. As explained below, if OCC is applied to the PUSCH iteration, the PUSCH iteration no longer carries the same information, and the receiver requires all iterations (e.g., a group of iterations carrying data associated with two or more UEs) to decode the PUSCH. In such a situation, by adding the UCI to only one iteration, the structure of the iteration is altered, making it impossible for the receiver to decode the PUSCH.

[0167] In some implementations, OCC may be applied to PUSCH iterations. For example, in a single-input single-output (SISO) system, signals received at the receiver from two UEs (e.g., UE0 and UE1) are r0=p 00 s0+p 10 s1 and r1 = p 01 s0+p 11 It can also be expressed as s1, and p0 = [p 00 ,p 01 ] T and p1=[p 10 ,p 11 ] T is a pair of OCC sequences, and T represents the vector transpose operation. Therefore, the two sequences are orthogonal. That is, p 00 * p' 10 +p 01 * p'11 = 0. Here, p' is the conjugate of p, T represents the transpose of the vector, s0 is the transmitted data from UE0, and s1 is the transmitted data from UE1. Thus, the transmissions from the two UEs may be multiplexed using OCC and time-frequency resources of iteration 0 and iteration 1.

[0168] Limiting the transmit power of a UE per unit of time is a common practice by local authorities. Using OCC is more advantageous than allocating time-frequency resources for iteration 0 to UE0 and time-frequency resources for iteration 1 to UE1. Using OCC doubles the transmit power compared to allocating time-frequency resources without OCC.

[0169] The receiver receives the OCC signal vector r=[r0,r1] T It may also be multiplied by p. For example, to extract data s0, the receiver multiplies by p H 0 * r=p' 00 * (p 00 s0+p 10 s1)+p' 01 * (p 01 s0+p 11 s1)=|p 00 | 2* s0+|p 01 | 2* s0+p' 00 * p 10 s1+p' 01 * p 11 You may also perform s1, and in the formula, p H 0 indicates the conjugate of p0. The norm of the OCC sequence may be designed to be 1. In this case, |p 00 | 2* s0+|p 01 | 2* s0 = s0. Furthermore, using the orthogonality of the OCC sequence, p' 00 * p 10 s1+p' 01 * p11 s1=0. Therefore, p H 0 * r=s0. In order to extract (or decode) the desired signal from the signals transmitted by the two UEs using OCC, the receiver must receive both iteration 0 and iteration 1.

[0170] In the following embodiment, we assume that PUSCH transmissions for two UEs, UE0 and UE1, are multiplexed. For example, OCC may be applied to the PUSCH iterations. We further assume that a PUSCH transmission scheduled for UE0 conflicts in the time domain with a PUSCH iteration of UE0. This embodiment provides several solutions for handling the conflict between PUSCH and one of the PUSCH iterations of UE0 when OCC is applied to the PUSCH iterations.

[0171] In some embodiments, UE0 may stop transmitting PUCCH and may cancel the transmission of UCI that was expected to be transmitted by PUCCH. In some embodiments, UE0 may stop transmitting all PUCCH iterations. In some embodiments, UE0 may determine that a collision has occurred before the transmission of the first iteration of PUSCH and may piggyback the UCI that was expected to be transmitted using PUCCH on all PUSCH iterations.

[0172] Drop of PUCCH and discontinuation of UCI transmission In some embodiments, if OCC is applied to a PUSCH iteration, UE0 may determine whether PUCCH will collide with one of the PUSCH iterations. If UE0 determines that PUCCH will collide with one of the PUSCH iterations, UE0 may stop transmitting PUCCH. UE0 may further refrain from transmitting the UCI that was expected to be transmitted in PUCCH.

[0173] Figure 14 is a time-frequency diagram showing an example of a collision between PUCCH1110 and PUSCH repetition 1220 when OCC is applied to a PUSCH repetition, according to one implementation of the present disclosure. In the example of Figure 14, PUCCH1110 may be triggered by PDCCH1410, which may be received by UE0 after PUSCH repetition 1210 has been transmitted. After transmission of repetition 1210, UE0 may receive PDCCH1410. UE0 may then determine that PUCCH1110 has collided with one of several PUSCH repetitions.

[0174] Referring to Figure 14, regardless of when PDCCH1410 is received by UE0, and whether PUCCH1110 collides with the first repetition of PUSCH1210 or with a subsequent repetition of PUSCH (e.g., repetition 1220), UE0 may not piggyback the UCI that was expected to be transmitted in PUCCH on the PUSCH repetition, but simply drop PUCCH. Thus, none of the PUSCH repetitions are modified by the addition of UCI, and therefore the receiver can decode the PUSCH repetitions.

[0175] Figure 15 is a flowchart of an exemplary method / process 1500, according to an exemplary implementation of the present disclosure, in which OCC is applied to a PUSCH iteration, and if PUCCH collides with one of the PUSCH iterations, the UE drops the PUCCH and stops sending the UCI. Referring to Figure 15, process 1500 may be executed by one of the UE processors, such as one of UE101A-101C (as shown in Figure 1, for example) or UE110 (as shown in Figure 6, for example).

[0176] Process 1500 may determine several push iterations for the UE's UL push transmission (in block 1505). For example, process 1500 may determine push iterations 1210 to 1220 in Figures 12 to 14. The UE may, for example, consist of RRC messages from the BS (e.g., BS103 in Figures 1 and 5) to determine the push iterations.

[0177] Process 1500 may group PUSCH iterations into one or more groups (in block 1510), each group having two or more PUSCH iterations that carry UL data for PUSCH transmission. For example, process 1500 may group PUSCH iterations 1210-1220 in Figures 12-14 into one group of iterations. Figure 16 is a time-frequency diagram showing one embodiment of grouping PUSCH iterations into several groups of iterations according to an exemplary implementation of the present disclosure. Referring to Figure 16, PUSCH iterations 1610-1640 may be grouped into two groups of iterations 1650-1660. Iteration group 1650 may include iterations 1610 and 1620. Iteration group 1660 may include iterations 1630 and 1640.

[0178] Grouping PUSCH iterations into one or more groups may include applying OCC to UL PUSCH transmissions. Applying OCC to PUSCH transmissions multiplexes a UE's PUSCH transmission with one or more other UE's PUSCH transmissions in the time domain. In some embodiments, the number of iterations in a group may be equal to the length of the OCC. For example, if the OCC length is 2, the number of iterations in a group may be 2.

[0179] Referring back to Figure 15, process 1500 may determine whether at least one PUSCH iteration in a group of two or more PUSCH iterations (in block 1515) overlaps with UL PUCCH in the time domain. For example, process 1500 may determine whether PUCCH 1110 overlaps at least partially with an iteration such as PUSCH iteration 1220, as shown in Figure 14.

[0180] Process 1500 may drop the UL PUCCH transmission (in block 1520) after determining that at least one PUSCH iteration overlaps at least partially with the UL PUCCH. Process 1500 may cancel the transmission of the PUCCH UCI via the UE's UL PUSCH transmission (in block 1525). Process 1500 may then terminate. By canceling the transmission of the UCI that was expected to be transmitted by the PUCCH via the PUSCH iteration, it is ensured that the contents of the PUSCH iteration are not altered and that the receiver can decode the PUSCH after receiving the iteration.

[0181] b. Drop all PUSCH iterations In some embodiments, if PUCCH overlaps at least partially with one of the PUSCH iterations, the transmission of PUCCH may take precedence over the transmission of the PUSCH iteration. For example, some operators (e.g., BS operators, satellite operators, etc.) may prioritize the transmission of control information in PUCCH over the transmission of data in the PUSCH iteration.

[0182] However, when OCC is applied, a PUSCH repeat from UE0 is multiplexed with PUSCH repeats transmitted from one or more other UEs. When OCC is applied, repeats may carry different information, and the receiver (e.g., BS or satellite) must receive PUSCH repeats from all UEs (e.g., groups) in order to successfully decode the PUSCH. Therefore, after UE0 has transmitted the first PUSCH repeat, UE0 cannot drop the remaining PUSCH repeats.

[0183] The issue to consider is that, in the embodiment shown in Figure 14, PUCCH1110 is triggered by PDCCH1410, and PDCCH1410 is received by UE0 after UE0 has sent repetition 1210. Therefore, once UE0 determines that PUCCH will collide with repetition 1220, UE0 cannot stop sending repetition 1210, which it has already sent.

[0184] Some embodiments provide a mechanism to enable the UE to determine whether to retain or drop all iterations of PUSCH if the UE determines that a collision has occurred between PUCCH and one of the PUSCH iterations. In some embodiments, the UE may provide a timeline threshold, as shown in Figure 17. Figure 17 is a time-frequency diagram showing one embodiment of an exemplary implementation of the present disclosure, in which OCC is applied to the PUSCH iterations and a timeline threshold 1710 is provided to the UE for determining whether all PUSCH iterations should be dropped if a collision occurs between PUCCH and one of the PUSCH iterations.

[0185] The timeline threshold 1710 may be defined as the time point before the Tproc of the first OFDM symbol of iteration 1210. Tproc is the time required for UE0 to process PDCCH1410. Referring to Figure 17, UE0 may process PDCCH and determine whether PUCCH has a collision with one of the iterations of PUSCH. If UE0 determines that PUCCH1110 has a collision with one of the iterations (e.g., iteration 1220), UE0 may determine whether the reception of PDCCH1410 that triggers PUCCH1110 is before the timeline threshold 1710. For example, UE0 may determine whether the first OFDM symbol of PDCCH1410 that triggers PUCCH1110 is before the timeline threshold 1710. Alternatively, UE0 may determine whether the last OFDM symbol of PDCCH1110 that triggers PUCCH1110 is before the timeline threshold 1710.

[0186] If UE0 determines that PDCCH1410, which triggers PUCCH1110, is received before the timeline threshold 1710, UE0 may stop transmitting all iterations of PUCCH (e.g., iterations 1210-1220 of PUCCH). If UE0 determines that PDCCH1410, which triggers PUCCH1110, is not received before the timeline threshold 1710, UE0 may stop transmitting PUCCH1110 (e.g., UE0 may drop all iterations of PUCCH).

[0187] Figure 18 is a flowchart of an exemplary method / process 1800, according to an exemplary implementation of the present disclosure, in which OCC is applied to PUSCH iterations and executed by the UE to drop all PUSCH iterations if PUCCH conflicts with one of the PUSCH iterations. Referring to Figure 18, process 1800 may be executed by one of the UEs 101A-101C (shown in Figure 1) or at least one processor of the UE, such as UE 110 (as shown in Figure 6).

[0188] Process 1800 may determine several push iterations for the UE's UL push transmission (in block 1805). For example, process 1800 may determine push iterations 1210-1220 in Figure 17. The UE may, for example, consist of RRC messages from the BS (e.g., BS103 in Figures 1 and 5) to determine the push iterations.

[0189] Process 1800 may group the PUSCH iterations (in block 1810) into one or more groups, each group having two or more PUSCH iterations that carry UL data for PUSCH transmissions (e.g., two or more UEs). For example, process 1800 may group the PUSCH iterations 1210-1220 in Figures 12-14 into one group of iterations. As another example, process 1800 may group the PUSCH iterations 1610-1640 shown in Figure 16 into two groups of iterations 1650-1660. All PUSCH iterations within each group of PUSCH iterations are required by the receiver to decode the UL data carried by the group of iterations, since the UL data carried by the PUSCH iteration may include a first UL data for a PUSCH transmission of UE0 and a second UL data for a second PUSCH transmission of at least one other UE. UE0 and other UEs (one or more) may transmit the first and second UL data to at least one satellite via NTN.

[0190] Grouping PUSCH iterations into one or more groups may include applying OCC to UL PUSCH transmissions. Applying OCC to PUSCH transmissions multiplexes a UE's PUSCH transmission with one or more other UE's PUSCH transmissions in the time domain. In some embodiments, the number of iterations in a group may be equal to the length of the OCC. For example, if the OCC length is 2, the number of iterations in a group may be 2.

[0191] Referring back to Figure 18, process 1800 may determine whether at least one PUSCH iteration in a group of two or more PUSCH iterations (in block 1815) overlaps with the UL physical uplink control channel (PUCCH) in the time domain. For example, process 1800 may determine whether PUCCH 1110 overlaps at least partially with an iteration such as PUSCH iteration 1220, as shown in Figure 17.

[0192] Process 1800 may drop the UL PUSCH transmission (in block 1820) after determining that at least one PUSCH iteration overlaps at least partially with UL PUCCH. Process 1800 may then terminate.

[0193] In some embodiments, the UE may receive a PDCCH that triggers a PUCCH. After determining that at least one PUSCH iteration overlaps at least partially with a UL PUCCH, process 1800 may determine whether a PDCCH is received before a threshold time for the start of transmission of multiple PUSCH iterations. For example, process 1800 may determine whether a PDCCH 1410 is received before a time interval (e.g., Tproc) of the timeline threshold 1710 shown in Figure 17. If a PDCCH 1410 is received before a time interval (e.g., Tproc) of the timeline threshold 1710, process 1800 may stop transmitting UL PUSCH for all PUSCH iterations 1210-1220. Otherwise, process 1800 may stop transmitting a PUCCH 1110.

[0194] c. UCI piggyback on PUCCH drops and all PUCCH iterations In some embodiments, UE0 may first determine whether PUCCH will at least partially collide with one of the PUSCH iterations when OCC is applied to the PUSCH iteration. If UE0 determines that PUCCH will collide with one of the PUSCH iterations, UE0 may drop PUCCH and piggyback the UCI that was expected to be sent by PUCCH using PUCCH on all PUSCH iterations.

[0195] The issue to consider is that, in the embodiment shown in Figure 14, PUCCH1110 is triggered by PDCCH1410, and PDCCH1410 is received by UE0 after UE0 has sent iteration 1210. Therefore, by the time UE0 determines that PUCCH collides with iteration 1220, iteration 1210 has already been sent, and UE0 cannot piggyback the UCI over all PUCCH iterations 1210-1220.

[0196] Some embodiments provide a mechanism to allow the UE to determine whether it is acceptable for the UE to drop a PUCCH and piggyback the UCI on all PUCCH iterations. In some embodiments, the UE0 may provide a timeline threshold, as shown in Figure 17. As described above, the timeline threshold may be defined as the time before the Tproc of the first (or last) OFDM symbol of iteration 1210. The UE0 may first determine whether PUCCH 1110 conflicts with one of the PUSCH iterations (e.g., iteration 1220). If the UE0 determines that PUCCH 1110 conflicts with one of the PUSCH iterations, the UE may determine whether the PDCCH 1410 that triggers the PUCCH is before the timeline threshold 1710. For example, the UE0 may determine whether the first OFDM symbol of the PDCCH 1410 that triggers PUCCH 1110 is received by the UE0 before the timeline threshold 1710. In another example, UE0 may determine whether the last OFDM symbol of PDCCH1410 that triggers PUCCH1110 is received by UE0 before the timeline threshold 1710.

[0197] If the UE determines that PDCCH1410, which triggers PUCCH1110, is before the timeline threshold 1710, UE0 may piggyback the UCI that was expected to be sent using PUCCH1110 on all PUSCH iterations 1210–1220. If the UE0 determines that PDCCH1410, which triggers PUCCH1110, is not received before the timeline threshold 1710, UE0 may stop sending PUCCH1110. In such a scenario, UE0 may stop sending PUCCH UCIs via the UE's UL PUSCH transmissions.

[0198] Figure 19 is a flowchart of an exemplary method / process 1900, according to an exemplary implementation of the present disclosure, in which OCC is applied to a PUSCH iteration, and if PUCCH collides with one of the PUSCH iterations, the UE drops the PUCCH and piggybacks the transmission of the UCI of PUCCH on the PUSCH iteration. Referring to Figure 19, process 1900 may be executed by at least one processor of the UE, such as one of UE101A-101C (shown in Figure 1) or UE110 (shown in Figure 6).

[0199] Process 1900 may determine several push iterations for the UE's UL push transmission (in block 1905). For example, process 1900 may determine push iterations 1210 to 1220 in Figures 12 to 14. The UE may, for example, consist of RRC messages from the BS (e.g., BS103 in Figures 1 and 5) to determine the push iterations.

[0200] Process 1900 may group PUSCH iterations into one or more groups (in block 1910), each group having two or more PUSCH iterations that carry UL data for PUSCH transmissions. For example, process 1900 may group PUSCH iterations 1210-1220 in Figures 12-14 into one group of iterations. As another example, process 1800 may group PUSCH iterations 1610-1640 into two groups of iterations 1650-1660, as shown in Figure 16. All PUSCH iterations within each group of PUSCH iterations are required by the receiver to decode the UL data carried by the group of iterations, since the UL data carried by the PUSCH iteration may include a first UL data for a PUSCH transmission of UE0 and a second UL data for a second PUSCH transmission of at least one other UE. UE0 and other UEs (one or more) may transmit the first and second UL data to at least one satellite via NTN.

[0201] Grouping PUSCH iterations into one or more groups may include applying OCC to UL PUSCH transmissions. Applying OCC to PUSCH transmissions multiplexes a UE's PUSCH transmission with one or more other UE's PUSCH transmissions in the time domain. In some embodiments, the number of iterations in a group may be equal to the length of the OCC. For example, if the OCC length is 2, the number of iterations in a group may be 2.

[0202] Referring back to Figure 19, process 1900 may determine (in block 1915) whether at least one PUSCH iteration in a group of two or more PUSCH iterations overlaps with a UL PUCCH containing a UCI in the time domain. For example, process 1900 may determine whether PUCCH 1110 overlaps at least partially with an iteration such as PUSCH iteration 1220, as shown in Figure 17.

[0203] Process 1900 may drop a UL PUCCH transmission (in block 1920) after determining that at least one PUSCH iteration overlaps at least partially with a UL PUCCH. Process 1900 may piggyback the UCI that was expected to be transmitted in PUCCH on each iteration of a group of two or more PUSCH iterations (in block 1925). Process 1900 may then terminate. By piggybacking the UCI that was expected to be transmitted by PUCCH on all iterations of PUSCH, it is ensured that the contents of a PUSCH iteration are not altered after the transmission of one or more PUSCH iterations, and that a receiver can decode a PUSCH after receiving the iteration.

[0204] In some embodiments, the UE may receive a PDCCH that triggers a PUCCH. After determining that at least one PUCCH iteration overlaps at least partially with a UL PUCCH, process 1900 may determine whether the PDCCH is received before a threshold time for the start of transmission of multiple PUCCH iterations. For example, process 1900 may determine whether the PDCCH 1410 is received before a time interval (e.g., Tproc) of the timeline threshold 1710 shown in Figure 17. If the PDCCH 1410 is received before a time interval (e.g., Tproc) of the timeline threshold 1710, process 1800 may piggyback the UCI on all PUCCH iterations 1210-1220. Otherwise, process 1900 may stop transmitting the PUCCH 1110 and discontinue the transmission of the UCI via the UE's UL PUCCH transmission.

[0205] II. Handling of UL transmission collisions when OCC applies In some embodiments, RVs from a sequence of redundant versions (RVs) may be mapped to each PUSCH iteration. Due to the coding gain, different RVs should be mapped to different PUSCH iterations. Using different RVs for iterations ensures that as many parity bits as possible are transmitted. Figure 20 shows an embodiment of a circular buffer for rate-matching operation, according to an exemplary implementation of the present disclosure.

[0206] A circular buffer is a concept that may store encoded bits. The encoded bits may be divided into systematic bits 2020 and parity bits 2030. An example of systematic bits is the information bits carried by the PUSCH iteration. In this embodiment, systematic bits 2020 may be unencoded bits. Systematic bits 2020 are essential for decoding.

[0207] The parity bit 2030 is a bit to assist the coding gain for information bits. The parity bit may be used for error detection. The parity bit is not essential for decoding. On the other hand, when more parity bits are transmitted, the coding gain becomes larger.

[0208] The RV is a reference point for rate matching sequence generation. The rate matcher of the UE may read from the cyclic buffer the coded bits determined by the provided RV and generate a rate matching sequence 2070 or 2080. Typically, the rate matcher can only read a certain part of the cyclic buffer as shown in Figure 20. Therefore, different RVs may be mapped to different PUSCH repetitions, thereby diversifying the rate matching sequence.

[0209] The RV sequence may be used to map RVs to PUSCH repetitions in some embodiments. For example, an RV sequence {0, 2, 3, 1} may be defined. When a PUSCH with 4 repetitions is applied to the RV sequence {0, 2, 3, 1} and OCC is not applied to the PUSCH repetitions, RV0 2001 may be mapped to the first PUSCH repetition, RV2 2002 may be mapped to the second PUSCH repetition, RV3 2003 may be mapped to the third PUSCH repetition, and RV1 2001 may be mapped to the fourth PUSCH repetition. However, when OCC is applied to the PUSCH repetitions, the RVs should be the same within the repetition group. Otherwise, OCC may not function due to different physical structures. Therefore, a new RV sequence should be defined for PUSCH repetitions with OCC.

[0210] Figure 21 is a time-frequency diagram showing one embodiment of an exemplary implementation of the present disclosure in which PUSCH iterations are grouped into several groups of iterations and RVs are mapped to the iterations. In Figure 21, four PUSCH iterations 1610–1640 may be placed within a time-frequency resource. In the embodiment of Figure 21, an OCC of length 2 may be applied to iterations 1610–1620 and iterations 1630–1640. The set of iterations grouped by the OCC is also called an iteration group. In the embodiment of Figure 21, iterations 1610–1620 form an iteration group 1650, and iterations 1630–1640 form another iteration group 1660.

[0211] In some embodiments, the RV sequence may be extended by the length of the OCC. For example, the RV sequence {0,2,3,1} may be extended by 2 to result in {0,0,2,2,3,3,1,1}. In another example, the RV sequence {0,2,3,1} may be extended by 4 to result in {0,0,0,0,2,2,2,2,3,3,3,3,1,1,1,1}. For example, the RV sequence {0,0,2,2} may be extended by 2 to result in {0,0,0,0,2,2,2,2}.

[0212] UE0 may determine whether OCC applies to the PUSCH iteration. If OCC applies to the PUSCH iteration, UE may use an extended RV sequence to map the RV to the iteration. If OCC does not apply to the PUSCH iteration, UE may use an unextended RV sequence to map the RV to the PUSCH iteration. In some embodiments, UE may extend the RV sequence by the length of the OCC applied to PUSCH. In some embodiments, UE may use an extended RV sequence indicated or configured by BS. For example, BS may indicate or configure an extended RV sequence to UE by an RRC message.

[0213] Figure 22 is an exemplary diagram showing Table 2100 defining the RV assignment for the nth PUSCH iteration according to one implementation of the present disclosure. Referring to Figure 22, the RV assignment may, in some embodiments, be performed using the formulas shown in Table 2200. Table 2200 defines the RV assignment for the nth PUSCH iteration. In the table, the nth PUSCH transmission opportunity is referred to as the nth transmission opportunity. For example, the rv as shown by the DCI format used for scheduling the PUSCH. id If is 0, the RV sequence {0,2,3,1} may be used. The parameter N may then be used to extend the RV sequence. For example, if N=2, then ((n-(n mod N)) / N)mod 4=0 when n=0 or 1. Thus, RV0 may be assigned to the 0th and 1st PUSCH iterations (e.g., PUSCH iterations 1610 and 1620 shown in Figure 21).

[0214] If n=2 or 3, then ((n-(n mod N)) / N)mod 4=1. Therefore, RV2 may be assigned. If n=4 or 5, then ((n-(n mod N)) / N)mod 4=2. Therefore, RV3 may be assigned. If n=6 or 7, then ((n-(n mod N)) / N)mod 4=3. Therefore, RV3 is assigned. Thus, using ((n-(n mod N)) / N)mod 4 while setting the value of N to the length of the OCC may be used to extend the RV sequence. Here, the parameter N was used to scale up the TBS for PUSCH. On the other hand, in some embodiments, if N is set to the length of the OCC, TBS scaling may not apply to PUSCH. In some embodiments, the RRC parameter may be used to configure whether N is used to scale up the TBS.

[0215] Figure 23 is a flowchart of an exemplary method / process 2300 performed by a UE for channel coding of PUSCH, according to an exemplary implementation of the present disclosure. Referring to Figure 23, process 2300 may be performed by at least one processor of the UE, such as one of UE101A-101C (shown in Figure 1) or UE110 (shown in Figure 6).

[0216] Process 2300 may determine several push iterations for the UE's UL push transmission (in block 2305). For example, process 2300 may determine push iterations 1210 to 1220 in Figures 12 to 14. The UE may, for example, consist of RRC messages from the BS (e.g., BS103 in Figures 1 and 5) to determine the push iterations.

[0217] Process 2300 may select a first RV sequence, which may contain several RVs, for channel coding the PUSCH iterations (in block 2310). For example, process 2300 may select the RV sequence {0,2,3,1} as described above. Process 2300 may make a decision as to whether the UE is configured to group the PUSCH iterations into one or more groups of PUSCH iterations.

[0218] If the UE is not configured to group PUSCH iterations into one or more groups of PUSCH iterations, process 2300 may apply a unique RV from the unique RV of the sequence (in block 2320) to each PUSCH iteration of the PUSCH iteration. For example, if PUSCH contains four iterations, RV0 2001 shown in Figure 20 may be mapped to the first PUSCH iteration, RV2 2002 to the second PUSCH iteration, RV3 2003 to the third PUSCH iteration, and RV1 2001 to the fourth PUSCH iteration. Process 2300 may then terminate.

[0219] If the UE is configured to group PUSCH repetitions into one or more groups of PUSCH repetitions, then process 2300 (in block 2325) groups the PUSCH repetitions into one or more groups, each group having two or more PUSCH repetitions that carry UL data for a PUSCH transmission. For example, process 2300 may group PUSCH repetitions 1210-1220 in Figures 12-14 into one group of repetitions. As another example, process 2300 may group PUSCH repetitions 1610-1640 into two groups of repetitions 1650-1660, as shown in Figure 16. All PUSCH repetitions within each group of PUSCH repetitions are required by the receiver to decode the UL data carried by the group of repetitions, since the UL data carried by the PUSCH repetitions may include a first UL data for a PUSCH transmission of UE0 and a second UL data for a second PUSCH transmission of at least one other UE. UE0 and other UEs (one or more) may transmit the first and second UL data to at least one satellite via NTN.

[0220] Grouping PUSCH iterations into one or more groups may include applying OCC to UL PUSCH transmissions. Applying OCC to PUSCH transmissions multiplexes a UE's PUSCH transmission with one or more other UE's PUSCH transmissions in the time domain. In some embodiments, the number of iterations in a group may be equal to the length of the OCC. For example, if the OCC length is 2, the number of iterations in a group may be 2.

[0221] Referring back to Figure 23, process 2300 may extend the first RV sequence (in block 2330) into a second RV sequence which may include several RVs, such that each unique RV in the first RV sequence is repeated multiple times in the second RV sequence. The number of times each unique RV in the first RV sequence is repeated in the second RV sequence is based on the RRC message received from the BS.

[0222] Process 2300 may apply a different RV to each group of PUSCH iterations than the RV of the second RV sequence, such that (in block 2355) the same RV is assigned to each of two or more sets of PUSCH iterations in the group. Process 2300 may then terminate.

[0223] In some embodiments, at least one RV in each of the first and second RV sequences may include systematic bits that carry UL PUSCH data. In some embodiments, at least one RV in each of the first and second RV sequences may include several parity bits to provide reliability for the receiver to decode the PUSCH transmission.

[0224] In some embodiments, several coded bits may be stored in a circular buffer to perform a rate matching operation. If the UE is not configured to group multiple PUSCH iterations, process 2300 may further assign coded bits from at least a portion of the circular buffer to the RV of a first RV sequence. Process 2300 may then write coded bits from the portion of the circular buffer assigned to the first RV sequence to the output sequence of the rate matching operation. The size of the circular buffer and the length of the output sequence of the rate matching operation may determine the number of parity bits to be written to the output sequence of the rate matching operation.

[0225] In some embodiments, several coded bits may be stored in a circular buffer to perform a rate matching operation. If the UE is configured to group multiple PUSCH iterations, process 2300 may further assign coded bits from at least a portion of the circular buffer to the RV of a second RV sequence. Process 2300 may then write coded bits from the portion of the circular buffer assigned to the second RV sequence to the output sequence of the rate matching operation. The size of the circular buffer and the length of the output sequence of the rate matching operation may determine the number of parity bits to be written to the output sequence of the rate matching operation.

[0226] The various exemplary embodiments and modes described above can be used in relation to each other, for example, in combination with each other.

[0227] Each of the programs executed on the BS and terminal devices 101A to 101C according to one aspect of the present invention may be a program that controls a central processing unit (CPU) and the like to operate the computer to realize the functions of the above-described embodiment according to the present invention. Information processed by these devices is temporarily stored in random access memory (RAM) while it is being processed. Thereafter, the information is stored in various types of read-only memory (ROM), such as flash ROM and hard disk drive (HDD), and is read by the CPU for modification or rewriting as needed.

[0228] Furthermore, the terminal devices 101A to 101C and the base station device 103 according to the above embodiment may be partially implemented by a computer. In this case, this configuration may be implemented by recording a program for realizing such control functions on a computer-readable recording medium and having a computer system read the program recorded on the recording medium for execution.

[0229] As used herein, the "computer system" refers to the computer system incorporated in the terminal devices 101A to 101C or the base station device 103, and it should be noted that the computer system is assumed to include hardware components such as an OS and peripheral devices. Further, the "computer-readable recording medium" refers to portable media such as flexible disks, magneto-optical disks, ROMs, CD-ROMs, and storage devices incorporated in a computer system such as hard disks.

[0230] Furthermore, the "computer-readable recording medium" may include a medium that holds a program dynamically for a short period, such as a communication line used to transmit a program via a network such as the Internet or via a communication line such as a telephone line. Also, in such a case, it may include a volatile memory in a computer system that functions as a server or a client for holding a program for a certain period. Furthermore, the program may be configured to realize a part of the above functions, or may be configured to realize the above functions in combination with a program already recorded in the computer system.

[0231] Furthermore, the base station device 103 according to the above embodiment may be realized as an aggregation (device group) including a plurality of devices. Each of the devices constituting such a device group may include a part or all of the functions or functional blocks of the base station device 103 according to the above embodiment. The device group may include each general function or each functional block of the base station device 103. Further, the terminal devices 101A to 101C according to the above embodiment can also communicate with the base station device as an aggregation.

[0232] Furthermore, the base station device 103 according to the above embodiment may function as an evolved universal terrestrial radio access network (E-UTRAN) and / or NG-RAN (Next GenRAN, NR-RAN). Furthermore, the base station device 103 according to the above embodiment may have some or all of the functions of a node higher than eNodeB or gNB.

[0233] Furthermore, some or all of each of the terminal devices 101A to 101C and the base station device 103 according to the above embodiments may typically be implemented as an integrated circuit (LSI) or as a chipset. Each of the functional blocks of the terminal devices 101A to 101C and the base station device 103 may be implemented individually as chips, or some or all of the functional blocks may be integrated into a chip. Furthermore, the circuit integration technique is not limited to LSIs and may be implemented with dedicated circuits or general-purpose processors. Moreover, if advances in semiconductor technology lead to the emergence of circuit integration techniques that replace LSIs, it is also possible to use integrated circuits based on such techniques.

[0234] Furthermore, although the above embodiments describe terminal devices 101A to 101C as examples of communication devices, the present invention is not limited to such terminal devices and can be applied to terminal devices or communication devices of fixed or stationary electronic devices installed indoors, such as audio-video (AV) devices, kitchen devices, washing machines or washing machines, air conditioning devices, office equipment, vending machines, and other household devices.

[0235] Embodiments of the present invention have been described in detail above with reference to the drawings, but the specific configurations are not limited to these embodiments and include, for example, modifications to the design that do not depart from the spirit of the invention. Furthermore, various modifications are possible within the scope of one aspect of the invention as defined by the claims, and embodiments produced by appropriately combining the technical means disclosed according to different embodiments are also included in the technical scope of the invention. Moreover, configurations in which components described in each embodiment and having the same effect as each other are substituted for each other are also included in the technical scope of the invention.

[0236] <Cross reference> This non-provisional patent application claims priority under § 119 of Patent Application No. 18 / 627,333 dated April 4, 2024, the entirety of which is incorporated herein by reference.

Claims

1. User equipment (UE), One or more non-temporary computer-readable media for storing one or more computer-executable instructions for channel coding of a physical uplink shared channel (PUCH), At least one processor coupled to one or more non-temporary computer-readable media, which executes one or more computer-executable instructions to the UE, Determine the number of push repetitions for the uplink (UL) push transmission of the aforementioned UE. To channel code the aforementioned plurality of PUSCH iterations, a first RV sequence is selected, which includes a first plurality of unique redundant versions (RVs). The UE is configured to group the plurality of PUSCH iterations into one or more groups of PUSCH iterations. If the UE is not configured to group the plurality of PUSCH iterations, then apply a unique RV from the first plurality of unique RVs to each PUSCH iteration of the plurality of PUSCH iterations. If the UE is configured to group the plurality of PUSCH iterations, The plurality of PUSCH iterations are grouped into one or more groups of PUSCH iterations, where each group of PUSCH iterations includes two or more sets of PUSCH iterations. The first RV sequence is extended to a second RV sequence which includes a second plurality of RVs, wherein each unique RV in the first RV sequence is repeated multiple times in the second RV sequence. Apply different RVs from the second plurality of RVs to each group of PUSCH iterations such that the same RV is assigned to each of the sets of two or more PUSCH iterations in the group. A system comprising at least one processor configured as follows: UE equipped with

2. The UE according to claim 1, wherein the number of times each unique RV in the first RV sequence is repeated in the second RV sequence is based on a radio resource control (RRC) message received from a base station (BS).

3. The aforementioned multiple PUSCH iterations can be grouped into one or more groups. The application of orthogonal cover code (OCC) to the UL PUSCH transmission is included. The UE according to claim 1.

4. The UE according to claim 3, wherein the number of times each unique RV in the first RV sequence is repeated in the second RV sequence is based on the length of the OCC.

5. The UE according to claim 3, wherein applying the OCC to the PUSCH transmission multiplexes the PUSCH transmission of the UE with PUSCH transmissions of one or more other UEs in the time domain.

6. The UE according to claim 1, wherein all PUSCH iterations in each set of two or more PUSCH iterations are required by the receiver to decode the UL data carried by the set of two or more PUSCH iterations.

7. The UE according to claim 6, wherein the UL data carried by the set of two or more PUSCH iterations includes a first UL data for the PUSCH transmission of the UE and a second UL data for a second PUSCH transmission of at least one other UE.

8. The UE according to claim 7, wherein the UE and the at least one other UE transmit the first and second UL data to at least one satellite via a non-terrestrial network (NTN).

9. The UE according to claim 1, wherein at least one RV in each of the first and second RV sequences includes a plurality of systematic bits that carry UL PUSCH data.

10. The UE according to claim 1, wherein at least one RV in each of the first and second RV sequences includes a plurality of parity bits to provide reliability for the receiver to decode the PUSCH transmission.

11. The at least one processor executes one or more computer executable instructions to the UE, To perform rate matching, multiple encoded bits are stored in a circular buffer. If the UE is not configured to group the plurality of PUSCH iterations, further, The encoded bits in at least a portion of the circular buffer are assigned to the first plurality of RVs. The encoded bits in the portion of the circular buffer assigned to the first RV sequence are written to the output sequence of the rate matching operation. It is structured in such a way. The UE according to claim 1.

12. The UE according to claim 11, wherein the size of the circular buffer and the length of the output sequence of the rate matching operation determine the number of parity bits written to the output sequence of the rate matching operation.

13. The at least one processor executes one or more computer executable instructions to the UE, To perform rate matching, multiple encoded bits are stored in a circular buffer. If the UE is configured to group the plurality of PUSCH iterations, further, The encoded bits in at least a portion of the circular buffer are assigned to the second plurality of RVs. The encoded bits in the portion of the circular buffer assigned to the second RV sequence are written to the output sequence of the rate matching operation. It is structured in such a way. The UE according to claim 1.

14. The UE according to claim 13, wherein the size of the circular buffer and the length of the output sequence of the rate matching operation determine the number of parity bits written to the output sequence of the rate matching operation.

15. A method for channel coding of a physical uplink shared channel (PUCH), Determine the number of PUSCH repetitions for the uplink (UL) PUSCH transmission of the aforementioned UE, To channel code the aforementioned multiple PUSCH iterations, a first RV sequence is selected that includes a first set of unique redundant versions (RVs), The determination of whether the UE is configured to group the plurality of PUSCH iterations into one or more groups of PUSCH iterations, If the UE is not configured to group the plurality of PUSCH iterations, then a unique RV from the first plurality of unique RVs is applied to each PUSCH iteration of the plurality of PUSCH iterations. If the UE is configured to group the plurality of PUSCH iterations, The plurality of PUSCH iterations are grouped into one or more groups of PUSCH iterations, where each group of PUSCH iterations includes two or more sets of PUSCH iterations. The first RV sequence is extended to a second RV sequence which includes a second plurality of RVs, wherein each unique RV in the first RV sequence is repeated multiple times in the second RV sequence. Applying different RVs from the second plurality of RVs to each group of PUSCH iterations such that the same RV is assigned to each of the sets of two or more PUSCH iterations in the group, Methods that include...

Images