Systems and methods for resource mapping enhancements

Abstract

Systems and methods for resource mapping enhancements are introduced. A wireless communication device can determine one or more configuration parameters for a physical uplink shared channel (PUSCH) transmission. The wireless communication device can perform a resource mapping pattern for the PUSCH transmission based on the determined one or more configuration parameters.

Description

Technical Field

[0001] This disclosure generally relates to wireless communications, including but not limited to systems and methods for resource mapping / repetition enhancement. Background Technology

[0002] The standards organization Third Generation Partnership Project (3GPP) is currently specifying a new radio interface called 5G New Radio (5G NR) and the next-generation packet core network (NG-CN or NGC). 5G NR will have three main components: the 5G Access Network (5G-AN), the 5G Core Network (5GC), and the User Equipment (UE). To facilitate the implementation of different data services and requirements, the elements of 5GC (also known as network functions) have been simplified, some based on software and others on hardware, so that they can be adapted as needed. Satellite communication is one of the typical scenarios for non-terrestrial networks in 3GPP standardization. Summary of the Invention

[0003] The exemplary embodiments disclosed herein relate to solving problems associated with one or more difficulties presented in the prior art, and provide additional features that will become apparent when taken in conjunction with the accompanying drawings and the following detailed description. Exemplary systems, methods, apparatuses, and computer program products are disclosed herein according to various embodiments. However, it should be understood that these embodiments are presented by way of example and are not limiting, and that various modifications can be made to the disclosed embodiments by those skilled in the art who have read this disclosure, while remaining within the scope of this disclosure.

[0004] At least one aspect relates to a system, method, apparatus, or computer-readable medium that can determine one or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission. The wireless communication device can perform a resource mapping mode for PUSCH transmission based on the determined configuration parameters. In some embodiments, the configuration parameters can indicate at least one of the following: a resource mapping mode, wherein the resource mapping mode is at least one repeated transmission of: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots (e.g., nSlots, repeated); an application scheme of orthogonal coverage codes (OCC) for PUSCH transmission, wherein the OCC application scheme spans at least one of the following: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots; an index of the OCC sequence; the length of the OCC sequence; the number of repetitions (e.g., ...). ); the number of repetitions in the same time slot (e.g. The number of scheduled resource units (RUs); the number of consecutive subcarriers; the number of repetitions of the same symbol; or the number of repetitions of consecutive time slots (e.g., nSlots).

[0005] In some embodiments, the resource mapping pattern can be indicated via at least one of the following: higher-layer signaling; or downlink control information (DCI) signaling; or associating the resource mapping pattern of the PUSCH transmission with the application scheme of OCC. The association can be: when the application scheme of OCC spans one or more time slots, the resource mapping pattern is a repeated transmission of one or more time slots; or when the application scheme of OCC spans one or more symbols, the resource mapping pattern is a repeated transmission of one or more symbols. In some embodiments, elements of the OCC sequence can be multiplied by one or more repetitions of a symbol, time slot, or consecutive time slot. In some embodiments, a 2-length OCC sequence can be [W0 W1], and the elements of the sequence can be multiplied by two repetitions of a symbol (e.g., [W0 multiplied by symbol1 W1 multiplied by symbol1]). In some embodiments, a 4-length OCC sequence can be [W0 W1 W2 W3], and the elements of the sequence can be multiplied by four repetitions of a time slot (e.g., [W0 multiplied by slot1 W1 multiplied by slot1 W2 multiplied by slot1 W3 multiplied by slot1). In some embodiments, a 2-length OCC sequence can be [W0 W1], and the elements of the sequence can be multiplied by two repetitions of consecutive time slots (e.g., if there are 2 consecutive time slots, [W0 multiplied by 2 slot1, W1 multiplied by 2 slot1]). In some embodiments, the repetition of a transport block can include one or more different symbols. In some embodiments, the repetition of a transport block can include one or more different time slots. In some embodiments, the repetition of a transport block can include one or more different consecutive time slots.

[0006] In some embodiments, a type of PUSCH may include, for example, a New Radio (NR) PUSCH, an Internet of Things (IoT) PUSCH (e.g., a narrowband PUSCH), a Long Term Evolution (LTE) PUSCH, an Enhanced Machine Type Communication (eMTC) PUSCH, or other UL channels carrying data or information in NR / LTE / eMTC / IoT / Ultra-Reliable Low Latency Communication (URLLC). In some embodiments, if the resource mapping pattern is a repetition of one or more time slots, the mapping may be performed for the first time when a condition is met, until the repetition number is reached. This condition may include: the number of repetitions of the same time slot is greater than and / or equal to the length of the OCC sequence (e.g., , or In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repetition of one or more time slots, the mapping is performed with the same redundancy version (RV) for the first number when the condition is met, until the second number is reached. This condition may include: the number of repetitions of the same time slot is less than the length of the OCC sequence (e.g., In some embodiments, if the resource mapping pattern is a repeated transmission of one or more time slots, the mapping can be performed a third time, until the number of repetitions is reached, when a condition is met. This condition may include: the second time is less than the number of repetitions (e.g., ...). For each subsequent execution of the mapping (e.g., each second number), a different RV can be used. In some embodiments, if the resource mapping pattern is a repeated transmission of one or more time slots, the mapping can be executed for the first number of times, until the number of repetitions is reached, when a condition is met. This condition may include: the number of repetitions of the same time slot is greater than and / or equal to the length of the OCC sequence (e.g., , or In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repetition of one or more time slots, the mapping may be performed with the same redundancy version (RV) for the first number of times when the condition is met, until the second number of times is reached. This condition may include: the number of repetitions of the same time slot is less than the length of the OCC sequence (e.g., in bits / elements) (e.g., In some embodiments, after the second number is reached, the mapping can be performed a third time, until the number of repetitions is reached. For each subsequent execution of the mapping (e.g., each third number), a different RV can be used.

[0007] In some embodiments, if the resource mapping pattern is a repeated transmission of one or more time slots, the mapping can be performed for the first number of times with the same redundancy version (RV) when a condition is met, until the number of repetitions of the same time slot is reached. This condition may include: the number of repetitions of the same time slot is equal to the length of the OCC sequence (e.g., in bits / elements). In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the number of repetitions of the same time slot is determined to be equal to the length of the OCC sequence. For each subsequent number of times the mapping is performed (e.g., each first number), a different RV can be used. In some embodiments, the mapping performed implies a time slot / symbol-level mapping corresponding to the resource mapping pattern.

[0008] In some embodiments, if the resource mapping pattern is a repeated transmission of one or more symbols, the mapping can be performed for the first time when a condition is met, until the number of repetitions is reached. This condition may include: the number of identical symbols being greater than and / or equal to the length of the OCC sequence (e.g., ...). , or In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repetition of one or more symbols, the mapping may be performed with the same RV for the first number when the condition is met, until the second number is reached. This condition may include: the number of the same symbol is less than the length of the OCC sequence (e.g., ).

[0009] In some embodiments, if the resource mapping pattern is a repeated transfer of one or more symbols, the mapping can be performed a third time, until the repetition count is reached, provided a condition is met. This condition may include: the second number is less than the repetition count (e.g., ...). For each subsequent execution of the mapping (e.g., each second number), a different RV can be used. In some embodiments, if the resource mapping pattern is a repeated transfer of one or more symbols, the mapping can be executed for the first number of times, until the number of repetitions is reached, when a condition is met. This condition may include: the number of identical symbols is greater than and / or equal to the length of the OCC sequence (e.g., ...). , ,or In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first count), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repeated transmission of one or more symbols, the mapping may be performed for the first count with the same redundancy version (RV) when the condition is met, until the second count is reached. This condition may include: the number of the same symbol is less than the length of the OCC sequence. In some embodiments, after the second count is reached, the mapping may be performed for the third count, until the repetition count is reached. For each subsequent execution of the mapping (e.g., each third count), a different RV may be used.

[0010] In some embodiments, if the resource mapping pattern is / represents / indicates the repeated transmission of one or more symbols, the mapping can be performed for the first number of times with the same redundancy version (RV) when a condition is met, until the number of repetitions of the same symbol is reached. This condition may include: the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the number of repetitions of the same symbol is determined to be equal to the length of the OCC sequence. For each subsequent number of times the mapping is performed (e.g., each first number), a different RV can be used.

[0011] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmissions of consecutive time slots (e.g., nSlots, time slots in an nRU, two or more time slots), then the mapping can be performed for the first number of times in multiple sets of time slots until the number of repetitions is reached, when a condition is met. This condition may include: the same number of repetitions of consecutive time slots is greater than and / or equal to the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions being greater than the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions being equal to the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions being greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used.

[0012] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmission of consecutive time slots, then the mapping can be performed a first count in multiple sets of time slots with the same redundancy version (RV) until a second count is reached, provided a condition is met. This condition may include: the number of repetitions of consecutive time slots is less than the length of the OCC sequence. In some embodiments, after the second count is reached, the mapping can be performed a third count in multiple sets of time slots until the repetition count is reached. For each subsequent count of the mapping (e.g., each third count), a different RV can be used.

[0013] In some embodiments, the number of repetitions of consecutive time slots can be determined by at least one of the following: a number of 1 when the number of resource units is 1; or a number that is the minimum between a first factor and 4 when the number of resource units is greater than 1, where the first factor is the number of repetitions divided by 2 and rounded. In some embodiments, if the resource mapping pattern is a repetitive transmission of consecutive time slots, the mapping can be performed for the first count in multiple sets of time slots until the number of repetitions is reached, provided a condition is met. This condition can include: the number of repetitions of consecutive time slots is greater than and / or equal to the length of the OCC sequence. In some embodiments, the condition can be that the number of repetitions of consecutive time slots is greater than the length of the OCC sequence. In some embodiments, the condition can be that the number of repetitions of consecutive time slots is equal to the length of the OCC sequence. In some embodiments, the condition can be that the number of repetitions of consecutive time slots is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first count), a different redundancy version (RV) can be used.

[0014] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmissions of consecutive time slots, then the mapping can be performed a first count in multiple sets of time slots with the same redundancy version (RV) until the length of the OCC sequence is reached, provided a condition is met. This condition may include: the number of identical repetitions of consecutive time slots is less than the length of the OCC sequence. After the length of the OCC sequence is reached, the mapping can be performed a second count in multiple sets of time slots until the repetition count is reached. For each subsequent count of the mapping (e.g., each second count), a different RV can be used.

[0015] In some embodiments, if the resource mapping mode is / represents / indicates repeated transmission of consecutive time slots, then when a condition is met, the mapping can be performed for the first time in multiple sets of time slots with the same redundancy version until the length of the OCC sequence is reached. This condition may include: the same number of repetitions of consecutive time slots equals the length of the OCC sequence. In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the same number of repetitions of consecutive time slots is determined to be equal to the length of the OCC sequence. In some embodiments, after the length of the OCC sequence is reached, the mapping can be performed for the second time in multiple sets of time slots until the repetition number is reached. For each subsequent time of mapping (e.g., the second time), a different redundancy version (RV) can be used. In some embodiments, the mapping performed means a consecutive time slot-level mapping corresponding to the resource mapping mode. In some embodiments, the repetition of transport blocks includes one or more repetitions of one or more different consecutive time slots.

[0016] In some embodiments, a wireless communication node (e.g., a base station (BS)) may send one or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission to a wireless communication device (e.g., a user equipment (UE)). The wireless communication device may execute a resource mapping mode for PUSCH transmission based on one or more configuration parameters. Attached Figure Description

[0017] Various exemplary embodiments of this solution are described in detail below with reference to the figures or accompanying drawings. The drawings are provided for illustrative purposes only and depict only exemplary embodiments of the solution to facilitate the reader's understanding. Therefore, the drawings should not be considered as limitations on the breadth, scope, or applicability of the solution. It should be noted that these drawings are not necessarily drawn to scale for clarity and ease of illustration.

[0018] Figure 1 An example cellular communication network according to an embodiment of the present disclosure is shown, in which the techniques disclosed herein may be implemented;

[0019] Figure 2 Block diagrams of example base station and user equipment apparatuses according to some embodiments of the present disclosure are shown;

[0020] Figure 3 Example implementations of non-terrestrial network (NTN) communication according to some embodiments of this disclosure are shown;

[0021] Figure 4 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0022] Figure 5Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0023] Figure 6 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0024] Figure 7 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0025] Figure 8 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0026] Figure 9 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0027] Figure 10 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0028] Figure 11 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown;

[0029] Figure 12 Example implementations for resource mapping enhancement according to some embodiments of this disclosure are shown; and

[0030] Figure 13 A flowchart of an example method for resource mapping enhancement according to embodiments of the present disclosure is shown. Detailed Implementation

[0031] 1. Mobile communication technology and environment

[0032] Figure 1 An example wireless communication network and / or system 100 according to an embodiment of this disclosure is illustrated, in which the techniques disclosed herein may be implemented. In the following discussion, wireless communication network 100 may be any wireless network, such as a cellular network or a narrowband Internet of Things (NB-IoT) network, and is referred to herein as "network 100". Such an example network 100 includes a base station 102 (hereinafter referred to as "BS 102"; also referred to as a wireless communication node) and a user equipment device 104 (hereinafter referred to as "UE 104"; also referred to as a wireless communication device), which may communicate with each other via a communication link 110 (e.g., a wireless communication channel); and a cluster of cells 126, 130, 132, 134, 136, 138, and 140 covering a geographic area 101. Figure 1In this context, BS 102 and UE 104 are included within the corresponding geographical boundaries of cell 126. Each of the other cells 130, 132, 134, 136, 138, and 140 may include at least one base station operating within its allocated bandwidth to provide adequate radio coverage to its intended users.

[0033] For example, BS 102 can operate at the allocated channel transmission bandwidth to provide sufficient coverage to UE 104. BS 102 and UE 104 can communicate via downlink radio frame 118 and uplink radio frame 124, respectively. Each radio frame 118 / 124 can be further divided into subframes 120 / 127, which may include data symbols 122 / 128. In this disclosure, BS 102 and UE 104 are described herein as non-limiting examples of "communication nodes," which generally practice the methods disclosed herein. According to various embodiments of this solution, such communication nodes may be able to perform wireless and / or wired communication.

[0034] Figure 2 A block diagram of an example wireless communication system 200 for transmitting and receiving wireless communication signals (e.g., OFDM / OFDMA signals) according to some embodiments of this solution is shown. System 200 may include components and elements configured to support known or conventional operating characteristics that do not need to be described in detail herein. In one illustrative embodiment, system 200 can be used in wireless communication environments (such as...) Figure 1 In a wireless communication environment 100, data symbols are conveyed (e.g., transmitted and received), as described above.

[0035] System 200 typically includes a base station 202 (hereinafter referred to as "BS 202") and a user equipment device 204 (hereinafter referred to as "UE 204"). BS 202 includes a BS (Base Station) transceiver module 210, a BS antenna 212, a BS processor module 214, a BS memory module 216, and a network communication module 218, each module being coupled and interconnected with each other via a data communication bus 220 when necessary. UE 204 includes a UE (User Equipment) transceiver module 230, a UE antenna 232, a UE memory module 234, and a UE processor module 236, each module being coupled and interconnected with each other via a data communication bus 240 when necessary. BS 202 communicates with UE 204 via a communication channel 250, which can be any wireless channel or other medium suitable for data transmission as described herein.

[0036] As understood by those skilled in the art, in addition to Figure 2In addition to the modules shown, system 200 may include any number of modules. Those skilled in the art will understand that the various illustrative blocks, modules, circuits, and processing logic described in connection with the embodiments disclosed herein can be implemented in hardware, computer-readable software, firmware, or any practical combination thereof. To clearly illustrate this interchangeability and compatibility of hardware, firmware, and software, the various illustrative components, blocks, modules, circuits, and steps are generally described in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software can depend on the specific application and design constraints imposed on the system as a whole. Those skilled in the art, skilled in the art, can implement such functionality in a suitable manner for each specific application; however, such implementation decisions should not be construed as limiting the scope of this disclosure.

[0037] According to some embodiments, UE transceiver 230, which may be referred to herein as "uplink" transceiver 230, includes a radio frequency (RF) transmitter and an RF receiver, each including circuitry coupled to antenna 232. A duplex switch (not shown) can alternately couple the uplink transmitter or receiver to the uplink antenna in a time-division duplex manner. Similarly, according to some embodiments, BS transceiver 210, which may be referred to herein as "downlink" transceiver 210, includes a radio frequency (RF) transmitter and an RF receiver, each including circuitry coupled to antenna 212. A downlink duplex switch can alternately couple the downlink transmitter or receiver to downlink antenna 212 in a time-division duplex manner. The operation of the two transceiver modules 210 and 230 can be time-coordinated, such that while the downlink transmitter is coupled to downlink antenna 212, the uplink receiver circuitry is coupled to uplink antenna 232 for receiving transmissions on radio transmission link 250. Conversely, the operation of the two transceiver modules 210 and 230 can be time-coordinated, such that while the uplink transmitter is coupled to the uplink antenna 232, the downlink receiver is coupled to the downlink antenna 212 for receiving transmissions on the wireless transmission link 250. In some embodiments, there is tight time synchronization with a minimum guard time between variations in the duplex direction.

[0038] UE transceiver 230 and base transceiver 210 are configured to communicate via wireless data communication link 250 and cooperate with RF antenna arrangements 212 / 232 appropriately configured to support specific wireless communication protocols and modulation schemes. In some illustrative embodiments, UE transceiver 230 and base transceiver 210 are configured to support industry standards such as Long Term Evolution (LTE) and emerging 5G standards. However, it should be understood that this disclosure is not necessarily limited to specific standards and associated protocols in application. More precisely, UE transceiver 230 and base transceiver 210 may be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.

[0039] According to various embodiments, BS 202 may be, for example, an evolved Node B (eNB), a serving eNB, a target eNB, a femtocell, or a picocell. In some embodiments, UE 204 may be embodied in various types of user equipment, such as mobile phones, smartphones, personal digital assistants (PDAs), tablets, laptops, wearable computing devices, etc. Processor modules 214 and 236 may be implemented or carried out using a general-purpose processor, content-addressable memory, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), any suitable programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, and are designed to perform the functions described herein. In this way, the processor may be implemented as a microprocessor, a controller, a microcontroller, a state machine, or the like. The processor may also be implemented as a combination of computing devices, such as a combination of a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors coupled with a digital signal processor core, or any other such configuration.

[0040] Furthermore, the steps of the methods or algorithms described in conjunction with the embodiments disclosed herein can be directly embodied in hardware, firmware, software modules executed by processor modules 214 and 236 respectively, or any actual combination thereof. Memory modules 216 and 234 can be implemented as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art. In this regard, memory modules 216 and 234 can be coupled to processor modules 210 and 230 respectively, such that processor modules 210 and 230 can read information from and write information to memory modules 216 and 234 respectively. Memory modules 216 and 234 can also be integrated into their respective processor modules 210 and 230. In some embodiments, memory modules 216 and 234 may each include a cache memory for storing temporary variables or other intermediate information during the execution of instructions executed by processor modules 210 and 230 respectively. Memory modules 216 and 234 may each include non-volatile memory for storing instructions to be executed by processor modules 210 and 230, respectively.

[0041] Network communication module 218 generally refers to the hardware, software, firmware, processing logic, and / or other components of base station 202 that enable bidirectional communication between base station transceiver 210 and other network components and communication nodes configured to communicate with base station 202. For example, network communication module 218 may be configured to support Internet or WiMAX traffic. In a typical deployment, without limitations, network communication module 218 provides an 802.3 Ethernet interface, allowing base station transceiver 210 to communicate with a conventional Ethernet-based computer network. In this way, network communication module 218 may include a physical interface for a connection to a computer network (e.g., a Mobile Switching Center (MSC)). The terms “configured for…”, “configured as…”, and their variations, as used herein in relation to a specified operation or function, refer to devices, components, circuits, structures, machines, signals, etc., that are physically constructed, programmed, formatted, and / or arranged to perform the specified operation or function.

[0042] The Open Systems Interconnection (OSI) model (referred to herein as the "OSI model") is a conceptual and logical layout that defines the openness of network communication used by systems (e.g., wireless communication devices, wireless communication nodes) to interconnection and communication with other systems. The model is decomposed into seven sub-components or layers, each representing a conceptual set of services provided to the layers above and below it. The OSI model also defines logical networks and effectively describes the transmission of computer packets using different layer protocols. The OSI model may also be referred to as the seven-layer OSI model or the seven-layer model. In some embodiments, the first layer may be the physical layer. In some embodiments, the second layer may be the Medium Access Control (MAC) layer. In some embodiments, the third layer may be the Radio Link Control (RLC) layer. In some embodiments, the fourth layer may be the Packet Data Convergence Protocol (PDCP) layer. In some embodiments, the fifth layer may be the Radio Resource Control (RRC) layer. In some embodiments, the sixth layer may be the Non-Access Stratum (NAS) layer or the Internet Protocol (IP) layer, and the seventh layer is another layer.

[0043] Various exemplary embodiments of this solution are described below with reference to the accompanying drawings to enable those skilled in the art to make and use the solution. It will be apparent to those skilled in the art that various changes or modifications can be made to the examples described herein without departing from the scope of this solution after reading this disclosure. Therefore, this solution is not limited to the exemplary embodiments and applications described and illustrated herein. Furthermore, the specific order or hierarchy of steps in the methods disclosed herein is merely an example approach. Based on design preferences, the specific order or hierarchy of steps in the disclosed methods or processes can be rearranged while remaining within the scope of this solution. Therefore, those skilled in the art will understand that the methods and techniques disclosed herein present various steps or actions in a sample order, and unless otherwise expressly stated, this solution is not limited to the specific order or hierarchy presented.

[0044] 2. Systems and methods for resource mapping enhancement

[0045] To resolve the conflict between limited resources and a large number of user equipment (UEs), one approach is to increase uplink capacity. Additionally, non-terrestrial networks (NTNs) can be supported. Satellite communication systems, due to their wide coverage, can cover a greater variety and number of UEs. For example, narrowband internet of things (NB-IoT) NTNs can be deployed. In some deployments, it becomes apparent that systems such as those for NB-IoT may necessarily require supporting large-scale capacity in terms of the number and type of UEs, some of which have inferior characteristics compared to others (e.g., low-cost devices or wearables). However, capacity analysis indicates that current UL systems have limited capacity.

[0046] For example, symbol / slot / repetition / redundancy version (RV) level OCC can be used to implement methods for extending the capacity of the Physical Uplink Shared Channel (PUSCH) in terrestrial / non-terrestrial networks (TN / NTN). However, since orthogonal coverage codes (OCCs) can be applied to the same data resource, the mapping mechanism for narrowband Physical Uplink Shared Channel (NPUSCH) codewords may need to be enhanced to accommodate the OCC mechanism. Methods for enhancing the mapping of NPUSCH transmissions are discussed in this disclosure.

[0047] Figure 3 Example implementations of non-terrestrial network (NTN) communication according to some embodiments of this disclosure are shown. The structure of a transparent NTN is as follows... Figure 3 As shown. The link between the UE and the satellite can be a serving link. The link between the BS and the satellite can be a feeder link, and can be common to all UEs within the same cell.

[0048] Resource units can be used to describe the mapping from NPUSCH transfers to resource elements. Resource units can be defined in the time domain as... SC-FDMA symbols and defined in the frequency domain as 1 consecutive subcarrier, of which and Tables 1 and 2 provide information for frame structure type 1 and frame structure type 2, respectively.

[0049] Table 1: Frame Structure Type 1 Supported , and The combination of .

[0050] Table 2: Frame Structure Type 2 Supported , and The combination of .

[0051] Each NPUSCH codeword (e.g., the resource mapping pattern for each NPUSCH transmission) can be mapped to one or more resource units. Each resource unit can be transmitted. This can be configured via higher-level signaling (e.g., the Msg3 repeating number field in the UL authorization of the random access response (RAR)) or the repeating number field in the corresponding DCI (format N0), and can represent the number of NPUSCH repeats.

[0052] Complex value symbol block It can be multiplied by the amplitude scaling factor To meet the transmission power P NPUSCH And sequentially map from z(0) to the subcarriers allocated for NPUSCH transmission. The mapping to the resource element (k, l) corresponding to the subcarrier allocated for transmission but not used for reference signal transmission can be performed in ascending order of first indexing k and then indexing l, starting from the first time slot in the allocated resource unit.

[0053] Meanwhile, in order to improve uplink soft coverage and ensure data transmission quality, when mapping to After one time slot, A time slot can be repeated before continuing with the next time slot mapping. One additional time, of which

[0054]

[0055] In some embodiments, The quantity can be determined by at least one of the following: when the number of resource units is 1, the quantity is 1; or when the number of resource units is greater than 1, the quantity is the minimum between the first factor and 4, where the first factor can be the number of repetitions divided by 2 and rounded.

[0056] According to the formula, for a 15 kHz subcarrier spacing, after mapping the codewords onto a pair of time slots, these time slots can be repeated before continuing the mapping of codewords. In the case of 3.75 kHz transmission, mapping can be performed on a single time slot before repetition. After the codeword is mapped to a time slot, the time slot can be repeated 0 times before continuing the mapping of codewords. That is, after each NPUSCH codeword is mapped to one or more resource units, each of the resource units can be transmitted. Second-rate.

[0057] In some examples, when the repetition count is 8, the number of scheduled UL resource units can be 2, and the allocated subcarriers are multi-tone (e.g., 3, 6, 12). Figure 4 The resource mapping for NPUSCH codewords used for polyphony is shown. Figure 4 This illustrates the transmission of a transport block (TB). The first pair of time slots, 1 and 2, can be repeated before mapping continues to the second pair of time slots 3 and 4. An additional number of times. After 16 time slots, the complete codeword has been repeated four times, and the scrambling has been reinitialized, with the redundant version being updated. This process can then be repeated once more to complete a total of eight repetitions for TB.

[0058] In some examples, when the repetition count is 2, the number of scheduled UL resource units can be 1, and the allocated subcarrier is a single tone (e.g., 1 subcarrier / frequency / band). Figure 5 The resource mapping for NPUSCH codewords used for monotones is shown. Figure 5 The transmission of a TB is shown. After 16 time slots, the complete codeword has been repeated once, and the scrambling has been reinitialized, with the redundant version being updated. This process can then be repeated once more to complete a total of two repetitions of the TB.

[0059] Furthermore, in the following implementation examples, the enhanced resource mapping can be used for PUSCH / NPUSCH transmission in NTN / TN. The RV cycle can be [0 2 0 2...]. Each element of the cycle can correspond to a TB. One repetition. That is to say, consecutive. Each repeating element may have the same RV. In the following implementation examples, RV can be applied. One repeat and / or One repetition.

[0060] Implementation Example 1: Slot-Level Resource Mapping with PUSCH Codeword Enhancement

[0061] A wireless communication device (e.g., a user equipment (UE)) can determine one or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission. The wireless communication device can perform a resource mapping mode for PUSCH transmission based on the determined one or more configuration parameters. In some embodiments, the one or more configuration parameters can indicate at least one of the following: a resource mapping mode, wherein the resource mapping mode is at least one repeated transmission of: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots (e.g., nSlots, repeated); an application scheme of the orthogonal coverage code (OCC) for PUSCH transmission, wherein the OCC application scheme spans at least one of the following: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots; an index of the OCC sequence; the length of the OCC sequence; the number of repetitions (e.g., ...). ); the number of repetitions in the same time slot (e.g. The number of scheduled resource units (RUs); the number of consecutive subcarriers; the number of repetitions of the same symbol; or the number of repetitions of consecutive time slots (e.g., nSlots).

[0062] In some embodiments, the resource mapping pattern may be indicated via at least one of the following: higher-layer signaling; or downlink control information (DCI) signaling; or associating the resource mapping pattern of the PUSCH transmission with the application scheme of the OCC. The association may be: when the OCC application scheme spans one or more time slots, the resource mapping pattern is a repetition of one or more time slots; or when the OCC application scheme spans one or more symbols, the resource mapping pattern is a repetition of one or more symbols. In some embodiments, a type of PUSCH may include, for example, a New Radio (NR) PUSCH, an Internet of Things (IoT) PUSCH, a Long Term Evolution (LTE) PUSCH, and an Enhanced Machine Type Communication (eMTC) PUSCH, or other UL channels carrying data or information in NR / LTE / eMTC / IoT / Ultra-Reliable Low Latency Communication (URLLC).

[0063] The mapping to the resource element (k, l) corresponding to the subcarrier allocated for transmission but not used for reference signal transmission can be performed in ascending order, first indexing k and then indexing l, starting from the first time slot in the allocated resource unit.

[0064] In this disclosure, the accompanying drawings are provided as examples to illustrate the situation, but do not represent the only implementation method. Example 1 of the corresponding implementation configuration could be: number of repetitions. For 8, multiple tones (e.g., 12), the number of scheduled RUs. The value is 2, and the subcarrier spacing is 15kHz.

[0065] Scenario 1: In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmission of one or more time slots, then the mapping can be performed for the first time when a certain condition is met, until the number of repetitions is reached. This condition may include: the number of repetitions of the same time slot is greater than and / or equal to the length of the OCC sequence (e.g., , or In some embodiments, the condition may be that the number of repetitions in the same time slot is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions in the same time slot is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions in the same time slot is greater than or equal to the length of the OCC sequence. For each subsequent iteration of the mapping (e.g., each first iteration), a different redundant version (RV) can be used. For example, an existing version can be reused. Configuration. This unit can be a time slot. This time slot can be repeated until... The time slot is repeated until the first time slot is repeated, then the next time slot is repeated, until the complete codeword has been repeated. Repeat until the last time. If / when , or After being mapped to the first time slot (e.g., one or two time slots), these time slots can be repeated. One additional time, of which

[0066]

[0067] It has been repeated in the first time slot After that, the redundant version can be updated, and then the first time slot can be repeated. One additional time. It has already been repeated in the first time slot. After this, a mapping process for the next time slot can then be executed to complete all time slot mapping / repetition for the TB, such as... Figure 6 As shown. Figure 6 The slot-level resource mapping for a PUSCH codeword with 8 repeats and 2 resource units (RUs) is shown. In this entry, the traditional redundant version cycle may not be modified, for example, [0 2 0 2 0 2 ...]. In some embodiments, for 16 repeats: the resource mapping pattern can be: 1111(rv0)1111(rv2)1111(rv0)1111(rv2)2222, etc. In some embodiments, for 4 repeats, the mapping can be: 11(rv0)11(rv2)22(rv0). Each element represents a slot.

[0068] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmission of one or more time slots, then when a condition is met, the mapping is performed for the first count with the same redundancy version (RV), until a second count is reached. This condition may include: the number of repetitions of the same time slot is less than the length of the OCC sequence (e.g., ...). For example, if It has been repeated in the first time slot. Subsequently, the redundant version may not be updated, so the first time slot may continue to be repeated. One additional time.

[0069] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmission of one or more time slots, then the mapping can be performed a third time, until the number of repetitions is reached, when a condition is met. This condition may include: the second time is less than the number of repetitions (e.g., ...). For each subsequent iteration of the mapping (e.g., the third number), a different RV is used. For example, if Then RV may be updated and the process repeated. It has already been repeated in the first time slot. After this, the mapping process for the next time slot can be executed to complete all time slot mapping / repetition of the TB, such as... Figure 7 As shown. Figure 7 The slot-level resource mapping for a PUSCH codeword with 8 repetitions and 2 RUs is shown. In this entry, the redundant version cycle can be modified, for example, [0 0 2 2 0 0 ...]. The same mechanism can be used for both monotones and polytones.

[0070] Scenario 2: If the resource mapping mode is / represents / indicates repeated transmission of one or more time slots, then the mapping can be performed for the first time when a certain condition is met, until the number of repetitions is reached. This condition may include: the number of repetitions of the same time slot is greater than and / or equal to the length of the OCC sequence (e.g., ...). , or In some embodiments, the condition may be that the number of repetitions in the same time slot is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions in the same time slot is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions in the same time slot is greater than or equal to the length of the OCC sequence. For each subsequent iteration of the mapping (e.g., each first iteration), a different redundant version RV can be used. For example, an existing version can be reused. Configuration. This unit can be a time slot. This time slot can be repeated until... The time slot is repeated until the first time slot is repeated, then the next time slot is repeated, until the complete codeword has been repeated. Repeat this process until the result is reached. Repeat until the last one is reached. If or or After being mapped to the first time slot (e.g., one or two time slots), the time slot can be repeated before continuing to the next time slot mapping. One additional time, of which

[0071]

[0072] The complete code has been repeated. After this, the redundant version can be updated. This process can then be repeated once more to complete a total of TB. A repetition, such as Figure 8 As shown. Figure 8 The slot-level resource mapping for a PUSCH codeword with 8 repetitions and 2 RUs is shown. In this entry, redundant version cycles may not be modified, e.g., [0 2 0 2 02 ...].

[0073] If the resource mapping pattern is / represents / indicates repeated transmission of one or more time slots, then the mapping can be performed for the first count with the same redundancy version (RV) when certain conditions are met, until the second count is reached. These conditions may include: the number of repetitions of the same time slot is less than the length of the OCC sequence (e.g., ...). In some embodiments, after the second number is reached, the mapping can be performed a third time, until the number of PUSCH repetitions is reached. For each subsequent execution of the mapping (e.g., each third number), a different RV can be used. For example, if... If the complete codeword has been repeated... After this, the redundant version may not be updated, and then the process can be repeated. Then, the redundant version can be updated, and the process can be repeated to complete a total of TB. A repetition, such as Figure 9 As shown. Figure 9 The slot-level resource mapping for a PUSCH codeword with 8 repetitions and 2 RUs is shown. In this entry, the redundant version cycle can be modified, for example, [0 0 2 2 0 0 ...]. The same mechanism can be used for both monotones and polytones.

[0074] Scenario 3: In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmission of one or more time slots, the mapping can be performed multiple times with the same redundancy version (RV) when a condition is met, until a first number of repetitions of the same time slot is reached. This condition may include: the number of repetitions of the same time slot is equal to the length of the OCC sequence. In some embodiments, the number of repetitions of the same time slot is determined to be equal to the length of the OCC sequence when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling. A different RV can be used for each subsequent execution of the mapping (e.g., each first number). In some embodiments, the mapping performed implies a time slot / symbol-level mapping corresponding to the resource mapping pattern. For example, the number of repetitions of the same time slot for PUSCH can be defined. (For example, 4), which can be equal to the length of the OCC or the number of multiplexed UEs (for example, when configuring the length of the OCC sequence, it is determined). This time slot can be repeated until... The time slot is repeated until the first time slot is repeated, then the next time slot is repeated, until the complete codeword has been repeated. This process can be repeated until [the process is repeated]. Repeat until the last one is reached. The mapping defined in Case 2 of Implementation Example 1 can be copied.

[0075] After being mapped to the first time slot (e.g., 1 time slot, 2 time slots, or nSlots), the time slot can be repeated before continuing to the next time slot mapping. One additional time. The complete codeword has been repeated. After this, the redundant version can be updated. This process can then be repeated once more to complete a total of TB. A repetition, such as Figure 8 As shown. In this case, the traditional redundant version loop may not be changed, for example, [0 20 2 0 2 ...]. The same mechanism can be used for single-tone and multi-tone (e.g., multiple carriers / frequency / bands).

[0076] Example 2 of implementation: Symbol-level resource mapping with PUSCH codeword enhancement

[0077] A wireless communication device (e.g., a user equipment (UE)) can determine one or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission. The wireless communication device can perform a resource mapping mode for PUSCH transmission based on the determined one or more configuration parameters. In some embodiments, the one or more configuration parameters can indicate at least one of the following: a resource mapping mode, wherein the resource mapping mode is at least one repeated transmission of: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots (e.g., nSlots, repeated); an application scheme of the orthogonal coverage code (OCC) for PUSCH transmission, wherein the OCC application scheme spans at least one of the following: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots; an index of the OCC sequence; the length of the OCC sequence; the number of repetitions (e.g., ...). ); the number of repetitions in the same time slot (e.g. The number of scheduled resource units (RUs); the number of consecutive subcarriers; the number of repetitions of the same symbol; or the number of repetitions of consecutive time slots (e.g., nSlots).

[0078] In some embodiments, the resource mapping pattern may be indicated via at least one of the following: higher-layer signaling; or downlink control information (DCI) signaling; or associating the resource mapping pattern of the PUSCH transmission with the application scheme of the OCC. The association may be: when the OCC application scheme spans one or more time slots, the resource mapping pattern is a repetition of one or more time slots; or when the OCC application scheme spans one or more symbols, the resource mapping pattern is / represents a repetition of one or more symbols. In some embodiments, a type of PUSCH may include, for example, a New Radio (NR) PUSCH, an Internet of Things (IoT) PUSCH, a Long Term Evolution (LTE) PUSCH, and an Enhanced Machine Type Communication (eMTC) PUSCH, or other UL channels carrying data or information in NR / LTE / eMTC / IoT / Ultra-Reliable Low Latency Communication (URLLC).

[0079] The mechanism in Implementation Example 1 defines a slot-level resource mapping; a similar mechanism can be used for symbol-level resource mapping. In this implementation example, a cell can be a symbol. The mapping to resource elements (k, l) corresponding to subcarriers allocated for transmission but not used for reference signal transmission can be performed in ascending order, first indexing k and then indexing l, starting from the first slot in the allocated resource cells.

[0080] Scenario 1: In some embodiments, if the resource mapping pattern represents the repeated transmission of one or more symbols, then the mapping can be performed for the first time when a condition is met, until the number of repetitions is reached. This condition may include: the number of identical symbols is greater than and / or equal to the length of the OCC sequence (e.g., ...). , or In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than or equal to the length of the OCC sequence. For each subsequent iteration of the mapping (e.g., each first iteration), a different redundant version (RV) can be used. For example, an existing version can be reused. Configuration. This unit can be a symbol. This symbol can be repeated until... The symbol is repeated until the first symbol is repeated, then the next symbol is repeated, until the complete codeword has been repeated. Repeat until the last one is reached. If or ,or Then, after being mapped to the first symbol (e.g., one symbol or two symbols), these symbols can be repeated. One additional time, of which

[0081] .

[0082] The first symbol has been repeated After that, the redundant version can be updated, and then the first symbol can continue to be repeated. The first symbol has been repeated. After this, the mapping process for the next time slot can be executed to complete all repetitions of the TB. In this entry, the traditional redundant version cycle may not be changed, for example, [0 2 0 2 0 2 ...].

[0083] In some embodiments, if the resource mapping pattern is / represents repeated transmission of one or more symbols, then the mapping can be performed for the first number of times with the same RV when a condition is met, until a second number is reached. This condition may include: the number of repetitions of the same symbol is less than the length of the OCC sequence (e.g., ...). For example, if If the first symbol has been repeated Subsequently, the redundant version may not be updated, so the first symbol may continue to be repeated. One additional time.

[0084] In some embodiments, if the resource mapping pattern is / represents repeated transmission of one or more symbols, the mapping can be performed a third time, until the repetition count is reached, when a condition is met. This condition may include: the second number is less than the repetition count (e.g., ...). For each subsequent iteration of the mapping (e.g., each second number), a different RV can be used. For example, if Then RV can be updated, and this process can be repeated. After the first symbol has been repeated... After this, the mapping process for the next symbol can be executed to complete the mapping / repetition of all symbols in the TB. In this entry, redundant version cycles can be modified, for example, [0 0 2 20 0 ...]. The same mechanism can be used for both monotones and polytones.

[0085] Scenario 2: In some embodiments, if the resource mapping pattern represents the repeated transmission of one or more symbols, then the mapping can be performed for the first time when a condition is met, until the number of repetitions is reached. This condition may include: the number of identical symbols is greater than and / or equal to the length of the OCC sequence (e.g., ...). , ,or In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than or equal to the length of the OCC sequence. For each subsequent iteration of the mapping (e.g., each first iteration), a different redundant version (RV) can be used. For example, an existing version can be reused. Configuration. This unit can be a symbol. This symbol can be repeated until... The symbol is repeated until the first symbol is repeated, then the next symbol is repeated, until the complete codeword has been repeated. This process can be repeated until the last repetition occurs. Repeat until the last one is reached. If or ,or Then, after being mapped to the first symbol (e.g., one or two symbols), the symbol can be repeated before continuing to the next symbol mapping. One additional time, of which

[0086]

[0087] The complete code has been repeated. After this, the redundant version is updated, and then the process is repeated once more to complete a total of TB. This entry is repeated. In this entry, the traditional redundant version cycle may not be changed, for example, [0 2 02 0 2 ...].

[0088] In some embodiments, if the resource mapping pattern is / represents repeated transmissions of one or more symbols, the mapping can be performed for the first count with the same redundancy version (RV) when a condition is met, until a second count is reached. This condition may include: the number of repetitions of the same symbol is less than the length of the OCC sequence. In some embodiments, after the second count is reached, the mapping can be performed for the third count, until the repetition count is reached. For each subsequent count of the mapping (e.g., each third count), a different RV can be used. For example, if... If the complete codeword has been repeated... After this, the redundant version may not be updated, and then the process can be repeated. Then, the redundant version can be updated, and the process can be repeated to complete a total of TB. Repeated. Within this entry, redundant versions of the cycle can be modified, for example, [0 0 2 2 0 0 ...]. The same mechanism can be used for both monotones and polytones.

[0089] Scenario 3: In some embodiments, if the resource mapping pattern is / represents repeated transmissions of one or more symbols, then when a condition is met, the mapping can be performed multiple times with the same redundancy version (RV) until the number of repetitions of the same symbol is reached. This condition may include: the number of repetitions of the same symbol (e.g., the number of repetitions of the same symbol). The number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the number of repetitions of the same symbol is determined to be equal to the length of the OCC sequence. A different RV can be used for each subsequent mapping (e.g., each first number). For example, the number of repetitions of the same symbol used for PUSCH can be defined. This can be equal to the length of the OCC or the number of UEs (e.g., determined when configuring the length of the OCC sequence). This symbol can be repeated until... The symbol is repeated until the first symbol is repeated, then the next symbol is repeated, until the complete codeword has been repeated. This process can be repeated until [the process is repeated]. Repeat until the last one is reached. The mapping defined in Case 2 of Implementation Example 2 can be copied.

[0090] After being mapped to the first symbol (e.g., 1 symbol, 2 symbols), the symbol can be repeated before proceeding to the next time slot mapping. One additional time. The complete codeword has been repeated. After this, the redundant version can be updated. This process can then be repeated once more to complete a total of TB. This is a repetition. Within this entry, the traditional redundant version cycle may be modified, for example, [0 2 0 2 0 2 ...]. The same mechanism can be used for both monotones and polytones.

[0091] Example 3 of implementation: Repetition (e.g., consecutive time slots) level resource mapping for PUSCH codeword enhancement

[0092] A wireless communication device (e.g., a user equipment (UE)) can determine one or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission. The wireless communication device can perform a resource mapping mode for PUSCH transmission based on the determined one or more configuration parameters. In some embodiments, the one or more configuration parameters can indicate at least one of the following: a resource mapping mode, wherein the resource mapping mode is at least one repetition of: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots (e.g., nSlots); an application scheme of the orthogonal coverage code (OCC) for PUSCH transmission, wherein the OCC application scheme spans at least one of: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots; an index of the OCC sequence; the length of the OCC sequence; and the number of repetitions (e.g., ...). ); the number of repetitions in the same time slot (e.g. The number of scheduled resource units (RUs); the number of consecutive subcarriers; the number of repetitions of the same symbol; or the number of repetitions of consecutive time slots (e.g., nSlots).

[0093] In some embodiments, the resource mapping pattern may be indicated via at least one of the following: higher-layer signaling; or downlink control information (DCI) signaling; or associating the resource mapping pattern of the PUSCH transmission with the application scheme of the OCC. The association may be: when the OCC application scheme spans one or more time slots, the resource mapping pattern is a repetition of one or more time slots; or when the OCC application scheme spans one or more symbols, the resource mapping pattern is a repetition of one or more symbols. In some embodiments, a type of PUSCH may include, for example, a New Radio (NR) PUSCH, an Internet of Things (IoT) PUSCH, a Long Term Evolution (LTE) PUSCH, and an Enhanced Machine Type Communication (eMTC) PUSCH, or other UL channels carrying data or information in NR / LTE / eMTC / IoT / Ultra-Reliable Low Latency Communication (URLLC).

[0094] Repetitions for single and multiple tones may include / occupy at least two time slots. Redundant versions between two adjacent OCCs may differ, therefore OCCs cannot be used directly. The mechanisms in Implementation Examples 1 and 2 define time slot-level and symbol-level resource mappings; a similar mechanism can be used again for repetition (e.g., consecutive time slots)-level resource mappings. Mapping to resource elements (k, l) corresponding to subcarriers allocated for transmission but not used for reference signal transmission can be performed in ascending order, first indexing k, then indexing l, starting from the first time slot in the allocated resource element.

[0095] Scenario 1: In some embodiments, if the resource mapping pattern is a repeated transmission of one or more consecutive time slots, then the mapping can be performed for the first time in multiple sets of time slots, until the repetition count is reached, provided that a certain condition is met. This condition may include: the same number of repetitions in consecutive time slots (…). The condition is greater than and / or equal to the length of the OCC sequence. In some embodiments, the condition may be that the same number of repetitions is greater than the length of the OCC sequence. In some embodiments, the condition may be that the same number of repetitions is equal to the length of the OCC sequence. In some embodiments, the condition may be that the same number of repetitions is greater than or equal to the length of the OCC sequence. For each subsequent iteration of the mapping (e.g., each first iteration), a different redundant version (RV) can be used. For example, an existing version can be reused. Configuration. This unit can be a repeating unit (e.g., two time slots or more). N slots Each time slot can be repeated until... The repetition continues until N is repeated, then the next N is repeated. slots Each time slot, until the complete codeword has been repeated. This process can be repeated until [the process is repeated]. Repeat until the last one is reached. If or or Then, when mapped to N slots After one time slot, these time slots can be repeated before continuing with the next time slot mapping. One additional time, of which

[0096]

[0097]

[0098] The complete code has been repeated. After this, the redundant version can be updated. This process can then be repeated once to complete a total of TB. A repetition, such as Figure 10 As shown. Figure 10The repetition-level resource mapping for a PUSCH codeword with multiple tones, 16 repetitions, and 1 RU is shown. In this entry, the RV cycle is not modified.

[0099] In some embodiments, if the resource mapping pattern is repeated transmission of consecutive time slots, the mapping can be performed a first number of times in multiple sets of time slots with the same redundancy version (RV) when a condition is met, until a second number is reached. This condition may include: the number of identical repetitions of consecutive time slots is less than the length of the OCC sequence. In some embodiments, after the second number is reached, the mapping can be performed a third number of times in multiple sets of time slots until the repetition count is reached. For each subsequent number of times the mapping is performed (e.g., each third number), a different RV can be used. For example, if If the complete codeword has been repeated... After this, the redundant version may not be updated, and then the process can be repeated. The redundant version can then be updated, and the process can be repeated to complete a total of TB. A repetition, such as Figure 11 As shown. Figure 11 The repetition-level resource mapping for a PUSCH codeword with multiple tones, 16 repetitions, and 1 RU is shown. In this entry, the redundant version cycle can be modified, for example, [0 0 2 2 0 0 ...]. The same mechanism can be used for both single and multiple tones.

[0100] Scenario 2: In some embodiments, if the resource mapping pattern represents repeated transmission of consecutive time slots, then the mapping can be performed for the first number of times in multiple sets of time slots until the number of repetitions is reached, provided a condition is met. This condition may include: the same number of repetitions in consecutive time slots is greater than and / or equal to the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions greater than the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions equal to the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions greater than or equal to the length of the OCC sequence. For each subsequent time the mapping is performed (e.g., each first number), a different redundancy version (RV) can be used. For example, existing redundancy versions can be reused. Configuration. This unit can be a repeating unit (e.g., two time slots or more). The N slots Each time slot can be repeated until... The repetition continues until N is repeated, then the next N is repeated. slots Each time slot, until the complete codeword has been repeated. This process can be repeated until [the process is repeated]. Repeat until the last one is reached. If or or Then, when mapped to N slotsAfter one time slot, this time slot shall be repeated before proceeding to the next time slot mapping additional times, where

[0101]

[0102]

[0103] After a complete codeword has been repeated times, the redundancy version may be updated. The process may then be repeated once to complete a total of repetitions of the TB. The RV loop may not be changed.

[0104] In some embodiments, if the resource mapping pattern is / indicates repeated transmission of consecutive time slots, when a condition is satisfied, the mapping may be performed a first number of times in multiple sets of time slots with the same redundancy version (RV) until the length of the OCC sequence is reached. The condition may include that the same number of repetitions of consecutive time slots is less than the length of the OCC sequence. After the length of the OCC sequence is reached, the mapping may be performed a second number of times in multiple sets of time slots until the number of repetitions is reached. For each subsequent time the mapping is performed (e.g., each of the second number of times), a different RV may be used. For example, if (e.g., 1) < occLength (e.g., 4), then after the complete codeword has been repeated times, the redundancy version may not be updated, and then the process may be repeated and / or until the same repetition meets the OCC length and the number of multiplexed UEs. Then, the redundancy version may be updated, and the process may be repeated to complete a total of repetitions of the TB for a single tone, as Figure 12 shown in the figure. Figure 12 shows a repetition-level resource mapping for a PUSCH codeword with a single tone, 8 repetitions, and 1 RU. In this entry, the redundancy version loop may be changed to a single tone, for example [0 0 0 0 2 2 2 2 ...]. The same mechanism may be used for single-tone and multi-tone.

[0105] Scenario 3: In some embodiments, if the resource mapping mode is / represents repeated transmission of consecutive time slots, then when a condition is met, the mapping can be performed for the first time in multiple sets of time slots with the same redundancy version until the length of the OCC sequence is reached. This condition may include: the same number of repetitions of consecutive time slots equals the length of the OCC sequence. In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the number of repetitions of consecutive time slots is determined to be equal to the length of the OCC sequence. In some embodiments, after the length of the OCC sequence is reached, the mapping can be performed for the second time in multiple sets of time slots until the number of repetitions is reached. For each subsequent time of mapping (e.g., each second time), a different redundancy version (RV) can be used. In some embodiments, the mapping performed means a consecutive time slot-level mapping corresponding to the resource mapping mode. In some embodiments, the repetition of transport blocks includes one or more repetitions of one or more different consecutive time slots. For example, the same number of repetitions for PUSCH can be defined. This can be equal to the length of the OCC or the number of multiplexed UEs (e.g., determined when configuring the length of the OCC sequence). N slots Each time slot can be repeated until... The repetition continues until N is repeated, then the next N is repeated. slots Each time slot, until the complete codeword has been repeated. This process can be repeated until it is reached / completed. Repeat until the last one is reached. The mapping defined in Case 1 of Implementation Example 3 can be copied.

[0106] Mapped to N slots After one time slot, the time slot should be repeated before continuing with the next time slot mapping. One additional time, of which

[0107]

[0108] The complete code has been repeated. After this, the redundant version can be updated. This process can then be repeated once more to complete a total of TB. Repeat. The same mechanism can be used for both monotones and polytones.

[0109] In the above implementation examples, OCC can be applied across time slots / symbols / repeated applications defined in Implementation Examples 1, Implementation Examples 2, and Implementation Examples 3. Multiple resource mapping schemes can be defined in the above implementation examples; a specific scheme can be configured by the network through higher-layer signaling or DCI signaling. For example, parameter 1 corresponds to case 1 in Implementation Example 1, and parameter 2 corresponds to case 2 in Implementation Example 2.

[0110] In some embodiments, a specific mapping scheme can be associated with OCC parameters. For example, OCC scheme 1 corresponds to case 2 in embodiment example 1, OCC scheme 2 corresponds to case 2 in embodiment example 2, and OCC scheme 3 corresponds to case 1 in embodiment example 3. When an OCC scheme is not configured, conventional resource mapping can be used in the background. For example, OCC sequence length 1 corresponds to case 2 in embodiment example 1, and OCC sequence length 2 corresponds to case 2 in embodiment example 2. When the OCC sequence length is not configured, resource mapping can be used in the background. In other words, which resource mapping scenario is used can be determined by one or more parameters associated with the OCC mechanism.

[0111] It should be understood that one or more features in the above / below implementation examples are not unique to a particular implementation example, but can be combined in any way (e.g., in any priority and / or order, simultaneously or otherwise).

[0112] Figure 13 A flowchart of method 1300 for resource / repetition mapping enhancement is shown. Method 1300 can be used in conjunction with this document. Figure 1-12 This can be implemented using any one or more components and devices described in detail. Generally, in some embodiments, method 1300 can be performed by a UE. Depending on the embodiment, additional, fewer, or different operations may be performed in method 1300. At least one aspect of the operation relates to a system, method, apparatus, or computer-readable medium.

[0113] A wireless communication device (e.g., a user equipment (UE)) can determine one or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission. The wireless communication device can perform a resource mapping mode for PUSCH transmission based on the determined one or more configuration parameters. In some embodiments, the one or more configuration parameters can indicate at least one of the following: a resource mapping mode, wherein the resource mapping mode is at least one repeated transmission of: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots (e.g., nSlots, repeated); an application scheme of the orthogonal coverage code (OCC) for PUSCH transmission, wherein the OCC application scheme spans at least one of the following: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots; an index of the OCC sequence; the length of the OCC sequence; the number of repetitions (e.g., ...). ); the number of repetitions in the same time slot (e.g. The number of scheduled resource units (RUs); the number of consecutive subcarriers; the number of repetitions of the same symbol; or the number of repetitions of consecutive time slots (e.g., nSlots).

[0114] In some embodiments, the resource mapping pattern may be indicated via at least one of the following: higher-layer signaling; or downlink control information (DCI) signaling; or associating the resource mapping pattern of the PUSCH transmission with the application scheme of the OCC. The association may be: when the application scheme of the OCC spans one or more time slots, the resource mapping pattern is a repetition of one or more time slots; or when the application scheme of the OCC spans one or more symbols, the resource mapping pattern is a repetition of one or more symbols.

[0115] In some embodiments, a type of PUSCH may include, for example, a New Radio (NR) PUSCH, an Internet of Things (IoT) PUSCH (e.g., a narrowband PUSCH), a Long Term Evolution (LTE) PUSCH, an Enhanced Machine Type Communication (eMTC) PUSCH, or other UL channels carrying data or information in NR / LTE / eMTC / IoT / Ultra-Reliable Low Latency Communication (URLLC). In some embodiments, if the resource mapping pattern is a repetition of one or more time slots, the mapping may be performed for the first time when a condition is met, until the repetition number is reached. This condition may include: the number of repetitions of the same time slot is greater than and / or equal to the length of the OCC sequence (e.g., , or In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repetition of one or more time slots, the mapping is performed with the same redundancy version (RV) for the first number when the condition is met, until the second number is reached. This condition may include: the number of repetitions of the same time slot is less than the length of the OCC sequence (e.g., In some embodiments, if the resource mapping pattern is a repeated transmission of one or more time slots, the mapping can be performed a third time, until the number of repetitions is reached, when a condition is met. This condition may include: the second time is less than the number of repetitions (e.g., ...). For each subsequent execution of the mapping (e.g., each second number), a different RV can be used. In some embodiments, if the resource mapping pattern is a repeated transmission of one or more time slots, the mapping can be executed for the first number of times, until the number of repetitions is reached, when a condition is met. This condition may include: the number of repetitions of the same time slot is greater than and / or equal to the length of the OCC sequence (e.g., , or In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same time slot is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repetition of one or more time slots, the mapping may be performed with the same redundancy version (RV) for the first number of times when the condition is met, until the second number of times is reached. This condition may include: the number of repetitions of the same time slot is less than the length of the OCC sequence (e.g., in bits / elements) (e.g., In some embodiments, after the second number is reached, the mapping can be performed a third time, until the number of repetitions is reached. For each subsequent execution of the mapping (e.g., each third number), a different RV can be used.

[0116] In some embodiments, if the resource mapping pattern is a repeated transmission of one or more time slots, the mapping can be performed for the first number of times with the same redundancy version (RV) when a condition is met, until the number of repetitions of the same time slot is reached. This condition may include: the number of repetitions of the same time slot is equal to the length of the OCC sequence (e.g., in bits / elements). In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the number of repetitions of the same time slot is determined to be equal to the length of the OCC sequence. For each subsequent number of times the mapping is performed (e.g., each first number), a different RV can be used. In some embodiments, the mapping performed implies a time slot / symbol-level mapping corresponding to the resource mapping pattern.

[0117] In some embodiments, if the resource mapping pattern is a repeated transmission of one or more symbols, the mapping can be performed for the first time when a condition is met, until the repetition count is reached. This condition may include: the number of identical symbols is greater than and / or equal to the length of the OCC sequence (e.g., ...). , or In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repetition of one or more symbols, the mapping may be performed with the same RV for the first number when the condition is met, until the second number is reached. This condition may include: the number of the same symbol is less than the length of the OCC sequence (e.g., ).

[0118] In some embodiments, if the resource mapping pattern is a repeated transfer of one or more symbols, the mapping can be performed a third time, until the repetition count is reached, provided a condition is met. This condition may include: the second number is less than the repetition count (e.g., ...). For each subsequent execution of the mapping (e.g., each second number), a different RV can be used. In some embodiments, if the resource mapping pattern is a repeated transfer of one or more symbols, the mapping can be executed for the first number of times, until the number of repetitions is reached, when a condition is met. This condition may include: the number of identical symbols is greater than and / or equal to the length of the OCC sequence (e.g., ...). , ,or In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, the condition may be that the number of repetitions of the same symbol is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first count), a different redundancy version (RV) may be used. In some embodiments, if the resource mapping pattern is a repeated transmission of one or more symbols, the mapping may be performed for the first count with the same redundancy version (RV) when the condition is met, until the second count is reached. This condition may include: the number of the same symbol is less than the length of the OCC sequence. In some embodiments, after the second count is reached, the mapping may be performed for the third count, until the repetition count is reached. For each subsequent execution of the mapping (e.g., each third count), a different RV may be used.

[0119] In some embodiments, if the resource mapping pattern is / represents / indicates the repeated transmission of one or more symbols, the mapping can be performed for the first number of times with the same redundancy version (RV) when a condition is met, until the number of repetitions of the same symbol is reached. This condition may include: the number of repetitions of the same symbol is equal to the length of the OCC sequence. In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the number of repetitions of the same symbol is determined to be equal to the length of the OCC sequence. For each subsequent number of times the mapping is performed (e.g., each first number), a different RV can be used.

[0120] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmission of consecutive time slots (e.g., nSlots, time slots in an nRU, two or more time slots), then the mapping can be performed for the first number of times in multiple sets of time slots until the number of repetitions is reached, when a condition is met. This condition may include: the number of repetitions of consecutive time slots is greater than and / or equal to the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions greater than the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions equal to the length of the OCC sequence. In some embodiments, the condition may be the same number of repetitions greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first number), a different redundancy version (RV) may be used.

[0121] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmission of consecutive time slots, then the mapping can be performed a first count in multiple sets of time slots with the same redundancy version (RV) until a second count is reached, provided a condition is met. This condition may include: the number of repetitions of consecutive time slots is less than the length of the OCC sequence. In some embodiments, after the second count is reached, the mapping can be performed a third count in multiple sets of time slots until the repetition count is reached. For each subsequent count of the mapping (e.g., each third count), a different RV can be used.

[0122] In some embodiments, the number of repetitions of consecutive time slots can be determined by at least one of the following: when the number of resource units is 1, the number is 1; or when the number of resource units is greater than 1, the number is the minimum between a first factor and 4, where the first factor is the number of repetitions divided by 2 and rounded. In some embodiments, if the resource mapping pattern is repeated transmission of consecutive time slots, the mapping can be performed for the first count in multiple sets of time slots until the number of repetitions is reached, when a condition is met. This condition can include: the number of repetitions of consecutive time slots is greater than and / or equal to the length of the OCC sequence. In some embodiments, the condition can be that the number of repetitions of consecutive time slots is greater than the length of the OCC sequence. In some embodiments, the condition can be that the number of repetitions of consecutive time slots is equal to the length of the OCC sequence. In some embodiments, the condition can be that the number of repetitions of consecutive time slots is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping (e.g., each first count), a different redundancy version (RV) can be used.

[0123] In some embodiments, if the resource mapping pattern is / represents / indicates repeated transmissions of consecutive time slots, then the mapping can be performed a first count in multiple sets of time slots with the same redundancy version (RV) until the length of the OCC sequence is reached, provided a condition is met. This condition may include: the number of identical repetitions of consecutive time slots is less than the length of the OCC sequence. After the length of the OCC sequence is reached, the mapping can be performed a second count in multiple sets of time slots until the repetition count is reached. For each subsequent count of the mapping (e.g., each second count), a different RV can be used.

[0124] In some embodiments, if the resource mapping mode is / represents / indicates repeated transmission of consecutive time slots, then when a condition is met, the mapping can be performed for the first time in multiple sets of time slots with the same redundancy version until the length of the OCC sequence is reached. This condition may include: the same number of repetitions of consecutive time slots equals the length of the OCC sequence. In some embodiments, when the length of the OCC sequence is configured via higher-layer signaling or DCI signaling, the same number of repetitions of consecutive time slots is determined to be equal to the length of the OCC sequence. In some embodiments, after the length of the OCC sequence is reached, the mapping can be performed for the second time in multiple sets of time slots until the repetition number is reached. For each subsequent time of mapping (e.g., the second time), a different redundancy version (RV) can be used. In some embodiments, the mapping performed means a consecutive time slot-level mapping corresponding to the resource mapping mode. In some embodiments, the repetition of transport blocks includes one or more repetitions of one or more different consecutive time slots.

[0125] In some embodiments, a wireless communication node (e.g., a base station (BS)) may send one or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission to a wireless communication device (e.g., a user equipment (UE)). The wireless communication device may execute a resource mapping mode for PUSCH transmission based on one or more configuration parameters.

[0126] While various embodiments of the present solution have been described above, it should be understood that they are presented by way of example only and not by way of limitation. Similarly, various figures may depict exemplary architectures or configurations provided to enable those skilled in the art to understand exemplary features and functionality of the present solution. However, those skilled in the art will understand that the present solution is not limited to the exemplary architectures or configurations shown, but can be implemented using various alternative architectures and configurations. Furthermore, as will be understood by those skilled in the art, one or more features of one embodiment may be combined with one or more features of another embodiment described herein. Therefore, the breadth and scope of this disclosure should not be limited to any of the illustrative embodiments described above.

[0127] It should also be understood that any reference to elements in this document using names such as “first,” “second,” etc., generally does not limit the number or order of those elements. Rather, these names may be used herein as a convenient means of distinguishing two or more elements or instances of elements. Therefore, a reference to the first and second elements does not imply that only two elements may be used, or that the first element must somehow precede the second element.

[0128] Furthermore, those skilled in the art will understand that information and signals can be represented using any of a variety of different techniques and skills. For example, data, instructions, commands, information, signals, bits, and symbols referenced in the above description can be represented by voltage, current, electromagnetic waves, magnetic fields or particles, light fields or particles, or any combination thereof.

[0129] Those skilled in the art will further understand that any of the various illustrative logic blocks, modules, processors, devices, circuits, methods, and functions described in conjunction with the aspects disclosed herein can be implemented by electronic hardware (e.g., digital implementation, analog implementation, or a combination of both), firmware, various forms of program or design code containing instructions (which may be referred to herein as "software" or "software module"), or any combination of these technologies. To clearly illustrate this interchangeability of hardware, firmware, and software, various illustrative components, blocks, modules, circuits, and steps have been described above in general terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software, or a combination of these technologies, depends on the specific application and design constraints imposed on the system as a whole. Those skilled in the art can implement the described functionality in various ways for each specific application, but such implementation decisions will not depart from the scope of this disclosure.

[0130] Furthermore, those skilled in the art will understand that the various illustrative logic blocks, modules, devices, components, and circuits described herein may be implemented within or executed by an integrated circuit (IC), which may include a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices or any combination thereof. Logic blocks, modules, and circuits may also include antennas and / or transceivers for communicating with various components within a network or device. A general-purpose processor may be a microprocessor, but alternatively, the processor may be any conventional processor, controller, or state machine. The processor may also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, multiple microprocessors, a combination of one or more microprocessors with a DSP core, or any other suitable configuration for performing the functions described herein.

[0131] If implemented as software, the functionality can be stored as one or more instructions or code on a computer-readable medium. Therefore, the steps of the methods or algorithms disclosed herein can be implemented as software stored on a computer-readable medium. A computer-readable medium includes both computer storage media and communication media, including any medium capable of enabling the transfer of a computer program or code from one place to another. A storage medium can be any available medium accessible to a computer. By way of example and not limitation, such a computer-readable medium can include RAM, ROM, EEPROM, CD-ROM or other optical disc storage devices, disk storage devices or other magnetic storage devices, or any other medium that can be used to store desired program code in the form of instructions or data structures and is accessible to a computer.

[0132] In this document, as used herein, the term "module" refers to software, firmware, hardware, and any combination of these elements used to perform the associated functions described herein. Furthermore, for the purposes of discussion, various modules are described as discrete modules; however, it will be apparent to those skilled in the art that two or more modules can be combined to form a single module that performs the associated functions according to embodiments of this solution.

[0133] Additionally, memory or other storage devices and communication components may be employed in embodiments of this solution. It should be understood that, for clarity, embodiments of this solution have been described above with reference to different functional units and processors. However, it will be apparent that any suitable functional distribution among different functional units, processing logic elements, or domains may be used without diminishing the effectiveness of this solution. For example, a function illustrated as being performed by a separate processing logic element or controller may be performed by the same processing logic element or controller. Therefore, references to specific functional units are merely references to suitable means of providing the described functionality and do not indicate a strict logical or physical structure or organization.

[0134] Various modifications to the embodiments described in this disclosure will be apparent to those skilled in the art, and the general principles defined herein can be applied to other embodiments without departing from the scope of this disclosure. Therefore, this disclosure is not intended to be limited to the embodiments shown herein, but is accorded the widest scope consistent with the novel features and principles disclosed herein, as described in the claims.

Claims

1. A method comprising: One or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission are determined by the wireless communication device; as well as The resource mapping mode for the PUSCH transmission is executed by the wireless communication device based on one or more determined configuration parameters.

2. The method according to claim 1, wherein, The one or more configuration parameters indicate at least one of the following: The resource mapping mode is at least one repeated transmission of one of the following: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots; The application scheme of the orthogonal coverage code (OCC) for PUSCH transmission, wherein the application scheme of the OCC spans at least one of the following: one or more time slots, or one or more symbols, or one or more consecutive subcarriers, or consecutive time slots; Index of OCC sequence; Length of the OCC sequence; Number of repetitions; The number of repetitions in the same time slot; The number of scheduled resource units (RUs); The number of consecutive subcarriers; The number of repetitions of the same symbol; or The same number of repetitions in consecutive time slots.

3. The method according to claim 1, wherein, The resource mapping mode is indicated by at least one of the following: High-level signaling; or Downlink Control Information (DCI) signaling; or Associating the resource mapping mode of the PUSCH transmission with the application scheme of the OCC, wherein the association is: When the application scheme of the OCC spans one or more time slots, the resource mapping mode is the repeated transmission of the one or more time slots; or When the application scheme of the OCC spans one or more symbols, the resource mapping mode is the repeated transmission of the one or more symbols.

4. The method according to claim 2 or 3, wherein, If the resource mapping pattern is a repeated transmission of the one or more time slots, then when a condition is met, the mapping is performed multiple times with the same redundancy version (RV) until the number of repetitions of the same time slot is reached, wherein the condition includes: The number of repetitions of the same time slot is equal to the length of the OCC sequence. For each subsequent execution of the mapping, a different RV is used.

5. The method according to claim 2 or 3, wherein, If the resource mapping pattern is a repeated transmission of one or more symbols, then the mapping is executed for the first time when a condition is met, until the number of repetitions is reached, wherein the condition includes: The number of identical symbols is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping, a different redundant version (RV) is used.

6. The method according to claim 5, wherein, If the resource mapping pattern is a repeated transmission of one or more symbols, then when a condition is met, the mapping is performed for the first number of times with the same RV until a second number of times is reached, wherein the condition includes: The number of identical symbols is less than the length of the OCC sequence.

7. The method according to claim 6, wherein, If the resource mapping pattern is a repeated transmission of one or more symbols, then the mapping is executed a third time when a condition is met, until the number of repetitions is reached, wherein the condition includes: The second number is less than the number of repetitions. In this case, a different RV is used for each subsequent execution of the mapping.

8. The method according to claim 2 or 3, wherein, If the resource mapping pattern is a repeated transmission of one or more symbols, then the mapping is executed for the first time when a condition is met, until the number of repetitions is reached, wherein the condition includes: The number of identical symbols is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping, a different redundant version (RV) is used.

9. The method according to claim 8, wherein, If the resource mapping pattern is a repeated transmission of one or more symbols, then when a condition is met, the mapping is performed for the first number of times with the same redundancy version (RV) until the second number of times is reached, wherein the condition includes: The number of identical symbols is less than the length of the OCC sequence.

10. The method according to claim 9, wherein, After the second number of repetitions is reached, the mapping is performed a third time, until the number of repetitions is reached. In this case, a different RV is used for each subsequent execution of the mapping.

11. The method according to claim 2 or 3, wherein, If the resource mapping pattern is a repeated transmission of one or more symbols, then, when certain conditions are met, the mapping is performed multiple times with the same redundant version (RV) until the number of repetitions of the same symbol is reached, wherein the conditions include: The number of repetitions of the same symbol is equal to the length of the OCC sequence. In this case, a different RV is used for each subsequent execution of the mapping.

12. The method according to claim 2 or 3, wherein, If the resource mapping pattern is a repeated transmission of one or more consecutive time slots, then when a condition is met, the mapping is performed for the first time in multiple sets of time slots until the number of repetitions is reached, wherein the condition includes: The number of identical repetitions in the consecutive time slots is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping, a different redundant version (RV) is used.

13. The method according to claim 12, wherein, If the resource mapping pattern is a repeated transmission of the consecutive time slots, then when a condition is met, the mapping is performed for the first number of times in multiple sets of time slots with the same redundancy version (RV) until the second number of times is reached, wherein the condition includes: The number of identical repetitions in the consecutive time slots is less than the length of the OCC sequence.

14. The method according to claim 13, wherein, After the second number of repetitions is reached, the mapping is performed a third time in multiple time slots until the number of repetitions is reached. In this case, a different RV is used for each subsequent execution of the mapping.

15. The method according to claim 2 or 3, wherein, The number of identical repetitions in the consecutive time slots is determined by at least one of the following: When the number of resource units is 1, the number is 1; or When the number of resource units is greater than 1, the number is the minimum value between a first factor and 4, wherein the first factor is the number of repetitions divided by 2 and rounded.

16. The method according to claim 15, wherein, If the resource mapping pattern is a repeated transmission of consecutive time slots, then when a condition is met, the mapping is performed for the first time in multiple sets of time slots until the number of repetitions is reached, wherein the condition includes: The number of identical repetitions in the consecutive time slots is greater than or equal to the length of the OCC sequence. For each subsequent execution of the mapping, a different redundant version (RV) is used.

17. The method according to claim 16, wherein, If the resource mapping pattern is a repeated transmission of the consecutive time slots, then when a condition is met, the mapping is performed for the first time in multiple sets of time slots with the same redundancy version (RV) until the length of the OCC sequence is reached, wherein the condition includes: The number of identical repetitions in the consecutive time slots is less than the length of the OCC sequence; and After the length of the OCC sequence is reached, the mapping is performed a second time in multiple time slots until the repetition count is reached. In this case, a different RV is used for each subsequent execution of the mapping.

18. The method according to claim 2 or 3, wherein, If the resource mapping pattern is a repeated transmission of consecutive time slots, then when a condition is met, the mapping is performed for the first time in multiple sets of time slots with the same redundant version, until the length of the OCC sequence is reached, wherein the condition includes: The number of identical repetitions in the consecutive time slots is equal to the length of the OCC sequence.

19. The method according to claim 18, wherein, After the length of the OCC sequence is reached, the mapping is performed a second time in multiple time slots until the repetition count is reached. For each subsequent execution of the mapping, a different redundant version (RV) is used.

20. A method comprising: One or more configuration parameters for Physical Uplink Shared Channel (PUSCH) transmission are sent from the wireless communication node to the wireless communication device. The wireless communication device executes the resource mapping mode of the PUSCH transmission based on the one or more configuration parameters.

21. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform the method according to any one of claims 1-20.

22. An apparatus comprising: At least one processor is configured to perform the method according to any one of claims 1-20.

Images