WO2023226705A1 - 一种信息传输方法和装置 - Google Patents

一种信息传输方法和装置 Download PDF

Info

Publication number
WO2023226705A1
WO2023226705A1 PCT/CN2023/091989 CN2023091989W WO2023226705A1 WO 2023226705 A1 WO2023226705 A1 WO 2023226705A1 CN 2023091989 W CN2023091989 W CN 2023091989W WO 2023226705 A1 WO2023226705 A1 WO 2023226705A1
Authority
WO
WIPO (PCT)
Prior art keywords
coded bit
bit sequence
coded
sequence
information
Prior art date
Application number
PCT/CN2023/091989
Other languages
English (en)
French (fr)
Other versions
WO2023226705A9 (zh
Inventor
刘可
王献斌
张华滋
童佳杰
李榕
王俊
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2023226705A1 publication Critical patent/WO2023226705A1/zh
Publication of WO2023226705A9 publication Critical patent/WO2023226705A9/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems

Definitions

  • the present application relates to the field of communication technology, and in particular, to an information transmission method and device.
  • the sending end can determine whether to send retransmission data to the receiving end based on the feedback information fed back by the receiving end. For example, after the receiving end receives the initial transmission data sent by the sending end, if the receiving end can correctly decode the initial transmission data, the receiving end will return an acknowledgment (ACK) to the sending end. If the receiving end cannot correctly decode the initial transmission data, the receiving end will After decoding the initially transmitted data, a non-acknowledgement (NACK) is returned to the sending end. When the receiving end receives a NACK, it will send retransmitted data to the receiving end. After receiving the retransmitted data, the receiving end combines the retransmitted data with the initial transmitted data and re-decodes it.
  • ACK acknowledgment
  • NACK non-acknowledgement
  • the feedback information fed back by the receiving end (ie, ACK or NACK) is 1 bit.
  • the feedback information is only a 1-bit NACK. Therefore, the sender fails to perform targeted design based on the decoding error when retransmitting. It can give full play to the error correction and detection capabilities of the receiving end.
  • Embodiments of the present application provide an information transmission method and device. By introducing more feedback information at the receiving end, the sending end can perform targeted retransmissions based on more feedback information, thereby improving the decoding and error correction performance of the receiving end. .
  • an information transmission method including: a sending end transmitting a first coded bit sequence according to a coded bit sequence to be transmitted, where the coded bit sequence to be transmitted includes the first coded bit sequence; and the sending end receiving a first indication.
  • Information includes the position information of at least one coded bit that has been sent in the coded bit sequence to be transmitted in the coded bit sequence to be transmitted; the sending end sends the second coded bit sequence according to the first indication information.
  • the coded bit sequence to be transmitted includes a second coded bit sequence
  • the second coded bit sequence includes: at least one coded bit that has been sent in the coded bit sequence to be transmitted, and/or, the coded bit sequence to be transmitted At least one coded bit in the coded bit sequence that has not been sent.
  • the sending end can send the second coded bit sequence according to the first indication information fed back by the receiving end, because the first indication information includes the coded bit sequence to be transmitted that has been sent position information of at least one coded bit in the coded bit sequence to be transmitted, so the coded bits in the second coded bit sequence sent by the sending end are more targeted.
  • the second coded bit sequence may include other coded bits that have not been In addition to the at least one coded bit that has been sent, it may also include at least one coded bit that has been sent. This can make the decoding and error correction process at the receiving end more targeted.
  • the embodiments of the present application can give full play to the error correction and error detection capabilities of the receiving end and effectively improve the decoding and error correction performance of the receiving end.
  • the sending end retransmits the coded bit sequence at least once according to the coded bit sequence to be transmitted; where the first coded bit sequence is the coded bit sequence initially transmitted, and the second coded bit sequence is the coded bit sequence retransmitted for the first time.
  • the first coded bit sequence may be the coded bit sequence sent during the initial transmission, or the coded bit sequence sent during the retransmission
  • the second coded bit sequence is the coded bit sequence sent by the sending end after sending the first coded bit sequence.
  • the coded bit sequence is sent next after the bit sequence, that is, the sending end does not send other coded bit sequences between the first coded bit sequence and the second coded bit sequence.
  • the process in which the sender sends the coded bit sequence to the receiving end according to the coded bit sequence to be transmitted for the first time can be called the initial transmission process.
  • the process of sending the coded bit sequence to the receiving end according to the coded bit sequence to be transmitted is The process of sending a coded bit sequence may be called a retransmission process, where the number of retransmissions may be one or multiple times.
  • Each retransmission of the coded bit sequence may be a complete retransmission of the coded bit sequence, or a part of the coded bit sequence, which is not limited by this application.
  • the position information is an index value of the position of at least one coded bit that has been sent in the coded bit sequence to be transmitted.
  • the receiving end directly indicates to the sending end the position of at least one coded bit that needs to be repeatedly transmitted by the sending end in the coded bit sequence to be transmitted, which can reduce the time required for the sending end to generate the first indication information and the receiving end to parse the first indication information. complexity.
  • the location information is indication information of at least one resource subsection corresponding to at least one coded bit that has been sent, where at least one resource subsection is located in a resource section corresponding to the coded bit sequence to be transmitted.
  • the position of at least one coded bit that has been sent in the coded bit sequence to be transmitted is indirectly indicated through the indication information of at least one resource subsection corresponding to at least one coded bit that has been sent, which can reduce The data amount of the first indication information (for example, when one resource subsection corresponds to multiple encoding bits).
  • the receiving end can also feed back to the receiving end the position of at least one coded bit that has been sent in the coded bit sequence to be transmitted in other forms.
  • the proportion of coded bits that have been sent in the second coded bit sequence does not exceed the preset value ⁇ .
  • the coded bits sent for the first time in the second coded bit sequence that is, the coded bits other than the coded bits that have been sent
  • the coded bits that are not sent for the first time that is, the coded bits that have been sent
  • Reasonable proportion allocation can avoid the problem of poor decoding error correction performance caused by too small proportion of coded bits that have been sent, and avoid the problem that too much coded bits have been sent, resulting in occupying more transmission resources. question.
  • the number of at least one coded bit that has been sent in the second coded bit sequence satisfies the following conditions:
  • n′′ k is the number of at least one coded bit that has been sent in the coded bit sequence to be transmitted included in the second coded bit sequence; N k-1 indicates that the sending end sends the coded bit sequence before sending the second coded bit sequence.
  • the number of coded bits, N′′ k-1 represents the number of coded bits that the sending end repeatedly sends before sending the second coded bit sequence;
  • n k is the number of coded bits included in the second coded bit sequence;
  • ⁇ ′ is the number of coded bits sent by the sender.
  • the proportion of coded bits does not exceed ⁇ ′.
  • ⁇ ′ is greater than or equal to the preset threshold value. In this way, it can be ensured that the coded bits sent for the first time and the coded bits not sent for the first time in the multiple transmission processes of the coded bits to be transmitted have a reasonable proportion distribution.
  • an information transmission method including: the receiving end receives a first sequence to be decoded, wherein the first sequence to be decoded is a first encoded bit sequence sent by the transmitting end according to the encoded bit sequence to be transmitted, transmitted via a channel the sequence formed after The position information of the coded bits in the coded bit sequence to be transmitted; the receiving end sends the first indication information; the receiving end receives the second sequence to be decoded, where the second sequence to be decoded is the third sequence sent by the sending end according to the first indication information.
  • a sequence formed after two coded bit sequences are transmitted through a channel.
  • the first coded bit sequence is the coded bit sequence initially transmitted by the sending end
  • the second coded bit sequence is the coded bit sequence retransmitted by the sending end for the first time
  • the first coded bit sequence is the coded bit sequence initially transmitted by the sending end.
  • the coded bit sequence for the q-1th retransmission, the second coded bit sequence is the coded bit sequence for the qth retransmission by the sending end, and q is a positive integer greater than 1.
  • the position information is an index value of the position of at least one coded bit that has been sent in the coded bit sequence to be transmitted.
  • the receiving end can obtain a log-likelihood ratio LLR sequence corresponding to the first sequence to be decoded, and the LLR in the LLR sequence corresponds to the coded bits in the coded bit sequence to be transmitted.
  • the receiving end determines the first indication information, which may include: the receiving end determines the first n′′ k LLRs with smaller amplitudes from the LLR sequence, where n′′ k is a positive integer, and the n′′ k LLRs correspond to The n′′ k coded bits are at least one coded bit that has been sent in the coded bit sequence to be transmitted; the receiving end determines the position of the n′′ k coded bits corresponding to the n′′k LLRs in the coded bit sequence to be transmitted. Determine the first instruction information.
  • the receiving end selects coded bits with smaller LLR amplitude and feeds back the position information of these coded bits to the sender, so that the sender can retransmit these coded bits with small LLR amplitude, and then the receiver can subsequently
  • the decoding result is reacquired based on the coded bits retransmitted by the sending end, which improves the decoding and error correction performance of the receiving end.
  • the location information is information about at least one resource subsection corresponding to at least one coded bit that has been sent, where at least one resource subsection is located in a resource section corresponding to a coded bit sequence to be transmitted.
  • the receiving end may obtain a channel estimation result corresponding to the first sequence to be decoded, and the channel estimation value in the channel estimation result corresponds to the coded bits in the coded bit sequence to be transmitted.
  • the receiving end determines the first indication information, which may include: the receiving end determines the channel estimation mean value corresponding to each resource subsection in the resource segment corresponding to the coded bit sequence to be transmitted based on the channel estimation result; the receiving end determines the channel estimation mean value from the coded bit sequence to be transmitted.
  • M resource sub-segments with smaller average channel estimation values are determined; M is a positive integer; the receiving end determines the first indication information based on the M resource sub-segments.
  • the receiving end selects resource sub-segments with smaller channel estimation averages and feeds back the location information of these resource sub-segments to the sending end, so that the sending end can resend the coded bits corresponding to these resource sub-segments, and then the receiving end can subsequently
  • the decoding result can be reacquired based on the coded bits retransmitted by the sending end, which improves the decoding and error correction performance of the receiving end.
  • the proportion of coded bits that have been sent in the second coded bit sequence does not exceed the preset value ⁇ .
  • the number of at least one coded bit that has been sent in the second coded bit sequence satisfies the following conditions:
  • n′′ k is the number of at least one coded bit that has been sent in the coded bit sequence to be transmitted included in the second coded bit sequence; N k-1 represents the number of coded bits sent by the sending end before sending the second coded bit sequence.
  • the number of coded bits, N′′ k-1 represents the number of coded bits that the sending end repeatedly sends before sending the second coded bit sequence; n k is the number of coded bits included in the second coded bit sequence; ⁇ ′ is the sending end According to the threshold value corresponding to the proportion of repeatedly transmitted coded bits among all coded bit sequences sent by the coded bit sequence to be transmitted, the transmitting end shall determine the proportion of repeatedly sent coded bits among all coded bit sequences sent according to the coded bit sequence to be transmitted. The proportion does not exceed ⁇ ′.
  • ⁇ ′ is greater than or equal to the preset threshold value. In this way, the decoding error correction performance of the receiving end can be further improved.
  • an information transmission method including: the sending end sends a third coded bit sequence;
  • the sending end receives the first decoding result; the sending end determines the coded bits with decoding errors from the third coded bit sequence based on the first decoding result and the information bits in the third coded bit sequence; the sending end determines the coded bits with decoding errors based on the decoding error.
  • the coded bits determine at least one coded bit in the third coded bit sequence; the sending end sends second indication information, and the second indication information includes position information of at least one coded bit.
  • the sending end after sending the third coded bit sequence, can determine the coded bits with decoding errors based on the first decoding result fed back by the receiving end, and then send the second indication information based on the coded bits with decoding errors, This allows the receiving end to perform decoding error correction according to the second indication information, which can effectively improve the decoding error correction performance of the receiving end.
  • the sending end uses the coded bits with decoding errors as at least one coded bit; or, when the number of coded bits with decoding errors is greater than T
  • the transmitting end selects T coded bits from the coded bits with decoding errors, and uses the T coded bits as at least one coded bit.
  • the solution can be processed according to the solution when the number of coded bits with decoding errors is less than T (that is, the coded bits with decoding errors are regarded as at least one coded bit), certainly It can also be processed according to the solution when the number of coded bits with decoding errors is greater than T, which is not limited by this application.
  • the transmitter uses the coded bits with decoding errors as at least one coded bit; or, when the number of coded bits with decoding errors is greater than or equal to T, the transmitter starts from Select T coded bits from the coded bits with decoding errors, and use the T coded bits as at least one coded bit.
  • T is the preset threshold value.
  • the sending end when there are fewer coded bits with decoding errors, the sending end can directly indicate the location of these coded bits with decoding errors, so that the receiving end can directly correct these errors; when there are more coded bits with decoding errors, the sending end will indicate The position of the partially decoded coded bits with errors enables the receiving end to perform decoding error correction based on the locations of the partially decoded coded bits with errors.
  • the second indication information also includes an indication bit; when the number of coded bits with decoding errors is less than T, the value of the indicator bit is the first value; when the number of coded bits with decoding errors is greater than or equal to T, the value of the indication bit is the second value; wherein the first value and the second value are different. For example: the first value is 0 and the second value is 1, or the first value is 1 and the second value is 0.
  • the receiving end can make it clear whether the position information carried in the second indication information is the position information of all erroneous coded bits or the position information of part of the erroneous coded bits, and then adopt different decoding error correction schemes for different situations, thereby improving Solution reliability.
  • T is chosen such that The maximum value established, where N is the information bit length of the second indication information, and k is the number of information bits in the first coded bit sequence.
  • the second indication information can indicate the position information of T coded bits, which improves the reliability of the solution.
  • an information transmission method including: the receiving end receives a third sequence to be decoded, and the third sequence to be decoded is a sequence formed after the third coded bit sequence sent by the transmitting end is transmitted through a channel; the receiving end The third sequence to be decoded is decoded to obtain the first decoding result; if the decoding fails, the receiving end sends the first decoding result; the receiving end receives the second indication information, and the second indication information includes the third coded bit sequence. the position information of at least one coded bit in; the receiving end obtains the second decoding result according to the second indication information and the first decoding result.
  • the second indication information also includes an indication bit; the receiving end obtains the second decoding result according to the second indication information and the first decoding result, including: when the indication bit is the first value, the receiving end The end determines the erroneous coded bits in the first decoding result based on the position information of at least one coded bit in the third coded bit sequence, corrects the erroneous coded bits, and obtains the second decoding result; or, when the indicator bit is the second value When 2. Decoding results.
  • an information transmission method including: the sending end uses an LDPC matrix to encode the information encoding bits to be transmitted to obtain a sequence of encoded bits to be transmitted, and the sequence of encoded bits to be transmitted includes one or more first variable nodes.
  • the corresponding coded bits and the coded bits corresponding to one or more second variable nodes, the column weight corresponding to the second variable node is 1; the sending end sends the coded bits corresponding to one or more first variable nodes; the sending end receives the third Indication information, the third indication information is used to indicate at least one second variable node among the one or more second variable nodes (or the third indication information is used to indicate at least one second variable among the one or more second variable nodes).
  • the transmitting end allocates transmission power to the coded bits corresponding to one or more second variable nodes according to the third indication information; the transmitting end sends the coded bits corresponding to one or more second variable nodes according to the allocated transmit power.
  • the sending end after sending the coded bits corresponding to one or more first variable nodes, allocates and sends the coded bits corresponding to one or more second variable nodes to be sent according to the third indication information received from the receiving end.
  • Power for example, the coded bits corresponding to the second variable node with high reliability are sent at low power, and the coded bits corresponding to the second variable node with low reliability are sent at high power
  • the coding bits corresponding to the nodes can better meet the decoding needs of the receiving end, thereby improving the decoding and error correction performance of the receiving end.
  • the third indication information includes: first information, the first information is used to indicate a second variable node among one or more second variable nodes that needs to increase the transmission power (or the first information is used to indicate The position of at least one second variable node among the one or more second variable nodes); and/or, second information, the second information is used to indicate that the second variable node among the one or more second variable nodes needs to reduce the transmission power.
  • the variable node or the second information is used to indicate the location of the second variable node among one or more second variable nodes that needs to reduce the transmission power).
  • the transmitting end can clarify which coded bits corresponding to the second variable node need to increase the transmission power and which coded bits corresponding to the second variable node need to reduce the transmission power according to the third indication information (for example, the third indication information only includes the information, then increase the transmission power of the coded bits corresponding to the second variable node indicated by the first information, and reduce the transmission power of the coded bits corresponding to other second variable nodes; for example, the third indication information only includes the second information, then Reduce the transmission power of the coded bits corresponding to the second variable node indicated by the second information, and increase the transmission power of the coded bits corresponding to other second variable nodes; for example, if the third indication information includes the first information and the second information, then increase The transmission power of the coded bits corresponding to the second variable node indicated by the first information, and the transmission power of the coded bits corresponding to the second variable node indicated by the second information is reduced) to meet the decoding requirements of the receiving end.
  • the third indication information only includes the information, then increase the transmission
  • the a priori information or posterior information corresponding to the first variable node associated with the second variable node that needs to increase the transmission power is within the first threshold range; the third variable node associated with the second variable node that needs to reduce the transmission power is within the first threshold range.
  • the a priori information or posterior information corresponding to a variable node is within the second threshold range; wherein the first threshold range is different from the second threshold range.
  • the second variable node that needs to adjust the transmission power can be determined based on the value range of the a priori information or the a posteriori information corresponding to the first variable node associated with each second variable node.
  • the a priori information includes LLR or channel estimation values; and/or the a posteriori information includes soft values.
  • an information transmission method including: the receiving end receives a fourth sequence to be decoded, where the fourth sequence to be decoded is a sequence formed after encoding bits corresponding to one or more first variable nodes are transmitted through a channel, The coded bits corresponding to one or more first variable nodes are included in the coded bit sequence generated based on the LDPC matrix.
  • the coded bit sequence generated based on the LDPC matrix also includes coded bits corresponding to one or more second variable nodes.
  • the second The column weight corresponding to the variable node is 1; the receiving end uses the LDPC matrix to decode the fourth sequence to be decoded; if the decoding fails, the receiving end determines at least one second variable node from one or more second variable nodes (Or the receiving end determines the position of at least one second variable node from the positions of one or more second variable nodes); the receiving end sends third indication information, where the third indication information is used to indicate at least one second variable node (Or the third indication information is used to indicate the position of at least one second variable node).
  • the third indication information includes: first information, the first information is used to indicate a second variable node among one or more second variable nodes that needs to increase the transmission power (or the first information is used to indicate The position of the second variable node that needs to increase the transmission power among the one or more second variable nodes); and/or, second information, the second information is used to indicate the position of the one or more second variable nodes that needs to reduce the transmission power.
  • the second variable node (or the second information is used to indicate the location of the second variable node among one or more second variable nodes that needs to reduce the transmission power).
  • the a priori information or posterior information corresponding to the first variable node associated with the second variable node that needs to increase the transmission power is within the first threshold range; the third variable node associated with the second variable node that needs to reduce the transmission power is within the first threshold range.
  • the a priori information or posterior information corresponding to a variable node is within the second threshold range; wherein the first threshold range is different from the second threshold range.
  • the a priori information includes LLR or channel estimation values; and/or the a posteriori information includes soft values.
  • a communication device including a module for performing the method described in the first aspect or any possible design of the first aspect.
  • Exemplary devices include:
  • a processing module used to generate a coded bit sequence to be transmitted
  • a transceiver module configured to send a first coded bit sequence according to a coded bit sequence to be transmitted, where the coded bit sequence to be transmitted includes the first coded bit sequence; and to receive first indication information; the first indication information includes the coded bit sequence to be transmitted.
  • the position information of at least one coded bit that has been sent in the coded bit sequence to be transmitted; the second coded bit sequence is sent according to the first indication information; wherein the coded bit sequence to be transmitted includes the second coded bit sequence, and the
  • the two coded bit sequences include: at least one coded bit that has been sent in the coded bit sequence to be transmitted, and/or at least one coded bit that has not been sent in the coded bit sequence that is to be transmitted.
  • the transceiver module is also configured to retransmit the encoded bit sequence at least once according to the encoded bit sequence to be transmitted; wherein the first encoded bit sequence is the initially transmitted encoded bit sequence, and the second encoded bit sequence is the first retransmission.
  • the position information is an index value of the position of at least one coded bit that has been sent in the coded bit sequence to be transmitted.
  • the location information is indication information of at least one resource subsection corresponding to at least one coded bit that has been sent, where at least one resource subsection is located in the resource section corresponding to the coded bit sequence to be transmitted.
  • the proportion of coded bits that have been sent in the second coded bit sequence does not exceed the preset value ⁇ .
  • the number of at least one coded bit that has been sent in the second coded bit sequence satisfies the following conditions:
  • n′′ k is the number of at least one coded bit that has been sent in the coded bit sequence to be transmitted included in the second coded bit sequence
  • N k-1 represents the number of coded bits sent by the device before sending the second coded bit sequence.
  • the number of coded bits, N′′ k-1 represents the number of coded bits that the device repeatedly sends before sending the second coded bit sequence
  • n k is the number of coded bits included in the second coded bit sequence
  • ⁇ ′ is the device According to the threshold value corresponding to the proportion of repeatedly transmitted coded bits in all coded bit sequences sent by the coded bit sequence to be transmitted, the device is based on the proportion of repeatedly sent coded bits in all coded bit sequences sent by the coded bit sequence to be transmitted. The proportion does not exceed ⁇ ′.
  • ⁇ ′ is greater than or equal to the preset threshold value.
  • a communication device including a module for performing the method described in the second aspect or any possible design of the second aspect.
  • Exemplary devices include:
  • a transceiver module configured to receive a first sequence to be decoded, where the first sequence to be decoded is a sequence formed after the first coded bit sequence sent by the sending end according to the coded bit sequence to be transmitted is transmitted through the channel;
  • the processing module is also used to determine the first indication information; the first indication information includes the position information of at least one coded bit that has been sent in the coded bit sequence to be transmitted in the coded bit sequence to be transmitted;
  • the transceiver module is also configured to send first indication information; and receive a second sequence to be decoded, where the second sequence to be decoded is a sequence formed by transmitting a second coded bit sequence sent by the sending end according to the first indication information through channel transmission.
  • the first coded bit sequence is the coded bit sequence initially transmitted by the sender, and the second coded bit sequence is the coded bit sequence retransmitted by the sender for the first time; or, the first coded bit sequence is the q-th coded bit sequence by the sender.
  • the coded bit sequence of the first retransmission, the second coded bit sequence is the coded bit sequence of the qth retransmission by the sender, and q is a positive integer greater than 1.
  • the position information is an index value of the position of at least one coded bit that has been sent in the coded bit sequence to be transmitted.
  • the processing module is also configured to: obtain a log-likelihood ratio LLR sequence corresponding to the first sequence to be decoded, where the LLR in the LLR sequence corresponds to the coded bits in the coded bit sequence to be transmitted.
  • the processing module is specifically used to: determine the first n′′ k LLRs with smaller amplitudes from the LLR sequence, where n′′ k is a positive integer, and the n′′ corresponding to the n′′ k LLRs
  • the k coded bits are at least one coded bit that has been sent in the coded bit sequence to be transmitted; the first indication is determined based on the position of the n′′ k coded bits corresponding to the n′′k LLRs in the coded bit sequence to be transmitted. information.
  • the location information is information about at least one resource subsection corresponding to at least one coded bit that has been sent, where at least one resource subsection is located in the resource section corresponding to the coded bit sequence to be transmitted.
  • the processing module is also configured to obtain a channel estimation result corresponding to the first sequence to be decoded, where the channel estimation value in the channel estimation result corresponds to the coded bits in the coded bit sequence to be transmitted.
  • the processing module is specifically configured to: determine the channel estimation mean value corresponding to each resource sub-segment in the resource segment corresponding to the coded bit sequence to be transmitted based on the channel estimation result; M resource sub-segments with smaller average channel estimation values are determined in the segments; M is a positive integer; the first indication information is determined based on the M resource sub-segments.
  • the proportion of coded bits that have been sent in the second coded bit sequence does not exceed the preset value ⁇ .
  • the number of at least one coded bit that has been sent in the second coded bit sequence satisfies the following conditions:
  • n′′ k is the number of at least one coded bit that has been sent in the coded bit sequence to be transmitted included in the second coded bit sequence; N k-1 represents the number of coded bits sent by the sending end before sending the second coded bit sequence.
  • the number of coded bits, N′′ k-1 represents the number of coded bits that the sending end repeatedly sends before sending the second coded bit sequence; n k is the number of coded bits included in the second coded bit sequence; ⁇ ′ is the sending end According to the threshold value corresponding to the proportion of repeatedly transmitted coded bits among all coded bit sequences sent to the device according to the coded bit sequence to be transmitted, the transmitting end sends among all coded bit sequences to the device according to the coded bit sequence to be transmitted. The proportion of coded bits sent repeatedly does not exceed ⁇ ′.
  • ⁇ ′ is greater than or equal to the preset threshold value.
  • a communication device including a module for performing the method described in the third aspect or any possible design of the third aspect.
  • Exemplary devices include:
  • a transceiver module configured to send the third coded bit sequence; receive the first decoding result;
  • a processing module configured to determine the coded bits with decoding errors from the third coded bit sequence based on the first decoding result and the information bits in the third coded bit sequence; determine the third coded bits based on the coded bits with decoding errors. at least one coded bit in the sequence;
  • the transceiver module is also configured to send second indication information, where the second indication information includes position information of at least one coded bit.
  • the processing module is configured to: when the number of coded bits with decoding errors is less than T, use the coded bits with decoding errors as at least one coded bit; or, when the number of coded bits with decoding errors is greater than or equal to T
  • T is the preset threshold value.
  • the second indication information also includes an indication bit; when the number of coded bits with decoding errors is less than T, the value of the indicator bit is the first value; when the number of coded bits with decoding errors is greater than or equal to T When , the value of the indication bit is the second value; wherein the first value and the second value are different.
  • T is chosen such that The maximum value established, where N is the information bit length of the second indication information, and k is the number of information bits in the first coded bit sequence.
  • a communication device including a module for performing the method described in the fourth aspect or any possible design of the fourth aspect.
  • Exemplary devices include:
  • a transceiver module configured to receive a third sequence to be decoded, where the third sequence to be decoded is a sequence formed after the third coded bit sequence sent by the sending end is transmitted through the channel;
  • a processing module used to decode the third sequence to be decoded and obtain the first decoding result
  • the transceiver module is also configured to send the first decoding result; receive the second indication information, the second indication information includes the position information of at least one coded bit in the third coded bit sequence;
  • the processing module is also configured to obtain the second decoding result according to the second indication information and the first decoding result.
  • the second indication information also includes an indication bit
  • the processing module obtains the second decoding result according to the second indication information and the first decoding result, it is specifically configured to: when the indication bit is the first value, according to the position information of at least one coded bit in the third coded bit sequence. Determine the erroneous coded bits in the first decoding result, correct the erroneous coded bits, and obtain the second decoding result; or, when the indicator bit is the second value, based on the position of at least one coded bit in the third coded bit sequence The information corrects the a priori information corresponding to the first decoding result, and re-decodes the third coded bit sequence according to the corrected a priori information to obtain the second decoding result.
  • a communication device including a module for performing the method described in the fifth aspect or any possible design of the fifth aspect.
  • Exemplary devices include:
  • a processing module configured to use a low-density parity check code LDPC matrix to encode the information encoding bits to be transmitted to obtain a sequence of encoded bits to be transmitted.
  • the sequence of encoded bits to be transmitted includes encoding bits corresponding to one or more first variable nodes.
  • the encoding bit corresponding to one or more second variable nodes, the column weight corresponding to the second variable node is 1;
  • a transceiver module configured to send coded bits corresponding to one or more first variable nodes; receive third indication information, the third indication information being used to indicate at least one second variable node among the one or more second variable nodes;
  • the processing module is also configured to allocate transmission power to the coded bits corresponding to one or more second variable nodes according to the third indication information;
  • the transceiver module is also used to transmit the coded bits corresponding to one or more second variable nodes according to the allocated transmission power.
  • the third indication information includes: first information, the first information is used to indicate a second variable node among one or more second variable nodes that needs to increase the transmission power; and/or second information, the second The information is used to indicate the second variable node among the one or more second variable nodes that needs to reduce the transmission power.
  • the a priori information or posterior information corresponding to the first variable node associated with the second variable node that needs to increase the transmission power is within the first threshold range; the first variable node associated with the second variable node that needs to reduce the transmission power
  • the corresponding a priori information or posterior information is within the second threshold range; wherein the first threshold range is different from the second threshold range.
  • the a priori information includes LLR or channel estimation values; and/or the a posteriori information includes soft values.
  • a communication device including a module for performing the method described in the sixth aspect or any possible design of the sixth aspect.
  • Exemplary devices include:
  • the transceiver module is configured to receive a fourth sequence to be decoded.
  • the fourth sequence to be decoded is a sequence formed after encoding bits corresponding to one or more first variable nodes are transmitted through the channel.
  • the coded bits are included in the coded bit sequence generated based on the LDPC matrix.
  • the coded bit sequence generated based on the LDPC matrix also includes coded bits corresponding to one or more second variable nodes, and the column weight corresponding to the second variable node is 1;
  • the processing module is also used to determine at least one second variable node from one or more second variable nodes;
  • the transceiver module is also configured to send third indication information, where the third indication information is used to indicate at least one second variable node.
  • the third indication information includes: first information, the first information is used to indicate a second variable node among one or more second variable nodes that needs to increase the transmission power; and/or second information, the second The information is used to indicate the second variable node among the one or more second variable nodes that needs to reduce the transmission power.
  • the a priori information or posterior information corresponding to the first variable node associated with the second variable node that needs to increase the transmission power is within the first threshold range; the first variable node associated with the second variable node that needs to reduce the transmission power
  • the corresponding a priori information or posterior information is within the second threshold range; wherein the first threshold range is different from the second threshold range.
  • the a priori information includes LLR or channel estimation values; and/or the a posteriori information includes soft values.
  • a communication device including: at least one processor; and a communication interface communicatively connected to the at least one processor; at least one processor executes instructions stored in a memory, causing the device to execute the first step through the communication interface aspect or any possible design of the first aspect or the second aspect or any possible design of the second aspect or the third aspect or any possible design of the third aspect or the fourth aspect or any one of the fourth aspect possible designs or the fifth aspect or any possible design of the fifth aspect or the sixth aspect or the method described in any possible design of the sixth aspect.
  • the device further includes a memory connected to at least one processor, and the memory stores instructions that can be executed by at least one processor.
  • a fourteenth aspect provides a communication device, including: an input-output interface and a logic circuit; the input-output interface is used to output a coded bit sequence or input a sequence to be decoded, and the logic circuit is used to perform the steps of the first aspect or Any possible design of the first aspect or the second aspect or any possible design of the second aspect or the third aspect or any possible design of the third aspect or the fourth aspect or any possible design of the fourth aspect The method described in the design or the fifth aspect or any possible design of the fifth aspect or the sixth aspect or any possible design of the sixth aspect.
  • a fifteenth aspect a computer-readable storage medium is provided, including a program or instructions.
  • the program or instructions When the program or instructions are run on a computer, it enables any possible design as in the first aspect or the second aspect or the third aspect. Any possible design of the second aspect or the third aspect or any possible design of the third aspect or the fourth aspect or any possible design of the fourth aspect or the fifth aspect or any possible design of the fifth aspect Or the method described in the sixth aspect or any possible design of the sixth aspect is executed.
  • a sixteenth aspect provides a computer program product, which includes instructions that, when run on a computer, enable the first aspect or any of the possible designs of the first aspect or the second aspect or any of the possible designs of the second aspect.
  • the design or the third aspect or any possible design of the third aspect or the fourth aspect or any possible design of the fourth aspect or the fifth aspect or any possible design of the fifth aspect or the sixth aspect or the third aspect Six aspects of any of the possible designs described in the method were implemented.
  • Figure 1 is a schematic diagram of a communication system applicable to the embodiment of the present application.
  • Figure 2 is a schematic diagram of the communication process between the sender and the receiver
  • Figure 3 is a schematic diagram of Raptor-like LDPC code
  • Figure 4 is a schematic diagram of a possible IR-HARQ solution
  • Figure 5A is a schematic flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 5B, Figure 5C, and Figure 5D are decoding performance evaluation diagrams of the solution shown in Figure 5A;
  • Figure 6A is a schematic flow chart of another information transmission method provided by an embodiment of the present application.
  • Figures 6B and 6C are decoding performance evaluation diagrams of the solution shown in Figure 6A;
  • Figure 7A is a schematic flow chart of another information transmission method provided by an embodiment of the present application.
  • Figure 7B is a decoding performance evaluation diagram of the solution shown in Figure 7A;
  • Figure 8 is a schematic structural diagram of a communication device 800 provided by an embodiment of the present application.
  • Figure 9 is a schematic structural diagram of another communication device 900 provided by an embodiment of the present application.
  • FIG. 10 is a schematic structural diagram of another communication device 1000 provided by an embodiment of the present application.
  • system and “network” in the embodiments of this application may be used interchangeably.
  • “At least one” means one or more, and “plurality” means two or more.
  • “And/or” describes the relationship between associated objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A exists alone, A and B exist simultaneously, and B exists alone, where A, B can be singular or plural.
  • the character “/” generally indicates that the related objects are in an “or” relationship.
  • “At least one of the following” or similar expressions refers to any combination of these items, including any combination of single or plural items, such as at least one of a, b or c. (piece), can mean: a, or b, or c, or a and b, or b and c, or a and c, or a and b and c.
  • the ordinal numbers such as "first" and “second” mentioned in the embodiments of this application are used to distinguish multiple objects, and are not used to limit the order, timing, priority or priority of multiple objects. Importance.
  • the first priority criterion and the second priority criterion are only to distinguish different criteria, but do not indicate the difference in content, priority or importance of the two criteria.
  • Narrow Band-Internet of Things NB-IoT
  • GSM Global System for Mobile Communications
  • EDGE Enhanced Data rate GSM evolution system
  • WCDMA Wideband Code Division Multiple Access
  • CDMA2000 Code Division Multiple Access
  • TD-SCDMA Time Division-Synchronization Code Division Multiple Access
  • LTE Long Term Evolution
  • 5th generation, 5G fifth generation (including the three major applications of 5G communication system Scenario: Enhanced Mobile Broadband (eMBB), Ultra Reliable Low Latency Communication (URLLC) and Enhanced evolved Machine Type Communications (eMTC)), sixth generation (6th generation, 6G) communication system or other future evolution systems, or other various wireless communication systems, etc., as long as there is a HARQ requirement in the communication system, the technical solution of the embodiment of the present application can be adopted.
  • eMBB Enhanced Mobile Broadband
  • URLLC Ultra Reliable Low Latency Communication
  • eMTC Enhanced evolved Machine Type Communications
  • FIG. 1 is a schematic diagram of a communication system applicable to the embodiment of the present application.
  • the communication system includes a network device 101 and a terminal device 102.
  • the network device 101 can send data to the terminal device 102, and the terminal device 102 can send feedback information to the network device 101 after receiving the data;
  • the terminal device 102 can also send data to the network device 101, and the network device 101 can send data to the network device 101 after receiving the data.
  • the terminal device 102 sends feedback information.
  • the network device 101 When the network device 101 sends data to the terminal device 102, the network device 101 is the sending end (or sending device), and the terminal device 102 is the receiving end (or receiving device); when the terminal device 102 sends data to the network device 101, The terminal device 102 is the sending end (or sending device), and the network device 101 is the receiving end (or receiving device).
  • terminal equipment includes equipment that provides voice and/or data signal connectivity to users. Specifically, it includes equipment that provides voice to users, or includes equipment that provides data signal connectivity to users, or includes equipment that provides voice and/or data signal connectivity to users.
  • Data signal connectivity equipment This may include, for example, a handheld device with wireless connectivity, or a processing device connected to a wireless modem.
  • the terminal equipment may include user equipment (UE), wireless terminal equipment, mobile terminal equipment, device-to-device communication (D2D) terminal equipment, vehicle to everything (V2X) terminal equipment , machine-to-machine/machine-type communications (M2M/MTC) terminal equipment, Internet of things (IoT) terminal equipment, subscriber unit (subscriber unit), subscriber station (subscriber station, mobile station, remote station, access point (AP), remote terminal, access terminal, user terminal ), user agent (user agent), or user device (user device), satellite, drone, balloon or aircraft, etc.
  • this may include a mobile phone (or "cellular" phone), a computer with a mobile terminal device, a portable, pocket-sized, handheld, computer-built-in mobile device, etc.
  • PCS personal communication service
  • SIP session initiation protocol
  • WLL wireless local loop
  • PDA personal digital assistant
  • constrained devices such as devices with lower power consumption, or devices with limited storage capabilities, or devices with limited computing capabilities. Examples include barcodes, radio frequency identification (RFID), sensors, global positioning system (GPS), laser scanning Scanners and other information sensing equipment.
  • the terminal device may also be a wearable device. Wearable devices can also be called wearable smart devices or smart wearable devices, etc. It is a general term for applying wearable technology to intelligently design daily wear and develop wearable devices. If the various terminal devices introduced above are located on the vehicle (for example, placed or installed in the vehicle), they can be considered as vehicle-mounted terminal equipment.
  • the vehicle-mounted terminal equipment is also called an on-board unit (OBU), for example. ).
  • OBU on-board unit
  • Network equipment for example, includes access network (AN) equipment, such as base stations (for example, access points), which may refer to equipment in the access network that communicates with wireless terminal equipment through one or more cells over the air interface, or
  • AN access network
  • base stations for example, access points
  • RSU road side unit
  • the network equipment may include an evolutionary base station (NodeB or eNB or e-NodeB, evolutionary Node B) in a long term evolution (LTE) system or long term evolution-advanced (LTE-A), or It can include the next generation nodes in the evolved packet core network (evolved packet core, EPC), the fifth generation mobile communication technology (the 5th generation, 5G), and the new radio interface (new radio, NR) system (also referred to as the NR system) B (next generation node B, gNB) may also include the centralized unit (centralized unit, CU) and distributed unit (distributed unit, DU) in the cloud access network (cloud radio access network, Cloud RAN) system, satellite , drones, balloons or airplanes, etc., are not limited by the embodiments of this application.
  • LTE long term evolution
  • LTE-A long term evolution-advanced
  • EPC evolved packet core network
  • 5G fifth generation mobile communication technology
  • NR new radio interface
  • Figure 1 takes communication between a network device and a terminal device as an example.
  • the embodiments of the present application can also be applied to other scenarios such as communication between a network device and a network device, communication between a terminal device and a terminal device, and are not limited by this application.
  • FIG. 2 is a schematic diagram of the communication flow between the sending end and the receiving end.
  • the data bit stream generated by the source must go through the following steps to reach the sink:
  • the source is the source of the information, such as people, machines, natural objects, etc., and its output can be an analog signal or Digital signals;
  • source coding converts this analog signal or digital signal into a binary digital sequence (i.e., information bit sequence);
  • channel coding introduces some redundant binary information sequences into the binary digital sequence (to obtain a coded bit sequence) for
  • modulation processing is used to convert the binary sequence into a waveform signal and send it to the channel.
  • demodulation is to restore the waveform signal to a binary signal (i.e., the sequence to be decoded);
  • channel decoding is to restore the information bit sequence according to the channel coding rules and the redundancy of the received data;
  • source decoding It is to restore the original signal according to the rules of source encoding.
  • the actual communication process may also include other processing, such as interleaving (which can occur after channel coding and before modulation.
  • interleaving which can occur after channel coding and before modulation.
  • the function of interleaving is to change the structure of the bit stream to fully diversify these errors, so that long strings bit error becomes a short string error), deinterleaving (occurs after demodulation and before channel decoding.
  • Deinterleaving is an operation that is reciprocal with interleaving. Its function is to concentrate scattered data into the codewords encoded by the same channel, so as to Reduce the impact of burst errors on channel coding).
  • the channel coding scheme in the embodiment of the present application may be of various types, such as Low Density Parity Check Code (LDPC), Polar Code (Polar), etc., in the embodiment of the present application No restrictions.
  • LDPC Low Density Parity Check Code
  • Poly Polar Code
  • this article mainly takes the LDPC encoding scheme as an example.
  • the coded bit sequence obtained by LDPC coding includes a coded bit sequence and a check bit sequence.
  • a linear block code with a code length equal to N and an information bit sequence length equal to K can be uniquely determined by its check matrix.
  • the check matrix of the LDPC code can also be called the LDPC matrix.
  • Each column of the check matrix corresponds to a variable node, which corresponds to a bit in the encoded bit sequence; each row in the check matrix corresponds to a Check node.
  • the receiving end after receiving the data sent by the sending end, the receiving end only feeds back 1 bit of information (ACK/NACK) to indicate whether the receiving end has successfully decoded.
  • ACK/NACK 1 bit of information
  • the sender stops sending.
  • NACK 1 resend the previous data packet (i.e. simple retransmission (Chase Combining)); 2 send a new data packet, and the receiving end combines the previous data packet with the new one.
  • the data packet is equivalently constructed into a nested long code (this method is called Incremental Redundancy-HybridAutomatic Repeat reQuest, IR-HARQ). For LDPC codes, Polar codes, etc., The performance of the IR-HARQ scheme is better.
  • Raptor-like LDPC code uses the LDPC code with Raptor-like structure (referred to as Raptor-like LDPC code) as an example to illustrate the IR-HARQ solution.
  • the check matrix of the Raptor-like LDPC code includes five parts: A, B, C, O and I.
  • A is the matrix block corresponding to the information bit sequence in the highest code rate check matrix.
  • B is the matrix block corresponding to the check bit sequence in the highest code rate check matrix.
  • the matrix structure corresponding to B is usually a lower triangular structure or a combination of three columns and double diagonals.
  • C is the matrix block extended by the highest code rate check matrix, corresponding to the information bit sequence and the corresponding check bit sequence in the highest code rate check matrix.
  • O is a zero matrix
  • I is a matrix whose diagonal is 1 and the rest is 0.
  • O and I correspond to the check bit sequence.
  • the bit sequence obtained by encoding the information data using a Raptor-like LDPC code matrix is segmented into information bit sequences.
  • the parity bits whose column is greater than 1 Refers to the parity bit sequence corresponding to the column in the parity check matrix with a column significance greater than 1.
  • the retransmitted coded bits are the check bits in part I (the column weight of the retransmitted coded bits is 1).
  • the variable node corresponding to part I can be called a Raptor-like node, and the corresponding column weight is 1.
  • Figure 4 is a schematic diagram of a possible IR-HARQ solution.
  • variable nodes within the dotted box correspond to the coded bits in the initial transmission (referred to as the initial transmission part), and the variable nodes outside the dotted box correspond to the coded bits in the retransmission (referred to as the retransmission part).
  • the initial transmission part can be used as a separate code, and the initial transmission part and the retransmission part can be combined into a longer code.
  • the coded bits in the retransmission part correspond to Raptor-like nodes, that is, variable nodes with a column weight of 1, and are only associated with one check equation. When the initial decoding fails, the sender sends the encoded bits of these Raptor-like nodes.
  • the receiving end combines and decodes the sequences to be decoded received during the initial transmission and retransmission, using a larger check matrix and more check equations than in the initial transmission for error correction, achieving a long-term The error correction performance of the code.
  • the coded bits sent in the retransmission process are different from the coded bits sent in the initial transmission process (that is, all the coded bits sent in the retransmission process are sent for the first time, that is, they have not been sent. of).
  • the retransmission is not limited to one time, but can be multiple times (for example, different check bits in the I part can be sent multiple times).
  • the receiving end combines and decodes all received decoding sequences each time. , after decoding fails, continue the next retransmission process until the maximum number of retransmissions is reached or decoding is successful.
  • the feedback information is 1-bit design, that is, the receiving end only feeds back 1-bit NACK or ACK. Regardless of the decoding error at the receiving end, the sending end cannot base on the decoding error after receiving the NACK.
  • the retransmission is designed in a targeted manner, so the error correction and error detection capabilities of the receiving end cannot be fully utilized, resulting in poor decoding and error correction performance of the receiving end.
  • the technical solutions of the embodiments of the present application are provided so that when decoding fails, the receiving end can feed back more information, so that the sending end can retransmit in a targeted manner based on this information, thereby improving the decoding and error correction performance of the receiving end.
  • a schematic flow chart of an information transmission method provided by an embodiment of the present application includes:
  • the transmitting end sends the first encoded bit sequence according to the encoded bit sequence to be transmitted, where the encoded bit sequence to be transmitted includes the first encoded bit sequence; correspondingly, the receiving end receives the first sequence to be decoded.
  • the sending end encodes the information bits to be transmitted to generate a sequence of coded bits to be transmitted.
  • the encoding scheme used by the sending end includes but is not limited to LDPC, Polar and other types.
  • this embodiment takes the Raptor-like LDPC encoding scheme as an example. That is, after the transmitter obtains the information bit sequence to be transmitted, it generates the encoded bit sequence to be transmitted based on the Raptor-like LDPC matrix.
  • the process in which the sending end sends the coded bit sequence for the first time according to the coded bit sequence to be transmitted is the initial transmission process. If the initial transmission fails, the sending end sends the coded bit sequence again, and the sending end sends the coded bit sequence after the initial transmission.
  • the process of encoding the bit sequence is the retransmission process. The number of retransmissions may be one or multiple times, and is not limited by this application.
  • the first coded bit sequence may be a coded bit sequence sent during the initial transmission, or may be a coded bit sequence sent during the retransmission, which is not limited by this application.
  • the first coded bit sequence may be the coded bit sequence initially transmitted by the sending end, or the coded bit sequence for the q-1th retransmission, and q is greater than 1 and less than Or a positive integer equal to t.
  • the sender performs at most t retransmissions, plus the initial transmission, the sender sends a coded bit sequence at most t+1 times, where the first coded bit sequence can be the k-1th time sent by the sender.
  • the coded bit sequence, k is a positive integer greater than 1 and less than or equal to t+1.
  • the receiving end can receive the sequence to be decoded multiple times. Specifically, the receiving end receives a sequence to be decoded for each encoded bit sequence sent by the transmitting end.
  • the first sequence to be decoded corresponds to the first sequence of coded bits, that is, the first sequence to be decoded is a sequence formed after the first coded bit sequence sent by the transmitting end according to the coded bit sequence to be transmitted is transmitted through the channel.
  • the transmitting end can also perform modulation and other processing on the first coded bit sequence.
  • the first coded bit sequence is converted into a waveform signal, it is transmitted to the channel (or carrier). Make the transfer.
  • the waveform signal will be deformed to a certain extent due to path loss, noise interference, etc., so the waveform signal received by the receiving end may be different from the waveform signal sent by the transmitting end.
  • the receiving end after receiving the waveform signal, the receiving end performs demodulation and other processing on it to obtain the first sequence to be decoded corresponding to the first coded bit sequence.
  • this article describes the above process as the sending end sending the first encoded bit sequence and the receiving end receiving the first sequence to be decoded.
  • the receiving end decodes the first sequence to be decoded; if the decoding fails, the receiving end determines the first indication information.
  • the receiving end uses a decoding scheme corresponding to the coding scheme of the sending end to decode the first sequence to be decoded, for example, using a Raptor-like LDPC matrix to iteratively decode the first sequence to be decoded.
  • the receiving end can directly The sequence to be decoded is decoded. If the first sequence to be decoded is the sequence to be decoded received during the retransmission process (that is, the first coded bit sequence is the coded bit sequence sent during the retransmission process), the receiving end can The first sequence to be decoded received this time and other sequences to be decoded previously received are combined and decoded.
  • cH T 0 (where c represents the decoded codeword and H represents the Raptor-like LDPC matrix), then the decoding is stopped.
  • the receiving end can also send an ACK to indicate successful decoding.
  • the receiving end determines the first indication information.
  • cH T ⁇ 0 is only an example. In fact, there may be other reasons leading to decoding failure, which is not limited by this application.
  • the first indication information may include position information of at least one coded bit that has been sent in the coded bit sequence to be transmitted in the coded bit sequence to be transmitted.
  • the coded bits indicated in the first indication information ie, at least one coded bit in the coded bit sequence that has been sent
  • the position information of at least one coded bit that has been sent in the coded bit sequence to be transmitted may be an index of the position of the at least one coded bit that has been sent in the coded bit sequence to be transmitted. value (or the position index of at least one coded bit in the coded bit sequence to be transmitted).
  • the resource segment corresponding to the coded bit sequence to be transmitted can be segmented, for example, into multiple resource sub-segments. Each resource sub-segment includes one or more continuous resource units that have been sent.
  • the position information of at least one coded bit in the coded bit sequence to be transmitted can be the indication information of at least one resource subsection corresponding to the at least one coded bit that has been sent. In this way, the amount of feedback from the receiving end can be reduced and resource overhead can be saved. .
  • the resource segment can be a continuous period of time.
  • the resource unit is a time slot
  • the resource sub-segment can be several consecutive time slots
  • the resource segment is a longer period of time than the resource sub-segment (such as one or more consecutive frames).
  • the resource segment can be a continuous sub-carrier.
  • the resource sub-segment can be several consecutive sub-carriers, and the resource segment is a continuous sub-carrier that is longer than the resource sub-segment.
  • Carrier (such as one or more consecutive carriers).
  • the resource segment can also be a continuous sub-channel similar to an LDPC code or a Polar code.
  • the resource unit is a sub-channel, then the resource sub-segment can be several consecutive sub-channels, and the resource segment is larger than Resource sub-segment is a longer continuous sub-channel (such as one or more continuous channels).
  • the receiving end can select at least one coded bit that has been sent based on the a priori information or a posteriori information used in the decoding process.
  • the receiving end obtains the log-likelihood ratio (Log-Likelihood-Ration, LLR sequence) corresponding to the first sequence to be decoded, and the LLR in the LLR sequence is the same as the code in the coded bit sequence to be transmitted. bit corresponding.
  • the receiving end determines the first n′′ k LLRs with smaller amplitudes from the LLR sequence, where n′′ k is a positive integer, and the n′′ k coded bits corresponding to the n′′ k LLRs are used by the transmitting end in the next time (such as the k times)
  • the number of coded bits that have been sent that can be sent during the transmission process that is, the number of coded bits that have been sent in the coded bit sequence to be transmitted contained in the second coded bit sequence
  • the receiving end is based on n
  • the position of the n" k coded bits corresponding to the " k LLRs in the coded bit sequence to be transmitted determines the first indication information.
  • the first indication information includes index values of positions of n′′ k coded bits in the coded bit sequence to be transmitted.
  • the receiving end obtains the channel estimation result corresponding to the first sequence to be decoded, and the channel estimation value in the channel estimation result (it can be understood that the channel estimation value itself is h, which is a complex number, in the text the letter referred to The track estimate value is actually the modulus of h, that is,
  • the receiving end determines the channel estimation mean value corresponding to each resource sub-segment in the resource segment corresponding to the coded bit sequence to be transmitted based on the channel estimation result; the receiving end determines the channel estimation mean value from the resource segment corresponding to the coded bit sequence to be transmitted, which is smaller than M resource sub-segments; where M is a positive integer; the receiving end determines the first indication information based on the M resource sub-segments.
  • the first indication information includes information of M resource sub-segments, specifically, for example, index values of M resource sub-segments.
  • the first indication information can indicate the coding
  • the number of bits is a ⁇ M.
  • the initial transmission code length is N 0
  • feedback can be performed at most t times
  • the total transmission code length is N.
  • the total number of coded bits after the first k-1 transmissions is N k-1
  • N k-1 includes N.
  • the log-likelihood ratio is In the k-th transmission, n k coded bits are to be sent.
  • the segment interval of the resource segment is ⁇
  • the average channel estimate of the i-th resource sub-segment is Estimate the mean based on the channel Select The information of each resource subsection is fed back to the sending end.
  • the above example is based on the fact that all the coded bits in the second coded bit sequence are coded bits that have been sent. If the second coded bit sequence also includes coded bits that have not been sent, then the n k in is replaced by n′′ k , n′′ k is the number of coded bits that have been sent that the sender can send during the kth transmission.
  • the receiving end sends the first indication information, and correspondingly, the sending end receives the first indication information.
  • the receiving end also sends a NACK to indicate that the receiving end has failed to decode.
  • the NACK and the first indication information may be carried in the same message, or may be carried in different messages respectively, which is not limited by this application.
  • the sending end sends a second coded bit sequence according to the first indication information, where the coded bit sequence to be transmitted includes the second coded bit sequence; correspondingly, the receiving end receives the second sequence to be decoded, where the second sequence to be decoded It is a sequence formed after the second coded bit sequence sent by the sending end according to the first indication information is transmitted through the channel.
  • the second coded bit sequence includes: at least one coded bit that has been sent in the coded bit sequence to be transmitted, and/or at least one coded bit that has not been sent in the coded bit sequence that is to be transmitted.
  • the second coded bit sequence here is the first coded bit sequence sent after the first coded bit sequence is sent by the transmitting end, that is, there are no other coded bits between the first coded bit sequence and the second coded bit sequence. sequence.
  • the first coded bit sequence is the coded bit sequence initially transmitted by the sender, and the second coded bit sequence is the coded bit sequence retransmitted by the sender for the first time; or,
  • the first coded bit sequence is the coded bit sequence retransmitted by the sending end for the q-1th time.
  • the second coded bit sequence is the coded bit sequence retransmitted by the sending end for the qth time.
  • q is a positive integer greater than 1 and less than or equal to t.
  • the sender performs at most t retransmissions. Including the initial transmission, the sender sends a coded bit sequence at most t+1 times.
  • the first coded bit sequence is the k-1th time sent by the sender.
  • the second coded bit sequence is the coded bit sequence sent by the transmitter for the kth time, and k is a positive integer greater than 1 and less than or equal to t+1.
  • the sending end can perform targeted retransmission according to the first indication information, so that the second coded bit sequence can include the to-be-received bit sequence. At least one coded bit in the transmitted coded bit sequence has been sent, thereby giving full play to the error correction and error detection capabilities of the receiving end and improving the decoding and error correction performance of the receiving end.
  • the first coded bit sequence and the second coded bit sequence are the coded bit sequences sent k-1 times and kth times by the transmitting end respectively, and k is greater than 2, if the second coded bit sequence includes the coded bit sequence to be At least one coded bit that has been sent in the transmitted coded bit sequence, then the at least one coded bit that has been sent may include:
  • the second coded bit sequence is the coded bit sequence sent by the transmitter for the third time based on the coded bit sequence to be transmitted. If the second coded bit sequence includes the coded bit sequence to be transmitted that has been sent At least one coded bit, then the at least one coded bit that has been sent can be the coded bits in the coded bit sequence sent by the sending end for the second time according to the coded bit sequence to be transmitted, or it can be the coded bit that the sending end sends according to the coded bit sequence to be transmitted.
  • the coded bit sequence of the coded bit sequence sent for the first time may also be partly the coded bits of the coded bit sequence sent for the second time, and the other part is the coded bits of the coded bit sequence sent for the first time.
  • the second coded bit sequence may also include at least one coded bit that has not been sent in the coded bit sequence to be transmitted, or include at least one coded bit sequence that has been sent in the coded bit sequence to be transmitted.
  • the coded bits further include at least one coded bit that has not been sent in the coded bit sequence to be transmitted.
  • the proportion of coded bits that have been sent in the second coded bit sequence can be determined according to the system resource configuration.
  • the proportion of coded bits that have been sent in the second coded bit sequence does not exceed the preset value ⁇ .
  • the preset value ⁇ is a fixed value. For example, assuming that the sender performs at most t retransmissions, plus the initial transmission, the sender sends a coded bit sequence at most t+1 times, and the coded bits in the coded bit sequence sent each time in t+1 times are The proportion does not exceed the preset value ⁇ .
  • the value of the preset value ⁇ can also be changed dynamically.
  • the sending end sends a coded bit sequence at most t+1 times, where the first coded bit sequence is the coded bit sequence sent by the sender for the k-1th time.
  • the second coded bit sequence is the coded bit sequence sent by the sender for the kth time.
  • the proportion ⁇ of the coded bits that have been sent in the second coded bit sequence sent can be calculated based on ⁇ ′, the number of coded bits sent repeatedly in the first k-1 times of transmission N′′ k-1 , and the number of coded bits sent repeatedly in the first k-1 times.
  • the number of coded bits sent during the transmission process N k-1 and the total number of coded bits that can be sent during the k-th transmission process n k are determined:
  • the sending end can determine the number n′′ k of coded bits that can be sent in the kth transmission process based on ⁇ and the total number of coded bits that can be sent in the kth transmission process n k : n′′ k ⁇ ⁇ ′ ⁇ n k .
  • the coded bits sent for the first time that is, other coded bits except the coded bits that have been sent
  • the non-first-time transmission in all transmission processes of the coded bits to be transmitted such as at most t+1 transmission processes
  • the coded bits that is, the coded bits that have been sent
  • the proportion of coded bits sent multiple times does not exceed ⁇ '), to avoid the problem of poor decoding error correction performance caused by too small a proportion of coded bits that have been sent, and to avoid an excessive proportion of coded bits that have been sent. This often leads to the problem of occupying more transmission resources.
  • n′′ k the number of coded bits (that is, the number of at least one coded bit that has been sent in the second coded bit sequence) n′′ k :
  • n′′ k is the number of at least one coded bit that has been sent in the coded bit sequence to be transmitted included in the second coded bit sequence (i.e., the coded bit sequence sent for the kth time); N k-1 represents the transmission The number of coded bits sent by the end before sending the second coded bit sequence (i.e., the first k times), N′′ k-1 represents the number of coded bits that the sender repeatedly sent before sending the second coded bit sequence; n k is the The number of coded bits included in the two coded bit sequences; ⁇ ' is the threshold value corresponding to the proportion of repeatedly transmitted coded bits in all coded bit sequences sent by the transmitter according to the coded bit sequence to be transmitted. The proportion of coded bits sent repeatedly among all the coded bit sequences sent by the coded bit sequence does not exceed ⁇ ′.
  • n′ k n k -n′′ k
  • the second coded bit sequence is obtained, and then the second coded bit sequence can be sent.
  • ⁇ ′ is greater than or equal to the preset threshold value.
  • the preset threshold value may be inversely proportional to the initial transmission code rate. In this way, the decoding error correction performance of the receiving end can be further improved.
  • the receiving end re-decodes according to the second sequence to be decoded.
  • the receiving end converts the second coded bit sequence into The sequence is combined with the first coded bit sequence, and the combined coded bit sequence is iteratively decoded.
  • the receiving end combines the first coded bit sequence, the second coded bit sequence and other previously received coded bit sequences (that is, combines all coded bit sequences received k times before), and the combined coded bit sequence is
  • the bit sequence is iteratively decoded. For example, a new LLR sequence is obtained and decoding is performed based on the new LLR.
  • the receiving end can continue to determine the new indication information according to the method introduced in S502, and send the new indication information to the sending end, so that the sending end
  • the encoded bit sequence is sent again (i.e., the k+1th time) according to the new indication information, and this cycle continues until the receiving end is decoded successfully or the maximum number of retransmissions is reached.
  • the receiving end can send the first indication information to indicate that the sending end has sent to
  • the position information of one less coded bit allows the sending end to send at least one of these already sent coded bits when retransmitting, which can improve the decoding and error correction performance of the receiving end.
  • FIG 5B it is a fading channel.
  • the receiving end decodes the LDPC code based on the LLR feedback of the first indication information. Performance evaluation diagram.
  • FIG. 5C and Figure 5D it is a performance evaluation diagram of the receiving end decoding the LDPC code in the Fading channel, the QPSK modulation mode, and the receiving end feeding back the first indication information based on the channel estimate value.
  • the abscissa represents the signal-to-noise ratio (Es/N0), and the ordinate represents the decoding error rate (BLock Error Rate, BLER).
  • a schematic flow chart of another information transmission method provided by an embodiment of the present application includes:
  • the sending end sends a third coded bit sequence; correspondingly, the receiving end receives a third sequence to be decoded, and the third sequence to be decoded is a sequence formed after the third coded bit sequence sent by the sending end is transmitted through the channel.
  • the sending end encodes the information bits to be transmitted to generate a sequence of coded bits to be transmitted.
  • the encoding scheme used by the sending end includes but is not limited to LDPC, Polar and other encoding schemes.
  • the process in which the sender sends the coded bit sequence for the first time according to the coded bit sequence to be transmitted is the initial transmission process, and the process of sending the coded bit sequence after the initial transmission process is the retransmission process.
  • the number of retransmissions may be one or multiple times, and is not limited by this application.
  • the third coded bit sequence may be a coded bit sequence sent during the initial transmission, or may be a coded bit sequence sent during the retransmission, and is not limited in this application.
  • the sending end sends the coded bit sequence at most t+1 times, where the third coded bit sequence can be the coded bits sent by the sender for the k-1th time.
  • k is a positive integer greater than 1 and less than or equal to t+1.
  • the receiving end can receive the sequence to be decoded multiple times. Specifically, the receiving end receives a sequence to be decoded for each encoded bit sequence sent by the transmitting end.
  • the third sequence to be decoded corresponds to the third sequence of coded bits, that is, the third sequence to be decoded is a sequence formed after the third coded bit sequence sent by the transmitting end according to the coded bit sequence to be transmitted is transmitted through the channel.
  • the transmitting end can also perform other processing such as modulation on the third coded bit sequence.
  • the third coded bit sequence is converted into a waveform signal, it is transmitted to the channel (or carrier). Make the transfer.
  • the waveform signal will be deformed to a certain extent due to path loss, noise interference, etc., so the waveform signal received by the receiving end may be different from the waveform signal sent by the transmitting end.
  • the receiving end after receiving the waveform signal, the receiving end performs demodulation and other processing on it to obtain the third sequence to be decoded corresponding to the third coded bit sequence.
  • this article describes the above process as the sending end sending the third sequence to be decoded and the receiving end receiving the third sequence to be decoded.
  • the receiving end decodes the third sequence to be decoded and obtains the first decoding result.
  • the receiving end uses a decoding scheme corresponding to the coding scheme of the sending end to decode the third sequence to be decoded.
  • the sending end uses an LDPC matrix to encode the information bit sequence to be transmitted to generate a third coded bit sequence, then the receiving end The end uses the LDPC matrix to iteratively decode the third sequence to be decoded.
  • the receiving end can also send an ACK to indicate successful decoding.
  • cH T ⁇ 0 If the decoding fails, for example, cH T ⁇ 0, the receiving end executes S603. It should be understood that cH T ⁇ 0 is only an example. In fact, there may be other reasons leading to decoding failure, which is not limited by this application.
  • the receiving end sends the first decoding result; correspondingly, the sending end receives the first decoding result.
  • the receiving end can compress the first decoding result and then send it to the sending end to reduce resource overhead. Further optionally, the receiving end may only send the information bits in the first decoding result to reduce resource overhead.
  • the transmitting end sends the information bits in the first decoding result to the transmitting end through the Joint Source Channel Coding Scheme (JSCC) method.
  • JSCC Joint Source Channel Coding Scheme
  • the receiving end can also send NACK to indicate decoding failure.
  • the transmitting end determines the coded bits with decoding errors from the third coded bit sequence based on the first decoding result and the information bits in the third coded bit sequence; the transmitting end determines the third coded bits based on the coded bits with decoding errors. At least one coded bit in the bit sequence.
  • the position of the information bit in the first decoding result corresponds to the position of the information bit in the third encoded bit sequence. If the information bits at the corresponding positions are different, it is considered that the encoded bit at that position is decoded. Something went wrong.
  • the sending end determines all the coded bits with decoding errors by comparing the information bits in the first decoding result with the information bits in the third coded bit sequence; and then determines the coded bits in the third coded bit sequence based on the coded bits with decoding errors. At least one coded bit (or determine the position of at least one coded bit in the third coded bit sequence).
  • the coded bits with decoding errors may also be referred to as information bits with decoding errors, information bits with decoding errors, etc.
  • the length of the second indication information sent by the subsequent sending end is large enough (for example, no matter how many encoded bits are decoded incorrectly, the second indication information can indicate position information of all coded bits with decoding errors), then all coded bits with decoding errors can be used as the at least one coded bit.
  • the sending end determines the at least one coded bit based on the number of coded bits with decoding errors. For example, when resources in the system are limited and the length of the second indication information is limited (for example, if the number of coded bits is large, the second indication information cannot indicate the location information of all coded bits with decoding errors), a threshold can be set. T. When the number of coded bits with decoding errors is less than T, the transmitting end uses the coded bits with decoding errors as at least one coded bit; or, when the number of coded bits with decoding errors is greater than T, the transmitting end uses the coded bits with decoding errors as at least one coded bit.
  • T coded bits are selected from the coded bits, and the T coded bits are used as at least one coded bit.
  • T is the preset threshold value.
  • the sending end when there are fewer information bits with decoding errors, the sending end can directly indicate the location of the information bits with decoding errors, so that the receiving end can directly correct these errors; when there are more information bits with decoding errors, the sending end The end will indicate the positions of T coded bits with decoding errors, allowing the receiving end to correct the errors in the a priori information of these T information bits, and use the corrected a priori information to re-decode.
  • the sending end can select T coded bits from the coded bits with decoding errors based on indicators such as the degree corresponding to the coded bits with decoding errors, the degree of belonging to the absorption set, the degree of belonging to the stop set, etc.
  • sort the encoded bits with decoding errors in order from small to large degree (or the order of the degree of belonging of the absorption set from large to small, or the order of the degree of belonging of the stop set from large to small), and select the top T bits of coded bits.
  • T can be taken such that The maximum value established, where N is the information bit length of the second indication information (specifically, it can be determined according to the available resources of the system, or specified by the protocol, or by the sending end and the receiving end. Convention), k is the number of information bits (or information bits) in the first coded bit sequence.
  • the second indication information also includes an indication bit; when the number of coded bits with decoding errors is less than T, the value of the indicator bit is the first value; when the number of coded bits with decoding errors is When it is greater than or equal to T, the value of the indication bit is the second value; where the first value is different from the second value. For example: the first value is 0 and the second value is 1; or the first value is 1 and the second value is 0.
  • the transmitter selects T coded bits from the coded bits with decoding errors, and performs source coding on the location information of the selected T coded bits.
  • T coded bits corresponds to an information bit sequence of at most N-1 length, and adds an indication bit to the last bit to obtain the second indication information.
  • the receiving end can learn the specific situation of the location information carried in the second indication information, and adopt different processing strategies according to different situations. For details, see the introduction in S605.
  • the sending end sends second indication information, where the second indication information includes position information of at least one coded bit; correspondingly, the receiving end receives the second indication information.
  • the receiving end obtains the second decoding result according to the second indication information and the first decoding result.
  • the second indication information can indicate the location information of all coded bits with decoding errors), for example, The second indication information does not carry an indication bit, then the receiving end can directly determine the erroneously decoded coded bits in the first decoding result based on the second indication information, and correct the erroneous coded bits (flip the erroneously decoded coded bits), Obtain the second decoding result.
  • the receiving end can use different methods to obtain the second translation according to different values of the indication bit.
  • the receiving end determines the erroneous coded bit in the first decoding result based on the position information of at least one coded bit in the third coded bit sequence, and corrects the erroneous coded bit (coding of the decoding error). Bits are flipped) to obtain the second decoding result; or,
  • the receiving end corrects the a priori information corresponding to the first decoding result based on the position information of at least one coded bit in the third coded bit sequence (that is, the receiving end decodes the third sequence to be decoded). a priori information obtained during the decoding process), and re-decodes the third encoded bit sequence according to the corrected a priori information to obtain a second decoding result.
  • the LLR sequence corresponding to the first decoding result (the LLR sequence obtained by the receiving end in the process of decoding the third sequence to be decoded) is determined.
  • the receiving end can also feed back the second decoding result to the sending end, so that the sending end determines the position of the decoding error again, and sends based on the redetermined position of the decoding error.
  • the receiving end can obtain new decoding results again, and this cycle continues until the receiving end decodes successfully.
  • the sending end can specifically indicate the location of the decoding error, so that the receiving end can correct the decoding result.
  • the decoding and error correction performance of the receiving end can be effectively improved.
  • Figure 6B and Figure 6C are performance evaluation diagrams of using the above scheme to decode LDPC codes in an Additive White Gaussian Noise (AWGN) channel under the QPSK modulation mode.
  • AWGN Additive White Gaussian Noise
  • the abscissa represents Es/N0
  • the ordinate represents BLER.
  • FIG. 7A a schematic flow chart of another information transmission method provided by an embodiment of the present application is provided.
  • the method includes:
  • the sending end uses the LDPC matrix to encode the information encoding bits to be transmitted to obtain the encoding bit sequence to be transmitted.
  • the coded bit sequence to be transmitted includes coded bits corresponding to one or more first variable nodes and coded bits corresponding to one or more second variable nodes.
  • the first variable node is the variable node corresponding to the coded bits sent first by the sender
  • the second variable node is the code sent by the sender after sending the coded bits corresponding to the first variable node and receiving the NACK fed back by the receiving end.
  • the variable node corresponding to the bit is the variable node corresponding to the bit.
  • the column weight of the second variable node is 1, that is, in the LDPC matrix, there is only one non-zero element in the column where the second variable node is located, that is, the second variable node is only associated with one check equation.
  • the second variable node can be a Raptor-like node.
  • the first variable node may be a variable node within the dotted box in Figure 4 (corresponding to the coded bits during initial transmission), and the second variable node may be a variable node outside the dotted box (corresponding to the coded bits during retransmission) .
  • the one or more second variable nodes may be all variable nodes outside the dotted box, or may be some variable nodes outside the dotted box, which is not limited by this application.
  • the transmitting end sends the coded bits corresponding to one or more first variable nodes; correspondingly, the receiving end receives the fourth sequence to be decoded.
  • the sending end sends the coded bits corresponding to the one or more first variable nodes. That is, the coded bits corresponding to the one or more second variable nodes have not yet been sent. That is, the coded bits sent by the sending end in step S702 do not include the coded bits corresponding to the one or more second variable nodes.
  • the fourth sequence to be decoded is a sequence formed after the coded bits corresponding to one or more first variable nodes are transmitted through the channel.
  • the channel transmission process reference may be made to the above channel transmission process of the first coded bit sequence, the second coded bit sequence, or the third coded bit sequence, and will not be described again here.
  • the receiving end uses the LDPC matrix to decode the fourth sequence to be decoded; if the decoding fails, the receiving end determines at least one second variable node from one or more second variable nodes.
  • the receiving end determines at least one second variable node from one or more second variable nodes, which can also be described as the receiving end determines at least one second variable node from the position of one or more second variable nodes.
  • Position where the position refers to the position of at least one second variable node among all variable nodes in the LDPC matrix (or corresponding to the coded bit sequence to be transmitted).
  • each variable node in the LDPC matrix corresponds to a position label, and the receiving end can determine the position label of the at least one second variable node from the position labels of all variable nodes in the LDPC matrix.
  • the receiving end uses the LDPC matrix to decode the fourth sequence to be decoded. You can refer to the decoding process of the first sequence to be decoded, the second sequence to be decoded, or the third sequence to be decoded above, which will not be described again here. .
  • the receiving end sends an ACK.
  • the receiving end determines at least one second variable node from one or more second variable nodes.
  • the at least one second variable node may be a second variable node that needs to increase the transmission power, or it may be a second variable node that needs to reduce the transmission power, or include a second variable node that needs to increase the transmission power and a second variable node that needs to reduce the transmission power.
  • the second variable node is not limited by this application.
  • the prior information of the first variable node associated with each second variable node and/or Or a posteriori information is used to evaluate the reliability of the second variable node, where the first variable node associated with a certain second variable node refers to the first variable node in the verification equation corresponding to the second variable node.
  • the transmission power can be reduced, and for those with low reliability, the transmission power can be increased.
  • the a priori information or posterior information corresponding to the first variable node associated with the second variable node that needs to increase the transmission power is within the first threshold range; the third variable node associated with the second variable node that needs to reduce the transmission power is within the first threshold range.
  • the a priori information or posterior information corresponding to a variable node is within the second threshold range; wherein the first threshold range is different from the second threshold range.
  • the first threshold range is a range less than or equal to the threshold
  • the second threshold range is a range greater than the threshold.
  • the a priori information includes the LLR or channel estimate value generated during the decoding process; and/or the a posteriori information includes the soft value at the end of the decoding.
  • the sender can perform at most t retransmissions after the initial transmission. Including the initial transmission, it can perform at most t+1 transmissions.
  • the total transmission code length is N.
  • the code length after the first k-1 transmissions is N k- 1
  • k is a positive integer greater than 1 and less than or equal to t+1
  • the log-likelihood ratio is LLR k-1 .
  • the receiving end based on the currently received coded bits (i.e., the fourth waiting Decoding sequence, corresponding to one or more first variable nodes), select the Raptor-like node that the sender will send N′ k coding bits corresponding to next time (i.e.
  • , g(c) ⁇ v′ ⁇ N(c) (
  • the above reliability index can also have other modifications, which are not limited by this application.
  • , g(c) min v′ ⁇ N(c) (
  • the receiving end sends third indication information, where the third indication information is used to indicate at least one second variable node; accordingly, the sending end receives the third indication information.
  • the third indication information here is used to indicate at least one second variable node, which can also be described as the third indication information is used to indicate the position of at least one second variable node, and the position refers to the at least one second variable node.
  • the third indication information Including: first information, the first information is used to indicate a second variable node that needs to increase the transmission power among one or more second variable nodes (or the first information is used to indicate that the transmission power needs to be increased among one or more second variable nodes). The position of the second variable node of power);
  • the third indication information Includes: second information, the second information is used to indicate a second variable node among the one or more second variable nodes that needs to reduce the transmission power (or the second information is used to indicate a second variable node among the one or more second variable nodes that needs to reduce the transmission power).
  • the position of the variable node is used to indicate a second variable node among the one or more second variable nodes that needs to reduce the transmission power (or the second information is used to indicate a second variable node among the one or more second variable nodes that needs to reduce the transmission power).
  • the third indication information may include first information and second information. The first information is used to indicate that one or more second variable nodes need to be improved.
  • the second variable node of the transmission power (or the first information is used to indicate the location of the second variable node that needs to increase the transmission power among the one or more second variable nodes), the second information is used to indicate the one or more second variables A second variable node among the nodes that needs to reduce the transmission power (or the second information is used to indicate the location of the second variable node among one or more second variable nodes that needs to reduce the transmission power).
  • the transmitting end allocates transmission power to the coded bits corresponding to one or more second variable nodes according to the third indication information.
  • each variable node in the LDPC matrix is pre-allocated with power, and the total power corresponding to all variable nodes is P.
  • the sending end After receiving the third indication information, the sending end adjusts the power of one or more second variable nodes based on the original power of one or more second variable nodes according to the third indication information, and implements it as one or more Coded bits corresponding to the plurality of second variable nodes allocate transmission power.
  • the sending end can increase the third indication.
  • the power of the second variable node indicated in the information is reduced at the same time to ensure that the total power P remains unchanged.
  • the sending end can reduce the power indicated in the third indication information.
  • the power of the second variable node is increased at the same time to ensure that the total power P remains unchanged.
  • the sending end increases the power of the corresponding second variable node according to the first information and decreases the power of the corresponding second variable node according to the second information to ensure the total power P constant.
  • the third indication information includes the index values of the locations of
  • the transmitting end sends the coded bits corresponding to one or more second variable nodes according to the allocated transmit power; the corresponding receiving end receives the fifth sequence to be decoded.
  • the symbols received by the receiving end are where x is the sent symbol and n is the channel noise; the receiving end generates a new log-likelihood ratio based on the received symbols for decoding; the receiving end determines the sending end based on whether the decoding is successful and whether the maximum number of retransmissions t is reached. Whether to send the k+1th time.
  • the transmission power of the coded bits to be retransmitted is adjusted. For example, the transmission power of the variable nodes with high reliability is reduced. The transmission power is increased corresponding to variable nodes with low reliability, which can effectively improve the decoding and error correction performance of the receiving end.
  • Figure 7B which is a performance evaluation diagram of decoding LDPC codes using the above scheme under the QPSK modulation mode in the AWGN channel.
  • the abscissa represents Es/N0
  • the ordinate represents BLER.
  • An embodiment of the present application provides a communication device 800.
  • the device may be, for example, the above-mentioned sending end or receiving end, or a chip disposed inside the above-mentioned sending end or receiving end.
  • the device has the functions of realizing the sending end or the receiving end in the embodiment shown in Figure 5A or Figure 6A or Figure 7A.
  • the device includes executing the steps performed by the sending end or the receiving end in the embodiment shown in Figure 5A, Figure 6A or Figure 7A.
  • the modules or units or means corresponding to the steps, the functions, units or means can be implemented by software, or implemented by hardware, or can also be implemented by hardware executing corresponding software.
  • the communication device 800 includes a processing module 801 and a transceiver module 802 .
  • the processing module 801 is used to generate a coded bit sequence to be transmitted; the transceiving module 802 is used to send a first coded bit sequence according to the coded bit sequence to be transmitted, where the coded bit sequence to be transmitted includes the first coded bit sequence; and receives the first coded bit sequence.
  • the first indication information includes the position information of at least one coded bit that has been sent in the coded bit sequence to be transmitted in the coded bit sequence to be transmitted;
  • the second coded bit sequence is sent according to the first indication information; wherein , the coded bit sequence to be transmitted includes a second coded bit sequence, and the second coded bit sequence includes: at least one coded bit that has been sent in the coded bit sequence to be transmitted, and/or, in the coded bit sequence to be transmitted, At least one coded bit that has not been sent.
  • the transceiver module 802 is configured to receive the first sequence to be decoded, where the first sequence to be decoded is a sequence formed by transmitting the first coded bit sequence sent by the transmitting end according to the coded bit sequence to be transmitted through the channel; the processing module 801, Used to decode the first sequence to be decoded; if the decoding fails, the processing module 801 is also used to determine the first indication information; the first indication information includes at least one code that has been sent in the coded bit sequence to be transmitted.
  • the position information of the bit in the encoded bit sequence to be transmitted; the transceiver module 802 is also used to send the first indication information; receive the second sequence to be decoded, where the second sequence to be decoded is sent by the sending end according to the first indication information
  • the sequence formed after the second coded bit sequence is transmitted through the channel.
  • the transceiver module 802 is used to send the third coded bit sequence; receive the first decoding result; the processing module 801 is used to obtain the third coded bit sequence from the third coded bit sequence according to the first decoding result and the information bits in the third coded bit sequence. Determine the coded bits with decoding errors; determine at least one coded bit in the third coded bit sequence according to the coded bits with decoding errors; the transceiver module 802 is also configured to send second indication information, the second indication information includes at least one Encoded bit position information.
  • the transceiver module 802 is used to receive the third sequence to be decoded.
  • the third sequence to be decoded is a sequence formed after the third coded bit sequence sent by the sending end is transmitted through the channel; the processing module 801 is used to process the third sequence to be decoded.
  • the sequence is decoded to obtain the first decoding result; if the decoding fails, the transceiver module 802 is also used to send the first decoding result; receive the second indication information, and the second indication information includes the third coded bit sequence.
  • Position information of at least one coded bit; the processing module 801 is also configured to obtain a second decoding result according to the second indication information and the first decoding result.
  • the processing module 801 is configured to use the low-density parity check code LDPC matrix to encode the information encoding bits to be transmitted to obtain the encoding bit sequence to be transmitted.
  • the encoding bit sequence to be transmitted includes the encoding corresponding to one or more first variable nodes. bits and coded bits corresponding to one or more second variable nodes, and the column weight corresponding to the second variable node is 1; the transceiver module 802 is used to send coded bits corresponding to one or more first variable nodes; receive the third indication information, the third indication information is used to indicate at least one second variable node among the one or more second variable nodes; the processing module 801 is also used to provide the encoding corresponding to the one or more second variable nodes according to the third indication information.
  • the bits allocate transmission power; the transceiver module 802 is also used to transmit the coded bits corresponding to one or more second variable nodes according to the allocated transmission power.
  • the transceiver module 802 is configured to receive a fourth sequence to be decoded.
  • the fourth sequence to be decoded is a sequence formed after the coded bits corresponding to one or more first variable nodes are transmitted through the channel.
  • the coded bits are included in the coded bit sequence generated based on the LDPC matrix.
  • the coded bit sequence generated based on the LDPC matrix also includes coded bits corresponding to one or more second variable nodes, and the column weight corresponding to the second variable node is 1;
  • the processing module 801 is used to decode the fourth sequence to be decoded using the LDPC matrix; if the decoding fails, the processing module 801 is also used to determine at least one second variable node from one or more second variable nodes;
  • the transceiving module 802 is also configured to send third indication information, where the third indication information is used to indicate at least one second variable node.
  • an embodiment of the present application also provides a communication device 900, including:
  • the memory 902 is located outside the device 900 .
  • the device 900 includes the memory 902 , the memory 902 is connected to the at least one processor 901 , and the memory 902 stores instructions that can be executed by the at least one processor 901 .
  • Figure 9 shows in dashed lines that memory 902 is optional for device 900.
  • the processor 901 and the memory 902 may be coupled through an interface circuit or integrated together, without limitation here.
  • connection medium between the above-mentioned processor 901, memory 902 and communication interface 903 is not limited in the embodiment of the present application.
  • the processor 901, the memory 902 and the communication interface 903 are connected through a bus 904.
  • the bus is represented by a thick line in Figure 9.
  • the connection methods between other components are only schematically explained. , is not limited.
  • the bus can be divided into address bus, data bus, control bus, etc. For ease of presentation, only one thick line is used in Figure 9, but it does not mean that there is only one bus or one type of bus.
  • the processor mentioned in the embodiments of this application can be implemented by hardware or software.
  • the processor may be a logic circuit, an integrated circuit, or the like.
  • the processor may be a general-purpose processor implemented by reading software code stored in memory.
  • the processor may be a central processing unit (CPU), or other general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), or an application specific integrated circuit (Application specific integrated circuit).
  • DSP Digital Signal Processor
  • ASIC Application specific integrated circuit
  • ASIC off-the-shelf programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • a general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.
  • non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), electrically removable memory. Erase programmable read-only memory (Electrically EPROM, EEPROM) or flash memory. Volatile memory may be Random Access Memory (RAM), which is used as an external cache.
  • RAM Random Access Memory
  • RAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • Double Data Eate SDRAM, DDR SDRAM enhanced synchronous dynamic random access memory
  • Enhanced SDRAM, ESDRAM synchronous link dynamic random access memory
  • Synchlink DRAM, SLDRAM direct memory bus random access memory
  • Direct Rambus RAM Direct Rambus RAM
  • the processor is a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component
  • the memory storage module
  • an embodiment of the present application also provides a communication device 1000, including an input and output interface 1001 and a logic circuit 1002; the input and output interface 1001 is used to output a coded bit sequence or input a sequence to be decoded, so The logic circuit is used to perform the method performed by the sending end or the receiving end in the embodiment shown in FIG. 5A or FIG. 6A or FIG. 7A.
  • the above-mentioned logic circuit 1002 can be a chip, an encoder, a coding circuit, or other integrated circuits that can implement the method of the present application.
  • embodiments of the present application also provide a computer-readable storage medium, including a program or instructions.
  • program or instructions When the program or instructions are run on a computer, the embodiment shown in Figure 5A or Figure 6A or Figure 7A The method executed by the sender or receiver is executed.
  • embodiments of the present application also provide a computer program product, including instructions that, when run on a computer, cause the sending end or the receiving end to execute in the embodiment shown in Figure 5A or Figure 6A or Figure 7A method is executed.
  • embodiments of the present application also provide a communication system, including the sending end and receiving end involved in the above embodiments.
  • Embodiments of the present application are described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present application. It will be understood that each process and/or block in the flowchart illustrations and/or block diagrams, and combinations of processes and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine, such that the instructions executed by the processor of the computer or other programmable data processing device produce a use A device for realizing the functions specified in one process or multiple processes of the flowchart and/or one block or multiple blocks of the block diagram.
  • the computer program product includes one or more computer instructions.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device.
  • the computer instructions may be stored in or transmitted from one computer-readable storage medium to another, e.g., the computer instructions may be transmitted from a website, computer, server, or data center to Transmission to another website, computer, server or data center via wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) methods.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains one or more available media integrated.
  • the usable media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital versatile discs (DVD)), or semiconductor media (e.g., solid state disks (SSD) ))wait.
  • magnetic media e.g., floppy disks, hard disks, magnetic tapes
  • optical media e.g., digital versatile discs (DVD)
  • semiconductor media e.g., solid state disks (SSD)

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

本申请实施例提供一种信息传输方法和装置，接收端可以向发送端发送更多的反馈信息，使得发送端能够根据更多的反馈信息针对性地进行重传，进而提升接收端的译码纠错性能。发送端根据待传输的编码比特序列发送第一编码比特序列；接收端接收第一待译码序列并译码，若译码失败，则发送第一指示信息，第一指示信息包括待传输的编码比特序列中已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息；发送端接收第一指示信息并根据第一指示信息发送第二编码比特序列，第二编码比特序列中包括：待传输的编码比特序列中已被发送过的至少一个编码比特，和/或，待传输的编码比特序列中未被发送过的至少一个编码比特。

Description

一种信息传输方法和装置
相关申请的交叉引用
本申请要求在2022年05月26日提交中国专利局、申请号为202210589412.8、申请名称为“一种信息传输方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种信息传输方法和装置。
背景技术
目前，发送端在向接收端发送初传数据之后，可以根据接收端反馈的反馈信息确定是否向接收端发送重传数据。例如，接收端在接收到发送端发送的初传数据后，如果接收端能够正确对初传数据进行译码，则接收端向发送端返回确认应答(acknowledgement，ACK)，如果接收端不能够正确对初传数据进行译码，则向发送端返回非确认应答(non-acknowledgement，NACK)。接收端在收到NACK的情况下，会向接收端发送重传数据，接收端收到重传数据之后，将重传数据和初传数据合并后重新译码。
上述方案中，接收端反馈的反馈信息(即ACK或NACK)为1比特。在接收端译码出错的情况下，无论译码出错的位置在哪里，反馈信息都只是1比特的NACK，所以发送端在重传时未能基于译码出错情况对进行针对性的设计，未能充分发挥接收端的纠错检错能力。
发明内容
本申请实施例提供一种信息传输方法和装置，通过在接收端引入更多的反馈信息，使得发送端可以根据更多的反馈信息针对性地进行重传，进而提升接收端的译码纠错性能。
第一方面，提供一种信息传输方法，包括：发送端根据待传输的编码比特序列，发送第一编码比特序列，该待传输的编码比特序列包括第一编码比特序列；发送端接收第一指示信息；第一指示信息包括该待传输的编码比特序列中已被发送过的至少一个编码比特在该待传输的编码比特序列中的位置信息；发送端根据第一指示信息发送第二编码比特序列；其中，该待传输的编码比特序列包括第二编码比特序列，第二编码比特序列中包括：该待传输的编码比特序列中已被发送过的至少一个编码比特，和/或，该待传输的编码比特序列中未被发送过的至少一个编码比特。
上述方案中，发送端在发送了第一编码比特序列之后，可以根据接收端反馈的第一指示信息发送第二编码比特序列，因为第一指示信息中包括待传输的编码比特序列中已被发送过的至少一个编码比特在该待传输的编码比特序列中的位置信息，因此发送端发送的第二编码比特序列中的编码比特更具有针对性，例如第二编码比特序列中除了可能包括未被发送过的至少一个编码比特之外，还可能包括已被发送过的至少一个编码比特，如此可以使得接收端的译码纠错过程也更具有针对性。相较于现有技术发送端仅重传未被发送过的 编码比特而言，本申请实施例可以充分发挥接收端的纠错检错能力，有效提升接收端的译码纠错性能。
一种可能的设计中，发送端根据待传输的编码比特序列，至少重传一次编码比特序列；其中，第一编码比特序列为初传的编码比特序列，第二编码比特序列为第一次重传的编码比特序列；或者，第一编码比特序列为第q-1次重传的编码比特序列，第二编码比特序列为第q次重传的编码比特序列，q为大于1的正整数。
换而言之，第一编码比特序列可以是初传过程中发送的编码比特序列，也可以是重传过程中发送的编码比特序列，而第二编码比特序列，是发送端在发送第一编码比特序列之后接着发送的编码比特序列，即发送端在第一编码比特序列和第二编码比特序列之间没有发送其他编码比特序列。
可以理解的，本文中，发送端根据待传输的编码比特序列第一次向接收端发送编码比特序列的过程可以称为初传过程，初传过程之后根据该待传输的编码比特序列向接收端发送编码比特序列的过程可以称为重传过程，其中重传次数可以是一次或多次。每次重传编码比特序列可以是重传完整的编码比特序列，也可以是重传编码比特序列中的一部分，本申请不做限制。
可以理解的，如果发送端发送了第二编码比特序列之后，如果接收端译码仍未成功，且未达到最大重传次数，则发送端可以继续执行下一次重传，如此循环，直至接收端译码成功或达到最大重传次数为止。
一种可能的设计中，位置信息为已被发送过的至少一个编码比特在该待传输的编码比特序列中的位置的索引值。
该设计中，接收端直接向发送端指示需要发送端重复传输的至少一个编码比特在该待传输的编码比特序列中的位置，可降低发送端生成第一指示信息和接收端解析第一指示信息的复杂度。
一种可能的设计中，位置信息为已被发送过的至少一个编码比特对应的至少一个资源子段的指示信息，其中至少一个资源子段位于该待传输的编码比特序列对应的资源段中。
该设计中，通过已被发送过的至少一个编码比特对应的至少一个资源子段的指示信息来间接指示已被发送过的至少一个编码比特在该待传输的编码比特序列中的位置，可以减少第一指示信息的数据量(例如一个资源子段对应多个编码比特的情况)。
可以理解的，以上两种设计仅为示例，实际应用中，接收端还可以通过其它形式向接收端反馈已被发送过的至少一个编码比特在该待传输的编码比特序列中的位置。
一种可能的设计中，第二编码比特序列中已被发送过的编码比特的占比不超过预设值δ。
如此，可以保证第二编码比特序列中首次发送的编码比特(即除了已被发送过的编码比特之外的其它编码比特)和非首次发送的编码比特(即已被发送过的编码比特)有合理的占比分配，避免已被发送过的编码比特的占比过少导致译码纠错性能差的问题，以及避免已被发送过的编码比特的占比过多导致占用较多传输资源的问题。
一种可能的设计中，第二编码比特序列中已被发送过的至少一个编码比特的数量满足以下条件：
其中，n″k为第二编码比特序列中包括的该待传输的编码比特序列中已被发送过的至少一个编码比特的数量；Nk-1表示发送端在发送第二编码比特序列之前发送的编码比特的数量，N″k-1表示发送端在发送第二编码比特序列之前重复发送的编码比特的数量；nk为第二编码比特序列中包括的编码比特的数量；δ′为发送端根据该待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比对应的门限值，发送端根据该待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比不超过δ′。
如此，可以保证针对待传输的编码比特的多次传输过程中首次发送的编码比特和非首次发送的编码比特有合理的占比分配，避免已被发送过的编码比特的占比过少导致译码纠错性能差的问题，以及避免已被发送过的编码比特的占比过多导致占用较多传输资源的问题。
一种可能的设计中，δ′大于或等于预设门限值。如此，可以保证针对待传输的编码比特的多次传输过程中首次发送的编码比特和非首次发送的编码比特有合理的占比分配。
第二方面，提供一种信息传输方法，包括：接收端接收第一待译码序列，其中第一待译码序列为发送端根据待传输的编码比特序列发送的第一编码比特序列经由信道传输后形成的序列；接收端对第一待译码序列进行译码；若译码失败，接收端确定第一指示信息；第一指示信息包括待传输的编码比特序列中已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息；接收端发送第一指示信息；接收端接收第二待译码序列，其中第二待译码序列为发送端根据第一指示信息发送的第二编码比特序列经由信道传输后形成的序列。
一种可能的设计中，第一编码比特序列为发送端初传的编码比特序列，第二编码比特序列为发送端第一次重传的编码比特序列；或者，第一编码比特序列为发送端第q-1次重传的编码比特序列，第二编码比特序列为发送端第q次重传的编码比特序列，q为大于1的正整数。
一种可能的设计中，位置信息为已被发送过的至少一个编码比特在待传输的编码比特序列中的位置的索引值。
一种可能的设计中，接收端可以获取与第一待译码序列对应的对数似然比LLR序列，LLR序列中的LLR与待传输的编码比特序列中的编码比特相对应。相应的，接收端确定第一指示信息，可以包括：接收端从LLR序列中确定出幅值较小的前n″k个LLR，其中n″k为正整数，其中n″k个LLR对应的n″k个编码比特为待传输的编码比特序列中已被发送过的至少一个编码比特；接收端根据n″k个LLR对应的n″k个编码比特在待传输的编码比特序列中的位置确定第一指示信息。
该设计方式中，接收端选择LLR幅值较小的编码比特并将这些编码比特的位置信息反馈给发送端，使得发送端可以重发这些LLR幅值较小的编码比特，进而接收端后续可以根据发送端重发的编码比特重新获取译码结果，提高了接收端译码纠错性能。
一种可能的设计中，位置信息为已被发送过的至少一个编码比特对应的至少一个资源子段的信息，其中至少一个资源子段位于待传输的编码比特序列对应的资源段中。
一种可能的设计中，接收端可以根据获取与第一待译码序列对应的信道估计结果，信道估计结果中的信道估计值与该待传输的编码比特序列中的编码比特相对应。相应的，接收端确定第一指示信息，可以包括：接收端根据信道估计结果确定待传输的编码比特序列对应的资源段中各个资源子段对应的信道估计均值；接收端从待传输的编码比特序列对应的资源段中确定出信道估计均值较小M个资源子段；M为正整数；接收端根据M个资源子段确定第一指示信息。
该设计方式中，接收端选择信道估计均值较小的资源子段并将这些资源子段的位置信息反馈给发送端，使得发送端可以重发这些资源子段对应的编码比特，进而接收端后续可以根据发送端重发的编码比特重新获取译码结果，提高了接收端译码纠错性能。
一种可能的设计中，第二编码比特序列中已被发送过的编码比特的占比不超过预设值δ。
一种可能的设计中，第二编码比特序列中已被发送过的至少一个编码比特的数量满足以下条件：
其中，n″k为第二编码比特序列中包括的待传输的编码比特序列中已被发送过的至少一个编码比特的数量；Nk-1表示发送端在发送第二编码比特序列之前发送的编码比特的数量，N″k-1表示发送端在发送第二编码比特序列之前重复发送的编码比特的数量；nk为第二编码比特序列中包括的编码比特的数量；δ′为发送端根据待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比对应的门限值，发送端根据待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比不超过δ′。
一种可能的设计中，δ′大于或等于预设门限值。如此，可以进一步提高接收端的译码纠错性能。
上述各设计的有益效果参考第一方面对应设计的有益效果，此处不再赘述。
第三方面，提供一种信息传输方法，包括：发送端发送第三编码比特序列；
发送端接收第一译码结果；发送端根据第一译码结果和第三编码比特序列中的信息比特，从第三编码比特序列中确定出译码出错的编码比特；发送端根据译码出错的编码比特确定第三编码比特序列中的至少一个编码比特；发送端发送第二指示信息，第二指示信息中包括至少一个编码比特的位置信息。
上述方案中，发送端在发送了第三编码比特序列之后，可以根据接收端反馈的第一译码结果确定出译码出错的编码比特，然后基于译码出错的编码比特发送第二指示信息，使得接收端可以根据第二指示信息进行译码纠错，可以有效提升接收端的译码纠错性能。
一种可能的设计中，当译码出错的编码比特的数量小于或等于T时，发送端将译码出错的编码比特作为至少一个编码比特；或者，当译码出错的编码比特的数量大于T时，发送端从译码出错的编码比特中选择T个编码比特，将T个编码比特作为至少一个编码比特。可以理解的是，当译码出错的编码比特的数量等于T时，可以按照译码出错的编码比特的数量小于T时的方案进行处理(即将译码出错的编码比特作为至少一个编码比特)，当然 也可以按照译码出错的编码比特的数量大于T时的方案进行处理，本申请不做限制。例如：当译码出错的编码比特的数量小于T时，发送端将译码出错的编码比特作为至少一个编码比特；或者，当译码出错的编码比特的数量大于或等于T时，发送端从译码出错的编码比特中选择T个编码比特，将T个编码比特作为至少一个编码比特。其中，T为预设的门限值。
换言之，当译码出错的编码比特较少时，发送端可以直接指示这些译码出错的编码比特的位置，使得接收端直接纠正这些错误；当译码出错的编码比特较多时，发送端会指示部分译码出错的编码比特的位置，使得接收端基于这部分译码出错的编码比特的位置进行译码纠错。
一种可能的设计中，第二指示信息中还包括指示位；当译码出错的编码比特的数量小于T时，指示位的取值为第一值；当译码出错的编码比特的数量大于或等于T时，指示位的取值为第二值；其中，第一值与第二值不同。例如：第一值为0且第二值为1，或者，第一值为1且第二值为0。
如此，可以使得接收端明确第二指示信息中携带的位置信息是所有出错的编码比特的位置信息还是部分出错的编码比特的位置信息，进而针对不同情况采用不同的译码纠错方案，提高了方案可靠性。
一种可能的设计中，T取使得成立的最大值，其中N为第二指示信息的信息比特长度，k为第一编码比特序列中信息位的个数。
如此，可以保证第二指示信息能够指示T个编码比特的位置信息，提高了方案的可靠性。
第四方面，提供一种信息传输方法，包括：接收端接收第三待译码序列，第三待译码序列为发送端发送的第三编码比特序列经由信道传输后形成的序列；接收端对第三待译码序列进行译码，得到第一译码结果；若译码失败，接收端发送第一译码结果；接收端接收第二指示信息，第二指示信息中包括第三编码比特序列中的至少一个编码比特的位置信息；接收端根据第二指示信息和第一译码结果获取第二译码结果。
一种可能的设计中，第二指示信息中还包括有指示位；接收端根据第二指示信息和第一译码结果获取第二译码结果，包括：当指示位为第一值时，接收端根据第三编码比特序列中的至少一个编码比特的位置信息确定第一译码结果中出错的编码比特，校正出错的编码比特，得到第二译码结果；或者，当指示位为第二值时，接收端根据第三编码比特序列中的至少一个编码比特的位置信息校正第一译码结果对应的先验信息，根据校正后的先验信息对第三编码比特序列重新译码，得到第二译码结果。
以上各设计的有益效果可以参考第三方面对应设计的有益效果，此处不再赘述。
第五方面，提供一种信息传输方法，包括：发送端使用LDPC矩阵对待传输的信息编码比特进行编码，得到待传输的编码比特序列，待传输的编码比特序列包括一个或多个第一变量节点对应的编码比特和一个或多个第二变量节点对应的编码比特，第二变量节点对应的列重为1；发送端发送一个或多个第一变量节点对应的编码比特；发送端接收第三指示信息，第三指示信息用于指示一个或多个第二变量节点中的至少一个第二变量节点(或者第三指示信息用于指示一个或多个第二变量节点中的至少一个第二变量节点的位置)；发送端根据第三指示信息为一个或多个第二变量节点对应的编码比特分配发送功率；发送端按照分配好的发送功率发送一个或多个第二变量节点对应的编码比特。
上述方案中，发送端在发送一个或多个第一变量节点对应的编码比特之后，根据从接收端收到第三指示信息为待发送的一个或多个第二变量节点对应的编码比特分配发送功率(例如以低功率发送可靠度高的第二变量节点对应的编码比特，以高功率发送可靠度低的第二变量节点对应的编码比特)，使得发送端发送的一个或多个第二变量节点对应的编码比特能够更好地满足接收端的译码需求，进而提高接收端的译码纠错性能。
一种可能的设计中，第三指示信息中包括：第一信息，第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点(或者第一信息用于指示一个或多个第二变量节点中的至少一个第二变量节点的位置)；和/或，第二信息，第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点(或者第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点的位置)。
如此，发送端可以根据第三指示信息，明确哪些第二变量节点对应的编码比特需要提高发送功率，以及哪些第二变量节点对应的编码比特需要降低发送功率(例如，第三指示信息仅包括第一信息，则提高第一信息指示的第二变量节点对应的编码比特的发送功率，以及降低其他第二变量节点对应的编码比特的发送功率；例如，第三指示信息仅包括第二信息，则降低第二信息指示的第二变量节点对应的编码比特的发送功率，以及提高其他第二变量节点对应的编码比特的发送功率；例如，第三指示信息包括第一信息和第二信息，则提高第一信息指示的第二变量节点对应的编码比特的发送功率，以及降低第二信息指示的第二变量节点对应的编码比特的发送功率)，以满足接收端的译码需求。
一种可能的设计中，需要提高发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第一阈值范围内；需要降低发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第二阈值范围内；其中，第一阈值范围与第二阈值范围不同。
换言之，可以依据各个第二变量节点关联的第一变量节点对应的先验信息或后验信息的取值范围确定需要调整发送功率的第二变量节点。
一种可能的设计中，先验信息包括LLR或信道估计值；和/或，后验信息包括软值。
当然，此处仅为一种示例，实际不限于此。
第六方面，提供一种信息传输方法，包括：接收端接收第四待译码序列，第四待译码序列为一个或多个第一变量节点对应的编码比特经由信道传输后形成的序列，一个或多个第一变量节点对应的编码比特包含于基于LDPC矩阵生成的编码比特序列中，基于LDPC矩阵生成的编码比特序列中还包含一个或多个第二变量节点对应的编码比特，第二变量节点对应的列重为1；接收端使用LDPC矩阵对第四待译码序列进行译码；若译码失败，接收端从一个或多个第二变量节点中确定出至少一个第二变量节点(或者接收端从一个或多个第二变量节点的位置中确定出至少一个第二变量节点的位置)；接收端发送第三指示信息，其中第三指示信息用于指示至少一个第二变量节点(或者第三指示信息用于指示至少一个第二变量节点的位置)。
一种可能的设计中，第三指示信息中包括：第一信息，第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点(或者第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点的位置)；和/或，第二信息，第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点(或者第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点的位置)。
一种可能的设计中，需要提高发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第一阈值范围内；需要降低发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第二阈值范围内；其中，第一阈值范围与第二阈值范围不同。
一种可能的设计中，先验信息包括LLR或信道估计值；和/或，后验信息包括软值。
上述各设计的有益效果参考第五方面对应设计的有益效果，此处不再赘述。
第七方面，提供一种通信装置，包括用于执行如第一方面或第一方面任一种可能的设计中所述的方法的模块。
示例性的，装置包括：
处理模块，用于生成待传输的编码比特序列；
收发模块，用于根据待传输的编码比特序列，发送第一编码比特序列，待传输的编码比特序列包括第一编码比特序列；接收第一指示信息；第一指示信息包括待传输的编码比特序列中已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息；根据第一指示信息发送第二编码比特序列；其中，待传输的编码比特序列包括第二编码比特序列，第二编码比特序列中包括：待传输的编码比特序列中已被发送过的至少一个编码比特，和/或，待传输的编码比特序列中未被发送过的至少一个编码比特。
可选的，收发模块还用于根据待传输的编码比特序列，至少重传一次编码比特序列；其中，第一编码比特序列为初传的编码比特序列，第二编码比特序列为第一次重传的编码比特序列；或者，第一编码比特序列为第q-1次重传的编码比特序列，第二编码比特序列为第q次重传的编码比特序列，q为大于1的正整数。
可选的，位置信息为已被发送过的至少一个编码比特在待传输的编码比特序列中的位置的索引值。
可选的，位置信息为已被发送过的至少一个编码比特对应的至少一个资源子段的指示信息，其中至少一个资源子段位于待传输的编码比特序列对应的资源段中。
可选的，第二编码比特序列中已被发送过的编码比特的占比不超过预设值δ。
可选的，第二编码比特序列中已被发送过的至少一个编码比特的数量满足以下条件：
其中，n″k为第二编码比特序列中包括的待传输的编码比特序列中已被发送过的至少一个编码比特的数量；Nk-1表示该装置在发送第二编码比特序列之前发送的编码比特的数量，N″k-1表示该装置在发送第二编码比特序列之前重复发送的编码比特的数量；nk为第二编码比特序列中包括的编码比特的数量；δ′为该装置根据待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比对应的门限值，该装置根据待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比不超过δ′。
可选的，δ′大于或等于预设门限值。
第八方面，提供一种通信装置，包括用于执行如第二方面或第二方面任一种可能的设计中所述的方法的模块。
示例性的，装置包括：
收发模块，用于接收第一待译码序列，其中第一待译码序列为发送端根据待传输的编码比特序列发送的第一编码比特序列经由信道传输后形成的序列；
处理模块，用于对第一待译码序列进行译码；
若译码失败，处理模块还用于确定第一指示信息；第一指示信息包括待传输的编码比特序列中已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息；
收发模块，还用于发送第一指示信息；接收第二待译码序列，其中第二待译码序列为发送端根据第一指示信息发送的第二编码比特序列经由信道传输后形成的序列。
可选的，第一编码比特序列为发送端初传的编码比特序列，第二编码比特序列为发送端第一次重传的编码比特序列；或者，第一编码比特序列为发送端第q-1次重传的编码比特序列，第二编码比特序列为发送端第q次重传的编码比特序列，q为大于1的正整数。
可选的，位置信息为已被发送过的至少一个编码比特在待传输的编码比特序列中的位置的索引值。
可选的，处理模块还用于：获取与第一待译码序列对应的对数似然比LLR序列，LLR序列中的LLR与待传输的编码比特序列中的编码比特相对应。处理模块在确定第一指示信息时，具体用于：从LLR序列中确定出幅值较小的前n″k个LLR，其中n″k为正整数，其中n″k个LLR对应的n″k个编码比特为待传输的编码比特序列中已被发送过的至少一个编码比特；根据n″k个LLR对应的n″k个编码比特在待传输的编码比特序列中的位置确定第一指示信息。
可选的，位置信息为已被发送过的至少一个编码比特对应的至少一个资源子段的信息，其中至少一个资源子段位于待传输的编码比特序列对应的资源段中。
可选的，处理模块还用于根据获取与第一待译码序列对应的信道估计结果，信道估计结果中的信道估计值与待传输的编码比特序列中的编码比特相对应。处理模块在确定第一指示信息时，具体用于：根据信道估计结果确定待传输的编码比特序列对应的资源段中各个资源子段对应的信道估计均值；从待传输的编码比特序列对应的资源段中确定出信道估计均值较小M个资源子段；M为正整数；根据M个资源子段确定第一指示信息。
可选的，第二编码比特序列中已被发送过的编码比特的占比不超过预设值δ。
可选的，第二编码比特序列中已被发送过的至少一个编码比特的数量满足以下条件：
其中，n″k为第二编码比特序列中包括的待传输的编码比特序列中已被发送过的至少一个编码比特的数量；Nk-1表示发送端在发送第二编码比特序列之前发送的编码比特的数量，N″k-1表示发送端在发送第二编码比特序列之前重复发送的编码比特的数量；nk为第二编码比特序列中包括的编码比特的数量；δ′为发送端根据待传输的编码比特序列向该装置发送的所有编码比特序列中重复发送的编码比特的占比对应的门限值，发送端根据待传输的编码比特序列向该装置发送的所有编码比特序列中重复发送的编码比特的占比不超过δ′。
可选的，δ′大于或等于预设门限值。
第九方面，提供一种通信装置，包括用于执行如第三方面或第三方面任一种可能的设计中所述的方法的模块。
示例性的，装置包括：
收发模块，用于发送第三编码比特序列；接收第一译码结果；
处理模块，用于根据第一译码结果和第三编码比特序列中的信息比特，从第三编码比特序列中确定出译码出错的编码比特；根据译码出错的编码比特确定第三编码比特序列中的至少一个编码比特；
收发模块，还用于发送第二指示信息，第二指示信息中包括至少一个编码比特的位置信息。
可选的，处理模块用于：当译码出错的编码比特的数量小于T时，将译码出错的编码比特作为至少一个编码比特；或者，当译码出错的编码比特的数量大于或等于T时，从译码出错的编码比特中选择T个编码比特，将T个编码比特作为至少一个编码比特。其中，T为预设的门限值。
可选的，第二指示信息中还包括指示位；当译码出错的编码比特的数量小于T时，指示位的取值为第一值；当译码出错的编码比特的数量大于或等于T时，指示位的取值为第二值；其中，第一值与第二值不同。
可选的，T取使得成立的最大值，其中N为第二指示信息的信息比特长度，k为第一编码比特序列中信息位的个数。
第十方面，提供一种通信装置，包括用于执行如第四方面或第四方面任一种可能的设计中所述的方法的模块。
示例性的，装置包括：
收发模块，用于接收第三待译码序列，第三待译码序列为发送端发送的第三编码比特序列经由信道传输后形成的序列；
处理模块，用于对第三待译码序列进行译码，得到第一译码结果；
若译码失败，收发模块，还用于发送第一译码结果；接收第二指示信息，第二指示信息中包括第三编码比特序列中的至少一个编码比特的位置信息；
处理模块，还用于根据第二指示信息和第一译码结果获取第二译码结果。
可选的，第二指示信息中还包括有指示位；
处理模块在根据第二指示信息和第一译码结果获取第二译码结果时，具体用于：当指示位为第一值时，根据第三编码比特序列中的至少一个编码比特的位置信息确定第一译码结果中出错的编码比特，校正出错的编码比特，得到第二译码结果；或者，当指示位为第二值时，根据第三编码比特序列中的至少一个编码比特的位置信息校正第一译码结果对应的先验信息，根据校正后的先验信息对第三编码比特序列重新译码，得到第二译码结果。
第十一方面，提供一种通信装置，包括用于执行如第五方面或第五方面任一种可能的设计中所述的方法的模块。
示例性的，装置包括：
处理模块，用于使用低密度奇偶校验码LDPC矩阵对待传输的信息编码比特进行编码，得到待传输的编码比特序列，待传输的编码比特序列包括一个或多个第一变量节点对应的编码比特和一个或多个第二变量节点对应的编码比特，第二变量节点对应的列重为1；
收发模块，用于发送一个或多个第一变量节点对应的编码比特；接收第三指示信息，第三指示信息用于指示一个或多个第二变量节点中的至少一个第二变量节点；
处理模块，还用于根据第三指示信息为一个或多个第二变量节点对应的编码比特分配发送功率；
收发模块，还用于按照分配好的发送功率发送一个或多个第二变量节点对应的编码比特。
可选的，第三指示信息中包括：第一信息，第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点；和/或，第二信息，第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点。
可选的，需要提高发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第一阈值范围内；需要降低发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第二阈值范围内；其中，第一阈值范围与第二阈值范围不同。
可选的，先验信息包括LLR或信道估计值；和/或，后验信息包括软值。
第十二方面，提供一种通信装置，包括用于执行如第六方面或第六方面任一种可能的设计中所述的方法的模块。
示例性的，装置包括：
收发模块，用于接收第四待译码序列，第四待译码序列为一个或多个第一变量节点对应的编码比特经由信道传输后形成的序列，一个或多个第一变量节点对应的编码比特包含于基于LDPC矩阵生成的编码比特序列中，基于LDPC矩阵生成的编码比特序列中还包含一个或多个第二变量节点对应的编码比特，第二变量节点对应的列重为1；
处理模块，用于使用LDPC矩阵对第四待译码序列进行译码；
若译码失败，处理模块还用于从一个或多个第二变量节点中确定出至少一个第二变量节点；
收发模块，还用于发送第三指示信息，其中第三指示信息用于指示至少一个第二变量节点。
可选的，第三指示信息中包括：第一信息，第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点；和/或，第二信息，第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点。
可选的，需要提高发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第一阈值范围内；需要降低发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第二阈值范围内；其中，第一阈值范围与第二阈值范围不同。
可选的，先验信息包括LLR或信道估计值；和/或，后验信息包括软值。
第十三方面，提供一种通信装置，包括：至少一个处理器；以及与至少一个处理器通信连接的通信接口；至少一个处理器通过执行存储器存储的指令，使得装置通过通信接口执行如第一方面或第一方面任一种可能的设计或第二方面或第二方面任一种可能的设计或第三方面或第三方面任一种可能的设计或第四方面或第四方面任一种可能的设计或第五方面或第五方面任一种可能的设计或第六方面或第六方面任一种可能的设计中所述的方法。
可选的，该装置还包括存储器，存储器与至少一个处理器相连，存储器存储有可被至少一个处理器执行的指令。
第十四方面，提供一种通信装置，包括：输入输出接口和逻辑电路；所述输入输出接口用于输出编码比特序列或输入待译码序列，所述逻辑电路用于执行如第一方面或第一方面任一种可能的设计或第二方面或第二方面任一种可能的设计或第三方面或第三方面任一种可能的设计或第四方面或第四方面任一种可能的设计或第五方面或第五方面任一种可能的设计或第六方面或第六方面任一种可能的设计中所述的方法。
第十五方面，提供一种计算机可读存储介质，包括程序或指令，当程序或指令在计算机上运行时，使得如第一方面或第一方面任一种可能的设计或第二方面或第二方面任一种可能的设计或第三方面或第三方面任一种可能的设计或第四方面或第四方面任一种可能的设计或第五方面或第五方面任一种可能的设计或第六方面或第六方面任一种可能的设计中所述的方法被执行。
第十六方面，提供一种计算机程序产品，包括指令，当指令在计算机上运行时，使得如第一方面或第一方面任一种可能的设计或第二方面或第二方面任一种可能的设计或第三方面或第三方面任一种可能的设计或第四方面或第四方面任一种可能的设计或第五方面或第五方面任一种可能的设计或第六方面或第六方面任一种可能的设计中所述的方法被执行。
附图说明
图1为本申请实施例适用的一种通信系统的示意图；
图2为发送端和接收端的通信流程示意图；
图3为Raptor-like LDPC码的示意图；
图4为一种可能的IR-HARQ方案的示意图；
图5A为本申请实施例提供的一种信息传输方法的流程示意图；
图5B、图5C、图5D为图5A所示方案的译码性能评估图；
图6A为本申请实施例提供的另一种信息传输方法的流程示意图；
图6B、图6C为图6A所示方案的译码性能评估图；
图7A为本申请实施例提供的另一种信息传输方法的流程示意图；
图7B为图7A所示方案的译码性能评估图；
图8为本申请实施例提供的一种通信装置800的结构示意图；
图9为本申请实施例提供的另一种通信装置900的结构示意图；
图10为本申请实施例提供的另一种通信装置1000的结构示意图。
具体实施方式
本申请实施例中的术语“系统”和“网络”可被互换使用。“至少一个”是指一个或者多个，“多个”是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B的情况，其中A,B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以下至少一项(个)”或其类似表达，是指的这些项中的任意组合，包括单项(个)或复数项(个)的任意组合，例如a、b或c中的至少一项(个)，可以表示：a，或b，或c，或a和b，或b和c，或a和c，或a和b和c。
以及，除非有相反的说明，本申请实施例提及“第一”、“第二”等序数词是用于对多个对象进行区分，不用于限定多个对象的顺序、时序、优先级或者重要程度。例如，第一优先级准则和第二优先级准则，只是为了区分不同的准则，而并不是表示这两种准则的内容、优先级或者重要程度等的不同。
本申请实施例的技术方案可以应用于各种通信系统，例如：窄带物联网系统(Narrow Band-Internet of Things，NB-IoT)、全球移动通信系统(Global System for Mobile Communications，GSM)、增强型数据速率GSM演进系统(Enhanced Data rate for GSM Evolution，EDGE)、宽带码分多址系统(Wideband Code Division Multiple Access，WCDMA)、码分多址2000系统(Code Division Multiple Access，CDMA2000)、时分同步码分多址系统(Time Division-Synchronization Code Division Multiple Access，TD-SCDMA)，长期演进系统(Long Term Evolution，LTE)、第五代(5th generation，5G)通信系统(包括5G通信系统的三大应用场景：增强移动宽带(Enhanced Mobile Broadband，eMBB)、超可靠低时延通信(Ultra Reliable Low Latency Communication，URLLC)和增强型机器类通信(Enhanced evolved Machine Type Communications，eMTC))、第六代(6th generation，6G)通信系统或未来的其他演进系统、或其他各种无线通信系统等，只要该通信系统中存在HARQ需求，则均可以采用本申请实施例的技术方案。
示例性地，参见图1，为本申请实施例适用的一种通信系统的示意图。通信系统包括网络设备101和终端设备102。其中，网络设备101可以向终端设备102发送数据，终端设备102收到数据后可以向网络设备101发送反馈信息；终端设备102也可以向网络设备101发送数据，网络设备101收到数据后可以向终端设备102发送反馈信息。当网络设备101向终端设备102发送数据时，网络设备101为发送端(或者说发送设备)，终端设备102为接收端(或者说接收设备)；当终端设备102向网络设备101发送数据时，终端设备102为发送端(或者说发送设备)，网络设备101为接收端(或者说接收设备)。
其中，终端设备，包括向用户提供语音和/或数据信号连通性的设备，具体的，包括向用户提供语音的设备，或包括向用户提供数据信号连通性的设备，或包括向用户提供语音和数据信号连通性的设备。例如可以包括具有无线连接功能的手持式设备、或连接到无线调制解调器的处理设备。该终端设备可以包括用户设备(user equipment，UE)、无线终端设备、移动终端设备、设备到设备通信(device-to-device，D2D)终端设备、车到一切(vehicle to everything，V2X)终端设备、机器到机器/机器类通信(machine-to-machine/machine-type communications，M2M/MTC)终端设备、物联网(internet of things，IoT)终端设备、订户单元(subscriber unit)、订户站(subscriber station)，移动站(mobile station)、远程站(remote station)、接入点(access point，AP)、远程终端设备(remote terminal)、接入终端设备(access terminal)、用户终端设备(user terminal)、用户代理(user agent)、或用户装备(user device)、卫星、无人机、气球或飞机等。例如，可以包括移动电话(或称为“蜂窝”电话)，具有移动终端设备的计算机，便携式、袖珍式、手持式、计算机内置的移动装置等。例如，个人通信业务(personal communication service，PCS)电话、无绳电话、会话发起协议(session initiation protocol，SIP)话机、无线本地环路(wireless local loop，WLL)站、个人数字助理(personal digital assistant，PDA)、等设备。还包括受限设备，例如功耗较低的设备，或存储能力有限的设备，或计算能力有限的设备等。例如包括条码、射频识别(radio frequency identification，RFID)、传感器、全球定位系统(global positioning system，GPS)、激光扫 描器等信息传感设备。作为示例而非限定，在本申请实施例中，该终端设备还可以是可穿戴设备。可穿戴设备也可以称为穿戴式智能设备或智能穿戴式设备等，是应用穿戴式技术对日常穿戴进行智能化设计、开发出可以穿戴的设备的总称。而如上介绍的各种终端设备，如果位于车辆上(例如放置在车辆内或安装在车辆内)，都可以认为是车载终端设备，车载终端设备例如也称为车载单元(on-board unit，OBU)。
网络设备，例如包括接入网(access network，AN)设备，例如基站(例如，接入点)，可以是指接入网中在空口通过一个或多个小区与无线终端设备通信的设备，或者例如，一种车到一切(vehicle-to-everything，V2X)技术中的网络设备为路侧单元(road side unit，RSU)。网络设备可以包括长期演进(long term evolution，LTE)系统或高级长期演进(long term evolution-advanced，LTE-A)中的演进型基站(NodeB或eNB或e-NodeB，evolutional Node B)，或者也可以包括演进的分组核心网络(evolved packet core，EPC)、第五代移动通信技术(the 5th generation，5G)、新空口(new radio，NR)系统(也简称为NR系统)中的下一代节点B(next generation node B，gNB)或者也可以包括云接入网(cloud radio access network，Cloud RAN)系统中的集中式单元(centralized unit，CU)和分布式单元(distributed unit，DU)，卫星、无人机、气球或飞机等，本申请实施例并不限定。
可以理解的是，图1是以网络设备和终端设备通信为例，本申请实施例还可以应用于网络设备与网络设备通信、终端设备和终端设备通信等其它场景，本申请不做限制。
参见图2，为发送端和接收端的通信流程示意图。
一般地，由信源产生的数据比特流要经过以下几个步骤达到信宿：首先在发送端，信源为产生信息的源头，如人、机器、自然界的物体等，其输出可以是模拟信号或数字信号；信源编码将这种模拟信号或数字信号转换成二进制数字序列(即信息比特序列)；信道编码在二进制数字序列中引入一些冗余的二进制信息序列(得到编码比特序列)，用于在接收端克服传输过程中信道噪声和干扰造成的误差；调制处理用于将二进制序列转换成波形信号，发送至信道。波形信号经过信道传输后，在接收端，解调即将波形信号还原为二进制信号(即待译码序列)；信道解码即根据信道编码规则和接收数据的冗余，还原信息比特序列；信源解码是根据信源编码的规则还原原始信号。
当然，以上过程仅为一种示例，实际的通信流程还可以包括其它处理，例如交织(可以发生在信道编码之后、调制之前，交织的作用是改变比特流的结构充分发散这些误差，使得长串比特误差变成短串误差)、解交织(发生在解调之后、信道译码之前，解交织是与交织互逆的操作，作用是将分散的数据集中到同一个信道编码的码字，以减少突发错误对信道编码的影响)。
本申请实施例中的信道编码方案(后续简称“编码”)可以有多种，例如低密度奇偶校验码(Low Density Parity Check Code，LDPC)、极化码(Polar)等，本申请实施例不做限制。
为了便于描述，本文主要以LDPC编码方案为例。给定信息比特序列s＝[s(0)，s(2)，…，s(K-1)]，LDPC编码就是确定M个校验比特p＝[p(0)，p(1)，…，p(M-1)]，得到的LDPC码(即编码比特序列)为c＝[sp]，可见，LDPC编码得到的编码比特序列中包括编码比特序列和校验比特序列。其中，一个码长等于N，信息比特序列的长度等于K的线性分组码可以由其校验矩阵唯一确定。LDPC码的校验矩阵又可称为LDPC矩阵，校验矩阵的每一列对应一个变量节点，对应编码比特序列中的一个比特位；校验矩阵中的每一行对应一个 校验节点。
通信系统中，接收端在收到发送端发送的数据之后，只反馈1比特信息(ACK/NACK)，用于指示接收端是否译码成功。当发送端收到ACK时，则停止发送。当发送端收到NACK时，常见的有两种方式：①重发之前的数据包(即简单重传(Chase Combining))；②发送新的数据包，接收端将之前的数据包和新的数据包等效构造成一个嵌套长码(这种方式称为增量冗余-混合自动重传请求(Incremental Redundancy-HybridAutomatic Repeat reQuest，IR-HARQ)。对于LDPC码、Polar码等来说，IR-HARQ方案的性能较好。
以下以Raptor-like结构的LDPC码(简称Raptor-like LDPC码)为例对IR-HARQ方案进行说明。
参见图3，Raptor-like LDPC码的校验矩阵包括A、B、C、O和I五部分，其中，A是最高码率校验矩阵中对应信息比特序列的矩阵分块。B是最高码率校验矩阵中对应校验比特序列的矩阵分块，B所对应的矩阵结构通常是下三角结构或者是三列重与双对角线的组合结构。C是最高码率校验矩阵扩展出的矩阵分块，对应信息比特序列以及最高码率校验矩阵中对应的校验比特序列。其中，O是零矩阵，I是对角线为1而其余部分为0的矩阵，O和I对应校验比特序列。采用Raptor-like LDPC码矩阵对信息数据进行编码得到的比特序列分段为信息比特序列列重大于1的校验比特以及列重为1的校验比特其中，所述列重为1的校验比特是指校验矩阵中列重为1的列对应的校验比特序列。所述列重大于1的校验比特是指校验矩阵中列重大于1的列对应的校验比特序列。
IR-HARQ方案中，重传的编码比特为I部分中的校验比特(重传的编码比特的列重为1)。I部分对应的变量节点可称为Raptor-like节点，对应的列重为1。
例如，参见图4，为一种可能的IR-HARQ方案的示意图。
虚线框内的变量节点对应于初传时的编码比特(简称初传部分)，虚线框外的变量节点对应于重传时的编码比特(简称重传部分)。初传部分可以单独作为一个编码，初传部分可以与重传部分可以一起合并作为一个更长的编码。其中，重传部分的编码比特对应的是Raptor-like节点，即列重为1的变量节点，只关联一个校验方程。当初传译码失败时，发送端发送这些Raptor-like节点的编码比特。在译码过程中，接收端对初传和重传过程中接收的待译码序列进行合并译码，使用比初传更大的校验矩阵，更多的校验方程进行纠错，达到长码的纠错性能。
可以理解的是，上述IR-HARQ方案中，重传过程发送的编码比特与初传过程发送的编码比特不同(即重传过程中发送的编码比特全部都是首次发送的，即未被发送过的)。
另外，实际中，重传不限于一次，可以是多次(例如I部分中不同的校验比特可以分多次发送)，接收端每次都对已接收到的所有译码序列进行合并译码，译码失败之后继续下一次重传过程，直至达到最大重传次数或译码成功。
通过以上描述可以看出，反馈信息为1比特的设计，即接收端只反馈1比特的NACK或ACK，不管接收端的译码出错情况如何，发送端在收到NACK之后未能基于译码出错情况对重传进行针对性的设计，因此无法充分发挥接收端的纠错检错能力，导致接收端的译码纠错性能较差。
鉴于此，提供本申请实施例技术方案，接收端在译码失败时，可以反馈更多的信息，使得发送端根据这些信息针对性地进行重传，进而提升接收端的译码纠错性能。
参见图5A，为本申请实施例提供的一种信息传输方法的流程示意图，包括：
S501、发送端根据待传输的编码比特序列，发送第一编码比特序列，其中待传输的编码比特序列包括第一编码比特序列；相应的，接收端接收第一待译码序列。
发送端通过对待传输的信息比特进行编码，生成待传输的编码比特序列。其中，发送端使用的编码方案包括但不限于是LDPC、Polar等类型。为了便于描述，本实施例以Raptor-like LDPC编码方案为例，即发送端在获取待传输的信息比特序列之后，基于Raptor-like LDPC矩阵生成待传输的编码比特序列。
在本申请实施例中，发送端根据待传输的编码比特序列第一次发送编码比特序列的过程为初传过程，如果初传失败，发送端再次发送编码比特序列，发送端在初传之后发送编码比特序列的过程为重传过程。其中，重传的次数可以是一次或多次，本申请不做限制。
其中，第一编码比特序列，可以是初传过程中发送的编码比特序列，也可以是重传过程中发送的编码比特序列，本申请不做限制。
示例性的，设发送端最多进行t次重传，第一编码比特序列可以为发送端初传的编码比特序列，或者为第q-1次重传的编码比特序列，q为大于1且小于或等于t的正整数。
或者，另一种描述：设发送端最多进行t次重传，加上初传，发送端最多发送t+1次编码比特序列，其中第一编码比特序列可以为发送端第k-1次发送的编码比特序列，k为大于1且小于或等于t+1的正整数。
相应的，接收端可以多次接收待译码序列。具体来说，接收端针对发送端每一次发送的编码比特序列，都对应接收一次待译码序列。其中，第一待译码序列对应第一编码比特序列，即第一待译码序列为发送端根据待传输的编码比特序列发送的第一编码比特序列经由信道传输后形成的序列。
可以理解的，发送端发送第一编码比特序列之前，还可以对第一编码比特序列进行调制等其它处理，第一编码比特序列被转换成波形信号后，被发射至到信道(或者说载波)进行传输。波形信号在传输过程中，由于路径损耗、噪声干扰等影响，会产生一定程度的变形，因此接收端接收到的波形信号与发送端发送的波形信号可以有差别。相应的，接收端收到波形信号之后，对其进行解调等处理，得到与第一编码比特序列对应的第一待译码序列。为了便于描述，本文将上述过程描述为发送端发送第一编码比特序列和接收端接收第一待译码序列。
S502、接收端对第一待译码序列进行译码；若译码失败，接收端确定第一指示信息。
具体的，接收端采用与发送端编码方案相对应的译码方案对第一待译码序列进行译码，例如，使用Raptor-like LDPC矩阵对第一待译码序列进行迭代译码。
可以理解的，若第一待译码序列是初传过程中收到的待译码序列(即第一编码比特序列是初传过程中发送的编码比特序列)，则接收端可以直接对第一待译码序列进行译码，若第一待译码序列是重传过程中收到的待译码序列(即第一编码比特序列是重传过程中发送的编码比特序列)，则接收端可以将本次收到的第一带待译码序列和之前收到的其它待译码序列进行合并译码。
若译码成功，例如cHT＝0(其中c表示译码码字，H表示Raptor-like LDPC矩阵)，则停止译码。
应理解，cHT＝0是译码成功的必要不充分条件，即cHT＝0仅为一种示例，实际译码成功还需要满足其它判断条件，本申请不做限制。
可选的，接收端还可以发送ACK，用于以指示译码成功。
若译码失败，例如cHT≠0，则接收端确定第一指示信息。
应理解，cHT≠0仅为一种示例，实际还可以有其它原因导致译码失败，本申请不做限制。
第一指示信息可以包括待传输的编码比特序列中已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息。其中，第一指示信息中指示的编码比特(即所述编码比特序列中已被发送过的至少一个编码比特)，可以理解为接收端期望发送端在下一次传输过程中再次发送的编码比特。
在本申请实施例中，已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息可以是已被发送过的至少一个编码比特在待传输的编码比特序列中的位置的索引值(或者说至少一个编码比特在待传输的编码比特序列中的位置标号)。
当然，也可以是与已被发送过的至少一个编码比特在待传输的编码比特序列中的位置相关的其它信息，本申请不做限制。一种可能的设计中，可以对待传输的编码比特序列对应的资源段进行分段，例如划分为多个资源子段，每个资源子段包括一个或多个连续的资源单元，已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息可以是已被发送过的至少一个编码比特对应的至少一个资源子段的指示信息，这样，可以减少接收端的反馈量，节省资源开销。
作为一种示例，资源段可以是一段连续的时间，例如资源单元为一个时隙，则资源子段可以是连续的几个时隙，资源段则是比资源子段更长的一段时间(如一个或多个连续的帧)。
作为一种示例，资源段可以是一段连续的子载波，例如资源单元为一个子载波，则资源子段可以是连续的几个子载波，资源段则是比资源子段更长的一段连续的子载波(如一个或多个连续的载波)。
作为一种示例，资源段还可以是类似于LDPC码或Polar码等中一段的连续子信道，例如资源单元为一个子信道，则资源子段可以是连续的几个子信道，资源段则是比资源子段更长的一段连续的子信道(如一个或多个连续的信道)。
当然，以上几种仅为示例，实际应用中还可以有其它方式来定义资源单元、资源段、资源子段，本申请不做限制。
在具体实现时，接收端可以根据译码过程中使用的先验信息或后验信息选取上述已被发送过的至少一个编码比特。
一种可能的设计中，接收端获取与第一待译码序列对应的对数似然比(Log-Likelihood-Ration，LLR序列)，LLR序列中的LLR与待传输的编码比特序列中的编码比特相对应。接收端从LLR序列中确定出幅值较小的前n″k个LLR，其中n″k为正整数，其中n″k个LLR对应的n″k个编码比特为发送端在下一次(如第k次)发送过程中能够发送的已被发送过的编码比特的数量(即第二编码比特序列中包含的待传输的编码比特序列中已被发送过的编码比特的数量)；接收端根据n″k个LLR对应的n″k个编码比特在待传输的编码比特序列中的位置确定第一指示信息。例如，第一指示信息包括n″k个编码比特在待传输的编码比特序列中的位置的索引值。
一种可能的设计中，接收端根据获取与第一待译码序列对应的信道估计结果，信道估计结果中的信道估计值(可以理解的是，信道估计值本身是h，为复数，文本中所指的信 道估计值其实是h的模，即|h|)与待传输的编码比特序列中的编码比特相对应。接收端根据信道估计结果确定待传输的编码比特序列对应的资源段中各个资源子段对应的信道估计均值；接收端从待传输的编码比特序列对应的资源段中确定出信道估计均值较小M个资源子段；其中，M为正整数；接收端根据M个资源子段确定第一指示信息。例如，第一指示信息包括M个资源子段的信息，具体例如M个资源子段的索引值。可以理解的，设Δ为资源段的分段间隔(即每个资源子段包含的资源单元的数量)，设每个资源单元对应的编码比特数量为a，则第一指示信息可以指示的编码比特数量为a×Δ×M。本申请a的取值不做限制，例如a＝2。
示例性的，设初传码长N0，最多进行t次反馈，总发送码长N，设经过前k-1次发送的总编码比特数为Nk-1，Nk-1中包括N′k-1个首次发送的编码比特，以及N″k-1个重复发送的编码比特(Nk-1＝N′k-1+N″k-1)；经过k-1次发送后的对数似然比为在第k次发送中要发送nk个编码比特，设资源段的分段间隔为Δ，第i个资源子段的信道估计均值为根据信道估计均值选取个资源子段的信息反馈给发送端。
可以理解的，以上是以第二编码比特序列中全部是已被发送过的编码比特为例。如果第二编码比特序列中还包括未被发送过的编码比特，则可以将中的nk替换为n″k，n″k为第k次发送过程中发送端能够发送的已被发送过的编码比特的数量。
S503、接收端发送第一指示信息，相应的，发送端接收第一指示信息。
可选的，接收端还发送NACK，以指示接收端译码失败。其中，NACK和第一指示信息可以承载于同一个消息中，也可以分别承载于不同的消息中，本申请不做限制。
S504、发送端根据第一指示信息发送第二编码比特序列，其中待传输的编码比特序列包括第二编码比特序列；相应的，接收端接收第二待译码序列，其中第二待译码序列为发送端根据第一指示信息发送的第二编码比特序列经由信道传输后形成的序列。
其中，第二编码比特序列中包括：待传输的编码比特序列中已被发送过的至少一个编码比特，和/或，待传输的编码比特序列中未被发送过的至少一个编码比特。
可以理解的是，这里的第二编码比特序列，为发送端发送第一编码比特序列之后接着发送的第一个编码比特序列，即第一编码比特序列和第二编码比特序列中间没有其他编码比特序列。
示例性的，设发送端最多进行t次重传，第一编码比特序列为发送端初传的编码比特序列，第二编码比特序列为发送端第一次重传的编码比特序列；或者，第一编码比特序列为发送端第q-1次重传的编码比特序列，第二编码比特序列为发送端第q次重传的编码比特序列，q为大于1且小于或等于t的正整数。
或者，另一种描述：设发送端最多进行t次重传为例，加上初传，发送端最多发送t+1次编码比特序列，第一编码比特序列为发送端第k-1次发送的编码比特序列，第二编码比特序列为发送端第k次发送的编码比特序列，k为大于1且小于或等于t+1的正整数。
在上文图4所示的IR-HARQ方案中，在只有1比特的反馈信息的情况下，接收端译码失败后只反馈NACK，发送端发送的重传部分中的编码比特全部都是待传输的编码比特序列中未被发送过的编码比特。
而在本实施例中，由于接收端反馈了更多的反馈信息，即第一指示信息，所以发送端可以根据第一指示信息进行针对性的重传，使得第二编码比特序列中可以包括待传输的编码比特序列中已被发送过的至少一个编码比特，进而充分发挥接收端的纠错检错能力，提升接收端译码纠错的性能。
可以理解的，若第一编码比特序列、第二编码比特序列分别为发送端第k-1次和第k次发送的编码比特序列，且k大于2时，若第二编码比特序列中包括待传输的编码比特序列中已被发送过的至少一个编码比特，则该已被发送过的至少一个编码比特可以包括：
发送端在第k-1次发送的编码比特序列(第一编码比特序列)中的编码比特，和/或，
发送端在第k-1次之前发送的编码比特序列中的编码比特。
以k＝3为例：第二编码比特序列为发送端根据待传输的编码比特序列第3次发送的编码比特序列，若第二编码比特序列中包括待传输的编码比特序列中已被发送过的至少一个编码比特，则该已被发送过的至少一个编码比特，可以是发送端根据待传输的编码比特序列第2次发送的编码比特序列中的编码比特，也可以是发送端根据待传输的编码比特序列第1次发送的编码比特序列中的编码比特，还可以一部分是第2次发送的编码比特序列中的编码比特，另一部分是第1次发送的编码比特序列中的编码比特。
当然，在具体实现时，第二编码比特序列中也可以包括待传输的编码比特序列中未被发送过的至少一个编码比特，或者既包括待传输的编码比特序列中已被发送过的至少一个编码比特又包括待传输的编码比特序列中未被发送过的至少一个编码比特。
其中，第二编码比特序列中已被发送过的编码比特的占比可以根据系统资源配置情况来确定。
一种可能的设计中，第二编码比特序列中已被发送过的编码比特的占比不超过预设值δ。
在具体实现时，预设值δ为固定值。例如，设发送端最多进行t次重传，加上初传，发送端最多发送t+1次编码比特序列，t+1次中每一次发送的编码比特序列中已被发送过的编码比特的占比都不超过预设值δ。
在具体实现时，预设值δ的取值也可以动态变化。
例如，设发送端最多进行t次重传，加上初传，发送端最多发送t+1次编码比特序列，其中第一编码比特序列为发送端第k-1次发送的编码比特序列，第二编码比特序列为发送端第k次发送的编码比特序列，设至多t+1次发送过程中发送端重复发送的编码比特的占比不超过δ′，则发送端在第k次发送过程中发送的第二编码比特序列中已被发送的编码比特的占比δ，可以根据δ′、前k-1次发送过程中重复发送的编码比特的数量N″k-1、前k-1次发送过程中发送的编码比特的数量Nk-1、以及第k次发送过程中能够发送的编码比特总数nk确定：
可以理解的，若δ′(Nk-1+nk)-N″k-1小于0，则δ取0。
相应的，发送端可以根据δ以及第k次发送过程中能够发送的编码比特总数nk确定第k次发送过程中能够发送的已被发送过的编码比特的数量n″k：n″k≤δ′×nk。
如此，可以保证针对待传输编码比特的所有发送过程(如至多t+1次发送过程)中首次发送的编码比特(即除了已被发送过的编码比特之外的其它编码比特)和非首次发送的编码比特(即已被发送过的编码比特)有合理的占比分配(例如最多t+1次发送过程中重 复发送的编码比特的占比不超过δ′)，避免已被发送过的编码比特的占比过少导致译码纠错性能差的问题，以及避免已被发送过的编码比特的占比过多导致占用较多传输资源的问题。
另一种可能的设计中，也可以直接根据前k-1次发送的情况、第k次发送过程中能够发送的编码比特总数nk、以及δ′确定第k次发送过程中已被发送过的编码比特的数量(即第二编码比特序列中已被发送过的至少一个编码比特的数量)n″k：
其中，n″k为第二编码比特序列(即第k次发送的编码比特序列)中包括的待传输的编码比特序列中已被发送过的至少一个编码比特的数量；Nk-1表示发送端在发送第二编码比特序列之前发送的编码比特的数量(即前k次)，N″k-1表示发送端在发送第二编码比特序列之前重复发送的编码比特的数量；nk为第二编码比特序列中包括的编码比特的数量；δ′为发送端根据待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比对应的门限值，发送端根据待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比不超过δ′。
如此，可以保证针对待传输编码比特的所有发送过程中首次发送的编码比特和非首次发送的编码比特有合理的占比分配(例如重复发送的编码比特的占比不超过δ′)，避免已被发送过的编码比特的占比过少导致译码纠错性能差的问题，以及避免已被发送过的编码比特的占比过多导致占用较多传输资源的问题。
发送端在确定出第k次发送过程中要发送的n″k个已被发送过的编码比特和未被发送过的n′k个编码比特之后(其中n′k＝nk-n″k)，即得到第二编码比特序列，然后就可以发送第二编码比特序列。
一种可能的设计中，δ′大于或等于预设门限值。在具体实现时，该预设门限值可以与初传码率成反比。如此，可以进一步提高接收端的译码纠错性能。
S505、接收端根据第二待译码序列，重新译码。
具体的，若第一编码比特序列为初传的编码比特序列(例如第二编码比特序列为发送端第k-1次发送的编码比特序列，k＝2)，则接收端将第二编码比特序列和第一编码比特序列进行合并，对合并后的编码比特序列进行迭代译码。
若第一编码比特序列不是初传的编码比特序列，即在第一编码比特序列之前还有其它编码比特序列(例如第二编码比特序列为发送端第k-1次发送的编码比特序列，k>2)，则接收端将第一编码比特序列、第二编码比特序列以及之前接收到的其它编码比特序列进行合并(即合并前k次接收到的所有编码比特序列)，对合并后的编码比特序列进行迭代译码。例如得到新的LLR序列，根据新的LLR进行译码。
进一步的，如果重新译码失败，且未达到最大重传次数t，则接收端可以继续按照S502介绍的方法，确定出新的指示信息，并将新的指示信息发送给发送端，使得发送端根据新的指示信息再次(即第k+1次)发送编码比特序列，如此循环，直至接收端译码成功或者达到最大重传次数为止。
上述方案，接收端在译码失败后，可以发送第一指示信息以指示发送端已发送过的至 少一个编码比特的位置信息，使得发送端在重传时可以发送这些已发送过的至少一个编码比特，可以提升接收端的译码纠错性能。参见图5B，为衰落(Fading)信道，正交相移键控(Quadrature Phase Shift Keying，QPSK)调制方式下，接收端基于LLR反馈第一指示信息的方式下，接收端对LDPC码进行译码的性能评估图。参见图5C和图5D，为Fading信道，QPSK调制方式下，接收端基于信道估计值反馈第一指示信息的方式下，接收端对LDPC码进行译码的性能评估图。在图5B、图5C和图5D中，横坐标表示的是信噪比(Es/N0)，纵坐标表示的是译码出错率(BLock Error Rate，BLER)。
参见图6A，为本申请实施例提供的另一种信息传输方法的流程示意图，包括：
S601、发送端发送第三编码比特序列；相应的，接收端接收第三待译码序列，第三待译码序列为发送端发送的第三编码比特序列经由信道传输后形成的序列。
发送端通过对待传输的信息比特进行编码，生成待传输的编码比特序列。其中，发送端使用的编码方案包括但不限于是LDPC、Polar等编码方案。
发送端根据待传输的编码比特序列第一次发送编码比特序列的过程为初传过程，初传过程之后发送编码比特序列的过程为重传过程。其中，重传的次数可以是一次或多次，本申请不做限制。
第三编码比特序列，可以是初传过程中发送的编码比特序列，也可以是重传过程中发送的编码比特序列，本申请不做限制。
示例性的，设发送端最多进行t次重传，加上初传，发送端最多发送t+1次编码比特序列，其中第三编码比特序列可以为发送端第k-1次发送的编码比特序列，k为大于1且小于或等于t+1的正整数。
相应的，接收端可以多次接收待译码序列。具体来说，接收端针对发送端每一次发送的编码比特序列，都对应接收一次待译码序列。其中，第三待译码序列对应第三编码比特序列，即第三待译码序列为发送端根据待传输的编码比特序列发送的第三编码比特序列经由信道传输后形成的序列。
可以理解的，发送端发送第三编码比特序列之前，还可以对第三编码比特序列进行调制等其它处理，第三编码比特序列被转换成波形信号后，被发射至到信道(或者说载波)进行传输。波形信号在传输过程中，由于路径损耗、噪声干扰等影响，会产生一定程度的变形，因此接收端接收到的波形信号与发送端发送的波形信号可以有差别。相应的，接收端收到波形信号之后，对其进行解调等处理，得到与第三编码比特序列对应的第三待译码序列。为了便于描述，本文将上述过程描述为发送端发送第三待译码序列和接收端接收第三待译码序列。
S602、接收端对第三待译码序列进行译码，得到第一译码结果。
具体的，接收端采用与发送端编码方案相对应的译码方案对第三待译码序列进行译码，例如，发端使用LDPC矩阵对待传输的信息比特序列编码生成第三编码比特序列，则接收端使用该LDPC矩阵对第三待译码序列进行迭代译码。
若译码成功，例如cHT＝0(其中c表示译码码字，H表示LDPC矩阵)，则停止译码。
应理解，cHT＝0是译码成功的必要不充分条件，cHT＝0仅为一种示例，实际译码成功还需要满足其它判断条件，本申请不做限制。
可选的，接收端还可以发送ACK，用于以指示译码成功。
若译码失败，例如cHT≠0，则接收端执行S603。应理解，cHT≠0仅为一种示例，实际还可以有其它原因导致译码失败，本申请不做限制。
S603、若译码失败，接收端发送第一译码结果；相应的，发送端接收第一译码结果。
可选的，接收端可以将第一译码结果压缩之后发送给发送端，以减少资源开销。进一步可选的，接收端可以只发送第一译码结果中的信息比特，以减少资源开销。例如，发送端通过信源信道联合编码方案(Joint Source Channel Coding Scheme，JSCC)的方法将第一译码结果中的信息比特发送给发送端。
可选的，接收端还可以发送NACK，用于指示译码失败。
S604、发送端根据第一译码结果和第三编码比特序列中的信息比特，从第三编码比特序列中确定出译码出错的编码比特；发送端根据译码出错的编码比特确定第三编码比特序列中的至少一个编码比特。
可以理解的，第一译码结果中的信息比特的位置和第三编码比特序列中的信息比特的位置一一对应，若对应位置上的信息比特不同，则认为该位置上的编码比特译码出错。
发送端通过对比第一译码结果中的信息比特和第三编码比特序列中的信息比特，确定出所有译码出错的编码比特；然后根据译码出错的编码比特确定第三编码比特序列中的至少一个编码比特(或者说确定第三编码比特序列中的至少一个编码比特的位置)。
其中，由于译码主要的目的是还原信息比特，因此译码出错的编码比特也可以者称为译码出错的信息比特、译码出错的信息位等。
一种可能的设计中，例如系统资源较多的情况下，后续发送端发送的第二指示信息的长度足够大(例如，无论译码出错的编码比特数量有多少，第二指示信息都可以指示所有译码出错的编码比特的位置信息)，则可以将所有译码出错的编码比特作为该至少一个编码比特。
另一种可能的设计中，发送端根据译码出错的编码比特的数量确定该至少一个编码比特。例如，系统中资源有限的情况下，第二指示信息的长度有限(例如，如果编码比特数量较多，第二指示信息无法指示所有译码出错的编码比特的位置信息)，则可以设置一个阈值T。当译码出错的编码比特的数量小于T时，发送端将译码出错的编码比特作为至少一个编码比特；或者，当译码出错的编码比特的数量大于T时，发送端从译码出错的编码比特中选择T个编码比特，将T个编码比特作为至少一个编码比特。对于译码出错的编码比特的数量等于T的情况，则可以采用以上任意一种方式确定至少一个编码比特，本申请不做限制。其中，T为预设的门限值。
换而言之，当译码出错的信息位较少时，发送端可以直接指示这些译码出错的信息位的位置，使得接收端直接纠正这些错误；当译码出错的信息位较多时，发送端会指示T个译码出错的编码比特的位置，使得接收端纠正这T个信息位的先验信息的错误，并且使用纠正后的先验信息来重新译码。
可选的，发送端可以根据译码出错的编码比特对应的度数、吸收集的归属度、停止集的归属度等指标，从译码出错的编码比特中选择T个编码比特。
例如，按照度数从小到大的顺序(或者吸收集的归属度从大到小的顺序，或者停止集的归属度从大到小的顺序)对译码出错的编码比特进行排序，选择排在前T位的编码比特。
可选的，T可以取使得成立的最大值，其中N为第二指示信息的信息比特长度(具体可根据系统可用资源确定，或者由协议规定，或者由发送端和接收端 约定)，k为第一编码比特序列中信息位(或者说信息比特)的个数。
一种可能的设计中，第二指示信息中还包括一个指示位；当译码出错的编码比特的数量小于T时，指示位的取值为第一值；当译码出错的编码比特的数量大于或等于T时，指示位的取值为第二值；其中，第一值与第二值不同。例如：第一值为0，第二值为1；或者，第一值为1，第二值为0。
示例性的，当译码出错的编码比特的数量大于或等于T时，发送端从译码出错的编码比特中选择T个编码比特，将选取的T个编码比特的位置信息进行信源编码，对应到至多N-1长的信息比特序列，并且添加一个指示位到末位，得到第二指示信息。
这样，接收端接收到第二指示信息之后，可以获知第二指示信息中携带的位置信息的具体情况，根据不同情况采用不同的处理策略，具体参见S605中的介绍。
S605、发送端发送第二指示信息，第二指示信息中包括至少一个编码比特的位置信息；相应的，接收端接收第二指示信息。
S606、接收端根据第二指示信息和第一译码结果获取第二译码结果。
一种可能的设计中，例如在系统资源较多的情况下(即无论译码出错的编码比特数量有多少，第二指示信息都可以指示所有译码出错的编码比特的位置信息)，例如，第二指示信息未携带指示位，则接收端可以根据第二指示信息直接确定第一译码结果中译码出错的编码比特，校正出错的编码比特(对译码出错的编码比特进行翻转)，得到第二译码结果。
另一种可能的设计中，例如在系统资源有限的情况下，例如，第二指示信息中还携带了指示位，则接收端可以根据指示位的不同取值，采用不同的方法获取第二译码结果：
当指示位为第一值时，接收端根据第三编码比特序列中的至少一个编码比特的位置信息确定第一译码结果中出错的编码比特，校正出错的编码比特(对译码出错的编码比特进行翻转)，得到第二译码结果；或者，
当指示位为第二值时，接收端根据第三编码比特序列中的至少一个编码比特的位置信息校正第一译码结果对应的先验信息(即接收端对第三待译码序列进行译码过程中获得的先验信息)，根据校正后的先验信息对第三编码比特序列重新译码，得到第二译码结果。
例如：根据第二指示信息指示的T个编码比特的位置信息，从第一译码结果对应的LLR序列(接收端对第三待译码序列进行译码过程中获得的LLR序列)中确定出这T个编码比特对应的LLR，如LLR(x)，其中x取遍T个编码比特中各个编码比特的位置的索引值；然后令LLR(x)＝-1*sign(vall(x))*Inf，其中Inf为用于指示最大幅值的符号，vall(x)为第一译码结果对应的软值，vall(x)＝LLR+∑c∈N(v)mc→v，其中c表示校验节点(或者校验方程)，v表示变量节点，mc→v表示校验节点发送给变量节点的信息，N(v)表示变量节点v所关联的所有校验方程的集合；然后根据新的LLR序列再次译码。
可选的，若S606再次译码失败，则接收端还可以将第二译码结果反馈给发送端，使得发送端再次确定译码出错的位置，并根据再次确定出的译码出错的位置发送新的指示信息，进而接收端可以再次获取新的译码结果，如此循环，直至接收端译码成功为止。
上述方案中，发送端可以针对性地指示译码出错的位置，使得接收端可以对译码结果进行纠错。相较于等效构造长码的方案(如图4所示)，可以有效提高接收端的译码纠错性能。例如，参见图6B和图6C，为加性高斯白噪声(Additive White Gaussion Noise，AWGN)信道，QPSK调制方式下，采用上述方案对LDPC码进行译码的性能评估图。在图6B、图 6C中，横坐标表示的是Es/N0，纵坐标表示的是BLER。
参见图7A，为本申请实施例提供的另一种信息传输方法的流程示意图，方法包括：
S701、发送端使用LDPC矩阵对待传输的信息编码比特进行编码，得到待传输的编码比特序列。
待传输的编码比特序列包括一个或多个第一变量节点对应的编码比特和一个或多个第二变量节点对应的编码比特。其中，第一变量节点为发送端先发送的编码比特对应的变量节点，第二变量节点为发送端在发送了第一变量节点对应的编码比特之后且收到接收端反馈的NACK之后发送的编码比特对应的变量节点。
其中，第二变量节点的列重为1，即在LDPC矩阵中，第二变量节点所在列中只有一个非0元素，即第二变量节点只关联一个校验方程。
以Raptor-like结构的LDPC矩阵为例，则第二变量节点可以是Raptor-like节点。例如，第一变量节点可以是图4中虚线框内的变量节点(对应于初传时的编码比特)，第二变量节点可以是虚线框外的变量节点(对应于重传时的编码比特)。可以理解的，该一个或多个第二变量节点可以是虚线框外的所有变量节点，也可以是虚线框外的部分变量节点，本申请不做限制。
S702、发送端发送一个或多个第一变量节点对应的编码比特；相应的，接收端接收第四待译码序列。
可以理解的，发送端在发送一个或多个第一变量节点对应的编码比特之前或之时，还未发送上述一个或多个第二变量节点对应的编码比特。即步骤S702中发送端发送的编码比特不包括上述一个或多个第二变量节点对应的编码比特。
其中，第四待译码序列为一个或多个第一变量节点对应的编码比特经由信道传输后形成的序列。关于信道传输的过程可以参考上文中第一编码比特序列、第二编码比特序列或第三编码比特序列等的信道传输过程，这里不再赘述。
S703、接收端使用LDPC矩阵对第四待译码序列进行译码；若译码失败，接收端从一个或多个第二变量节点中确定出至少一个第二变量节点。
其中，接收端从一个或多个第二变量节点中确定出至少一个第二变量节点，也可以描述为接收端从一个或多个第二变量节点的位置中确定出至少一个第二变量节点的位置，其中该位置是指至少一个第二变量节点在LDPC矩阵中的(或者说待传输的编码比特序列对应的)所有变量节点中的位置。例如，LDPC矩阵中每个变量节点都对应一个位置标号，则接收端可以从LDPC矩阵中的所有变量节点的位置标号中确定出该至少一个第二变量节点的位置标号。
接收端使用LDPC矩阵对第四待译码序列进行译码过程可以参考上文中第一待译码序列、第二待译码序列或第三待译码序列等的译码过程，这里不再赘述。
若译码成功，则停止译码。可选的，接收端发送ACK。
若译码失败，则接收端从一个或多个第二变量节点中确定出至少一个第二变量节点。
其中，该至少一个第二变量节点可以是需要提高发送功率的第二变量节点，也可以是需要降低发送功率的第二变量节点，或者包括需要提高发送功率的第二变量节点和需要降低发送功率的第二变量节点，本申请不做限制。
在本申请实施例中，可以根据各个第二变量节点关联的第一变量节点的先验信息和/ 或后验信息来评估第二变量节点的可靠度，其中，某个第二变量节点所关联的第一变量节点是指该个第二变量节点对应的校验方程中的第一变量节点。
具体来说，对于可靠度高的，可以降低其发送功率，对于可靠度低的，可以提高其发送功率。
一种可能的设计中，需要提高发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第一阈值范围内；需要降低发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第二阈值范围内；其中，第一阈值范围与第二阈值范围不同。例如，第一阈值范围是小于或等于阈值的范围，第二阈值范围为大于该阈值的范围。
一种可能的设计中，先验信息包括译码过程中产生的LLR或信道估计值；和/或，后验信息包括译码结束的软值。
以LLR和软值为例，且以选取需要降低发送功率的第二变量节点为例：
设发送端在初传之后最多进行t次重传，加上初传，至多进行t+1次发送，总发送码长是N，设经过前k-1次发送后的码长为Nk-1，k为大于1且小于或等于t+1的正整数，对数似然比为LLRk-1，在第k次发送中，接收端基于当前已接收到的编码比特(即第四待译码序列，对应一个或多个第一变量节点)，选取发送端下一次会进行发送N′k个编码比特对应的Raptor-like节点(即一个或多个第二变量节点)，对这样的Raptor-like节点v∈V′k，只关联的一个校验节点c＝N(v)，其中c表示校验节点，N(v)表示变量节点v关联的校验方程(或者说校验节点c对应的校验方程)；针对选取出的每个Raptor-like节点，计算其对应的可靠度指标f(c)＝∑v′∈N(c)|LLR(v′)|、g(c)＝∑v′∈N(c)(|LLR(v′)+∑c′∈N(v′)mc′→v′|)，其中，N(c)表示校验节点c对应的校验方程N(v)中对应编码比特已被发送的变量节点(即第一变量节点)的集合，v′∈N(c)表示v′取遍N(c)中的各个值，N(v′)表示变量节点v′关联的校验节点的集合，c′∈N(v′)表示c′取遍N(v′)中的各个值，mc′→v′表示校验节点c′发送给变量节点v′的信息；根据预先设定好的关于f和g函数的阈值f0和g0，选取Vk＝{v∈V′k|f(c)>f0,g(c)>g0,c＝N(v)}；选取出的|Vk|(|Vk|表示集合Vk的大小，即集合Vk中元素的数量)个Raptor-like节点即为发送端在第k次发送中，需要降低发送功率的变量节点。
可以理解的，上述可靠度指标还可以有其它变形，本申请不做限制。例如，可以将上述求和公式变为取最小值函数公式：f(c)＝minv′∈N(c)|LLR(v′)|、g(c)＝minv′∈N(c)(|LLR(v′)+∑c′∈N(v′)mc′→v′|)。
S704、接收端发送第三指示信息，其中第三指示信息用于指示至少一个第二变量节点；相应的，发送端接收第三指示信息。
根据S703中的相关描述，这里第三指示信息用于指示至少一个第二变量节点，也可以描述为第三指示信息用于指示至少一个第二变量节点的位置，该位置是指该至少一个第二变量节点在LDPC矩阵中的(或者说待传输的编码比特序列对应的)所有变量节点中的位置。
若接收端从一个或多个第二变量节点中确定出的至少一个第二变量节点为需要提高发送功率的第二变量节点(即低可靠度的第二变量节点)，则第三指示信息中包括：第一信息，第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点(或者第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点的位置)；
若接收端从一个或多个第二变量节点中确定出的至少一个第二变量节点为需要降低发送功率的第二变量节点(即高可靠度的第二变量节点)，则第三指示信息中包括：第二 信息，第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点(或者第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点的位置)；
若接收端从一个或多个第二变量节点中确定出的至少一个第二变量节点既包括需要提高发送功率的第二变量节点(即低可靠度的第二变量节点)又包括需要降低发送功率的第二变量节点(即高可靠度的第二变量节点)，则第三指示信息中可以包括第一信息和第二信息，第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点(或者第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点的位置)，第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点(或者第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点的位置)。
沿用S703中的例子，若发送端选取Vk＝{v∈V′k|f(c)>f0,g(c)>g0,c＝N(v)}，则第三指示信息中包括选取出的|Vk|个Raptor-like节点的位置信息，例如|Vk|个Raptor-like节点的位置的索引值。
S705、发送端根据第三指示信息为一个或多个第二变量节点对应的编码比特分配发送功率。
可以理解的，LDPC矩阵中各个变量节点预分配有功率，且所有变量节点对应的总功率为P。发送端收到第三指示信息之后，在一个或多个第二变量节点原有的功率的基础上，根据第三指示信息对一个或多个第二变量节点的功率做调整，实现为一个或多个第二变量节点对应的编码比特分配发送功率。
具体来说，若接第三指示信息中仅包括第一信息，第一信息用于指示一个或多个第二变量节点中需要提高发送功率的第二变量节点，则发送端可以提高第三指示信息中指示的第二变量节点的功率，同时降低其他第二变量节点的功率，以保证总功率P不变。
若接第三指示信息中仅包括第二信息，第二信息用于指示一个或多个第二变量节点中需要降低发送功率的第二变量节点，则发送端可以降低第三指示信息中指示的第二变量节点的功率，同时提高其他第二变量节点的功率，以保证总功率P不变。
若第三指示信息中同时包括第一信息和第二信息，则发送端按照第一信息提高对应的第二变量节点的功率以及按照第二信息降低对应的第二变量节点功率，保证总功率P不变。
沿用S703、S704中的例子，第三指示信息中包含|Vk|个Raptor-like节点的位置的索引值，这|Vk|个Raptor-like节点为需要降低发送功率的Raptor-like节点(即高可靠度的第二变量节点)，则发送端降低这|Vk|个Raptor-like节点的发送功率，并提高其他Raptor-like节点的发送功率，且满足|Vk|Pl+(N′k-|Vk|)Ph＝N′k*P0＝P，其中Ph表示提高后的发送功率，Ph表示降低后的发送功率，Ph表示初始发送功率。
S706、发送端按照分配好的发送功率发送一个或多个第二变量节点对应的编码比特；相应的接收端接收第五待译码序列。
沿用S705中的例子，接收端接收到的符号为其中x为发送符号，n为信道噪声；接收端根据收到的符号产生新的对数似然比用于译码；接收端根据是否译码成功和是否达到最大重传次数t来判定发送端是否要进行第k+1次发送。
上述方案中，基于LDPC码的变量节点的关联特性，结合初传的编码比特对应的译码的可靠度分析，调整待重传的编码比特的发送功率，例如对应可靠度高的变量节点降低发 送功率，对应可靠度低的变量节点提高发送功率，能够有效提高接收端的译码纠错性能。例如，参见图7B为AWGN信道，QPSK调制方式下，采用上述方案对LDPC码进行译码的性能评估图。在图7B中，横坐标表示的是Es/N0，纵坐标表示的是BLER。
以上结合附图介绍了本申请实施例提供的方法，以下结合附图介绍本申请实施例提供的装置。
本申请实施例提供一种通信装置800，该装置可以例如为上述发送端或接收端，或者为设置在上述发送端或接收端内部的芯片。该装置具备实现图5A或图6A或图7A所示实施例中发送端或接收端的功能，比如，该装置包括执行图5A或图6A或图7A所示实施例中发送端或接收端所执行的步骤所对应的模块或单元或手段(means)，所述功能或单元或手段可以通过软件实现，或者通过硬件实现，也可以通过硬件执行相应的软件实现。
示例性的，参见图8，通信装置800包括处理模块801和收发模块802。
当通信装置800用于实现图5A所示实施例中发送端的功能时：
处理模块801，用于生成待传输的编码比特序列；收发模块802，用于根据待传输的编码比特序列，发送第一编码比特序列，待传输的编码比特序列包括第一编码比特序列；接收第一指示信息；第一指示信息包括待传输的编码比特序列中已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息；根据第一指示信息发送第二编码比特序列；其中，待传输的编码比特序列包括第二编码比特序列，第二编码比特序列中包括：待传输的编码比特序列中已被发送过的至少一个编码比特，和/或，待传输的编码比特序列中未被发送过的至少一个编码比特。
当通信装置800用于实现图5A所示实施例中接收端的功能时：
收发模块802，用于接收第一待译码序列，其中第一待译码序列为发送端根据待传输的编码比特序列发送的第一编码比特序列经由信道传输后形成的序列；处理模块801，用于对第一待译码序列进行译码；若译码失败，处理模块801还用于确定第一指示信息；第一指示信息包括待传输的编码比特序列中已被发送过的至少一个编码比特在待传输的编码比特序列中的位置信息；收发模块802，还用于发送第一指示信息；接收第二待译码序列，其中第二待译码序列为发送端根据第一指示信息发送的第二编码比特序列经由信道传输后形成的序列。
当通信装置800用于实现图6A所示实施例中发送端的功能时：
收发模块802，用于发送第三编码比特序列；接收第一译码结果；处理模块801，用于根据第一译码结果和第三编码比特序列中的信息比特，从第三编码比特序列中确定出译码出错的编码比特；根据译码出错的编码比特确定第三编码比特序列中的至少一个编码比特；收发模块802，还用于发送第二指示信息，第二指示信息中包括至少一个编码比特的位置信息。
当通信装置800用于实现图6A所示实施例中接收端的功能时：
收发模块802，用于接收第三待译码序列，第三待译码序列为发送端发送的第三编码比特序列经由信道传输后形成的序列；处理模块801，用于对第三待译码序列进行译码，得到第一译码结果；若译码失败，收发模块802，还用于发送第一译码结果；接收第二指示信息，第二指示信息中包括第三编码比特序列中的至少一个编码比特的位置信息；处理模块801，还用于根据第二指示信息和第一译码结果获取第二译码结果。
当通信装置800用于实现图7A所示实施例中发送端的功能时：
处理模块801，用于使用低密度奇偶校验码LDPC矩阵对待传输的信息编码比特进行编码，得到待传输的编码比特序列，待传输的编码比特序列包括一个或多个第一变量节点对应的编码比特和一个或多个第二变量节点对应的编码比特，第二变量节点对应的列重为1；收发模块802，用于发送一个或多个第一变量节点对应的编码比特；接收第三指示信息，第三指示信息用于指示一个或多个第二变量节点中的至少一个第二变量节点；处理模块801，还用于根据第三指示信息为一个或多个第二变量节点对应的编码比特分配发送功率；收发模块802，还用于按照分配好的发送功率发送一个或多个第二变量节点对应的编码比特。
当通信装置800用于实现图7A所示实施例中接收端的功能时：
收发模块802，用于接收第四待译码序列，第四待译码序列为一个或多个第一变量节点对应的编码比特经由信道传输后形成的序列，一个或多个第一变量节点对应的编码比特包含于基于LDPC矩阵生成的编码比特序列中，基于LDPC矩阵生成的编码比特序列中还包含一个或多个第二变量节点对应的编码比特，第二变量节点对应的列重为1；处理模块801，用于使用LDPC矩阵对第四待译码序列进行译码；若译码失败，处理模块801还用于从一个或多个第二变量节点中确定出至少一个第二变量节点；收发模块802，还用于发送第三指示信息，其中第三指示信息用于指示至少一个第二变量节点。
应理解，上述方法实施例涉及的各步骤的所有相关内容均可以援引到对应功能模块的功能描述，在此不再赘述。
基于同一技术构思，参见图9，本申请实施例还提供一种通信装置900，包括：
至少一个处理器901；以及与所述至少一个处理器901通信连接的通信接口903；所述至少一个处理器901通过执行存储器902存储的指令，使得所述装置900通过所述通信接口903执行如图5A或图6A或图7A所示实施例中发送端或接收端所执行的方法。
可选的，所述存储器902位于所述装置900之外。
可选的，所述装置900包括所述存储器902，所述存储器902与所述至少一个处理器901相连，所述存储器902存储有可被所述至少一个处理器901执行的指令。附图9用虚线表示存储器902对于装置900是可选的。
其中，所述处理器901和所述存储器902可以通过接口电路耦合，也可以集成在一起，这里不做限制。
本申请实施例中不限定上述处理器901、存储器902以及通信接口903之间的具体连接介质。本申请实施例在图9中以处理器901、存储器902以及通信接口903之间通过总线904连接，总线在图9中以粗线表示，其它部件之间的连接方式，仅是进行示意性说明，并不引以为限。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示，图9中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
应理解，本申请实施例中提及的处理器可以通过硬件实现也可以通过软件实现。当通过硬件实现时，该处理器可以是逻辑电路、集成电路等。当通过软件实现时，该处理器可以是一个通用处理器，通过读取存储器中存储的软件代码来实现。
示例性的，处理器可以是中央处理单元(Central Processing Unit，CPU)，还可以是其他通用处理器、数字信号处理器(Digital Signal Processor，DSP)、专用集成电路(Application  Specific Integrated Circuit，ASIC)、现成可编程门阵列(Field Programmable Gate Array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
应理解，本申请实施例中提及的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(Read-Only Memory，ROM)、可编程只读存储器(Programmable ROM，PROM)、可擦除可编程只读存储器(Erasable PROM，EPROM)、电可擦除可编程只读存储器(Electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(Static RAM，SRAM)、动态随机存取存储器(Dynamic RAM，DRAM)、同步动态随机存取存储器(Synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data Eate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(Synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(Direct Rambus RAM，DR RAM)。
需要说明的是，当处理器为通用处理器、DSP、ASIC、FPGA或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件时，存储器(存储模块)可以集成在处理器中。
应注意，本文描述的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
基于同一技术构思，参见图10，本申请实施例还提供一种通信装置1000，包括输入输出接口1001和逻辑电路1002；输入输出接口1001，用于输出编码比特序列或输入待译码序列，所述逻辑电路用于执行如图5A或图6A或图7A所示实施例中发送端或接收端所执行的方法。
可选的，上述的逻辑电路1002可以是芯片，编码器，编码电路或其他可以实现本申请方法的集成电路。
基于同一技术构思，本申请实施例还提供一种计算机可读存储介质，包括程序或指令，当所述程序或指令在计算机上运行时，使得如图5A或图6A或图7A所示实施例中发送端或接收端所执行的方法被执行。
基于同一技术构思，本申请实施例还提供一种计算机程序产品，包括指令，当其在计算机上运行时，使得如图5A或图6A或图7A所示实施例中发送端或接收端所执行的方法被执行。
基于同一技术构思，本申请实施例还提供一种通信系统，包括上述实施例中所涉及的发送端和接收端。
本申请实施例是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，数字通用光盘(digital versatile disc，DVD))、或者半导体介质(例如，固态硬盘(solid state disk，SSD))等。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请的范围。这样，倘若本申请实施例的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (37)

  1. 一种信息传输方法，其特征在于，包括：
    第一通信装置根据待传输的编码比特序列，发送第一编码比特序列，所述待传输的编码比特序列包括所述第一编码比特序列；
    所述第一通信装置接收第一指示信息；所述第一指示信息包括所述待传输的编码比特序列中已被发送过的至少一个编码比特在所述待传输的编码比特序列中的位置信息；
    所述第一通信装置根据所述第一指示信息发送第二编码比特序列；其中，所述待传输的编码比特序列包括所述第二编码比特序列，所述第二编码比特序列中包括：所述待传输的编码比特序列中已被发送过的至少一个编码比特，和/或，所述待传输的编码比特序列中未被发送过的至少一个编码比特。
  2. 如权利要求1所述的方法，其特征在于，还包括：
    所述第一通信装置根据所述待传输的编码比特序列，至少重传一次编码比特序列；
    其中，所述第一编码比特序列为初传的编码比特序列，所述第二编码比特序列为第一次重传的编码比特序列；或者，所述第一编码比特序列为第q-1次重传的编码比特序列，所述第二编码比特序列为第q次重传的编码比特序列，q为大于1的正整数。
  3. 如权利要求1或2所述的方法，其特征在于，所述位置信息为所述已被发送过的至少一个编码比特在所述待传输的编码比特序列中的位置的索引值。
  4. 如权利要求1或2所述的方法，其特征在于，所述位置信息为所述已被发送过的至少一个编码比特对应的至少一个资源子段的指示信息，其中所述至少一个资源子段位于所述待传输的编码比特序列对应的资源段中。
  5. 如权利要求1-4任一项所述的方法，其特征在于，所述第二编码比特序列中已被发送过的编码比特的占比不超过预设值δ。
  6. 如权利要求1-5任一项所述的方法，其特征在于，所述第二编码比特序列中已被发送过的至少一个编码比特的数量满足以下条件：
    其中，n″k为所述第二编码比特序列中包括的所述待传输的编码比特序列中已被发送过的至少一个编码比特的数量；Nk-1表示所述第一通信装置在发送所述第二编码比特序列之前发送的编码比特的数量，N″k-1表示所述第一通信装置在发送所述第二编码比特序列之前重复发送的编码比特的数量；nk为所述第二编码比特序列中包括的编码比特的数量；δ′为所述第一通信装置根据所述待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比对应的门限值，所述第一通信装置根据所述待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比不超过δ′。
  7. 如权利要求6所述的方法，其特征在于，δ′大于或等于预设门限值。
  8. 一种信息传输方法，其特征在于，包括：
    第二通信装置接收第一待译码序列，其中所述第一待译码序列为第一通信装置根据待 传输的编码比特序列发送的第一编码比特序列经由信道传输后形成的序列；
    所述第二通信装置对所述第一待译码序列进行译码；
    若译码失败，所述第二通信装置确定第一指示信息；所述第一指示信息包括所述待传输的编码比特序列中已被发送过的至少一个编码比特在所述待传输的编码比特序列中的位置信息；
    所述第二通信装置发送所述第一指示信息；
    所述第二通信装置接收第二待译码序列，其中所述第二待译码序列为所述第一通信装置根据所述第一指示信息发送的第二编码比特序列经由信道传输后形成的序列。
  9. 如权利要求8所述的方法，其特征在于，所述第一编码比特序列为所述第一通信装置初传的编码比特序列，所述第二编码比特序列为所述第一通信装置第一次重传的编码比特序列；或者，所述第一编码比特序列为所述第一通信装置第q-1次重传的编码比特序列，所述第二编码比特序列为所述第一通信装置第q次重传的编码比特序列，q为大于1的正整数。
  10. 如权利要求8或9所述的方法，其特征在于，所述位置信息为所述已被发送过的至少一个编码比特在所述待传输的编码比特序列中的位置的索引值。
  11. 如权利要求10所述的方法，其特征在于，所述方法还包括：
    所述第二通信装置获取与所述第一待译码序列对应的对数似然比LLR序列，所述LLR序列中的LLR与所述待传输的编码比特序列中的编码比特相对应；
    所述第二通信装置确定第一指示信息，包括：
    所述第二通信装置从所述LLR序列中确定出幅值较小的前n″k个LLR，其中n″k为正整数，其中所述n″k个LLR对应的n″k个编码比特为所述待传输的编码比特序列中已被发送过的至少一个编码比特；
    所述第二通信装置根据所述n″k个LLR对应的n″k个编码比特在所述待传输的编码比特序列中的位置确定所述第一指示信息。
  12. 如权利要求8或9所述的方法，其特征在于，所述位置信息为所述已被发送过的至少一个编码比特对应的至少一个资源子段的信息，其中所述至少一个资源子段位于所述待传输的编码比特序列对应的资源段中。
  13. 如权利要求12所述的方法，其特征在于，所述方法还包括：
    所述第二通信装置根据获取与所述第一待译码序列对应的信道估计结果，所述信道估计结果中的信道估计值与所述待传输的编码比特序列中的编码比特相对应；
    所述第二通信装置确定第一指示信息，包括：
    所述第二通信装置根据所述信道估计结果确定所述待传输的编码比特序列对应的资源段中各个资源子段对应的信道估计均值；
    所述第二通信装置从所述待传输的编码比特序列对应的资源段中确定出信道估计均值较小M个资源子段；M为正整数；
    所述第二通信装置根据所述M个资源子段确定所述第一指示信息。
  14. 如权利要求8-13任一项所述的方法，其特征在于，所述第二编码比特序列中已被发送过的编码比特的占比不超过预设值δ。
  15. 如权利要求8-14任一项所述的方法，其特征在于，所述第二编码比特序列中已被发送过的至少一个编码比特的数量满足以下条件：
    其中，n″k为所述第二编码比特序列中包括的所述待传输的编码比特序列中已被发送过的至少一个编码比特的数量；Nk-1表示所述第一通信装置在发送所述第二编码比特序列之前发送的编码比特的数量，N″k-1表示所述第一通信装置在发送所述第二编码比特序列之前重复发送的编码比特的数量；nk为所述第二编码比特序列中包括的编码比特的数量；δ′为所述第一通信装置根据所述待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比对应的门限值，所述第一通信装置根据所述待传输的编码比特序列发送的所有编码比特序列中重复发送的编码比特的占比不超过δ′。
  16. 如权利要求15所述的方法，其特征在于，δ′大于或等于预设门限值。
  17. 一种信息传输方法，其特征在于，包括：
    第一通信装置发送第三编码比特序列；
    所述第一通信装置接收第一译码结果；
    所述第一通信装置根据所述第一译码结果和所述第三编码比特序列中的信息比特，从所述第三编码比特序列中确定出译码出错的编码比特；
    所述第一通信装置根据所述译码出错的编码比特确定所述第三编码比特序列中的至少一个编码比特；
    所述第一通信装置发送第二指示信息，所述第二指示信息中包括所述至少一个编码比特的位置信息。
  18. 如权利要求17所述的方法，其特征在于，所述第一通信装置根据所述译码出错的编码比特确定所述第三编码比特序列中的至少一个编码比特，包括：
    当所述译码出错的编码比特的数量小于T时，所述第一通信装置将所述译码出错的编码比特作为所述至少一个编码比特；或者，
    当所述译码出错的编码比特的数量大于或等于T时，所述第一通信装置从所述译码出错的编码比特中选择T个编码比特，将所述T个编码比特作为所述至少一个编码比特；
    其中，T为预设的门限值。
  19. 如权利要求18所述的方法，其特征在于，所述第二指示信息中还包括指示位；
    当所述译码出错的编码比特的数量小于T时，所述指示位的取值为第一值；
    当所述译码出错的编码比特的数量大于或等于T时，所述指示位的取值为第二值；
    其中，所述第一值与所述第二值不同。
  20. 如权利要求17-19任一项所述的方法，其特征在于，还包括：
    所述T取使得成立的最大值，其中N为第二指示信息的信息比特长度，k为所述第一编码比特序列中信息位的个数。
  21. 一种信息传输方法，其特征在于，包括：
    第二通信装置接收第三待译码序列，所述第三待译码序列为第一通信装置发送的第三编码比特序列经由信道传输后形成的序列；所述第二通信装置对所述第三待译码序列进行译码，得到第一译码结果；
    若译码失败，所述第二通信装置发送所述第一译码结果；
    所述第二通信装置接收第二指示信息，所述第二指示信息中包括所述第三编码比特序列中的至少一个编码比特的位置信息；
    所述第二通信装置根据所述第二指示信息和所述第一译码结果获取第二译码结果。
  22. 如权利要求21所述的方法，其特征在于，所述第二指示信息中还包括有指示位；
    所述第二通信装置根据所述第二指示信息和所述第一译码结果获取第二译码结果，包括：
    当所述指示位为第一值时，所述第二通信装置根据所述第三编码比特序列中的至少一个编码比特的位置信息确定所述第一译码结果中出错的编码比特，校正所述出错的编码比特，得到第二译码结果；或者，
    当所述指示位为第二值时，所述第二通信装置根据所述第三编码比特序列中的至少一个编码比特的位置信息校正所述第一译码结果对应的先验信息，根据校正后的先验信息对所述第三编码比特序列重新译码，得到第二译码结果。
  23. 一种信息传输方法，其特征在于，包括：
    第一通信装置使用低密度奇偶校验码LDPC矩阵对待传输的信息编码比特进行编码，得到待传输的编码比特序列，所述待传输的编码比特序列包括一个或多个第一变量节点对应的编码比特和一个或多个第二变量节点对应的编码比特，所述第二变量节点对应的列重为1；
    所述第一通信装置发送所述一个或多个第一变量节点对应的编码比特；
    所述第一通信装置接收第三指示信息，所述第三指示信息用于指示所述一个或多个第二变量节点中的至少一个第二变量节点；
    所述第一通信装置根据所述第三指示信息为所述一个或多个第二变量节点对应的编码比特分配发送功率；
    所述第一通信装置按照分配好的发送功率发送所述一个或多个第二变量节点对应的编码比特。
  24. 如权利要求23所述的方法，其特征在于，所述第三指示信息中包括：
    第一信息，所述第一信息用于指示所述一个或多个第二变量节点中需要提高发送功率的第二变量节点；和/或，
    第二信息，所述第二信息用于指示所述一个或多个第二变量节点中需要降低发送功率的第二变量节点。
  25. 如权利要求23所述的方法，其特征在于，
    所述需要提高发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第一阈值范围内；
    所述需要降低发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第二阈值范围内；
    其中，所述第一阈值范围与所述第二阈值范围不同。
  26. 如权利要求25所述的方法，其特征在于，所述先验信息包括LLR或信道估计值；和/或，所述后验信息包括软值。
  27. 一种信息传输方法，其特征在于，包括：
    第二通信装置接收第四待译码序列，所述第四待译码序列为一个或多个第一变量节点对应的编码比特经由信道传输后形成的序列，所述一个或多个第一变量节点对应的编码比 特包含于基于LDPC矩阵生成的编码比特序列中，所述基于LDPC矩阵生成的编码比特序列中还包含一个或多个第二变量节点对应的编码比特，所述第二变量节点对应的列重为1；
    所述第二通信装置使用所述LDPC矩阵对所述第四待译码序列进行译码；
    若译码失败，所述第二通信装置从所述一个或多个第二变量节点中确定出至少一个第二变量节点；
    所述第二通信装置发送第三指示信息，其中所述第三指示信息用于指示所述至少一个第二变量节点。
  28. 如权利要求27所述的方法，其特征在于，所述第三指示信息中包括：
    第一信息，所述第一信息用于指示所述一个或多个第二变量节点中需要提高发送功率的第二变量节点；和/或，
    第二信息，所述第二信息用于指示所述一个或多个第二变量节点中需要降低发送功率的第二变量节点。
  29. 如权利要求28所述的方法，其特征在于，
    所述需要提高发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第一阈值范围内；
    所述需要降低发送功率的第二变量节点关联的第一变量节点对应的先验信息或后验信息在第二阈值范围内；
    其中，所述第一阈值范围与所述第二阈值范围不同。
  30. 如权利要求29所述的方法，其特征在于，所述先验信息包括LLR或信道估计值；和/或，所述后验信息包括软值。
  31. 一种通信装置，其特征在于，包括用于执行如权利要求1-30任一项所述方法的模块。
  32. 一种通信装置，其特征在于，包括：至少一个处理器；以及与所述至少一个处理器通信连接的通信接口；所述至少一个处理器通过执行存储器存储的指令，使得所述装置通过所述通信接口执行如权利要求1-30任一项所述方法。
  33. 如权利要求32所述的装置，其特征在于，所述装置还包括存储器，所述存储器与所述至少一个处理器相连，所述存储器存储有可被所述至少一个处理器执行的指令。
  34. 一种通信装置，其特征在于，包括：输入输出接口和逻辑电路；所述输入输出接口用于输出编码比特序列或输入待译码序列，所述逻辑电路用于执行如权利要求1-30中任一项所述的方法。
  35. 一种计算机可读存储介质，其特征在于，包括程序或指令，当所述程序或指令在计算机上运行时，使得如权利要求1-30任一项所述方法被执行。
  36. 一种计算机程序产品，其特征在于，包括指令，当所述指令在计算机上运行时，使得如权利要求1-30任一项所述方法被执行。
  37. 一种通信系统，其特征在于，包括第一通信装置和第二通信装置，其中所述第一通信装置用于执行如以下权利要求中任一项所述的方法：1-7、17-20、23-26，所述第二通信装置用于执行如以下权利要求中任一项所述的方法：8-16、21-22、27-30。
PCT/CN2023/091989 2022-05-26 2023-05-04 一种信息传输方法和装置 WO2023226705A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210589412.8A CN117200940A (zh) 2022-05-26 2022-05-26 一种信息传输方法和装置
CN202210589412.8 2022-05-26

Publications (2)

Publication Number Publication Date
WO2023226705A1 true WO2023226705A1 (zh) 2023-11-30
WO2023226705A9 WO2023226705A9 (zh) 2024-02-22

Family

ID=88918364

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/091989 WO2023226705A1 (zh) 2022-05-26 2023-05-04 一种信息传输方法和装置

Country Status (2)

Country Link
CN (1) CN117200940A (zh)
WO (1) WO2023226705A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107733551A (zh) * 2016-08-11 2018-02-23 华为技术有限公司 一种数据传输方法、装置和系统
CN108352936A (zh) * 2015-11-12 2018-07-31 高通股份有限公司 用于结构化低密度奇偶校验(ldpc)码的穿孔
CN111200442A (zh) * 2018-11-20 2020-05-26 华为技术有限公司 编译码方法、编码译码装置以及系统
CN112152754A (zh) * 2019-06-28 2020-12-29 华为技术有限公司 一种极化码重传方法及装置
US20210328716A1 (en) * 2018-08-30 2021-10-21 Lg Electronics Inc. Method and device for performing channel coding on basis of polar coding in wireless communication system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108352936A (zh) * 2015-11-12 2018-07-31 高通股份有限公司 用于结构化低密度奇偶校验(ldpc)码的穿孔
CN107733551A (zh) * 2016-08-11 2018-02-23 华为技术有限公司 一种数据传输方法、装置和系统
US20210328716A1 (en) * 2018-08-30 2021-10-21 Lg Electronics Inc. Method and device for performing channel coding on basis of polar coding in wireless communication system
CN111200442A (zh) * 2018-11-20 2020-05-26 华为技术有限公司 编译码方法、编码译码装置以及系统
CN112152754A (zh) * 2019-06-28 2020-12-29 华为技术有限公司 一种极化码重传方法及装置

Also Published As

Publication number Publication date
WO2023226705A9 (zh) 2024-02-22
CN117200940A (zh) 2023-12-08

Similar Documents

Publication Publication Date Title
US11711811B2 (en) Multiplexing control information in a physical uplink data channel
EP2274859B1 (en) Pre-emptive acknowledgement for data transmission in a communication system
CN108365922B (zh) 用于反馈的方法、设备和系统
US11057794B2 (en) Redundancy version indication in fifth generation (5G) or other next generation communication systems
US10897329B2 (en) Method and apparatus for performing HARQ on basis of polar code
WO2018099196A1 (zh) 一种编码和调制方法、通信装置
JP2024029096A (ja) Ｌｄｐｃコード化データを処理する方法および装置
WO2018171737A1 (zh) 一种数据传输方法和相关设备
MX2010012108A (es) Agrupacion de informacion de reconocimiento en un sistema de comunicacion inalambrico.
WO2017107904A1 (zh) 基于harq传输的方法、装置及系统
CN101594211A (zh) 大带宽的多载波系统中发送正确/错误应答消息的方法
WO2019095253A1 (zh) 混合自动重传请求传输方法、装置、系统和存储介质
CN101699781A (zh) 正确/错误应答消息和秩指示信令的编码方法及装置
US11936480B2 (en) Apparatus and methods for HARQ in a wireless network
CN111901065A (zh) 一种重传数据的发送方法、接收方法及装置
CN108023675A (zh) 数据传输方法及通信设备
CN102546131A (zh) 无线链路信号的更软合并方法和设备
KR102517960B1 (ko) 무선 셀룰라 통신 시스템에서 데이터 전송 방법 및 장치
CN113169824B (zh) 一种数据译码方法及相关设备
WO2023226705A1 (zh) 一种信息传输方法和装置
US11973594B2 (en) Devices, methods and non-transitory computer-readable mediums for adaptively selective retransmission in wireless communications
CN108028667A (zh) 具有很短信息块的咬尾卷积码
WO2021227981A1 (zh) 一种信息发送的方法及设备
WO2020076380A1 (en) System and method for retransmission of individual codewords
CN113078913A (zh) 卷积码的速率匹配的方法和无线通信装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23810778

Country of ref document: EP

Kind code of ref document: A1