Communication method and related apparatus

Abstract

Provided in the present application are a communication method and a related apparatus. The method comprises: determining a redundancy version (RV) corresponding to an encoded bit sequence, wherein the encoded bit sequence comprises a plurality of bit segments, each of the plurality of bit segments comprises system bits, and a starting position corresponding to the RV is located in one of the plurality of bit segments; and performing data transmission on the basis of the RV. By means of the embodiments of the present application, the starting position corresponding to the RV is located in one of the plurality of bit segments, and each bit segment corresponds to a group of system bits, so that data transmission based on each RV is associated with a group of system bits, and therefore data transmission efficiency and data retransmission performance can be guaranteed.

Description

Communication method and related device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on February 8, 2024, with application number 202410178336.0 and invention name “Communication Method and Related Devices”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of wireless communication technology, and in particular to a communication method and related devices. Background Art

[0003] Spatially coupled codes are a capacity-approximating coding scheme that constructs new codewords by combining traditional codes such as low-density parity check (LDPC), Reed-Solomon (RS), and Bose–Chaudhuri–Hocquenghem (BCH) codes as component codes and performing operations such as convolution and superposition. Spatially coupled LDPC (SC-LDPC) codes are a constructible code proposed based on LDPC codes. Compared to LDPC codes, SC-LDPC codes not only offer better decoding performance but also a relatively simple coding structure. Theoretically, they can approach the Shannon limit. Their unique syndrome predicate coding scheme and sliding window decoding scheme effectively reduce the complexity of encoding and decoding. However, similar to product codes, their code length is relatively short due to the large number of component codes, making them difficult to design for rate adaptation. Therefore, their current applications are primarily in storage and optical communications.

[0004] Existing technical solutions provide a redundancy version (RV) partitioning method for new radio (NR) LDPC codes, which has good retransmission performance for a single LDPC code parity check matrix. However, existing technical solutions do not provide an RV partitioning design for structured codes based on multiple component codes. Summary of the Invention

[0005] Embodiments of the present application provide a communication method and related apparatus for transmitting data based on a redundancy version (RV) corresponding to an encoded bit sequence. The starting position of the RV is located in one of multiple bit segments included in the encoded bit sequence, and each bit segment corresponds to a group of systematic bits. Data transmission based on each RV is associated with a group of systematic bits, thereby ensuring data transmission efficiency and data retransmission performance.

[0006] In a first aspect, the present application provides a communication method, which is applied to a first device. The first device can be a network device or a component applicable to a network device (such as a chip or circuit, etc.), or it can be a terminal device or a component applicable to a terminal device (such as a chip or circuit, etc. (such as a modem chip, also known as a baseband chip, or a system on chip (SoC) chip or system in package (SIP) chip containing a modem core)). The method includes: determining a redundant version RV corresponding to an encoded bit sequence, the encoded bit sequence includes multiple bit segments, each bit segment in the multiple bit segments includes a systematic bit, and the starting position corresponding to the RV is located in one of the multiple bit segments; and performing data transmission based on the RV.

[0007] In an embodiment of the present application, the starting position corresponding to the RV is located in one of multiple bit segments, so that each group of system bits is associated with at least one RV, so that the data transmission based on the RV by the transmitting end can realize the transmission of each group of system bits, so that the receiving end can decode each group of system bits and obtain the group of system bits, effectively improving the data transmission efficiency or spectrum efficiency.

[0008] In some possible implementations, the RV includes a first RV, which has a granularity of multiple bit segments. Data transmission based on the RV includes: according to the starting position corresponding to the first RV, transmitting at least one bit segment corresponding to the encoded bit sequence from the starting position as the starting point.

[0009] In some possible implementations, the RV includes a second RV, and the second RV uses each bit segment in multiple bit segments as the granularity. Data transmission based on the RV includes: according to the starting position corresponding to the second RV, transmitting the bit segment where the second RV is located starting from the starting position.

[0010] In this embodiment of the present application, regardless of whether it is the first RV or the second RV, the starting position corresponding to the RV is located in one of multiple bit segments, so that each set of systematic bits is associated with at least one RV. This allows the receiving end to decode each set of systematic bits and obtain the set of systematic bits, effectively improving data transmission efficiency. For the second RV, the starting position of data transmission can be located with finer granularity, thereby more accurately selecting the corresponding RV for data retransmission based on decoding error bits (segments), thereby improving retransmission performance.

[0011] In some possible implementations, the encoded bit sequence is generated by encoding with a global coupled code.

[0012] In some possible implementations, the encoded bit sequence is generated by encoding a plurality of segmented bit sequences respectively using a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

[0013] In some possible implementations, the encoded bit sequence is generated by encoding with a spatially coupled code.

[0014] In some possible implementations, the encoded bit sequence is generated by encoding multiple segmented bit sequences using multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of a previous segmented bit sequence.

[0015] In some possible implementations, the number of second RVs corresponding to each bit segment is the same and greater than 1.

[0016] In this embodiment, for the global coupled code encoding scheme, since the matrices of each first component code are uncorrelated, the number of second RVs corresponding to the multiple bit segments obtained after encoding with multiple first component codes can be the same, and the number of second RVs can be greater than 1. This allows the transmission starting position of each bit segment to be selected with the same granularity during data transmission, ensuring data transmission flexibility.

[0017] In some possible implementations, among the multiple bit segments, the number of second RVs corresponding to the edge bit segment is greater than that of the non-edge bit segment, where the edge bit segment is the first or last one among the multiple bit segments.

[0018] In this embodiment of the present application, multiple bit segments encoded with the spatial coupling code are divided into second RVs, where edge bit segments correspond to more second RVs and non-edge bit segments correspond to fewer second RVs. This reduces coding complexity and storage overhead while ensuring the decoding capability of the second component code.

[0019] In some possible implementations, the method further includes: receiving first information indicating that there is a decoding error in data transmitted based on the RV; and retransmitting the data based on the first information and a next RV.

[0020] In some possible implementations, the first information includes 1 bit, and when the value of 1 bit is the first value, it indicates that there are decoding errors in multiple bit segments; or the first information includes a bit map, and the bit map is used to indicate that there are one or more bit segments with decoding errors among multiple bit segments.

[0021] In some possible implementations, the first information includes negative acknowledgement (NACK) information.

[0022] In this embodiment of the present application, first information indicates that a decoding error exists in data transmitted based on an RV, allowing the first device to determine whether to retransmit the data based on the next RV based on the first information. In this process, since each RV corresponds to a bit segment, each retransmission can correspond to at least one systematic bit, improving retransmission performance. Furthermore, the granularity of the retransmitted bit sequence for the second RV is more precisely divided, which can reduce resource consumption for data retransmission while ensuring retransmission performance.

[0023] In some possible implementations, the method further includes: receiving second information, where the second information is used to indicate a target RV; and retransmitting data based on the target RV and the encoded bit sequence according to the second information.

[0024] In some possible implementations, the second information is carried in downlink control information DCI.

[0025] In this embodiment of the present application, the first device is instructed to retransmit data based on a target first RV corresponding to a bit segment containing a decoding error. Since each RV corresponds to a bit segment, each retransmission can correspond to at least one systematic bit, thereby improving retransmission performance. Furthermore, the first device can be further instructed to retransmit data based on a target second RV containing a bit segment containing a decoding error. This instructs the first device to retransmit bit sequences with more precise granularity, thereby ensuring retransmission performance while reducing resource consumption for data retransmission.

[0026] In some possible implementations, data transmission corresponds to multiple hybrid automatic repeat request HARQ processes, and before feedback information for one HARQ process is received, a next HARQ process of the multiple HARQ processes is started.

[0027] Adopting the method of the embodiment of the present application can further improve the concurrent transmission efficiency of the first device.

[0028] In the second aspect, the present application provides a communication method, which is applied to a second device. The second device can be a network device or a component that can be applied to a network device (such as a chip or circuit, etc.), or it can be a terminal device or a component that can be applied to a terminal device (such as a chip or circuit, etc.). The method includes: receiving data transmitted based on RV, the starting position corresponding to the RV is located in multiple bit segments included in the bit sequence before decoding, and each bit segment includes a system bit; sending first information or second information, the first information indicates that there is a decoding error in the data transmitted based on the RV; the second information is used to indicate the target RV.

[0029] In some possible implementations, the RV includes a first RV, and the first RV has a granularity of multiple bit segments.

[0030] In some possible implementations, the RV includes a second RV, and the second RV has a granularity of each bit segment in the plurality of bit segments.

[0031] In some possible implementations, the bit sequence before decoding is generated by encoding with a global coupled code.

[0032] In some possible implementations, the bit sequence before decoding is generated by encoding a plurality of segmented bit sequences respectively using a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

[0033] In some possible implementations, the bit sequence before decoding is generated by encoding with a spatially coupled code.

[0034] In some possible implementations, the bit sequence before decoding is generated by encoding multiple segmented bit sequences using multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of the previous segmented bit sequence.

[0035] In some possible implementations, the number of second RVs corresponding to each bit segment is the same and greater than 1.

[0036] In some possible implementations, among the multiple bit segments, the number of second RVs corresponding to the edge bit segments is greater than that of the non-edge bit segments, where the edge bit segment is the first or last one among the multiple bit segments.

[0037] In some possible implementations, the first information includes negative acknowledgement (NACK) information.

[0038] In some possible implementations, the second information is carried in downlink control information DCI.

[0039] According to a third aspect, a communication device is provided, which includes: a processing unit for determining a redundant version RV corresponding to an encoded bit sequence, the encoded bit sequence includes multiple bit segments, and the starting position corresponding to the RV is located in one of the multiple bit segments; and a transceiver unit for transmitting data based on the RV.

[0040] In some possible implementations, the RV includes a first RV, which has a granularity of multiple bit segments. Data transmission based on the RV includes: according to the starting position corresponding to the first RV, transmitting at least one bit segment corresponding to the encoded bit sequence from the starting position as the starting point.

[0041] In some possible implementations, the RV includes a second RV, and the second RV uses each bit segment in multiple bit segments as the granularity. Data transmission based on the RV includes: according to the starting position corresponding to the second RV, transmitting the bit segment where the second RV is located starting from the starting position.

[0042] In some possible implementations, the encoded bit sequence is generated by encoding with a global coupled code.

[0043] In some possible implementations, the encoded bit sequence is generated by encoding a plurality of segmented bit sequences respectively using a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

[0044] In some possible implementations, the encoded bit sequence is generated by encoding with a spatially coupled code.

[0045] In some possible implementations, the encoded bit sequence is generated by encoding multiple segmented bit sequences using multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of a previous segmented bit sequence.

[0046] In some possible implementations, the number of second RVs corresponding to each bit segment is the same and greater than 1.

[0047] In some possible implementations, among the multiple bit segments, the number of second RVs corresponding to the edge bit segment is greater than that of the non-edge bit segment, where the edge bit segment is the first or last one among the multiple bit segments.

[0048] In some possible implementations, the transceiver unit is further configured to: receive first information indicating that a decoding error exists in data transmitted based on the RV; and retransmit the data based on the first information and a next RV.

[0049] In some possible implementations, the first information includes 1 bit, and when the value of 1 bit is the first value, it indicates that there are decoding errors in multiple bit segments; or the first information includes a bit map, and the bit map is used to indicate that there are one or more bit segments with decoding errors among multiple bit segments.

[0050] In some possible implementations, the first information includes negative acknowledgement (NACK) information.

[0051] In some possible implementations, the transceiver unit is further configured to: receive second information, where the second information is used to indicate a target RV; and retransmit data based on the target RV.

[0052] In some possible implementations, the second information is carried in downlink control information DCI.

[0053] In some possible implementations, the data transmission corresponds to multiple hybrid automatic repeat request HARQ processes, and the processing unit is further configured to: before receiving feedback information for one HARQ process, start a next HARQ process of the multiple HARQ processes.

[0054] In a fourth aspect, a communication device is provided, which includes: a transceiver unit, which receives data transmitted based on an RV, where the starting position corresponding to the RV is located in multiple bit segments included in the bit sequence before decoding, and each bit segment includes a system bit; a processing unit, which is used to send first information or second information in combination with the transceiver unit, where the first information indicates that there is a decoding error in the data transmitted based on the RV; and the second information is used to indicate the target RV.

[0055] In some possible implementations, the RV includes a first RV, and the first RV has a granularity of multiple bit segments.

[0056] In some possible implementations, the RV includes a second RV, and the second RV has a granularity of each bit segment in the plurality of bit segments.

[0057] In some possible implementations, the bit sequence before decoding is generated by encoding with a global coupled code.

[0058] In some possible implementations, the bit sequence before decoding is generated by encoding a plurality of segmented bit sequences respectively using a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

[0059] In some possible implementations, the bit sequence before decoding is generated by encoding with a spatially coupled code.

[0060] In some possible implementations, the bit sequence before decoding is generated by encoding multiple segmented bit sequences using multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of the previous segmented bit sequence.

[0061] In some possible implementations, the number of second RVs corresponding to each bit segment is the same and greater than 1.

[0062] In some possible implementations, among the multiple bit segments, the number of second RVs corresponding to the edge bit segment is greater than that of the non-edge bit segment, where the edge bit segment is the first or last one among the multiple bit segments.

[0063] In some possible implementations, the first information includes negative acknowledgement (NACK) information.

[0064] In some possible implementations, the second information is carried in downlink control information DCI.

[0065] In a fifth aspect, the present application provides a communication device, which includes a processor coupled to a memory. When the processor executes a computer program or instruction in the memory, the method of any embodiment of the first or second aspect is executed.

[0066] Optionally, the device further comprises a memory.

[0067] Optionally, the device further includes a communication interface, and the processor is coupled to the communication interface.

[0068] Optionally, there are one or more processors and one or more memories.

[0069] Optionally, the memory may be integrated with the processor, or the memory may be provided separately from the processor.

[0070] Optionally, the transceiver may include a transmitter (transmitter) and a receiver (receiver).

[0071] In one implementation, the communication device is a terminal device. When the communication device is a terminal device, the communication interface may be a transceiver or an input / output interface. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input / output interface may be an input / output circuit.

[0072] In another implementation, the communication device is a chip or a chip system. When the device is a chip or a chip system, the communication interface can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip or chip system. The processor can also be embodied as a processing circuit or a logic circuit.

[0073] In a sixth aspect, the present application provides a communication device, which includes a processor coupled to a memory. When the processor executes a computer program or instruction in the memory, the method of any embodiment of the first or second aspect above is executed.

[0074] Optionally, the device further comprises a memory.

[0075] Optionally, the device further includes a communication interface, and the processor is coupled to the communication interface.

[0076] Optionally, there are one or more processors and one or more memories.

[0077] Optionally, the memory may be integrated with the processor, or the memory may be provided separately from the processor.

[0078] Optionally, the transceiver may include a transmitter (transmitter) and a receiver (receiver).

[0079] In one implementation, the communication device is a network device. When the communication device is a network device, the communication interface may be a transceiver or an input / output interface. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input / output interface may be an input / output circuit.

[0080] In another implementation, the communication device is a chip or a chip system. When the device is a chip or a chip system, the communication interface can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip or chip system. The processor can also be embodied as a processing circuit or a logic circuit.

[0081] In a seventh aspect, the present application provides a communication system, which includes the communication device of the third and fourth aspects above, or includes the communication device of the fifth and sixth aspects above.

[0082] In an eighth aspect, the present application provides a computer program product, which includes: a computer program (also referred to as code, or instructions), which, when run, enables the computer to execute the method in any possible implementation of the first or second aspect above.

[0083] In the ninth aspect, the present application provides a computer-readable storage medium, which stores a computer program (also referred to as code, or instructions) which, when run on a computer, enables the computer to execute the method in any possible implementation of the first or second aspect above.

[0084] In a tenth aspect, the present application also provides a circuit comprising: a processor and an interface for executing a computer program or instruction stored in a memory, and executing a method in any possible implementation of the first or second aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0085] FIG1 is a schematic diagram of an application scenario provided by an embodiment of the present application;

[0086] FIG2A is a schematic diagram of a 5G NR LDPC RV partitioning method provided in an embodiment of the present application;

[0087] FIG2B is a schematic diagram of a spatial coupling code generation matrix provided in an embodiment of the present application;

[0088] FIG3A is a flow chart of a communication method provided in an embodiment of the present application;

[0089] FIG3B is a schematic diagram of an encoding method for obtaining an encoded bit sequence according to an embodiment of the present application;

[0090] FIG3C is a schematic diagram of an RV provided in this embodiment;

[0091] FIG3D is a schematic diagram of a circular buffer pool provided in an embodiment of the present application;

[0092] FIG4A is a block diagram of an encoding process provided in an embodiment of the present application;

[0093] FIG4B is a schematic diagram of a global coupling code encoding provided by an embodiment of the present application;

[0094] FIG5A is a schematic diagram of a spatial coupling code encoding provided by an embodiment of the present application;

[0095] FIG5B is a schematic diagram of a method for dividing an RV of a coded bit sequence provided in an embodiment of the present application;

[0096] FIG5C is a schematic diagram of another RV division method for an encoded bit sequence provided in an embodiment of the present application;

[0097] FIG6A is a flow chart of another communication method provided in an embodiment of the present application;

[0098] FIG6B is a flow chart of another communication method provided in an embodiment of the present application;

[0099] FIG6C is a schematic diagram of a process for determining a target RV according to an embodiment of the present application;

[0100] FIG6D is a schematic diagram of another process for determining a target RV according to an embodiment of the present application;

[0101] FIG6E is a schematic diagram of a first device performing multi-process data transmission according to an embodiment of the present application;

[0102] FIG7 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application;

[0103] FIG8 is a schematic structural diagram of another communication device provided in an embodiment of the present application;

[0104] FIG9 is a schematic diagram of the hardware structure of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0105] The embodiments of the present invention are described below with reference to the accompanying drawings.

[0106] The terms "first," "second," "third," and "fourth," etc., in the specification and claims of this application and the accompanying drawings are used to distinguish between different objects, rather than to describe a specific order. In addition, the terms "including," "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements, but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0107] References herein to "embodiments" mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it constitute an independent or alternative embodiment that is mutually exclusive of other embodiments. It is understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0108] "Multiple" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent three situations: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" or similar expressions is used to indicate any combination of the listed items; for example, at least one of A, B and (or) C can represent the following situations: A exists alone, B exists alone, C exists alone, A and B exist at the same time, B and C exist at the same time, A and C exist at the same time, and A, B and C exist at the same time, where A, B, and C can be single or multiple.

[0109] First, the application scenarios corresponding to the embodiments of the present application are introduced.

[0110] Please refer to Figure 1, which is a schematic diagram of an application scenario provided by an embodiment of the present application. As shown in Figure 1, the embodiment of the present application can be applied to a variety of mobile communication scenarios, such as multi-hop / multi-relay (node) transmission between a base station and user equipment (UE), a base station and a UE, dual connectivity (DC) between multiple base stations and UEs, or multi-connection between UEs and multiple relays. It should be noted that Figure 1 is only exemplary and does not limit the network architecture applicable to the present invention. As long as any network-side device in the cellular network charges other devices, it is a network architecture that can be used in the present invention.

[0111] The following is a brief introduction to the terms involved in this embodiment.

[0112] A wireless communication system includes communication devices that can wirelessly communicate with each other using air interface resources. The communication devices may include network equipment and terminal equipment, and the network equipment may also be referred to as a base station. Air interface resources may include at least one of time domain resources, frequency domain resources, code resources, and space resources. In the embodiments of the present application, "at least one" may also be described as one or more, and "multiple" may be two, three, four, or more, without limitation in this application.

[0113] The terminal device involved in the embodiments of the present application can also be referred to as a terminal, which can be a device with wireless transceiver function, which can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; it can also be deployed on the water surface (such as ships, etc.); it can also be deployed in the air (for example, on airplanes, balloons and satellites, etc.). The terminal device can be user equipment (UE), wherein the UE includes a handheld device, a vehicle-mounted device, a wearable device or a computing device with wireless communication function. For example, the UE can be a mobile phone, a tablet computer or a computer with wireless transceiver function. The terminal device can also be a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city, a wireless terminal in smart home, a transport vehicle with wireless communication function, a communication module, etc. In the embodiments of the present application, the device for realizing the function of the terminal can be a terminal; it can also be a device that can support the terminal to realize the function, such as a chip system, which can be installed in the terminal. In the embodiment of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices. In some possible implementations, a communication module, circuit or chip that performs the corresponding communication function is provided in the terminal device. The terminal device is also configured with program instructions for performing the corresponding communication function. In the technical solution provided in the embodiment of the present application, the device for implementing the function of the terminal is a terminal, and the terminal is a UE as an example to describe the technical solution provided in the embodiment of the present application.

[0114] The network devices involved in the embodiments of the present application include access network devices, such as base stations (BS). The BS can be a device deployed in a wireless access network that can communicate wirelessly with a terminal. Among them, the base station may have various forms, such as a macro base station, a micro base station, a relay station, and an access point. For example, the base station involved in the embodiments of the present application can be a base station in 5G or an evolved base station (eNB) in LTE. The base station in 5G can also be called a transmission reception point (TRP) or a 5G base station (next-generation Node B, gNB). In the embodiments of the present application, the device for implementing the function of the network device can be a network device; it can also be a device that can support the network device to implement the function, such as a chip system, which can be installed in the network device. In some possible implementations, the access network device is provided with a communication module, circuit or chip that performs the corresponding communication function. The TRP is also configured with program instructions for performing the corresponding communication function and corresponding program instructions. In the technical solutions provided in the embodiments of the present application, the technical solutions provided in the embodiments of the present application are described by taking the device for implementing the function of the network device as a network device and the network device as a base station as an example.

[0115] The technical solutions provided in the embodiments of the present application can be applied to channel coding / decoding between communication devices. Channel coding / decoding between communication devices may include: channel coding / decoding between a network device and a terminal, channel coding / decoding between network devices, and channel coding / decoding between terminals. In the embodiments of the present application, the term channel coding / decoding is referred to as coding / decoding, and the coding structure can be referred to as code type. Code design, coding structure includes cascade structure, hierarchical structure, coupled structure, inner and outer code structure, ladder structure, sliding window structure, etc.

[0116] The following is an introduction to the prior art of this embodiment.

[0117] The starting position corresponding to the RV is the starting position of the transmission bit sequence. Please refer to Figure 2A, which is a schematic diagram of an NR LDPC RV partitioning method provided in an embodiment of the present application. As shown in Figure 2A, the input information bits are encoded using the check matrix corresponding to the LDPC code. The check matrix includes:

[0118] H core : Core matrix, corresponding to the matrix in the upper left black box (systematic bits) in the upper portion of Figure 2A, and the four columns to the right of this matrix. It is used to ensure LDPC decoding performance.

[0119] H zero : All zero matrix. With H coreThe number of rows is the same. core The omitted part on the right is also H zero .

[0120] H extend : Expanded matrix. Compared to H core The elements are sparser, corresponding to the lower left matrix in the upper part of Figure 2A.

[0121] H diag : A diagonal matrix. Only the diagonal elements are 1; the rest are 0. This matrix primarily supports flexible bit rate implementation of LDPC codes. It is cropped from the upper left corner to the lower right corner as the bit rate requirement changes. This corresponds to the lower right corner matrix in the upper portion of Figure 2A.

[0122] Among them, H core Most of the bit sequences in the front correspond to systematic bits, and a small number of bit sequences in the back, plus the bit sequence of the zero matrix, correspond to check bits.

[0123] The systematic bits are the input bit sequence of each coding structure, and the parity bits are the bit sequence obtained after the systematic bits are encoded. They can be used to check whether the systematic bits have been transmitted erroneously. Furthermore, the parity bits can be used to correct errors in the systematic bits.

[0124] In some cases, the embodiments of the present application also involve information bits, which refer to the original bit sequence before any encoding.

[0125] In 5G NR technology, the additional redundancy part of LDPC (referring to the H core The redundant part other than H extend ) is extended with a Raptor-like structure to facilitate low-complexity coding. Four RV versions (RV0 to RV3) are defined for the encoded bit sequence. Data is transmitted using (or according to) a specific RV, meaning that the bit sequence is transmitted from the starting position to the ending position corresponding to the RV. The ending position can be indicated by other information or set by default.

[0126] The specific starting positions of RV0 to RV3 of LDPC can be found in Table 1:

[0127] Table 1 RV starting position of LDPC in 5G NR

[0128] As shown in Table 1, N cb Indicates the length of the encoded bit sequence, Z cis the size of the submatrix (or lifting matrix) that constitutes the LDPC code parity check matrix (called the lifting value or expansion factor). k0 represents the starting position of the corresponding RV. In NR LDPC, the starting positions of the RVs are unequally spaced (non-uniform). Non-uniform spacing can improve decoding performance. Table 1 includes the RVs corresponding to LDPC based graph 1 (abbreviated as BG1) and LDPC based graph 2 (abbreviated as BG2). In the protocol, BG1 corresponds to enhanced mobile broadband (eMBB) services, with longer data and therefore a larger matrix; BG2 corresponds to ultra-reliable low-latency communications (URLLC) services, with shorter data and a smaller matrix. For LDPC BG1 (encoded bit length is 66Zc) and BG2 (encoded bit length is 50Zc), the starting positions of RV0 to RV3 are shown in Table 1. When the starting position is 0, in some cases, there may be two punctured columns at the beginning. RV0 (including all system bits) and RV3 have self-decoding functions. During the design process of quasi-cyclic LDPC codes, the design is mainly based on the initial transmission performance. Therefore, the initial transmission data is preferably transmitted using RV0, and subsequent retransmissions are carried out in the order of RV2, RV3, and RV1.

[0129] The RV division in Figure 2A above is performed on a bit sequence encoded using LDPC. In practice, different RVs can be assigned to bit sequences encoded using other coding structures, including RS codes and BCH codes. The specific starting position of the RV in the encoded bit sequence may vary for different coupling codes.

[0130] In addition, this embodiment also relates to an encoding method of a spatially coupled code. Spatially coupled (SC) code is a capacity-approximate encoding scheme that constructs new codewords by performing convolution and superposition operations on traditional coupled codes, such as LDPC codes, RS codes, and BCH codes, as component codes. Please refer to Figure 2B, which is a schematic diagram of a spatially coupled code generation matrix provided in an embodiment of the present application. As shown in Figure 2B, the spatially coupled code corresponds to the matrix shown in the figure, wherein the system bits of the i+2 segment code (corresponding to the code of the i+2 component code) include (part or all) the system bits of the i+1 segment code.

[0131] Spatially coupled codes have become a new research hotspot in academia due to their near-capacity characteristics and suitable coding and decoding complexities. SC-LDPC codes are a constructible code proposed based on LDPC codes. Compared to LDPC codes, SC-LDPC codes not only offer better decoding performance but also a relatively simple coding structure. Theoretically, they can approach the Shannon limit, utilizing a unique syndrome predicate coding scheme and a sliding window decoding scheme to effectively reduce encoding and decoding complexity. Similar to product codes, however, due to the large number of component codes, the code length is relatively short, making rate adaptation more difficult to design. Therefore, SC-LDPC codes are currently primarily used in storage, optical communications, and other fields.

[0132] From the above description of the prior art, it can be seen that the prior art does not provide an RV division design for a structured code based on multiple component codes. If the RV division, feedback, and retransmission methods of the existing NR protocol are used, the retransmission performance cannot be well guaranteed because the system bits are not concentrated together.

[0133] Based on this, an embodiment of the present application provides a communication method, as shown in FIG3A . The method may include the following steps:

[0134] 201. A first device determines a redundant version RV corresponding to an encoded bit sequence, where the encoded bit sequence includes multiple bit segments, each bit segment includes a group of systematic bits, and a starting position corresponding to the RV is located in one of the multiple bit segments.

[0135] The first device in the embodiment of the present application may be a network device, a UE, or other network elements capable of coding and communication, such as a chip applicable to a network device or a chip applicable to a terminal device.

[0136] When the first device corresponds to a network device (or a transmission control end in UE-to-UE communication), the method of determining the RV corresponding to the encoded bit sequence can be any one of the following two methods: 1. Determine the RV by itself. For example, the first device can determine all RVs according to protocol provisions or transmission requirements, and then determine the order of all RVs of the encoded bit sequence for transmitting data, and then determine the RV used for this data transmission. Or, 2. Determine the RV based on the feedback information received on whether the decoding is correct or not. Based on the feedback information received on whether the decoding is correct or not, the first device can determine whether to obtain the next RV for data transmission according to the order of RVs (the data transmission at this time is not the initial transmission, so it can also be called data retransmission).

[0137] When the first device corresponds to a UE, the RV can be determined in either of the following ways: 1. The first device determines the RV based on the protocol. Or, 2. The RV is obtained based on received information. The received information can be, for example, at least one of the following information sent by a network device or a peer UE: configuration information related to RV division, RV ordering corresponding to data transmission, feedback information on correct decoding, or information such as a target RV for a specified data transmission.

[0138] The information bits to be transmitted can be encoded using a coding structure (or coding matrix) to obtain a coded bit sequence. The coding structure in the embodiment of the present application includes multiple component codes, each component code is encoded to obtain a bit segment, each bit segment corresponds to a set of systematic bits and check bits, or in some cases, a single bit segment may also correspond to only one set of systematic bits (for example, when the code rate is 1). In the following embodiments, each bit segment corresponds to a set of systematic bits and check bits. It should be understood that the relevant implementation methods can also be applied to scenarios where a bit segment corresponds to only one set of systematic bits.

[0139] The component code can be various types of group codes such as LDPC code, BCH code, RS code, etc. The component code can be in the form of a generator matrix, for example, y=G*x, where G represents the generator matrix; it can also be in the form of a check matrix, for example, y*H=0, where H represents the check matrix.

[0140] Please refer to Figure 3B, which is a schematic diagram of a coding method provided in an embodiment of the present application to obtain an encoded bit sequence. As shown in Figure 3B, the information bit sequence is encoded using component code 1, component code 2, ..., component code m, respectively, to obtain bit segments 1 to bit segments m, where m is a positive integer greater than 1. Since each group (or each) bit segment consists of systematic bits and parity bits, one bit segment corresponds to a group of systematic bits and parity bits. For example, the first group of systematic bits and parity bits corresponds to bit segment 1, the second group of systematic bits and parity bits corresponds to bit segment 2, and so on. The mth group of systematic bits and parity bits corresponds to bit segment m. The bit segments corresponding to the m groups of systematic bits and parity bits constitute the encoded bit sequence corresponding to the information bits.

[0141] Each RV corresponds to a starting position. In the embodiment of the present application, the starting position corresponding to each RV is located in one of the multiple bit segments of the encoded bit sequence. The starting position corresponding to the RV has two meanings: (1) the multiple bit segments included in the encoded bit sequence are used as the granularity (determining the starting position corresponding to the RV). (2) the starting position corresponding to the RV is determined in one of the multiple bit segments included in the encoded bit sequence.

[0142] It is understandable that each of the multiple bit segments may correspond to a set of systematic bits and parity bits. Therefore, using multiple bit segments as the granularity can also be referred to as using multiple sets of systematic bits and parity bits as the granularity. Using a single bit segment as the granularity can also be referred to as using a set of systematic bits and parity bits as the granularity.

[0143] It should be understood that the same encoded bit sequence may include both RVs with a granularity of multiple groups of systematic bits and parity bits and RVs with a granularity of bit segments of each group of systematic bits and parity bits.

[0144] With respect to the above meaning (1), it is assumed that this type of RV is referred to as the first RV. The first RV is based on the granularity of multiple groups of system bits and check bits, which means that in the multiple groups of system bits and check bits, each bit segment composed of a group of system bits and check bits corresponds to a first RV. The bit segment composed of each group of system bits and check bits can be referred to as each group of bit segments or each bit segment. Then the RV corresponding to each group (or each) bit segment can be any position in the group of bit segments. The embodiment of the present application does not limit the position of the starting position corresponding to the RV in the bit segment.

[0145] Please refer to Figure 3C, which is a schematic diagram of an RV provided by this embodiment. As shown in (a) of Figure 3C, the encoded bit sequence consists of bit segments 1 to m corresponding to m groups of systematic bits and parity bits. Each bit segment corresponds to a first RV, which includes RV0, RV1, ...RVm-1, where RV0 corresponds to bit segment 1 (the starting position is located in bit segment 1), RV1 corresponds to bit segment 2, and so on. RVm-1 corresponds to bit segment m. It will be understood that the embodiment of the present application does not limit the numbering method of the RVs.

[0146] For example, the starting position corresponding to the first RV can be set as the starting position of RV0 of LDPC in the aforementioned NR. Taking the first RV of the encoded bit sequence as RV0 as an example, the corresponding starting position can be the first column of bit segment 1, or the third column of bit segment 1 (the first two columns are punctured columns). Correspondingly, the starting positions corresponding to other RVs can be the first column or third column of the bit segment corresponding to the RV, that is, the starting position corresponding to RVm-1 is the first column or third column of bit segment m.

[0147] Alternatively, the starting position of the first RV may correspond to the column where the systematic bit is located in each bit segment.

[0148] Alternatively, the starting position of the first RV may also correspond to other columns of each bit segment, which is not specifically limited in this embodiment.

[0149] Regarding the above meaning (2), we assume that this type of RV is called the second RV. The second RV uses the bit segment of each group of systematic bits and parity bits as the granularity, meaning that each group of systematic bits and parity bits' bit segment is divided into its own corresponding (one or more) second RVs. Therefore, each group (or each) bit segment may correspond to one or more second RVs.

[0150] As shown in (b) of FIG3C , the encoded bit sequence includes a bit segment 1 corresponding to the first group of systematic bits and parity bits, wherein bit segment 1 is divided into multiple second RVs, specifically including RV0(1), RV1(1), …RVn-1(1). That is, bit segment 1 is divided into n second RVs, where n is a value greater than or equal to 1. Other bit segments can also be divided into one or more corresponding second RVs. For example, bit segment m can include RV0(m), RV1(m), etc.

[0151] The starting position of the second RV can also be set in the same way as the RV starting position of LDPC in 5G NR. Taking bit segment 1 as an example, the starting position of RV0(1) can correspond to the first column of bit segment 1, or the third column of bit segment 1 (the first two columns are punctured columns); the starting position of RV1(1) corresponds to or where N cb represents the length of the bit segment, Zc is the size of the submatrix constituting the component code (used to encode the system bits to obtain the coding structure of the bit segment), and the settings of RV2(1) and RV3(1) are shown in Table 1, and so on. It is understood that the embodiment of the present application does not limit the numbering method of RV.

[0152] Alternatively, the starting position corresponding to the second RV may also correspond to other columns of each bit segment, which is not specifically limited in this embodiment.

[0153] 202. The first device performs data transmission based on the RV.

[0154] In the embodiment of the present application, based on the RV, its corresponding starting position (the starting position is the position of the first bit corresponding to the data transmission in the corresponding circular buffer pool) can be determined, so that the data used for transmission includes two meanings: 1) initial transmission; and 2) retransmission. The initial transmission refers to the first data transmission of the encoded bit sequence based on the starting position corresponding to the RV. The retransmission refers to the multiple transmissions of the encoded bit sequence based on the starting position corresponding to the RV.

[0155] Transmitting data based on the starting position corresponding to the RV means transmitting data starting from the bit corresponding to the starting position of the RV. In addition, in the embodiment of the present application, when the RV is the first RV or the second RV, the granularity of the transmission corresponding to the RV is also different. That is to say, transmitting data based on the starting position corresponding to the RV includes two meanings: ① In combination with the first RV, according to the starting position corresponding to the first RV, at least one bit segment corresponding to the encoded bit sequence is transmitted from the starting position as the starting point (or at least one group of system bits and check bits, which can be called a transmission granularity of multiple bit segments or multiple groups of system bits and check bits); ② In combination with the second RV, according to the starting position corresponding to the second RV, the bit segment where the second RV is located is transmitted from the starting position as the starting point (a group of system bits and check bits corresponding to the bit segment can be called a transmission granularity of one bit segment or a group of system bits and check bits). Among them, the end position of the transmitted data (or the corresponding end bit column) is not limited.

[0156] It can be understood that when data is transmitted based on the starting position corresponding to the second RV, although for each second RV, the transmission granularity is a group of system bits and check bits, but since each group of system bits and check bits can include its corresponding second RV, therefore, when multiple groups of system bits and check bits are transmitted based on the second RV of each group of system bits and check bits, the overall transmission with multiple groups of system bits and check bits as the granularity can also be realized.

[0157] In an embodiment of the present application, the first device may transmit data based on the starting position corresponding to the first RV, or may transmit data of one or more bit segments based on the starting positions corresponding to one or more second RVs; or the first device may transmit data based on the starting position corresponding to the first RV and transmit data of one or more bit segments based on the starting positions corresponding to one or more second RVs. The specific data transmission method is not limited.

[0158] Regarding the above meaning ①, taking the first RV as RV1 as an example, assuming that the starting position of RV1 corresponds to the first column of bit segment 2, then data transmission based on the starting position of RV1 and the encoded bit sequence means transmitting the encoded bit sequence starting from the first column of bit segment 2.

[0159] Please refer to Figure 3D, which is a schematic diagram of a circular buffer pool provided in an embodiment of the present application. As shown in (a) in Figure 3D, it is a circular buffer pool (buffer) of the encoded bit sequence. The entire circular buffer pool includes all encoded bit sequences. Taking the encoded bit sequence as consisting of bit segments 1 to bit segments 4 obtained by encoding with 4 component codes as an example, each bit segment corresponds to a first RV, and the encoded bit sequence corresponds to four first RVs, namely RV0 to RV3. RV0 to RV3 marked in (a) of Figure 3D correspond to the starting position of the corresponding first RV in the circular buffer pool of the encoded bit sequence.

[0160] Taking the second RV as RV0(1) as an example, assuming that the starting position of RV0(1) corresponds to the first column of bit segment 1, then data transmission based on the starting position of RV0(1) and the encoded bit sequence means transmitting a group of system bits and check bits corresponding to bit segment 1 starting from the first column of bit segment 1.

[0161] As shown in (b) of Figure 3D, it is a circular buffer pool of system bits and check bits of the group corresponding to bit segment 1. The entire circular buffer pool includes all system bits and check bits of the group corresponding to bit segment 1 (excluding system bits and check bits of the group corresponding to other bit segments). Taking the four second RVs corresponding to bit segment 1 as an example, they are RV0(1) to RV3(1). RV0(1) to RV3(1) marked in (b) of Figure 3D are the starting positions of the circular buffer pool of system bits and check bits of the group corresponding to bit segment 1 corresponding to the corresponding second RV. It can be understood that each group of bit segments may have its own corresponding second RV, so the data transmission for each group of bit segments is similar.

[0162] It is understandable that the starting position of data transmission is determined by RV. A series of processing may be performed subsequently to realize the data transmission process. Specifically, it may include rate matching, symbol modulation, subcarrier mapping or digital-to-analog conversion and other processing. Among them, the rate matching process can determine the length of the bit sequence that can be transmitted based on the time-frequency resources used for data transmission, and then determine the end position of the corresponding bit sequence in the circular buffer pool when data transmission is performed based on RV. Alternatively, when data transmission is performed based on RV, the end position of the corresponding bit sequence can also be determined by other means, such as through protocol agreement, etc., which is not specifically limited in this embodiment.

[0163] Optionally, in a downlink transmission scenario, that is, the first device is a network device and the second device at the receiving end is a UE, when the first device transmits data based on the RV and the encoded bit sequence, it can also indicate the RV to the second device so that the second device can decode based on the indicated RV.

[0164] It can be seen that in the embodiment of the present application, whether it is the first RV or the second RV, the starting position corresponding to the RV is located in one of the multiple bit segments, so that each group of system bits is associated with at least one RV, thereby enabling the data transmission performed by the transmitting end based on the starting position of the RV to achieve the transmission of each group of system bits, so that the receiving end can decode each group of system bits and obtain the group of system bits, effectively improving the data transmission efficiency. For the second RV, the starting position of the data transmission can be located with a smaller granularity, thereby more accurately selecting the corresponding RV for data retransmission for the decoding error bit (segment), thereby improving the retransmission performance.

[0165] In addition, "performing data transmission" in the embodiments of the present application may include but is not limited to: preparation for data transmission, or corresponding processing for data transmission.

[0166] The above embodiments describe the process of encoding information bits using component codes to obtain an encoded bit sequence. The following further describes the specific encoding method.

[0167] Please refer to FIG4A , which is a block diagram of an encoding process provided in an embodiment of the present application. As shown in FIG4A , the process includes:

[0168] 1) The global encoder performs global encoding on the input information bit sequence, generates redundant check bits and places them after the systematic bit sequence to obtain the globally encoded coded bit sequence.

[0169] 2) Segment the globally encoded bit sequence to obtain m globally encoded bit segments.

[0170] 3) Each globally encoded bit segment is input to a local encoder for encoding, and m bit segments are obtained. The m bit segments constitute the bit sequence corresponding to the system bit encoding.

[0171] That is, the encoding process includes adopting a global encoding process and a local encoding process.

[0172] This can be understood in conjunction with FIG4B, which is a schematic diagram of a global coupling code encoding provided by an embodiment of the present application. As shown in FIG4B, the upper half is a plurality of segmented bit sequences respectively encoded by a plurality of first component codes (local) to obtain a plurality of bit segments, including bit segments 1 to bit segments 4, wherein the first component code can be represented by a check matrix, including H core , H zero , H extend and H diagFor a detailed description, please refer to the aforementioned related description. The multiple segmented bit sequences do not overlap with each other, that is, the sub-matrices of the first component codes are uncorrelated. The multiple groups of systematic bits and parity bits corresponding to bit segments 1 to 4 constitute the encoded bit sequence (S).

[0173] The starting position of each second RV is determined by the column number to which each second RV corresponds in each bit segment.

[0174] The starting position of each first RV can be determined in two ways:

[0175] (1) It is determined by the length of the encoded bit sequence after the local encoding is completed.

[0176] The length of each locally encoded bit sequence corresponds to the length of a bit segment. The sum of the lengths of multiple locally encoded bit sequences is the length of the encoded bit sequence after the local encoding, corresponding to S, which is formed by the combination of the four first component codes in FIG4B . The starting position of the first RV is determined by S. Therefore, the set of systematic bits and parity bits corresponding to each first RV can be a bit sequence encoded by the first component code.

[0177] (2) Determined by the length of the bit sequence after global encoding.

[0178] The length of the bit sequence after global encoding corresponds to S' in Figure 4B. Since the locally encoded bit sequence is re-encoded on the globally encoded bit sequence, the length of the globally encoded bit sequence is shorter than the encoded bit sequence after encoding with the first component code, that is, S' < S. At this time, the multiple groups of systematic bits and parity bits corresponding to the first RV are the multiple segmented bit sequences before encoding with the first component code. Furthermore, the segmented bit sequences do not necessarily include both systematic bits and parity bits; they may include only systematic bits or only parity bits.

[0179] In this embodiment, since the encoded bit sequence can be firstly obtained by global encoding and then coupled with bit sequences encoded by multiple component codes, this encoding method can be referred to as global coupled code encoding.

[0180] In the global coupled code encoding scheme, because the matrices of each first component code are uncorrelated, the number of second RVs corresponding to multiple sets of systematic bits and parity bits obtained after encoding with multiple first component codes can be the same, and the number of second RVs can be greater than 1. This allows the transmission starting position of each set of systematic bits and parity bits to be selected with the same granularity during data transmission, ensuring data transmission flexibility.

[0181] Alternatively, the number of second RVs corresponding to each group of system bits and check bits may be different to achieve other transmission requirements, such as channel requirements or transmission resource requirements, etc., which is not specifically limited in the embodiments of the present application.

[0182] Another specific encoding method is described below.

[0183] Please refer to Figure 5A, which is a schematic diagram of a spatial coupling code encoding provided by an embodiment of the present application. As shown in Figure 5A, an example of a check matrix for a spatial coupling code is given. At the transmitting end (also referred to as the encoding side, in the embodiment of the present application, the first device), block convolution encoding is performed with the component code as the granularity. The component code can be in the form of a generator matrix or a check matrix. Figure 5A shows a spatial coupling structure based on a check matrix. The coupling is reflected in the fact that some rows of the check matrices of two adjacent component codes overlap. Corresponding to Figure 5A, the check matrices H1, H2, and H3 corresponding to the component codes in the first row may overlap with the check matrices of the component codes in the second row. This is reflected in the encoding process in that some or all of the systematic bits and / or check bits generated by the previous component code participate in the encoding of the next component code. By using this coupling structure, better encoding performance than a single component code can be obtained, which is equivalent to the performance of a single component code with a longer code length.

[0184] On the encoding side, spatially coupled codes can be convolutionally encoded indefinitely, similar to convolutional codes. However, in reality, continuous data traffic rarely exists. Therefore, the encoding side typically sets a coding window within which the spatially coupled code structure is constructed. On the decoding side, given limitations such as product hardware capabilities, processing latency, and storage overhead, a decoding window L is often also set, where L represents the maximum number of component codes that can be jointly decoded at the decoding end. Therefore, in the aforementioned RV design, RV division is also combined with either the coding window or the decoding window.

[0185] Furthermore, different matrix elements in the overlapping portion may correspond to different meanings. For example, when the component codes are LDPC codes, when H2 and H3 in the overlapping portion are non-zero matrices, the redundant bits generated by the previous component code also participate in the encoding of the next component code, resulting in stronger coupling. When H2 and H3 in the overlapping portion are zero matrices, only the systematic bits of the previous component code participate in the encoding of the next component code, resulting in weaker coupling.

[0186] In a possible implementation, the encoded bit sequence is generated by encoding multiple segmented bit sequences using multiple second component codes, wherein a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of a previous segmented bit sequence.

[0187] In this embodiment, a second component code is used to encode multiple segmented bit sequences. During encoding, it is assumed that the previous segmented bit sequence and the next segmented bit sequence are included. The next segmented bit sequence includes all or part of the systematic bit sequence of the previous segmented bit sequence, and may even include part of the parity bit sequence of the previous segmented bit sequence. In the coded bit sequence generated using this encoding method, the bit segments corresponding to the set of systematic bits and parity bits obtained by encoding each component code are spatially coupled to each other. Therefore, this encoding method is also referred to as spatially coupled code encoding.

[0188] For the encoded bit sequence obtained by spatial coupling code encoding, its corresponding first RV and second RV can also be determined. The method for determining the first RV can refer to the RV0 division method of the aforementioned NR LDPC. For example, the second RV corresponding to the bit segment 1 of the encoded bit sequence, the starting position can correspond to the first column or the third column of the bit segment 1 (the first two columns are punctured columns), and correspondingly, the starting position corresponding to other RVs can be the first column or the third column of the bit segment corresponding to the RV. It can be understood that the first RV can also correspond to other starting positions, which is not specifically limited in this embodiment.

[0189] The second RV may be determined according to the characteristics of spatial coupling code encoding.

[0190] In one possible implementation, among the multiple bit segments, the number of second RVs corresponding to edge bit segments (corresponding to edge group systematic bits and parity bits) is greater than that of non-edge bit segments (corresponding to non-edge group systematic bits and parity bits), where the edge bit segment is the first or last bit segment. Alternatively, the edge bit segments may be the first M and / or last N bit segments, where M and N are integers greater than or equal to 1 and may be equal or different.

[0191] After multiple segmented bit sequences of information bits are encoded using a spatially coupled code, a coded bit sequence is obtained, which includes a bit segment corresponding to each systematic bit and parity bit in the multiple sets of systematic bits and parity bits. The total length of the multiple sets of systematic bits and parity bits is within the range of a coding window length.

[0192] For example, assuming that there are four second component codes in the coding window, due to the characteristics of spatial coupling code coding, the check bits generated by the subsequent component code also contain the information of the systematic bits or check bits corresponding to the previous component code, that is, the check bits of the subsequent component code can be used to correct the bit errors of the previous component code. Therefore, the second RV is defined as RVi(l), where l represents the index value of the second component code in the decoding window, and i represents the index value of the second RV in the corresponding second component code. One possible approach is to define only the bit segment encoded by the last second component code to correspond to multiple second RVs, and for the bit segments of the multiple second component codes of the previous stage, only the first second RV, i.e., RV0(l), is defined. In this way, the retransmission of the bit segment of the second component code before the last second component code (the previous second component code) can ensure that the corresponding systematic bits in each second component code bit segment can be retransmitted, thereby ensuring the decoding performance and self-decoding capability of each previous second component code. Only the last bit segment of the second component code corresponds to more second RVs (incremental redundancy). This ensures performance while also ensuring lower coding complexity and storage overhead, without the need to set a larger circular buffer pool storage overhead for each bit segment of the second component code.

[0193] Please refer to Figure 5B, which is a method for dividing the RV of a coded bit sequence provided in an embodiment of the present application. As shown in Figure 5B, each group of system bits and check bits corresponds to a first RV in the bit segment corresponding to the bit segment. The first RV corresponding to bit segment 1 is RV0, the first RV corresponding to bit segment 2 is RV1, and so on. The first RV corresponding to bit segment 4 is RV3.

[0194] On the other hand, each group of systematic bits and parity bits has its corresponding second RV. The second RVs corresponding to bit segments 1 to 3 are RV0(1), RV0(2), and RV0(3), respectively. When the number of second RVs in a bit segment is 1, the first RV and the second RV of each bit segment can correspond to the same starting position (the description method can be different, for example, the starting position corresponding to the first RV can be described by the global bit sequence length, and the starting position corresponding to the second RV can be described by the global bit sequence length or by the bit sequence length of the bit segment).

[0195] Bit segment 4 is the last bit segment in the coding window L, and its corresponding second RV number is the largest. As shown in Figure 5B, the second RV of bit segment 4 includes RV0(4), RV1(4) and RV2(4), among which RV0(4) and the first RV (RV3) corresponding to bit segment 4 can correspond to the same starting position.

[0196] Alternatively, within a coding window, the multiple second RVs of incremental redundancy are not set in the bit segment of the last second component code, but instead are set in the bit segment of the first second component code within the coding window. Due to the convolutional structure of the spatially coupled code, the decoding capability of subsequent multiple second component codes can be enhanced by transmitting more systematic bits or parity bits in the bit segment of the first second component code.

[0197] Please refer to Figure 5C , which illustrates another RV partitioning method for a coded bit sequence provided in an embodiment of the present application. As shown in Figure 5C , each bit segment corresponding to each set of systematic bits and parity bits corresponds to a first RV, bit segment 1 corresponds to three second RVs, and bit segments 2 through 4 correspond to one second RV. Similarly, for a bit segment corresponding to a second RV, the second RV and the first RV can correspond to the same starting position.

[0198] As can be seen, in this embodiment of the present application, the multiple groups of systematic bits and parity bits encoded with the spatial coupling code are divided into second RVs, wherein the bit segments of the edge group systematic bits and parity bits correspond to more second RVs, and the bit segments of the non-edge group systematic bits and parity bits correspond to fewer second RVs. This reduces coding complexity and storage overhead while ensuring the decoding capability of the second component code.

[0199] The above embodiment describes the data transmission process based on RV, wherein the data transmission includes initial transmission and retransmission. The retransmission process is further described below.

[0200] Please refer to FIG6A , which is a flowchart of another communication method provided in an embodiment of the present application. The method includes steps 201-202 as described above in FIG3A , and further includes:

[0201] 203. The second device receives data transmitted by the first device based on the RV. The data transmission corresponds to the first data, and the second device decodes the first data.

[0202] The first data can be the encoded bit sequence obtained by the aforementioned first device, which is further processed by subsequent processing, such as symbol modulation, multiple-input multiple-output (MIMO) precoding, subcarrier mapping, and inverse fast Fourier transform (IFFT), to complete the processing of the baseband signal and obtain the first data to be sent.

[0203] After receiving the first data, the second device performs inverse processing corresponding to the first device, such as converting the RF signal of the first data into a baseband signal, performing FFT, subcarrier demapping, MIMO decoding, symbol demodulation (constellation point demapping), bit sequence decoding, etc. After symbol demodulation, the pre-decoding bit sequence obtained should be the same as the pre-encoding bit sequence obtained by the first device (symbol demodulation may also include processing the soft-value pre-decoding bit sequence to obtain a hard-value pre-decoding bit sequence that does not include floating-point numbers).

[0204] The second device decodes the first data, that is, decodes the pre-decoding bit sequence.

[0205] Since the first data may be sent by the first device based on the first RV and multiple groups of system bits and check bits, or may be sent by the first device based on the second RV and a group of system bits and check bits, the bit sequence before decoding may correspond to multiple groups of system bits and check bits, or may correspond to a group of system bits and check bits.

[0206] The second device in the embodiment of the present application may be a network device, a UE, or other network elements capable of coding and communication, such as a chip applicable to a network device or a chip applicable to a terminal device.

[0207] After receiving the first data, the second device decodes the first data, including global coupling decoding for the aforementioned global coupling coding, or spatial coupling decoding for the aforementioned spatial coupling coding, to obtain information bits therein.

[0208] Specifically, assuming that the bit sequence before decoding corresponds to multiple groups of systematic bits and check bits obtained by spatial coupling coding, the first component code corresponding to each group of systematic bits and check bits can be used to decode the group of systematic bits and check bits to obtain the group of systematic bits, and then the global code can be used to decode the multiple groups of systematic bits to obtain information bits.

[0209] Assuming that the bit sequence before decoding corresponds to multiple groups of systematic bits and check bits obtained by spatial coupling coding, the second component code corresponding to each group of systematic bits and check bits can be used to decode the group of systematic bits and check bits to obtain the group of systematic bits, and multiple groups of systematic bits constitute information bits.

[0210] It is understandable that the above decoding process is only one possible decoding method, and the embodiments of the present application do not limit this.

[0211] 204. The second device sends first information to the first device, where the first information indicates that a decoding error exists in the data transmitted based on the RV.

[0212] When the second device decodes the first data, a decoding error may occur. In this case, the second device may send feedback information (first information) to indicate that the data transmitted by the first device (based on the RV) has a decoding error, or to indicate that the data needs to be retransmitted.

[0213] The feedback information may be, for example, acknowledgments (ACK) or negative acknowledgments (NACK). ACK information indicates that there are no decoding errors and retransmission is not required. NACK information indicates that there are decoding errors and retransmission is required. Some possible implementations may determine the above feedback information based on hybrid automatic repeat request (HARQ) technology.

[0214] The feedback information may be indicated by 1 bit. For example, when the 1 bit is 0, it corresponds to ACK information, and when the 1 bit is 1, it corresponds to NACK information.

[0215] It can be understood that, since the first device can transmit data based on the starting position corresponding to the first RV, or transmit data of one or more bit segments based on the starting position corresponding to one or more second RVs; or the first device can transmit data based on the starting position corresponding to the first RV, and transmit data of one or more bit segments based on the starting position corresponding to one or more second RVs. Therefore, when there is a decoding error in the feedback information, it can be used to feedback the decoding error of the data transmission based on the first RV, or it can be used to feedback the decoding error of the bit segment of any one or more second RVs in the data transmission based on multiple second RVs. It can also be used to feedback any decoding error in the data transmission based on the first RV and the second RV. There is no specific limitation.

[0216] For example, assuming that the first device performs data transmission based on the first RV (or the second RV), when the first device receives 1 bit of feedback information sent by the second device, it can be known that there is a decoding error in the data transmission based on the first RV (or the second RV) and retransmission is required.

[0217] Assume that a first device performs data transmission based on a first RV and a second RV. When the first device receives 1 bit of feedback information sent by the second device, it determines that a decoding error exists in the data transmission based on the first RV and the second RV. The decoding error may exist in the data transmission based on the first RV, the data transmission based on the second RV, or both the data transmission based on the first RV and the second RV. The first device determines that data retransmission is required based on the 1 bit of feedback information.

[0218] In one possible implementation, since the first device can transmit each bit segment based on the second RV of each bit segment, the second device can send 1 bit of feedback information for each bit segment. Specifically, the first information may include a bit map to indicate whether there is a decoding error in each bit segment. For example, the first device transmits the bit segment based on the starting position of the second RV of each bit segment in bit segments 1 to 3. The bit map includes 3 bits, and each bit feeds back the decoding result of a bit segment, 1 indicates a decoding error, and 0 indicates correct decoding. Then, assuming that the bit map corresponding to the first information is 001, it means that there is a decoding error in bit segment 3, and there is no decoding error in bit segments 1 and 2.

[0219] Alternatively, the first information may also send feedback information only for the bit segment with a decoding error, and then indicate the bit segment with the decoding error through other bits (segments). For example, the first device transmits the bit segment based on the starting position of the second RV of each bit segment in bit segments 1 to 3, where bit segment 2 has a decoding error. The first information may include 1 bit of NACK information and a 2-bit (corresponding to the number of bit segments 3) error bit segment indication field, whose value is 11, and the first information indicates that bit segment 3 has a decoding error.

[0220] In addition, the first information corresponds to the bit map 001, which means that the first information includes 2 ACK information and 1 NACK information.

[0221] The first information may be carried in a physical uplink shared channel (Physical Uplink Shared Channel, PUSCH), a physical downlink shared channel (Physical Downlink Shared Channel, PDSCH), or other channels, which is not limited in the embodiment of the present application.

[0222] 205. The first device receives the first information, and retransmits data based on the first information and the next RV.

[0223] When the first information indicates that there is a decoding error in the data transmitted based on the RV, the first device may retransmit based on the first information and the next RV. The next RV is relative to the RV of the last transmission, that is, the RV used for the current transmission.

[0224] Optionally, the first data of the last transmission (which may be the initial transmission) may be one of the following two situations: 1) a coded bit sequence transmitted based on the starting position corresponding to the first RV (hereinafter, data transmitted based on the first RV refers to data with multiple bit segments of the coded bit sequence as the transmission granularity). 2) a bit segment in which the second RV is located is transmitted based on the starting position corresponding to the second RV and the second RV (hereinafter, data transmitted based on the second RV refers to data with the bit segment in which the second RV is located as the transmission granularity).

[0225] For case 1), the first data can be retransmitted based on the next first RV. For example, assuming the first data is first transmitted based on RV0, multiple first RVs can be traversed in a preset order, such as RV0, RV2, RV3, and RV1. In this case, the next first RV can be RV2, i.e., the first data is retransmitted based on RV2. Alternatively, other first RVs other than RV0 can be randomly traversed, in which case the next first RV can also be RV3, i.e., the first data is retransmitted based on RV3.

[0226] For case 2), the first data can be retransmitted based on the next second RV. For example, assuming that the first data is first transmitted based on RV0(1), the next second RV can be RV1(1) (traversing multiple second RVs in a preset order), that is, the first data is retransmitted based on RV1(1). Alternatively, the next first RV can also be RV2(1) (randomly traversing multiple second RVs), that is, the first data is retransmitted based on RV2(1).

[0227] In one possible implementation, step 205 can be implemented in combination with the aforementioned step 201, that is, determining the RV in step 201 is based on the first information, and determining the RV can also be described as determining the next RV. In this case, steps 201 to 205 form a cyclic process.

[0228] As can be seen, in this embodiment of the present application, the second device indicates through the first information that the data transmitted based on the RV contains a decoding error, causing the first device to determine whether to retransmit the data based on the next RV based on the first information. In this process, since each RV corresponds to a set of system bits and check bits, each retransmission can correspond to at least one set of system bits, improving retransmission performance. For data retransmission of the second RV, the granularity of the retransmission bit sequence is more accurately divided, reducing the resource consumption of data retransmission while ensuring retransmission performance.

[0229] Alternatively, reference may be made to FIG6B , which is a flowchart of another communication method provided in an embodiment of the present application. The method includes steps 201-203 in FIG6A , and further includes:

[0230] 206. The second device sends second information to the first device, where the second information is used to indicate a target RV.

[0231] The second device determines the bit segment with decoding errors, determines the target RV based on the bit segment with decoding errors, and then indicates the target RV to the first device so that the first device performs data transmission based on the target RV.

[0232] In this scenario, the first device is a UE and the second device is a network device, or the second device is a UE used to control transmission in UE-to-UE communication.

[0233] That is, after the data transmission in steps 201 to 203 , the receiving device indicates the target RV for subsequent data transmission.

[0234] There are two cases for determining the target RV based on the bit segment with decoding errors:

[0235] a. Determine the first RV corresponding to the bit segment with decoding error as the target RV.

[0236] For example, see Figure 6C , which illustrates a process for determining a target RV according to an embodiment of the present application. As shown in Figure 6C , the decoding errors occur in multiple bits in bit segment 2, and a small number of decoding error bits also exist in bit segments 3 and 4. This indicates that the decoding error bits are numerous and dispersed, so the first RV corresponding to bit segment 2, i.e., RV1, can be determined as the target RV.

[0237] b. Determine the second RV corresponding to the decoding error bit in the decoding error bit segment as the target RV.

[0238] For example, please refer to Figure 6D, which is a schematic diagram of another process for determining the target RV provided by an embodiment of the present application. As shown in Figure 6D, the bit segment with decoding error is bit segment 1. Furthermore, the decoding error bit can be located as sub-bit segment 1, and the sub-bit segment 1 corresponds to RV1(1) of bit segment 1 (the number of bits away from the starting position corresponding to RV1(1) is the least). In addition, there are no decoding error bits in other bit segments. The decoding error bits are numerous and concentrated, so the target RV is one of the second RVs in bit segment 1.

[0239] The target RV determined for the above case a is called a target first RV, and the target RV determined for the above case b is called a target second RV.

[0240] In some possible cases, bits with decoding errors may be concentrated in a certain bit segment and distributed in multiple bit segments. Therefore, the target RV may also include a target first RV and a target second RV.

[0241] The second information may be carried in DCI, including uplink DCI or downlink DCI, wherein uplink DCI refers to control information sent by a network device for scheduling PUSCH, and downlink DCI refers to control information for indicating PDSCH-related configuration parameters of a network device.

[0242] Specifically, the DCI may include an independent target first RV indication field, which is used to indicate the target first RV for data retransmission, or an independent target second RV indication field, which is used to indicate the second RV corresponding to data retransmission.

[0243] Or it may further include a target RV indication field, used to indicate the target RV, and combined with the RV granularity indication field, used to indicate whether the target RV indication field corresponds to the first RV or the second RV.

[0244] Optionally, a combined indication field for indicating a target first RV and a target second RV corresponding to data retransmission may also be included.

[0245] The target second RV indication field may be in the form of a bitmap, where the second RV of each bit segment corresponds to some of the bits in the bitmap. For example, assuming the bitmap includes 4 bits, with each bit corresponding to the target second RV of a bit segment, a bitmap of 0010 indicates that bit segments 1, 2, and 4 are retransmitted according to the starting position corresponding to RV0, and bit segment 3 is retransmitted according to the starting position corresponding to RV1. When the number of second RVs corresponding to a bit segment is greater, each bit segment may correspond to more bits in the bitmap.

[0246] In addition, in a scenario where UE communicates with UE, the second information may be carried in sidelink control information (SCI).

[0247] In other possible cases, the second information may also be carried in other information, which is not specifically limited in the embodiments of the present application.

[0248] 207. The first device receives the second information and retransmits data based on the target RV.

[0249] The first device retransmits data based on the target RV and the encoded bit sequence, that is, retransmits data based on the target first RV, or retransmits data based on the target second RV.

[0250] As can be seen, in the embodiment of the present application, when the second device determines at least one group of bit segments with decoding errors, it can instruct the first device to retransmit data based on the target first RV corresponding to the bit segment. Since each RV corresponds to a group of system bits and check bits, each retransmission can correspond to at least one group of system bits, thereby improving retransmission performance. In addition, the second device can further determine the target second RV based on the corresponding bit segment based on the decoding error bits to retransmit data, instructing the first device to retransmit the bit sequence with more precise granularity, while ensuring retransmission performance and reducing resource consumption for data retransmission.

[0251] In one possible implementation, step 207 can be implemented in combination with the aforementioned step 201, that is, determining the RV in step 201 is based on the second information, and determining the RV can also be described as determining the next RV. In this case, steps 201 to 207 form a cyclic process.

[0252] If possible, the method of the embodiment of the present application may include steps 201 to 207 at the same time, and the relevant steps may also be performed in other orders. The steps in the above method should not limit the implementation method of the embodiment of the present application.

[0253] It can be understood that the implementations corresponding to the above-mentioned Figures 6A to 6D are applicable to any one of the two encoding methods proposed in Figures 4B, 5A and 5B, but are not limited to the above-mentioned two encoding methods.

[0254] The above process describes how the second device instructs the first device to retransmit data according to the determined circular buffer pool and RV when a decoding error occurs. In some possible cases, for the global coupling code encoding method, when the first device receives feedback information about a decoding error, it can also perform the following operations:

[0255] 1) When the first device receives feedback information indicating a decoding error in data transmission based on the first RV, it indicates that the decoding error bits are dispersed. A global code check matrix can be used to generate more check bits, and correspondingly, more first component code matrices are expanded to perform first component code encoding on the newly added global check bits in the global code check matrix. This then generates more additional bit segments, and then, based on the additional bit segments, more additional first RVs corresponding to the additional bit segments are divided, i.e., the starting position corresponding to the additional first RV is located within the additional bit segments.

[0256] When the first device is a network device, data can be retransmitted based on the newly added first RV so that the retransmitted coded bit sequence includes fewer decoding error bits. The first device indicates the newly added first RV to the UE via DCI so that the UE performs corresponding decoding.

[0257] 2) If the first device receives feedback information of data transmission decoding errors based on the first RV and the second RV at the same time, it means that the decoding error bits are partially dispersed in the entire encoded bit sequence and partially concentrated in one or some bit segments.

[0258] The first device then determines, in the encoded bit sequence, a first type of bit segment corresponding to the systematic bit portion in the globally encoded bit sequence (i.e., the segmented bit sequence encoded by the first type of bit segment is the systematic bit portion encoded by the global code), and uses the next second RV of the first type of bit segment to retransmit the first type of bit segment. For the parity bit portion in the globally encoded bit sequence, the global code parity check matrix can be used to first generate more new global parity bits, and then the new global parity bits can be encoded with the first component code to generate new bit segments, and then one or more second RVs corresponding to each new bit segment can be divided. Finally, the second RV of the new bit segment is used to transmit the data corresponding to the new bit segment.

[0259] Through the above method, more segmented bit sequences can be generated by expanding the global code check bits, and the segmented bit sequences can be encoded using the first component code to obtain more newly added bit segments, so that the decoding accuracy of data retransmission based on the newly added bit segments is improved, thereby improving the retransmission performance.

[0260] In a possible implementation, data transmission of the first device corresponds to multiple hybrid automatic repeat request HARQ processes, and before receiving feedback information for one HARQ process, the next HARQ process of the multiple HARQ processes is started.

[0261] Please refer to Figure 6E, which is a schematic diagram of a first device performing multi-process data transmission provided by an embodiment of the present application. As shown in Figure 6E, the first device performs data transmission through three HARQ processes (1), (2), and (3), and each HARQ process corresponds to one RV-based data transmission. The round-trip time (RTT) of each HARQ process is greater than the transmission interval of adjacent HARQ processes. That is, before receiving the feedback information of HARQ process (1), the first device can simultaneously send HARQ process (2). That is, the first device can simultaneously perform data transmission based on multiple RVs.

[0262] For example, the first device performs data transmission of bit segment 1 (based on the second RV of bit segment 1) through HARQ process (1). Before receiving feedback information for bit segment 1, the first device can perform data transmission of bit segment 2 (based on the second RV of bit segment 2) through HARQ process (2).

[0263] Adopting the method of the embodiment of the present application can further improve the concurrent transmission efficiency of the first device.

[0264] As shown in the structural diagram of the communication device in Figure 7, the embodiment of the present application also provides a communication device 1200, which can be a terminal device, or can be a device (such as a chip, circuit, etc.) used for but not limited to a terminal device, or can be a network device, or can be a device (such as a chip, circuit, etc.) used for but not limited to a network device. The communication device may include corresponding modules or units for implementing the method or process corresponding to the first device implementation in each of the above embodiments. In one possible implementation, the communication device 1200 includes a determination unit 1201 and a processing unit 1202. In one possible implementation, wherein,

[0265] a determining unit 1201, configured to determine a redundancy version RV corresponding to an encoded bit sequence, where the encoded bit sequence includes multiple bit segments, each of the multiple bit segments includes a systematic bit, and a starting position corresponding to the RV is located in one of the multiple bit segments;

[0266] The processing unit 1202 is configured to perform data transmission based on the RV.

[0267] Optionally, the RV includes a first RV, the first RV has a granularity of multiple bit segments, and data transmission based on the RV includes: according to the starting position corresponding to the first RV, transmitting at least one bit segment corresponding to the encoded bit sequence from the starting position as the starting point.

[0268] Optionally, the RV includes a second RV, and the second RV uses each bit segment in multiple bit segments as granularity. Data transmission based on the RV includes: according to the starting position corresponding to the second RV, transmitting the bit segment where the second RV is located starting from the starting position.

[0269] Optionally, the encoded bit sequence is generated by encoding with a global coupled code.

[0270] Optionally, the encoded bit sequence is generated by encoding a plurality of segmented bit sequences respectively using a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

[0271] Optionally, the encoded bit sequence is generated by encoding with a spatially coupled code.

[0272] Optionally, the encoded bit sequence is generated by encoding multiple segmented bit sequences respectively using multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of a previous segmented bit sequence.

[0273] Optionally, the number of second RVs corresponding to each bit segment is the same and greater than 1.

[0274] Optionally, among the multiple bit segments, the number of second RVs corresponding to the edge bit segment is greater than that of the non-edge group bit segment, where the edge bit segment is the first or last one among the multiple bit segments.

[0275] Optionally, the processing unit 1202 is further configured to: receive first information indicating that a decoding error exists in data transmitted based on the RV; and retransmit the data based on the first information and a next RV.

[0276] Optionally, the first information includes 1 bit, and when the value of 1 bit is the first value, it indicates that there are decoding errors in multiple bit segments; or the first information includes a bit map, and the bit map is used to indicate that there are one or more bit segments with decoding errors among multiple bit segments.

[0277] Optionally, the first information includes negative acknowledgement (NACK) information.

[0278] Optionally, the processing unit 1202 is further used to: receive second information, where the second information is used to indicate a target RV; and retransmit data based on the target RV.

[0279] Optionally, the second information is carried in downlink control information DCI.

[0280] It can be understood that, for the functions of each module or unit of the communication device 1200, reference can be made to the corresponding description of the aforementioned method embodiment, and no further details will be given here.

[0281] In some possible implementations, the determination unit 1201 and processing unit 1202 may be deployed in a processor. Optionally, the units may be combined with a transceiver unit, or include the functionality of a transceiver unit, to implement the aforementioned related methods. The transceiver unit may be deployed in a unit or module capable of transmitting and receiving information, such as a transceiver, a transceiver antenna, or an input / output interface.

[0282] In one possible design, when the communication device 1200 is a transmitting device (e.g., a terminal device or a network device) or a communication module in a transmitting device, the functions of the determining unit 1201 and the processing unit 1202 can be implemented by one or more processors. Specifically, the processor can include a modem chip, or a system-on-chip (SoC) chip or SIP chip containing a modem core. The functions of the transceiver unit can be implemented by a transceiver circuit.

[0283] In one possible design, when the communication device 1200 is a circuit or chip responsible for communication functions in a transmitting device (e.g., a terminal device or a network device), such as a modem chip or a system-on-chip (SoC) chip or SIP chip containing a modem core, the functions of the determination unit 1201 and the processing unit 1202 can be implemented by a circuit system including one or more processors or processor cores in the above chip. The functions of the transceiver unit can be implemented by an interface circuit or data transceiver circuit on the above chip.

[0284] As shown in the structural diagram of the communication device in Figure 8, the embodiment of the present application also provides a communication device 1300, which can be a terminal device, or can be a device (such as a chip, circuit, etc.) used for but not limited to a terminal device, or can be a network device, or can be a device (such as a chip, circuit, etc.) used for but not limited to a network device. The communication device can be a corresponding module or unit for implementing the method or process corresponding to the second device implementation in each of the above embodiments. In one possible implementation, the communication device 1300 includes an input unit 1301 and a processing unit 1302. In one possible implementation, wherein,

[0285] An input unit 1301 receives data transmitted based on an RV, where a starting position corresponding to the RV is located in a plurality of bit segments included in a bit sequence before decoding, each bit segment including a systematic bit;

[0286] The processing unit 1302 is configured to send first information or second information, wherein the first information indicates that a decoding error exists in data transmitted based on the RV; and the second information is used to indicate a target RV.

[0287] In some possible implementations, the RV includes a first RV, and the first RV has a granularity of multiple bit segments.

[0288] In some possible implementations, the RV includes a second RV, and the second RV has a granularity of each bit segment in the plurality of bit segments.

[0289] In some possible implementations, the bit sequence before decoding is generated by encoding with a global coupled code.

[0290] In some possible implementations, the bit sequence before decoding is generated by encoding a plurality of segmented bit sequences respectively using a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

[0291] In some possible implementations, the bit sequence before decoding is generated by encoding with a spatially coupled code.

[0292] In some possible implementations, the bit sequence before decoding is generated by encoding multiple segmented bit sequences using multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of the previous segmented bit sequence.

[0293] In some possible implementations, the number of second RVs corresponding to each bit segment is the same and greater than 1.

[0294] In some possible implementations, among the multiple bit segments, the number of second RVs corresponding to the edge bit segment is greater than that of the non-edge bit segment, where the edge bit segment is the first or last one among the multiple bit segments.

[0295] In some possible implementations, the first information includes negative acknowledgement (NACK) information.

[0296] In some possible implementations, the second information is carried in downlink control information DCI.

[0297] It can be understood that, for the functions of the various modules or units of the communication device 1300, reference can be made to the corresponding description of the aforementioned method embodiment, and no further description is given here.

[0298] It is understandable that the above-mentioned processing unit and input unit can also be implemented by other hardware circuits as long as the corresponding functions can be achieved. The embodiments of the present application do not limit this. For example, the processing unit can be a decoder, or a processor combined with a decoding function.

[0299] In one possible design, when the communication device 1300 is a receiving device (e.g., a terminal device or a network device) or a communication module within a receiving device, the functions of the processing unit 1302 may be implemented by one or more processors. Specifically, the processor may include a modem chip, or a system-on-chip (SoC) chip or SIP chip containing a modem core. The functions of the input unit may be implemented by a transceiver circuit.

[0300] In one possible design, when the communication device 1300 is a receiving device (e.g., a terminal device or a network device) or a circuit or chip within the receiving device responsible for communication functions, such as a modem chip or a system-on-chip (SoC) chip or SIP chip containing a modem core, the functions of the processing unit 1302 can be implemented by a circuit system including one or more processors or processor cores within the aforementioned chip. The functions of the input unit can be implemented by an interface circuit or data transceiver circuit within the aforementioned chip.

[0301] As shown in Figure 9, Figure 9 shows a schematic diagram of the hardware structure of a communication device 1400 in an embodiment of the present application. The structure of the communication device 1200 or the communication device 1300 can refer to the structure shown in Figure 9.

[0302] The communication device 1400 includes a processor 1401. Optionally, the communication device 1400 may further include an interface circuit 1402, with the processor 1401 and the interface circuit 1402 being coupled to each other. It will be appreciated that the interface circuit 1402 may be a transceiver or an input / output interface. Optionally, the communication device 1400 may further include a memory 1403 (indicated by a dotted line in the figure), which is used to store instructions executed by the processor 1401, or to store input data required by the processor 1401 to execute instructions, or to store data generated after the processor 1401 executes instructions.

[0303] As an implementation method, the functions of the interface circuit 1402 may be implemented by a transceiver circuit or a dedicated transceiver chip. The processor 1401 may be implemented by a dedicated processing chip, a processing circuit, a processor, or a general-purpose chip. The processor may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP. The processor may further include a hardware chip or other general-purpose processor. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0304] It should also be understood that the memory mentioned in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM bus random access memory (DR RAM). It should be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0305] An embodiment of the present application provides a computer storage medium storing a computer program, wherein the computer program includes instructions for executing the corresponding operations in the above embodiments on the first device or the second device.

[0306] An embodiment of the present application provides a computer program product including instructions, which, when executed on a computer, enables the computer to execute the corresponding instructions in the above embodiment for the first device or the second device.

[0307] An embodiment of the present application provides a communication system, which includes the first device and the second device in the above embodiment.

[0308] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0309] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0310] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0311] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0312] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0313] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0314] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0315] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in the present application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A communication method, characterized in that: The method comprises: Determining a redundancy version RV corresponding to an encoded bit sequence, wherein the encoded bit sequence includes a plurality of bit segments, each of the plurality of bit segments includes a systematic bit, and a starting position corresponding to the RV is located in one of the plurality of bit segments; Data transmission is performed based on the RV.

2. The method according to claim 1, characterized in that The RV includes a first RV, the first RV uses the multiple bit segments as granularity, and the data transmission based on the RV includes: according to the starting position corresponding to the first RV, transmitting at least one bit segment corresponding to the encoded bit sequence from the starting position as the starting point.

3. The method according to claim 1 or 2, characterized in that The RV includes a second RV, and the second RV uses a bit segment in the multiple bit segments as a granularity. The data transmission based on the RV includes: according to the starting position corresponding to the second RV, transmitting the bit segment where the second RV is located starting from the starting position.

4. The method according to any one of claims 1 to 3, characterized in that The encoded bit sequence is generated by encoding with a global coupled code.

5. The method according to claim 4, characterized in that The encoded bit sequence is generated by encoding a plurality of segmented bit sequences respectively by a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

6. The method according to any one of claims 1 to 3, characterized in that The encoded bit sequence is generated by encoding with a spatially coupled code.

7. The method according to claim 6, characterized in that The encoded bit sequence is generated by encoding multiple segmented bit sequences respectively by multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a portion of the systematic bit sequence of a previous segmented bit sequence.

8. The method according to claim 7, characterized in that Among the multiple bit segments, the number of second RVs corresponding to the edge bit segment is greater than that of the non-edge bit segment, wherein the edge bit segment is the first and / or the last of the multiple bit segments.

9. The method according to any one of claims 1 to 8, characterized in that The method further comprises: receiving first information indicating that a decoding error exists in data transmitted based on the RV; Data is retransmitted based on the first information and the next RV.

10. The method according to claim 9, characterized in that The first information includes 1 bit, and when the value of the 1 bit is a first value, it indicates that there is a decoding error in the multiple bit segments; or The first information includes a bit map, where the bit map is used to indicate one or more bit segments in the multiple bit segments that have decoding errors.

11. The method according to any one of claims 3 to 9, characterized in that: The method further comprises: receiving second information, where the second information is used to indicate a target RV; Data is retransmitted based on the target RV.

12. The method according to claim 11, characterized in that The second information is carried in downlink control information DCI.

13. A communication method, characterized in that: The method comprises: receiving data transmitted based on an RV, where a starting position corresponding to the RV is located in a plurality of bit segments included in a bit sequence before decoding, each bit segment including a systematic bit; Sending first information or second information, wherein the first information indicates that there is a decoding error in data transmitted based on the RV, and the second information is used to indicate a target RV.

14. The method according to claim 13, characterized in that The RV includes a first RV, and the first RV uses the multiple bit segments as granularity.

15. The method according to claim 13 or 14, characterized in that The RV includes a second RV, and the second RV uses a bit segment in the multiple bit segments as a granularity.

16. The method according to any one of claims 13 to 15, characterized in that: The bit sequence before decoding is generated by global coupling code encoding.

17. The method according to claim 16, characterized in that The bit sequence before decoding is generated by encoding a plurality of segmented bit sequences respectively by a plurality of first component codes, and the plurality of segmented bit sequences do not overlap with each other.

18. The method according to any one of claims 13 to 15, characterized in that: The bit sequence before decoding is generated by spatial coupling code encoding.

19. The method according to claim 18, characterized in that The bit sequence before decoding is generated by encoding multiple segmented bit sequences respectively by multiple second component codes, and among the multiple segmented bit sequences, a subsequent segmented bit sequence includes at least a partial systematic bit sequence of a previous segmented bit sequence.

20. The method according to claim 19, characterized in that Among the multiple bit segments, the number of second RVs corresponding to the edge bit segment is greater than that of the non-edge bit segment, wherein the edge bit segment is the first or the last of the multiple bit segments.

21. The method according to any one of claims 13 to 20, characterized in that: The second information is carried in downlink control information DCI.

22. A communication device, characterized in that: The method comprises a unit for executing the method according to any one of claims 1 to 12, or a unit for executing the method according to any one of claims 13 to 20.

23. A communication device, comprising a memory and one or more processors; the memory is used to store part or all of the necessary computer programs or instructions for implementing the functions involved in any one of claims 1-12 or any one of claims 13-20; the one or more processors can execute the computer programs or instructions, and when the computer programs or instructions are executed, the communication device implements the method in any possible design or implementation of claims 1-12 or claims 13-20.

24. A communication system, characterized in that: The system comprises the communication device according to claim 22 or claim 23.

25. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions instruct the communication device to execute the method according to any one of claims 1 to 12, or the computer instructions instruct the communication device to execute the method according to any one of claims 13 to 20.

26. A circuit, characterized in that include: A processor and an interface, configured to execute a computer program or instruction stored in a memory, to execute the method according to any one of claims 1 to 12, or to execute the method according to any one of claims 13 to 20.

27. A computer program product, comprising: a computer program, code, or instructions, which, when the computer program is executed, enables a computer to execute the method according to any one of claims 1 to 12, or the method according to any one of claims 13 to 20.

Images