Data transmission method and communication device
By repeatedly transmitting each part of the transport block according to the OCC sequence length in the terminal device or network device, the problem of low decoding performance at the receiver under OCC orthogonality is solved, and faster transport block reception and higher decoding performance are achieved.
Patent Information
- Application Number
- CN202510113727.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-01-22
- Publication Date
- 2026-07-24
Smart Images

Figure CN122457433A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of communications, and more particularly to a data transmission method and a communication device. Background Technology
[0002] To improve network capacity, Release-19 (R-19) of the mobile communication standard introduced orthogonal cover codes (OCCs) to enable multiple users (or multiple terminals) to multiplex the physical uplink shared channel (PUSCH), thereby increasing network capacity. However, in some scenarios, the orthogonality of OCCs may be difficult to maintain.
[0003] Currently known methods for maintaining the orthogonality of OCC may result in longer delays in receiving transport blocks at the receiver, affecting decoding performance. Therefore, there is an urgent need to provide a method to improve the decoding performance of the receiver while maintaining the orthogonality of OCC. Summary of the Invention
[0004] This application provides a data transmission method and a communication device, applicable to the field of communication. It can improve the decoding performance of the receiving end while maintaining the orthogonality of OCC (Optical Character Classification).
[0005] Firstly, a data transmission method is provided, including:
[0006] N·K time units are determined, where N and K are integers greater than 1; within these N·K time units, multiple repetitions of the first transmission block are transmitted, wherein the first transmission block comprises N parts, the N·K time units comprise consecutive N·L time units, the N·L time units carry L repetitions of each of the N parts, the L repetitions are carried in consecutive time units, and the L repetitions are respectively covered by different symbols in the first codeword, the first codeword contains L symbols, where K is greater than or equal to L.
[0007] In one possible implementation, the method can be executed by the terminal device or by a chip in the terminal device.
[0008] The data transmission method of this application involves the terminal device repeatedly transmitting each of the N parts of a transmission block according to the length L of the OCC sequence. That is, each part of the first transmission block is repeatedly transmitted L times over L consecutive time units. For example, assuming the length of the OCC sequence is 4, each part of the transmission block can be repeated 4 times over 4 consecutive time units. This reduces the latency for the receiving end to receive a complete transmission block while ensuring OCC orthogonality, thus improving the decoding performance of the base station.
[0009] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes:
[0010] Receive at least one of the following information: first information indicating that the number of repetitions of the first transport block is K; second information indicating the number of time units N for transmitting the first transport block once; and third information indicating the first codeword.
[0011] Optionally, the first codeword can specifically be OCC.
[0012] In one possible implementation, the third information further includes first indication information, which indicates the length (denoted as L) of the OCC sequence. The terminal device can use different symbols in the OCC sequence to cover L repetitions of one of the N parts in the first transport block.
[0013] In conjunction with the first aspect, in some implementations of the first aspect, the N·K time units comprise M time unit groups, where M satisfies This means that the result of K divided by L is rounded down, and each of the M time unit groups includes the N·L time units.
[0014] In this way, the terminal device can send different parts of the first transmission block in each of the M time unit groups, and each part is repeatedly sent according to the length L of the OCC sequence. In this way, the network device can receive a complete first transmission block every time it receives the content of a time unit group (i.e., every N·L time units), which helps to reduce the reception latency of the first transmission block.
[0015] In conjunction with the first aspect, in some implementations of the first aspect, if K is not an integer multiple of L, the N·K time units also include P consecutive time units, which include L repetitions of Q parts from the N parts, where P and Q are positive integers, and Q = P / L, and P satisfies:
[0016] or,
[0017] Here, mod represents the modulo operation. This means that the result of N·K divided by L is rounded down.
[0018] In conjunction with the first aspect, in some implementations of the first aspect, the Q parts are Q consecutive parts among the N parts.
[0019] In conjunction with the first aspect, in some implementations of the first aspect, the N·K time units further include R consecutive time units, which consist of R repetitions of one of the N parts, where R is a positive integer and satisfies:
[0020] R = N·K mod L, or,
[0021] Optionally, the specific arrangement of M time unit groups, P consecutive time units, and R consecutive time units can include, but is not limited to, the following methods 1 and 2.
[0022] Method 1: The P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the last R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0023] Optionally, in this implementation, the redundant version of a portion carried by each of the N·K time units is the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit in the N·K time units is the s-th RV in the RV sequence, the length of the RV sequence being S, where s satisfies:
[0024]
[0025] Optionally, the RV sequence can be predefined by the protocol, or it can be configured by the network device for the terminal device through signaling; this application does not impose any restrictions on this.
[0026] According to the above scheme, the terminal device can receive a complete first transmission block once after receiving the content of N·L time units in the M time unit group. This can reduce the latency of the network device to receive a complete first transmission block while maintaining the orthogonality of OCC, and improve the decoding performance of the receiving end.
[0027] Method 2: The P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0028] Optionally, in this implementation, the redundant version of a portion carried by each of the N·K time units is the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit in the N·K time units is the s-th RV in the RV sequence, the length of the RV sequence is S, where n, s, and S are positive integers, and s satisfies:
[0029]
[0030] w=(n-(N·K mod L)+N·K) mod (N·K).
[0031] Optionally, in the specific implementation process, whether the sending end (such as the terminal device) uses mode 1 or mode 2 to send the first transmission block can be predefined by the protocol, or it can be configured by the network for the terminal device through signaling. This application does not impose any restrictions on this.
[0032] In conjunction with the first aspect, in some implementations of the first aspect, the P time units are located in the Before the time unit group, the Q parts are the last Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the NQth part of the N parts.
[0033] Optionally, a portion carried by each of the N·K time units can use the same redundant version (RV).
[0034] According to the above scheme, the network device can resolve the first transmission block once after receiving the first N·L time units, which helps to reduce the latency of the base station receiving a complete first transmission block.
[0035] Secondly, another data transmission method is provided, comprising: determining N·K time units, where N and K are integers greater than 1; receiving multiple repetitions of a first transmission block within the N·K time units, wherein the first transmission block comprises N parts, the N·K time units comprise consecutive N·L time units, the N·L time units carry L repetitions of each of the N parts, the L repetitions are carried in consecutive time units, and the L repetitions are respectively covered by different symbols in a first codeword, the first codeword containing L symbols, where K is greater than or equal to L.
[0036] In one possible implementation, the method can be executed by a network device or by a chip within the network device.
[0037] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: sending at least one of the following information: first information indicating that the number of repetitions of the first transport block is K; second information indicating the number of time units N for transmitting the first transport block once; and third information indicating the first codeword.
[0038] In conjunction with the second aspect, in some implementations of the second aspect, the N·K time units comprise M time unit groups, where M satisfies This means that the result of K divided by L is rounded down, and each of the M time unit groups includes the N·L time units.
[0039] In conjunction with the second aspect, in some implementations of the second aspect, if K is not an integer multiple of L, the N·K time units also include P consecutive time units, which include L repetitions of Q parts from the N parts, where P and Q are positive integers, and Q = P / L, and P satisfies:
[0040] or,
[0041] Here, mod represents the modulo operation. This means that the result of N·K divided by L is rounded down.
[0042] In conjunction with the second aspect, in some implementations of the second aspect, the Q parts are Q consecutive parts among the N parts.
[0043] In conjunction with the second aspect, in some implementations of the second aspect, the N·K time units further include R consecutive time units, which consist of R repetitions of one of the N parts, where R is a positive integer and satisfies:
[0044] R = N·K mod L, or,
[0045] In conjunction with the second aspect, in some implementations of the second aspect, the P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the last R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0046] In conjunction with the second aspect, in some implementations of the second aspect, the redundant version of a portion carried by each of the N·K time units is the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit in the N·K time units is the s-th RV in the RV sequence, the length of the RV sequence being S, where s satisfies:
[0047]
[0048] In conjunction with the second aspect, in some implementations of the second aspect, the P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0049] In conjunction with the second aspect, in some implementations of the second aspect, the redundant version of a portion carried by each of the N·K time units is the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit in the N·K time units is the s-th RV in the RV sequence, the length of which is S, where n, s, and S are positive integers, and s satisfies:
[0050]
[0051] w=(n-(N·K mod L)+N·K) mod (N·K).
[0052] In conjunction with the second aspect, in some implementations of the second aspect, the P time units are located in the Before the time unit group, the Q parts are the last Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the NQth part of the N parts.
[0053] Thirdly, a communication apparatus is provided for performing the method in any of the possible implementations of the first and second aspects described above. Specifically, the apparatus includes a module for performing the method in any of the possible implementations of the first and second aspects described above.
[0054] Fourthly, embodiments of this application provide yet another communication device, including a processor coupled to a memory, which can be used to execute instructions in the memory to implement the method in any of the possible implementations of the first or second aspect described above. Optionally, the device further includes a memory. Optionally, the device further includes a communication interface, to which the processor is coupled.
[0055] In one implementation, the device is a terminal device. When the device is a terminal device, the aforementioned communication interface can be a transceiver, or an input / output interface.
[0056] In another implementation, the device is a chip integrated into the terminal device. When the device is a chip integrated into the terminal device, the aforementioned communication interface can be an input / output interface.
[0057] Fifthly, a processor is provided, comprising: an input circuit, an output circuit, and a processing circuit. The processing circuit is used to receive signals through the input circuit and transmit signals through the output circuit, causing the processor to execute the method in any possible implementation of the first or second aspect described above.
[0058] In the specific implementation process, the processor can be a chip, the input circuit can be an input pin, the output circuit can be an output pin, and the processing circuit can be a transistor, gate circuit, flip-flop, and various logic circuits. The input signal received by the input circuit can be received and input by, for example, but not limited to, a receiver, and the signal output by the output circuit can be output to, for example, but not limited to, a transmitter and transmitted by the transmitter. Furthermore, the input circuit and the output circuit can be the same circuit, which is used as the input circuit and the output circuit at different times. This application does not limit the specific implementation of the processor and various circuits.
[0059] A sixth aspect provides a processing apparatus including a processor and a memory. The processor is configured to read instructions stored in the memory and to receive signals via a receiver and transmit signals via a transmitter to execute the method in any of the possible implementations of the first or second aspect described above.
[0060] Optionally, there may be one or more processors and one or more memories.
[0061] Alternatively, the memory can be integrated with the processor, or the memory can be set up separately from the processor.
[0062] In the specific implementation process, the memory can be a non-transitory memory, such as a read-only memory (ROM), which can be integrated on the same chip as the processor or set on different chips. The embodiments of this application do not limit the type of memory or the way the memory and processor are set.
[0063] It should be understood that the relevant data interaction process, such as sending instruction information, can be a process of outputting instruction information from the processor, and receiving capability information can be a process of the processor receiving input capability information. Specifically, the processed output data can be output to the transmitter, and the input data received by the processor can come from the receiver. Here, the transmitter and receiver can be collectively referred to as transceivers.
[0064] The processing device in the sixth aspect above can be a chip. The processor can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc. When implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. The memory can be integrated into the processor or located outside the processor and exist independently.
[0065] In a seventh aspect, a computer program product is provided, comprising: a computer program (also referred to as code or instructions) that, when executed, causes a computer to perform the method in any possible implementation of the first or second aspect described above.
[0066] Eighthly, a computer-readable storage medium is provided that stores a computer program (also referred to as code or instructions) that, when executed on a computer, causes the computer to perform the methods in any of the possible implementations of the first or second aspect described above.
[0067] It should be understood that the second to eighth aspects of this application correspond to the technical solutions of the first aspect of this application, and the beneficial effects achieved by each aspect and the corresponding feasible implementation are similar, and will not be repeated here. Attached Figure Description
[0068] Figure 1 This is a schematic diagram of a communication system used in an embodiment of this application;
[0069] Figure 2 A schematic diagram illustrating an application of OCC provided in an embodiment of this application;
[0070] Figure 3 A schematic diagram of the first type of PUSCH transmission with 4 repetitions per TB using 4-slot TBoMS is shown.
[0071] Figure 4 A schematic diagram of the second type of PUSCH transmission with 4 repetitions per TB using 4-slot TBoMS is shown.
[0072] Figure 5 A flowchart illustrating the data transmission method provided in an embodiment of this application;
[0073] Figure 6 A schematic diagram illustrating the arrangement of N parts of a first transmission block according to an embodiment of this application;
[0074] Figure 7 A schematic diagram of a redundant version used for a portion of the time unit carried by each time unit provided in the embodiments of this application;
[0075] Figure 8 A schematic diagram of a redundant version used for a portion of each time unit carried by an embodiment of this application;
[0076] Figure 9 A schematic diagram illustrating the second arrangement of the N parts of the first transmission block provided in an embodiment of this application;
[0077] Figure 10 A schematic diagram illustrating the third arrangement of the N parts of the first transmission block provided in the embodiments of this application;
[0078] Figure 11 A schematic diagram illustrating the fourth arrangement of the N parts of the first transmission block provided in the embodiments of this application;
[0079] Figure 12 A schematic diagram of the code elements used in a portion of the time unit carried by each time unit provided in the embodiments of this application;
[0080] Figure 13 A schematic diagram of the code elements used in a portion of each time unit as provided in an embodiment of this application;
[0081] Figure 14 This is a schematic block diagram of a communication device provided in an embodiment of this application. Detailed Implementation
[0082] To facilitate understanding of the embodiments of this application, the following points will be explained first:
[0083] In the embodiments of this application, "instruction" may include direct instruction, indirect instruction, explicit instruction, and implicit instruction. When describing a certain instruction information for indicating A, it can be understood that the instruction information carries A, directly indicates A, or indirectly indicates A.
[0084] In this embodiment of the application, " / " can indicate that the objects before and after are in an "or" relationship. For example, A / B can mean A or B. "And / or" can be used to describe three relationships between the related objects. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. A and B can be singular or plural.
[0085] In the embodiments of this application, "at least one" means one or more, and "more than one" means two or more, such as three, four or more. Similar expressions (such as at least one, at least one, etc.) are analogous. "At least one of the following," "one or more of the following," or similar expressions refer to any combination of these items, which may include only a single item or a combination of multiple items. For example, at least one of a, b, or c can represent: a, or b, or c; a and b; or a and c; or b and c; or a, b, and c. Where a, b, and c can be single or multiple.
[0086] In this embodiment of the application, for the convenience of describing the technical solution of the embodiment of the application, the terms "first" and "second" may be used for distinction. The terms "first" and "second" do not limit the quantity or execution order, and the terms "first" and "second" are not necessarily different.
[0087] In this application, the words "exemplary," "example," or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary," "example," or "for example" should not be construed as being more preferred or advantageous than other embodiments or designs. The use of words such as "exemplary," "example," or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.
[0088] In this embodiment, "sending information / data" only indicates the direction of information / data transmission, including direct transmission via the device's communication interface (such as an air interface). "Sending" can also be understood as the "output" of the module interface. "Sending" can include indirect transmission by the processing unit through the communication interface, that is, after the processing unit outputs information / data through the module interface, it is transmitted to the device's communication interface and then sent out. "Receiving information / data" only indicates the direction of information / data transmission, including direct reception via the communication interface. "Receiving" can also be understood as the "input" of the module interface. "Receiving information / data" can include indirect reception by the processing unit through the communication interface, that is, after the communication interface receives information / data, it is transmitted to the module interface of the processing unit and then input to the processing unit. "Sending information / data to... (such as a terminal)" can be understood as the destination of the information being the terminal. It can include sending information / data directly or indirectly to the terminal. "Receiving information / data from... (such as a terminal)" can be understood as the source of the information being the terminal, and can include receiving information / data directly or indirectly from the terminal. Information / data may undergo necessary processing, such as format changes, between the source and destination, but the destination can understand the valid information / data from the source. Similar statements in this application can be understood in a similar way, and will not be repeated here.
[0089] The technical solutions of this application can be applied to various communication systems, such as Long Term Evolution (LTE) systems, 5th Generation (5G) communication systems, satellite communication systems, Wireless Fidelity (WiFi) systems, and the solutions provided in this application can also be applied to future communication systems or other communication systems. This application does not limit these applications.
[0090] The terminal equipment in this application embodiment can also be referred to as: user equipment (UE), mobile station (MS), mobile terminal (MT), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user device, etc.
[0091] Terminal devices can be devices that provide voice / data connectivity to users, such as handheld devices with wireless connectivity, in-vehicle devices, etc. Currently, examples of terminal devices include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving vehicles, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in 5G networks, or future public land mobile communication networks. This application does not limit the scope to terminal devices in a network (PLMN), etc.
[0092] The network equipment involved in this application can be a device that communicates with terminal devices. This network equipment can also be called an access network device or a wireless access network device. It can be a transmission reception point (TRP), an evolved NodeB (eNB or eNodeB) in an LTE system, a home base station (e.g., home evolved NodeB or home Node B, HNB), a base band unit (BBU), or a radio controller in a cloud radio access network (CRAN) scenario. Alternatively, the network equipment can be a relay station, access point, vehicle-mounted equipment, wearable devices, or network equipment in a 5G network or a network equipment in a future evolved PLMN network. It can also be an access point (AP) in a WLAN, or a gNB in an NR system. The above-mentioned network equipment can also be a city base station, micro base station, pico base station, femtobase station, etc. This application does not limit this.
[0093] In a network architecture, network devices may include centralized unit (CU) nodes, distributed unit (DU) nodes, RAN devices including CU nodes and DU nodes, or RAN devices including control plane CU nodes (CU-CP nodes), user plane CU nodes (CU-UP nodes), and DU nodes.
[0094] Network equipment provides services to cells. Terminal devices communicate with cells through transmission resources (e.g., frequency domain resources, or spectrum resources) allocated by the network equipment. The cell can belong to a macro base station (e.g., macro eNB or macro gNB) or to a base station corresponding to a small cell. Small cells can include: metrocell, microcell, pico cell, femto cell, etc. These small cells have the characteristics of small coverage area and low transmission power, and are suitable for providing high-speed data transmission services.
[0095] To facilitate understanding of the embodiments of this application, firstly, in conjunction with Figure 1 The communication system applicable to the embodiments of this application will be described in detail.
[0096] Figure 1 An embodiment of the present application is illustrated, representing a communication system 100. The communication system 100 may include at least one network device, such as... Figure 1The network device 110 shown; the communication system 100 may also include at least one terminal device, such as Figure 1 The terminal device 120 shown. The network device 110 and the terminal device 120 can communicate via a wireless link.
[0097] Figure 1 An exemplary network device 110 and a terminal device 120 are shown. Optionally, the communication system 100 may also include multiple network devices and / or multiple terminal devices.
[0098] The aforementioned communication devices, such as Figure 1 The network device 110 or terminal device 120 can be configured with multiple antennas. These multiple antennas may include at least one transmitting antenna for transmitting signals and at least one receiving antenna for receiving signals. Additionally, each communication device also includes a transmitter chain and a receiver chain, which, as will be understood by those skilled in the art, may include multiple components (e.g., processors, modulators, multiplexers, demodulators, demultiplexers, or antennas) related to signal transmission and reception. Therefore, network device 110 and terminal device 120 can communicate via multi-antenna technology.
[0099] Optionally, the communication system 100 may also include other network entities such as a network controller and a mobility management entity, but the embodiments of this application are not limited thereto.
[0100] It should be understood that Figure 1 The communication system 100 shown is merely an example. This application does not limit the specific architecture of the applicable system, nor does it limit the number and form of various devices contained in each communication system.
[0101] It should also be understood that in one possible implementation, network device 110 can act as a transmitter and terminal device 120 can act as a receiver, with network device 110 sending signals to terminal device 120; in another possible implementation, network device 110 can act as a receiver and terminal device 120 can act as a transmitter, with terminal device 120 sending signals to network device 110.
[0102] To better understand the methods provided in the embodiments of this application, the terms involved in this application will be briefly explained below.
[0103] 1. Non-terrestrial network (NTN)
[0104] Because traditional terrestrial networks cannot provide seamless coverage, especially in areas where base stations cannot be deployed, such as the ocean, deserts, and the air, non-terrestrial satellite communication networks (or NTNs) are considered an important aspect of future wireless communication technology development. Satellite communication refers to communication using satellites as relays by terrestrial radio communication equipment. A satellite communication system consists of a satellite component and a terrestrial component. The characteristics of satellite communication are: large communication range; communication between any two points within the coverage area of the satellite's emitted radio waves; and low susceptibility to land-based disasters (high reliability). As a supplement to current terrestrial cellular communication systems, satellite communication offers the following advantages:
[0105] Extended coverage: For areas that cannot be covered by current cellular communication systems or where the cost of coverage is too high, such as oceans, deserts, and remote mountainous areas, satellite communication can be used to solve the communication problem.
[0106] Emergency communications: In extreme situations such as disasters like earthquakes that render cellular communication infrastructure unavailable, satellite communications can be used to quickly establish communication connections.
[0107] Provides industry applications: For example, for latency-sensitive services that require long-distance transmission, satellite communication can be used to reduce the latency of service transmission.
[0108] In an NTN system, different terminal devices may operate in environments with varying signal-to-noise ratios (SNR). For terminal devices operating in low SNR environments, repetition transmission can be used to maintain an effective communication link between the terminal device and the network. This involves the sender repeatedly transmitting the same data to the receiver. While this improves the reliability of data transmission between the network and the terminal device, it consumes significant network resources.
[0109] For example, suppose a terminal device in a low SNR environment needs to perform 32 repeated transmissions. Since each repeated transmission requires additional time and frequency resources, this terminal device actually consumes the resources equivalent to 32 terminal devices in a high SNR environment transmitting the same amount of data. That is, a low SNR user requiring 32 repeated transmissions will use 32 times more network resources than a high SNR user, resulting in a significant decrease in network capacity in the low SNR environment.
[0110] To address the aforementioned issues and improve network capacity in low SNR environments, the 19th version (R-19) of the mobile communication standard introduced orthogonal cover codes (OCC) to enable multiple users (or multiple terminal devices) to multiplex the physical uplink shared channel (PUSCH), thereby improving the overall throughput of the system.
[0111] 2. Orthogonal cover codes (OCC)
[0112] OCC is an encoding method that can be used to distinguish different users. An orthogonal overlay code group (OCC group) can include multiple OCC sequences, which are orthogonal to each other. For example, taking an OCC sequence length (hereinafter referred to as OCC length) of 2 (i.e., the OCC sequence includes 2 code elements) as an example, an OCC group can include 2 OCC sequences, namely [1, 1] and [1, -1], which are orthogonal to each other.
[0113] When multiple terminal devices need to transmit data simultaneously, each terminal device can process its data (or signal) using an OCC sequence from an OCC group. Different terminal devices use different OCC sequences. Correspondingly, the receiving end can separate the original data from each terminal device based on the orthogonality of the multiple OCC sequences within these OCC groups. This allows multiple terminal devices to transmit data on the same time-frequency resource without causing mutual interference.
[0114] Optionally, OCC is applicable to scenarios using PUSCH repetition type A. PUSCH repetition type A refers to repeatedly transmitting the same PUSCH slot multiple times. The following explains the process of using OCC in a PUSCH repetition type A scenario.
[0115] In the PUSCH repetition type A scenario, in order to maintain the orthogonality between different OCC sequences in the OCC group, the content covered by each symbol in the OCC sequence is the same in the time slot covered by the OCC group. Figure 2 A schematic diagram of an OCC provided for this application. (For example...) Figure 2As shown, terminal device 1 and terminal device 2 repeatedly transmit PUSCH on the same time-frequency resources in time slots 1 and 2 using code division (or code division multiple access, CDMA). Terminal device 1 transmits content X1, and terminal device 2 transmits content X2. For ease of description, the data in the first repeated transmission of terminal device 1 is denoted as X1 repetition 1, which is carried in time slot 1. The data in the second repeated transmission of terminal device 1 is denoted as X1 repetition 2, which is carried in time slot 2. Similarly, the data in the first repeated transmission of terminal device 2 is denoted as X2 repetition 1, which is carried in time slot 1. The data in the second repeated transmission of terminal device 2 is denoted as X2 repetition 2, which is carried in time slot 2.
[0116] Assume that the OCC length allocated to terminal device 1 and terminal device 2 is 2, and the OCC sequence used by terminal device 1 is [1, 1], while the OCC sequence used by terminal device 2 is [1, -1]. Then, for terminal device 1, the first symbol (i.e., 1) in the OCC sequence [1, 1] is used to overwrite the data in the first repeated transmission of terminal device 1. Specifically, the overwriting method could be to multiply the data in the first repeated transmission by the first symbol. Similarly, the second symbol (i.e., 1) in the OCC sequence [1, 1] is used to overwrite the data in the second repeated transmission of terminal device 1. For terminal device 2, the first symbol (i.e., 1) in the OCC sequence [1, -1] is used to overwrite the data in the first repeated transmission of terminal device 2, and the second symbol (i.e., -1) in the OCC sequence [1, -1] is used to overwrite the data in the second repeated transmission of terminal device 2.
[0117] That is, for each terminal device, the content covered by the first symbol (denoted as w0) and the second symbol (denoted as w1) in the OCC sequence is the same, that is, each symbol in [w0, w1] covers the same content.
[0118] It should also be noted that different redundancy versions (RVs) will result in different transmitted data content. Therefore, to maintain orthogonality, the content covered by each symbol must be consistent. Within the time slots covered by an OCC group, the redundancy version used by the terminal device should also be consistent. For example... Figure 2 In the text, for slots 1 and 2 covered by the OCC group, the redundant version used is RV0, which will not be elaborated on further below.
[0119] 3. Transport block processing over multiple slots (TBoMS)
[0120] TBoMS is a technique that uses multiple slots to transmit a single transport block (TB). Due to the increased number of physical resource blocks (PRBs), TBoMS can use lower modulation and coding schemes compared to a single slot, thus increasing uplink coverage. It should also be understood that in a single TBoMS transmission, the content carried by multiple slots uses redundant versions of the same data. For example, four slots can be used to transmit one TB. For simplicity, the following text refers to transmitting one TB with four slots as 4-slot TBoMS.
[0121] TBoMS can be combined with repeated transmissions. For example, based on transmitting one TB in 4 slots, the entire transmission process can be repeated multiple times (e.g., 4 times). That is, a PUSCH transmission with 4 repetitions using 4-slot TBoMS.
[0122] However, if OCC is to be applied on top of the combination of TBoMS and PUSCH Repetition Type A, the entire TB needs to use the same symbol. Furthermore, because the orthogonality requirement of OCC dictates that each symbol should cover the same content, this could lead to an excessively long time-domain length covered by an OCC group. If the time-domain length is too long (e.g., exceeding four time slots), orthogonality may decrease due to frequency shifts, making it difficult to maintain OCC orthogonality and affecting decoding performance.
[0123] For example, Figure 3 This illustrates a TB using a 4-slot TBoMS PUSCH transfer with a repetition count of 4. For example... Figure 3 As shown, a TB is transmitted through four time slots, which are designated as Part 1, Part 2, Part 3, and Part 4 of a 4-slot TBoMS. These four parts are carried over four consecutive time slots, and the symbol used by each part is w0. Based on this, the entire sequence of four parts is repeated four times (including the first repetition, for a total of four times). In the second repetition, the symbol used by the four parts is w1; in the third repetition, the symbol used is w0; and in the fourth repetition, the symbol used is w1. From this… Figure 3 It can be seen that two symbols [w0, w1] in an OCC group each cover 4 time slots, and these two symbols cover a total of 8 time slots. Therefore, it can be considered that... Figure 3 If the time domain length covered by the OCC group is too long, the orthogonality of the OCC is not easily maintained.
[0124] To address the above issue, each part of TBoMS can be repeated the number of times corresponding to PUSCH repetition type A. That is, starting from the first part of TBoMS, repeat it K times, and then repeat each part of TBoMS K times in turn until all parts of TBoMS have been repeated. Here, K is the number of repetitions corresponding to PUSCH repetition type A. The following section will combine... Figure 4 The process is illustrated by taking the transmission of one TB using 4 time slots, with K being 4 and OCC length being 2 as an example.
[0125] like Figure 4 As shown, the first part of TB is first transmitted four times, with the content of each transmission carried on one time slot. Since the content of each transmission is the same, one OCC group can cover two time slots. Furthermore, the second, third, and fourth parts of TB are transmitted four times in sequence, and during the four transmissions of each part, the OCC group covers two time slots, thus maintaining OCC orthogonality.
[0126] However, during the transmission of a TB, the receiving end can only decode the TB after receiving the complete TB. For example, if a TB is transmitted using four time slots, decoding can only begin when the receiving end receives the fourth part of the TB, resulting in excessively long delays for the receiving end to receive the complete TB. Figure 4 As shown, transmitting a TB occupies a total of 16 time slots (4×4=16). The last part of the TB is transmitted for the first time in the 13th time slot. However, obtaining the last part requires obtaining the content covered by the complete OCC sequence. Therefore, the receiver can only attempt to decode the TB at the earliest after receiving the content in the 14th time slot. This concentrates the time for the receiver to decode the TB in the later part of the PUSCH transmission, resulting in a longer delay for the receiver to receive the complete TB.
[0127] To address the aforementioned issues, this application provides a data transmission method. During the multiple repetitions of a transmission block sent by a terminal device to a base station, each of the N parts of the transmission block is repeatedly transmitted according to the length L of the OCC sequence. That is, each part is repeatedly transmitted L times over L consecutive time units. For example, assuming the OCC sequence length is 4, each part of the transmission block can be repeated 4 times over 4 consecutive time units. This reduces the latency for the receiving end to receive a complete transmission block while maintaining OCC orthogonality.
[0128] The following is combined Figures 5 to 11 This application provides a detailed description of the data transmission method. The embodiments shown in this application illustrate the data transmission method provided by this application from the perspective of device interaction. The specific forms and numbers of the devices shown are merely examples and should not constitute any limitation on the implementation of the method provided in this application. Below, taking a terminal device as the sending end and a base station as the receiving end as an example, the data transmission method of the embodiments of this application will be described in detail. Figure 5 As shown, the data transmission method includes, but is not limited to, the following S501 and S502.
[0129] S501, the terminal device determines N·K time units, where N and K are integers greater than 1.
[0130] S502, the terminal device sends multiple repetitions of the first transmission block to the base station within N·K time units. The first transmission block comprises N parts, and the N·K time units comprise consecutive N·L time units. Each N·L time unit carries L repetitions of each of the N parts. These L repetitions are carried within consecutive time units, and each L repetition is covered by different symbols from a first codeword. The first codeword contains L symbols, where K is greater than or equal to L.
[0131] Optionally, the time unit can be, for example, a slot, meaning the terminal device uses TBoMS to allocate multiple slots for transmission within one TB. For ease of understanding, the data transmission method of this application is described below using a slot as an example. However, it should be understood that this application is not limited to this; the time unit can also be in other forms, such as orthogonal frequency division multiplexing (OFDM) symbols, OFDM symbol groups, subframes, or frames. The specific time unit can be adjusted or replaced according to actual needs, and this application does not impose any restrictions on this.
[0132] Assuming the terminal device uses N-slot TBoMS to transmit the first transport block, meaning the terminal device uses N time slots for transmitting the first transport block, then each of the N parts comprising the first transport block is carried in one time slot. Optionally, the terminal device can divide the first transport block into N equal parts, each part having the same amount of data, or the terminal device can divide the first transport block into N parts according to a predefined length; this application does not impose specific limitations on this.
[0133] The specific value of N (i.e., how many time slots the terminal device uses to transmit the first transmission block) can be predefined by the protocol, or it can be configured by the base station for the terminal device through signaling. This application does not impose any restrictions on this. For example, the base station can send the second information to the terminal device through downlink control information (DCI), that is, the second information is included in the DCI or the second information can be the DCI. This application does not impose any restrictions on this.
[0134] For example, the base station can send second information to the terminal device, which indicates the number N of time units in the first transmission block. Accordingly, after receiving the second information from the base station, the terminal device can determine, based on the second information, to transmit the first transmission block once using N time slots.
[0135] For example, if the base station indicates to the terminal device via second information (such as DCI) that the number of time units N for transmitting the first transmission block once is 4, then after receiving the second information from the base station, the terminal device can use 4 time slots to transmit the first transmission block once.
[0136] Optionally, the base station may also send first information to the terminal device, which indicates that the number of repetitions of the first transport block is K. Accordingly, after receiving the first information from the base station, the terminal device can determine, based on the first information, that it will retransmit the first transport block K times. Optionally, the specific value of K may be predefined by the protocol and pre-configured by the base station for the terminal device via signaling, or it may be determined by the terminal device based on its capabilities; this application does not limit this. For example, the base station may send the first information to the terminal device via downlink control information (DCI), i.e., the first information may be included in the DCI or the first information may be the DCI; this application does not limit this.
[0137] The number of candidate repetitions predefined by the protocol (for ease of distinction, the number of repetitions predefined by the protocol is referred to as the number of candidate repetitions here, but this is not a limitation made in this application) can be 1, 2, 3, 4, 7, 8, 12, 16, etc. For example, the base station can select the number of repetitions K as 4 from these candidate repetitions and indicate the number of repetitions K as 4 to the terminal device through the first information. After the terminal device receives the first information from the base station, the terminal device performs 4 repetitions of the first transmission block, thereby improving the reliability of data transmission between the terminal device and the base station.
[0138] Optionally, the base station may also send third information to the terminal device, which indicates the first codeword. Accordingly, after receiving the third information from the base station, the terminal device may apply the first codeword indicated by the third information to the transmission of the first transport block. Specifically, the first codeword may be orthogonal cover codes (OCC).
[0139] The base station can indicate the OCC sequence used by the first transport block to the terminal device through third information. For example, the OCC sequence can be [w0, w1], where w0 is the first symbol in the OCC sequence, w1 is the second symbol in the OCC sequence, and the length L of the OCC sequence is 2. Alternatively, the OCC sequence can also be [w0, w1, w3, w4], and the length L of the OCC sequence is 4.
[0140] Optionally, the base station may also send the third information to the terminal device via radio resource control (RRC) messages. Alternatively, the DCI may send the third information to the terminal device; the third information may be included in the DCI or the third information may be the DCI itself, and this application does not impose any restrictions on this.
[0141] Optionally, the base station may also send a fifth piece of information to the terminal device, which is used to indicate the length of the first codeword.
[0142] In one example, the first codeword is OCC. The fifth information can indicate the length L of the OCC sequence, where L can be, but is not limited to, 2, 4, or 8. The third information can indicate one of the multiple candidate OCC sequences of length L. The third information can include a sequence identifier. Based on the fifth and third information, the terminal can determine the OCC sequence corresponding to the sequence identifier as the first codeword from among the multiple candidate OCC sequences of length L.
[0143] The base station can send the fifth piece of information to the terminal via an RRC message, and send the third piece of information to the terminal via a DCI message, or both the fifth and third pieces of information can be carried in an RRC message or both can be carried in a DCI message. It should be understood that at least two of the first, second, third, or fifth pieces of information can be sent through the same information (such as the same RRC message or the same DCI message), or they can be sent separately, and this application does not impose any restrictions on this.
[0144] Furthermore, after the terminal device determines the number of time units N for transmitting the first transmission block once and the number of repetitions K of the first transmission block, the terminal device can determine the total time resources occupied by the first transmission block in the entire transmission process, that is, the total number of time units that the first transmission block can use in all repeated transmissions is N·K time units. For example, assuming that the terminal device uses 4 time slots to transmit the first transmission block once (i.e., N=4), and the terminal device repeats the first transmission block 4 times (i.e., K=4), then N·K=4×4=16, that is, the first transmission block can use a total of 16 time slots in 4 repeated transmissions.
[0145] Furthermore, the terminal device can send multiple repetitions of the first transmission block to the base station within these N·K time units.
[0146] Specifically, the N·K time units comprise N·L consecutive time units, each of which carries L repetitions of each of the N parts, with the L repetitions carried within consecutive time units.
[0147] In other words, the terminal device transmits the first transmission block L times in the N·L time units. Specifically, for each of the N parts of the first transmission block, it is transmitted repeatedly according to the length L of the OCC sequence. That is, each part is transmitted repeatedly L times in a continuous L time unit, and the L repetitions are covered by an OCC sequence.
[0148] For example, the terminal device sequentially transmits L repetitions of the first part of the first transport block, L repetitions of the second part, and so on, up to L repetitions of the Nth part, over N time units. Furthermore, for each L repetition of a part, different symbols from the first codeword are used for overwriting. For instance, if the first codeword is OCC, L symbols from the OCC sequence are used sequentially to overwrite the L repetitions. For example, the first repetition uses the first symbol from the OCC sequence, the second repetition uses the second symbol from the OCC sequence, and so on, up to the Lth repetition using the Lth symbol from the OCC sequence.
[0149] The number of repetitions K of the first transport block and the length L of the first codeword (such as OCC) may vary, resulting in different numbers of N·L time units within the N·K time units. For ease of description, the N·L time units will be referred to as a time unit group below.
[0150] Optionally, the N·K time units include M time unit groups, where M satisfies This means that the result of K divided by L is rounded down, and each of the M time unit groups includes N·L time units. For example, if K=4 and L=4, then... N·K time units comprise one time unit group. Or, if K=4 and L=2, then... N·K time units comprise 2 time unit groups. Alternatively, if K=7 and L=4, then... N·K time units comprise one time unit group.
[0151] Furthermore, when the N·K time units include a single time unit group, that corresponding time unit group transmits the first transmission block L times according to the above process. When the N·K time units include multiple consecutive time unit groups, each of these multiple consecutive time unit groups transmits the first transmission block L times according to the above process. For ease of understanding, the following will be combined with… Figure 6 Taking the first transmission block being repeated 4 times (i.e., K=4), the terminal device transmitting the first transmission block once in 4 time slots (i.e., N=4), and the first codeword being OCC and the third information indicating that the OCC sequence includes 2 code elements (i.e., L=2) as an example, the implementation method of how the terminal device transmits multiple repetitions of the first transmission block in N·K time units will be explained.
[0152] like Figure 6 As shown, each square represents a time unit, and different squares represent time units carrying the first, second, third, or fourth part of the first transmission block, respectively. Figure 6 There are 16 squares in total, which means that the total number of time units that the first transmission block can use in the 4 repeated transmissions is 16 (N·K=4×4=16).
[0153] It can be understood that the N·K time units include two time unit groups (K / L = 2). For the first 8 time units of the 16 time units (that is, for the first time unit group of the N·K time units), the terminal device sequentially transmits two repetitions of the first part, two repetitions of the second part, two repetitions of the third part, and two repetitions of the fourth part in these 8 time units, and each part is covered by different symbols in the OCC sequence.
[0154] For example, assuming the OCC sequence is [w0, w1], the first repetition of the first part is covered by w0, and the second repetition of the first part is covered by w1. That is, the time domain length covered by this OCC sequence is two time units (or two time slots). Similarly, the first repetition of each part is covered by w0, and the second repetition is covered by w1. For simplicity, examples are not provided here. Furthermore, the specific covering methods can be found in the description above, and will not be repeated here.
[0155] Furthermore, for the last 8 time units of the 16 time units (that is, for the second time unit group in the N·K time units), the same method is used to repeatedly transmit each part of the first transmission block according to the OCC length (i.e., L), and each part is covered by different symbols in the OCC sequence for L repetitions. For the sake of simplicity, it will not be elaborated here.
[0156] It is understandable that, compared to sending the N parts of the first transmission block in N consecutive time units, for example... Figure 3 The two symbols of one OCC group shown cover a total of 8 time slots (or time units). Figure 6 In an OCC group, the two symbols cover a total of two time units, meaning that the time domain covered by the OCC group is relatively short, making it easier to maintain the orthogonality of the OCCs.
[0157] Furthermore, during the four repeated transmissions of the first transmission block, the terminal device sends the fourth part of the first transmission block in the 8th time unit, that is, the complete first transmission block is sent in the 8th time unit. Thus, when the base station receives the content of the 8th time unit, it receives a complete first transmission block. In other words, the base station can decode the first transmission block in the 8th time unit, which shortens the delay for the base station to receive the complete first transmission block.
[0158] Furthermore, during the repeated transmission of the first transport block, the redundant version (RV) used by each time unit must also be considered. Specifically, multiple parts of a single first transport block need to use the same RV, and since multiple symbols of an OCC should cover the same content, a part carried by multiple time units of an OCC sequence should also use the same RV. Specifically, the RV used by each time unit in N·K time units can include, but is not limited to, the following methods 1 and 2.
[0159] In Method 1, the redundant version of a portion carried by each of the N·K time units is the same.
[0160] For example, if a portion of each time unit carries an RV of 0, multiple portions of a first transmission block can use the same RV, and a portion of multiple time units using an OCC sequence can also use the same RV. Alternatively, a portion of all time units can use an RV of 3; this application does not impose any restrictions on this.
[0161] Optionally, the specific RV used for a portion carried by each time unit can be predefined by the protocol, or it can be configured by the base station for the terminal device through signaling. This application does not impose any restrictions on this.
[0162] Method 2: In the nth time unit of N·K time units, the redundant version RV used for one of the N parts is the s-th RV in the RV sequence, where the length of the RV sequence is S, and s satisfies:
[0163]
[0164] The RV sequence, also known as a cyclic sequence, can be, for example, 0, 2, 3, 1, with a length of 4. It should be noted that in this RV sequence, "0" represents the 0th RV, "2" represents the 1st RV, "3" represents the 2nd RV, and "1" represents the 3rd RV.
[0165] Alternatively, the RV sequence can be 0, 3, with a length of 2. In this RV sequence, "0" represents the 0th RV and "3" represents the 1st RV.
[0166] Optionally, the RV sequence used by the terminal device can be predefined by the protocol, or it can be configured by the base station for the terminal device through signaling. This application does not impose any restrictions on this.
[0167] n mod (N·L) can be understood as the nth time unit within its corresponding N·L time units, where n is the nth time unit. Figure 6 Taking N·K time units as an example, when n=3, that is, for the 3rd time unit, n mod(N·L)=3, meaning that the 3rd time unit is the 3rd time unit in its N·L time units. For another example, when n=13, that is, for the 13th time unit, n mod(N·L)=5, meaning that the 13th time unit is the 5th time unit in its N·L time units.
[0168] Furthermore, nn mod(N·L) can be understood as the number of time units that existed before the nth time unit (N·L time units). For example, when n = 3, nn mod(N·L) = 3 - 3 = 0, meaning the number of time units that existed before the 3rd time unit (N·L time units) is 0. As another example, when n = 13, nn mod(N·L) = 13 - 5 = 8, meaning the number of time units that existed before the 13th time unit (N·L time units) is 8.
[0169] Furthermore, This can be understood as the number of time unit groups that existed before the nth time unit, which is located N·L time units prior to it. For example, when n=3, That is, the number of time unit groups that existed before the N·L time units containing the third time unit is 0. For example, when n=13, That is, the number of time unit groups that existed before the N·L time units where the 13th time unit is located is 1.
[0170] Furthermore, assuming the RV sequence 0, 2, 3, 1 is used, then when n = 3, That is, the third time unit uses one of the N parts of the first transport block it carries, employing the redundant version of the RV sequence, specifically the 0th RV. In other words, the RV used is 0. For example, when n = 13, That is, the 13th time unit uses one of the N parts of the first transport block carried by the redundant version of the RV sequence, which is the first RV in the RV sequence, that is, the RV used is 2.
[0171] It should be understood that, depending on the RV sequence used, the same time unit group in N·K time units may also use different RVs. The following, in conjunction with Tables 1 and 2, further explains which RV is used when the terminal device uses different RV sequences.
[0172] RV in Table 1 id This is an identifier for the RV sequence. For example, RV... id When RV is 0, the corresponding RV sequence is 0, 2, 3, 1; id When the value is 2, the corresponding RV sequence is 2, 3, 1, 0; RV id When the value is 3, the corresponding RV sequence is 3, 1, 0, 2; RV id When the value is 1, the corresponding RV sequence is 1, 0, 2, 3.
[0173] Optionally, the base station may also send a fourth piece of information to the terminal device, which is used to indicate the RV adopted by the terminal device. idAccordingly, after receiving the fourth information from the base station, the terminal device can determine the RV indicated by the fourth information. id Determine which RV sequence to use. For example, the RV indicated by the fourth information. id If the value is 0, the terminal device can determine the value based on the RV. id The RV sequence used for 0 is 0, 2, 3, 1.
[0174] Optionally, the base station can send the fourth information to the terminal device through DCI, that is, the fourth information is included in DCI or the fourth information can be DCI. Also, at least one of the aforementioned first to fourth information and the fourth information can be sent through the same message or can be sent separately. This application does not limit this.
[0175] Specifically, the RV sequence shown in Table 1 is 0, 2, 3, 1, and the length of this RV sequence is 4, that is, S = 4. When At that time, a portion of the data carried by the nth time unit uses an RV of 0. At that time, a portion of the nth time unit uses an RV of 2. At that time, a portion of the nth time unit uses an RV of 3. At that time, the RV used for a portion carried by the nth time unit is 1.
[0176] For example, when Figure 6 When the N·K time units shown use the RV sequence 0, 2, 3, 1, the RV used by a portion of each of these N·K time units is as follows: Figure 7 As shown, in the first time unit group (the first 8 time units) of the N·K time units, the RV of one part carried by each time unit is 0, and the RV of one part carried by each time unit of the second time unit group (the last 8 time units) is 2.
[0177] Table 1
[0178]
[0179] For example, the RV sequence shown in Table 2 is 0, 3, and the length of this RV sequence is 2, that is, S = 2. When At that time, a portion of the data carried by the nth time unit uses an RV of 0. At that time, the RV used for a portion of the nth time unit is 3.
[0180] For example, when Figure 6When the N·K time units shown use RV sequences of 0 and 3, the RV used by a portion of each of these N·K time units is as follows: Figure 8 As shown, in the first time unit group (the first 8 time units) of the N·K time units, the RV used for a portion of each time unit is 0, and the RV used for a portion of each time unit in the second time unit group (the last 8 time units) is 3.
[0181] Table 2
[0182] <![CDATA[RV id ]]> ((n-(n mod NL)) / NL) mod 4 = 0 ((n-(n mod NL)) / NL) mod 4 = 1 0 0 3 3 3 0
[0183] It should be noted that in the above example, that is, when K=4 and L=2, K is an integer multiple of L, and N·K time units include M time unit groups. However, in practical applications, there may be cases where K is not an integer multiple of L, for example, when K=7 and L=4, K is not an integer multiple of L.
[0184] Optionally, if K is not an integer multiple of L, the N·K time units also include P consecutive time units, which include L repetitions of Q parts out of the N parts, where P and Q are positive integers and Q = P / L. Specifically, P may include, but is not limited to, satisfying the following formulas 1 and 2.
[0185] Formula 1, Here, mod represents the modulo operation.
[0186] Where N·K mod L represents the number of time units out of N·K time units that cannot form a complete L-fold repetition. For example, if N=2, K=7, and L=4, then N·K mod L=2, meaning that in addition to the 3 complete L-fold repetition time units that can be formed from the N·K time units, there are also 2 time units that are less than the number of L-fold repetition time units, i.e., these 2 time units cannot form a complete L-fold repetition time unit.
[0187] M represents the number of time unit groups in N·K time units. This represents the number of time units included in the M time unit groups. Assuming N = 2, K = 7, and L = 4, then... That is, the M time unit groups include 8 time units.
[0188] Furthermore, according to Formula 1, the N·K time units, excluding the time units included in the M time unit groups and the time units that cannot form a complete L repetitions, also include P consecutive time units. The terminal device can transmit L repetitions of Q parts out of the N parts of the first transmission block within these P consecutive time units. For example, assuming N=2, K=7, L=4, then... Since Q = P / L = 4 / 4 = 1, the terminal device can send L repetitions of one of the N parts of the first transmission block in these four consecutive time units.
[0189] Formula 2, in, This means that the result of N·K divided by L is rounded down.
[0190] in, This indicates that N·K time units include several sets of complete time units repeated L times. This indicates the number of time units in each of the L complete repetitions. For example... This indicates that the N·K time units include 3 complete time units with L repetitions. That is, the number of time units for the three complete sets of L repetitions is 12.
[0191] Furthermore, according to Formula 2, it can also be determined that in addition to the time units included in the M time unit groups and the time units that cannot form a complete L repetition, the N·K time units also include P consecutive time units. The terminal device can send L repetitions of Q parts of the N parts of the first transmission block in these P consecutive time units.
[0192] Optionally, the aforementioned Q parts can be consecutive Q parts from the N parts of the first transmission block. For example, assuming Q is 2, the P time units can include L repetitions of the first part and L repetitions of the second part from the N parts.
[0193] For ease of description, the number of time units that cannot form a complete L repetitions will be denoted as R, meaning that the N·K time units include M time unit groups, P consecutive time units, and R consecutive time units. Optionally, the R time units can carry R repetitions of one of the N parts of the first transport block, where R is a positive integer, and specifically R satisfies, but is not limited to, the following formulas 3 and 4:
[0194] Formula 3, R = N·K mod L, where mod represents the modulo operation.
[0195] For example, if N = 2, K = 7, L = 4, then R = 2·7 mod 4 = 2.
[0196] Formula 4,
[0197] in, This represents the number of time units that can form a complete L-fold repetition among N·K time units. These time units that can form a complete L-fold repetition include M time unit groups and P consecutive time units.
[0198] Optionally, the specific arrangement of M time unit groups, P consecutive time units, and R consecutive time units can include, but is not limited to, the following methods 1 and 2.
[0199] Method 1: P time units are located after M time unit groups, Q parts are the first Q parts of N parts, R time units are the last R time units of N·K time units, and R time units include R repetitions of the (Q+1)th part of N parts.
[0200] Specifically, the terminal device can determine that the total number of time units usable in all repeated transmissions of the first transmission block is N·K time units. Within these N·K time units, the portion fully applying the OCC group starts from time unit 0, meaning that the portion corresponding to M time unit groups is transmitted first. That is, starting from time unit 0, the terminal device sequentially transmits L repetitions of the first part, L repetitions of the second part, and so on until L repetitions of the Nth part are transmitted. Furthermore, for each part's L repetitions, different symbols from the first codeword are used for overwriting. The specific transmission process of these M time unit groups can be found in the description above and will not be repeated here.
[0201] Furthermore, in the P time units following the M time unit group, the terminal device sequentially sends L repetitions of the first Q parts of the N parts. If we assume that Q is 2, then the terminal device sequentially sends L repetitions of the first part and L repetitions of the second part of the first transmission block in the P time units.
[0202] Furthermore, in the R time units following the P time units, the terminal device sends R repetitions of the Q+1th part. If we assume Q equals 2, then the terminal device sends R repetitions of the 3rd part of the first transport block in the R time units.
[0203] The following is combined Figure 9Taking the time unit as a time slot, the first transmission block is transmitted in 2 time slots (i.e., N=2), the number of repetitions of the first transmission block is 7 (i.e., K=7), and the OCC length is 4 (i.e., L=4) as an example, the arrangement of M time unit groups, P consecutive time units and R consecutive time units in this method 1 is further explained.
[0204] like Figure 9 As shown, the total number of time slots that the first transport block can use in all repeated transmissions is 14 (N·K=2×7=14). That is, the N·K time slots include one time unit group. In this time unit group, the terminal device, starting from the 0th time slot, sequentially transmits four repetitions of the first part of the first transport block and four repetitions of the second part. It should be understood that the content of each repetition in the four repetitions of the first part is covered by different symbols in the OCC sequence.
[0205] For example, assuming an OCC sequence of length 4 is denoted as [w0, w1, w2, w3], then w0 covers the first repetition of the first part, w1 covers the second repetition of the first part, w2 covers the third repetition of the first part, and w3 covers the fourth repetition of the first part. The content of each repetition in the four repetitions of the second part of the first transport block can also be covered using different symbols from the OCC sequence; for simplicity, these examples are not provided here.
[0206] Furthermore, after this one time unit group, the terminal device performs four consecutive (e.g.) The first 1 of the first transmission block is sent in the time slot. The first part (or the first part of the first transport block) is repeated four times. Alternatively, the content of each of the four repetitions of the first part can also be covered by different symbols in the OCC sequence.
[0207] Furthermore, after these four consecutive time slots, the terminal device transmits two repetitions of the second part of the first transport block in two consecutive time slots (e.g., R = N·K mod L = 14 mod 4 = 2). The content of these two repetitions can also be covered by the first two symbols in the OCC sequence. For example, the content of the first time slot in the two consecutive time slots can be covered by w0, and the content of the second time slot can be covered by w1.
[0208] Optionally, the implementation method for which RV version is used in each of the N·K time slots in Method 1 is similar to that described above. That is, a portion carried by each of the N·K time slots uses the same redundant version, or, a portion of the N portions carried by the nth time slot in the N·K time slots uses the s-th RV in the RV sequence, where the length of the RV sequence is S. For details, please refer to the description above; further elaboration is not provided here.
[0209] Method 2: P time units are located after the M time unit group, Q parts are the first Q parts of the N parts, R time units are the first R time units of the N·K time units, and R time units include R repetitions of the (Q+1)th part of the N parts.
[0210] Specifically, the terminal device can determine that the total number of time units that the first transmission block can use in all repeated transmissions is N·K time units. In these N·K time units, starting from the 0th time unit, the R repetitions of the Q+1th part of the first transmission block are transmitted in R time units. The specific calculation methods for R and Q can be found in the relevant formulas mentioned above, and will not be repeated here.
[0211] Further, after the R time units, the terminal device transmits the contents of M time unit groups, such as sequentially transmitting L repetitions of the first part of the first transport block, L repetitions of the second part, and so on until L repetitions of the Nth part are transmitted. For each part's L repetitions, different symbols from the first codeword are used for overlay. After the M time unit groups, the terminal device sequentially transmits L repetitions of the first Q parts of the N parts over P time units.
[0212] The following is combined Figure 10 Taking time units as time slots, with N=2, K=7, and L=4 as an example, the arrangement of M time unit groups, P consecutive time units, and R consecutive time units in this method 2 is further explained.
[0213] like Figure 10 As shown, the total number of time slots available for the first transport block during all repeated transmissions is 14. Starting from the 0th time slot, the terminal device transmits two repetitions of the second part of the first transport block in two consecutive time slots (e.g., R = N·K mod L = 14 mod 4 = 2). Optionally, similar to method 1, the content of these two repetitions can also be covered by the first two symbols in the OCC sequence, as described above, and will not be repeated here.
[0214] Furthermore, after these two consecutive time units, the terminal device sequentially transmits four repetitions of the first part and four repetitions of the second part of the first transport block within a time unit group. Optionally, the four repetitions of the first part or the second part may be covered by different symbols in the OCC sequence, as described above, and will not be repeated here.
[0215] Following this time unit group, the terminal device transmits four repetitions of the first part of the first transport block (or the first part of the first transport block) in four consecutive time slots. Optionally, the content of each repetition in the four repetitions of the first part can also be covered by different symbols in the OCC sequence.
[0216] In Method 2, the redundant version of a portion carried by each time unit may include, but is not limited to, the following implementation methods.
[0217] In one implementation, the redundant version of a portion carried by each of the N·K time units is the same. For example, the RV carried by each of the N·K time units is 0 or 3. The specific RV used by the terminal device can be predefined by the protocol or can be indicated to the terminal device by the base station through signaling. This application does not limit this.
[0218] In another embodiment, the redundant version RV used by one of the N parts carried by the nth time unit in the N·K time units is the s-th RV in the RV sequence, the length of which is S, where n, s, and S are positive integers, and s satisfies:
[0219]
[0220] w=(n-(N·K mod L)+N·K)mod(N·K)
[0221] In other words, since the "redundant" R time units are placed in the first R time units of N·K time units, if the method shown in Table 1 or Table 2 is still used to determine RV, it may result in different RVs used for a part carried by multiple time units in a time unit group, or different RVs used for parts covered by multiple symbols in an OCC sequence. Based on this, cyclic shifting is required. Here, N·K mod L represents R time units, which is the position n that needs to be shifted.
[0222] n-(N·K mod L) represents the position after the nth time unit is cyclically shifted. In order to make the result of n-(N·K mod L) fall within the valid range, it is also necessary to add N·K to n-(N·K mod L) and take the modulus of N·K to achieve the cyclic shift of RV.
[0223] For example, assuming N=2, K=7, L=4, and the RV sequence is 0, 2, 3, 1, then for the first time unit, w = (1 - (2·7 mod 4) + 2·7) mod (2·7) = 13, meaning the position of the first time unit after cyclic shift is 13. Further, That is, the first time unit uses the first RV in the RV sequence for redundancy (the RV position in the RV sequence is calculated from 0, that is, 0, 2, 3, 1 are the 0th RV, 1st RV, 2nd RV and 3rd RV in the RV sequence respectively).
[0224] The following explanation, using Table 3 as an example with RV sequences of 0, 2, 3, 1, further illustrates the RV used for a portion of each time unit within the N·K time units.
[0225] As shown in Table 3, the length of this RV sequence is 4, that is, S = 4. When At that time, a portion of the data carried by the nth time unit uses an RV of 0. At that time, a portion of the nth time unit uses an RV of 2. At that time, a portion of the nth time unit uses an RV of 3. At that time, a portion of the data carried by the nth time unit uses an RV of 1. The value of w can be found in the description above and will not be repeated here.
[0226] Table 3
[0227]
[0228] Alternatively, when the RV sequence is 0 or 3, the RV used by a portion of each time unit in the N·K time units is shown in Table 4. It can be understood that the length of this RV sequence is 2, i.e., S = 2. When... At that time, a portion of the data carried by the nth time unit uses an RV of 0. At that time, a portion of the data carried by the nth time unit uses an RV of 3. The value of w can be found in the description above and will not be repeated here.
[0229] Table 4
[0230] <![CDATA[RV id ]]> ((w-(w mod NL)) / NL)mod 4=0 ((w-(w mod NL)) / NL)mod 4=1 0 0 3 3 3 0
[0231] Optionally, the arrangement of M time unit groups, P consecutive time units, and R consecutive time units can also satisfy the following method 3, that is, the P time units are located in Before each time unit group, the Q parts are the last Q parts out of the N parts, the R time units are the first R time units out of the N·K time units, and the R time units include the R repetitions of the NQth part out of the N parts.
[0232] That is, within N·K time units, the terminal device first transmits R repetitions of the NQth part of the N parts in the first R time units. Then, in the P time units following R time units, it transmits L repetitions of the last Q parts of the N parts of the first transmission block. Further, the terminal device transmits L repetitions of the last Q parts of the N parts of the first transmission block in the P time units following P time units. Each time unit group sequentially sends L repetitions of each part of the first transmission block. The specific L repetitions of each part of each time unit group can be found in the description above, and will not be repeated here.
[0233] To facilitate understanding, the following will be combined with... Figure 11 To further explain method 3, assuming N=2, K=7, and L=4, then P time units specifically represent 4 time units, Q parts specifically represent the last part of the two parts of the first transmission block, and R time units specifically represent 2 time units. Therefore, R time units include R repetitions of the first part out of N parts. The specific calculation process for R and Q can be found in the description above and will not be repeated here.
[0234] like Figure 11 As shown, the terminal device transmits the first part twice in the first two time units of the 14 time units. And in the four time units following these two time units, the terminal device transmits the last part (also called the second part) of the first transmission block four times. And in the M time units following these four time units (in... Figure 11 Specifically, it is a time unit group, i.e., M=1) sending L repetitions of N parts of the first transmission block, that is, the terminal device first sends 4 repetitions of the first part of the first transmission block, and then sends 4 repetitions of the second part.
[0235] and Figure 9 or Figure 10 Similarly, the Figure 11 Multiple repetitions of each part in M time unit groups, P consecutive time units, or R consecutive time units can also be covered by different symbols in the OCC sequence.
[0236] For example, the protocol can be predefined or the base station can preconfigure the terminal device via signaling. The R repetitions in the R time units can be covered by the first R symbols or the last R symbols in the OCC sequence.
[0237] For example, taking N=2, K=7, L=4 as an example, Figure 12 As shown, the two repetitions of the first part in the first two time units are covered by the first two code elements w0 and w1 in the OCC sequence, respectively. Alternatively, as... Figure 13 As shown, the first part of the first transmission block in the first two time units is covered by the last two symbols w2 and w3 in the OCC sequence.
[0238] Optionally, a portion carried by each of the N·K time units can use the same redundancy version (RV). For example, each portion carried by a time unit can be configured to use an RV of 0, or each portion carried by a time unit can be configured to use an RV of 3. In this optional approach, the portions carried by each time unit in the first R+P time units can be, in turn, the portions carried by the last R+P time units in a time unit group.
[0239] If the R repetitions in the R time units are covered by the first R symbols in the OCC sequence (e.g.) Figure 12 (as shown), or, if the R repetitions in the R time units are covered by the last R symbols in the OCC sequence (as shown) Figure 13 As shown in the diagram, since RV is the same, the base station can attempt to decode the first transport block when it receives the content carried in the first 6 time units (i.e., R+P time units). This helps to further reduce the latency for the base station to receive a complete first transport block.
[0240] Whether a base station can successfully decode the PUSCH depends on whether other terminals reuse the transmission resources. If no other terminals reuse the transmission resources, the base station has a chance to successfully decode the first transmission block. If other terminals reuse the resources, whether successful decoding is possible depends on the length of the OCC sequence used by other terminal devices. Figure 12 , 13 In the example, if other terminal devices reusing resources use an OCC sequence length of 2, then the base station has a chance to successfully decode the first transport block.
[0241] If the base station fails to decode the first transport block based on the content carried in the first 6 time units, the parts carried in the first R+P time units can be combined with the first N·L-(R+P) time units in the time unit group after the R+P time units. The base station can try to decode the first transport block again after receiving the first N·L time units. Especially when the R repetitions in the R time units are covered by the last R symbols in the OCC sequence, the first N·L time units received by the base station carry multiple repetitions of each part of the first transport block covered by the complete OCC sequence, and the probability of successful decoding is higher.
[0242] It should be understood that this application is not limited to this. In the N·K time units, each part of the first R+P time units can use a single RV, such as RV being 0, and each part of the subsequent N·L time units can use the same RV, such as RV being 2. In this case, when the base station receives the content carried by the first R+P time units, it can attempt to decode the first transmission block. If the first transmission block is not successfully decoded based on the content carried by the R+P time units, the base station can attempt to decode the first transmission block once after the R+P time units, every time it receives the content carried by each of the following N·L consecutive time units (i.e., every time it receives the content carried by one of the M time unit groups).
[0243] The above text combined Figures 5 to 13 The data transmission method of the embodiments of this application is described in detail below, in conjunction with Figure 14 This application describes in detail the communication apparatus according to embodiments of the present application. The communication apparatus includes modules or units for performing each part of the above embodiments. The modules or units may be software, hardware, or a combination of software and hardware. The following is only a brief illustrative example of the communication apparatus; for details of the implementation, please refer to the description of the foregoing method embodiments, which will not be repeated below.
[0244] Figure 14 A schematic block diagram of a communication device 1400 provided in an embodiment of this application is shown. The device 1400 includes a processor 1401 and a transceiver 1402.
[0245] Optionally, the device 1400 may further include a memory 1403, wherein the memory 1403 is used to store instructions. The processor 1401, transceiver 1402, and memory 1403 communicate with each other via internal interconnection paths. The processor 1401 executes the instructions stored in the memory 1403 to control the transceiver 1402 to transmit and / or receive signals.
[0246] It should be understood that the device 1400 may specifically be a terminal device or a network device as described in the above embodiments, and may be used to execute the various steps and / or processes corresponding to the terminal device or network device in the above method embodiments. Optionally, the memory 1403 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include non-volatile random access memory. For example, the memory may also store device type information. The processor 1401 may be used to execute instructions stored in the memory, and when the processor 1401 executes instructions stored in the memory, the processor 1401 is used to execute the various steps and / or processes of the above method embodiments. The transceiver 1402 may include a transmitter and a receiver, the transmitter may be used to implement the various steps and / or processes corresponding to the transceiver for performing a transmitting action, and the receiver may be used to implement the various steps and / or processes corresponding to the transceiver for performing a receiving action.
[0247] In one possible implementation, the device 1400 is used to implement the steps corresponding to the terminal device in the method 500 described above.
[0248] Processor 1401 is used to determine N·K time units, where N and K are integers greater than 1.
[0249] Transceiver 1402 is used to transmit multiple repetitions of a first transmission block in the N·K time units, wherein the first transmission block includes N parts, the N·K time units include consecutive N·L time units, the N·L time units carry L repetitions of each of the N parts, the L repetitions are carried in consecutive time units, and the L repetitions are respectively covered by different symbols in a first codeword, the first codeword contains L symbols, and K is greater than or equal to L.
[0250] Optionally, the transceiver 1402 is further configured to receive at least one of the following information: first information indicating that the number of repetitions of the first transmission block is K; second information indicating the number of time units N for transmitting the first transmission block once; and third information indicating the first codeword.
[0251] Optionally, the first codeword can specifically be an OCC, and the length of the OCC sequence is L.
[0252] Optionally, the N·K time units include M time unit groups, where M satisfies This means that the result of K divided by L is rounded down, and each of the M time unit groups includes the N·L time units.
[0253] Optionally, if K is not an integer multiple of L, then the N·K time units also include P consecutive time units, which include L repetitions of Q parts from the N parts, where P and Q are positive integers, and Q = P / L, and P satisfies:
[0254] or,
[0255] Here, mod represents the modulo operation. This means that the result of N·K divided by L is rounded down.
[0256] Optionally, the Q parts are Q consecutive parts among the N parts.
[0257] Optionally, the N·K time units also include R consecutive time units, each of which comprises R repetitions of one of the N parts, where R is a positive integer and satisfies:
[0258] or,
[0259] Optionally, the P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the last R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0260] Optionally, the redundant version of a portion carried by each of the N·K time units is the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit of the N·K time units is the s-th RV in the RV sequence, the length of the RV sequence being S, where s satisfies:
[0261]
[0262] Optionally, the P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0263] Optionally, the redundant versions of a portion carried by each of the N·K time units are the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit in the N·K time units is the s-th RV in the RV sequence, the length of which is S, where n, s, and S are positive integers, and s satisfies:
[0264]
[0265] w=(n-(N·K mod L)+N·K) mod (N·K).
[0266] Optionally, the P time units are located in the Before the time unit group, the Q parts are the last Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the NQth part of the N parts.
[0267] In another possible implementation, the device 1400 is used to implement the steps corresponding to the base station in the method 500 described above.
[0268] Processor 1401 is used to determine N·K time units, where N and K are integers greater than 1.
[0269] Transceiver 1402 is used to receive multiple repetitions of a first transmission block in the N·K time units, wherein the first transmission block includes N parts, the N·K time units include consecutive N·L time units, the N·L time units carry L repetitions of each of the N parts, the L repetitions are carried in consecutive time units, and the L repetitions are respectively covered by different symbols in a first codeword, the first codeword contains L symbols, and K is greater than or equal to L.
[0270] Optionally, the transceiver 1402 is also configured to send at least one of the following information: first information indicating that the number of repetitions of the first transport block is K; second information indicating the number of time units N for transmitting the first transport block once; and third information indicating the first codeword.
[0271] Optionally, the N·K time units include M time unit groups, where M satisfies This means that the result of K divided by L is rounded down, and each of the M time unit groups includes the N·L time units.
[0272] Optionally, if K is not an integer multiple of L, the N·K time units also include P consecutive time units, which include L repetitions of Q parts from the N parts, where P and Q are positive integers, and Q = P / L, and P satisfies:
[0273] or,
[0274] Here, mod represents the modulo operation. This means that the result of N·K divided by L is rounded down.
[0275] Optionally, the Q parts are Q consecutive parts among the N parts.
[0276] Optionally, the N·K time units also include R consecutive time units, each of which comprises R repetitions of one of the N parts, where R is a positive integer and satisfies:
[0277] R = N·K mod L, or,
[0278] Optionally, the P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the last R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0279] Optionally, the redundant version of a portion carried by each of the N·K time units is the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit of the N·K time units is the s-th RV in the RV sequence, the length of the RV sequence being S, where s satisfies:
[0280]
[0281] Optionally, the P time units are located after the M time unit group, the Q parts are the first Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
[0282] Optionally, the redundant versions of a portion carried by each of the N·K time units are the same; or, the redundant version RV of a portion of the N parts carried by the nth time unit in the N·K time units is the s-th RV in the RV sequence, the length of which is S, where n, s, and S are positive integers, and s satisfies:
[0283]
[0284] w=(n-(N·K mod L)+N·K) mod (N·K).
[0285] Optionally, the P time units are located in the Before the time unit group, the Q parts are the last Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the NQth part of the N parts.
[0286] In the embodiments of this application, Figure 14 The device 1400 in the text can also be a chip, such as a SOC, a modem, etc.
[0287] It should be understood that, in the embodiments of this application, the processor may be a central processing unit (CPU), or it may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.
[0288] In implementation, each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software. The steps of the method disclosed in the embodiments of this application can be directly manifested as execution by a hardware processor, or as a combination of hardware and software modules within the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor executes the instructions in the memory, combining them with its hardware to complete the steps of the above method. To avoid repetition, detailed descriptions are omitted here.
[0289] Some embodiments of this application provide a chip system applied to a terminal device. The chip system includes at least one processor and an interface for receiving instructions and transmitting them to the at least one processor. The at least one processor executes instructions to cause the terminal to perform the aforementioned data transmission method. The chip system may be a modem, or a system-on-a-chip (SoC) including a modem, and the aforementioned method may be implemented by a modem.
[0290] The modem can include a NAS (non-access stratum) layer, an RRC layer, a PDCP layer, an RLC layer, a MAC layer, and a PHY layer. Each of these layers can be a software module. The modem can interact with network devices via an antenna.
[0291] This application also provides a computer-readable storage medium for storing a computer program that implements the methods shown in the above method embodiments.
[0292] This application also provides a computer program product, which includes a computer program (also referred to as code or instructions). When the computer program is run on a computer, the computer can execute the methods shown in the above-described method embodiments.
[0293] Those skilled in the art will recognize that the modules and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0294] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and modules described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.
[0295] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or modules may be electrical, mechanical, or other forms.
[0296] The modules described as separate components may or may not be physically separate. Similarly, the components shown as modules may or may not be physical modules; they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected to achieve the purpose of this embodiment, depending on actual needs.
[0297] In addition, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module.
[0298] If a function is implemented as a software module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of this application, or the parts that contribute to the prior art, or parts of the technical solutions, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0299] The above description is merely a specific embodiment of this application, but the protection scope of the embodiments of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the embodiments of this application should be included within the protection scope of the embodiments of this application. Therefore, the protection scope of the embodiments of this application should be determined by the protection scope of the claims.
Claims
1. A data transmission method, characterized in that, The method includes: Determine N·K time units, where N and K are integers greater than 1; In the N·K time units, the first transmission block is transmitted multiple times. The first transmission block comprises N parts, and the N·K time units comprise consecutive N·L time units. Each of the N·L time units carries L repetitions of each of the N parts. The L repetitions are carried in consecutive time units, and the L repetitions are covered by different symbols in a first codeword. The first codeword contains L symbols, and K is greater than or equal to L.
2. The method according to claim 1, characterized in that, The method further includes: Receive at least one of the following messages: The first piece of information is used to indicate that the number of repetitions of the first transmission block is K; The second information is used to indicate the number N of time units for transmitting the first transmission block once; The third piece of information is used to indicate the first codeword.
3. The method according to claim 1 or 2, characterized in that, The N·K time units comprise M time unit groups, where M satisfies This means that the result of K divided by L is rounded down, and each of the M time unit groups includes the N·L time units.
4. The method according to claim 3, characterized in that, If K is not an integer multiple of L, the N·K time units further include P consecutive time units, each of which includes L repetitions of Q parts from the N parts, where P and Q are positive integers, and Q = P / L, and P satisfies: or, Here, mod represents the modulo operation. This means that the result of N·K divided by L is rounded down.
5. The method according to claim 4, characterized in that, The Q parts are Q consecutive parts out of the N parts.
6. The method according to claim 4 or 5, characterized in that, The N·K time units further include R consecutive time units, each of which comprises R repetitions of one of the N parts, where R is a positive integer and satisfies: R = N·K mod L, or, 7. The method according to claim 6, characterized in that, The P time units are located after the M time unit groups, the Q parts are the first Q parts of the N parts, the R time units are the last R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
8. The method according to any one of claims 3 to 7, characterized in that, The N·K time units each carry a portion that uses the same redundant version; or, The redundant version RV used by one of the N parts carried in the nth time unit of the N·K time units is the s-th RV in the RV sequence, where the length of the RV sequence is S, and s satisfies:
9. The method according to claim 6, characterized in that, The P time units are located after the M time unit groups, the Q parts are the first Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
10. The method according to claim 9, characterized in that, The N·K time units each carry a portion that uses the same redundant version; or, The redundant version RV used by one of the N parts carried in the nth time unit of the N·K time units is the s-th RV in the RV sequence, where the length of the RV sequence is S, and n, s, and S are positive integers, and s satisfies: w=(n-(N·K mod L)+N·K) mod (N·K).
11. The method according to claim 6, characterized in that, The P time units are located in the Before the time unit group, the Q parts are the last Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the NQth part of the N parts.
12. A data transmission method, characterized in that, The method includes: Determine N·K time units, where N and K are integers greater than 1; In the N·K time units, the first transmission block is received multiple times. The first transmission block comprises N parts, and the N·K time units comprise consecutive N·L time units. Each of the N·L time units carries L repetitions of each of the N parts. The L repetitions are carried in consecutive time units, and the L repetitions are covered by different symbols in a first codeword. The first codeword contains L symbols, and K is greater than or equal to L.
13. The method according to claim 12, characterized in that, The method further includes: Send at least one of the following messages: The first piece of information is used to indicate that the number of repetitions of the first transmission block is K; The second information is used to indicate the number N of time units for transmitting the first transmission block once; The third piece of information is used to indicate the first codeword.
14. The method according to claim 12 or 13, characterized in that, The N·K time units comprise M time unit groups, where M satisfies This means that the result of K divided by L is rounded down, and each of the M time unit groups includes the N·L time units.
15. The method according to claim 14, characterized in that, If K is not an integer multiple of L, the N·K time units further include P consecutive time units, each of which includes L repetitions of Q parts from the N parts, where P and Q are positive integers, and Q = P / L, and P satisfies: or, Here, mod represents the modulo operation. This means that the result of N·K divided by L is rounded down.
16. The method according to claim 15, characterized in that, The Q parts are Q consecutive parts out of the N parts.
17. The method according to claim 15 or 16, characterized in that, The N·K time units further include R consecutive time units, each of which comprises R repetitions of one of the N parts, where R is a positive integer and satisfies: R = N·K mod L, or, 18. The method according to claim 17, characterized in that, The P time units are located after the M time unit groups, the Q parts are the first Q parts of the N parts, the R time units are the last R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
19. The method according to any one of claims 14 to 18, characterized in that, The N·K time units each carry a portion that uses the same redundant version; or, The redundant version RV used by one of the N parts carried in the nth time unit of the N·K time units is the s-th RV in the RV sequence, where the length of the RV sequence is S, and s satisfies:
20. The method according to claim 17, characterized in that, The P time units are located after the M time unit groups, the Q parts are the first Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the (Q+1)th part of the N parts.
21. The method according to claim 20, characterized in that, The N·K time units each carry a portion that uses the same redundant version; or, The redundant version RV used by one of the N parts carried in the nth time unit of the N·K time units is the s-th RV in the RV sequence, where the length of the RV sequence is S, and n, s, and S are positive integers, and s satisfies: w=(n-(N·K mod L)+N·K) mod (N·K).
22. The method according to claim 17, characterized in that, The P time units are located in the Before the time unit group, the Q parts are the last Q parts of the N parts, the R time units are the first R time units of the N·K time units, and the R time units include R repetitions of the NQth part of the N parts.
23. A communication device, characterized in that, Includes a processor, which is coupled to a memory; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory, causing the communication device to perform the method as described in any one of claims 1 to 11, or to perform the method as described in any one of claims 12 to 22.
24. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the method as described in any one of claims 1 to 11, or implements the method as described in any one of claims 12 to 22.
25. A communication device, characterized in that, It includes at least one processor and a communication interface, the communication interface and the at least one processor being interconnected via a line, the at least one processor being configured to run a computer program or instructions to perform the method as claimed in any one of claims 1 to 11, or to perform the method as claimed in any one of claims 12 to 22.
26. A computer program product, characterized in that, Includes a computer program that, when run, causes a computer to perform the method as described in any one of claims 1 to 11, or causes a computer to perform the method as described in any one of claims 12 to 22.