Communication method, and apparatus

WO2026233097A1PCT designated stage Publication Date: 2026-11-12HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2026/091844
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2025-05-07
Filing Date
2026-04-21
Publication Date
2026-11-12

Smart Images

  • Figure CN2026091844_12112026_PF_FP_ABST
    Figure CN2026091844_12112026_PF_FP_ABST
Patent Text Reader

Abstract

A communication method and an apparatus, relating to the technical field of communications, which can implement data transmission on the basis of a combination of RM encoding and an HARQ transmission mechanism, so as to improve error correction performance. The method comprises: a transmit end device performs RM encoding on an information bit sequence having an length of K0, so as to obtain a first sequence having a length of M0 and, during an x-th data retransmission, performs RM encoding on a bit sequence to be encoded having a length of Kx, so as to obtain an encoded bit sequence having a length of Mx, wherein the bit sequence to be encoded corresponding to the x-th data retransmission comprises the bit sequence to be encoded corresponding to an (x-1)-th data retransmission, the bit sequence to be encoded corresponding to a first data retransmission comprises the information bit sequence, the encoded bit sequence corresponding to the x-th data retransmission comprises the encoded bit sequence corresponding to the (x-1)-th data retransmission, the encoded bit sequence corresponding to the first data retransmission comprises the first sequence, K0 is associated with m0 and r0, M0 is formula (I), m0 is an integer, Kx is associated with mx and r0, Mx is formula (II), and mx is an integer greater than or equal to m0.
Need to check novelty before this filing date? Find Prior Art

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202510585256.1, filed with the State Intellectual Property Office of China on May 7, 2025, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology

[0003] In a communication system, the transmitting device can perform channel coding on the information bit sequence and send the encoded sequence to the receiving device based on the hybrid automatic repeat request (HARQ) transmission mechanism. In the HARQ transmission mechanism, the transmitting device can send an initial sequence to the receiving device. The receiving device receives the symbol sequence and attempts to decode it. If decoding fails, the transmitting device can send a retransmission sequence, and the receiving device can decode the two received symbol sequences together.

[0004] Among them, when the channel coding is Reed-Muller (RM) coding, how to realize data transmission based on the HARQ transmission mechanism has become an urgent problem to be solved. Summary of the Invention

[0005] This application provides a communication method and apparatus that can realize data transmission based on the HARQ transmission mechanism when the channel coding is RM coding, thereby improving error correction performance.

[0006] Firstly, this application provides a communication method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to the transmitting device itself, a component within the transmitting device (e.g., a processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting device. The method includes: the transmitting device performing RM encoding on an information bit sequence of length K0 to obtain a first sequence of length M0; when data is retransmitted for the xth time, the transmitting device performs RM encoding on an information bit sequence of length K0... x The bit sequence to be encoded is RM encoded to obtain a sequence of length M. x The encoded bit sequence. Where K0 is associated with m0 and r0, and M0 is... m0 is a positive integer, r0 is an integer greater than or equal to 0; the bit sequence to be encoded corresponding to the x-th data retransmission includes the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, and the bit sequence to be encoded corresponding to the 1st data retransmission includes the information bit sequence; the encoded bit sequence corresponding to the x-th data retransmission includes the encoded bit sequence corresponding to the (x-1)-th data retransmission, and the encoded bit sequence corresponding to the 1st data retransmission includes the first sequence; K x With m x Associated with r0, M x for m x x is an integer greater than or equal to m0; x is a positive integer.

[0007] Here, coding can also be described as channel coding.

[0008] The first sequence can be understood as the encoded bit sequence corresponding to the 0th data retransmission (i.e., the initial data transmission), and the information bit sequence can be understood as the bit sequence to be encoded corresponding to the 0th data retransmission (i.e., the initial data transmission).

[0009] Specifically, the sending device can perform RM encoding on the information bit sequence based on m0 and r0 to obtain the first sequence, thereby achieving the initial data transmission; furthermore, the sending device can... x The bit sequence to be encoded corresponding to the x-th data retransmission is RM encoded using r0 to obtain the encoded bit sequence corresponding to the x-th data retransmission, thus realizing data retransmission. On one hand, the bit sequence to be encoded corresponding to the x-th data retransmission can include the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, and the encoded bit sequence corresponding to the x-th data retransmission can also include the encoded bit sequence corresponding to the (x-1)-th data retransmission. Combining RM encoding with the HARQ transmission mechanism to realize data retransmission can improve error correction performance, thereby improving both encoding and decoding performance. On the other hand, in m... x When the value is greater than m0, the encoded bit sequence corresponding to the x-th data retransmission can also include at least one incremental bit, which can improve the encoding gain of the data retransmission and thus improve the retransmission performance of the RM code.

[0010] Additionally, due to m x It can be greater than or equal to m0, and can be increased by m. x The range of values ​​can improve the code rate (i.e., the ratio of the length of the bit sequence to be encoded to the length of the encoded bit sequence) and the flexibility of the code length of RM codes, thereby improving the flexibility and diversity of RM encoding and improving encoding and decoding performance.

[0011] One possible implementation is that the sending device outputs a length of E. x The second sequence; E xFor predefined, or, E x The transmission resources associated with the x-th data retransmission are included; the second sequence includes some or all of the bits in the incremental bit sequence corresponding to the x-th data retransmission; wherein, the incremental bit sequence corresponding to the x-th data retransmission includes the bits in the encoded bit sequence corresponding to the x-th data retransmission, excluding the encoded bit sequence corresponding to the (x-1)-th data retransmission.

[0012] Based on this possible implementation, the transmitting device can output part or all of the bits in the encoded bit sequence corresponding to the x-th data retransmission, excluding the encoded bit sequence corresponding to the (x-1)-th data retransmission (i.e., the second sequence). In other words, the transmitting device can output the incremental part in the encoded bit sequence corresponding to the x-th data retransmission with a lower code rate, which can improve the coding gain of data retransmission and thus improve the retransmission performance of RM code.

[0013] In one possible implementation, where the second sequence includes all bits in the bit set, the second sequence also includes one or more of the following: some or all bits in the incremental bit sequence corresponding to the x-th data retransmission; or some or all bits in the encoded bit sequence corresponding to the (x-1)-th data retransmission.

[0014] Based on this possible implementation, the second sequence may also include one or more of the above, which can improve the flexibility and diversity of determining the second sequence; at the same time, it can make the determination of the second sequence better meet the communication requirements and improve the reliability of communication.

[0015] One possible implementation is that the length of the encoded bit sequence corresponding to the (x-1)th data retransmission is M. x-1 M x-1 for m x With m x-1 Same; or, m x For m x-1 The sum of 1 and 1. Correspondingly, m1 is the same as m0; or, m1 is the sum of m0 and 1.

[0016] Based on this possible implementation, in m x With m x-1 Under the same conditions, the encoded bit sequence corresponding to the x-th data retransmission can be the encoded bit sequence corresponding to the (x-1)-th data retransmission. When the x-th data is retransmitted, the sending device can output some or all of the bits in the encoded bit sequence corresponding to the (x-1)-th data retransmission, which can simplify the implementation of data retransmission and reduce the implementation complexity.

[0017] In m x For m x-1When the sum of 1 and 1 is reached, the encoded bit sequence corresponding to the x-th data retransmission can include the encoded bit sequence corresponding to the (x-1)-th data retransmission and the incremental bit sequence corresponding to the x-th data retransmission. During the x-th data retransmission, the transmitting device can output some or all of the bits in the incremental bit sequence corresponding to the x-th data retransmission, which can improve the encoding gain of the data retransmission and thus improve the retransmission performance of the RM code.

[0018] One possible implementation is that the length of the encoded bit sequence corresponding to the first data retransmission is M1, where M1 is... The length of the encoded bit sequence corresponding to the second data retransmission is M2, where M2 is... The length of the encoded bit sequence corresponding to the third data retransmission is M3, where M3 is... Where m1 is the sum of m0 and 1; m2 is the sum of m1 and 1; m3 is m2, or m3 is the sum of m2 and 1.

[0019] Based on this possible implementation, in one scheme, since m x Each additional value doubles the number of rows (or columns) in the generator matrix corresponding to the RM code, thus increasing the implementation complexity of RM encoding. Therefore, setting m3 to m2 can reduce the number of rows (or columns) in the generator matrix corresponding to the RM code, thereby reducing the implementation complexity of RM encoding.

[0020] In another scheme, m1 can be the sum of m0 and 1, m2 can be the sum of m1 and 1, and m3 can be the sum of m2 and 1. This allows the encoded bit sequence corresponding to different data retransmissions to include one or more incremental bits, which can improve the encoding gain of data retransmission and thus improve the retransmission performance of RM code.

[0021] One possible implementation, in m x For m x-1 When summed with 1, the bits in the encoded bit sequence corresponding to the x-th data retransmission, excluding those corresponding to the (x-1)-th data retransmission, are the result of XORing the encoded bit sequence corresponding to the (x-1)-th data retransmission with the x-th first encoded bit sequence. Here, the x-th first encoded bit sequence is based on m0 and r. x r is obtained by performing RM encoding on the bit sequence to be encoded corresponding to the x-th data retransmission, excluding the bit sequence to be encoded corresponding to the (x-1)-th data retransmission. x For r x-1 The difference between r0 and 1, r1 is the difference between r0 and 1.

[0022] Based on this possible implementation, the transmitting device can determine the relationship between m0 and r. xRM encoding is performed on the bit sequence to be encoded corresponding to the x-th data retransmission, excluding the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, to obtain the x-th first encoded bit sequence. Then, the incremental bit sequence corresponding to the x-th data retransmission can be obtained by XORing the x-th first encoded bit sequence and the encoded bit sequence corresponding to the (x-1)-th data retransmission. This simplifies the implementation of determining the incremental bit sequence corresponding to the x-th data retransmission and reduces the implementation complexity.

[0023] One possible implementation is that the bit sequence to be encoded corresponding to the x-th data retransmission also includes a length of (K) x -K x-1 The third sequence of ); where K x-1 The length of the bit sequence to be encoded corresponding to the (x-1)th data retransmission; the third sequence is associated with the information bit sequence; or, the third sequence is predefined.

[0024] Based on this possible implementation, when the third sequence is predefined, the transmitting device can directly determine the third sequence, which can reduce the workload of the transmitting device, improve work efficiency, and simplify implementation. When the third sequence is associated with the information bit sequence, the third sequence can be dynamically determined according to the actual communication scenario, which can improve the flexibility and diversity of determining the third sequence; at the same time, it can make the third sequence better meet communication requirements, and improve encoding and decoding performance.

[0025] One possible implementation is that the bits in the third sequence are (K) bits in the information bit sequence. x -K x-1 ) bits; or, the bits in the third sequence are determined based on at least one bit in the information bit sequence (K). x -K x-1 ) check bits.

[0026] Based on this possible implementation, the bits in the third sequence are (K) bits in the information bit sequence. x -K x-1 In the case of ) bits, some or all bits in the information bit sequence can be repeatedly encoded, which is equivalent to repeatedly transmitting some or all bits of the information bit sequence, thus improving encoding and decoding performance. The bits in the third sequence are determined based on at least one bit in the information bit sequence (K). x -K x-1 With 10 check bits, the receiving device can verify the information bit sequence through a third sequence, which can improve error correction performance, thereby improving encoding and decoding performance.

[0027] One possible implementation is that when the data is retransmitted for the xth time, the sending device outputs a length of E.x The second sequence; E x For predefined, or, E x The second sequence is associated with the transmission resources corresponding to the x-th data retransmission; the second sequence includes a length of M. A The Cth sequence in the fourth sequence x One or more bits from the first bit to the (D-1)th bit. Where M... A for m A The sum of m0 and A, or, m A The sum of m0 and (A-1); A is the maximum number of data retransmissions; the fourth sequence is passed through a sequence of length K. A The fifth sequence is obtained by RM encoding, and the fourth sequence includes the encoded bit sequence corresponding to the (A-1)th data retransmission, K. A With m A Associated with r0; the fifth sequence includes the bit sequence to be encoded corresponding to the (A-1)th data retransmission; C x For predefined; D is C x+1 Or, D is (M) A -1).

[0028] Based on this possible implementation, the sending device can directly determine the fourth sequence, and during the x-th data retransmission, determine the second sequence corresponding to the x-th data retransmission from the fourth sequence to achieve data retransmission, which simplifies the implementation.

[0029] Additionally, when D is C x+1 In the case where the second sequence corresponding to the x-th data retransmission can include some or all of the bits in the incremental bit sequence corresponding to the x-th data retransmission, which simplifies the implementation; when D is (M A In the case of -1), the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the encoded bit sequence corresponding to the A-th data retransmission except for the encoded bit sequence corresponding to the x-1-th data retransmission. This can make the bits included in the second sequence corresponding to different data retransmissions overlap, which can improve encoding and decoding performance.

[0030] One possible implementation is that, when A is 3, C0 is 0, C1 is K0, C2 is K1, and C3 is K2; or, C0 is 0, C1 is K0, C2 is K1, and C3 is (K1+K2) / 2.

[0031] Based on this possible implementation, for C x The value of C provides several possible implementations, and the sending device can directly determine it. x The value of can simplify the implementation.

[0032] One possible implementation is that when the data is retransmitted for the xth time, the sending device outputs a length of E. x The second sequence; E x For predefined, or, E x The second sequence is associated with the transmission resources corresponding to the x-th data retransmission; the second sequence includes a length of M. A The fourth sequence in the (E0+E1+…+E)th ( ... x-1 ) bits to the (E0+E1+…+E)th bit x -1) bits; E0 is predefined, or E0 is associated with the transmission resource corresponding to the initial data transmission. Where M A for m A The sum of m0 and A, or, m A The sum of m0 and (A-1); A is the maximum number of data retransmissions; the fourth sequence is passed through a sequence of length K. A The fifth sequence is obtained by RM encoding, and the fourth sequence includes the encoded bit sequence corresponding to the (A-1)th data retransmission, K. A With m A Associated with r0; the fifth sequence includes the bit sequence to be encoded corresponding to the (A-1)th data retransmission.

[0033] Based on this possible implementation, the sending device can directly determine the fourth sequence, and during the x-th data retransmission, determine the second sequence corresponding to the x-th data retransmission from the fourth sequence to achieve data retransmission, which simplifies the implementation.

[0034] In addition, the bits included in the second sequence corresponding to different data retransmissions can be different, so that all bits in the fourth sequence can be output as much as possible, thereby improving encoding and decoding performance.

[0035] Secondly, this application provides a communication method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to the receiving device itself, a component within the receiving device (e.g., a processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the receiving device. The method includes: the receiving device receiving first information to be demodulated; demodulating the first information to be demodulated to obtain a sixth sequence of length M0 (corresponding to the first sequence); receiving the xth second information to be demodulated; demodulating the xth second information to be demodulated to obtain the xth seventh sequence (corresponding to the incremental redundancy part and / or the sixth sequence); and, based on m... x and r0, for length M x The x-th eighth sequence is subjected to Reed-Muller RM decoding to obtain the decoding result; where M0 is... m0 is a positive integer, x is a positive integer, and r0 is an integer greater than or equal to 0; the eighth sequence is associated with the sixth sequence and the xth seventh sequence, m x M is an integer greater than or equal to m0. x for

[0036] Decoding can also be described as decoding, channel decoding, channel decoding, etc., without restriction.

[0037] Specifically, the receiving device can determine the eighth sequence based on the sixth sequence and the seventh sequence corresponding to the previous x data retransmissions, and then perform RM decoding on the eighth sequence, which can improve decoding performance.

[0038] One possible implementation, m x With m x-1 Same; or, m x For m x-1 And the sum of 1.

[0039] Based on this possible implementation, m can be increased. x The range of values ​​for m can improve x Certain flexibility and diversity.

[0040] One possible implementation is that m1 is the sum of m0 and 1; m2 is the sum of m1 and 1; m3 is m2, or m3 is the sum of m2 and 1.

[0041] Based on this possible implementation, in one scheme, m1 can be the sum of m0 and 1, m2 can be the sum of m1 and 1, and m3 can be m2, since m x Each additional value doubles the dimension of the RM code, increasing the implementation complexity of RM decoding. Therefore, m3 can be set to m2 to reduce the implementation complexity of RM decoding.

[0042] In another scheme, m1 can be the sum of m0 and 1, m2 can be the sum of m1 and 1, and m3 can be the sum of m2 and 1. This allows the encoded bit sequence corresponding to different data retransmissions to include one or more incremental bits, which can improve the decoding performance of RM codes.

[0043] Thirdly, embodiments of this application provide a communication device that can be applied to the transmitting end device described in the first aspect to realize the functions performed by the transmitting end device. The communication device can be the transmitting end device itself, or it can be a chip, chip system, or system-on-a-chip of the transmitting end device, etc. The communication device can execute the functions performed by the transmitting end device through hardware, or it can execute corresponding software through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or it can cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations, or it can cooperate with the transceiver module to complete the following processing operations, without limitation.

[0044] For example, the processing module is used to perform RM encoding on an information bit sequence of length K0 to obtain a first sequence of length M0; wherein K0 is associated with m0 and r0, and M0 is... m0 is a positive integer, and r0 is an integer greater than or equal to 0; the processing module is also used to process data of length K during the x-th data retransmission. x The bit sequence to be encoded is RM encoded to obtain a sequence of length M. x The encoded bit sequence; wherein, the bit sequence to be encoded corresponding to the x-th data retransmission includes the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, and the bit sequence to be encoded corresponding to the 1st data retransmission includes the information bit sequence; the encoded bit sequence corresponding to the x-th data retransmission includes the encoded bit sequence corresponding to the (x-1)-th data retransmission, and the encoded bit sequence corresponding to the 1st data retransmission includes the first sequence; K x With m x Associated with r0, M x for m x x is an integer greater than or equal to m0; x is a positive integer.

[0045] Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in the first aspect or any possible design of the first aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0046] Fourthly, embodiments of this application provide a communication device that can be applied to the receiving device described in the second aspect to realize the functions performed by the receiving device. The communication device can be the receiving device itself, or it can be a chip, chip system, or system-on-a-chip of the receiving device. The communication device can execute the functions performed by the receiving device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the functions described above. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0047] For example, the transceiver module is used to receive the first information to be demodulated, demodulate the first information to be demodulated, and obtain a sixth sequence (corresponding to the first sequence) of length M0; where M0 is... m0 is a positive integer; the processing module is used to receive the x-th second demodulated information, demodulate the x-th second demodulated information, and obtain the x-th seventh sequence (corresponding to the incremental redundancy part and / or the sixth sequence); x is a positive integer; the processing module is also used to determine the order of the second demodulated information based on m0. x and r0, for length M x The eighth sequence is subjected to Reed-Muller RM decoding to obtain the decoding result; where r0 is an integer greater than or equal to 0; the eighth sequence is associated with the sixth sequence, the first seventh sequence, the second seventh sequence, ..., the xth seventh sequence, and m x M is an integer greater than or equal to m0. x for

[0048] Optionally, the transceiver module and processing module of the communication device in the fourth aspect may also perform the corresponding functions in the second aspect or any possible design of the second aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0049] Fifthly, this application provides a communication device that performs the functions described in the first aspect above. For example, the communication device includes modules, units, or means corresponding to the operations involved in the first aspect above. These modules, units, or means can be implemented in software, hardware, or a combination of software and hardware. Alternatively, the communication device performs the functions described in the second aspect above. For example, the communication device includes modules, units, or means corresponding to the operations involved in the second aspect above. These modules, units, or means can be implemented in software, hardware, or a combination of software and hardware.

[0050] In a sixth aspect, embodiments of this application provide a communication device, the communication device including one or more processors; the one or more processors are configured to run computer programs or instructions, such that when the one or more processors execute the computer instructions or instructions, the communication method described in any one of the first to second aspects is performed.

[0051] In one possible design, the communication device further includes one or more memories coupled to one or more processors, the memories used to store the aforementioned computer programs or instructions. In one possible implementation, the memories are located outside the communication device. In another possible implementation, the memories are located inside the communication device. In embodiments of this application, the processor and memory may also be integrated into a single device, i.e., the processor and memory may be integrated together. In one possible implementation, the communication device further includes a transceiver for receiving and / or transmitting information.

[0052] In one possible design, the communication device further includes one or more communication interfaces coupled to one or more processors, and the communication interfaces are used to communicate with other modules outside the communication device.

[0053] In a seventh aspect, embodiments of this application provide a communication device, which includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any one of the first to second aspects, and to process and / or generate information based on the information.

[0054] Eighthly, embodiments of this application provide a computer-readable storage medium storing computer instructions or programs that, when executed on a computer, cause the communication method described in any one of the first to second aspects to be performed.

[0055] Ninthly, embodiments of this application provide a computer program product containing computer instructions that, when run on a computer, causes the communication method described in any one of the first to second aspects to be executed.

[0056] In a tenth aspect, embodiments of this application provide a computer program that, when run on a computer, causes the communication method described in any one of the first to second aspects to be executed.

[0057] Eleventhly, embodiments of this application provide a chip, including: a processor coupled to a memory, the memory being used to store programs or instructions, wherein when the program or instructions are executed by the processor, the communication method as described in any one of the first to second aspects is executed.

[0058] The technical effects of any of the design methods in aspects three through eleven are similar to those in aspects one through two, and will not be elaborated upon further.

[0059] In a twelfth aspect, embodiments of this application provide a communication system that may include communication means for performing the communication described in the first aspect or any possible design of the first aspect, and communication means for performing the communication described in the second aspect or any possible design of the second aspect. Attached Figure Description

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

[0061] Figure 2 is a schematic diagram of the connection relationship between a network device and a terminal device provided in an embodiment of this application;

[0062] Figure 3 is a schematic diagram of encoding and decoding performed by a transmitting end device and a receiving end device according to an embodiment of this application;

[0063] Figure 4 is a schematic diagram of an encoding processing unit chip architecture provided in an embodiment of this application;

[0064] Figure 5 is a schematic diagram of a decoding processing unit chip architecture provided in an embodiment of this application;

[0065] Figure 6 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0066] Figure 7 is a flowchart illustrating a communication method provided in an embodiment of this application;

[0067] Figure 8 is a schematic diagram of determining a second sequence according to an embodiment of this application;

[0068] Figure 9 is a schematic diagram of the structure of a transmitting device provided in an embodiment of this application;

[0069] Figure 10 is a schematic diagram of the structure of a receiving device provided in an embodiment of this application;

[0070] Figure 11 is a schematic diagram of another communication device provided in an embodiment of this application;

[0071] Figure 12 is a schematic diagram of another communication device provided in an embodiment of this application;

[0072] Figure 13 is a schematic diagram of another encoding processing unit chip architecture provided in an embodiment of this application;

[0073] Figure 14 is a schematic diagram of another decoding processing unit chip architecture provided in an embodiment of this application. Detailed Implementation

[0074] Before describing the embodiments of this application, the technical terms involved in the embodiments of this application will be described.

[0075] Channel coding: Channel coding is one of the core technologies in the field of wireless communication. The complete process of channel coding includes adding cyclic redundancy check (CRC) codes, code block segmentation, error correction coding, rate matching, code block concatenation, interleaving, and scrambling. The purpose of error correction coding is to ensure that the receiving device can automatically correct errors that occur during data transmission with minimal redundancy overhead. For example, with the same bit error rate, the smaller the redundancy overhead, the higher the coding efficiency. Channel coding and decoding can include linear block codes (such as Hamming codes, Gray codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, Reed-Solomon (RS) codes, etc.), convolutional codes (such as Turbo codes), and concatenated codes.

[0076] In third-generation (3G) and fourth-generation (4G) communication systems, Turbo codes, defined as a coding and decoding technique in the Third Generation Partnership Project (3GPP) standard, exhibit excellent performance, approaching the limits of Shannon's theory. However, in fifth-generation (5G) communication systems, data transmission rates are orders of magnitude higher than in 4G, and Turbo code-based serial decoders struggle to effectively support such high-speed data transmission. Furthermore, 5G introduces richer service applications and new requirements for channel coding. For example, enhanced machine-type communication (eMTC) scenarios require smaller data packets, while ultra-reliable and low-latency communication (URLLC) scenarios demand higher requirements for coding and decoding latency and low error rates. Therefore, the 5G standard employs low-density parity-check (LDPC) codes and polar codes. LDPC codes and Polar codes outperform linear block codes and convolutional codes, and can approach the limits of Shannon's theory very closely.

[0077] For future mobile communication networks, commercial applications such as extended reality (XR), mixed reality (MR), and immersive services have emerged, offering real-time high data rates. These emerging services place higher demands on the peak throughput and area efficiency of encoding and decoding, with peak rates even required to reach Tbps. At the same time, the power consumption of decoders needs to be further reduced. Therefore, for channel encoding and decoding of future mobile communication network chips, technological breakthroughs need to be sought in two main directions: high-throughput low-power encoding and decoding, and high-reliability encoding and decoding. This can be achieved through new coding designs and low-complexity decoding designs to reach the goals of future mobile communication standards.

[0078] RM codes: RM codes have a relatively simple structure. They were proposed by scholar Deemuller in 1954 and have a long history. The modeling and characterization of RM codes have covered different methods, such as finite geometry, polynomial rings, and Boolean functions.

[0079] For example, taking a polynomial ring as an example, a binary RM code contains multivariate polynomials in a binary field. The evaluation results above consider a polynomial ring with m variables. For a polynomial and a binary vector Define Eval z (f)=f(z1,z2,…,z m Let f be the value of the polynomial f in the binary vector z. Based on this, the evaluation vector of the polynomial f can be defined. That is, a coordinate of Eval(f) is the evaluation result of the polynomial f at a certain binary vector. Since The CCP has 2 m There are m-dimensional binary vectors, therefore the evaluation vector Eval(f) has a total of 2 m Each dimension. For an RM code with parameters m and r (which can be described as an RM(m,r) code), its codeword set can be defined as the set of evaluation vectors for all polynomials of order no higher than r, i.e., deg(f) represents the order of the polynomial f.

[0080] Understandably, the generator matrix G of an RM(m,r) code can be determined based on the evaluation vector of the one-way expression. For example, the generator matrix of an RM(2,1) code can be: For example, the generator matrix of an RM(3,1) code can be: For example, the generator matrix of an RM(3,2) code can be:

[0081] Furthermore, the information bit sequence can be RM encoded based on the generator matrix to obtain the encoded bit sequence. For example, the encoded bit sequence can be represented as: xG, where x can represent the information bit sequence.

[0082] Here, parameter m can be called the code length parameter of the RM(m,r) code (or the first parameter of the RM code) (for example, the code length of the RM code (or can be understood as the length of the above-mentioned encoded bit sequence) can be 2). m The parameter r can be called the order of the RM(m,r) code (or the second parameter of the RM code). According to the above definition, the number of input bits corresponding to the RM(m,r) code is the number of binary m-variable monomials, that is, the number of input bits corresponding to the RM(m,r) code. The number of input bits corresponding to the RM(m,r) code is the same as the number of rows in the aforementioned generator matrix.

[0083] RM Code in 5G: The encoding matrix of the RM code in 5G can be shown in Table 1, consisting of a generator matrix of the RM code (such as the matrix composed of M0, M1, M2, M3, M4, and M5 shown in Table 1) and a five-column mask matrix (such as M6, M7, M8, M9, and M5 shown in Table 1).10 The 5G protocol stipulates that if the number of bits in the control information is greater than or equal to 3 and less than or equal to 11, RM codes can be used to encode the control information. For example, the control information can be encoded based on the RM code encoding matrix shown in Table 1 to obtain a 32-bit encoded sequence. Alternatively, based on the control information, a first sequence of length 11 can be constructed, and multiplying this first sequence by the encoding matrix shown in Table 1 yields a 32-bit encoded sequence.

[0084] Table 1. Encoding Matrix of RM Codes

[0085] In Table 1, the first 6 columns are the 6 bases of the RM(5,1) code, and the last 5 columns are the mask of the RM(5,1) code.

[0086] Hybrid Automatic Repeat Request (HARQ) transmission mechanism: The transmitting device can perform channel coding on the information bit sequence and send the encoded sequence to the receiving device based on the HARQ transmission mechanism. In the HARQ transmission mechanism, the transmitting device can send an initial sequence to the receiving device. The receiving device receives the symbol sequence and attempts to decode it. If decoding fails, the transmitting device can send a retransmission sequence, and the receiving device can decode the two received symbol sequences together.

[0087] Optionally, the HARQ transmission mechanism may include chase combining hybrid automatic repeat request (CC-HARQ) and incremental redundancy hybrid automatic repeat request (IR-HARQ). In CC-HARQ, the initial transmission sequence and the retransmission sequence are the same, simplifying implementation; in IR-HARQ, the retransmission sequence may include an incremental redundancy sequence, which can gain coding gain, thereby improving coding and decoding performance, and also increasing transmission efficiency.

[0088] Based on the above description of RM encoding and HARQ transmission mechanism, how to realize data transmission based on HARQ transmission mechanism when the sending device performs RM encoding on the information bit sequence becomes an urgent problem to be solved.

[0089] This application provides a communication method in which the transmitting device performs RM encoding on an information bit sequence of length K0 to obtain a first sequence of length M0; when the data is retransmitted for the xth time, the first sequence of length K0 is encoded using RM encoding.xz The bit sequence to be encoded is RM encoded to obtain a sequence of length M. x The encoded bit sequence. Where K0 is associated with m0 and r0, and M0 is... m0 is a positive integer, r0 is an integer greater than or equal to 0; the bit sequence to be encoded corresponding to the x-th data retransmission includes the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, and the bit sequence to be encoded corresponding to the 1st data retransmission includes the information bit sequence; the encoded bit sequence corresponding to the x-th data retransmission includes the encoded bit sequence corresponding to the (x-1)-th data retransmission, and the encoded bit sequence corresponding to the 1st data retransmission includes the first sequence; K x With m x Associated with r0, M x for m x x is an integer greater than or equal to m0; x is a positive integer.

[0090] The first sequence can be understood as the encoded bit sequence corresponding to the 0th data retransmission (i.e., the initial data transmission), and the information bit sequence can be understood as the bit sequence to be encoded corresponding to the 0th data retransmission (i.e., the initial data transmission).

[0091] Specifically, the sending device can perform RM encoding on the information bit sequence based on m0 and r0 to obtain the first sequence, thereby achieving the initial data transmission; furthermore, the sending device can... x The bit sequence to be encoded corresponding to the x-th data retransmission is RM encoded using r0 to obtain the encoded bit sequence corresponding to the x-th data retransmission, thus realizing data retransmission. On one hand, the bit sequence to be encoded corresponding to the x-th data retransmission can include the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, and the encoded bit sequence corresponding to the x-th data retransmission can also include the encoded bit sequence corresponding to the (x-1)-th data retransmission. Combining RM encoding with the HARQ transmission mechanism to realize data retransmission can improve error correction performance, thereby improving both encoding and decoding performance. On the other hand, in m... x When the value is greater than m0, the encoded bit sequence corresponding to the x-th data retransmission can also include at least one incremental bit, which can improve the encoding gain of the data retransmission and thus improve the retransmission performance of the RM code.

[0092] Additionally, due to m x It can be greater than or equal to m0, and can be increased by m. x The range of values ​​can improve the code rate (i.e., the ratio of the length of the bit sequence to be encoded to the length of the encoded bit sequence) and the flexibility of the code length of RM codes, thereby improving the flexibility and diversity of RM encoding and improving encoding and decoding performance.

[0093] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0094] The communication method provided in this application can be used in any communication system, such as a 3GPP communication system, for example, a long term evolution (LTE) system, or a 5G mobile communication system, a hybrid LTE and 5G network system, a new radio (NR) system, a vehicle-to-everything (V2X) system, a device-to-device (D2D) communication system, a machine-to-machine (M2M) communication system, an internet of things (IoT) system, a narrow band internet of things (NB-IoT) system, a time division-synchronization code division multiple access (TD-SCDMA) system, an enhanced mobile broadband (eMBB) system, URLLC, eMTC, and various types of future communication systems. It can also be a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, etc., without limitation.

[0095] The communication system provided in this application embodiment will be described below using Figure 1 as an example. As shown in Figure 1, the communication system may include at least one transmitting device (only one transmitting device is shown in Figure 1) and at least one receiving device (only one receiving device is shown in Figure 1). The transmitting device may be a network device or a terminal device; similarly, the receiving device may be a network device or a terminal device. For example, the network device may use channel coding to encode downlink data and then modulate it before transmitting it to the terminal device over the air interface (i.e., the network device is the transmitting device, and the terminal device is the receiving device); the terminal device may also use channel coding to encode uplink data and then modulate it before transmitting it to the network device over the air interface (i.e., the terminal device is the transmitting device, and the network device is the receiving device).

[0096] It is understandable that when network devices communicate with each other, or when terminal devices communicate with each other, they can also communicate based on channel coding. That is, the sending end device and the receiving end device can both be network devices or both be terminal devices, without restriction.

[0097] The terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device.

[0098] The terminal device can be a device with wireless transceiver capabilities or a chip or chip system that can be installed on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. The terminal device can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc.

[0099] For example, the terminal device can be a mobile phone, a tablet computer, or a computer with wireless transceiver capabilities. Terminal equipment can also be user stations, mobile stations, remote stations, remote terminal equipment, mobile terminal equipment, user terminal equipment, wireless communication equipment, user agents, user devices, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices, processing devices connected to wireless modems, in-vehicle equipment, wearable devices, terminal equipment in the Internet of Things (IoT), home appliances, virtual reality (VR) terminals, augmented reality (AR) terminals, wireless terminals in industrial control, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in smart cities, wireless terminals in smart homes, vehicles with vehicle-to-vehicle (V2V) communication capabilities, intelligent connected vehicles, and UAV-to-UAV communication. Unmanned aerial vehicles (UAVs) with U2U communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMNs) are not subject to restrictions.

[0100] The network device can be any device deployed in the access network capable of wireless communication with terminal devices. It can also be a chip or chip system that can be configured within such devices, a logical node or logical module, or a function implemented in software. Its main responsibilities include air interface-side wireless physical control, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be either a wired access device or a wireless access device.

[0101] For example, a network device can consist of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations, such as: satellite base stations, evolved Node Bs (gNBs), transmission reception points (TRPs), evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved Node Bs, or home Node Bs (HNBs), macro base stations, micro base stations, pico base stations, small cells, relay stations, balloon stations, drone stations, wireless backhaul nodes, base band units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It is understood that network devices can be terrestrial devices or non-terrestrial devices (such as satellites, drones, high-altitude communication equipment, etc.). Furthermore, in communication systems employing different wireless access technologies, the names of network devices with base station functions may differ, and this application does not impose any restrictions on this.

[0102] In another example, the network equipment may include a BBU and a remote radio unit (RRU). The BBU and RRU can be located in different places; for example, the RRU can be moved remotely to a high-traffic area, while the BBU is located in the central equipment room. The BBU and RRU can also be located in the same equipment room. The BBU and RRU can also be different components under the same rack.

[0103] In another example, the network device can be a device that includes centralized unit (CU) nodes, distributed unit (DU) nodes, or both CU and DU nodes. For instance, the network device can be logically divided into CUs and DUs, with some protocol layer functions centrally controlled by the CU, and the remaining partial or complete protocol layer functions distributed in the DU, which is centrally controlled by the CU. The CU and DU can be separate entities or included in the same network element, such as a BBU. Furthermore, the centralized unit (CU) can be further divided into a control plane (CU-CP) and a user plane (CU-UP).

[0104] In another example, the network device may also be a device that includes a radio unit (RU), or a device that includes a CU, a DU, and a RU. The RU may be included in a radio frequency device or radio frequency unit, such as an RRU, an active antenna unit (AAU), or a remote radio head (RRH).

[0105] It is understood that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, but those skilled in the art will understand their meaning. For example, in an open radio access network (O-RAN) system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0106] Optionally, the embodiments in this application can be applied to various communication scenarios. As shown in Figure 2, taking the network device as the base station and the terminal device as the UE as an example, in the communication scenario shown in Figure 2(a), the base station and the UE have a point-to-point single connection, that is, the base station and the UE can communicate directly; in the communication scenario shown in Figure 2(b), the base station and the UE have a multi-hop single connection, that is, the base station and the UE can communicate through multiple relays; in the communication scenario shown in Figure 2(c), the base station and the UE have a dual connection, that is, multiple base stations can communicate directly with one UE, and the base stations can communicate with each other through the X2 interface; in the communication scenario shown in Figure 2(d), the base station and the UE have a multi-hop multi-connection. Compared with the communication scenario shown in Figure 2(b), the base station and the UE in the communication scenario shown in Figure 2(d) can communicate through different relays. The communication scenarios shown in Figure 2 are merely examples and do not impose any limitations on the network architecture used in this application.

[0107] Based on the above description of the terminal device and network device, optionally, the communication method provided in the embodiments of this application can be implemented by the aforementioned terminal device or network device, or by components of the terminal device or network device, such as by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (such as program code in memory) deployed in the terminal device or network device, without limitation.

[0108] Optionally, in this embodiment, the transmitting device and the receiving device can perform encoding and decoding using the process shown in Figure 3 below. The transmitting device can be a terminal device or a network device, and the receiving device can also be a terminal device or a network device.

[0109] The transmitting device can encode, modulate, layer-map, precode, frame, perform inverse fast fourier transform (IFFT), and intermediate radio frequency (IRF) processing on the source bitstream corresponding to its generated layer 2 (L2) data to obtain the transmitted signal, which can then be transmitted to the receiving device through the channel. When the receiving device receives the signal through the channel, it can recover the source bitstream through IRF processing, fast fourier transform (FFT), deframing, equalization, de-layer mapping, demodulation, and decoding.

[0110] Optionally, the transmitting device can encode information bits using an encoding processing unit chip architecture, and correspondingly, the receiving device can decode the information to be decoded using a decoding processing unit chip architecture to obtain the decoding result. The encoding processing unit chip architecture can be as shown in Figure 4, and may include a computing unit, a storage unit, and a control unit. The computing unit in Figure 4 can implement RM encoding and rate matching. The decoding processing unit chip architecture can be as shown in Figure 5, and may include a computing unit, a storage unit, and a control unit. The computing unit shown in Figure 5 can implement rate matching and RM decoding. Because encoding and decoding require high throughput, hardware accelerators (HACs) are generally used in system-on-chip (SoC) systems for encoding and decoding. Furthermore, scrambling and descrambling can also be implemented in the HAC.

[0111] In specific implementation, as shown in Figure 1, each transmitting and receiving device can adopt the structure shown in Figure 6, or include the components shown in Figure 6. Figure 6 is a schematic diagram of the structure of a communication device 600 provided in an embodiment of this application. The communication device 600 can be a transmitting device or a chip or system-on-a-chip in the transmitting device; it can also be a receiving device or a chip or system-on-a-chip in the receiving device. As shown in Figure 6, the communication device 600 includes a processor 601, a transceiver 602, and a communication line 603.

[0112] Furthermore, the communication device 600 may also include a memory 604. The processor 601, memory 604, and transceiver 602 can be connected via a communication line 603.

[0113] The processor 601 can be a central processing unit (CPU), a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 601 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0114] Transceiver 602 is used to communicate with other devices or other communication networks. These other communication networks can be Ethernet, radio access network (RAN), wireless local area network (WLAN), etc. Transceiver 602 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0115] Communication line 603 is used to transmit information between the components included in communication device 600.

[0116] Memory 604 is used to store instructions. These instructions can be computer programs.

[0117] The memory 604 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions; it can also be a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions; it can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0118] It is understood that the memory 604 can exist independently of the processor 601, or it can be integrated with the processor 601. The memory 604 can be used to store instructions, program code, or some data, etc. The memory 604 can be located inside or outside the communication device 600, without limitation. The processor 601 is used to execute the instructions stored in the memory 604 to implement the communication method provided in the following embodiments of this application.

[0119] In one example, processor 601 may include one or more CPUs, such as CPU0 and CPU1 in Figure 6.

[0120] As an optional implementation, the communication device 600 may include multiple processors, for example, in addition to the processor 601 in FIG. 6, it may also include a processor 607.

[0121] As an optional implementation, the communication device 600 also includes an output device 605 and an input device 606. For example, the input device 606 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 605 is a device such as a display screen or speaker.

[0122] It is understood that the communication device 600 may be a desktop computer, a laptop computer, a web server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device with a similar structure to that shown in Figure 6. Furthermore, the composition shown in Figure 6 does not constitute a limitation on the communication device; in addition to the components shown in Figure 6, the communication device may include more or fewer components, combinations of certain components, or different arrangements of components.

[0123] In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices.

[0124] Furthermore, the actions, terms, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages exchanged between the various devices in the embodiments of this application are merely examples, and other names may be used in specific implementations without limitation.

[0125] The communication method provided in the embodiments of this application will be described below with reference to the communication system shown in Figure 1 and Figure 7. The transmitting or receiving device described in the following embodiments may include the components shown in Figure 6.

[0126] Figure 7 is a flowchart of a communication method provided in an embodiment of this application. As shown in Figure 7, the method may include the following steps:

[0127] Step 701: The transmitting device performs RM encoding on the information bit sequence of length K0 to obtain the first sequence of length M0.

[0128] Here, the information bit sequence can be understood as the bit sequence to be encoded corresponding to the initial data transmission (or the 0th data retransmission); correspondingly, the first sequence can be understood as the encoded bit sequence corresponding to the initial data transmission (or the 0th data retransmission). In this application, the initial data transmission can replace the 0th data retransmission.

[0129] Where K0 is a positive integer. The information bit sequence may include the information bits themselves, in which case K0 may be the number of information bits included in the information bit sequence; or, the information bit sequence may include information bits and CRC bits, that is, the information bit sequence may be a CRC-encoded information bit sequence, in which case K0 may be the sum of the number of information bits and the number of CRC bits included in the information bit sequence.

[0130] Here, K0 is associated with m0 and r0. For example, K0 can satisfy the following formula: in, x′ can be m0, and y′ can be any value from 0, 1, 2, ..., r0. For example, let's take m0 as 5 and r0 as 1. That is, the length of the information bit sequence can be 6.

[0131] Here, m0 can be understood as the first parameter during the initial data transmission. In this application, m0 and m... x and m A This can be collectively referred to as the first parameter. The first parameter can be described as the code length parameter of the RM code, or as the code length parameter of the encoded bit sequence, or as the dimension of the RM code. For example, taking the first parameter as m0, the length M0 of the first sequence can satisfy the following formula: In other words, the sending device can determine M0 by determining m0, or it can determine m0 by determining M0.

[0132] In this application, an RM code can be understood as an encoded bit sequence obtained by RM encoding an information bit sequence (or a bit sequence to be encoded); correspondingly, the code length of an RM code can be understood as the length of the encoded bit sequence (such as the encoded bit sequence corresponding to the first sequence or the xth data retransmission).

[0133] Where m0 is a positive integer. For example, m0 can be 5; or m0 can be 6.

[0134] Where r0 is an integer greater than or equal to 0. For example, r0 can be 1; or r0 can be 2.

[0135] Optionally, the transmitting device can determine the generator matrix G(m0,r0) of the RM(m0,r0) code based on m0 and r0, and then perform RM encoding on the information bit sequence based on G(m0,r0) to obtain the first sequence. For example, the first sequence c0 can satisfy the following formula: c0 = u0G(m0,r0), where u0 is the information bit sequence. The determination of G(m0,r0) can refer to the description of the generator matrix above, and will not be repeated here.

[0136] Step 702: The transmitting device outputs the first sequence; correspondingly, the receiving device receives the first demodulated information from the transmitting device.

[0137] Optionally, the transmitting device can perform rate matching on the first sequence to obtain a first rate-matched bit sequence of length E0. Here, E0 can be predefined (or can be described as being predefined by the protocol); or, E0 can be associated with the transmission resource corresponding to the initial data transmission. For example, E0 can be the product of the number of resource elements (REs) carried by the transmission resource corresponding to the initial data transmission and the modulation order corresponding to the initial data transmission.

[0138] In one example, when E0 is greater than M0, the rate matching method can be repetition. That is, the transmitting device can transmit part or all of the bits of the first sequence after transmitting the first sequence. For example, the first rate-matching bit sequence may include bits 0 to M0-1 and bits 0 to E0-M0-1 in the first sequence. As another example, the first rate-matching bit sequence may include bits M0-1 to 0 and bits M0-1 to 2M0-E0 in the first sequence.

[0139] In another example, when E0 is less than or equal to M0, the rate matching method can be puncture, meaning the transmitting device can puncture M0-E0 bits of the first sequence from front to back; for example, the first rate-matched bit sequence can include bits M0-E0 to M0-1 of the first sequence. Alternatively, the rate matching method can be shortening, where the transmitting device can shorten M0-E0 bits of the first sequence from back to front; for example, the first rate-matched bit sequence can include bits 0 to E0-1 of the first sequence.

[0140] Optionally, the transmitting device may interleave the first rate-matched bit sequence to obtain a first interleaved bit sequence, and then modulate the first interleaved bit sequence to obtain a first modulation symbol sequence; or, the transmitting device may modulate the first rate-matched bit sequence to obtain a first modulation symbol sequence, without limitation.

[0141] It is understandable that the first modulation symbol sequence sent by the transmitting device to the receiving device may be affected by noise and other interference during transmission through the channel. The first demodulated information received by the receiving device is the first modulation symbol sequence affected by noise and other interference. In other words, the symbols carried by the first demodulated information are the first modulation symbol sequence after transmission through the channel.

[0142] Step 703: The receiving device demodulates the first information to be demodulated to obtain a sixth sequence of length M0.

[0143] Specifically, the receiving device can demodulate the first information to be demodulated to obtain a first demodulated bit sequence; then, it can deinterleave (optionally) and derate-match the first demodulated bit sequence to obtain a sixth sequence of length M0. The description of m0 above is sufficient and will not be repeated here.

[0144] Optionally, if the transmitting device interleaves the first rate-matched bit sequence, the receiving device can deinterleave the first demodulated bit sequence to obtain the first deinterleaved bit sequence, and then de-rate-match the first deinterleaved bit sequence to obtain the sixth sequence; otherwise, the receiving device can de-rate-match the first demodulated bit sequence to obtain the sixth sequence.

[0145] Furthermore, the receiving device can perform RM decoding on the sixth sequence based on m0 and r0 to obtain the first decoding result. Here, r0 can be referred to in the description of r0 above, and will not be repeated here.

[0146] Step 704: When the data is retransmitted for the xth time, the sending device sends a data packet of length K. x The bit sequence to be encoded is RM encoded to obtain a sequence of length M. x The encoded bit sequence.

[0147] Where x is a positive integer. For example, x can be 1; or x can be 2; or x can be 3; or x can be 4.

[0148] Optionally, x can be less than or equal to the maximum number of data retransmissions A. For example, A can be a positive integer. For instance, A can be 4; or A can be 3; or A can be 5. It is understood that without setting a maximum number of data retransmissions, if the receiving device fails to decode, it can instruct the sending device to retransmit the data multiple times until the receiving device successfully decodes. With a maximum number of data retransmissions set, if the number of retransmissions reaches the maximum, the sending device ends the data retransmission process. That is, even if the receiving device fails to decode during the Ath retransmission, the sending device still ends the data retransmission, which can reduce resource consumption.

[0149] Among them, K x With m x Associated with r0. For example, K x The following formula can be satisfied:

[0150] Where, m xThis can be understood as the first parameter during the x-th data retransmission. The description of the first parameter is the same as above and will not be repeated here. For example, when x is 1, m1 can be understood as the first parameter during the first data retransmission; when x is 2, m2 can be understood as the first parameter during the second data retransmission; and so on.

[0151] Where, m x It is an integer greater than or equal to m0. For example, if m0 is 5, then m... x It can be 5; or, m x It can be (5+x); or, m x It can be 6.

[0152] The bit sequence to be encoded corresponding to the x-th data retransmission includes the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, the bit sequence to be encoded corresponding to the (x-2)-th data retransmission includes the bit sequence to be encoded corresponding to the (x-3)-th data retransmission, ..., the bit sequence to be encoded corresponding to the 1st data retransmission includes the bit sequence to be encoded corresponding to the 0th data retransmission.

[0153] The 0th data retransmission can be understood as the initial data transmission. Therefore, the bit sequence to be encoded corresponding to the 0th data retransmission can be understood as the information bit sequence. In other words, the bit sequence to be encoded corresponding to the 1st data retransmission can include the information bit sequence.

[0154] Optionally, bits 0 to K of the bit sequence to be encoded corresponding to the x-th data retransmission. x-1 The bits can be the bit sequence to be encoded corresponding to the (x-1)th data retransmission; the 0th bit to the Kth bit in the bit sequence to be encoded corresponding to the (x-1)th data retransmission. x-2 The first bit can be the bit sequence to be encoded corresponding to the (x-2)th data retransmission; ...; the 0th to K0th bits in the bit sequence to be encoded corresponding to the 1st data retransmission can be the information bit sequence.

[0155] In this application, K x-1 K x-2 ...can be referenced to K x The description of that will not be repeated here.

[0156] Among them, M x for

[0157] The encoded bit sequence corresponding to the x-th data retransmission includes the encoded bit sequence corresponding to the (x-1)-th data retransmission, the encoded bit sequence corresponding to the (x-1)-th data retransmission includes the encoded bit sequence corresponding to the (x-2)-th data retransmission, the encoded bit sequence corresponding to the (x-2)-th data retransmission includes the encoded bit sequence corresponding to the (x-3)-th data retransmission, and so on. The encoded bit sequence corresponding to the 1st data retransmission may include the encoded bit sequence corresponding to the 0th data retransmission.

[0158] The 0th data retransmission can be understood as the initial data transmission. Therefore, the encoded bit sequence corresponding to the 0th data retransmission can be the first sequence. In other words, the encoded bit sequence corresponding to the 1st data retransmission can include the first sequence.

[0159] Optionally, bits 0 to M of the encoded bit sequence corresponding to the x-th data retransmission. x-1 Each bit can be the encoded bit sequence corresponding to the (x-1)th data retransmission; bits 0 to M in the encoded bit sequence corresponding to the (x-1)th data retransmission x-2 The first bit can be the encoded bit sequence corresponding to the (x-2)th data retransmission; ...; the 0th to M0th bits in the encoded bit sequence corresponding to the 1st data retransmission can be the information bit sequence.

[0160] In this application, M x-1 M x-2 ... can be referenced for M x The description of that will not be repeated here.

[0161] Optionally, the transmitting device can be based on m x And r0, determine RM(m) x The generator matrix G(m) of the r0) code x ,r0), and thus can be based on G(m x ,r0) performs RM encoding on the bit sequence to be encoded corresponding to the x-th data retransmission to obtain the encoded bit sequence corresponding to the x-th data retransmission. For example, the encoded bit sequence c corresponding to the x-th data retransmission... x The following formula can be satisfied: c x =u x G(m x ,r0), where u x Let G(m) be the bit sequence to be encoded corresponding to the x-th data retransmission. x The determination of r0 can be referred to the above description of the generating matrix, and will not be repeated here.

[0162] Step 705: The transmitting device outputs the encoded bit sequence corresponding to the xth data retransmission; correspondingly, the receiving device receives the xth second demodulated information from the transmitting device.

[0163] Optionally, the sending device can determine the length E based on the encoded bit sequence corresponding to the x-th data retransmission. x The second sequence. It is understandable that E x It can be predefined, or, E x It can be associated with the transmission resources corresponding to the x-th data retransmission. For example, E x It can be the product of the number of REs carried by the transmission resources corresponding to the x-th data retransmission and the modulation order corresponding to the x-th data retransmission.

[0164] It is understandable that the modulation order corresponding to different data retransmissions can be the same or different, without restriction. Furthermore, the modulation order corresponding to the x-th data retransmission can be the same or different from the modulation order corresponding to the initial data transmission, without restriction.

[0165] The determination of the second sequence can refer to the description of the second sequence in the following two possible designs, which will not be repeated here. In the first possible design, the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the coded bit sequence corresponding to the x-th data retransmission; in the second possible design, the second sequence corresponding to the x-th data retransmission can be determined based on the fourth sequence, which is associated with the coded bit sequence corresponding to the x-th data retransmission.

[0166] Optionally, the transmitting device may interleave the second sequence to obtain a second interleaved bit sequence, and then modulate the second interleaved bit sequence to obtain a second modulated symbol sequence; or, the transmitting device may modulate the second sequence to obtain a second modulated symbol sequence, without limitation.

[0167] It is understandable that the second modulation symbol sequence sent by the transmitting device to the receiving device may be affected by noise and other interference during transmission through the channel. The xth second demodulated information received by the receiving device is the second modulation symbol sequence affected by noise and other interference. In other words, the symbol carried by the xth second demodulated information is the xth second modulation symbol sequence after transmission through the channel.

[0168] Step 706: The receiving device demodulates the xth second demodulated information to obtain the xth seventh sequence.

[0169] Specifically, the receiving device can demodulate the xth second demodulated information to obtain the xth second demodulated bit sequence; then, it can deinterleave (optional) and derate match the xth second demodulated bit sequence to obtain the xth seventh sequence.

[0170] Optionally, if the transmitting device interleaves the second sequence, the receiving device can deinterleave the xth second demodulated bit sequence to obtain the xth second deinterleaved bit sequence, and perform derate matching on the xth second deinterleaved bit sequence to obtain the xth seventh sequence; otherwise, the receiving device can perform derate matching on the xth second demodulated bit sequence to obtain the xth seventh sequence.

[0171] Step 707: The receiving device, according to m x and r0, for length M x The xth eighth sequence is RM-decoded to obtain the second decoding result.

[0172] Where, m x And r0 can be compared with the above for m x The descriptions of r0 and r0 will not be elaborated here.

[0173] Among them, M x for

[0174] Among them, the xth eighth sequence is associated with the sixth sequence and the xth seventh sequence.

[0175] Specifically, the receiving device can determine the xth ninth sequence and the xth tenth sequence based on the xth seventh sequence. The xth ninth sequence can be understood as the incremental bit sequence corresponding to the xth data retransmission after channel transmission. The xth tenth sequence can include bits from the xth seventh sequence other than the xth ninth sequence. The receiving device can accumulate the bits carrying the same position in the xth tenth sequence and the (x-1)th ninth sequence to update the (x-1)th ninth sequence. The xth eighth sequence can include the sixth sequence, the updated first ninth sequence, the updated second ninth sequence, ..., the updated (x-1)th ninth sequence, and the xth ninth sequence.

[0176] Alternatively, the receiving device can determine the xth ninth sequence based on the xth seventh sequence. The xth ninth sequence can be understood as the incremental bit sequence corresponding to the xth data retransmission after channel transmission. The xth eighth sequence can include the sixth sequence, the first ninth sequence, the second ninth sequence, ..., the (x-1)th ninth sequence, and the xth ninth sequence.

[0177] Based on the communication method shown in Figure 7, the transmitting device can perform RM encoding on the information bit sequence according to m0 and r0 to obtain the first sequence, thereby realizing the initial data transmission; furthermore, the transmitting device can... xThe bit sequence to be encoded corresponding to the x-th data retransmission is RM encoded using r0 to obtain the encoded bit sequence corresponding to the x-th data retransmission, thus realizing data retransmission. On one hand, the bit sequence to be encoded corresponding to the x-th data retransmission can include the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, and the encoded bit sequence corresponding to the x-th data retransmission can also include the encoded bit sequence corresponding to the (x-1)-th data retransmission. Combining RM encoding with the HARQ transmission mechanism to realize data retransmission can improve error correction performance, thereby improving both encoding and decoding performance. On the other hand, in m... x When the value is greater than m0, the encoded bit sequence corresponding to the x-th data retransmission can also include at least one incremental bit, which can improve the encoding gain of the data retransmission and thus improve the retransmission performance of the RM code.

[0178] Additionally, due to m x It can be greater than or equal to m0, and can be increased by m. x The range of values ​​can improve the code rate (i.e., the ratio of the length of the bit sequence to be encoded to the length of the encoded bit sequence) and the flexibility of the code length of RM codes, thereby improving the flexibility and diversity of RM encoding and improving encoding and decoding performance.

[0179] Based on the communication method shown in Figure 7, the transmitting device can, according to m x The bit sequence to be encoded corresponding to the x-th data retransmission is RM encoded using r0 to obtain the encoded bit sequence corresponding to the x-th data retransmission. x It is an integer greater than or equal to m0.

[0180] Optionally, m0 can be predefined (or can be described as m0 being predefined by the protocol); in this case, the sending device can directly determine m0, which can reduce the workload of the sending device and simplify the implementation.

[0181] Alternatively, m0 can be configured for network devices; this can improve the efficiency of information exchange between network devices and terminal devices, thereby enhancing communication performance. For example, the network device can determine m0 based on the actual communication scenario or situation, and then send first indication information to the terminal device; correspondingly, the terminal device can receive the first indication information from the network device and determine m0 based on the first indication information. The first indication information can be used to indicate m0; or, the first indication information can be used to indicate the identification information of m0, without limitation.

[0182] In this application, the network device can be a transmitting device or a receiving device; correspondingly, the terminal device can be a receiving device or a transmitting device, without limitation.

[0183] Optional, mx Can be with m x-1 Same; or, m x It can be m x-1 The sum of 1 and 2. Similarly, m x-1 Can be with m x-2 Same; or, m x-1 It can be m x-2 The sum of 1 and 2. Similarly, m x-2 Can be with m x-3 Same; or, m x-2 It can be m x-3 The sum of 1 and 1. ... Similarly, m1 can be the same as m0; or, m1 can be the sum of m0 and 1.

[0184] In other words, for two adjacent data retransmissions (such as the x-th data retransmission and the (x-1)-th data retransmission), m x Can be with m x-1 Similarly, at this time, the bit sequence to be encoded corresponding to the x-th data retransmission can be the same as the bit sequence to be encoded corresponding to the (x-1)-th data retransmission, and the encoded bit sequence corresponding to the x-th data retransmission can also be the same as the encoded bit sequence corresponding to the (x-1)-th data retransmission. It is understandable that during the x-th data retransmission, the transmitting device can output some or all of the bits in the encoded bit sequence corresponding to the (x-1)-th data retransmission, which simplifies the implementation of data retransmission and reduces its complexity.

[0185] Or, m x It can be m x-1 The sum of 1 and 2, at this point, the bit sequence to be encoded corresponding to the x-th data retransmission can include the bit sequence to be encoded corresponding to the (x-1)-th data retransmission and a length of (K). x -K x-1 The third sequence of ) can include the encoded bit sequence corresponding to the x-th data retransmission and the encoded bit sequence of the (x-1)-th data retransmission, and a sequence of length (M). x -M x-1 The incremental bit sequence of (x). It can be understood that during the x-th data retransmission, the transmitting device can output some or all of the bits in the incremental bit sequence corresponding to the x-th data retransmission, which can improve the coding gain of the data retransmission, thereby improving the retransmission performance of the RM code.

[0186] The third sequence mentioned above can be referred to in the following description of the third sequence, which will not be repeated here.

[0187] This application provides two possible implementations. Taking a maximum number of data retransmissions (i.e., A) of 3 as an example, the first parameter corresponding to any data retransmission is determined.

[0188] In a first possible embodiment, m1 can be the sum of m0 and 1; m2 can be the sum of m1 and 1; and m3 can be m2. For example, if m0 is 5, m1 can be 6, m2 can be 7, and m3 can be 7.

[0189] Based on the first possible embodiment, since m x Each additional value doubles the number of rows (or columns) in the generator matrix corresponding to the RM code, thus increasing the implementation complexity of RM encoding. Therefore, setting m3 to m2 can reduce the number of rows (or columns) in the generator matrix corresponding to the RM code, thereby reducing the implementation complexity of RM encoding.

[0190] In a second possible embodiment, m1 can be the sum of m0 and 1; m2 can be the sum of m1 and 1; and m3 can be the sum of m2 and 1. For example, if m0 is 5, m1 can be 6, m2 can be 7, and m3 can be 8.

[0191] Based on the second possible embodiment, the encoded bit sequence corresponding to different data retransmissions can include one or more incremental bits, which can improve the encoding gain of data retransmission and thus improve the retransmission performance of RM code.

[0192] Optionally, r0 can be predefined (or can be described as r0 being predefined by the protocol); this allows the sending device to directly determine r0, reducing the workload of the sending device and simplifying implementation.

[0193] Alternatively, r0 can be configured for network devices, improving the efficiency of information exchange between network devices and terminal devices, thereby enhancing communication performance. For example, the network device can determine r0 based on the actual communication scenario or situation, and then send second indication information to the terminal device; correspondingly, the terminal device can receive the second indication information from the network device and determine r0 based on the second indication information. The second indication information can be used to indicate r0; or, it can be used to indicate the identification information of r0, without limitation.

[0194] Based on the above, m x The description, m x It can be m x-1 The sum of 1 and 2, at this point, the bit sequence to be encoded corresponding to the x-th data retransmission can include the bit sequence to be encoded corresponding to the (x-1)-th data retransmission and a length of (K). x -K x-1 The third sequence. This application provides two possible implementations to determine the third sequence:

[0195] In the first possible implementation, the third sequence can be predefined, or it can be described as the third sequence being predefined by the protocol.

[0196] The length of the third sequence corresponding to different data retransmissions can be the same, or the length of the third sequence corresponding to different data retransmissions can be different; correspondingly, the third sequence corresponding to different data retransmissions can be the same, or the third sequence corresponding to different data retransmissions can be different, without restriction.

[0197] Specifically, the third sequence corresponding to the xth data retransmission can be predefined.

[0198] For example, the third sequence corresponding to the x-th data retransmission can be a preset fixed value. For instance, the bit values ​​of all bits in the third sequence corresponding to the x-th data retransmission can be "1"; or, the bit values ​​of all bits in the third sequence corresponding to the x-th data retransmission can be "0".

[0199] Based on the first possible implementation, the sending device can directly determine the third sequence, which can reduce the workload of the sending device, improve work efficiency, and simplify implementation.

[0200] In the second possible implementation, the third sequence can be associated with the information bit sequence. Specifically, the third sequence corresponding to the x-th data retransmission can be associated with the information bit sequence.

[0201] In the first example, the third sequence corresponding to the xth data retransmission may include some or all of the bits in the information bit sequence.

[0202] For example, in (K) x -K x-1 () less than or equal to K x-1 In the case of the x-th data retransmission, the third sequence may include bits 0 to (K) of the information bit sequence. x -K x-1 -1) bits; or, the third sequence corresponding to the x-th data retransmission may include the Kth bit in the information bit sequence. x -1 bit to the Kth bit x-1 1 bit.

[0203] For example, in (K) x -K x-1 () greater than K x-1 In the case of the x-th data retransmission, the third sequence may include bits 0 to (K) of the information bit sequence. x-1 -1) bits, and bits 0 to (K) of the information bit sequence. x -2K x-1-1) bits; or, the third sequence corresponding to the x-th data retransmission may include the (K)-th bit in the information bit sequence. x -1) bits to the 0th bit, and the (K)th bit in the information bit sequence x -1) bits to the (3K)th bit x-1 -K x -1) bits.

[0204] Based on the first example, some or all of the bits in the information bit sequence can be encoded repeatedly, which is equivalent to repeatedly transmitting some or all of the bits in the information bit sequence, thereby improving encoding and decoding performance.

[0205] In the second example, the third sequence corresponding to the x-th data retransmission can be determined based on at least one bit in the information bit sequence (K). x -K x-1 There are Q parity bits. For example, Q bits can be determined from the third sequence corresponding to the x-th data retransmission in a forward (or backward) order, and then the parity bits corresponding to the Q bits can be determined, where Q can be a positive integer. That is, each Q bits in the information bit sequence can correspond to one or more parity bits.

[0206] Based on the second example, the receiving device can verify the information bit sequence through a third sequence, which can improve error correction performance, thereby improving encoding and decoding performance.

[0207] The check bits can be either CRC bits or parity check (PC) bits, without restriction.

[0208] It is understood that the third sequence corresponding to the x-th data retransmission can be determined based on the first example above; or, the third sequence corresponding to the x-th data retransmission can be determined based on the second example above; or, the third sequence corresponding to the x-th data retransmission can be determined based on both the first and second examples above. For example, some bits in the third sequence corresponding to the x-th data retransmission can be determined based on the first example, and other bits can be determined based on the second example, without restriction.

[0209] Based on the second possible implementation, the sending device can dynamically determine the third sequence according to the actual communication scenario, which can improve the flexibility and diversity of determining the third sequence; at the same time, it can make the third sequence better meet the communication requirements and improve the encoding and decoding performance.

[0210] Based on the above description of the third sequence corresponding to the x-th data retransmission, the transmitting device can determine the incremental bit sequence corresponding to the x-th data retransmission (i.e., the bits in the encoded bit sequence corresponding to the x-th data retransmission other than the encoded bit sequence corresponding to the (x-1)-th data retransmission) based on the third sequence corresponding to the x-th data retransmission. In other words, the transmitting device can perform RM encoding on the third sequence corresponding to the x-th data retransmission, which can reduce the complexity of data retransmission compared to performing RM encoding on the bit sequence to be encoded corresponding to the x-th data retransmission.

[0211] The encoded bit sequence corresponding to the x-th data retransmission may include the encoded bit sequence corresponding to the (x-1)-th data retransmission and the incremental bit sequence corresponding to the x-th data retransmission.

[0212] Optionally, the incremental bit sequence corresponding to the x-th data retransmission can be the result of XORing the encoded bit sequence corresponding to the (x-1)-th data retransmission with the x-th first encoded bit sequence; or it can be described as follows: the bits in the encoded bit sequence corresponding to the x-th data retransmission other than the encoded bit sequence corresponding to the (x-1)-th data retransmission can be the result of XORing the encoded bit sequence corresponding to the (x-1)-th data retransmission with the x-th first encoded bit sequence.

[0213] For example, the increment bit sequence corresponding to the x-th data retransmission can be the result of bitwise XORing the encoded bit sequence corresponding to the (x-1)-th data retransmission with the x-th first encoded bit sequence. For instance, taking the encoded bit sequence corresponding to the (x-1)-th data retransmission as 1001 and the x-th first encoded bit sequence as 0011, the 0th bit in the increment bit sequence corresponding to the x-th data retransmission can be the result of XORing "1" and "0", which is "1"; the 1st bit in the increment bit sequence corresponding to the x-th data retransmission can be the result of XORing "0" and "0", which is "0"; the 2nd bit in the increment bit sequence corresponding to the x-th data retransmission can be the result of XORing "0" and "1", which is "1"; and the 0th bit in the increment bit sequence corresponding to the x-th data retransmission can be the result of XORing "1" and "1", which is "0". Therefore, the increment bit sequence corresponding to the x-th data retransmission can be 1010.

[0214] Wherein, the x-th first encoded bit sequence can be based on m0 and r x The x-th data retransmission is obtained by RM encoding the third sequence; or it can be described as the x-th first encoded bit sequence being based on m0 and r. x It is obtained by RM encoding of the bit sequence to be encoded corresponding to the x-th data retransmission, excluding the bit sequence to be encoded corresponding to the (x-1)-th data retransmission.

[0215] Where, rx It can be r x-1 The difference between r0 and 1, r1 can be the difference between r0 and 1.

[0216] Understandably, for the initial data transmission, the sending device can determine the generator matrix G(m0,r0) of the RM(m0,r0) code based on m0 and r0, with the first sequence c0 = u0G(m0,r0), where u0 is the information bit sequence.

[0217] For the first data retransmission, m1 can be m0+1, and the generator matrix G(m1,r0) corresponding to m1 and r0 can be associated with G(m0,r0), that is, The bit sequence u1 to be encoded corresponding to the first data retransmission can include the information bit sequence u0 and the third sequence u1′ corresponding to the first data retransmission, that is, u1 = [u0, u1′]. Therefore, u1G(m1,r0) can be replaced with...

[0218] in, c1′ is the first first encoded bit sequence, and correspondingly, c0+c1′ is the increment bit sequence corresponding to the first data retransmission. In other words, the first first encoded bit sequence (i.e., u1′G(m0,r0-1)) can be obtained by RM encoding the third sequence corresponding to the first data retransmission based on m0 and r1 (i.e., r1=r0-1).

[0219] For the second data retransmission, m2 can be m1+1 (i.e., m2 can be m0+2), and the generator matrix G(m2,r0) corresponding to m2 and r0 can be associated with G(m1,r0), that is, Furthermore, the generating matrix G(m2,r0) corresponding to m2 and r0 can be associated with G(m0,r0), that is, The bit sequence to be encoded corresponding to the second data retransmission can include the bit sequence to be encoded corresponding to the first data retransmission and the third sequence corresponding to the second data retransmission. That is, the bit sequence to be encoded u2 corresponding to the second data retransmission can include the information bit sequence u0, the third sequence u1′ corresponding to the first data retransmission, and the third sequence u2′ corresponding to the second data retransmission, i.e., u2=[u0, u ′ 1, u2′]. Then, u2G(m2,r0) can be replaced with Here, the length of u2′ is the sum of the lengths of u0 and u′1, and u2′ corresponds to the last two rows in G(m2,r0), that is to say... It can be replaced with,

[0220] in, c2′=u2′G(m0+1,r0), where c2′ is the second first encoded bit sequence, and the corresponding [c0, c0+c1′]+c2′ is the increment bit sequence corresponding to the second data retransmission. In other words, the second first encoded bit sequence (i.e., c2′=u2′G(m0+1,r0)) can be obtained by RM encoding the third sequence corresponding to the second data retransmission based on m0 and r2 (i.e., r2=r0-2).

[0221] Similarly, the x-th data retransmission can be described in the same way as the first and second data retransmissions described above, and will not be repeated here. Therefore, the x-th first encoded bit sequence can be based on m0 and r x (that is, r) x =r0-x) is obtained by RM encoding the third sequence corresponding to the xth data retransmission.

[0222] This application provides a possible embodiment. Taking m0 as 2 and r0 as 1 as an example, the length K0 of the information bit sequence can be 3. Assuming the information bit sequence is {1 0 1}, the length of the first sequence can be 4. The first sequence can be the product of the information bit sequence and G(2,1) (G(2,1) is the generator matrix corresponding to the RM(2,1) code), that is, the first sequence can be {1 0 1 0}.

[0223] For the first data retransmission, m1 can be 3, the length of the bit sequence to be encoded corresponding to the first data retransmission can be 4, and the bit sequence to be encoded corresponding to the first data retransmission can include the information bit sequence and the third sequence corresponding to the first data retransmission (such as {1}). Then, the encoded bit sequence corresponding to the first data retransmission can be the product of {1 0 1 1} and G(3,1) (G(3,1) is the generator matrix corresponding to the RM(3,1) code). That is, the encoded bit sequence corresponding to the first data retransmission can be {1 0 1 0 0 1 0 1}, and the incremental bit sequence corresponding to the first data retransmission can be {0 1 0 1}.

[0224] For the second data retransmission, m2 can be 4, the length of the bit sequence to be encoded corresponding to the second data retransmission can be 5, and the bit sequence to be encoded corresponding to the second data retransmission can include the information bit sequence, the third sequence corresponding to the first data retransmission (such as {1}), and the third sequence corresponding to the second data retransmission (such as {0}). Then, the encoded bit sequence corresponding to the first data retransmission can be the product of {1 0 1 1 0} and G(4,1) (G(4,1) is the generator matrix corresponding to the RM(4,1) code). That is, the encoded bit sequence corresponding to the second data retransmission can be {1 0 1 0 0 1 0 1 1 0 1 0 0 1 0 1}, and the incremental bit sequence corresponding to the second data retransmission can be {1 0 1 0 0 1 0 1}.

[0225] It is understood that the above embodiments are illustrated using x as 1 and 2 as examples, and do not impose any restrictions on the value of x. That is, x can also be 3, 4, ... The determination of the bit sequence to be encoded, the third sequence, the encoded bit sequence, and the incremental bit sequence corresponding to the xth data retransmission can be referred to the description of the above embodiments, and will not be repeated here.

[0226] Based on the above description of the encoded bit sequence corresponding to the x-th data retransmission, optionally, the sending device can determine the length of E according to the encoded bit sequence corresponding to the x-th data retransmission. x The second sequence can then be interleaved (optionally) and modulated to obtain the second modulation symbol sequence corresponding to the x-th data retransmission and transmitted. Regarding the determination of the second sequence corresponding to the x-th data retransmission, this application provides two possible designs. In the first possible design, the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the coded bit sequence corresponding to the x-th data retransmission. In the second possible design, the second sequence corresponding to the x-th data retransmission can be determined based on a fourth sequence, which is associated with the coded bit sequence corresponding to the x-th data retransmission.

[0227] The first possible design is described in detail below:

[0228] The second sequence corresponding to the x-th data retransmission may include some or all of the bits in the encoded bit sequence corresponding to the x-th data retransmission. This application provides two possible implementations:

[0229] In the first possible implementation, m x It can be equal to m x-1 The encoded bit sequence corresponding to the x-th data retransmission can be the encoded bit sequence corresponding to the (x-1)-th data retransmission. In this case, the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the encoded bit sequence corresponding to the (x-1)-th data retransmission.

[0230] In one example, in M x Less than E x In this case, the transmitting device can send the encoded bit sequence corresponding to the (x-1)th data retransmission, and then repeatedly send part or all of the bits of the encoded bit sequence corresponding to the (x-1)th data retransmission. For example, the second sequence corresponding to the xth data retransmission may include bits 0 to M from the encoded bit sequence corresponding to the (x-1)th data retransmission. x -1 bits, and bits 0 to E in the encoded bit sequence corresponding to the (x-1)th data retransmission. x -M x -1 bit. For example, the second sequence corresponding to the x-th data retransmission may include the M-th bit from the encoded bit sequence corresponding to the (x-1)-th data retransmission. z -1 bits to the 0th bit, and the Mth bit in the first sequence x -1 bit to the 2M x -E x 1 bit.

[0231] In another example, in M x Greater than or equal to E x In this case, the transmitting device can punch M holes in the encoded bit sequence corresponding to the (x-1)th data retransmission from the beginning. x -E x For example, the second sequence corresponding to the x-th data retransmission may include the M-th bit sequence of the encoded bit sequence corresponding to the (x-1)-th data retransmission. x -E x bits up to the Mth x -1 bit. Alternatively, the transmitting device can shorten the encoded bit sequence corresponding to the (x-1)th data retransmission by M bits from the end to the beginning. x -E x For example, the second sequence corresponding to the x-th data retransmission may include the 0th bit to the Eth bit of the encoded bit sequence corresponding to the (x-1)-th data retransmission. x -1 bit.

[0232] In the second possible implementation, m x It can be greater than m x-1 (i.e. m) x =m x-1 +1), the encoded bit sequence corresponding to the x-th data retransmission may include the encoded bit sequence corresponding to the (x-1)-th data retransmission and the incremental bit sequence corresponding to the x-th data retransmission. At this time, the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the incremental bit sequence corresponding to the x-th data retransmission.

[0233] The incremental bit sequence corresponding to the x-th data retransmission can be referred to the above description of the incremental bit sequence corresponding to the x-th data retransmission, and will not be repeated here.

[0234] In one example, in M x -M x-1 Greater than or equal to E x In this case, the sending device can punch M holes in the incremental bit sequence corresponding to the x-th data retransmission from the beginning. x -M x-1 -E x For example, the second sequence corresponding to the x-th data retransmission may include the M-th bit of the increment bit sequence corresponding to the x-th data retransmission. x -M x-1 -E x bits up to the Mth x -1 bit. Alternatively, the sending device can shorten the incremental bit sequence corresponding to the x-th data retransmission by M bits, working backwards. x -M x-1 -E x For example, the second sequence corresponding to the x-th data retransmission may include the 0th bit to the Eth bit of the increment bit sequence corresponding to the x-th data retransmission. x -1 bit.

[0235] In another example, in M x -M x-1 Less than E x In the case of the x-th data retransmission, the second sequence corresponding to the x-th data retransmission may include all bits in the increment bit sequence corresponding to the x-th data retransmission. The second sequence corresponding to the x-th data retransmission may also include one or more of the following: some or all bits in the increment bit sequence corresponding to the x-th data retransmission; or some or all bits in the encoded bit sequence corresponding to the (x-1)-th data retransmission.

[0236] For example, the second sequence corresponding to the x-th data retransmission may include bits 0 to M from the increment bit sequence corresponding to the x-th data retransmission. x -M x-1 -1 bits, and bits 0 to E in the increment bit sequence corresponding to the x-th data retransmission. x -(M x -M x-1 -1 bits; or, the second sequence corresponding to the x-th data retransmission may include the M-th bit in the increment bit sequence corresponding to the x-th data retransmission. x -M x-1 Bits -1 to 0, and the Mth bit in the increment bit sequence corresponding to the x-th data retransmission. x -M x-1-1 bit to the 2nd (M) x -M x-1 )-E x -1 bit.

[0237] For example, the second sequence corresponding to the x-th data retransmission may include bits 0 to M from the increment bit sequence corresponding to the x-th data retransmission. x -M x-1 -1 bits, and bits 0 to E in the encoded bit sequence corresponding to the (x-1)th data retransmission. x -(M x -M x-1 -1 bits; or, the second sequence corresponding to the x-th data retransmission may include the M-th bit in the increment bit sequence corresponding to the x-th data retransmission. x -M x-1 Bits M-1 to 0, and the encoded bit sequence corresponding to the (x-1)th data retransmission. x -M x-1 -1 bit to the 2nd (M) x -M x-1 )-E x -1 bit.

[0238] For example, the second sequence corresponding to the x-th data retransmission may include bits 0 to M from the increment bit sequence corresponding to the x-th data retransmission. x -M x-1 -1 bits, and bits 0 to E in the encoded bit sequence corresponding to the x-th data retransmission. x -(M x -M x-1 -1 bits; or, the second sequence corresponding to the x-th data retransmission may include the M-th bit in the increment bit sequence corresponding to the x-th data retransmission. x -M x-1 Bits M-1 to 0, and the encoded bit sequence corresponding to the x-th data retransmission. x -M x-1 -1 bit to the 2nd (M) x -M x-1 )-E x -1 bit.

[0239] Based on the first possible design, the transmitting device can output part or all of the bits in the encoded bit sequence corresponding to the x-th data retransmission, excluding the encoded bit sequence corresponding to the (x-1)-th data retransmission (i.e., the second sequence). In other words, the transmitting device can output the incremental part of the encoded bit sequence corresponding to the x-th data retransmission with a lower code rate, which can improve the coding gain of data retransmission and thus improve the retransmission performance of RM code.

[0240] In the second possible design, the second sequence corresponding to the x-th data retransmission can be related to a sequence of length M. A The fourth sequence association.

[0241] Among them, M A It can be m A This can be understood as the first parameter during the Ath data retransmission. The first parameter can be referred to in the above description of the first parameter, and will not be repeated here.

[0242] Where A represents the maximum number of data retransmissions. Optionally, A can be predefined (or can be described as A being predefined by the protocol); or A can be configured by the network device.

[0243] For example, a network device may send third indication information to a terminal device; correspondingly, the terminal device may receive the third indication information from the network device and determine A based on the third indication information. The third indication information may be used to indicate the value of A; or, the third indication information may be used to indicate the identification information of A.

[0244] Optional, m A It can be the sum of m0 and A, or m A It can be the sum of m0 and (A-1). For example, taking A as 3, m1 can be m0+1, m2 can be m1+1, and m3 can be m2+1, that is, m A It can be the sum of m0 and A. Alternatively, taking A as 4 as an example, m1 can be m0+1, m2 can be m1+1, m3 can be m2+1, and m4 can be m3, that is, m... A It can be the sum of m0 and (A-1).

[0245] The fourth sequence can be obtained by using a sequence of length K. A The fifth sequence is obtained by RM encoding.

[0246] Among them, K A With m A Associated with r0. For example, K A The following formula can be satisfied: The description of r0 above is sufficient and will not be repeated here.

[0247] The fourth sequence can include the coded bit sequence corresponding to the (A-1)th data retransmission, the coded bit sequence corresponding to the (A-1)th data retransmission can include the coded bit sequence corresponding to the (A-2)th data retransmission, the coded bit sequence corresponding to the (A-2)th data retransmission can include the coded bit sequence corresponding to the (A-3)th data retransmission, and so on. The coded bit sequence corresponding to the 1st data retransmission can include the first sequence. In other words, the determination of the fourth sequence can refer to the above description of the coded bit sequence corresponding to the xth data retransmission; that is, the fourth sequence can be determined by replacing x with A. This will not be elaborated further here.

[0248] The fifth sequence can include the bit sequence to be encoded corresponding to the (A-1)th data retransmission, the bit sequence to be encoded corresponding to the (A-1)th data retransmission can include the bit sequence to be encoded corresponding to the (A-2)th data retransmission, the bit sequence to be encoded corresponding to the (A-2)th data retransmission can include the bit sequence to be encoded corresponding to the (A-3)th data retransmission, and so on. The bit sequence to be encoded corresponding to the 1st data retransmission can include the information bit sequence. In other words, the determination of the fifth sequence can refer to the above description of the bit sequence to be encoded corresponding to the xth data retransmission; that is, the fifth sequence can be determined by replacing x with A. This will not be elaborated further here.

[0249] Based on the second possible design, this application provides two possible implementations:

[0250] In the first possible implementation, the second sequence corresponding to the x-th data retransmission may include the C-th sequence in the fourth sequence. x One or more bits from the first bit to the (D-1)th bit.

[0251] Among them, C x It can be predefined; or it can be described as, C x It can be predefined for the protocol. The sending device can directly determine C. x The value of can simplify the implementation.

[0252] In one example, taking A as 3, C0 can be 0, C1 can be K0, C2 can be K1, and C3 can be K2. K0 can be associated with m0 and r0, for example... K1 can be associated with m1 and r0, for example, K2 can be associated with m2 and r0, for example,

[0253] For example, taking x as 1, the second sequence corresponding to the first data retransmission may include one or more bits from the K0 (i.e., C1) bit to the (D-1)th bit in the fourth sequence; as another example, taking x as 2, the second sequence corresponding to the second data retransmission may include one or more bits from the K1 (i.e., C2) bit to the (D-1)th bit in the fourth sequence; as yet another example, taking x as 3, the second sequence corresponding to the third data retransmission may include one or more bits from the K2 (i.e., C3) bit to the (D-1)th bit in the fourth sequence.

[0254] In another example, C0 can be 0, C1 can be K0, C2 can be K1, and C3 can be (K1+K2) / 2. For instance, with x being 3, the second sequence corresponding to the third data retransmission can include one or more bits from the (K1+K2) / 2 (i.e., C3)th bit to the (D-1)th bit in the fourth sequence.

[0255] In the case where x is 0, the second sequence corresponding to the 0th data retransmission can be understood as the first rate-matching bit sequence mentioned above. That is, the first rate-matching bit sequence mentioned above can also be replaced by the second sequence corresponding to the 0th data retransmission. For example, the second sequence corresponding to the 0th data retransmission may include one or more bits from the 0th (i.e., C0) bit to the (D-1)th bit in the fourth sequence.

[0256] Where D can be C x+1 Alternatively, D can be (M) A -1). For example, with x = 1, D can be C2, and the second sequence corresponding to the first data retransmission can include one or more bits from the C1th bit to the C2-1th bit in the fourth sequence.

[0257] In the first example, the second sequence corresponding to the x-th data retransmission may include the C-th sequence in the fourth sequence. x bits up to the Cth bit x+1 -1 bits. That is, the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the encoded bit sequence corresponding to the x-th data retransmission, excluding the encoded bit sequence corresponding to the x-1-th data retransmission; or it can be described as the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the incremental bit sequence corresponding to the x-th data retransmission.

[0258] For example, in C x+1 -C x Less than E x In the case of the x-th data retransmission, the second sequence corresponding to the x-th data retransmission can be obtained by modifying the C-th sequence in the fourth sequence. x bits up to the Cth bitx+1 -1 bits are repeated to obtain the result. For example, the second sequence corresponding to the xth data retransmission may include the Cth bit in the fourth sequence. x bits up to the Cth bit x+1 -1 bit, and the Cth bit in the fourth sequence x bits up to the Eth x -(C x+1 -C x -1 bit.

[0259] For example, in C x+1 -C x Greater than or equal to E x In the case of the x-th data retransmission, the second sequence corresponding to the x-th data retransmission can be obtained by modifying the C-th sequence in the fourth sequence. x bits up to the Cth bit x+1 -1 bits are shortened or punctured to obtain the second sequence, for example, the second sequence corresponding to the xth data retransmission may include the Cth bit in the fourth sequence. x bits up to the Cth bit x +E x -1 bit.

[0260] In the second example, the second sequence corresponding to the x-th data retransmission may include the C-th sequence in the fourth sequence. x The bits up to the (M)th bit A One or more bits from the (-1) bits. That is, the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the encoded bit sequence corresponding to the A-th data retransmission, excluding the encoded bit sequence corresponding to the (x-1)-th data retransmission.

[0261] For example, in M A -C x Less than E x In the case of the x-th data retransmission, the second sequence corresponding to the x-th data retransmission can be obtained by modifying the C-th sequence in the fourth sequence. x bits up to the Mth A -1 bits are repeated to obtain the result. For example, the second sequence corresponding to the xth data retransmission may include the Cth bit in the fourth sequence. x bits up to the Mth A -1 bit, and the Cth bit in the fourth sequence x bits up to the Eth x -(M A -C x -1 bit.

[0262] For example, in M A -C x Greater than or equal to E x In the case of the x-th data retransmission, the second sequence corresponding to the x-th data retransmission can be obtained by modifying the C-th sequence in the fourth sequence.x bits up to the Mth A -1 bits are shortened or punctured to obtain the second sequence, for example, the second sequence corresponding to the xth data retransmission may include the Cth bit in the fourth sequence. x bits up to the Cth bit x +E x -1 bit.

[0263] Based on the first possible implementation, the sending device can directly determine the fourth sequence, and during the x-th data retransmission, determine the second sequence corresponding to the x-th data retransmission from the fourth sequence to achieve data retransmission, which simplifies the implementation.

[0264] Additionally, when D is C x+1 In the case where the second sequence corresponding to the x-th data retransmission can include some or all of the bits in the incremental bit sequence corresponding to the x-th data retransmission, which simplifies the implementation; when D is (M A In the case of -1), the second sequence corresponding to the x-th data retransmission may include some or all of the bits in the encoded bit sequence corresponding to the A-th data retransmission except for the encoded bit sequence corresponding to the x-1-th data retransmission. This can make the bits included in the second sequence corresponding to different data retransmissions overlap, which can improve encoding and decoding performance.

[0265] In the second possible implementation, the second sequence corresponding to the x-th data retransmission may include the (E0+E1+…+E)-th sequence from the fourth sequence. x-1 ) bits to the (E0+E1+…+E)th bit x -1) bits.

[0266] For example, taking x as 1, the second sequence corresponding to the x-th data retransmission may include the E0-th bit to the (E0+E1-1)-th bit in the fourth sequence. Or, taking x as 2, the second sequence corresponding to the x-th data retransmission may include the E0+E1-th bit to the (E0+E1+E2-1)-th bit in the fourth sequence.

[0267] In the case where x is 0, the second sequence corresponding to the 0th data retransmission can be understood as the first rate-matching bit sequence mentioned above. That is, the first rate-matching bit sequence mentioned above can also be replaced by the second sequence corresponding to the 0th data retransmission. For example, the second sequence corresponding to the 0th data retransmission may include bits 0 to E0 from the fourth sequence.

[0268] Based on the second possible implementation, the sending device can directly determine the fourth sequence, and during the x-th data retransmission, determine the second sequence corresponding to the x-th data retransmission from the fourth sequence to achieve data retransmission, which simplifies the implementation.

[0269] In addition, during each data transmission, the sending device can sequentially determine the second sequence from the fourth sequence. That is, the absolute value of the difference between the sequence number of the starting bit of the second sequence corresponding to the x-th data retransmission and the sequence number of the ending bit of the second sequence corresponding to the (x-1)-th data retransmission is 1. This ensures that the bits included in the second sequence corresponding to different data retransmissions are different, and that all bits in the fourth sequence have a chance to be output as much as possible, thereby improving encoding and decoding performance.

[0270] Based on the second possible design, the transmitting device can determine the m A The bit sequence to be encoded (which includes the information bit sequence) is RM encoded with r0 to obtain the fourth sequence. The fourth sequence can be put into a buffer. During the x-th data retransmission, the second sequence corresponding to the x-th data retransmission can be determined from the fourth sequence to realize the data retransmission.

[0271] The size of the buffer can be the length of the fourth sequence, i.e., The size of a buffer can be understood as the number of bits that the buffer can store.

[0272] Optionally, the size of the buffer can be less than or equal to the first threshold.

[0273] The first threshold can be predefined (or can be described as the first threshold being predetermined by the protocol); or the first threshold can be determined according to the actual communication scenario or communication situation, and is not restricted.

[0274] For example, the first threshold can be 1024; or, the first threshold can be 512.

[0275] It is understandable that the sending device can determine A based on a first threshold. For example, with the first threshold set to 1024, A can be a positive integer less than or equal to 10. Furthermore, in the determined... When the value is greater than the first threshold, it can make Let m be the first threshold, which makes m A Smaller size reduces the complexity of RM encoding.

[0276] Based on the second possible design, this application provides a possible embodiment in which the transmitting device can be based on m A And r0 determines the length as M AThe fourth sequence can be placed in a circular buffer, as shown in Figure 8. A can be 3. Taking C0 as 0 as an example, the fourth sequence corresponding to the 0th data retransmission can be one or more bits from the 0th bit to the C1-1th bit of the fourth sequence; the fourth sequence corresponding to the 1st data retransmission can be one or more bits from the C1th bit to the C2-1th bit of the fourth sequence; the fourth sequence corresponding to the 2nd data retransmission can be one or more bits from the C2th bit to the C3-1th bit of the fourth sequence; and the fourth sequence corresponding to the 3rd data retransmission can be one or more bits from the C3th bit to the Mth bit of the fourth sequence. A -1 bit or more bits.

[0277] In this application, the first sequence can be referred to as revision 0 (RV0), the incremental bit sequence corresponding to the first data retransmission can be referred to as revision 1 (RV1), the incremental bit sequence corresponding to the second data retransmission can be referred to as revision 2 (RV2), ..., and the incremental bit sequence corresponding to the Ath data retransmission can be referred to as revision A (RVA).

[0278] The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0279] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application.

[0280] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art will readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0281] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0282] Figure 9 shows a transmitting device 90 when each functional module is divided according to its corresponding function. The transmitting device 90 can perform the actions performed by the transmitting device in the method shown in Figure 7. All relevant content of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiment, and will not be repeated here.

[0283] The transmitting device 90 may include a transceiver module 901 and a processing module 902. Exemplarily, the transmitting device 90 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions applied in a communication device. When the transmitting device 90 is a communication device, the transceiver module 901 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 902 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 90 is a component having the aforementioned transmitting device functions, the transceiver module 901 may be a radio frequency unit; the processing module 902 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 90 is a chip system, the transceiver module 901 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 902 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 901 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 902 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0284] For example, the transceiver module 901 can be used to execute all the transceiver operations performed by the sending device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein; the processing module 902 can be used to execute all operations other than the transceiver operations performed by the sending device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein.

[0285] Figure 10 illustrates a receiving device 100, which can perform the actions performed by the receiving device in the method shown in Figure 7 above. All relevant content of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained can be referred to the above method embodiment, which will not be repeated here.

[0286] The receiving device 100 may include a transceiver module 1001 and a processing module 1002. For example, the receiving device 100 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions. When the receiving device 100 is a communication device, the transceiver module 1001 may be a transceiver, which may include an antenna and radio frequency circuits; the processing module 1002 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 100 is a component having the aforementioned receiving device functions, the transceiver module 1001 may be a radio frequency unit; the processing module 1002 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 100 is a chip system, the transceiver module 1001 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1002 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. The transceiver module 1001 in this embodiment can be implemented by a transceiver or transceiver-related circuit components; the processing module 1002 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0287] For example, the transceiver module 1001 can be used to execute all the transceiver operations performed by the receiving device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein; the processing module 1002 can be used to execute all operations other than the transceiver operations performed by the receiving device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein.

[0288] As another possible implementation, the transceiver module 901 in Figure 9 can be replaced by a transceiver unit that integrates the functions of the transceiver module 901; the processing module 902 can be replaced by a processor that integrates the functions of the processing module 902. Furthermore, the transmitting end device 90 shown in Figure 9 may also include a memory. Alternatively, the transceiver module 1001 in Figure 10 can be replaced by a transceiver unit that integrates the functions of the transceiver module 1001; the processing module 1002 can be replaced by a processor that integrates the functions of the processing module 1002. Furthermore, the receiving end device 100 shown in Figure 10 may also include a memory.

[0289] Alternatively, when the processing module 902 is replaced by a processor and the transceiver module 901 is replaced by a transceiver, the transmitting end device 90 involved in the embodiments of this application can also be the communication device 110 shown in FIG11. Or, when the processing module 1002 is replaced by a processor and the transceiver module 1001 is replaced by a transceiver, the receiving end device 100 involved in the embodiments of this application can also be the communication device 110 shown in FIG11.

[0290] The processor can be logic circuit 1101, and the transceiver can be interface circuit 1102. Furthermore, the communication device 110 shown in Figure 11 may also include a memory 1103. The memory 1103 can exist independently of the processor or be integrated with it. The memory 1103 can be used to store instructions, program code, or some data. The memory 1103 can be located inside or outside the communication device 110, without limitation.

[0291] This application also provides a communication device, as shown in FIG12. This communication device can be applied to the method shown in any of the embodiments in FIG7. As shown in FIG12, the communication device includes a processing module and a transceiver module. The processing module may be one or more processors, and the transceiver module may be a transceiver or a communication interface. This communication device can be used to implement the sending or receiving device involved in any of the above method embodiments, or to implement the functions of the device involved in any of the above method embodiments. The device or device function may be a network component in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (e.g., a cloud platform). Optionally, the communication device may further include a storage module for storing the program code and data of the communication device.

[0292] In one example, the communication device functions as a transmitting device or is a chip applied within a transmitting device, and executes the steps performed by the transmitting device in the above method embodiments. The transceiver module is used to specifically execute the transmitting and / or receiving actions performed by the transmitting device in any embodiment of FIG. 7, for example, supporting the transmitting device in performing other processes of the technology described herein. The processing module can be used to support the communication device in performing the processing actions in the above method embodiments, for example, supporting the transmitting device in performing other processes of the technology described herein.

[0293] To achieve the above functions, the chip of this application may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art will readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0294] In one possible implementation, when the transmitting or receiving device is a chip, the transceiver module can be a communication interface, pins, or circuits. The communication interface can be used to input data to be processed to the processor and can output the processor's processing results. Specifically, the communication interface can be a general purpose input / output (GPIO) interface, which can connect to multiple peripheral devices (such as LCD displays, cameras, radio frequency (RF) modules, antennas, etc.). The communication interface is connected to the processor via a bus.

[0295] The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to execute the methods involved in any of the embodiments shown in Figure 7. Further, the processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is mainly responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is mainly responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and conversions. The registers are mainly responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In specific implementations, the processor's hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS), an advanced reduced instruction set machine (RISC) machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be an internal storage module of the chip, such as registers or caches. The storage module can also be an external storage module, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0296] This application also provides an encoding processing unit chip architecture and a decoding processing unit chip architecture. The encoding processing unit chip architecture can be as shown in Figure 13, and the decoding processing unit chip architecture can be as shown in Figure 14. Both the encoding and decoding processing unit chip architectures can include a computing unit, a storage unit, and a control unit. The computing unit is responsible for processing the logical operations of the encoder and decoder, the storage unit is responsible for storing the data during the computing process, and the control unit is responsible for scheduling and controlling the computing unit and storage resources. The computing unit in Figure 13 can be used to add CRC check bits, RM encoding, and rate matching. The specific implementation method can refer to the communication method shown in Figure 7 of this application. The computing unit in Figure 14 can be used to implement rate matching, RM decoding, and CRC check. The specific implementation method can refer to the communication method shown in Figure 7 of this application, and will not be elaborated here.

[0297] This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0298] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0299] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0300] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0301] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0302] It is understood that in this application, "at least one (item)" refers to one or more. "More than one" refers to two or more. "At least two (items)" refers to two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. Both "...when" and "if" indicate that a corresponding action will be taken under certain objective circumstances. They are not time limits, nor do they require a judgment action at the time of implementation, nor do they imply any other limitations.

[0303] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.

[0304] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0305] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0306] In the several embodiments provided in this application, the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0307] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0308] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0309] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

Claims

A communication method characterized by comprising: comprises: performing Reed-Muller (RM) encoding on the information bit sequence with a length of K0 to obtain a first sequence with a length of M0; wherein the K0 is associated with the m0 and the r0, and the M0 is the m0 is a positive integer, and the r0 is an integer greater than or equal to 0; When the xth data retransmission, the RM encoding is performed on the to-be-encoded bit sequence with length K x to obtain an encoded bit sequence with length M x ; wherein the to-be-encoded bit sequence corresponding to the xth data retransmission comprises the to-be-encoded bit sequence corresponding to the (x-1)th data retransmission, and the to-be-encoded bit sequence corresponding to the 1st data retransmission comprises the information bit sequence; the encoded bit sequence corresponding to the xth data retransmission comprises the encoded bit sequence corresponding to the (x-1)th data retransmission, and the encoded bit sequence corresponding to the 1st data retransmission comprises the first sequence; the K x is associated with m x and the r0, and the M x is said m x is an integer greater than or equal to said mo; said x is a positive integer. The method of claim 1, wherein the method further comprises: when the xth data retransmission, Output length is E x of the second sequence; the E x is predefined, or the E x is associated with the transmission resource corresponding to the xth data retransmission. the second sequence comprises part or all of the bits in the xth data retransmission corresponding incremental bit sequence; wherein the xth data retransmission corresponding incremental bit sequence comprises the bits in the xth data retransmission corresponding encoding bit sequence, except the x-1th data retransmission corresponding encoding bit sequence. The method according to claim 2, characterized in that in the case that the second sequence comprises all of the bits in the bit set, the second sequence further comprises one or more of: part or all of the bits in the xth data retransmission corresponding incremental bit sequence; or part or all of the bits in the x-1th data retransmission corresponding encoding bit sequence. The method according to any one of claims 1 to 3, characterized in that The length of the encoding bit sequence corresponding to the x-1th data retransmission is M x-1 , the M x-1 is the m x the m x-1 same; or The m x For the m x-1 The sum of 1. The method according to any one of claims 1 to 4, characterized in that The length of the encoding bit sequence corresponding to the first data retransmission is M1, and M1 is The length of the encoded bit sequence corresponding to the 2nd data retransmission is M2, and M2 is The length of the encoding bit sequence corresponding to the 3rd data retransmission is M3, and M3 is the m1 is the sum of the m0 and 1; the m2 is the sum of the m1 and 1; the m3 is the m2, or the m3 is the sum of the m2 and 1. The method according to any one of claims 1 to 5, characterized in that In the m x For m x-1 The sum of 1, the bits in the xth data retransmission corresponding encoding bit sequence, except the x-1th data retransmission corresponding encoding bit sequence, are the result of the x-1th data retransmission corresponding encoding bit sequence and the xth first encoding bit sequence being exclusive-ORed; wherein the xth first coded bit sequence is based on the m0 and r x , the r is the difference between 1 and the m0, and the r1 is the difference between 1 and the r0. x , the r is the difference between 1 and the m0, and the r1 is the difference between 1 and the r0. x-1 , the r is the difference between 1 and the m0, and the r1 is the difference between 1 and the r0. the method according to any one of claims 1-6, wherein, The to-be-encoded bit sequence corresponding to the xth data retransmission further includes a third sequence with a length of (K x -K x-1 ) wherein the K x-1 is the length of the to-be-encoded bit sequence corresponding to the x-1th data retransmission; the third sequence is associated with the information bit sequence; or the third sequence is predefined. The method according to claim 7, characterized in that the third sequence is associated with the information bit sequence, comprising: the bits in the third sequence are (K x -K x-1 ) bits of the information bit sequence; or The bits in the third sequence are (K x -K x-1 ) parity bits determined based on at least one bit in the information bit sequence. The method of claim 1, wherein the method further comprises: when the xth data retransmission, an output length E x of a second sequence; the E x is predefined, or the E x is associated with a transmission resource corresponding to an xth data retransmission the second sequence comprises one or more of the first C bits to the second C-1 bits in a fourth sequence of length M A x bits in a fourth sequence of length M​ In the formula, M represents a metal atom, and n represents an integer of 1 or more. A As The m A is the sum of the m0 and A, or the sum of the m A is the sum of the m0 and (A-1); the A is the maximum data retransmission times; the fourth sequence is obtained by performing RM encoding on a fifth sequence with a length of K A , the fourth sequence includes a coded bit sequence corresponding to the (A-1)th data retransmission, and the K A is associated with the m A and the r0; the fifth sequence includes a to-be-encoded bit sequence corresponding to the (A-1)th data retransmission. The C x is predefined; the D is C x+1 , or the D is (M A -1). The method of claim 9, wherein The C x are predefined, including: in the case where the A is 3, C0 is 0, C1 is K0, C2 is K1, and C3 is K2; or C0 is 0, C1 is K0, C2 is K1, and C3 is (K1+K2) / 2. The method of claim 1, wherein the method further comprises: when the xth data retransmission, an output length of E x second sequence; the E x is predefined, or the E x corresponding to the xth data retransmission The second sequence includes (E0+E1+…+EM-1) bits in the fourth sequence A The (E0+E1+…+EM-1) bits in the fourth sequence x-1 The (E0+E1+…+EM-1) bits in the fourth sequence x The E0 is predefined, or the E0 is associated with a transmission resource corresponding to initial transmission of data In the formula, M represents a metal atom, and n represents an integer of 1 or more. A is The m A is the sum of the m0 and A, or the sum of the m A is the sum of the m0 and (A-1); the A is the maximum data retransmission times; the fourth sequence is obtained by performing RM encoding on a fifth sequence with a length of K A , the fourth sequence includes a coded bit sequence corresponding to the (A-1)th data retransmission, and the K A is associated with the m A and the r0; and the fifth sequence includes a to-be-encoded bit sequence corresponding to the (A-1)th data retransmission. A communication method characterized by comprising: comprises: receive the first to-be-demodulated information, demodulate the first to-be-demodulated information, and obtain a sixth sequence (corresponding to the first sequence) with a length of M0; wherein the M0 is the m0 is a positive integer; receiving the xth second to-be-demodulated information, demodulating the xth second to-be-demodulated information, and obtaining the xth seventh sequence (corresponding to an incremental redundancy part and / or a sixth sequence); the x is a positive integer; According to m x and r0, the xth eighth sequence with length M x is Reed-Muller (RM) decoded to obtain a decoding result; wherein the r0 is an integer greater than or equal to 0; the eighth sequence is associated with the sixth sequence and the xth seventh sequence, the m x is an integer greater than or equal to the m0, and the M x is the method according to claim 12, wherein, The m x is the same as m x-1 or The m x For m x-1 The sum of 1. the method according to claim 12 or 13, wherein, m1 is the sum of the m0 and 1; m2 is the sum of the m1 and 1; m3 is the m2, or the m3 is the sum of the m2 and 2. A communication device characterized by comprising: The communication device comprises a module or unit for performing the communication method according to any one of claims 1-11; or the communication device comprises a module or unit for performing the communication method according to any one of claims 12-14. A communication device characterized by comprising: The communication device comprises at least one processor; the at least one processor is configured to cause the communication method according to any one of claims 1-11 to be performed, or the communication method according to any one of claims 12-14 to be performed, by means of a logic circuit and / or by running a computer program or instructions. A communication device characterized by comprising: The communication apparatus comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to execute the communication method according to any one of claims 1-11, or execute the communication method according to any one of claims 12-14, and process and / or generate the information according to the information. A computer-readable storage medium, characterized by, The computer readable storage medium stores computer instructions or programs, when the computer instructions or programs are run on a computer, the communication method according to any one of claims 1-11 is executed, or the communication method according to any one of claims 12-14 is executed. A computer program product, characterized by The computer program product comprises computer instructions; when part or all of the computer instructions are run on a computer, the communication method according to any one of claims 1-11 is executed, or the communication method according to any one of claims 12-14 is executed.