Signal transmission method and apparatus, and device

By grouping the information bit set into N information bit groups and encoding them with different code rates, redundant version signals are generated, which solves the problem of insufficient information bit encoding flexibility and improves transmission performance.

WO2026086686A1PCT designated stage Publication Date: 2026-04-30VIVO MOBILE COMM CO LTD
View PDF 3 Cites 0 Cited by

Patent Information

Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
VIVO MOBILE COMM CO LTD
Filing Date
2025-10-17
Publication Date
2026-04-30

AI Technical Summary

Technical Problem

The limited flexibility of information bit encoding in existing technologies leads to insufficient transmission performance.

Method used

The information bit set is grouped into N information bit groups and encoded using N different code rates to generate a redundant version of the target signal, supporting retransmission.

Benefits of technology

It improves the flexibility and transmission performance of information bit encoding, and enhances the data transmission capability of the device.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025128260_30042026_PF_FP_ABST
    Figure CN2025128260_30042026_PF_FP_ABST
Patent Text Reader

Abstract

The present application relates to the technical field of communications, and discloses a signal transmission method and apparatus, and a device. The signal transmission method in the embodiments of the present application comprises: a first device generates a target signal on the basis of a bit sequence corresponding to a target information bit group, wherein the target signal is used for transmitting data and is a signal corresponding to a redundancy version, the target information bit group is all or some of N information bit groups obtained by grouping an information bit set, and the N information bit groups are respectively encoded by using N code rates, N being an integer greater than 1; and the first device sends the target signal.
Need to check novelty before this filing date? Find Prior Art

Description

Signal transmission methods, devices and equipment

[0001] Cross-reference to related applications

[0002] This application claims priority to Chinese Patent Application No. 202411494819.8, filed in China on October 24, 2024, the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application belongs to the field of communication technology, specifically relating to a signal transmission method, apparatus, and device. Background Technology

[0004] In related technologies, encoding is performed at the granularity of information bit sets (such as a transport block). Specifically, a code rate is used to uniformly encode an information bit set, which results in relatively poor flexibility in information bit encoding. Summary of the Invention

[0005] This application provides a signal transmission method, apparatus, and device that can solve the problem of poor flexibility in information bit encoding.

[0006] Firstly, a signal transmission method is provided, including:

[0007] The first device generates a target signal based on the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is the signal corresponding to the redundant version. The target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set. The N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0008] The first device sends the target signal.

[0009] Secondly, a signal transmission method is provided, including:

[0010] The second device receives the target signal, the bit sequence corresponding to the target signal is the bit sequence corresponding to the target information bit group, the target signal is used to transmit data and is the signal corresponding to the redundant version, the target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set, and the N information bit groups are encoded using N code rates respectively, where N is an integer greater than 1.

[0011] Thirdly, a signal transmission device is provided, comprising:

[0012] The processing module is used to generate a target signal based on the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is the signal corresponding to the redundant version. The target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set. The N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0013] A transmitting module is used to transmit the target signal.

[0014] Fourthly, a signal transmission device is provided, comprising:

[0015] The receiving module is used to receive a target signal, wherein the bit sequence corresponding to the target signal is the bit sequence corresponding to the target information bit group, the target signal is used to transmit data and is the signal corresponding to the redundant version, and the target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set, and the N information bit groups are encoded using N code rates respectively, where N is an integer greater than 1.

[0016] Fifthly, a signal transmission apparatus is provided, the apparatus being configured to perform the steps of the method described in the first aspect, or to implement the steps of the method described in the second aspect.

[0017] In a sixth aspect, an apparatus is provided, comprising a processor and a memory, the memory storing a program or instructions executable on the processor, wherein the program or instructions, when executed by the processor, implement the steps of the signal transmission method on the first device side provided in the embodiments of this application.

[0018] In a seventh aspect, a device is provided, including a processor and a communication interface, wherein the processor is configured to generate a target signal based on a bit sequence corresponding to a target information bit group, the target signal being used to transmit data and being a signal corresponding to a redundant version, the target information bit group being all or part of an N information bit group obtained by grouping an information bit set, and the N information bit groups being encoded using N code rates, where N is an integer greater than 1; the communication interface is configured to transmit the target signal.

[0019] Eighthly, an apparatus is provided, comprising a processor and a memory, the memory storing a program or instructions executable on the processor, the program or instructions, when executed by the processor, implementing the steps of the signal transmission method on the second device side as provided in the embodiments of this application.

[0020] In a ninth aspect, a device is provided, including a processor and a communication interface, wherein the communication interface is used to receive a target signal, the bit sequence corresponding to the target signal is a bit sequence corresponding to a target information bit group, the target signal is used to transmit data and is a signal corresponding to a redundant version, the target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set, and the N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0021] In a tenth aspect, a terminal is provided, the terminal including a processor and a memory, the memory storing a program or instructions executable on the processor, the program or instructions, when executed by the processor, implementing the steps of the method as described in the first or second aspect.

[0022] Eleventhly, a terminal is provided, including a processor and a communication interface, wherein the processor is configured to generate a target signal based on a bit sequence corresponding to a target information bit group, the target signal being used for data transmission and being a signal corresponding to a redundant version, the target information bit group being all or part of N information bit groups obtained by grouping an information bit set, and the N information bit groups being encoded using N code rates, where N is an integer greater than 1; the communication interface is configured to transmit the target signal; or, the communication interface is configured to receive the target signal, the bit sequence corresponding to the target signal being a bit sequence corresponding to the target information bit group, the target signal being used for data transmission and being a signal corresponding to a redundant version, the target information bit group being all or part of N information bit groups obtained by grouping an information bit set, and the N information bit groups being encoded using N code rates, where N is an integer greater than 1.

[0023] In a twelfth aspect, a network-side device is provided, the network-side device including a processor and a memory, the memory storing a program or instructions executable on the processor, the program or instructions, when executed by the processor, implementing the steps of the method as described in the first or second aspect.

[0024] In a thirteenth aspect, a network-side device is provided, including a processor and a communication interface. The processor generates a target signal based on a bit sequence corresponding to a target information bit group. The target signal is used to transmit data and is a signal corresponding to a redundant version. The target information bit group is all or part of N information bit groups obtained by grouping an information bit set, and the N information bit groups are encoded using N code rates, where N is an integer greater than 1. The communication interface is used to transmit the target signal; or, the communication interface is used to receive the target signal, where the bit sequence corresponding to the target signal is the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is a signal corresponding to a redundant version. The target information bit group is all or part of N information bit groups obtained by grouping an information bit set, and the N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0025] In a fourteenth aspect, a readable storage medium is provided, on which a program or instructions are stored, which, when executed by a processor, implement the steps of a signal transmission method on a first device side as provided in the embodiments of this application, or implement the steps of a signal transmission method on a second device side as provided in the embodiments of this application.

[0026] In a fifteenth aspect, a wireless communication system is provided, comprising: a first device and a second device, wherein the first device is configured to perform the steps of the signal transmission method on the first device side as provided in the embodiments of this application, and the second device is configured to perform the steps of the signal transmission method on the second device side as provided in the embodiments of this application.

[0027] In a sixteenth aspect, a chip is provided, the chip including a processor and a communication interface, the communication interface being coupled to the processor, the processor being configured to run a program or instructions to implement the steps of a signal transmission method on a first device side as provided in the embodiments of this application, or to implement the steps of a signal transmission method on a second device side as provided in the embodiments of this application.

[0028] In a seventeenth aspect, a computer program / program product is provided, which is stored in a storage medium and is executed by at least one processor to implement the steps of a signal transmission method on a first device side as provided in the embodiments of this application, or the computer program / program product is executed by at least one processor to implement the steps of a signal transmission method on a second device side as provided in the embodiments of this application.

[0029] In this embodiment, a first device generates a target signal based on the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is a signal corresponding to a redundant version. The target information bit group consists of all or part of N information bit groups obtained by grouping the information bit set, and the N information bit groups are encoded using N code rates, where N is an integer greater than 1. The first device then transmits the target signal. Since the target information bit group consists of all or part of N information bit groups obtained by grouping the information bit set, it supports encoding the N information bit groups using N code rates. Compared to uniformly encoding the information bit set using a single code rate, this embodiment improves the flexibility of information bit encoding and enhances the device's transmission performance. Furthermore, since the target signal is a signal corresponding to a redundant version, it supports retransmission of the bit sequence corresponding to the target information bit group, further improving the device's transmission performance. Attached Figure Description

[0030] Figure 1 is a schematic diagram of a system provided in an embodiment of this application;

[0031] Figure 2 is a schematic diagram of repeated transmission provided in an embodiment of this application;

[0032] Figure 3 is a flowchart of a signal transmission method provided in an embodiment of this application;

[0033] Figure 4 is a schematic diagram of a bit sequence selection provided in an embodiment of this application;

[0034] Figure 5 is a schematic diagram of a starting position provided in an embodiment of this application;

[0035] Figure 6 is a schematic diagram of another bit sequence selection provided in an embodiment of this application;

[0036] Figure 7 is a flowchart of an encoding method provided in an embodiment of this application;

[0037] Figure 8 is a flowchart of another signal transmission method provided in an embodiment of this application;

[0038] Figure 9 is a schematic diagram of a bit stuffing method provided in an embodiment of this application;

[0039] Figure 10 is a schematic diagram of another starting position provided in an embodiment of this application;

[0040] Figure 11 is a schematic diagram of another bit stuffing method provided in an embodiment of this application;

[0041] Figure 12 is a schematic diagram of an encoding provided in an embodiment of this application;

[0042] Figure 13 is a schematic diagram of an interlacing provided in an embodiment of this application;

[0043] Figure 14a is a schematic diagram of the coding performance provided in an embodiment of this application;

[0044] Figure 14b is a schematic diagram of another encoding performance provided by an embodiment of this application;

[0045] Figure 15 is a schematic diagram of an encoding provided in an embodiment of this application;

[0046] Figure 16 is a schematic diagram of another encoding performance provided by an embodiment of this application;

[0047] Figure 17 is a schematic diagram of another encoding performance provided by an embodiment of this application;

[0048] Figure 18 is a structural diagram of a signal transmission device provided in an embodiment of this application;

[0049] Figure 19 is a structural diagram of another signal transmission device provided in an embodiment of this application;

[0050] Figure 20 is a structural diagram of a communication device provided in an embodiment of this application;

[0051] Figure 21 is a structural diagram of a terminal provided in an embodiment of this application;

[0052] Figure 22 is a structural diagram of a network-side device provided in an embodiment of this application. Detailed Implementation

[0053] The technical solutions of the embodiments of this application will be clearly described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this application. All other embodiments obtained by those skilled in the art based on the embodiments of this application are within the scope of protection of this application.

[0054] The terms "first," "second," etc., used in this application are used to distinguish similar objects and not to describe a specific order or sequence. It should be understood that such terms can be used interchangeably where appropriate so that embodiments of this application can be implemented in orders other than those illustrated or described herein, and the objects distinguished by "first" and "second" are generally of the same class, not limited in number; for example, the first object can be one or more. Furthermore, "or" in this application indicates at least one of the connected objects. For example, the scope of protection for "A or B" covers at least three scenarios: Scenario 1: including A but not B; Scenario 2: including B but not A; Scenario 3: including both A and B. In addition, the terms "A and / or B," "at least one of A and B," and "at least one of A or B" also cover at least the above three scenarios. The character " / " generally indicates that the preceding and following objects are in an "or" relationship.

[0055] The term "instruction" in this application can be either a direct instruction (or explicit instruction) or an indirect instruction (or implicit instruction). A direct instruction can be understood as one in which the sender explicitly informs the receiver of specific information, the operation to be performed, or the requested result, etc., in the instruction sent. An indirect instruction can be understood as one in which the receiver determines the corresponding information based on the instruction sent by the sender, or makes a judgment and determines the operation to be performed or the requested result, etc., based on the judgment result.

[0056] It is worth noting that the technology described in the embodiments of this application is not limited to Long Term Evolution (LTE) / LTE-Advanced (LTE-A) systems, but can also be used in other wireless communication systems, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single-carrier Frequency-Division Multiple Access (SC-FDMA), or other systems.

[0057] The terms "system" and "network" used in the embodiments of this application are often used interchangeably, and the described technologies can be used with respect to the systems and radio technologies mentioned above, as well as other systems and radio technologies. The following description describes a New Radio (NR) system for illustrative purposes, and the term NR is used in most of the following description; however, these technologies can also be applied to systems other than NR systems, such as 6th generation (6G) systems. th Generation 6G communication system.

[0058] Figure 1 shows a schematic diagram of a wireless communication system applicable to an embodiment of this application. The wireless communication system includes a terminal 11 and a network-side device 12.

[0059] Terminal 11 can be a mobile phone, tablet computer, laptop computer, notebook computer, personal digital assistant (PDA), handheld computer, netbook, ultra-mobile personal computer (UMPC), mobile internet device (MID), augmented reality (AR), virtual reality (VR) device, robot, wearable device, flight vehicle, drone (also known as uncrewed aerial vehicle, UAV), electric vertical take-off and landing (eVTOL) aircraft, helicopter, traditional fixed-wing aircraft, vehicle user equipment (VUE), shipborne equipment, pedestrian user equipment (PUE), smart home (home devices with wireless communication capabilities, such as refrigerators, televisions, washing machines, or furniture), game console, personal computer (PC), ATM, or self-service machine, etc. Wearable devices include: smartwatches, smart bracelets, smart earphones, smart glasses, smart jewelry (smart bracelets, smart chains, smart rings, smart necklaces, smart anklets, smart anklets, etc.), smart wristbands, smart clothing, etc. Among these, in-vehicle devices can also be referred to as in-vehicle terminals, in-vehicle controllers, in-vehicle modules, in-vehicle components, in-vehicle chips, or in-vehicle units, etc. It should be noted that the specific type of terminal 11 is not limited in the embodiments of this application.

[0060] Network-side equipment 12 may include access network equipment or core network equipment. Access network equipment may also be referred to as Radio Access Network (RAN) equipment, radio access network function, radio access network unit, or satellite. Access network equipment may include base stations, Wireless Local Area Network (WLAN) access points (APs), or Wireless Fidelity (WiFi) nodes, etc. The term "base station" can be referred to as Node B (NB), Evolved Node B (eNB), Next Generation Node B (gNB), New Radio Node B (NR Node B), Access Point, Relay Base Station (RBS), Serving Base Station (SBS), Base Transceiver Station (BTS), Radio Base Station, Radio Transceiver, Basic Service Set (BSS), Extended Service Set (ESS), Home Node B (HNB), Home Evolved Node B, Transmit / Receive Point (TRP), or any other suitable term in the relevant field, as long as the same technical effect is achieved. The term "base station" is not limited to any specific technical terminology. It should be noted that this application embodiment only uses a base station in an NR system as an example for description and does not limit the specific type of base station.

[0061] Core network equipment, also known as core network nodes, core network functions, or core network elements, includes, but is not limited to, at least one of the following: Mobility Management Entity (MME), Access and Mobility Management Function (AMF), Session Management Function (SMF), User Plane Function (UPF), Policy Control Function (PCF), Policy and Charging Rules Function (PCRF), Edge Application Server Discovery Function (EASDF), Unified Data Management (UDM), Unified Data Repository (UDR), Home Subscriber Server (HSS), Centralized network configuration (CNC), Network Repository Function (NRF), Network Exposure Function (NEF), Local NEF (or L-NEF), and Binding Support. The core network functions include: BSF (Block Network Function), Application Function (AF), Location Management Function (LMF), Gateway Mobile Location Centre (GMLC), and Network Data Analytics Function (NWDAF). It should be noted that this application embodiment only uses core network equipment in the NR system as an example and does not limit the specific type of core network equipment. If the name of the core network equipment mentioned in this application embodiment changes in subsequent protocol versions (e.g., 6G), it will still be within the scope of protection of this application.

[0062] Optionally, the core network equipment can be implemented by one or more functional modules in a single device, or by multiple devices working together; this application does not specifically limit this. It is understood that the aforementioned functional modules can be network elements in hardware devices, software functional modules running on dedicated hardware, or virtualized functional modules instantiated on a platform (e.g., a cloud platform).

[0063] In some embodiments, taking a New Radio (NR) system as an example, rate matching refers to the fact that the number of bits after encoding may not be consistent with the number of bits that the (wireless) resources can carry. If there are more resources, which bits should be selected for transmission; if there are fewer resources, which bits should be removed.

[0064] For example: the length of the bit sequence after rate matching of the (r-th)th code block is E r The calculation method is as follows:

[0065] Where, N L Q represents the transport layer number to which the transport block is mapped. m G represents the modulation order, G represents the total number of coded bits available for transmission corresponding to the transport block, and C′ represents the number of code blocks to be transmitted. If code block group (CBG) based transmission is not used, C′ is the number of code blocks after the transport block (TB) code block is divided.

[0066] In some embodiments, the specific process of bit selection can be represented as follows:

[0067] The sequence after rate matching is e k k = 0, 1, 2, ..., E-1, k0 is the starting position of different redundant versions:

[0068] In some embodiments, data retransmission can be performed as follows:

[0069] Based on Low Density Parity Check (LDPC) codes, some communication systems have proposed an adaptive reliable transmission Hybrid Automatic Repeat Request (HARQ) scheme. Specifically, the transmitter first transmits a self-decoding version. If the receiver cannot decode it, the transmitter transmits another version, which may or may not be self-decoding. After soft information merging, decoding attempts continue. If the transmitted data contains a large number of system bits, it generally possesses self-decoding characteristics, meaning it can still be correctly decoded even when treated as the initial transmission. The rate matching module in the coding link selects the appropriate retransmission order and redundant versions based on the retransmission requests fed back by the HARQ control module, and then interleaves the retransmitted information bits. In this HARQ implementation based on Quasi-Cyclic Low-Density Parity-Check Codes (QC-LDPC), a ring buffer is used to select transmitted bits. The encoder encodes data according to the lowest bit rate supported by the base graph (BG) (BG1 supports a minimum bit rate of 1 / 3, and BG2 supports a minimum bit rate of 1 / 5). The encoded information bits and all parity bits are then placed into the ring buffer. For each HARQ transmission, the retransmitted data bits are read sequentially from the buffer according to the redundancy version number (RV), for example, RV0→RV2→RV3→RV1. The redundancy version effectively defines the starting position of each HARQ sub-packet in the buffer, as shown in Figure 2.

[0070] The initial transmission version must be self-decoding capable. The starting points of each redundant version can be equally spaced or unequally spaced (non-uniform). The starting point k0 of each redundant version in the NR system is determined according to Table 1 below. Wherein, N... cb Z is the length of the circular buffer. c This is the LDPC enhancement factor.

[0071] Table 1:

[0072] The following description, in conjunction with the accompanying drawings, details a signal transmission method, apparatus, and device provided in this application through some embodiments and application scenarios.

[0073] Please refer to Figure 3, which is a flowchart of a signal transmission method provided in an embodiment of this application. As shown in Figure 3, it includes the following steps:

[0074] Step 301: The first device generates a target signal based on the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is the signal corresponding to the redundant version. The target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set. The N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0075] The first device mentioned above can be a terminal or a network-side device. For example, if the first device is a terminal, the information bit set is uplink data or data transmitted between terminals; if the first device is a network-side device, the information bit set is downlink data.

[0076] In some implementations, the aforementioned set of information bits may be a transport block (TB).

[0077] In some implementations, the aforementioned set of information bits is the information code block obtained after dividing the TB into code blocks. That is, code block division is performed first, and then the divided code blocks are grouped, which is equivalent to dividing each code block into N sub-code blocks.

[0078] The number of information bit groups (i.e., the value of N) can be predetermined or determined based on transmission parameters, such as 2, 3 or 4.

[0079] In this embodiment of the application, the aforementioned information bit group can also be referred to as an information bit sequence.

[0080] The aforementioned N code rates can be pre-configured or indicated by the network-side device, or N code rates determined based on the code rates corresponding to the aforementioned set of information bits. The code rate corresponding to the set of information bits is a code rate, which can also be called the overall code rate.

[0081] The above N code rates correspond one-to-one with the N information bit groups, which can be understood as each information bit group corresponding to a code rate.

[0082] Encoding the aforementioned N information bit groups using N code rates can be performed simultaneously using N code rates; or, encoding the N information bit groups using N code rates can be performed in a specific order, such as encoding the information bit groups with higher code rates first and encoding the information bit groups with lower code rates later.

[0083] In this embodiment of the application, the encoding method is not limited. For example, the above encoding can be Low Density Parity Check Code (LDPC) encoding, or the above encoding can be Polar encoding, etc.

[0084] The above-mentioned generation of the target signal based on the bit sequence corresponding to the target information bit group can be based on the information bit group when the target information bit group is a single information bit group, or it can be based on multiple information bit groups when the target bit group includes multiple information bit groups.

[0085] The first device mentioned above can generate a target signal by modulating the bit sequence corresponding to the target information bit group to obtain the target signal to be transmitted.

[0086] The aforementioned target signal used for data transmission can also be understood as the target signal used to transmit the data carried by the bits in the aforementioned target information bit group.

[0087] In this embodiment of the application, the signal corresponding to the redundant version can also be called the redundant version signal.

[0088] Step 302: The first device sends the target signal.

[0089] The aforementioned sending of the target signal can be sending the target signal to a second device, which can be a terminal or a network-side device.

[0090] In this embodiment, since the target information bit group is all or part of the N information bit groups obtained by grouping the information bit set, it supports encoding the N information bit groups using N code rates respectively. Compared with uniformly encoding the information bit set using a single code rate, this embodiment improves the flexibility of information bit encoding and is beneficial to improving the transmission performance of the device. Furthermore, since the target signal is a redundant version of the signal, it supports retransmission of the bit sequence corresponding to the target information bit group, further improving the transmission performance of the device.

[0091] In one optional implementation, the method further includes:

[0092] The first device selects the bit sequence corresponding to the target information bit group from the target cyclic buffer according to the redundancy version number corresponding to the target signal. The target cyclic buffer is a cyclic buffer that stores the encoded output bit sequence of the target information bit group.

[0093] Among them, the bit sequence corresponding to the above target information bit group is the bit sequence after block encoding, that is, the encoded output bit sequence.

[0094] The target circular buffer can be a circular buffer dedicated to storing the encoded output bit sequence of the target information bit group, or the target circular buffer can be a circular buffer used to store the encoded output bit sequence of multiple information bit groups.

[0095] In this embodiment, the data transmission efficiency can be improved by selecting the bit sequence corresponding to the target information bit group from the target circular buffer.

[0096] In some embodiments, the method further includes:

[0097] The first device stores the encoded output bit sequence of the N information bit groups into a circular buffer; or,

[0098] The first device stores the encoded output bit sequences of the N information bit groups into N circular buffers respectively; wherein, when the same first parameter is used when encoding the N information bit groups, the length of the N circular buffers is the same; or, when at least one of the first parameters used when encoding the N information bit groups is different, the length of the N circular buffers is different.

[0099] The first parameter includes at least one of the following:

[0100] BG, boost factor, parity check matrix, generator matrix, encoder input block length, encoder output block length, master code rate.

[0101] The first device described above storing the encoded output bit sequence of the N information bit groups into a circular buffer can be understood as using a circular buffer to store the encoded output bit sequence of the N information bit groups, thereby saving buffer overhead.

[0102] In some implementations, the first device stores the encoded output bit sequence of the N information bit groups into a circular buffer, including:

[0103] When the same first parameter is used to encode the N information bit groups, the first device stores the encoded output bit sequence of the N information bit groups into a circular buffer.

[0104] This allows the encoded output bit sequence of N information bit groups to be stored in a circular buffer when the first parameter is the same, which reduces storage complexity and makes reading the bit sequence from the circular buffer less complicated.

[0105] It should be noted that storing the encoded output bit sequence of N information bit groups into a circular buffer can also be applied to scenarios with different first parameters. That is, even with different first parameters, the encoded output bit sequence of N information bit groups can still be stored into a circular buffer.

[0106] In some embodiments, the first device stores the encoded output bit sequence of the N information bit groups into a circular buffer, including:

[0107] The first device stores the encoded output bit sequence of an information bit group into a target circular buffer, and then selects the bit sequence corresponding to the information bit group from the target circular buffer and stores the encoded output bit sequence of another information bit group into the target circular buffer.

[0108] In this implementation, N information bit groups can reuse the same circular buffer, and the bit sequence corresponding to one information bit group is selected before storing the bit sequence corresponding to another information bit group. This can avoid the circular buffer storing too many bit sequences corresponding to information bit groups at the same time, thereby reducing storage complexity.

[0109] In some implementations, storing the encoded output bit sequence of the N information bit groups into a circular buffer can also be done by storing the bit sequences corresponding to different information bit groups into the circular buffer sequentially until the end of the check bit sequence is reached or the circular buffer is full.

[0110] The above-mentioned method of storing the encoded output bit sequences of the N information bit groups into N circular buffers can be implemented by assigning one circular buffer to each information bit group. This allows each circular buffer to store only the bit sequence corresponding to one information bit group, thereby reducing storage complexity and the complexity of selecting the bit sequence. For example, as shown in Figure 4, circular buffer 0 and circular buffer 1 respectively store the encoded output bit sequences of two information bit groups.

[0111] When the same first parameter is used to encode the N information bit groups, the complexity of generating the target signal can be reduced since the lengths of the N cyclic buffers are the same.

[0112] When at least one of the first parameters used in encoding the N information bit groups is different, since the lengths of the N circular buffers are different, the length of the circular buffer corresponding to each information bit group is corresponding to its own first parameter, thereby better supporting the encoding and rate matching of each information bit group and improving the overall transmission performance.

[0113] In some implementations, when the lengths of the N circular buffers are different,

[0114] The length of the circular buffer corresponding to the first information bit group is greater than the length of the circular buffer corresponding to the second information bit group, wherein the code rate corresponding to the first information bit group is higher than the code rate corresponding to the second information bit group.

[0115] Wherein, the first information bit group and the second information bit group are any two of the above N information bit groups, and the target information bit group can be either the first information bit group or the second information bit group.

[0116] In this implementation, the length of the circular buffer corresponding to the high-bit-rate information bit group can be greater than the length of the circular buffer corresponding to the low-bit-rate information bit group. This allows the bit sequence corresponding to the high-bit-rate information bit group to be transmitted faster, thereby improving transmission performance.

[0117] In some implementations, the first device selects the bit sequence corresponding to the target information bit group from the target cyclic buffer according to the redundancy version number corresponding to the target signal, including:

[0118] The first device determines the starting position for selecting bits from the target cyclic buffer based on the redundancy version number corresponding to the target signal, and selects the bit sequence corresponding to the target information bit group from the target cyclic buffer based on the starting position.

[0119] The starting bit associated with the redundancy version number in the target circular buffer can be pre-agreed, configured by the network-side device, or calculated according to calculation rules. For example, for multiple redundancy versions RV0, RV1, ..., RV x-1 Its starting position in the circular buffer n, n = 0, 1, 2, ..., N-1 is The rules for calculating redundancy values ​​can be pre-defined, for example, related to the length of the circular buffer.

[0120] Where the same first parameter is used when encoding the N information bit groups:

[0121] The starting positions associated with the redundant version number are the same in N cyclic buffers, and the N cyclic buffers are respectively used to buffer the encoded output bit sequence of the N information bit groups, or;

[0122] In a circular buffer, the starting positions associated with the redundant version number are the same for different information bit groups, and the circular buffer is used to cache the encoded output bit sequence of the N information bit groups;

[0123] The first parameter includes at least one of the following:

[0124] BG, boost factor, parity check matrix, generator matrix, encoder input block length, encoder output block length, master code rate.

[0125] The above statement that the starting position associated with the redundant version number is the same in N circular buffers can be understood as meaning that for any redundant version number, its starting position associated with it is the same in different circular buffers. x = 0, 1, 2, ..., X-1.

[0126] Since the starting position associated with the redundant version number is the same in the N circular buffers, the bit selection process can be simplified.

[0127] In the above-mentioned circular buffer, the fact that different information bit groups have the same starting position associated with the redundancy version number can be understood as all information bit groups having the same starting position for the same redundancy version number, which simplifies the bit selection process.

[0128] In some implementations, when different first parameters are used when encoding N information bit groups, the starting positions associated with the redundancy version number in the N circular buffers may be the same or different. In a single circular buffer, the starting positions associated with the redundancy version number for different information bit groups may be the same or different.

[0129] In some implementations, the starting position associated with the redundant version number is associated with at least one of the following:

[0130] Increase the boost factor and the length of the target circular buffer.

[0131] The above association can be understood as the starting position being determined based on at least one of the boosting factor and the length of the target circular buffer. For example, the starting position associated with the redundant version number can be determined based on the mapping relationship between at least one of the boosting factor and the length of the target circular buffer and the starting position, or the starting position associated with the redundant version number can be determined by performing relevant calculations based on at least one of the boosting factor and the length of the target circular buffer.

[0132] For example, taking Figure 5 as an example, Figure 5 shows the starting position of the association between different redundant versions of circular buffer 0 and circular buffer 1, as well as the data format of the redundant versions. These represent the starting positions of RV0, RV1, RV2, and RV3 in the circular buffer 0, respectively. These represent the starting positions of RV0, RV1, RV2, and RV3 in the circular buffer 1, respectively. The calculation rules for the value of (n = 0, 1) can be pre-defined, such as the length of the circular buffer. The RV start position is calculated using the same rules for different circular buffers (unifying the calculation method of the RV start position simplifies the bit selection process).

[0133] For example, when the starting intervals of RV are uniform, it can be Alternatively, when the RV starting point interval is non-uniform. Where 0 < γ1 < γ2 < γ3 < 1, more specifically, it can be... Or, for BG1, S0 = 0. For BG2, S0 = 0. in Indicates the boosting factor. This indicates that X is rounded down, and n = 0 or 1 represents the group number. That is, for RV0, its starting position is the same in different circular buffers, while for other RVs, their starting positions are different in different circular buffers.

[0134] In the above embodiments, since the starting position associated with the redundancy version number is associated with at least one of the boost factor and the length of the target circular buffer, the starting position can be matched with the boost factor and the length of the target circular buffer, thereby making the selected bit sequence more reliable and improving transmission performance.

[0135] In some implementations, selecting the bit sequence corresponding to the target information bit group from the target circular buffer based on the starting position includes the following:

[0136] N·E is selected sequentially from the target recurrent buffer according to the starting position. r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0137] Based on the starting position, repeatedly select a length of E from the target recurrent buffer. r The N·E obtained from the bit sequence r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0138] E is selected sequentially from the target recurrent buffer according to the starting position. r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0139] Among them, E r The output code block length is the rate-matched length corresponding to the target information bit group.

[0140] The above N·E rBit sequence representation N·E r bits, the above E r Bit sequence representation E r 1 bit.

[0141] Where the aforementioned target information bit group includes multiple information bit groups, the aforementioned N·E r A bit sequence can be a bit sequence that includes different information bit groups. For example, as shown on the left side of Figure 6, the selected bit sequence includes bit sequences of two information bit groups.

[0142] Where the aforementioned target information bit group includes one information bit group, the aforementioned N·E r A bit sequence can be an N·E sequence that includes the same group of information bits. r Bit sequences, for example, as shown on the right side of Figure 6, include a bit sequence comprising an information bit group.

[0143] The above-mentioned repeated selection of a length of E from the target circular buffer based on the starting position r The N·E obtained from the bit sequence r A bit sequence can be repeated N times to obtain N·E. r Bit sequence.

[0144] In the above embodiments, since N·E is selected r The bit sequence is obtained by obtaining the bit sequence corresponding to the target information bit group. This allows for the transmission of more repeating bit sequences, thereby improving the reliability of transmission.

[0145] The above selection of E from the target circular buffer according to the starting position is as follows. r The bit sequence is obtained by analyzing the bit sequence corresponding to the target information bit group, which allows for the selection of only E bits. r Bit sequence, i.e., only E is transmitted r This reduces the amount of data transmitted by one bit.

[0146] In some implementations, the first device selects the bit sequence corresponding to the target information bit group from the target cyclic buffer according to the redundancy version number corresponding to the target signal, including:

[0147] The first device selects the system bit sequence corresponding to the target information bit group from the target cyclic buffer according to the redundancy version number corresponding to the target signal, and then selects the check bit sequence corresponding to the target information bit group. The bit sequence corresponding to the target information bit group includes the system bit sequence and the check bit sequence.

[0148] In this implementation, the system bit sequence can be selected first, followed by the check bit sequence, so as to prioritize the reliability of the system bit sequence and thus improve the overall transmission reliability.

[0149] As an optional implementation, the value of N is a fixed value; or,

[0150] The value of N is related to the modulation order.

[0151] The aforementioned fixed values ​​can be agreed upon in the protocol or configured by the network-side devices.

[0152] In some implementations, the value of N is 2.

[0153] Since N takes a fixed value, this reduces coding complexity.

[0154] The value of N mentioned above is related to the modulation order, which can be used to determine the number of information bit groups based on the modulation order. For example, for 16-quadrature amplitude modulation (QAM) (modulation order (Q... m =4), the number of information bit groups is 2; for 64QAM(Q m =6), the number of information bit groups is 2 or 3; for 256QAM (Q m =8), the number of information bit groups is 2 or 4; for 1024QAM(Q m =10), the number of information bit groups is 2 or 5.

[0155] Since the value of N is related to the modulation order, this ensures that the number of information bit groups is matched with the modulation order, which is beneficial for improving modulation performance.

[0156] As an optional implementation, when the target information bit group includes multiple information bit groups and the target signal is a retransmission of the multiple information bit groups, the target signal is generated preferentially based on the bit sequence corresponding to the information bit group with the low code rate.

[0157] The target signal mentioned above is generated primarily based on the bit sequence corresponding to the low-bit-rate information bit group. This can be understood as generating the target signal first based on the bit sequence corresponding to the low-bit-rate information bit group, and then generating it based on the bit sequence corresponding to the high-bit-rate information bit group. For example, the target information bit group includes information bit group 0 and information bit group 1, where the bit rate corresponding to information bit group 0 is higher than that corresponding to information bit group 1. The RV transmission order is {0,2,1,3}. The initial RV0 signal is generated and sent based on the encoded output bit set corresponding to information bit group 0 and information bit group 1. During the first retransmission, the RV2 signal is generated and sent based on the encoded output bit set corresponding to information bit group 1. During the second retransmission, the RV2 signal is generated and sent based on the encoded output bit set corresponding to group 0. During the third retransmission, the RV1 signal is generated and sent based on the encoded output bit set corresponding to group 1. During the fourth retransmission, the RV1 signal is generated and sent based on the encoded output bit set corresponding to group 0. During the fifth retransmission, the RV3 signal is generated and sent based on the encoded output bit set corresponding to group 1. During the sixth retransmission, the RV3 signal is generated and sent based on the encoded output bit set corresponding to group 0, and so on.

[0158] Since the data transmission performance of low-bit-rate information bit groups is relatively poor compared to that of high-bit-rate information bit groups, the target signal is generated preferentially based on the bit sequence corresponding to the low-bit-rate information bit group. This is to prioritize the retransmission of the bit sequence of the information bit group with high error rate, thereby improving the overall data transmission performance.

[0159] The following example illustrates the encoding process, as shown in Figure 7, and includes the following steps:

[0160] Step 701: The first device groups the information bit set into N information bit groups, where N is an integer greater than 1;

[0161] Step 702: The first device encodes the N information bit groups using N code rates respectively to obtain the encoded output code blocks of the N information bit groups, wherein the N code rates correspond one-to-one with the N information bit groups.

[0162] Optionally, the value of N is a fixed value; or,

[0163] The value of N is related to the modulation order.

[0164] Optionally, the information bit set is an information bit set with TB ring redundancy check (CRC) added; or

[0165] After obtaining the N information bit groups, CRC is added to each of the N information bit groups.

[0166] Optionally, there may be different code rates among the N code rates, and the average of the N code rates is equal to the code rate of the information bit set.

[0167] Optionally, the above N bitrates are the same.

[0168] Optionally, the N bit rates are determined based on at least one of the following:

[0169] The protocol includes the following: Modulation and coding scheme (MCS) table, MCS level, preset rules, signaling indication, and code rate of the information bit set.

[0170] Optionally, the number of information bits in the N information bit groups is associated with at least one of the following:

[0171] The resource unit number, transmission layer number, modulation order, value of N, code rate corresponding to information bit group, encoder input code block length, and CRC length; wherein, the CRC length includes the following item:

[0172] The length of the added TB CRC, the length of the added CRC for the information bit group, and the length of the added CRC for the encoder input code block.

[0173] Optionally, the first device encodes the N information bit groups using N code rates respectively to obtain the encoded output code blocks of the N information bit groups, including:

[0174] The first device performs code block segmentation on the N information bit groups respectively to obtain code blocks of the N information bit groups;

[0175] The first device encodes the code blocks of the N information bit groups using N code rates respectively, to obtain the encoded output code blocks of the N information bit groups, wherein the N code rates correspond one-to-one with the N information bit groups.

[0176] Optionally, each information bit group includes C code blocks, where C is an integer greater than or equal to 1. The value of C is the number of code blocks determined by code block segmentation of the third information bit group, or the value of C is associated with at least one of the following:

[0177] The number of information bits in the third information bit group, the encoder input code block length, and the CRC length; wherein, the CRC length includes the following item:

[0178] The length of the added TB CRC, the length of the added CRC for the information bit group, and the length of the added CRC for the encoder input code block.

[0179] Optionally, the first device encodes the code blocks of the N information bit groups using N code rates respectively, to obtain the encoded output code blocks of the N information bit groups, including:

[0180] The first device adds CRC to the code blocks of the N information bit groups respectively, and encodes the code blocks of the N information bit groups after adding CRC using N code rates respectively, to obtain the encoded output code blocks of the N information bit groups.

[0181] Optionally, the second parameter for encoding the N information bit groups is the same, and the second parameter includes at least one of the following:

[0182] BG, boost factor, parity check matrix, generator matrix, encoder input block length, encoder output block length, master code rate;

[0183] or,

[0184] The third parameter for encoding the fourth information bit group is determined based on the fourth parameter of the fourth information bit group. The third parameter includes at least one of BG and boost factor. The fourth parameter includes at least one of the following: the code rate, the number of information bits, and the code block length corresponding to the fourth information bit group. The fourth information bit group is any one of the N information bit groups.

[0185] Optionally, when the first parameter for encoding the N information bit groups is the same, at least one of the BG and the boosting factor is determined based on the third information bit group.

[0186] Optionally, the third information bit group is the information bit group with the largest code rate among the N information bit groups.

[0187] Optionally, the N information bit groups include at least one of the following:

[0188] The fifth information bit group whose number of information bits is divisible by 8·C1, wherein C1 is associated with at least one of the following: the number of resource units, the number of transmission layers, the modulation order, the value of N, the code rate corresponding to the fifth information bit group, the length of the encoder input code block, and the length of the CRC added for the encoder input code block.

[0189] The sixth information bit group is the sum of the number of information bits plus the length of the added TB CRC or the CRC length added for the information bit group, which is divisible by 8·C2, where C2 is associated with at least one of the following: the number of resource units, the number of transmission layers, the modulation order, the value of N, the code rate corresponding to the sixth information bit group, the encoder input code block length, and the CRC length added for the encoder input code block.

[0190] Optionally, the first device generates a target signal based on the bit sequence corresponding to the target information bit group:

[0191] The first device performs a target operation based on the bit sequence corresponding to the target information bit group (specifically, the bit sequence in the encoded output code block) to generate a target signal. The target operation includes modulation and further includes at least one of the following: rate matching and interleaving.

[0192] Optionally, each information bit group includes C code blocks, where C is an integer greater than or equal to 1, and the rate matching includes:

[0193] The first device performs rate matching on the encoded output code blocks of the N information bit groups respectively, to obtain C rate-matched output code blocks for each information bit group.

[0194] Optionally, the rate matching satisfies one of the following:

[0195] The first bit sequence of the N information bit groups has the same length;

[0196] The output code block length of the same sequence number in different information bit groups of the N information bit groups is the same for rate matching of the code block of the same sequence number.

[0197] The length of the first bit sequence of the N information bit groups is associated with at least one of the following: the number of resource units, the number of transmission layers, the modulation order, and the value of N;

[0198] Wherein, the length of the first bit sequence is equal to the sum of the C rate-matched output code blocks.

[0199] Optionally, the interlacing includes:

[0200] The first device performs interleaving on the interleaved data, which includes:

[0201] The rate-matched output code block of the N information bit groups; or

[0202] The rate-matched output code blocks of the N information bit groups are concatenated to obtain a code block set. Each code block set is obtained by concatenating N rate-matched output code blocks, and the N rate-matched output code blocks correspond to the N information bit groups respectively.

[0203] Optionally, when the interleaved data includes rate-matched output code blocks of the N information bit groups, the first device interleaves the interleaved data, including: the first device interleaves the rate-matched output code blocks of the N information bit groups in a first order, wherein the rate-matched output code blocks of the N information bit groups are fed into the interleaver in descending order of code rate.

[0204] Optionally, if the interleaved data includes the set of code blocks,

[0205] In any set of code blocks, the output code block with the rate matching of the information bit group with the higher code rate is sent to the interleaver first, and the output code block with the rate matching of the information bit group with the lower code rate is sent to the interleaver later.

[0206] Optionally, when the interleaved data includes rate-matched output code blocks of the N information bit groups, the first device interleaves the interleaved data, including:

[0207] First, the system bits in the rate-matched output code block of the N information bit groups are sent to the interleaver in descending order of code rate. Then, the parity bits in the rate-matched output code block of the N information bit groups are sent to the interleaver in descending order of code rate.

[0208] Optionally, when the interleaved data includes the code block set, the first device interleaves the interleaved data, including:

[0209] In any set of code blocks, the system bits in the output code blocks of each information bit group in the code block set are first sent to the interleaver in descending order of code rate, and then the parity bits in the output code blocks of each information bit group in the code block set are sent to the interleaver in descending order of code rate.

[0210] Optionally, the first device uses a row-column interleaver to interleave the interleaved data, where the interleaver depth or the number of interleaver rows is equal to the modulation order, and the number of columns of the row-column interleaver is equal to the sum of the output code block lengths of the rate-matched N information bit groups.

[0211] It should be noted that the encoding shown in Figure 7 is only an example of the encoding in the signal transmission method provided in the embodiment of this application, and the encoding of N information bit groups is not limited in the embodiment of this application.

[0212] In this embodiment, a first device generates a target signal based on the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is a signal corresponding to a redundant version. The target information bit group is all or part of N information bit groups obtained by grouping the information bit set, and the N information bit groups are encoded using N code rates, where N is an integer greater than 1. The first device then transmits the target signal. Since the target information bit group is all or part of N information bit groups obtained by grouping the information bit set, it supports encoding the N information bit groups using N code rates. Compared to uniformly encoding the information bit set using a single code rate, this embodiment improves the flexibility of information bit encoding and enhances the transmission performance of the device.

[0213] Please refer to Figure 8, which is a flowchart of a signal transmission method provided in an embodiment of this application. As shown in Figure 8, it includes the following steps:

[0214] Step 801: The second device receives the target signal. The bit sequence corresponding to the target signal is the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is the signal corresponding to the redundant version. The target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set. The N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0215] It should be noted that this embodiment is an implementation of the second device corresponding to the embodiment shown in FIG3. For the specific implementation, please refer to the relevant description of the embodiment shown in FIG3. In order to avoid repeated description, this embodiment will not be repeated.

[0216] The methods provided in the embodiments of this application are illustrated below through multiple examples:

[0217] Example 1:

[0218] This embodiment provides a method for generating signals corresponding to redundant versions of transmitted data when data transmission employs a packet-based coding scheme, including:

[0219] The redundant version of the transmitted data is generated based on the bit sequence corresponding to at least one information bit group (i.e., the target information bit group mentioned above). The bit sequence corresponding to the information bit group refers to the set of bits obtained after grouping and encoding the transmitted data block (TB). Different groups use different encoding rates, that is, the above N information bit groups are encoded using N code rates respectively.

[0220] In some implementations, the above-mentioned generation of a signal corresponding to a redundant version of the transmitted data based on a bit sequence corresponding to at least one information bit group includes at least one of the following:

[0221] Generate the signal corresponding to the redundant version based on the bit sequence corresponding to all information bit groups;

[0222] Generate a redundant version of the signal based on the bit sequence corresponding to the partial information bit group.

[0223] In some implementations, the encoded output bit sequence corresponding to multiple information bit groups is stored in at least one circular buffer, and then a rate-matched output bit sequence is selected from the at least one circular buffer. A signal corresponding to the redundant version is generated based on the rate-matched output bit sequence.

[0224] In some implementations, multiple circular buffers corresponding to multiple information bit groups have the same length, or multiple circular buffers corresponding to multiple information bit groups have different lengths.

[0225] Among them, when different information bit groups are encoded using the same BG and boost factor (i.e., when the same parity check matrix H is used), the multiple circular buffers corresponding to multiple information bit groups are of the same size, or multiple information bit groups reuse the same circular buffer.

[0226] When different information bit groups are encoded using LDPC with different BGs or different boosting factors (i.e., different parity check matrices H), the sizes of the multiple circular buffers corresponding to the multiple information bit groups are different, and the length of the circular buffer corresponding to the information bit group with a higher code rate is greater than the length of the circular buffer corresponding to the information bit group with a lower code rate.

[0227] In some implementations, the starting position for selecting bits from the circular buffer is determined based on the redundancy version number, and a rate-matched output bit sequence is obtained by selecting bits from the circular buffer corresponding to each redundancy version number. For example, for multiple redundancy versions RV0, RV1, ..., RV X-1 Its starting position in the circular buffer n, n = 0, 1, 2, ..., N-1 is The rules for calculating redundancy values ​​can be pre-defined, for example, related to the length of the circular buffer.

[0228] In some implementations, when different information bit groups are LDPC encoded using the same BG and boost factor (i.e., using the same parity-check matrix H), the lengths of the circular buffers are the same. Therefore, for any redundant version number, its starting position in different circular buffers is the same. x = 0, 1, 2, ..., X-1.

[0229] In some implementations, different redundant version signals are generated using the same modulation order or different modulation orders (according to the interleaving method given in the block coding scheme, it can be adapted to generate modulation input bit sequences based on different numbers of blocks).

[0230] Example 2:

[0231] In this embodiment, a redundant version of the signal is generated based on a cyclic buffer of the same length or by reusing the same cyclic buffer, which is the target signal mentioned above.

[0232] This embodiment describes the redundant version generation process when using the same BG and boost factor (i.e., using the same parity check matrix H) for LDPC encoding of different information bit groups, where the length of the encoding input code block corresponding to different information bit groups is the same, the length of the encoding output code block (or codeword or mother codeword) corresponding to different information bit groups is the same, and the mother code rate corresponding to different information bit groups is the same.

[0233] As described in the previous embodiments, the rate-matched output bit sequence corresponding to different information bit groups can be determined by using different cyclic buffers.

[0234] The number of information bit groups can be fixed at 2 for different modulation orders, that is, divided into a high code rate group information bit set and a low code rate group information bit set. In this case, for different modulation orders, two circular buffers are used to store the encoded output bit set corresponding to the high code rate information bit group and the encoded output bit set corresponding to the low code rate information bit group respectively.

[0235] Alternatively, the number of blocks can vary depending on the modulation order. For example, for 16QAM, the number of blocks is 2; for 64QAM, the number of information bit blocks is 2 or 3; for 256QAM, the number of information bit blocks is 2 or 4; and for 1024QAM, the number of information bit blocks is 2 or 5. In this case, for different modulation orders, N circular buffers are used to store the encoded output bit sets corresponding to different code rate blocks, where N represents the number of information bit blocks.

[0236] The length of the encoded code block (encoded output bit sequence) corresponding to different information bit groups is n = 0, 1, 2, ..., N-1, where K n For constants associated with LDPC encoding BG, for example: if the current information bit group is BG1, then K n =66, if the current information bit group is BG2, then K n =50; Let H be the boost factor corresponding to different information bit groups. If different information bit groups use the same BG and boost factor during encoding, i.e., LDPC encoding is performed based on the same parity-check matrix H, then the coded code block lengths corresponding to different information bit groups are the same. That is, at this point, the LDPC encoding BG and the boost factor are determined based on the information bits corresponding to the highest bit rate information bit group, including:

[0237] The encoding BG is determined based on the number of information bits (i.e., bit sequence length) or the code rate corresponding to the highest code rate information bit group; the boosting factor Z is determined based on the correlation parameter K0′ of the information code block length after the code block segmentation corresponding to the highest code rate information bit group. c This makes the encoder input bit sequence length K = K b ·Z c ≥K′, where K′ is the associated parameter of the code block length after code block segmentation. B′0 represents the sum of the lengths of all code blocks after the information bits corresponding to block 0 are segmented and CB CRC is added, i.e., B′0 = B0 + C·N CB-CRC N CB-CRC The CRC length added to the code block, where B0 is the information bit length of information bit group 0.

[0238] At this point, the sequence length of each information bit group input to the encoder during LDPC encoding is fixed. Different code rate groups are adapted to the corresponding encoding input bit number requirements by controlling the number of padding bits. For example, based on the highest code rate information bit group 0, BG1 is determined to be used, and the corresponding encoder input bit sequence length for each LDPC encoding is K = 22Z. c Z c If the corresponding boost factor is used, then other information bit groups also use BG1, and the encoder input bit sequence length is also K = 22Z each time LDPC encoding is performed. c Since different information bit groups correspond to different TBsizes, the code block length correlation parameter K′ after code block segmentation also varies. Therefore, bit padding is performed on each code block for different information bit groups to ensure that the encoder input bit sequence length for each code block in LDPC encoding is 22Z. c As shown in Figure 9, taking N=2 groups as an example, bit stuffing is performed on information bit group 0 and information bit group 1 to obtain the encoder input bit sequence. Since the code block length corresponding to information bit group 0 after segmentation is greater than the code block length corresponding to information bit group 1 after segmentation, each code block in information bit group 1 requires more stuffing bits to meet a specific length (e.g., K=22Z) compared to information bit group 0. c The encoder input bit sequence required.

[0239] Taking information bit groups N=2 and code block 0 as an example, the overall process for selecting the corresponding rate-matched output bit sequence is shown in Figure 4 above. Information bit groups 0 and 1 use different coding rates for their corresponding information code blocks during LDPC encoding, with information bit group 0 having a higher code rate than information bit group 1. Information bit groups 0 and 1 can use the same BG and boost factor (i.e., the same parity check matrix H) for LDPC encoding. In this case, the length of the encoded code block 0 corresponding to information bit group 0 is the same as the length of the encoded code block 0 corresponding to information bit group 1, meaning the length of the circular buffer 0 is the same as the length of the circular buffer 1. The encoded output bit sequences corresponding to different groups are sequentially stored in their respective circular buffers until the end of the parity bit sequence is reached or the circular buffer is full (e.g., no remaining available space). Alternatively, information bit group 0 and information bit group 1 can reuse the same circular buffer. That is, for each coded code block, the coded output bit sequence corresponding to information bit group 0 is first stored in the circular buffer, and bit selection is performed to obtain the rate-matched output code block corresponding to information bit group 0. Then, the coded output bit sequence corresponding to information bit group 1 is stored in the circular buffer, and bit selection is performed to obtain the rate-matched output code block corresponding to information bit group 1.

[0240] After obtaining the rate-matched output code block corresponding to information bit group 0 and the rate-matched output code block corresponding to information bit group 1, they are concatenated to obtain code block set 0. That is, the code blocks corresponding to different information bit groups are concatenated in descending order of code rate, that is, the rate-matched output code block corresponding to the information bit group with the higher code rate is placed first, and the rate-matched output code block corresponding to the information bit group with the lower code rate is placed last, so that the rate-matched output code block corresponding to the information bit group with the higher code rate is sent to the interleaver first.

[0241] Then, bit interleaving is performed on each code block set using a row-column interleaver. Data is written row-by-row and read column-by-column, with the interleaver depth (number of rows) equal to the modulation order Q. m The number of interleaver columns corresponding to the r-th code block set is

[0242] The C code block sets (or the corresponding number of code block sets to be transmitted if it is not necessary to transmit the entire code block set) are concatenated to obtain the modulation input bit sequence. The modulation input bit sequence is then subjected to QAM modulation to obtain the redundant version signal to be transmitted, which is the target signal mentioned above.

[0243] Bit selection refers to selecting bits from the corresponding circular buffer based on the output code block length matched to the rate of different information bit groups. Specifically, the length of the bit sequence after rate matching of the (n-th)th code block corresponding to the (r-th)th information bit group is... The calculation method is as follows:

[0244] Where, N L Q represents the transport layer number to which the transport block is mapped. m G is the modulation order. n C' represents the total length of the rate-matched output bit sequence corresponding to each information bit group, and C' represents the number of transmitted code blocks. If all code blocks are transmitted, C' is the number of code blocks after the TB code block is divided. The method for calculating the total length of the rate-matched output bit sequence corresponding to each information bit group is as follows:

[0245] For each information bit group, the total length of the rate-matched output bit sequence (i.e., the sum of the lengths of the C rate-matched output code blocks) is equal, i.e., G0 = G1 = G. It can be seen that for code block r, the length of the rate-matched output code block corresponding to different information bit groups is the same, i.e. (For the scheme in this application, the output code block length corresponding to the rate matching of different information bit groups is uniformly represented as E) r ).

[0246] The specific process of selecting the bits of the (r-th)th code block corresponding to the (n-th)th information bit group can be represented as follows:

[0247] The sequence after rate matching is e k k = 0, 1, 2, ..., E r -1, k0 are the starting positions of different RVs, and we have:

[0248] Where, N cb That is, the length of the circular buffer corresponding to the (r-th)th code block of the (n-th)th information bit group. The length of the circular buffer is related to the length of the encoder output code block, for example... To improve the factor, in this embodiment, Z c This is a common enhancement factor. During bit selection, bits of length E are sequentially read from the circular buffer according to the starting position corresponding to the redundant version. r The bit sequence is processed, and bits that are not transmitted are skipped, such as padding bits.

[0249] In this embodiment, the starting position of the circular buffer is different for different redundancy versions, and the starting interval of each redundancy version can be uniform or non-uniform. Taking a redundancy version of 4 as an example, Figure 10 shows the starting positions of different RVs and the RV data format of circular buffer 0 and circular buffer 1, where S0, S1, S2, and S3 represent the starting positions corresponding to RV0, RV1, RV2, and RV3, respectively. That is, in this embodiment, for any redundancy version number, its starting position is the same in different circular buffers. x = 0, 1, 2, 3. The calculation rules for the values ​​of S0, S1, S2, and S3 can be pre-defined, for example, related to the length N of the circular buffer. cb Related.

[0250] For example, when the starting intervals of RV are uniform, S0 = 0. Alternatively, when the starting interval of RV is non-uniform, S0 = 0. Where 0 < γ1 < γ2 < γ3 < 1, more specifically, it can be S0 = 0. Alternatively, for BG1, S0 = 0. For BG2, S0 = 0. Among them, Z c To improve the factor, This indicates that X is rounded down.

[0251] When transmitting signals corresponding to the redundant version, the transmission order can be in the default order, such as the order of {0,2,1,3}, i.e., RV0 is transmitted first, RV2 is transmitted second, RV1 is transmitted third, and RV3 is transmitted fourth. Alternatively, the transmission order can be based on the order indicated by higher layer signaling, MAC layer signaling, or layer 1 signaling.

[0252] Example 3:

[0253] In this embodiment, redundant versions of signals are generated based on cyclic buffers of different lengths.

[0254] This embodiment describes the redundant version generation process when using different BGs and boost factors (i.e., using the same parity-check matrix H) for LDPC encoding of different information bit groups. That is, different information bit groups correspond to different encoding rates, and the code rate is determined based on the code rates R0, R1, ..., R of each information bit group. N-1 The number of information bits corresponding to each information bit group, B0, B1, ..., B N-1 Alternatively, the length of the code block after segmentation (including the CRC length) corresponding to each information bit group determines the BG and boost factor of the LDPC encoding for different groups. At this point, the BG or boost factor used for different information bit groups during LDPC encoding may be different. Consequently, the encoder output code block lengths of different information bit groups are different, and they need to be stored in circular buffers of different lengths for bit selection.

[0255] Taking the example of N=2 information bit groups and 4 redundant versions, assuming that information bit group 0 and information bit group 1 use the same BG, such as BG1, but use different boost factors, where... That is, at this time, the encoder input bit sequence length requirements are different for different information bit groups, respectively. or, That is, when performing bit stuffing on each information code block corresponding to different information bit groups, the bit stuffing can be performed according to the length of the encoder input bit sequence corresponding to different information bit groups, as shown in Figure 11. At this time, the length of the encoded code block corresponding to information bit group 0 is... The length of the coded code block corresponding to information bit group 1 is The length of the circular buffer 0 is The length of the circular buffer 1 is and

[0256] Figure 5 above illustrates the starting positions associated with different redundant versions of circular buffer 0 and circular buffer 1, as well as the data format of the redundant versions. These represent the starting positions of RV0, RV1, RV2, and RV3 in the circular buffer 0, respectively. These represent the starting positions of RV0, RV1, RV2, and RV3 in the circular buffer 1, respectively. The calculation rules for the value of (n = 0, 1) can be pre-defined, such as the length of the circular buffer. The RV start position is calculated using the same rules for different circular buffers (unifying the calculation method of the RV start position simplifies the bit selection process).

[0257] For example, when the starting intervals of RV are uniform, it can be Alternatively, when the RV starting point interval is non-uniform. Where 0 < γ1 < γ2 < γ3 < 1, more specifically, it can be... Or, for BG1, S0 = 0. For BG2, S0 = 0. in Indicates the boosting factor. This indicates that X is rounded down, and n = 0 or 1 represents the group number. That is, for RV0, its starting position is the same in different circular buffers, while for other RVs, their starting positions are different in different circular buffers.

[0258] The bit sequence lengths after rate matching for different information bit groups are the same, that is... When selecting bits, based on the starting position of the corresponding RV, bits of length E are sequentially selected from the circular buffers corresponding to different groups. r The bit sequence is then used. The rate-matched output bit sequences corresponding to different information bit groups are then concatenated to obtain the code block set. The code block sets are then interleaved, and the interleaved code block sets are concatenated to obtain the modulation input bit sequence, as in Example 2.

[0259] Example 4:

[0260] In this embodiment, a signal corresponding to the redundant version is generated based on the bit sequence corresponding to a partial information bit group.

[0261] This embodiment describes the method of generating a redundant version signal based on the encoded output bit sequence corresponding to a portion of the information bit groups. That is, in this embodiment, when retransmitting data, it is not necessary to retransmit the data corresponding to all information bit groups, but only the data corresponding to a portion of the information bit groups. Therefore, when generating the signal corresponding to the redundant version of the retransmitted data, it is only necessary to generate the signal based on the encoded output bit sequence corresponding to the information bit groups that need to be retransmitted.

[0262] Taking the example of N=2 information bit groups and 4 redundant versions, assuming the current redundant version is RV1, and the receiving device has correctly decoded the transmitted data corresponding to information bit group 0 based on the previous redundant versions, then when generating the signal corresponding to RV1, it only needs to be generated based on the encoded output bit sequence corresponding to information bit group 1. Taking code block r as an example, the initial transmission bit selection and retransmission bit selection are illustrated in Figure 6 above. During retransmission, bits are selected from the circular buffer 1 according to the starting position of RV1, and the resulting bits are selected sequentially to obtain a length of 2·E. r The bit sequence, r is the code block number. In this embodiment, compared with embodiment 1 or embodiment 2, the code block set r only contains the rate-matched output code block r corresponding to information bit group 1, and the length of the rate-matched output code block r corresponding to group 1 is 2·E. r .

[0263] Then, bit interleaving is performed on the code block set, that is, for the code block set of length 2·E rBit interleaving is performed on the bit sequence, and C code block sets (if it is not necessary to transmit the entire code block set, then select the corresponding number of code block sets that need to be transmitted) are concatenated to obtain the modulation input bit sequence. The modulation input bit sequence is then QAM modulated to obtain the redundant version signal to be transmitted.

[0264] Alternatively, during retransmission, bits can be selected from the circular buffer based on the starting position of RV1, with the selected bit sequence having a length of E. r And by repeating the selection twice, a length of 2·E is obtained. r The bit sequence. That is, at this time, the code block set r contains only the rate-matched output code block r corresponding to information bit group 1, and the length of the rate-matched output code block r corresponding to information bit group 1 is 2·E. r .

[0265] Compared to generating a redundant version of the signal based on the encoded output bit sequence corresponding to all information bit groups, generating a redundant version of the signal based on the encoded output bit sequence corresponding to a portion of the information bit groups during retransmission can improve retransmission performance by transmitting more information corresponding to the less efficient information bit groups.

[0266] Alternatively, during retransmission, bits can be selected from the circular buffer based on the starting position of RV1, with the selected bit sequence having a length of E. r 'r' is the code block number, meaning that the code block set 'r' at this time contains only the rate-matched output code block 'r' corresponding to information bit group 1, and the length of the rate-matched output code block 'r' corresponding to information bit group 1 is E. r The length of the output code block r corresponding to the rate-matched information bit group 1 is 2·E. r In this case, the amount of data retransmitted can be reduced.

[0267] More generally, the number of information bit groups N = Q m / 2, and only needs to be based on a portion of Q m When performing data retransmission, if the partial packet includes information bit group n′, then the coded code block r corresponding to information bit group n′ can be selected with a length greater than or equal to E during rate matching. r A bit sequence, for example, selecting a length of A n′ ·E r The rate-matched output bit sequence, where A n′ A is a positive integer greater than or equal to 1. n′ The proportion of the bit set corresponding to the information bit group n′ in the code block set r can use a default value, such as A. n′ =1, or, when the redundant version signal is generated only based on the set of bits corresponding to the information bit group n′, A n′=N, or A can be determined based on the instruction information in the signaling. n′ The value of .

[0268] The retransmitted information bit group (such as the target information bit group mentioned above) can be determined based on the indication information in the signaling. For example, the signal corresponding to the redundant version can be generated based on the bit set corresponding to which information bit group is determined according to the bitmap indication information. The bitmap indication information is a 2-bit indication information (when the number of groups corresponding to different modulation orders is uniformly 2) or Q. m / 2 bits indicate information.

[0269] Alternatively, specific information bit groups may be prioritized for retransmission by default. For example, the data transmission performance of low-bit-rate groups is relatively poor compared to high-bit-rate groups. Therefore, during each data retransmission, redundant version signals are generated based on the encoded output bit set corresponding to the low-bit-rate group. For instance, with two information bit groups and the RV transmission order {0,2,1,3}, the initial RV0 signal is generated and sent based on the encoded output bit sets corresponding to information bit groups 0 and 1. During the first retransmission, RV2 is generated and sent based on the encoded output bit set corresponding to information bit group 1; during the second retransmission, RV2 is generated and sent based on the encoded output bit set corresponding to information bit group 0; during the third retransmission, RV1 is generated and sent based on the encoded output bit set corresponding to information bit group 1; during the fourth retransmission, RV1 is generated and sent based on the encoded output bit set corresponding to information bit group 0; during the fifth retransmission, RV3 is generated and sent based on the encoded output bit set corresponding to information bit group 1; during the sixth retransmission, RV3 is generated and sent based on the encoded output bit set corresponding to information bit group 0…

[0270] Example 5:

[0271] This embodiment provides the specific processes of block coding, rate matching, and interleaving. The processing flow is shown in Figure 12, including:

[0272] Step 1: Divide the set of information bits to be transmitted (e.g., TB) into N information bit groups.

[0273] The set of information bits to be transmitted refers to the TB after adding TB CRC, which is divided into N information bit groups;

[0274] Alternatively, the TB without TB CRC can be grouped first, and then CRC can be added to the information bit set of each group.

[0275] The number of groups is fixed, and can be N=2; or, the number of groups is proportional to the modulation order Q.m Correlation, for example, for 16QAM(Q m =4), the number of groups is 2; for 64QAM(Q m =6), the number of groups is 2 or 3; for 256QAM(Q m =8), the number of groups is 2 or 4; for 1024QAM(Q m =10), the number of groups is 2 or 5.

[0276] The number of information bits corresponding to different information bit groups is determined based on at least one of the following: the number of resource units, the number of transmission layers, the modulation order, the number of blocks, and the block code rate.

[0277] The code rate R of each information bit group n (n=0,1,2,…,N-1) are the same or different, and the code rate R of each information bit group is determined. n For n = 0, 1, 2, ..., N-1, the code rate of each information bit group satisfies (or ), where R is the overall data transmission rate, i.e., the rate of the information bit set.

[0278] Step 2: Divide the information bits corresponding to the N information bit groups into code blocks.

[0279] In this case, the number of code blocks obtained after code block segmentation is the same for different information bit groups, that is, C code blocks are obtained after code block segmentation of the information bits corresponding to each information bit group; specifically, code block segmentation can be performed according to the information bits corresponding to the information bit group with the highest code rate and the number of code blocks C is determined, and the information bits corresponding to other information bit groups are segmented according to the number of code blocks C.

[0280] Step 3: Encode the information bit sets of different information bit groups according to their respective code rates, such as LDPC encoding.

[0281] Optionally, CB CRC is added to the code blocks corresponding to different information bit groups, and they are encoded according to their respective code rates, so that each information bit group corresponds to C encoded output code blocks.

[0282] Optionally, LDPC encoding is performed on N information bit groups to satisfy at least one of the following:

[0283] When LDPC encoding the information bit sets corresponding to different information bit groups, the same LDPC BG and boost factor Z are used.

[0284] The same parity check matrix H is used when LDPC encoding the information bit sets corresponding to different information bit groups;

[0285] Different information bit groups correspond to the same encoded input code block length;

[0286] The encoder output code block length is the same for different information bit groups;

[0287] The mother code rate is the same for different information bit groups.

[0288] Step 4: Rate matching of the encoded output code blocks corresponding to different information bit groups.

[0289] Optionally, the total length of the rate-matched output bit sequence corresponding to different information bit groups (i.e., the sum of the lengths of the C rate-matched output code blocks) is equal;

[0290] Optionally, the total length of the rate-matched output bit sequence corresponding to different information bit groups is determined based on at least one of the following: the number of resource units, the number of transmission layers, the modulation order, and the number of groups.

[0291] Step 5: Concatenate the rate-matched code blocks corresponding to different information bit groups to obtain C code block sets. Each code block set contains N code blocks corresponding to different code rate groups.

[0292] Information bit groups are concatenated with code blocks corresponding to different information bit groups in descending order of code rate. That is, the code blocks output by rate matching corresponding to information bit groups with high code rate are placed first, and the code blocks output by rate matching corresponding to information bit groups with low code rate are placed later, so that the code blocks output by rate matching corresponding to information bit groups with high code rate are sent to the interleaver first.

[0293] Step 6: Perform bit interleaving on each concatenated code block set.

[0294] Interleaving is performed on a per-block basis, using a row-column interleaver, where the interleaver depth (number of rows) equals the modulation order Q. m .

[0295] In some implementations, to ensure that the system bits of each information bit group are fed into the interleaver first, followed by the parity bits, bit selection can be divided into two rounds. In the first round, the system bits to be transmitted are selected from N circular buffers, and in the second round, the parity bits to be transmitted are selected from N circular buffers. Each round of bit selection follows the order of high-rate groups followed by low-rate groups.

[0296] As shown in Figure 13, taking the number of information bit groups N=2 as an example, when selecting bits, first select the system bits to be transmitted from the circular buffer 0 (which stores the encoded output bits of group 0), then select the system bits to be transmitted from the circular buffer 1 (which stores the encoded output bits of group 1), then select the parity bits to be transmitted from the circular buffer 0 (which stores the encoded output bits of group 0), and then select the parity bits to be transmitted from the circular buffer 1 (which stores the encoded output bits of group 1).

[0297] Step 7: Concatenate the interleaved data, that is, concatenate the code block sets to obtain the modulation input bits.

[0298] Step 8: Perform QAM modulation on the modulated input bit sequence to obtain the target signal and send it.

[0299] Modulated with 256QAM, modulation order Q m Taking 8 as an example, each modulation symbol contains 8 bits. The reliability of these 8 bits can be divided into 4 levels, with every two bits having the same reliability. The information bits to be transmitted are divided into 4 information bit groups based on the modulation order. During QAM modulation, the bit set corresponding to each information bit group is mapped to 2 bits with the same reliability. Assuming each information bit group uses the same code rate, the error rate of the corresponding code block is statistically analyzed. The results are shown in Figure 14a, where 1401, 1402, 1403, and 1404 represent the performance curves corresponding to the 4 information bit groups. It can be seen that the bit sets corresponding to different information bit groups have significantly different block error rates because they are mapped to bits with different reliability during modulation.

[0300] To simplify the encoding and decoding process, the information bits to be transmitted can be divided into two information bit groups. The bit set corresponding to one information bit group is mapped to the four bits with lower reliability during adjustment, while the bit set corresponding to the other code rate group is placed into the four bits with higher reliability during QAM modulation.

[0301] When the fixed number of blocks is 2, assuming that each information bit group uses the same code rate, the error rate of the code block corresponding to each information bit group is statistically analyzed, and the results are shown in Figure 14b. In this figure, 1405 and 1406 represent the performance curves corresponding to the two information bit groups, respectively. It can be seen that the bit sets corresponding to different information bit groups are mapped to bits with different reliability during modulation. Although there is no one-to-one mapping between each group and bits with different reliability as in the case of 4 blocks, the performance of their block error rate still has a large difference.

[0302] Therefore, in practical processing, different modulation orders are grouped in a unified way, that is, divided into 2 groups and mapped to Q with higher overall reliability respectively. m / 2 bits and Q with low overall reliability m Using 2 bits can improve data transmission performance by allocating an appropriate code rate to the two information bit groups, and also simplifies the encoding and decoding process. The specific processing flow of the corresponding block coding, rate matching, and interleaving methods is shown in Figure 15.

[0303] When LDPC encoding different information bit groups, the encoding rate can be determined based on the encoding rates R0, R1, ..., R of each group. N-1 The number of information bits corresponding to each group, B0, B1, ..., B N-1 Alternatively, the length of the code block after segmentation (including CRC length) corresponding to each group determines the base graph (BG) and boosting factor of the LDPC encoding for different groups. Alternatively, different groups can use the same LDPC encoding base graph (BG) and boost factor Z. This means that the same parity-check matrix H is used when LDPC encoding the information bit sets corresponding to different groups. In this case, the input code block length, the encoder output code block length, and the master code rate are the same for different groups. Specifically, the LDPC encoding base graph (BG) and boost factor are determined based on the information bit set corresponding to the highest code rate group. This includes: determining the encoding base graph BG based on the number of information bits (i.e., bit sequence length) or code rate corresponding to the highest code rate group; and determining the boost factor Z based on the code block length association parameter K0′ after code block segmentation corresponding to the highest code rate group. c This makes the encoder input bit sequence length K = K b ·Z c ≥K′, where K′ is the associated parameter of the code block length after code block segmentation. B′0 represents the sum of the lengths of all code blocks after the set of information bits corresponding to block 0 is divided into code blocks and CB CRC is added, i.e., B′0 = B0 + C·N CB-CRC .

[0304] At this time, the sequence length of each information bit group input to the encoder during LDPC encoding is fixed. Different code rate groups are adapted to the corresponding encoding input bit number requirements by controlling the number of padding bits.

[0305] Taking a scenario with 2 information bit groups, 256QAM modulation, and an overall data transmission code rate of 0.7 as an example, the BLER performance comparison between the scheme in this embodiment and the scheme without information bit group processing under fading channels is shown in Figures 16 and 17. Figure 16 corresponds to different information bit groups having their own BG and boost factor determined during encoding, while Figure 17 corresponds to different groups using a unified BG and boost factor during encoding. It can be seen that for different information bit group code rate allocation schemes (including group 0 code rate of 0.8, group 1 code rate of 0.6; group 0 code rate of 0.82, group 1 code rate of 0.58; group 0 code rate of 0.84, group 1 code rate of 0.56), specifically corresponding to 1601, 1602, 1603 and 1701, 1702, 1703 in the figure, there are differences in BLER performance, and compared with the scheme without group processing (NR baseline coding scheme, specifically corresponding to 1604 and 1704 in the figure), a performance improvement can be obtained.

[0306] This application provides a data retransmission method based on block coding, which improves the redundant version signal generation process to support block coding schemes. It includes generating a signal corresponding to the redundant version of the transmitted data based on the bit set corresponding to at least one information bit group. The bit sequence corresponding to the information bit group refers to the bit sequence obtained after block coding of the transmitted data block (TB). Different information bit groups can use different code rates. Different methods for selecting data bits for redundant versions are given, along with an associated circular buffer scheme, which can improve data transmission performance, avoid introducing a complex bit selection process, be compatible with block coding schemes, and reduce processing overhead.

[0307] The signal transmission method provided in this application can be executed by a signal transmission device. This application uses an example of a signal transmission device executing the signal transmission method to illustrate the signal transmission device provided in this application.

[0308] This application provides a signal transmission device. As an example, the signal transmission device may be a communication device or a component within a communication device, such as a chip. The communication device may be a terminal, a network-side device, or a server, etc. Exemplarily, the terminal may include, but is not limited to, the type of terminal 11 listed above, and the network-side device may include, but is not limited to, the type of network-side device 12 listed above. This application does not impose specific limitations.

[0309] The signal transmission device may include a receiving module, a transmitting module, and a processing module. These modules can be implemented in software or hardware. When implemented in hardware, the processing module can be implemented by a processor. For example, the processor may include a general-purpose processor, a special-purpose processor, such as a Central Processing Unit (CPU), a microprocessor, a Digital Signal Processor (DSP), an Artificial Intelligence (AI) processor, a Graphics Processing Unit (GPU), an Application Specific Integrated Circuit (ASIC), a Network Processor (NP), a Field Programmable Gate Array (FPGA), or other programmable logic devices, gate circuits, transistors, discrete hardware components, etc. The receiving and transmitting modules may be implemented by a communication interface, which may include one or more of the following: a transceiver, pins, circuits, a bus, and a radio frequency unit.

[0310] Specifically, referring to Figure 18, when the signal transmission device is a terminal or a component within a terminal, or when the signal transmission device is a network-side device or a component within a network-side device, the signal transmission device 1800 includes:

[0311] The processing module 1801 is used to generate a target signal based on the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is the signal corresponding to the redundant version. The target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set. The N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0312] The transmitting module 1802 is used to transmit the target signal.

[0313] Optionally, the processing module 1801 is further configured to select a bit sequence corresponding to the target information bit group from the target cyclic buffer according to the redundancy version number corresponding to the target signal, wherein the target cyclic buffer is a cyclic buffer that stores the encoded output bit sequence of the target information bit group.

[0314] Optionally, the processing module 1801 is also used for:

[0315] Store the encoded output bit sequence of the N information bit groups into a circular buffer; or...

[0316] The encoded output bit sequences of the N information bit groups are respectively stored in N circular buffers; wherein, when the same first parameter is used when encoding the N information bit groups, the length of the N circular buffers is the same; or, when at least one of the first parameters used when encoding the N information bit groups is different, the length of the N circular buffers is different.

[0317] The first parameter includes at least one of the following:

[0318] Encoding base map (BG), boost factor, parity check matrix, generator matrix, encoder input block length, encoder output block length, and master code rate.

[0319] Optionally, if the lengths of the N circular buffers are different,

[0320] The length of the circular buffer corresponding to the first information bit group is greater than the length of the circular buffer corresponding to the second information bit group, wherein the code rate corresponding to the first information bit group is higher than the code rate corresponding to the second information bit group.

[0321] Optionally, the processing module 1801 is configured to store the encoded output bit sequence of the N information bit groups into a circular buffer when the same first parameter is used when encoding the N information bit groups.

[0322] Optionally, the processing module 1801 is used to store the encoded output bit sequence of an information bit group into a target circular buffer, and then, after selecting the bit sequence corresponding to the information bit group from the target circular buffer, store the encoded output bit sequence of another information bit group into the target circular buffer.

[0323] Optionally, the processing module 1801 is used to determine the starting position for selecting bits from the target cyclic buffer based on the redundancy version number corresponding to the target signal, and select the bit sequence corresponding to the target information bit group from the target cyclic buffer based on the starting position.

[0324] Alternatively, if the same first parameter is used when encoding the N information bit groups:

[0325] The starting positions associated with the redundant version number are the same in N cyclic buffers, and the N cyclic buffers are respectively used to buffer the encoded output bit sequence of the N information bit groups, or;

[0326] In a circular buffer, the starting positions associated with the redundant version number are the same for different information bit groups, and the circular buffer is used to cache the encoded output bit sequence of the N information bit groups;

[0327] The first parameter includes at least one of the following:

[0328] BG, boost factor, parity check matrix, generator matrix, encoder input block length, encoder output block length, master code rate.

[0329] Optionally, the starting position associated with the redundant version number is associated with at least one of the following:

[0330] Increase the boost factor and the length of the target circular buffer.

[0331] Optionally, the processing module 1801 is used for one of the following:

[0332] N·E is selected sequentially from the target recurrent buffer according to the starting position. r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0333] Based on the starting position, repeatedly select a length of E from the target recurrent buffer. r The N·E obtained from the bit sequence r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0334] E is selected sequentially from the target recurrent buffer according to the starting position. r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0335] Among them, E r The output code block length is the rate-matched length corresponding to the target information bit group.

[0336] Optionally, the value of N is a fixed value; or,

[0337] The value of N is related to the modulation order.

[0338] Optionally, when the target information bit group includes multiple information bit groups, and the target signal is a retransmission of the multiple information bit groups, the target signal is generated preferentially based on the bit sequence corresponding to the information bit group with the low code rate.

[0339] Optionally, the processing module 1801 is used to select the system bit sequence corresponding to the target information bit group from the target cyclic buffer according to the redundancy version number corresponding to the target signal, and then select the check bit sequence corresponding to the target information bit group, wherein the bit sequence corresponding to the target information bit group includes the system bit sequence and the check bit sequence.

[0340] The aforementioned signal transmission device can improve the flexibility of information bit encoding, which is beneficial to improving the transmission performance of the equipment.

[0341] The signal transmission device provided in this application embodiment can implement the various processes implemented in the method embodiment of FIG3 and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0342] Specifically, referring to Figure 19, when the signal transmission device is a terminal or a component within a terminal, or when the signal transmission device is a network-side device or a component within a network-side device, the signal transmission device 1900 includes:

[0343] The receiving module 1901 is used to receive a target signal, wherein the bit sequence corresponding to the target signal is the bit sequence corresponding to the target information bit group, the target signal is used to transmit data and is the signal corresponding to the redundant version, and the target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set, and the N information bit groups are encoded using N code rates respectively, where N is an integer greater than 1.

[0344] The aforementioned signal transmission device can improve the flexibility of information bit encoding, which is beneficial to improving the transmission performance of the equipment.

[0345] The signal transmission device provided in this application embodiment can implement the various processes implemented in the method embodiment of FIG8 and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0346] As shown in Figure 20, this application embodiment also provides a communication device 2000, including a processor 2001 and a memory 2002. The memory 2002 stores a program or instructions that can run on the processor 2001. For example, when the communication device 2000 is a first device, when the program or instructions are executed by the processor 2001, they implement the various steps of the signal transmission method embodiment on the first device side described above, and achieve the same technical effect. When the communication device 2000 is a second device, when the program or instructions are executed by the processor 2001, they implement the various steps of the signal transmission method embodiment on the second device side described above, and achieve the same technical effect. To avoid repetition, this will not be repeated here.

[0347] This application also provides a device including a processor and a communication interface. The communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the steps of the method embodiment shown in FIG3. This device embodiment corresponds to the above-described signal transmission method embodiment. All implementation processes and methods of the above-described method embodiments can be applied to this device embodiment and can achieve the same technical effect.

[0348] This application also provides a device including a processor and a communication interface. The communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the steps in the method embodiment shown in FIG3. This device embodiment corresponds to the above-described signal transmission method embodiment. All implementation processes and methods of the above-described method embodiments can be applied to this device embodiment and achieve the same technical effect. This device can be the signal transmission device shown in FIG18. Specifically, FIG21 is a schematic diagram of the hardware structure of a terminal implementing an embodiment of this application.

[0349] The terminal 2100 includes, but is not limited to, at least some of the following components: radio frequency unit 2101, network module 2102, audio output unit 2103, input unit 2104, sensor 2105, display unit 2106, user input unit 2107, interface unit 2108, memory 2109, and processor 2110.

[0350] Those skilled in the art will understand that terminal 2100 may also include a power supply (such as a battery) for powering various components. The power supply can be logically connected to processor 2110 through a power management system, thereby enabling functions such as managing charging, discharging, and power consumption through the power management system. The terminal structure shown in Figure 21 does not constitute a limitation on the terminal. The terminal may include more or fewer components than shown, or combine certain components, or have different component arrangements, which will not be elaborated here.

[0351] It should be understood that, in this embodiment, the input unit 2104 may include a graphics processor 21041 and a microphone 21042. The graphics processor 21041 processes image data of still images or videos obtained by an image capture device (such as a camera) in video capture mode or image capture mode. The display unit 2106 may include a display panel 21061, which may be configured in the form of a liquid crystal display, an organic light-emitting diode, or the like. The user input unit 2107 includes at least one of a touch panel 21071 and other input terminals 21072. The touch panel 21071 is also called a touch screen. The touch panel 21071 may include a touch detection device and a touch controller. Other input terminals 21072 may include, but are not limited to, physical keyboards, function keys (such as volume control buttons, power buttons, etc.), trackballs, mice, and joysticks, which will not be described in detail here.

[0352] In this embodiment, after receiving downlink data from the network-side terminal, the radio frequency unit 2101 can transmit it to the processor 2110 for processing; in addition, the radio frequency unit 2101 can send uplink data to the network-side terminal. Typically, the radio frequency unit 2101 includes, but is not limited to, antennas, amplifiers, transceivers, couplers, low-noise amplifiers, duplexers, etc.

[0353] The memory 2109 can be used to store software programs or instructions, as well as various data. The memory 2109 may primarily include a first storage area for storing programs or instructions and a second storage area for storing data. The first storage area may store the operating system, application programs or instructions required for at least one function (such as sound playback, image playback, etc.). Furthermore, the memory 2109 may include volatile memory or non-volatile memory. The non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct memory bus RAM (DRRAM). The memory 2109 in the embodiments of this application includes, but is not limited to, these and any other suitable types of memory.

[0354] Processor 2110 may include one or more processing units; optionally, processor 2110 integrates an application processor and a modem processor, wherein the application processor mainly handles operations involving the operating system, user interface, and applications, and the modem processor mainly handles wireless communication signals, such as a baseband processor. It is understood that the aforementioned modem processor may also not be integrated into processor 2110.

[0355] The processor 2110 is used to generate a target signal based on the bit sequence corresponding to the target information bit group. The target signal is used to transmit data and is the signal corresponding to the redundant version. The target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set. The N information bit groups are encoded using N code rates, where N is an integer greater than 1.

[0356] Radio frequency unit 2101 is used to transmit the target signal.

[0357] Optionally, the processor 2110 is further configured to select a bit sequence corresponding to the target information bit group from the target cyclic buffer according to the redundancy version number corresponding to the target signal, wherein the target cyclic buffer is a cyclic buffer that stores the encoded output bit sequence of the target information bit group.

[0358] Optionally, the processor 2110 is also used for:

[0359] Store the encoded output bit sequence of the N information bit groups into a circular buffer; or...

[0360] The encoded output bit sequences of the N information bit groups are respectively stored in N circular buffers; wherein, when the same first parameter is used when encoding the N information bit groups, the length of the N circular buffers is the same; or, when at least one of the first parameters used when encoding the N information bit groups is different, the length of the N circular buffers is different.

[0361] The first parameter includes at least one of the following:

[0362] Encoding base map (BG), boost factor, parity check matrix, generator matrix, encoder input block length, encoder output block length, and master code rate.

[0363] Optionally, if the lengths of the N circular buffers are different,

[0364] The length of the circular buffer corresponding to the first information bit group is greater than the length of the circular buffer corresponding to the second information bit group, wherein the code rate corresponding to the first information bit group is higher than the code rate corresponding to the second information bit group.

[0365] Optionally, storing the encoded output bit sequence of the N information bit groups into a circular buffer includes:

[0366] When encoding the N information bit groups using the same first parameter, the encoded output bit sequence of the N information bit groups is stored in a circular buffer.

[0367] Optionally, storing the encoded output bit sequence of the N information bit groups into a circular buffer includes:

[0368] The encoded output bit sequence of one information bit group is stored in the target circular buffer. Then, after selecting the bit sequence corresponding to the one information bit group from the target circular buffer, the encoded output bit sequence of another information bit group is stored in the target circular buffer.

[0369] Optionally, selecting the bit sequence corresponding to the target information bit group from the target cyclic buffer based on the redundancy version number corresponding to the target signal includes:

[0370] The starting position for selecting bits from the target cyclic buffer is determined based on the redundancy version number corresponding to the target signal, and the bit sequence corresponding to the target information bit group is selected from the target cyclic buffer based on the starting position.

[0371] Alternatively, if the same first parameter is used when encoding the N information bit groups:

[0372] The starting positions associated with the redundant version number are the same in N cyclic buffers, and the N cyclic buffers are respectively used to buffer the encoded output bit sequence of the N information bit groups, or;

[0373] In a circular buffer, the starting positions associated with the redundant version number are the same for different information bit groups, and the circular buffer is used to cache the encoded output bit sequence of the N information bit groups;

[0374] The first parameter includes at least one of the following:

[0375] BG, boost factor, parity check matrix, generator matrix, encoder input block length, encoder output block length, master code rate.

[0376] Optionally, the starting position associated with the redundant version number is associated with at least one of the following:

[0377] Increase the boost factor and the length of the target circular buffer.

[0378] Optionally, selecting the bit sequence corresponding to the target information bit group from the target circular buffer based on the starting position includes the following:

[0379] N·E is selected sequentially from the target recurrent buffer according to the starting position. r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0380] Based on the starting position, repeatedly select a length of E from the target recurrent buffer. r The N·E obtained from the bit sequence r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0381] E is selected sequentially from the target recurrent buffer according to the starting position. r Bit sequence, to obtain the bit sequence corresponding to the target information bit group;

[0382] Among them, E r The output code block length is the rate-matched length corresponding to the target information bit group.

[0383] Optionally, the value of N is a fixed value; or,

[0384] The value of N is related to the modulation order.

[0385] Optionally, when the target information bit group includes multiple information bit groups, and the target signal is a retransmission of the multiple information bit groups, the target signal is generated preferentially based on the bit sequence corresponding to the information bit group with the low code rate.

[0386] Optionally, selecting the bit sequence corresponding to the target information bit group from the target cyclic buffer based on the redundancy version number corresponding to the target signal includes:

[0387] Based on the redundancy version number corresponding to the target signal, the system bit sequence corresponding to the target information bit group is selected from the target cyclic buffer, and then the check bit sequence corresponding to the target information bit group is selected. The bit sequence corresponding to the target information bit group includes the system bit sequence and the check bit sequence.

[0388] The aforementioned terminals can improve the flexibility of information bit encoding, which is beneficial to improving the transmission performance of the equipment.

[0389] It is understood that the implementation process of each implementation method mentioned in this embodiment can refer to the relevant description of the signal transmission method embodiment and achieve the same or corresponding technical effects. To avoid repetition, it will not be described again here.

[0390] It should be noted that the above embodiments are illustrated by taking the first device as a terminal. In some implementations, the above terminal can also perform the steps in the method embodiment shown in FIG8 and achieve the same beneficial effects.

[0391] This application also provides a device including a processor and a communication interface. The communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the steps in the method embodiment shown in FIG8. This device embodiment corresponds to the above-described signal transmission method embodiment. All implementation processes and methods of the above-described method embodiments can be applied to this device embodiment and can achieve the same technical effect.

[0392] Specifically, this application embodiment also provides a network-side device, which can be the signal transmission device shown in FIG19. As shown in FIG22, the device 2200 includes: an antenna 2201, a radio frequency device 2202, a baseband device 2203, a processor 2204, and a memory 2205. The antenna 2201 is connected to the radio frequency device 2202. In the uplink direction, the radio frequency device 2202 receives information through the antenna 2201 and sends the received information to the baseband device 2203 for processing. In the downlink direction, the baseband device 2203 processes the information to be transmitted and sends it to the radio frequency device 2202, which processes the received information and then transmits it through the antenna 2201.

[0393] The methods executed by the device in the above embodiments can be implemented in the baseband device 2203, which includes a baseband processor.

[0394] The baseband device 2203 may include at least one baseband board, on which multiple chips are disposed, as shown in FIG22. One of the chips is, for example, a baseband processor, which is connected to the memory 2205 via a bus interface to call the program in the memory 2205 and execute the network device operation shown in the above method embodiment.

[0395] The device may also include a network interface 2206, such as a Common Public Radio Interface (CPRI).

[0396] Specifically, the device 2200 in this application embodiment further includes: instructions or programs stored in memory 2205 and executable on processor 2204. Processor 2204 calls the instructions or programs in memory 2205 to execute the methods executed by each module shown in FIG19 and achieve the same technical effect. To avoid repetition, it will not be described in detail here.

[0397] Radio frequency device 2202 is used to receive a target signal, wherein the bit sequence corresponding to the target signal is the bit sequence corresponding to the target information bit group, the target signal is used to transmit data and is the signal corresponding to the redundant version, and the target information bit group is all or part of the information bit groups in N information bit groups obtained by grouping the information bit set, and the N information bit groups are encoded using N code rates respectively, where N is an integer greater than 1.

[0398] The aforementioned equipment can improve the flexibility of information bit encoding, which is beneficial to improving the transmission performance of the equipment.

[0399] It is understood that the implementation process of each implementation method mentioned in this embodiment can refer to the relevant description of the signal transmission method embodiment and achieve the same or corresponding technical effects. To avoid repetition, it will not be described again here.

[0400] It should be noted that the above embodiments are illustrative examples of network-side devices as the first device. In some implementations, the terminal may also perform the steps in the method embodiments shown in FIG3 and achieve the same beneficial effects.

[0401] This application also provides a readable storage medium storing a program or instructions. When the program or instructions are executed by a processor, they implement the various processes of the above-described signal transmission method embodiments and achieve the same technical effects. To avoid repetition, they will not be described again here.

[0402] The processor mentioned above is the processor in the terminal described in the above embodiments. The readable storage medium includes computer-readable storage media, such as computer read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk. In some examples, the readable storage medium may be a non-transient readable storage medium.

[0403] This application embodiment also provides a chip, which includes a processor and a communication interface. The communication interface is coupled to the processor. The processor is used to run programs or instructions to implement the various processes of the above signal transmission method embodiments and can achieve the same technical effect. To avoid repetition, it will not be described again here.

[0404] It should be understood that the chip mentioned in the embodiments of this application may also be referred to as a system-on-a-chip, system chip, chip system, or system-on-a-chip, etc.

[0405] This application also provides a computer program / program product, which is stored in a storage medium and executed by at least one processor to implement the various processes of the above-described signal transmission method embodiments, and can achieve the same technical effect. To avoid repetition, it will not be described again here.

[0406] This application also provides a wireless communication system, including a first device and a second device. The first device can be used to perform the steps of the signal transmission method on the first device side as provided in this application, and the second device can be used to perform the steps of the signal transmission method on the second device side as provided in this application.

[0407] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element. Furthermore, it should be noted that the scope of the methods and apparatuses in the embodiments of this application is not limited to performing functions in the order shown or discussed, but may also include performing functions substantially simultaneously or in the reverse order, depending on the functions involved. For example, the described methods may be performed in a different order than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

[0408] From the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of computer software products plus necessary general-purpose hardware platforms, and of course, they can also be implemented by hardware. The computer software product is stored in a storage medium (such as ROM, RAM, magnetic disk, optical disk, etc.) and includes several instructions to cause the terminal or network-side device to execute the methods described in the various embodiments of this application.

[0409] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other implementations under the guidance of this application without departing from the spirit and scope of the claims. All of these implementations are within the protection scope of this application.

Claims

1. A signal transmission method, comprising: generating, by a first device, a target signal according to a bit sequence corresponding to a target information bit group, the target signal being used for transmitting data and being a signal corresponding to a redundancy version, the target information bit group being all or part of N information bit groups obtained by grouping a set of information bits, and the N information bit groups being encoded at N code rates respectively, N being an integer greater than 1; sending, by the first device, the target signal. 2.The method of claim 1, further comprising: selecting, by the first device, the bit sequence corresponding to the target information bit group from a target circular buffer according to a redundancy version number corresponding to the target signal, the target circular buffer being a circular buffer storing encoded output bit sequences of the target information bit group. 3.The method of claim 2, further comprising: storing, by the first device, the encoded output bit sequences of the N information bit groups in one circular buffer; or storing, by the first device, the encoded output bit sequences of the N information bit groups in N circular buffers respectively; wherein, in a case that the same first parameters are used when the N information bit groups are encoded, the N circular buffers have the same length; or in a case that at least one of the first parameters used when the N information bit groups are encoded is different, the N circular buffers have different lengths; wherein the first parameters comprise at least one of the following: a base graph BG, a lifting factor, a check matrix, a generator matrix, an encoder input code block length, an encoder output code block length, a mother code rate.

4. The method of claim 3, wherein, in a case that the N circular buffers have different lengths, a length of a circular buffer corresponding to a first information bit group is greater than a length of a circular buffer corresponding to a second information bit group, wherein a code rate corresponding to the first information bit group is higher than a code rate corresponding to the second information bit group.

5. The method of claim 3, wherein, storing, by the first device, the encoded output bit sequences of the N information bit groups in one circular buffer comprises: in a case that the same first parameters are used when the N information bit groups are encoded, storing, by the first device, the encoded output bit sequences of the N information bit groups in one circular buffer.

6. The method of claim 3 or 5, wherein, storing, by the first device, the encoded output bit sequences of the N information bit groups in one circular buffer comprises: storing, by the first device, an encoded output bit sequence of one information bit group in a target circular buffer, and then storing an encoded output bit sequence of another information bit group in the target circular buffer after selecting the bit sequence corresponding to the one information bit group from the target circular buffer.

7. The method of any one of claims 2 to 6, wherein, selecting, by the first device, the bit sequence corresponding to the target information bit group from a target circular buffer according to a redundancy version number corresponding to the target signal comprises: determining, by the first device, a starting position for selecting bits from the target circular buffer according to the redundancy version number corresponding to the target signal, and selecting the bit sequence corresponding to the target information bit group from the target circular buffer according to the starting position.

8. The method of claim 7, wherein, In a case that the same first parameter is used in encoding the N information bit groups: The starting positions associated with the redundancy version numbers are the same in N circular buffers respectively used for buffering the encoded output bit sequences of the N information bit groups, or In one circular buffer, the starting positions associated with the redundancy version numbers corresponding to different information bit groups are the same, and the one circular buffer is used for buffering the encoded output bit sequences of the N information bit groups. The first parameter includes at least one of the following: BG, lifting factor, check matrix, generating matrix, encoder input code block length, encoder output code block length, mother code rate.

9. The method of claim 7 or 8, wherein, The starting positions associated with the redundancy version numbers are associated with at least one of the following: Lifting factor, length of the target circular buffer.

10. The method of any one of claims 7 to 9, wherein, The selecting the bit sequence corresponding to the target information bit group from the target circular buffer according to the starting position includes one of the following: selecting N·E target information bit groups from the target circular buffer according to the starting position r a bit sequence, obtaining a bit sequence corresponding to the target information bit group repeatedly selecting a bit sequence with length E from the target circular buffer according to the starting position r to obtain an N·E r bit sequence, to obtain a bit sequence corresponding to the target information bit group; E is selected from the target circular buffer according to the starting position r a bit sequence, to obtain a bit sequence corresponding to the target information bit group; wherein E r is the rate-matched output code block length corresponding to the target information bit group.

11. The method of any one of claims 1 to 10, wherein, The value of N is a fixed value; or The value of N is associated with the modulation order.

12. The method of any one of claims 1 to 11, wherein, In a case that the target information bit group includes a plurality of information bit groups, and the target signal is a retransmission of the plurality of information bit groups, the target signal is generated according to the bit sequence corresponding to the information bit group with a lower code rate in priority.

13. The method of any one of claims 2 to 12, wherein, The first device selects the bit sequence corresponding to the target information bit group from the target circular buffer according to the redundancy version number corresponding to the target signal, including: The first device selects the systematic bit sequence corresponding to the target information bit group from the target circular buffer according to the redundancy version number corresponding to the target signal, and then selects the check bit sequence corresponding to the target information bit group, wherein the bit sequence corresponding to the target information bit group includes the systematic bit sequence and the check bit sequence.

14. A signal transmission method, comprising: A second device receives a target signal, the bit sequence corresponding to the target signal is a bit sequence corresponding to a target information bit group, the target signal is used for transmitting data and is a signal corresponding to a redundancy version, the target information bit group is all or part of N information bit groups obtained by grouping a set of information bits, and the N information bit groups are encoded using N code rates respectively, N being an integer greater than 1.

15. A signal transmission apparatus, comprising: A processing module configured to generate a target signal according to a bit sequence corresponding to a target information bit group, the target signal being used for transmitting data and being a signal corresponding to a redundancy version, the target information bit group being all or part of N information bit groups obtained by grouping a set of information bits, and the N information bit groups being encoded using N code rates respectively, N being an integer greater than 1; A sending module configured to send the target signal.

16. The apparatus of claim 15, wherein, The processing module is further configured to: Select the bit sequence corresponding to the target information bit group from a target circular buffer according to a redundancy version number corresponding to the target signal, the target circular buffer being a circular buffer storing an encoded output bit sequence of the target information bit group.

17. The apparatus of claim 16, wherein, The processing module is further configured to: store the encoded output bit sequence of the N information bit groups into one circular buffer; or store the encoded output bit sequence of the N information bit groups into N circular buffers respectively; wherein, in the case that the same first parameter is used when the N information bit groups are encoded, the N circular buffers have the same length; or in the case that at least one of the first parameters used when the N information bit groups are encoded is different, the N circular buffers have different lengths. The first parameter includes at least one of the following: a base graph BG, a lifting factor, a check matrix, a generator matrix, an encoder input code block length, an encoder output code block length, a mother code rate.

18. The apparatus of claim 16 or 17, wherein, The processing module is configured to select the system bit sequence corresponding to the target information bit group and the check bit sequence corresponding to the target information bit group from the target circular buffer according to the redundancy version number corresponding to the target signal, wherein the bit sequence corresponding to the target information bit group includes the system bit sequence and the check bit sequence.

19. A signal transmission apparatus, comprising: a receiving module configured to receive a target signal, wherein a bit sequence corresponding to the target signal is a bit sequence corresponding to a target information bit group, the target signal is used to transmit data and is a signal corresponding to a redundancy version, the target information bit group is all or part of N information bit groups obtained by grouping a set of information bits, and the N information bit groups are encoded using N code rates respectively, N being an integer greater than 1.

20. An apparatus, comprising a processor and a memory, wherein the memory stores programs or instructions executable on the processor, and the programs or instructions are executed by the processor to implement the steps of the signal transmission method according to any one of claims 1 to 13, or the programs or instructions are executed by the processor to implement the steps of the signal transmission method according to claim 14.

21. A readable storage medium, wherein the readable storage medium stores programs or instructions, and the programs or instructions are executed by a processor to implement the steps of the signal transmission method according to any one of claims 1 to 13, or implement the steps of the signal transmission method according to claim 14.

22. A computer program product stored in a storage medium, wherein the computer program product is executed by at least one processor to implement the steps of the signal transmission method according to any one of claims 1 to 13, or implement the steps of the signal transmission method according to claim 14.

Citation Information

Patent Citations

  • Communication method and communication apparatus

    US20160277040A1

  • Wireless communication method, terminal device and network device

    US20230412308A1

  • Low density parity check (LDPC) circular buffer rate matching

    WO2018148742A1