Redundancy determination in pusch repetitions with orthogonal cover code

Abstract

A method is provided that includes determining a redundancy version group size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions. The method includes dividing the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size. And the method includes transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

Description

REDUNDANCY DETERMINATION IN PUSCH REPETITIONS WITH ORTHOGONAL COVER CODE TECHNOLOGICAL FIELD

[0001] The present disclosure relates generally to telecommunications and, in particular, touplink transmissions of a user equipment in a repetition mode in which repetitions are transmitted using redundancy version values. BACKGROUND

[0002] A telecommunications system can be seen as a facility that enables communicationsessions between two or more entities such as user terminals, base stations and / or other nodes by providing carriers between the various entities involved in the communications path. A telecommunications system can be provided for example by means of a communication network and one or more compatible communication devices. The communication sessions may comprise, for example, communication of data for carrying communications such as voice, video, electronic mail (email), text message, multimedia and / or content data and so on. Non- limiting examples of services provided comprise two-way or multi-way calls, data communication or multimedia services and access to a data network system, such as the Internet.

[0003] In a wireless telecommunications system at least a part of a communication sessionbetween at least two stations occurs over a wireless link. Examples of wireless systems comprise public land mobile networks (PLMN), satellite based communication systems and different wireless local networks, for example wireless local area networks (WLAN). Some wireless systems can be divided into cells, and are therefore often referred to as cellular systems.

[0004] A user can access the telecommunications system by means of an appropriatecommunication device or terminal. A communication device of a user may be referred to as user equipment (UE) or user device. A communication device is provided with an appropriate signal receiving and transmitting apparatus for enabling communications, for example enabling access to a communication network or communications directly with other users. The communication device may access a carrier provided by a station, for example a base station of a cell, and transmit and / or receive communications on the carrier.

[0005] The telecommunications system and associated devices typically operate inaccordance with a given standard or specification which sets out what the various entities associated with the system are permitted to do and how that should be achieved.Communication protocols and / or parameters which shall be used for the connection are alsotypically defined. One example of a telecommunications system is the Universal MobileTelecommunications System (UMTS). Other examples of telecommunications systems are Long-Term Evolution (LTE), LTE Advanced and the so-called 5G or New Radio (NR) networks. NR is being standardized by the 3rd Generation Partnership Project (3GPP). BRIEF SUMMARY

[0006] Example implementations of the present disclosure are generally directed totelecommunications and, in particular, uplink transmissions of a user equipment in a repetition mode in which repetitions are transmitted using redundancy version values. The present disclosure includes, without limitation, the following example implementations.

[0007] Some example implementations provide an apparatus comprising: at leastone memory configured to store instructions; and at least one processing circuitry configured to access the at least one memory, and execute the instructions to cause the apparatus to at least: determine a redundancy version group size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; divide the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and transmit theplurality of PUSCH repetitions in which the multiple PUSCH repetitions within oneredundancy version group are transmitted with a same redundancy version value.

[0008] Some example implementations provide an apparatus comprising: means fordetermining a redundancy version group size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; means for dividing the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and means for transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

[0009] Some example implementations provide a method comprising: determining aredundancy version group size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; dividing the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

[0010] Some example implementations provide a computer-readable storagemedium that is non-transitory and has instructions stored therein that, in response to execution by at least one processing circuitry, causes an apparatus to at least: determine a redundancy version group size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; divide the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and transmit the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group aretransmitted with a same redundancy version value.

[0011] Some example implementations provide an apparatus comprising: at leastone memory configured to store instructions; and at least one processing circuitry configured to access the at least one memory, and execute the instructions to cause the apparatus to at least: send a scheduling grant to a user equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; receive the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and decode the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0012] Some example implementations provide an apparatus comprising: means forsending a scheduling grant to a user equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; means for receiving the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and means for decoding the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0013] In an embodiment, the apparatus further comprises means for sending aconfiguration or control information to the user equipment that includes a redundancy version group size based on which the user equipment is configured to divide the plurality of PUSCH repetitions into the redundancy version groups.

[0014] In an embodiment, the plurality of PUSCH repetitions are received in whichdifferent redundancy version values are used for respective ones of the redundancy version groups, and the plurality of PUSCH repetitions are decoded based on the different redundancy version values.

[0015] In an embodiment, the plurality of PUSCH repetitions are received in whichthe different redundancy version values are cycled across the respective ones of the redundancy version groups.

[0016] Some example implementations provide a method comprising: sending ascheduling grant to a user equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; receiving the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and decoding the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0017] In an embodiment, the method further comprises sending a configuration or controlinformation to the user equipment that includes a redundancy version group size based on which the user equipment is configured to divide the plurality of PUSCH repetitions into the redundancy version groups.

[0018] Some example implementations provide a computer-readable storagemedium that is non-transitory and has instructions stored therein that, in response to execution by at least one processing circuitry, causes an apparatus to at least: send ascheduling grant to a user equipment for a physical uplink shared channel (PUSCH)transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; receive the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and decode the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0019] These and other features, aspects, and advantages of the present disclosure will beapparent from a reading of the following detailed description together with the accompanyingfigures, which are briefly described below. The present disclosure includes any combination oftwo, three, four or more features or elements set forth in this disclosure, regardless of whether such features or elements are expressly combined or otherwise recited in a specific exampleimplementation described herein. This disclosure is intended to be read holistically such thatany separable features or elements of the disclosure, in any of its aspects and example implementations, should be viewed as combinable unless the context of the disclosure clearly dictates otherwise.

[0020] It will therefore be appreciated that this Brief Summary is provided merely forpurposes of summarizing some example implementations so as to provide a basic understanding of some aspects of the disclosure. Accordingly, it will be appreciated that the above described example implementations are merely examples and should not be construed to narrow the scope or spirit of the disclosure in any way. Other example implementations, aspects and advantages will become apparent from the following detailed description taken in conjunction with the accompanying figures which illustrate, by way of example, the principles of some described example implementations. BRIEF DESCRIPTION OF THE FIGURE(S)

[0021] Having thus described example implementations of the disclosure in general terms,reference will now be made to the accompanying figures, which are not necessarily drawn to scale, and wherein:

[0022] FIG. 1 illustrates a telecommunications system that includes one or more publicland mobile networks (PLMNs) coupled to one or more external data networks, according to some example implementations of the present disclosure;

[0023] FIG. 2 illustrates a deployment of a PLMN, according to some exampleimplementations;

[0024] FIG. 3 illustrates an example of an orthogonal cover code (OCC) of length two fortwo user equipments transmitting two physical uplink shared channel (PUSCH) repetitions in the same time-frequency resources, according to some example implementations;

[0025] FIG. 4 illustrates an example of PUSCH repetition type A with K = 4 repetitions,according to some example implementations;

[0026] FIG. 5 is a signaling chart of orthogonal cover code operation of a user equipmentfor uplink transmissions, according to some example implementations;

[0027] FIGS. 6A and 6B are flowcharts illustrating various steps in a method according tovarious example implementations;

[0028] FIGS. 7A and 7B are flowcharts illustrating various steps in a method according tovarious example implementations;; and

[0029] FIG. 8 illustrates an apparatus according to some example implementations.DETAILED DESCRIPTION

[0030] Some implementations of the present disclosure will now be described more fullyhereinafter with reference to the accompanying figures, in which some, but not all implementations of the disclosure are shown. Indeed, various implementations of the disclosure may be embodied in many different forms and should not be construed as limited to the implementations set forth herein; rather, these example implementations are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosureto those skilled in the art. Like reference numerals refer to like elements throughout.

[0031] Unless specified otherwise or clear from context, references to first, second or thelike should not be construed to imply a particular order. A feature described as being above another feature (unless specified otherwise or clear from context) may instead be below, and vice versa; and similarly, features described as being to the left of another feature else may instead be to the right, and vice versa. Also, while reference may be made herein to quantitative measures, values, geometric relationships or the like, unless otherwise stated, any one or more if not all of these may be absolute or approximate to account for acceptable variations that may occur, such as those due to engineering tolerances or the like.

[0032] As used herein, unless specified otherwise or clear from context, the “or” of a set ofoperands is the “inclusive or” and thereby true if and only if one or more of the operands is true, as opposed to the “exclusive or” which is false when all of the operands are true. Thus, for example, “[A] or [B]” is true if [A] is true, or if [B] is true, or if both [A] and [B] are true. Further, the articles “a” and “an” mean “one or more,” unless specified otherwise or clear from context to be directed to a singular form. Furthermore, it should be understood that unlessotherwise specified, the terms “data,” “content,” “digital content,” “information,” and similarterms may be at times used interchangeably. The term “network” may refer to a group of interconnected computers including clients and servers; and within a network, these computers may be interconnected directly or indirectly by various means including via one or more switches, routers, gateways, access points or the like.

[0033] Reference may be made herein to terms specific to a particular system, architectureor the like, but it should be understood that example implementations of the present disclosure may be equally applicable to any of a number of systems, architectures and the like. For example, reference may be made to 3GPP technologies such as Global System for Mobile Communications (GSM), UMTS, LTE, LTE Advanced, 5G NR, 5G Advanced and 6G; however, it should be understood that example implementations of the present disclosure may be equally applicable to non-3GPP technologies such as IEEE 802, Bluetooth and Bluetooth Low Energy.

[0034] Further, as used in this application, the term “circuitry” may refer to one or more orall of the following: (a) hardware-only circuit implementations (such as implementations in onlyanalog and / or digital circuitry); (b) combinations of hardware circuits and software, such as (as applicable): (i) a combination of analog and / or digital hardware circuit(s) with software / firmware and (ii) any portions of hardware processor(s) with software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a mobile phone or server, to perform various functions); or (c) hardware circuit(s) and / or processor(s), such as a microprocessor(s) or a portion of a microprocessor(s), that requires software (e.g., firmware) for operation, but the software may not be present when it is not needed for operation.

[0035] The above definition of circuitry applies to all uses of this term in this application,including in any claims. As a further example, as used in this application, the term circuitry also covers an implementation of merely a hardware circuit or processor (or multiple processors) or portion of a hardware circuit or processor and its (or their) accompanying software and / or firmware. The term circuitry also covers, for example and if applicable to the particular claim element, a baseband integrated circuit or processor integrated circuit for a mobile device or a similar integrated circuit in server, a cellular network device, or other computing or network device.

[0036] FIG. 1 illustrates a telecommunications system 100 according to various exampleimplementations of the present disclosure. The telecommunications system generally includes one or more telecommunications networks. As shown, for example, the system includes one ormore public land mobile networks (PLMNs) 102 coupled to one or more other external datanetworks 104 – notably including a wide area network (WAN) such as the Internet. Each of thePLMNs includes a core network (CN) 106 backbone such as the Evolved Packet Core (EPC) ofLTE, the 5G core network (5GC) or the like; and each of the core networks and the Internet arecoupled to one or more radio access networks (RANs) 108, air interfaces or the like thatimplement one or more radio access technologies (RATs). As used herein, a “network device” refers to any suitable device at a network side of a telecommunications network. Examples of suitable network devices are described in greater detail below.

[0037] In addition, the system includes one or more radio units that may be varyinglyknown as user equipment (UE) 110, terminal device, terminal equipment, mobile station or thelike. The UE is generally a device configured to communicate with a network device or a further UE in a telecommunication network. The UE may be a portable computer (e.g., laptop, notebook, tablet computer), mobile phone (e.g., cell phone, smartphone), wearable computer(e.g., smartwatch), or the like. In other examples, the UE may be an Internet of things (IoT)device, an industrial IoT (IIoT device), a vehicle equipped with a vehicle-to-everything (V2X)communication technology, or the like. In operation, these UEs may be configured to connect toone or more of the RANs 108 according to their particular radio access technologies to therebyaccess a particular CN 106 of a PLMN 102, or to access one or more of the external datanetworks 104 (e.g., the Internet). The external data network may be configured to provideInternet access, operator services, 3rd party services, etc. For example, the InternationalTelecommunication Union (ITU) has classified 5G mobile network services into threecategories: enhanced mobile broadband (eMBB), ultra-reliable and low-latency communications (URLLC), and massive machine type communications (mMTC) or massive internet of things (MIoT).

[0038] Examples of radio access technologies include 3GPP radio access technologies suchas GSM, UMTS, LTE, LTE Advanced, 5G NR, 5G Advanced, and 6G. Other examples of radio access technologies include IEEE 802 technologies such as IEEE 802.11 (Wi-Fi), IEEE 802.15 (including 802.15.1 (WPAN / Bluetooth), 802.15.4 (Zigbee) and 802.15.6 (WBAN)), Bluetooth, Bluetooth Low Energy (BLE), ultra wideband (UWB), and the like. Generally, a radio access technology may refer to any 2G, 3G, 4G, 5G, 6G or higher generation mobile communication technology and their different versions, as well as to any other wireless radio access technology that may be arranged to interwork with such a mobile communication technology to provideaccess to the CN 106 of a mobile network operator (MNO).

[0039] In various example, a RAN 108 may be configured as one or more macrocells,microcells, picocells, femtocells or the like. The RAN may generally include one or more radioaccess nodes that are configured to interact with UEs 110. In various examples, a radio accessnode may be referred to as a base station (BS), access point (AP), base transceiver station (BTS), Node B (NB), evolved NB (eNB), macro BS, NB (MNB) or eNB (MeNB), home BS, NB (HNB) or eNB (HeNB), next generation NB (gNB), enhanced gNB (en-gNB), next generation eNB (ng-eNB), or the like. Some type of network controlling / governing entity responsible for control of the radio access nodes. The network controlling / governing entity and radio access node may be separate or integrated into a single apparatus. The network controlling / governing entity may include processing circuity configured to carry out various management functions, etc. The processing circuity may be associated with a computer-readable storage medium or database for maintaining information required in the management functions.

[0040] A RAN 108 may be centralized or distributed. In various examples, components ofa RAN may be interconnected by Ethernet, Gigabit Ethernet, Asynchronous Transfer Mode (ATM), optical fiber, dark fiber, passive wavelength division multiplexing (WDM), WDM passive optical network (WDM-PON), optical transport network (OTN), time sensitive networking (TSN) and / or any other data link layer network, possibly including radio links. TheRAN may be connected to a CN 106 through one or more gateways, network functions or thelike.

[0041] As will be appreciated, a PLMN 102 may be deployed in a number of differentmanners. FIG. 2 illustrates a deployment 200 of a PLMN, such as a 4G LTE or 5G deployment,according to some example implementations. As shown, the deployment includes a CN 106, andRAN 108 with one or more radio access nodes 202 configured to interact with UEs 110. In a 4GLTE deployment, the EPC is the CN, and the evolved UMTS terrestrial radio access network (E- UTRAN) is the RAN; and the E-UTRAN includes one or more eNBs (radio access nodes) configured connect UEs to the E-UTRAN to thereby access the EPC. Similarly, in a 5G deployment, the 5GC is the CN 106, and the next generation (NG) radio access network (NG- RAN) is the RAN 108; and the NG-RAN includes one or more gNBs (radio access nodes 202)configured connect UEs 110 to the NG-RAN to thereby access the 5GC. The term ‘gNB’ in 5Gmay correspond to the eNB in 4G LTE.

[0042] Some deployments of 4G LTE and 5G in particular are considered standalone (SA)deployments. Other deployments combine 4G LTE and 5G technologies, and are referred to as non-standalone (NSA) deployments. In some deployments, the E-UTRAN includes one or moreng-eNBs that are configured to communicate with the 5GC, and that may also be configured tocommunicate with one or more gNBs. Similarly, in another deployment, the NG-RAN may include one or more en-gNBs that are configured to communicate with the EPC, and that may also be configured to communicate with one or more eNBs. In various instances, a single UE 110, a dual-mode or multimode UE, may support multiple (two or more) RANs—thereby being configured to connect to multiple RANs, such as 4G LTE and 5G.

[0043] In some deployments, operations of a radio access node 202 may be distributed orfunctionally split into components including one or more remote radio head (RRHs) or radio units (RUs), and a baseband unit (BBU); and in some architectures, the BBU may be split into adistributed unit (DU) and a central / centralized unit (CU), such as a server, host or node. In somearchitectures, the RRH / RU and DU may be collocated. It is also possible that node operations may be distributed among a plurality of servers, hosts or nodes.

[0044] It should also be understood that the distribution of work between CN 106operations and radio access node 202 operations may vary depending on implementation. Thus,a 5G network architecture may be based on a so-called CU-DU split. One gNB-CU (central node) may control one or more gNB-DUs. The gNB-CU may control a plurality of spatially separated gNB-DUs, acting at least as transmit / receive (Tx / Rx) nodes. In some example implementations, however, the gNB-DUs (also called DU) may include, for example, a radiolink control (RLC), medium access control (MAC) layer and a physical (PHY) layer, whereasthe gNB-CU (also called a CU) may include the layers above the RLC layer, such as a packet data convergence protocol (PDCP) layer, a radio resource control (RRC), and an internetprotocol (IP) layer. Other functional splits are also possible. It is considered that skilled person is familiar with the OSI model and the functionalities within each layer.

[0045] In some example implementations, the server or CU may generate a virtual networkthrough which the server communicates with the radio node. In general, virtual networking may involve a process of combining hardware and software network resources and network functionality into a single, software-based administrative entity, a virtual network. Such virtual network may provide flexible distribution of operations between the server and the radio head / node. In practice, any digital signal processing task may be performed in either the CU or the DU, and the boundary where the responsibility is shifted between the CU and the DU may be selected according to implementation.

[0046] Networks including 5G provide a very flexible and comprehensive air interface,which allows for adaptation to a lot of different deployment scenarios. More recent enhancements provide support for non-terrestrial networks (NTNs). In an NTN system, radio access node (e.g., gNB) or radio access node functionality may be deployed onboard satellites or other aerospace platforms in a regenerative deployment (or architecture), or relayed by radio access nodes in a transparent deployment. The NTN may therefore provide communication coverage over a very large area that may be otherwise unreachable by a terrestrial radio access network alone. Such functionality can be used to globally connect IoT devices, as well as provide personal communication in remote areas and in disaster relief.

[0047] More recent work has been devoted to uplink capacity / throughput enhancementsin NTN systems. This work includes enhancements to the Discrete Fourier Transform-Spread- Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) physical uplink shared channel (PUSCH) channel via orthogonal cover codes (OCCs) to enable multiplexing of multiple UEs110 in the same time-frequency resources. This may include OCCs across OFDM symbols,across slots, and / or within an OFDM symbol. As explained in greater detail below, some example implementations of the present disclosure specifically focus on the OCC application across intra-slot or inter-slot PUSCH repetitions, i.e., across OFDM symbols and across slots.

[0048] As is known, OCC is a coding technique that can be used to enhance the capacity / throughput of a cellular system. In particular, a set of orthogonal codes (e.g. Walsh-Hadamard codes) may be generated having ideal zero cross-correlation, and different codes assigned todifferent UEs 110 to achieve orthogonal (i.e., no interference) uplink transmissions on the sametime-frequency resources.

[0049] FIG. 3 illustrates an example of an orthogonal cover code (OCC) of length two fortwo UEs 110 transmitting two PUSCH repetitions in the same time-frequency resources,according to some example implementations. For the transmissions, the two UEs apply different OCCs to their transmission signal (which in the illustrated example is assumed constant acrossthe repetitions) allowing a radio access node 202 to receive, demodulate and decode the signalsof each UE without the interference of the other UE.

[0050] The process by which the radio access node 202 may receive, demodulate anddecode the signals in first and second PUSCH repetitions may be more notationally representedas follows (without channel impairments and additive noise for simplicity of description):In equation (1), x1and x2represent the signals transmitted by respective ones of a first UE (UE1) and a second UE (UE2) in both PUSCH repetitions, and y1and y2represent the totalsignals received by the radio access node 202 in respective ones of the first and second PUSCHrepetitions. It is also assumed in this example that UE1 applies the OCC [1, 1], and UE2 applies the OCC [1, -1]. As illustrated, then, the radio access node may cross-correlate y1and y2with the OCC used by UE1 (i.e., [1, 1]) to retrieve the signal from UE1 without interference from UE2. Similarly, the radio access node may cross-correlate y1 and y2 with the OCC used by UE2 (i.e., [1, -1]) to retrieve the signal from UE2 without interference from UE1. This latter is further illustrated in equation (1).

[0051] The example above is only illustrative and uses Walsh-Hadamard orthogonal codesas OCC set. Example implementations of the present disclosure may also be equally applicable to use of different sequences to realize orthogonality among UEs 110. In addition, it is to benoted that, in general, a number of at least N PUSCH (or signal) repetitions may be used inorder to multiplex N UEs.

[0052] In some deployments, such as deployment 200, a transport block (TB) may betransmitted per slot. That is, a resource allocation for a single PUSCH transmission may be limited within a slot. In 3GPP, however, a feature referred to as PUSCH repetition type A (also known as PUSCH aggregation) allows repeating the transmission of a TB within a slot multiple times across K slots. FIG.4 illustrates an example of PUSCH repetition type A with K = 4 repetitions, according to some example implementations. As shown, a PUSCH transmission 402 may include K = 4 PUSCH repetitions across four consecutive slots.

[0053] The transport block size (TBS) of PUSCH repetition type A may be determinedbased on the resource within a slot. For the PUSCH resource in each slot of the K slots, the same starting symbol (S) and length (L) may be applied. The K slots may be counted on consecutive physical slots (including downlink or special slots). In various examples, K may be RRC configured or dynamically indicated. In some examples, K may be counted on availableslots. In some of these examples, the only slots counted are those that are available (no collisionwith downlink or synchronization signal / physical broadcast channel (PBCH) block (SSB) symbols) and valid (in terms of starting symbol and length) for PUSCH transmission.

[0054] As also shown in FIG. 4, redundancy version (RV) can be cycled across the K slotsfollowing a RV sequence. The illustrated example is of a resource allocation and bit selectionfrom a circular buffer 404 for PUSCH repetition type A with RV cycling and RV sequence

[0231] . From the illustrated circular buffer, it may be seen that the bits transmitted in the repetitions are different, making the application of the OCC across PUSCH repetitions not currently possible.

[0055] As indicated above, a UE 110 performing PUSCH repetitions may transmit adifferent RV at each repetition, i.e., a different chunk of bits of the codeword generated from the TB to be transmitted. This implies that the transmitted (and hence received) modulated symbols in the time and frequency domain may be different at different PUSCH repetitions; and accordingly, the operation shown in equation (1) cannot currently be performed while maintaining orthogonality. Notably, the radio access node 202 may remove the interference of one UE before demodulating the other UE only if the transmitted (and received) modulated symbols of the one UE are kept constant throughout the repetitions that are subject to the orthogonal code. In many ways, the application of orthogonal codes to transmitted signals should follow the principles of “spreading” from code division multiple access.

[0056] Example implementations of the present disclosure therefore provide a solution forapplication of OCC to PUSCH repetitions without impacting the UE orthogonality that the OCCprovides. More particularly, some example implementations provide a solution that ensures aUE 110 uses a certain RV for a PUSCH repetition that guarantees applicability of the OCC. Thesolution of some example implementations relies on definition of an RV group (or also called RV bundle or PUSCH repetition bundle / group) to be used by the UE for determination of the RV to use throughout PUSCH repetitions when applying OCC. In this regard, an RV group may be defined so that scheduled PUSCH repetitions are split into one or multiple RV groups, each RV group containing a number of PUSCH repetitions to be transmitted with the same RV. This may, then, result in the same coded bits to be transmitted in the PUSCH repetitions within the duration of RV group.

[0057] Some example implementations therefore provide a UE 110 and a radio access node202 (e.g., gNB). The radio access node may be configured to send a scheduling grant to the UEfor a PUSCH transmission including a plurality of PUSCH repetitions. The UE may be configured to receive the scheduling grant. The UE may be configured to determine the RV group size for the PUSCH transmission, and divide the plurality of PUSCH repetitions into one or more RV groups (or a plurality of RV groups) of multiple PUSCH repetitions based on the RV group size.

[0058] The UE 110 be configured to then transmit the plurality of PUSCHrepetitions in which the multiple PUSCH repetitions within one RV group aretransmitted with a same RV value. In some examples, the plurality of PUSCH repetitions may be transmitted in which different RV values are used for respective onesof the RV groups. In some examples, the plurality of PUSCH repetitions may be transmitted inwhich an OCC is applied to the plurality of PUSCH repetitions. In some further examples,the UE may be configured to cycle the different RV values across the respective ones of the RV groups. This may be different from legacy operation in which different RV values are cycled across respective ones of the plurality of PUSCH repetitions.

[0059] The radio access node 202 may be configured to receive the plurality ofPUSCH repetitions from the UE 110, and decode the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one RV group that are received with the same RV value. In some examples where the plurality of PUSCH repetitions are received in which different RV values are used for respective ones of the RV groups, the radio access node may be configured to decode the plurality of PUSCH repetitions based on the different RV values.

[0060] In some examples, the multiple PUSCH repetitions within at least one of theRV groups are consecutive in time.

[0061] In some examples, the multiple PUSCH repetitions within at least one of theRV groups are non-consecutive in time. In a more particulare one of these other examples in which K = 4, every K-th PUSCH repetition may be part of the same RV group, leaving the RV cycling the same as in legacy operation. This may provide a reference for application of the OCC throughout the PUSCH repetitions, i.e. in this example an OCC code may be applied across repetitions occurrying every K repetitions. In case of non-consecutive RV groups, the applied OCC may also be non-consecutive and applied to the PUSCH repetitions of the same RV group. In an example, if K = 8 and PUSCH repetitions are numbered from 0 to 7 and UE applies an OCC code of length 2, UE would apply the OCC code across repetition pairs (0, 4), (1, 5), …, (3, 7) and UE would transmit the PUSCH repetitions with RV cycling using 4 different RVs, i.e., a same RV would be transmitted every 4th repetition.

[0062] In some examples, the RV group size may be determined to be equal to a number ofthe plurality of PUSCH repetitions. That is, the UE 110 may be configured to transmit theplurality of PUSCH repetitions with the same RV value.

[0063] In some examples, the RV group size may be determined based on the OCCapplied over the plurality of PUSCH repetitions, such as in an implicit manner. In this regard, the RV group size may be determined to be equal to a size of the OCC.Alternatively, the RV group size may be determined to be larger or smaller than a size of the OCC. In some of these examples, the RV group size may be determined concurrently or after the size of the OCC. If the size of the OCC changes across the PUSCH repetitions, such asin the case of an odd number of PUSCH repetitions, the UE 110 may adapt the RV group sizeaccordingly.

[0064] In some examples, the RV group size may be determined based on a pre-configuration of the UE 110, i.e., from standard specifications. In other examples, the RV group size may be determined based on a configuration (e.g., RRC configuration) orcontrol information (e.g., downlink control information – DCI) provided to the UE, suchas by the radio access node 202.

[0065] To further illustrate some example implementations of the present disclosure, FIG.5 is a signaling chart 500 of OCC operation of a UE 110 for uplink transmissions. As shown atstep 501, the radio access node 202 configures the UE 110 for OCC operation, such as via RRCsignaling. The radio access node at step 502 schedules the UE to transmit PUSCH repetitions in which an OCC of a certain size is applied to the PUSCH repetitions. In some examples, the specific OCC to use may be either dynamically indicated or RRC configured.

[0066] The UE at step 503 determines the RV group size implicitly based on the size of theindicated OCC to use. In this regard, the RV group size may be determined to be equal to thesize of the OCC. The UE then at step 504 initiates transmission of the PUSCH repetitions basedon the RV group size. And at step 505, the UE transmits the PUSCH repetitions to the radioaccess node 202 keeping the same RV value within a number of repetitions equal to the RVgroup size, and applying the OCC in a cyclic manner across the RV groups until the end of the repetitions.

[0067] FIGS. 6A and 6B are flowcharts illustrating various steps in a method 600according to various example implementations. The method includes determining a redundancy version group size for a physical uplink shared channel (PUSCH)transmission including a plurality of PUSCH repetitions, as shown at block 602 of FIG.6A. The method includes dividing the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size, as shown at block 604. And the method includes transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value, as shown at block 606.

[0068] In some examples, the multiple PUSCH repetitions within at least one of theredundancy version groups are consecutive in time.

[0069] In some examples, the multiple PUSCH repetitions within at least one of theredundancy version groups are non-consecutive in time.

[0070] In some examples, the plurality of PUSCH repetitions are transmitted atblock 606 in which an orthogonal cover code is applied to the plurality of PUSCHrepetitions.

[0071] In some examples, the redundancy version group size is determined based onthe orthogonal cover code applied over the plurality of PUSCH repetitions.

[0072] In some examples, the redundancy version group size is determined to beequal to a size of the orthogonal cover code.

[0073] In some examples, the redundancy version group size is determined to belarger or smaller than a size of the orthogonal cover code.

[0074] In some examples, the method is performed at a user equipment, and theredundancy version group size is determined at block 602 based on a pre-configurationof the user equipment, or a configuration or control information provided to the user equipment.

[0075] In some examples, the plurality of PUSCH repetitions are transmitted atblock 606 in which different redundancy version values are used for respective ones ofthe redundancy version groups.

[0076] In some examples, transmitting the plurality of PUSCH repetitions at block606 includes cycling the different redundancy version values across the respective onesof the redundancy version groups, as shown at block 608 of FIG. 6B.

[0077] FIGS. 7A and 7B are flowcharts illustrating various steps in a method 700according to various example implementations. The method includes sending a scheduling grant to a user equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions, asshown at block 702 of FIG. 7A. The method includes receiving the plurality of PUSCHrepetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value, as shown at block 704. And the method includes decoding the plurality of PUSCHrepetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value, as shown at block 706.

[0078] In some examples, the plurality of PUSCH repetitions are received at block704 in which the multiple PUSCH repetitions within at least one of the redundancyversion groups are consecutive in time.

[0079] In some examples, the plurality of PUSCH repetitions are received at block704 in which the multiple PUSCH repetitions within at least one of the redundancyversion groups are non-consecutive in time.

[0080] In some examples, the method 700 further includes sending a configurationor control information to the user equipment that includes a redundancy version group size based on which the user equipment is configured to divide the plurality of PUSCHrepetitions into the redundancy version groups, as shown at block 708 of FIG. 7B.

[0081] In some examples, the plurality of PUSCH repetitions are received at block704 in which different redundancy version values are used for respective ones of theredundancy version groups. In some of these examples, the plurality of PUSCHrepetitions are decoded at block 706 based on the different redundancy version values.

[0082] In some examples, the plurality of PUSCH repetitions are received at block704 in which the different redundancy version values are cycled across the respective onesof the redundancy version groups.

[0083] According to example implementations of the present disclosure, atelecommunications system 100 or PLMN 102, and its components such as a UE 110, CN 106,RAN 108 and / or radio access node 202, may be implemented by various means. Means forimplementing the system and its components may include hardware, firmware, software, or combinations thereof. In some examples, one or more apparatuses may be configured tofunction as or otherwise implement the system and its components shown and described herein.In examples involving more than one apparatus, the respective apparatuses may be connected to or otherwise in communication with one another in a number of different manners, such as directly or indirectly via a wired or wireless network or the like.

[0084] According to some example implementations, at least some of the method 600described with respect to FIGS.6A and 6B may be carried out by an apparatus comprising means for performing functions corresponding steps of the method. Similarly, at least some ofthe method 700 described with respect to FIGS. 7A and 7B may be carried out by an apparatuscomprising means for performing functions corresponding steps of the method. Examples of a suitable apparatus may include a user equipment, user device, user terminal or the like. Otherexamples of a suitable apparatus may include a gNB (e.g., gNB-DU, gNB-CU), ng-eNB or any suitable apparatus, such as a server, host or node.

[0085] FIG. 8 illustrates an apparatus 800 in which means for performing various functionsincludes hardware, alone or under direction of one or more computer programs from a computer-readable storage medium, such as computer memory (or more simply “memory”), according to some example implementations of the present disclosure. Generally, an apparatus of example implementations of the present disclosure may comprise, include or be embodied inone or more fixed or portable electronic devices. Examples of suitable electronic devicesinclude a wearable computer, mobile phone, portable computer, desktop computer, workstation computer, server (server computer) or the like. The apparatus may include one or more of eachof a number of components such as, for example, processing circuitry 802 connected tocomputer-readable storage medium 804.

[0086] The processing circuitry 802 may be composed of one or more processors alone orin combination with one or more computer-readable storage media. The processing circuitry is generally any piece of computer hardware that is capable of processing information such as, for example, data, computer programs and / or other suitable electronic information. The processing circuitry is composed of a collection of electronic circuits some of which may be packaged asan integrated circuit or multiple interconnected integrated circuits (an integrated circuit at timesmore commonly referred to as a “chip”). The processing circuitry may be configured to execute computer programs, which may be stored onboard the processing circuitry or otherwise storedin the computer-readable storage medium 804 (of the same or another apparatus).

[0087] The processing circuitry 802 may be a number of processors, a multi-core processoror some other type of processor, depending on the particular implementation. Further, the processing circuitry may be implemented using a number of heterogeneous processor systems in which a main processor is present with one or more secondary processors on a single chip. As another illustrative example, the processing circuitry may be a symmetric multi-processor system containing multiple processors of the same type. In yet another example, the processing circuitry may be embodied as or otherwise include one or more ASICs, FPGAs or the like. Thus, although the processing circuitry may be capable of executing a computer program to perform one or more functions, the processing circuitry of various examples may be capable of performing one or more functions without the aid of a computer program. In either instance, the processing circuitry may be appropriately programmed to perform functions or operations according to example implementations of the present disclosure.

[0088] The computer-readable storage medium 804 is generally any piece of computerhardware that is capable of storing information such as, for example, data, computer programs (e.g., computer-readable program code 806) and / or other suitable information either on atemporary basis and / or a permanent basis. The computer-readable storage medium may include volatile and / or non-volatile memory, and may be fixed or removable. Examples of suitablememory include recording media, random access memory (RAM), read-only memory (ROM), ahard drive, a flash memory, a thumb drive, a removable computer diskette, an optical disk or some combination thereof.

[0089] The computer-readable storage medium 804 is a non-transitory device capable ofstoring information, and is distinguishable from a computer-readable transmission medium capable of carrying information from one location to another. Examples of suitable computer-readable transmission media comprise electronic carrier signals, telecommunications signals,software distribution packages, or some combination thereof. As used herein, the term “non- transitory” is a limitation of the medium itself (i.e., tangible, not a signal) as opposed to alimitation on data storage persistency (e.g., RAM versus ROM). A computer-readable mediumas described herein generally refers to a computer-readable storage medium or computer- readable transmission medium. A computer-readable medium is any entity or device capable in which information, such as one or more computer programs or portions thereof, may be stored and carried.

[0090] In addition to the computer-readable storage medium 804, the processing circuitry802 may also be connected to one or more interfaces for displaying, transmitting and / orreceiving information. The interfaces may include a communications interface 808 and / or oneor more user interfaces. The communications interface may be configured to transmit and / or receive information, such as to and / or from other apparatus(es), network(s) or the like. The communications interface may be configured to transmit and / or receive information by physical (wired) and / or wireless communications links. Examples of suitable communication interfaces include a network interface controller (NIC), wireless NIC (WNIC) or the like.

[0091] The user interfaces may include a display 810 and / or one or more user inputinterfaces 812. The display may be configured to present or otherwise display information to a user, suitable examples of which include a liquid crystal display (LCD), light-emitting diode (LED) display, organic LED (OLED) display, active-matrix OLED (AMOLED) or the like. The user input interfaces may be wired or wireless, and may be configured to receive information from a user into the apparatus, such as for processing, storage and / or display. Suitable examples of user input interfaces include a microphone, image or video capture device, keyboard or keypad, joystick, touch-sensitive surface (separate from or integrated into a touchscreen), biometric sensor or the like. The user interfaces may further include one or more interfaces for communicating with peripherals such as printers, scanners or the like.

[0092] Execution of the computer-readable program code 806 by the processing circuitry802, or storage of the computer-readable program code in the computer-readable storagemedium 804, supports combinations of operations for implementing example implementationsof the present disclosure. In this manner, an apparatus 800 may comprise at least one processingcircuitry and at least one computer-readable storage medium coupled to the at least one processing circuitry, where the at least one processing circuitry is configured to execute computer-readable program code stored in the at least one computer-readable storage medium. It will also be understood that one or more functions, and combinations of functions, may be implemented by special purpose hardware-based computer systems and / or processing circuitry which perform the specified functions, or combinations of special purpose hardware and program code instructions.

[0093] Some example implementations of the present disclosure may also be carried out inthe form of a computer process defined by one or more computer programs or portions thereof. Example implementations of the present disclosure may be carried out by executing at least one portion of a computer program comprising computer-readable program code. The computer program may be in source code form, object code form, or in some intermediate form. The computer program may be stored in a computer-readable medium that is readable by a computer, processing circuitry or other suitable apparatus. As indicated above, for example, the computer program may be stored in a computer-readable storage medium. Additionally or alternatively, for example, the computer program may be stored in a computer-readable transmission medium. The coding of software for carrying out example implementations of the present disclosure is well within the scope of a person of ordinary skill in the art.

[0094] As will be appreciated, any suitable computer-readable program code may beloaded onto a computer, a processing circuitry or other programmable apparatus from a computer-readable medium (e.g., computer-readable storage medium, computer-readable transmission medium) to produce a particular machine, such that the particular machine becomes a means for implementing the functions specified herein. The computer-readable program code may also be stored in a computer-readable medium that can direct a computer, a processing circuitry or other programmable apparatus to function in a particular manner to thereby generate a particular machine or particular article of manufacture. In some examples, the computer-readable program code stored in the computer-readable medium may produce an article of manufacture, where the article of manufacture becomes a means for implementing functions described herein. The computer-readable program code may be retrieved from a computer-readable medium and loaded into a computer, processing circuitry or other programmable apparatus to configure the computer, processing circuitry or other programmable apparatus to execute operations to be performed on or by the computer, processing circuitry or other programmable apparatus.

[0095] Retrieval, loading and execution of computer-readable program code comprisingprogram code instructions may be performed sequentially such that one instruction is retrieved,loaded and executed at a time. In some example implementations, retrieval, loading and / orexecution may be performed in parallel such that multiple instructions are retrieved, loaded, and / or executed together. Execution of the program code instructions may produce a computer- implemented process such that the instructions executed by the computer, processing circuitry or other programmable apparatus provide operations for implementing functions described herein.

[0096] As explained above and reiterated below, the present disclosure includes, withoutlimitation, the following example implementations.

[0097] Clause 1. An apparatus comprising: at least one memory configured to storeinstructions; and at least one processing circuitry configured to access the at least one memory, and execute the instructions to cause the apparatus to at least: determine a redundancy version group size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; divide the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and transmit the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

[0098] Clause 2. The apparatus of clause 1, wherein the multiple PUSCH repetitionswithin at least one of the redundancy version groups are consecutive in time.

[0099] Clause 3. The apparatus of clause 1 or clause 2, wherein the multiple PUSCHrepetitions within at least one of the redundancy version groups are non-consecutive in time.

[0100] Clause 4. The apparatus of any of clauses 1 to 3, wherein the plurality of PUSCHrepetitions are transmitted in which an orthogonal cover code is applied to the plurality of PUSCH repetitions.

[0101] Clause 5. The apparatus of clause 4, wherein the redundancy version group size isdetermined based on the orthogonal cover code applied over the plurality of PUSCH repetitions.

[0102] Clause 6. The apparatus of clause 5, wherein the redundancy version group size isdetermined to be equal to a size of the orthogonal cover code.

[0103] Clause 7. The apparatus of clause 5 or clause 6, wherein the redundancy versiongroup size is determined to be larger or smaller than a size of the orthogonal cover code.

[0100] Clause 8. The apparatus of any of clauses 1 to 7, wherein the apparatus isimplemented by a user equipment, and the redundancy version group size is determined based on a pre-configuration of the user equipment, or a configuration or control information provided to the user equipment.

[0101] Clause 9. The apparatus of any of clauses 1 to 8, wherein the plurality of PUSCHrepetitions are transmitted in which different redundancy version values are used for respective ones of the redundancy version groups.

[0102] Clause 10. The apparatus of clause 9, wherein the apparatus caused to transmit theplurality of PUSCH repetitions includes the apparatus caused to cycle the different redundancy version values across the respective ones of the redundancy version groups.

[0103] Clause 11. An apparatus comprising: means for determining a redundancy versiongroup size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; means for dividing the plurality of PUSCH repetitions into redundancyversion groups of multiple PUSCH repetitions based on the redundancy version group size; andmeans for transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

[0104] Clause 12. The apparatus of clause 11, wherein the multiple PUSCH repetitionswithin at least one of the redundancy version groups are consecutive in time.

[0105] Clause 13. The apparatus of clause 11 or clause 12, wherein the multiple PUSCHrepetitions within at least one of the redundancy version groups are non-consecutive in time.

[0106] Clause 14. The apparatus of any of clauses 11 to 13, wherein the plurality ofPUSCH repetitions are transmitted in which an orthogonal cover code is applied to the plurality of PUSCH repetitions.

[0107] Clause 15. The apparatus of clause 14, wherein the redundancy version group sizeis determined based on the orthogonal cover code applied over the plurality of PUSCH repetitions.

[0108] Clause 16. The apparatus of clause 15, wherein the redundancy version group sizeis determined to be equal to a size of the orthogonal cover code.

[0109] Clause 17. The apparatus of clause 15 or clause 16, wherein the redundancyversion group size is determined to be larger or smaller than a size of the orthogonal cover code.

[0110] Clause 18. The apparatus of any of clauses 11 to 17, wherein the apparatus isimplemented by a user equipment, and the redundancy version group size is determined based on a pre-configuration of the user equipment, or a configuration or control information provided to the user equipment.

[0111] Clause 19. The apparatus of any of clauses 11 to 18, wherein the plurality ofPUSCH repetitions are transmitted in which different redundancy version values are used for respective ones of the redundancy version groups.

[0112] Clause 20. The apparatus of clause 19, wherein the means for transmitting theplurality of PUSCH repetitions includes means for cycling the different redundancy version values across the respective ones of the redundancy version groups.

[0113] Clause 21. A method comprising: determining a redundancy version group size fora physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; dividing the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

[0114] Clause 22. The method of clause 21, wherein the multiple PUSCH repetitionswithin at least one of the redundancy version groups are consecutive in time.

[0115] Clause 23. The method of clause 21 or clause 22, wherein the multiple PUSCHrepetitions within at least one of the redundancy version groups are non-consecutive in time.

[0116] Clause 24. The method of any of clauses 21 to 23, wherein the plurality of PUSCHrepetitions are transmitted in which an orthogonal cover code is applied to the plurality of PUSCH repetitions.

[0117] Clause 25. The method of clause 24, wherein the redundancy version group size isdetermined based on the orthogonal cover code applied over the plurality of PUSCH repetitions.

[0118] Clause 26. The method of clause 25, wherein the redundancy version group size isdetermined to be equal to a size of the orthogonal cover code.

[0119] Clause 27. The method of clause 25 or clause 26, wherein the redundancy versiongroup size is determined to be larger or smaller than a size of the orthogonal cover code.

[0120] Clause 28. The method of any of clauses 21 to 27, wherein the method is performedat a user equipment, and the redundancy version group size is determined based on a pre- configuration of the user equipment, or a configuration or control information provided to the user equipment.

[0121] Clause 29. The method of any of clauses 21 to 28, wherein the plurality of PUSCHrepetitions are transmitted in which different redundancy version values are used for respective ones of the redundancy version groups.

[0122] Clause 30. The method of clause 29, wherein transmitting the plurality of PUSCHrepetitions includes cycling the different redundancy version values across the respective ones of the redundancy version groups.

[0123] Clause 31. A computer-readable storage medium that is non-transitory and hasinstructions stored therein that, in response to execution by at least one processing circuitry, causes an apparatus to at least: determine a redundancy version group size for a physical uplinkshared channel (PUSCH) transmission including a plurality of PUSCH repetitions; divide the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitionsbased on the redundancy version group size; and transmit the plurality of PUSCH repetitions inwhich the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

[0124] Clause 32. The computer-readable storage medium of clause 31, wherein themultiple PUSCH repetitions within at least one of the redundancy version groups are consecutive in time.

[0125] Clause 33. The computer-readable storage medium of clause 31 or clause 32,wherein the multiple PUSCH repetitions within at least one of the redundancy version groups are non-consecutive in time.

[0126] Clause 34. The computer-readable storage medium of any of clauses 31 to 33,wherein the plurality of PUSCH repetitions are transmitted in which an orthogonal cover code isapplied to the plurality of PUSCH repetitions.

[0127] Clause 35. The computer-readable storage medium of clause 34, wherein theredundancy version group size is determined based on the orthogonal cover code applied over the plurality of PUSCH repetitions.

[0128] Clause 36. The computer-readable storage medium of clause 35, wherein theredundancy version group size is determined to be equal to a size of the orthogonal cover code.

[0129] Clause 37. The computer-readable storage medium of clause 35 or clause 36,wherein the redundancy version group size is determined to be larger or smaller than a size of the orthogonal cover code.

[0130] Clause 38. The computer-readable storage medium of any of clauses 31 to 37,wherein the apparatus is implemented by a user equipment, and the redundancy version group size is determined based on a pre-configuration of the user equipment, or a configuration or control information provided to the user equipment.

[0131] Clause 39. The computer-readable storage medium of any of clauses 31 to 38,wherein the plurality of PUSCH repetitions are transmitted in which different redundancy version values are used for respective ones of the redundancy version groups.

[0132] Clause 40. The computer-readable storage medium of clause 39, wherein theapparatus caused to transmit the plurality of PUSCH repetitions includes the apparatus caused to cycle the different redundancy version values across the respective ones of the redundancy version groups.

[0133] Clause 41. An apparatus comprising means for performing the method of any ofclauses 21 to 30.

[0134] Clause 42. A computer-readable medium comprising computer-readable programcode that, in response to execution by at least one processing circuitry, causes an apparatus to perform the method of any of clauses 21 to 30.

[0135] Clause 43. A computer-readable storage medium comprising computer-readableprogram code that, in response to execution by at least one processing circuitry, causes an apparatus to perform the method of any of clauses 21 to 30.

[0136] Clause 44. A computer program comprising computer-readable program code that,in response to execution by at least one processing circuitry, causes an apparatus to perform the method of any of clauses 21 to 30.

[0137] Clause 45. An apparatus comprising: at least one memory configured to storeinstructions; and at least one processing circuitry configured to access the at least one memory, and execute the instructions to cause the apparatus to at least: send a scheduling grant to a user equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; receive the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and decode the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0138] Clause 46. The apparatus of clause 45, wherein the plurality of PUSCH repetitionsare received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are consecutive in time.

[0139] Clause 47. The apparatus of clause 45 or clause 46, wherein the plurality of PUSCHrepetitions are received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are non-consecutive in time.

[0140] Clause 48. The apparatus of any of clauses 45 to 47, wherein the at least oneprocessing circuitry is configured to execute the instructions to cause the apparatus to further send a configuration or control information to the user equipment that includes a redundancy version group size based on which the user equipment is configured to divide the plurality of PUSCH repetitions into the redundancy version groups.

[0141] Clause 49. The apparatus of any of clauses 45 to 48, wherein the plurality ofPUSCH repetitions are received in which different redundancy version values are used for respective ones of the redundancy version groups, and the plurality of PUSCH repetitions aredecoded based on the different redundancy version values.

[0142] Clause 50. The apparatus of clause 49, wherein the plurality of PUSCH repetitionsare received in which the different redundancy version values are cycled across the respective ones of the redundancy version groups.

[0143] Clause 51. An apparatus comprising: means for sending a scheduling grant to auser equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; means for receiving the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and means for decoding the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0144] Clause 52. The apparatus of clause 51, wherein the plurality of PUSCH repetitionsare received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are consecutive in time.

[0145] Clause 53. The apparatus of clause 51 or clause 52, wherein the plurality of PUSCHrepetitions are received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are non-consecutive in time.

[0146] Clause 54. The apparatus of any of clauses 51 to 53, wherein the apparatus furthercomprises means for sending a configuration or control information to the user equipment that includes a redundancy version group size based on which the user equipment is configured to divide the plurality of PUSCH repetitions into the redundancy version groups.

[0147] Clause 55. The apparatus of any of clauses 51 to 54, wherein the plurality ofPUSCH repetitions are received in which different redundancy version values are used for respective ones of the redundancy version groups, and the plurality of PUSCH repetitions aredecoded based on the different redundancy version values.

[0148] Clause 56. The apparatus of clause 55, wherein the plurality of PUSCH repetitionsare received in which the different redundancy version values are cycled across the respective ones of the redundancy version groups.

[0149] Clause 57. A method comprising: sending a scheduling grant to a user equipmentfor a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; receiving the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and decoding the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0150] Clause 58. The method of clause 57, wherein the plurality of PUSCH repetitionsare received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are consecutive in time.

[0151] Clause 59. The method of clause 57 or clause 58, wherein the plurality of PUSCHrepetitions are received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are non-consecutive in time.

[0152] Clause 60. The method of any of clauses 57 to 59, wherein the method furthercomprises sending a configuration or control information to the user equipment that includes a redundancy version group size based on which the user equipment is configured to divide the plurality of PUSCH repetitions into the redundancy version groups.

[0153] Clause 61. The method of any of clauses 57 to 60, wherein the plurality of PUSCHrepetitions are received in which different redundancy version values are used for respective ones of the redundancy version groups, and the plurality of PUSCH repetitions are decodedbased on the different redundancy version values.

[0154] Clause 62. The method of clause 61, wherein the plurality of PUSCH repetitionsare received in which the different redundancy version values are cycled across the respective ones of the redundancy version groups.

[0155] Clause 63. A computer-readable storage medium that is non-transitory and hasinstructions stored therein that, in response to execution by at least one processing circuitry, causes an apparatus to at least: send a scheduling grant to a user equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; receive the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and decode the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

[0156] Clause 64. The computer-readable storage medium of clause 63, wherein theplurality of PUSCH repetitions are received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are consecutive in time.

[0157] Clause 65. The computer-readable storage medium of clause 63 or clause 64,wherein the plurality of PUSCH repetitions are received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are non-consecutive in time.

[0158] Clause 66. The computer-readable storage medium of any of clauses 63 to 65,wherein the computer-readable storage medium has further instructions stored therein that, in response to execution by the at least one processing circuitry, causes the apparatus to furthersend a configuration or control information to the user equipment that includes a redundancy version group size based on which the user equipment is configured to divide the plurality of PUSCH repetitions into the redundancy version groups.

[0159] Clause 67. The computer-readable storage medium of any of clauses 63 to 66,wherein the plurality of PUSCH repetitions are received in which different redundancy version values are used for respective ones of the redundancy version groups, and the plurality of PUSCH repetitions are decoded based on the different redundancy version values.

[0160] Clause 68. The computer-readable storage medium of clause 67, wherein theplurality of PUSCH repetitions are received in which the different redundancy version values are cycled across the respective ones of the redundancy version groups.

[0161] Clause 69. An apparatus comprising means for performing the method of any ofclauses 57 to 62.

[0162] Clause 70. A computer-readable medium comprising computer-readable programcode that, in response to execution by at least one processing circuitry, causes an apparatus to perform the method of any of clauses 57 to 62.

[0163] Clause 71. A computer-readable storage medium comprising computer-readableprogram code that, in response to execution by at least one processing circuitry, causes an apparatus to perform the method of any of clauses 57 to 62.

[0164] Clause 72. A computer program comprising computer-readable program code that,in response to execution by at least one processing circuitry, causes an apparatus to perform the method of any of clauses 57 to 62.

[0165] Many modifications and other implementations of the disclosure set forth hereinwill come to mind to one skilled in the art to which the disclosure pertains having the benefit of the teachings presented in the foregoing description and the associated figures. Therefore, it is to be understood that the disclosure is not to be limited to the specific implementations disclosed and that modifications and other implementations are intended to be included within the scope of the appended claims. Moreover, although the foregoing description and the associated figures describe example implementations in the context of certain example combinations of elements and / or functions, it should be appreciated that different combinations of elements and / or functions may be provided by alternative implementations without departing from the scope of the appended claims. In this regard, for example, different combinations of elements and / or functions than those explicitly described above are also contemplated as may be set forth in some of the appended claims. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.

Claims

WHAT IS CLAIMED IS:

1. An apparatus comprising:means for determining a redundancy version group size for a physical uplink sharedchannel, PUSCH, transmission including a plurality of PUSCH repetitions;means for dividing the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and means for transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

2. The apparatus of claim 1, wherein the multiple PUSCH repetitions within atleast one of the redundancy version groups are consecutive in time.

3. The apparatus of claim 1 or claim 2, wherein the multiple PUSCH repetitionswithin at least one of the redundancy version groups are non-consecutive in time.

4. The apparatus of any of claims 1 to 3, wherein the plurality of PUSCHrepetitions are transmitted in which an orthogonal cover code is applied to the plurality of PUSCH repetitions.

5. The apparatus of claim 4, wherein the redundancy version group size isdetermined based on the orthogonal cover code applied over the plurality of PUSCH repetitions.

6. The apparatus of claim 5, wherein the redundancy version group size isdetermined to be equal to a size of the orthogonal cover code.

7. The apparatus of claim 5 or claim 6, wherein the redundancy version groupsize is determined to be larger or smaller than a size of the orthogonal cover code.

8. The apparatus of any of claims 1 to 7, wherein the apparatus is implemented bya user equipment, and the redundancy version group size is determined based on a pre- configuration of the user equipment, or a configuration or control information provided to the user equipment.

9. The apparatus of any of claims 1 to 8, wherein the plurality of PUSCHrepetitions are transmitted in which different redundancy version values are used for respective ones of the redundancy version groups.

10. The apparatus of claim 9, wherein the means for transmitting the plurality ofPUSCH repetitions includes means for cycling the different redundancy version values across the respective ones of the redundancy version groups.

11. A method comprising:determining a redundancy version group size for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions; dividing the plurality of PUSCH repetitions into redundancy version groups of multiple PUSCH repetitions based on the redundancy version group size; and transmitting the plurality of PUSCH repetitions in which the multiple PUSCH repetitions within one redundancy version group are transmitted with a same redundancy version value.

12. The method of claim 11, wherein the plurality of PUSCH repetitions aretransmitted in which an orthogonal cover code is applied to the plurality of PUSCH repetitions.

13. An apparatus comprising:means for sending a scheduling grant to a user equipment for a physical uplink shared channel (PUSCH) transmission including a plurality of PUSCH repetitions that the user equipment is configured to divide into redundancy version groups of multiple PUSCH repetitions; means for receiving the plurality of PUSCH repetitions from the user equipment in which the multiple PUSCH repetitions within one redundancy version group are received with a same redundancy version value; and means for decoding the plurality of PUSCH repetitions, including the multiple PUSCH repetitions within one redundancy version group that are received with the same redundancy version value.

14. The apparatus of claim 13, wherein the plurality of PUSCH repetitions arereceived in which the multiple PUSCH repetitions within at least one of the redundancy version groups are consecutive in time.

15. The apparatus of claim 13 or claim 14, wherein the plurality of PUSCHrepetitions are received in which the multiple PUSCH repetitions within at least one of the redundancy version groups are non-consecutive in time.

Images