WO2018141240A1 - 信息处理的方法、装置、通信设备和通信系统 - Google Patents

信息处理的方法、装置、通信设备和通信系统 Download PDF

Info

Publication number
WO2018141240A1
WO2018141240A1 PCT/CN2018/074574 CN2018074574W WO2018141240A1 WO 2018141240 A1 WO2018141240 A1 WO 2018141240A1 CN 2018074574 W CN2018074574 W CN 2018074574W WO 2018141240 A1 WO2018141240 A1 WO 2018141240A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit sequence
bits
communication device
output bit
starting position
Prior art date
Application number
PCT/CN2018/074574
Other languages
English (en)
French (fr)
Other versions
WO2018141240A9 (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 华为技术有限公司
Priority to JP2019542221A priority Critical patent/JP6871396B2/ja
Priority to AU2018214850A priority patent/AU2018214850B2/en
Priority to BR112019016057-4A priority patent/BR112019016057A2/pt
Priority to EP18748392.0A priority patent/EP3570475B1/en
Priority to RU2019127742A priority patent/RU2752420C2/ru
Publication of WO2018141240A1 publication Critical patent/WO2018141240A1/zh
Priority to US16/529,438 priority patent/US11128401B2/en
Publication of WO2018141240A9 publication Critical patent/WO2018141240A9/zh
Priority to US17/406,354 priority patent/US11742987B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H04L1/0058—Block-coded modulation
    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/118—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
    • H03M13/1185—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal
    • H03M13/1188—Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal wherein in the part with the double-diagonal at least one column has an odd column weight equal or greater than three
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/615—Use of computational or mathematical techniques
    • H03M13/616—Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • H03M13/6393—Rate compatible low-density parity check [LDPC] codes
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H04L1/0013—Rate matching, e.g. puncturing or repetition of code symbols
    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • 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
    • 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
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1816—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of the same, encoded, message

Definitions

  • Embodiments of the present invention relate to the field of communications, and in particular, to a method, an apparatus, a communication device, and a communication system for information processing.
  • Hybrid Automatic Repeat Request (HARQ) technology is an important technology in wireless communication systems, which can improve the reliability of data links.
  • Low density parity check (LDPC) code is a kind of linear block coding with sparse check matrix, which has the characteristics of flexible structure and low decoding complexity. Because it uses a partially parallel iterative decoding algorithm, it has a higher throughput than the traditional Turbo code.
  • the LDPC code is considered to be the next-generation error correction code of the communication system, and can be used to improve the reliability and power utilization of channel transmission; and can be widely applied to space communication, optical fiber communication, personal communication systems, ADSL, and magnetic recording equipment. At present, LDPC codes have been considered as one of channel coding methods in the fifth generation mobile communication.
  • the communication device performs rate matching on the channel coding to adjust the code rate of the coding block, and obtains a bit sequence to be transmitted to match the decoding code rate.
  • the communication device may also perform bit puncturing to improve the code rate of the LDPC code block generated by the coding when the rate is matched, or perform bit repetition to reduce the code rate for the LDPC code block generated by the coding when the rate is matched.
  • the communication device at the transmitting end selects the bit sequence to be transmitted in the rate matching step, and performs processing after interleaving, mapping, etc., and then sends the bit sequence to the receiving end communication device.
  • the receiving end communication device combines the soft value of the bit sequence and the saved soft channel bit to obtain a coded block.
  • Embodiments of the present invention provide a method, an apparatus, a communication device, and a communication system for information processing, which can improve HARQ performance.
  • a method for information processing in a communication system comprising:
  • a method for information processing in a communication system including:
  • the soft bit sequence is combined and saved in the soft information buffer starting from the start position k 0 (i).
  • k 0 (i) is based on a starting position k 0 of the output bit sequence of the previous transmission (i- 1) Determined by the length E(i-1) of the output bit sequence of the previous transmission.
  • k 0 (i) (k 0 (i-1)+F(i-1)) mod N CB .
  • N CB is the coding block size
  • F(i-1) is the number of bits required to sequentially acquire E(i-1) output bits from k 0 (i-1) in the coding block.
  • the output bit sequences of the two adjacent transmissions are continuous, and there are no repeated bits between the two, and such an output bit sequence is transmitted to the communication device at the receiving end to achieve better decoding performance.
  • k 0 (i) takes a value of p k
  • p k is One of them, where 0 ⁇ p k ⁇ N CB , p k is an integer, k is an integer, 0 ⁇ k ⁇ k max , N CB is the size of the coded block, and k max is an integer greater than or equal to 4.
  • p k is satisfied or, or or,
  • k max can take the value Nb, which is the number of columns of the base matrix.
  • the above method can adapt to a variety of initial transmission code rates, so that the interval between redundant versions of each transmission does not change greatly or the number of repeated bits is large, and the performance is relatively stable.
  • k 0 (i) takes a value of p k
  • p k is One of them, where 0 ⁇ p k ⁇ N CB , p k is an integer, k is an integer, 0 ⁇ k ⁇ k max , N CB is the size of the coded block, and k max is an integer greater than or equal to 4.
  • p k ⁇ (Nb-Mb+j)*z
  • the number of non-punctured double-column re-check bits, z is the spreading factor of the coded block.
  • the method can make the position near the information bit, the denser the distribution of the starting position, and the closer to the last bit of the coding block, the more sparse the starting position is.
  • k max Nb, where Nb is the number of columns of the base matrix of the coding block.
  • the k max increase may cause the distance between the start positions of the respective redundancy versions to decrease, and the redundancy version determined based on the start position may also improve the decoding performance of the communication device at the receiving end.
  • the starting position k 0 (i) is based on a starting position k 0 of the output bit sequence of the previous transmission. (i-1) and the output bit sequence length E(i-1) of the previous transmission.
  • p k is a minimum value satisfying p k ⁇ ((k 0 (i-1)+F(i-1)) mod N CB ); Or, if ((k 0 (i-1)+F(i-1)) mod N CB ) is greater than The maximum value in , then p k is The minimum value in .
  • p k is a maximum value satisfying p k ⁇ ((k 0 (i-1)+F(i-1)) mod N CB ); Or if ((k 0 (i-1)+F(i-1)) mod N CB ) is less than The minimum value in , then p k is The maximum value in .
  • p k is The value with the smallest difference between ((k 0 (i-1)+F(i-1)) mod N CB ); or, if ((k 0 (i-1)+F(i-1)) ) mod N CB ) is less than The minimum value or ((k 0 (i-1)+F(i-1)) mod N CB ) is greater than The maximum value in , p k is Minimum value Maximum value The difference between the two and ((k 0 (i-1)+F(i-1)) mod N CB ) is the smallest difference.
  • the starting position k 0 (i) is based on the start of the output bit sequence of the previous transmission.
  • the position k 0 (i-1) and the output bit sequence length E(i-1) of the previous transmission, and the number of transmissions i are determined.
  • F(i-1) is the number of bits required to sequentially acquire E(i-1) output bits from k 0 (i-1) in the coding block.
  • the starting position k 0 (i) is determined based on a number rv idx (i) of a redundancy version starting position.
  • the redundancy version number rv idx (i) can be obtained by signaling.
  • the number rv idx (i) of the redundancy version start position may be acquired based on the number order of the redundancy version start position and the number of transmissions i.
  • the number order of the starting positions of the redundancy versions is read from the memory, or the number order of the starting positions of the redundancy versions is determined based on the initial code rate, or the redundancy version starts from The numbering order of the starting position is determined based on the length of the output bit sequence and the spreading factor z.
  • a third aspect provides an apparatus for processing information in a communication system, including:
  • An obtaining unit configured to obtain a starting position k 0 (i) of the output bit sequence in the encoding block
  • a processing unit configured to determine an output bit sequence from the coding block based on an output bit sequence length E(i) and the start position k 0 (i), wherein the code block is stored in a circular buffer, i is An integer greater than or equal to 0.
  • the apparatus may be used to perform the method described in the first aspect or any of the possible implementations of the first aspect, with particular reference to the description of the above aspects.
  • the apparatus for information processing provided by the present application may include a module for performing the first aspect of the above method design or any of the possible implementations of the first aspect.
  • the module can be software and/or hardware.
  • a fourth aspect provides an apparatus for processing information in a communication system, including:
  • An obtaining unit configured to obtain a starting position k 0 (i) of the soft bit sequence of length E(i) stored in the soft information buffer;
  • the processing unit is configured to save the acquired soft bit sequence in the soft information buffer from the starting position k 0 (i).
  • the apparatus may be used to perform the method described in the second aspect or any of the possible implementations of the second aspect, with particular reference to the description of the above aspects.
  • the apparatus for information processing provided by the present application may include a module for performing the second aspect of the above method design or any possible implementation of the second aspect.
  • the module can be software and/or hardware.
  • a communication device comprising an encoder, a rate matcher and a transceiver, wherein:
  • a rate matching device comprising: information processing apparatus according to the foregoing third aspect, for determining an output bit sequence in the above embodiment;
  • a transceiver for transmitting a transmission signal corresponding to an output bit sequence of the rate matcher.
  • a communication device comprising a decoder, a de-rate matcher and a transceiver, wherein:
  • a rate matching device comprising: information processing apparatus according to the foregoing fourth aspect, for combining the soft value bits of the output bit sequence described in the above aspect in a soft information buffer;
  • an embodiment of the present invention provides a communication system, including the communication device according to the fifth aspect, and the communication device according to the sixth aspect.
  • an embodiment of the present invention provides a computer storage medium including a program designed to perform the above aspects.
  • Yet another aspect of the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the methods described in the various aspects above.
  • the method, device, communication device and communication system of the information processing according to the embodiment of the present invention reasonably determine the output bit sequence of the initial transmission or the retransmission, so that the decoding performance of the receiving communication device after receiving the soft bit sequence of the output bit sequence is improved.
  • the decoding success rate is improved to further reduce the number of retransmissions.
  • 1 is a schematic diagram of a base matrix of an LDPC code and a permutation matrix thereof;
  • FIG. 2 is a schematic structural diagram of a parity check matrix of an LDPC code
  • FIG. 3 is a structural diagram of a communication system according to an embodiment of the present invention.
  • 5-1 is a schematic diagram of a coding block according to another embodiment of the present invention.
  • FIG. 5-2 is a schematic diagram of a coding block according to another embodiment of the present invention.
  • 5-3 is a schematic diagram of a coding block according to another embodiment of the present invention.
  • FIG. 6 is a flowchart of an information processing method according to another embodiment of the present invention.
  • FIG. 7 is a structural diagram of an information processing apparatus according to another embodiment of the present invention.
  • FIG. 8 is a structural diagram of an information processing apparatus according to another embodiment of the present invention.
  • FIG. 9 is a structural diagram of a communication device according to another embodiment of the present invention.
  • FIG. 10 is a structural diagram of a communication device according to another embodiment of the present invention.
  • FIG. 1 is a diagram showing a base matrix of an LDPC code and a permutation matrix thereof in a communication system.
  • the base matrix of the LDPC code has m*n elements. If z is used as the spreading factor for expansion, a matrix with a check matrix H of (m*z)*(n*z) can be obtained, that is, there are m*n Block matrix is constructed, each block is a z*z unit matrix obtained by cyclic shift.
  • all elements with a value of -1 in the matrix are expanded to be a 4x4 all-zero matrix, and other elements are expanded to a 4*4 permutation matrix.
  • the permutation matrix can be obtained by a unit matrix I after a corresponding number of cyclic shifts, the number of displacements being equal to the value of the corresponding matrix element.
  • the corresponding matrix after the expansion of the element with a value of 0 in the base matrix is 4*4
  • the corresponding matrix after the expansion of the element with a value of 1 is the matrix obtained by one displacement of the unit matrix. , and so on, will not go into details here.
  • the base matrix can be used as a check matrix for LDPC code encoding or decoding.
  • a code length is n
  • the information sequence length is k
  • the LDPC code recorded as (n, k) can be uniquely determined by the check matrix H.
  • the check matrix H is a sparse matrix, and each row represents a check equation constraint, corresponding to j coded bits, each column indicating that one coded bit is constrained by m check equations, and any two check equations contain at most one identical coded bit.
  • An example of a check matrix H of an LDPC code and its corresponding check equation is given by the following equation (1):
  • Fig. 2 shows an example of a check matrix of an LDPC code.
  • the check matrix includes a core matrix and three extended matrix portions.
  • four check matrices can be used for encoding and decoding: the core matrix, the core matrix and the check matrix 1 composed of the extended matrix portion 1, the core matrix, the extended matrix portion 1 and the extended matrix portion 2
  • the matrix 2, the core matrix, the extended matrix portion 1, the extended matrix portion 2, and the extended matrix portion 3 constitute a complete matrix.
  • These check matrices have a Raptor-like structure, the check bits have a double-diagonal and a single-column double structure, and the core matrix usually includes a double-diagonal structure portion.
  • the code rate is k/n, and encoding with different check matrices can obtain LDPC codes with different code rates. Piece. It can be seen that in these coding blocks, the LDPC code generated according to the complete matrix has the largest code length and the lowest code rate R min ; the LDPC code generated according to the core matrix has the smallest code length and the highest code rate R max , according to the school.
  • the LDPC code generated by the check matrix 1 has a code rate R 1
  • the LDPC code generated by the check matrix 2 has a code rate R 2 , and then R min ⁇ R 2 ⁇ R 1 ⁇ R max .
  • R 1 code rate
  • R 2 code rate
  • R min ⁇ R 2 ⁇ R 1 ⁇ R max code rate
  • the complete matrix, the core matrix, the check matrix 1 or the check matrix 2 may be used as the base matrix of the LDPC code according to the spreading factor or the coding matrix.
  • information data is transmitted between communication devices (for example, base stations or terminals), and since the wireless propagation environment is complex and variable, it is susceptible to interference and errors occur.
  • the communication device performs CRC check, channel coding, rate matching, interleaving, and the like on the information data, and maps the interleaved coded bits into modulation symbols and transmits them to the communication device at the receiving end.
  • the receiving device After receiving the modulation symbol, the receiving device recovers the information data by deinterleaving, de-rate matching, decoding, and CRC check.
  • the communication system 300 illustrated in FIG. 3 can be widely used to provide various types of communication such as voice, data, and the like.
  • the communication system can include a plurality of wireless communication devices.
  • FIG. 3 shows only communication device 30 and communication device 31.
  • Control information or data information is received and transmitted between the communication device 30 and the communication device 31 as a sequence of information.
  • the communication device 30 functions as a transmitting communication device, transmits a sequence of information in accordance with a transmission block (TB), and adds a CRC check to each transport block. If the size of the transport block after the addition of the check exceeds the maximum code block length, the transport block needs to be divided into code blocks (CBs), and the code block CRC check may be added in each code block, or each group of codes may be added.
  • CBs code blocks
  • a block group CRC check is added to the block, and padding bits can also be added to each code block.
  • the communication device 30 performs channel coding on each code block separately, for example, using LDPC coding to obtain a corresponding coded block.
  • each coding block includes information bits and check bits. If the information bits include padding bits, the padding bits are usually expressed as "null".
  • the coded block or the bit-reordered coded block is stored in a circular buffer of the communication device 30, and the communication device 30 sequentially acquires a plurality of output bits from the coded block in the circular buffer to obtain an output bit sequence, the output bit being a padded bit in the coded block
  • the bits other than the output bit sequence are not including padding bits.
  • mapping to a modulation symbol and then transmitting When the communication device 30 retransmits, another output bit sequence is selected from the coding block in the cyclic buffer. If the output bit is sequentially acquired to reach the last bit of the circular buffer, the output bit is continuously selected from the first bit of the circular buffer.
  • the communication device 31 demodulates the received modulation symbols, and after deinterleaving, stores the soft values of the received output bit sequence in corresponding positions in the soft buffer. If a retransmission occurs, the communication device 31 combines the soft values of the output bit sequence of each retransmission in the soft information buffer, where the combination means that if the positions of the two received output bits are the same, it will be twice. The soft values of the received output bits are combined.
  • the location in the soft information buffer of the communication device 31 and the location of the coding block in the cyclic buffer in the communication device 30 are in one-to-one correspondence. That is, if the position of the output bit in the coded block in the cyclic buffer in the communication device 30 is the p-th bit, the position of its soft value in the soft information buffer in the communication device 31 is also the p-th bit.
  • the communication device 31 decodes all soft values in the soft information buffer to obtain a code block of the information sequence. Since the communication device 31 can acquire the transport block size, the number of code blocks in which one transport block is divided and the length of each code block can be determined. If the code block includes a CRC bit segment, the communication device 31 can also use the CRC bit segment pair code. The block is checked. The communication device 31 cascades the code blocks into one transport block, further calibrates and cascades the transport blocks to finally obtain a sequence of information. It can be seen that the communication device 31 performs the inverse of the information processing method of the communication device 30.
  • the communication device 30 may be a network device in a communication system, such as a base station, and the corresponding communication device 31 may be a terminal.
  • the communication device 30 may also be a terminal in a communication system, and accordingly, the communication device 31 may be a network device in a communication system, such as a base station or the like.
  • a terminal is a device having a communication function, and may include a handheld device having a wireless communication function, an in-vehicle device, a wearable device, a computing device, or other processing device connected to a wireless modem.
  • Terminals can be called different names in different networks, such as: user equipment, mobile stations, subscriber units, stations, cellular phones, personal digital assistants, wireless modems, wireless communication devices, handheld devices, laptops, cordless phones, Wireless local loop station, etc.
  • the present application is simply referred to as a terminal.
  • a base station also referred to as a base station device, is a device deployed in a radio access network to provide wireless communication functions.
  • the name of a base station may be different in different wireless access systems, for example, in a Universal Mobile Telecommunications System (UMTS) network, a base station is called a Node B, but in an LTE network.
  • a base station is called an evolved Node B (eNB or eNodeB).
  • eNB evolved Node B
  • NR transmission reception point
  • gNB next generation node B
  • Base stations in other various evolved networks may also adopt other names. The invention is not limited to this.
  • FIG. 4 is a schematic flowchart diagram of an information processing method according to an embodiment of the present invention.
  • the method is applicable to a communication system, where the communication system includes a communication device 30 and a communication device 31.
  • the method can be implemented by communication device 30, including:
  • the coding block is stored in a circular buffer, the coding block size is represented by N CB , and the coding block may also include padding bits.
  • the communication device 30 determines the output bit sequence for initial transmission or retransmission in the coding block in the circular buffer, and the output bit sequence does not include padding bits.
  • the upper limit of retransmission depends on the maximum number of retransmissions of the system, where a sequence of output bits for each initial transmission or retransmission may be a redundant version of the coded block.
  • k 0 (i) denotes the starting position of the output bit sequence of the i-th transmission in the coding block in the cyclic buffer, and may also be referred to as the starting position of the redundancy version rv(i) of the i-th retransmission.
  • the communication device 30 can determine the output bit sequence based on the length E(i) of the output bit sequence of the i-th transmission and the start position k 0 (i) acquired in step 401. For example, the communication device 30 from the first encoded block k 0 (i) obtain the start bit sequence E (i) bits as the output bit sequence.
  • the communication device 30 Since the output bit sequence does not include padding bits, the communication device 30 from k 0 coded block (i) of bits after the F (i) bits to obtain E (i) bits as the output bit sequence, wherein the number of filler bits F(i)-E(i), so its ending position is k 0 (i)+F(i), where F(i) is the order in which the E(i) is obtained from k 0 (i) in the coding block.
  • the number of bits required for the output bits, F(i) is an integer greater than or equal to zero.
  • the communication device 30 After the communication device 30 transmits the initial transmission, that is, the output bit sequence of the 0th transmission, and receives a negative acknowledgement NACK from the communication device 31, the communication device 30 needs to determine the output bit sequence of the first transmission, 1 is a first redundancy version rv (1) start position k 0 (1), so that the communication apparatus acquires the output of the output bit sequence is stored in the starting position k 0 (1) in the circular buffer in the coding block based on The length E(1) of the bit sequence and the starting position k 0 (1) determine the output bit sequence of the first transmission, that is, the redundancy version rv(1).
  • the communication device 30 transmits the output bit sequence rv(1) to the communication device 31.
  • the communication device 30 needs to determine the output bit sequence of the second transmission, that is, the start position k 0 (2) of the second redundancy version rv(2), The output bit sequence of the second transmission is determined based on the length E(2) of the output bit sequence and the starting position k 0 (2), that is, the redundancy version rv(2) is determined.
  • the communication device can end the retransmission of the coded block.
  • the communication device 30 can also perform multiple retransmissions without regard to NACK or ACK from the communication device 31.
  • the receiving communication device 31 When the receiving communication device 31 decodes, it needs to combine and decode the received initial soft-valued bits and the soft-valued bits of each redundant version.
  • the receiving communication device 31 In order to improve the decoding performance of the communication device at the receiving end, it is required to reduce the number of bits that are repeated or not transmitted between the redundancy versions.
  • the code rate of the core matrix before hole punching is 0.89, and the lowest code rate supported by it is 0.33, including information bits and redundant bits, where the information bits include System bit punctured bits and non-punctured information bits, the redundant bits include non-punctured dual column recheck bits, punctured dual column recheck bits, and single column recheck bits. Puncturing can also be expressed as not transmitting, then the punctured bits are bits that are not transmitted, and non-punctured means the bits that need to be transmitted.
  • the double-column re-check bit corresponds to the column of the double-diagonal structure part in the check matrix, and can also be said to be the column of the double-diagonal structure part in the core matrix.
  • the output bit sequence e 0 composed of the unpunctured information bits and the non-punctured double-column re-check bits has the highest code rate.
  • the decoding performance of the LDPC code there are various factors affecting the decoding performance of the LDPC code. For example, when decoding an LDPC code, it is usually required that redundant portions other than the information bits are selected to form a codeword decoding in the order of encoding. For another example, the LDPC code obtains a higher code rate than the native code rate supported by the core matrix by puncturing the double-column re-check bits, and the re-transmission needs to retransmit the punctured double-column re-check bits first. And then send a single column to the portion of the parity bit that is punctured. For another example, in the case of retransmission, if the ratio of repeated redundant bits is higher, the decoding performance is worse.
  • the initial transmission obtains the output bit sequence from the 0th starting position p 0 , which is the redundancy version.
  • the first retransmission obtains the output bit sequence from the second starting position p 2 , that is, the redundancy version 1
  • the redundancy version 0 and the redundancy version 1 are not continuous, and there are a large number of skipped bits. Not transmitted, especially the double column recheck bits are not selected.
  • the communication device at the receiving end receives the two redundancy versions and performs combined decoding. However, the redundant bits skipped in FIG.
  • the redundant bits in the redundancy version 1 cannot be selected to constitute the codeword decoding, which greatly degrades the decoding performance.
  • the skipped bits in Figure 5-2 also include the punctured double-column re-check bits, further degrading the decoding performance.
  • the initial transmission obtains the output bit sequence from the 0th starting position p 0 , that is, the redundancy version 0.
  • the first retransmission acquires the output bit sequence from the first starting position p 1 . That is, the redundancy version 1 is continuous between the redundancy version 0 and the redundancy version 1.
  • the initial transmission code rate is low, there are many repeated bits, which may also result in loss of decoding performance.
  • k 0 (i) can take the value p k , and p k is One of them, that is, the value of k max starting positions.
  • p k is an integer
  • k is an integer
  • N CB is the size of the coding block
  • k max is an integer greater than or equal to 4.
  • k max 2 n
  • n is an integer greater than or equal to 2
  • k max Nb, where Nb is the number of columns of the base matrix.
  • the subscript k of p k may be the number rvidx of the starting position of the redundancy version.
  • the collection can be only included A collection of these elements can also be a subset of other collections.
  • the collection The elements in the elements may be arranged in a specific order or may not be arranged in a specific order, and the present application is not particularly limited.
  • k max values It can be evenly distributed according to the difference.
  • the difference between the two values a and b can be expressed as
  • means taking the absolute value.
  • the difference between p k-1 , p k and p k-1 is
  • the integer S is the difference, and the difference between the two adjacent values is S.
  • K max values can be set based on the coding block size N CB S can be or In this way, if k>0, p k is satisfied. or, For another example, p k is satisfied or, or or,
  • the interval between redundant versions of each transmission does not change greatly or there are many repeated bits, which can adapt to various initial transmission code rates, and the performance is relatively stable.
  • k max values It can also be set in such a way that the difference changes.
  • p m+ 1 is used as the demarcation point, followed by k max -m-2 values
  • It can be set in such a way that the difference is incremented, for example, p m+2 -p m+1 ⁇ p m+3 -p m+2 .
  • the m values between p 0 and p m+1 can be evenly distributed according to the difference, for example, the value difference is or Or other way of changing the difference, it is not limited here.
  • a high bit rate output bit sequence is obtained, including information bits and non-punctured double column recheck bits, as shown by e 0 in FIG. 5-1
  • p m+1 can take the value of (Nb-Mb+j)*z.
  • p k If p k >(Nb-Mb+j)*z, p k satisfies p k -p k-1 ⁇ p k+1 -p k , where m+1 ⁇ k ⁇ k max -1.
  • the method can make the position near the information bit, the denser the distribution of the starting position, and the closer to the last bit of the coding block, the more sparse the starting position is.
  • the last four columns in the core matrix Hk are double-diagonal structural parts, that is, the corresponding double-column re-checking
  • k max 8 bits as an example.
  • p 1 , p 2 and p 3 There are three values of p 1 , p 2 and p 3 , and the difference between the two adjacent values is
  • p 5 , p 6 and p 7 between p 4 and the last bit of the coding block which are decremented according to the difference, and the difference is 6, 10 and 14, respectively, then k max is ⁇ 2, 28 , 54, 80, 108, 114, 124, 138 ⁇ .
  • the value p k in , in step 401 k 0 (i) can be obtained in a variety of ways.
  • the starting position k 0 (i) is based on the starting position k of the output bit sequence of the previous transmission. 0 (i-1) and the output bit sequence length E(i-1) of the previous transmission.
  • the direction from the end position of the output bit sequence of the previous transmission to the last bit of the coding block (Nth CB -1 bit) is taken as the backward direction, and the end position of the output bit sequence to be transmitted from the previous time.
  • the direction leading to the first bit (bit 0) of the coding block is taken as the forward direction.
  • the start position k 0 (i-1) of the output bit sequence of the previous transmission and the output bit sequence length E(i-1) of the previous transmission may be acquired backward.
  • the end position of the obtained output bit sequence is (k 0 (i-1)+F(i-1)-1) mod N CB .
  • the value p k of the first starting position in the backward direction from the end position of the previous output bit sequence is taken as k 0 (i), if the end position of the previous acquisition output bit sequence is greater than The maximum value in , then p k is The minimum value in .
  • p k is the minimum value that satisfies p k ⁇ ((k 0 (i-1)+F(i-1)) mod N CB ). If There is no value that satisfies p k ⁇ ((k 0 (i-1)+F(i-1)) mod N CB ), that is, ((k 0 (i-1)+F(i-1)) ) mod N CB) is greater than The maximum value in , then p k is The minimum value in .
  • the starting position k 0 (i-1) of the output bit sequence of the previous transmission is 124
  • the length E(i-1) of the output bit sequence of the previous transmission is 30 bits, wherein the number of padding bits is 0, the previous time
  • output bit sequence of the previous transmission acquires (i-1) and the output of the previous transmission bit sequence length E (i-1) forward starting Position k 0 (i). Since the padding bits are not included in the output bit sequence, if F(i-1) is the number of bits required to sequentially acquire E(i-1) output bits from k 0 (i-1) in the coding block, the previous time The end position of the obtained output bit sequence is (k 0 (i-1)+F(i-1)-1) mod N CB .
  • p k of the first starting position in the forward direction from the end position of the previous output bit sequence is taken as k 0 (i), if the end position of the previous output bit sequence is smaller than The minimum value in , then p k is The maximum value in . It can be seen that p k is the maximum value satisfying p k ⁇ ((k 0 (i-1) + F(i-1)) mod N CB ).
  • the coding block is 152 bits as an example, the starting position k 0 (i-1) of the output bit sequence of the previous transmission is 2, the previous transmission
  • the length of the output bit sequence E(i-1) 25 bits, since there are 5 bits of padding bits, the E(i-1) outputs are sequentially acquired from k 0 (i-1) in the coding block the previous time.
  • the starting position k 0 (i-1) of the output bit sequence of the previous transmission is 124
  • the length E(i-1) of the output bit sequence of the previous transmission is 20 bits
  • the results of the preceding two examples may be combined acquired k 0 (i) forward and acquiring k 0 (i) backward, the two The value that is the smallest difference from the end position of the previous acquisition output bit sequence is k 0 (i).
  • p k is The value with the smallest difference between ((k 0 (i-1)+F(i-1)) mod N CB ); or, if ((k 0 (i-1)+F(i-1)) ) mod N CB ) is less than The minimum value or ((k 0 (i-1)+F(i-1)) mod N CB ) is greater than The maximum value in , p k is Minimum value Maximum value The difference between the two and ((k 0 (i-1)+F(i-1)) mod N CB ) is the smallest difference.
  • p k+ and p k- may be determined first, where p k+ is the value of the first starting position in the backward direction from the end position of the previous output bit sequence. p k- is the value of the first starting position in the forward direction from the end position of the previous output bit sequence, and p k is the sum of (p 0+ and p k- (k 0 (i-1) ) +F(i-1)) mod N CB ) The smallest difference between the values. If the difference between p k+ and p k- and ((k 0 (i-1)+F(i-1)) mod N CB ) is equal, then the direction may be selected arbitrarily or according to the determined value direction. .
  • the coding block length is 152 bits as an example, and the starting position k 0 (i-1) of the output bit sequence of the previous transmission is 2, the previous time
  • the length of the transmitted output bit sequence E(i-1) 26 bits, the number of bits F required to sequentially acquire E(i-1) output bits from the previous k 0 (i-1) in the coding block ( I-1) is 30 bits.
  • the start of the ith transmission may also be determined based on the correspondence between the number of transmissions i and the direction of the acquisition start position k 0 (i). position k 0 (i) obtaining directions, based on an end position of the output bit sequence, and the previous transmission direction acquisition start position k 0 (i) the determined acquisition start position k 0 (i).
  • a table for obtaining the transmission number i and the starting position k 0 (i) may be set in the communication device. For example, as shown in Table 1, the maximum number of retransmissions is 3, and the initial transmission does not need to be set.
  • the coding block length is 152 bits as an example, and the initial position k 0 (0) of the initial output bit sequence is 2, the initial output bit
  • the starting position k 0 (3) 108. It should be noted that the examples herein are merely examples, and are not limited thereto.
  • the "forward” and “backward” directions in the acquisition direction can be indicated by specific numerical values, and are not limited to the expression of the literal, such as 0 for "forward", 1 for “backward”, or other numerical expressions.
  • the correspondence between the number of transmissions i and the starting position k 0 (i) is also defined by other forms, and the embodiment of the present invention is not limited thereto.
  • the acquisition direction of the start position of the output bit sequence of the i-th transmission may be determined based on the number of transmissions i, the acquisition direction based on the start position of the output bit sequence of the i-th transmission, and the start of the output bit sequence of the previous transmission
  • the position k 0 (i-1) and the output bit sequence length E(i-1) of the previous transmission are forwarded to the starting position k 0 (i).
  • the order of the starting positions acquired at each transmission may be defined, and the subscript of p k may be defined for each transmission.
  • the order of the values of k. This sequence may be indicated to the communication device at the receiving end, or may be stored in the communication device at both ends of the transmitting and receiving.
  • the subscript k of p k may be the number rv idx of the starting position of the redundancy version, and the number of the starting position of the redundancy version of the i th transmission may be represented as rv idx (i), the starting position k 0 (i ) can be determined based on the number rv idx (i mod k max ) of the starting position of the redundancy version.
  • a fixed-order starting position obtaining method may be used.
  • the value order of the rv idx may be defined.
  • the number of values in the value sequence may be k max or the maximum number of retransmissions R max .
  • k max 8
  • the order of rv idx is 0, 3, 6, 2, 5, 7, 4, 1.
  • the maximum number of retransmissions R max 3
  • the order of the value of rv idx is ⁇ 0, 2, 3, 1 ⁇
  • k rv idx (i mod R max)
  • k 0 (i) p k.
  • the order of the value of rv idx may also be determined according to the size of the initial transmission code rate, or may be determined based on the length E of the output bit sequence and the spreading factor z of each transmission.
  • the lengths of the output bit sequences of the initial transmission and the retransmission are equal, for example based on Determine the order of the values of rv idx .
  • an LDPC matrix of 66*82 is used, wherein the number of information bit columns is 16.
  • the correspondence between the order of the values of rv idx and the initial code rate can be seen in Table 3, for example.
  • the order of rv idx is ⁇ 0,3,6,2 ⁇ .
  • This method is suitable for non-adaptive retransmissions, and the information of the starting position does not need to be indicated to the receiving communication device before each transmission.
  • the starting position k 0 (i) of the output bit sequence in the encoded block may also be obtained based on the rv idx indicated by the transmitting communication device. This method is suitable for adaptive retransmission.
  • the output bit sequence of the ith transmission and the output bit sequence of the i-1th transmission are connected end to end.
  • the output bit sequences of the two adjacent transmissions are continuous, and there are no repeated bits between the two, and such an output bit sequence is transmitted to the communication device at the receiving end to achieve better decoding performance.
  • E offset the offset E offset
  • k 0 (i) (k 0 (i-1) + F(i-1) + E offset ) mod N CB
  • k 0 (i) (k 0 (i-1)+F(i-1)) mod N CB .
  • the offset is increased by each time in the retransmission, so that the number of repeated bits is reduced, and the loss of decoding performance is reduced.
  • the communication device may further process the output bit sequence such that the output bit sequence is used in transmitting or receiving, for example, interleaving the output bit sequence, and mapping to Processing of modulation symbols, etc.
  • the output bit sequence is used in transmitting or receiving, for example, interleaving the output bit sequence, and mapping to Processing of modulation symbols, etc.
  • FIG. 6 is a flowchart of an information processing method according to an embodiment of the present invention.
  • the method is applicable to a communication system, where the communication system includes a communication device 30 and a communication device 31.
  • the method can be implemented by the communication device 31, including:
  • step 602 The soft bit sequence in step 601 is merged and saved in the soft information buffer starting from the starting position k 0 (i).
  • the communication device 30 transmits the output bit sequence obtained in the foregoing embodiments to the communication device 31.
  • the output bit sequence in the above embodiment is a rate-matched output bit sequence, and the communication device 30 can rate the rate.
  • the matched output bit sequence is subjected to interleaving modulation or the like to transmit a transmission signal corresponding to the output bit sequence, and the communication device 31 receives the output signal and demodulates and deinterleaves to obtain a soft bit corresponding to the output bit sequence.
  • the sequence, that is, one bit in the output bit sequence corresponds to a soft channel bit in the soft bit sequence.
  • the locations where the soft value bits are stored in the soft information buffer of the communication device 31 correspond one-to-one with the locations of the coded blocks in the circular buffer in the communication device 30, and the size of the soft information buffer is the same as the size of the coded block in the circular buffer. , can be N CB .
  • the output bit transmitted by the communication device 30 is 1, and after the channel transmission, the communication device 31 obtains its corresponding soft value bit to be 1.45. If the position of the output bit in the coding block is the 5th bit, the soft in the communication device 31 The 5th soft value bit in the message buffer is 1.45. It should be noted that the description herein is merely an example, and the embodiment of the present invention is not limited thereto. If the output bit sequence acquired by the communication device 30 includes n output bits, the communication device 31 can acquire n corresponding soft value bits. If the communication device 31 receives the soft value bits of the same location twice, the two soft values are combined, for example, the soft value bit received during the first transmission is 1.45, and the softness received during the second transmission. The value bit is 0.5, which is 1.95 after the combination. It should be noted that the examples are merely examples and are not limited thereto.
  • the starting position k 0 (i) and the obtaining manner thereof have the features corresponding to the foregoing embodiments, and can be referred to the foregoing embodiments, and details are not described herein again. It should be noted that, for the communication device 30, the starting position is relative to the coding block in the circular buffer, and in the communication device 31, the starting position is relative to the soft information buffer; at the communication device 30 The side determines the output bit sequence from the coded block in the circular buffer, and on the communication device 31 side, saves the received soft bit sequence into the soft information buffer.
  • Figure 7 shows a block diagram of an apparatus 700 for information processing that can be used with the communication device 30 in the communication system shown in Figure 3.
  • Device 700 may also be referred to as a rate matching device.
  • the device 700 can be used to implement the foregoing method embodiments. For details, refer to the description in the foregoing method embodiments, and details are not described herein.
  • Apparatus 700 can include an acquisition unit 701 and a processing unit 702. among them:
  • the obtaining unit 701 is configured to obtain a starting position k 0 (i) of the output bit sequence in the encoding block; the processing unit 702 is configured to extract from the output bit sequence length E(i) and the starting position k 0 (i) An output bit sequence is determined in the encoding block, wherein the encoding block is stored in a circular buffer, and i is an integer greater than or equal to zero.
  • k 0 (i) and determine the output bit sequence based on E(i) and k 0 (i) refer to the description in the above method embodiment.
  • Figure 8 shows a block diagram of an apparatus 800 for information processing that can be used with the communication device 31 in the communication system shown in Figure 3.
  • Device 800 may also be referred to as a de-rate matching device.
  • the device 800 can be used to implement the foregoing method embodiments. For details, refer to the description in the foregoing method embodiments.
  • Apparatus 800 can include an acquisition unit 801 and a processing unit 802.
  • the obtaining unit 801 is configured to acquire a starting position k 0 (i) of the soft bit sequence of length E(i) stored in the soft information buffer; the processing unit 802 is configured to start from the starting position k 0 (i) The soft bit sequence acquired by the obtaining unit 801 is started to be merged and stored in the soft information buffer.
  • Fig. 9 is a block diagram showing the structure of a communication device which can be applied to the communication system shown in Fig. 3.
  • Communication device 30 may include an encoder 301, a rate matcher 302, and a transceiver 303.
  • the encoder 301 may also be referred to as a coding unit or an encoding circuit, etc., and is mainly used for encoding information data.
  • the rate matcher 302 may also be referred to as a rate matching unit or a rate matching circuit, etc., and is mainly used for encoding based on the encoder 301.
  • the resulting coded block determines the sequence of output bits to be transmitted, for example for determining the output bit sequence in the above embodiment, which may include the apparatus 700 as in FIG.
  • the transceiver 303 may also be referred to as a transceiver unit, a transceiver, or a transceiver.
  • the circuit or the like is mainly used for transmitting and receiving radio frequency signals, for example, for transmitting the output bit sequence described in the above embodiment to the communication device 31.
  • the communication device 30 may also include other devices, such as means for generating a transport block CRC, a device for code block partitioning and CRC check, an interleaver, a modulator, etc., which may be used to implement each of the communication devices 30 of FIG. 3, respectively.
  • the communication device 30 can include one or more memories, and one or more processors, the memory storing instructions coupled to the memory for retrieving instructions in the memory to The various steps described in the above method embodiments are performed. Other instructions may also be included in the memory for the processor to invoke functions of other portions of the communication device 30, such as code block splitting and CRC checking, interleaving, modulation, and the like.
  • Fig. 10 is a block diagram showing the structure of a communication device which can be applied to the communication system shown in Fig. 3.
  • the communication device 31 can include a decoder 311, a de-rate matcher 312, and a transceiver 313.
  • the de-rate matcher 312 may also be referred to as a de-rate matching unit or a de-rate matching circuit, and may be used to combine soft-valued bits, for example, for combining soft-valued bits of the output bit sequence described in the above embodiments in soft information.
  • the apparatus 800 may be included as shown in FIG.
  • the decoder 311 which may also be referred to as a decoding unit or a decoding circuit, is mainly used for decoding the received signal, for example, for softening the soft information cache.
  • the value bit is decoded;
  • the transceiver 313 may also be referred to as a transceiver unit, a transceiver, or a transceiver circuit, etc., and is mainly used for transmitting and receiving radio frequency signals, for example, for receiving the communication device 30 to transmit the output bit sequence described in the above embodiment.
  • the communication device 31 may also include other devices, such as means for transport block CRC check, block merging, deinterleaver, demodulator, etc., respectively, for implementing portions of the communication device 31 of FIG. Features.
  • the communication device 31 may include one or more memories and processors for implementing various functions of the communication device 31 as in FIG.
  • the memory and processor can be set individually for each device. It is also possible that multiple devices share the same memory and processor.
  • the communication device 31 can include one or more memories, and one or more processors, the memory storing instructions coupled to the memory for retrieving instructions in the memory to The various steps described in the above method embodiments are performed. Other instructions may also be included in the memory for the processor to invoke functions of other portions of the communication device 30, such as code block combining, de-interleaving, demodulation, and the like.
  • a general purpose processor may be a microprocessor.
  • the general purpose processor may be any conventional processor, controller, microcontroller, or state machine.
  • the processor may also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration. achieve.
  • the steps of the method or algorithm described in the embodiments of the present invention may be directly embedded in hardware, instructions executed by a processor, or a combination of the two.
  • the memory can be RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium in the art.
  • the memory can be coupled to the processor such that the processor can read information from the memory and can write information to the memory.
  • the memory can also be integrated into the processor.
  • the processor and the memory may be disposed in an ASIC, and the ASIC may be disposed in the UE. Alternatively, the processor and memory may also be located in different components in the UE.
  • the present invention can be implemented in hardware, firmware implementation, or a combination thereof.
  • a software program it may be implemented in whole or in part in the form of a computer program product comprising one or more computer instructions.
  • the processes or functions described in accordance with embodiments of the present invention are generated in whole or in part.
  • the functions described above may also be stored in or transmitted as one or more instructions or code on a computer readable medium.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one location to another.
  • a storage medium may be any available media that can be accessed by a computer.
  • computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage media or other magnetic storage device, or can be used for carrying or storing in the form of an instruction or data structure.
  • Any connection may suitably be a computer readable medium.
  • a disk and a disc include a compact disc (CD), a laser disc, a compact disc, a digital versatile disc (DVD), a floppy disk, and a Blu-ray disc, wherein the disc is usually magnetically copied, and the disc is The laser is used to optically replicate the data. Combinations of the above should also be included within the scope of the computer readable media.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Mathematical Physics (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Algebra (AREA)
  • Computing Systems (AREA)
  • Quality & Reliability (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请公开了信息处理的方法，装置、通信设备和通信系统。通信设备用于获取输出比特序列在循环緩存中的编码块中的起始位置，并且基于输出比，序列的长度、所述起始位置从编码块中确定输出比特序列，其中，起始位置的取值为｛ P0, P1, P2..., Pkmax-1 ｝中的一个，其中，0≤pk＜NCB，p k为整数，k为整数，0≤k＜kmax，N CB为所述编码块的大小，kmax为大于或者等于4的整数。由于合理确定初传或者重传的比特序列，以使得接收端通信设备接收到比特序列后译码性能得到改善，提高译码成功率，进一步减少重传次数。

Description

信息处理的方法、装置、通信设备和通信系统
本申请要求于2017年2月4日提交中国专利局、申请号为201710064621.X、申请名称为“信息处理的方法、装置、通信设备和通信系统”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明实施例涉及通信领域，尤其涉及信息处理的方法、装置、通信设备和通信系统。
背景技术
在无线通信系统中，混合自动重传(Hybrid Automatic Repeat Request，HARQ)技术是一项重要的技术，能够很好地提高数据链路的可靠性。
低密度奇偶校验(low density parity check，LDPC)码是一类具有稀疏校验矩阵的线性分组编码，具有结构灵活，译码复杂度低的特点。由于它采用部分并行的迭代译码算法，从而比传统的Turbo码具有更高的吞吐率。LDPC码被认为是通信系统的下一代纠错码，可用来提高信道传输的可靠性和功率利用率；并可以广泛应用于空间通信、光纤通信、个人通信系统、ADSL和磁记录设备等。目前在第五代移动通信中已考虑采用LDPC码作为信道编码方式之一。
为了支持各种不同码长码率，通信设备在信道编码后会进行速率匹配调整编码块的码率，获取要发送的比特序列，以匹配译码码率。通信设备还可以在速率匹配时对编码生成的LDPC码块进行比特打孔提高码率，或者在速率匹配时对编码生成的LDPC码块进行比特重复降低码率。
发送端的通信设备在速率匹配环节选取要发送的比特序列，经过交织、映射等处理后发送给接收端通信设备。接收端通信设备将比特序列的软值和已保存的软值比特(soft channel bit)合并译码得到编码块。
现有技术中，发送端的通信设备采用已有的速率匹配的方法时，HARQ性能较差。
发明内容
本发明实施例提供了一种信息处理的方法、装置、通信设备和通信系统，可以改善HARQ性能。
第一方面，提供了一种通信系统中信息处理的方法，包括：
获取输出比特序列在编码块中的起始位置k 0(i)；
基于输出比特序列长度E(i)及所述起始位置k 0(i)从所述编码块中确定输出比特序列，其中，所述编码块存储于循环缓存中，i为大于或者等于0的整数。
第二方面，提供了一种通信系统中信息处理的方法，包括：
获取长度为E(i)的软比特序列在软信息缓存中保存的起始位置k 0(i)；
从起始位置k 0(i)开始将软比特序列合并保存在软信息缓存中。
在上述第一方面或者第二方面的一种可能的实现方式中，对于重传，即i>0，k 0(i)是根据前一次传输的输出比特序列的起始位置k 0(i-1)和前一次传输的输出比特序列的长度E(i-1)确定的。k 0(i)＝(k 0(i-1)+F(i-1))mod N CB。其中，N CB为编码块大小，F(i-1)为编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目。
在这种方式下，相邻两次传输的输出比特序列是连续的，并且两者之间没有重复的比特，这样的输出比特序列发送至接收端的通信设备，可以达到较佳的译码性能。
基于上述实现方式的一种可能的实现方式中，若编码块中的末位比特已被传输，则k 0(i)＝(k 0(i-1)+F(i-1)+E offset)mod N CB，否则，k 0(i)＝(k 0(i-1)+F(i-1))mod N CB。
这种方式可以使得所有比特被传输后，使得重复的比特数减少，减少译码性能的损失。
在上述第一方面或者第二方面的又一种可能的实现方式中，k 0(i)取值为p k，p k为
Figure PCTCN2018074574-appb-000001
中的一个，其中，0≤p k＜N CB，p k为整数，k为整数，0≤k＜k max，N CB为所述编码块的大小，k max为大于或者等于4的整数。
例如，k max＝2 n，n为大于或者等于2的整数，或者，k max＝Nb，Nb为基矩阵的列数。
基于第一方面或者第二方面或者上述实现方式的又一种可能的实现方式中，若k＝0，则p 0＝l·z，其中，l为整数，且0≤l＜Nb；或者，若0＜k＜k max，p k＝(p k-1+S)mod N CB。其中，S为整数，如，
Figure PCTCN2018074574-appb-000002
或者，
Figure PCTCN2018074574-appb-000003
或者，S＝z，z为所述编码块的扩展因子。其中
Figure PCTCN2018074574-appb-000004
表示向上取整，
Figure PCTCN2018074574-appb-000005
表示向下取整。
以
Figure PCTCN2018074574-appb-000006
或者，
Figure PCTCN2018074574-appb-000007
为例，p k满足
Figure PCTCN2018074574-appb-000008
或者，
Figure PCTCN2018074574-appb-000009
又例如，p k满足
Figure PCTCN2018074574-appb-000010
或者，
Figure PCTCN2018074574-appb-000011
或者
Figure PCTCN2018074574-appb-000012
或者，
Figure PCTCN2018074574-appb-000013
以S＝z，z为所述编码块的扩展因子为例，p k＝(k·z)mod N CB。在此方式中，k max可以取值为Nb，Nb为基矩阵的列数。
上述方法可以适应多种初传码率，使得每次传输的冗余版本之间的间隔不会变化较大或者重复的比特较多，性能比较稳定。
在上述第一方面或者第二方面的又一种可能的实现方式中，k 0(i)取值为p k，p k为
Figure PCTCN2018074574-appb-000014
中的一个，其中，0≤p k＜N CB，p k为整数，k为整数，0≤k＜k max，N CB为所述编码块的大小，k max为大于或者等于4的整数。
例如，k max＝2 n，n为大于或者等于2的整数，或者，k max＝Nb，Nb为基矩阵的列数。
若p k>(Nb-Mb+j)*z，则p k满足p k-p k-1≤p k+1-p k，其中，p m+1＝(Nb-Mb+j)*z，且0<m+1<k<k max-1，j为所述编码块中双列重校验比特的个数，或者j为所述编码块中不可打孔的双列重校验比特的个数，z为所述编码块的扩展因子。
若p k＜(Nb-Mb+j)*z，p k满足
Figure PCTCN2018074574-appb-000015
或者，
Figure PCTCN2018074574-appb-000016
其中，p m+1＝(Nb-Mb+j)*z且0<k<m+1，j为所述编码块中双列重校验比特的个数，或者j为所述编码块中不可打孔的双列重校验比特的个数，z为所述编码块的扩展因子。
该方法可以使得靠近信息比特的位置，起始位置的分布越密集，靠近编码块末位比特，起始位置的分别越稀疏。
在上述各实现方式中，k max可以为大于4的整数，如，k max＝5，或k max＝2 n，k max达到8个及以上，n为大于2的整数，如8个或者16个，又例如，k max＝Nb，Nb为编码块的基矩阵的列数。k max增加可以使得各冗余版本的起始位置间的距离减小，基于该起始位置确定的冗余版本也可以提高接收端的通信设备的译码性能。
基于上述任一种实现方式的又一可能的实现方式中，对于重传，即i>0，所述起始位置k 0(i)是基于前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)确定的。
在一种可能的实现方式中，为了减少重复冗余比特的数目，p k为满足p k≥((k 0(i-1)+F(i-1))mod N CB)的最小值；或者，若((k 0(i-1)+F(i-1))mod N CB)大于
Figure PCTCN2018074574-appb-000017
中的最大值，则p k为
Figure PCTCN2018074574-appb-000018
中的最小值。
在又一种可能的实现方式中，为了满足顺序译码的要求，p k为满足p k≤((k 0(i-1)+F(i-1))mod N CB)的最大值；或者，若((k 0(i-1)+F(i-1))mod N CB)小于
Figure PCTCN2018074574-appb-000019
中的最小值，则p k为
Figure PCTCN2018074574-appb-000020
中的最大值。
在又一种可能的实现方式中，为了平衡重复比特和缺失冗余比特在译码在性能上的损失，若
Figure PCTCN2018074574-appb-000021
p k为
Figure PCTCN2018074574-appb-000022
中与((k 0(i-1)+F(i-1))mod N CB)之间差值最小的值；或者，若((k 0(i-1)+F(i-1))mod N CB)小于
Figure PCTCN2018074574-appb-000023
中的最小值或者((k 0(i-1)+F(i-1))mod N CB)大于
Figure PCTCN2018074574-appb-000024
中的最大值，p k为
Figure PCTCN2018074574-appb-000025
中的最小值与
Figure PCTCN2018074574-appb-000026
中的最大值
Figure PCTCN2018074574-appb-000027
两者之中与((k 0(i-1)+F(i-1))mod N CB)之间差值最小的值。
在又一种可能的实现方式中，为了平衡重复比特和缺失冗余比特在译码在性能上的损失，所述起始位置k 0(i)是基于前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)，以及传输次数i确定的。
在上述实现方式中，F(i-1)为编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特所需的比特数目。
基于上述任一种实现方式的又一可能的实现方式中，所述起始位置k 0(i)是基于冗余版本起始位置的编号rv idx(i)确定。
例如，自适应重传时，冗余版本编号rv idx(i)可以通过信令获取。
又例如，对于自适应重传或非自适应重传，所述冗余版本起始位置的编号rv idx(i)可以基于冗余版本起始位置的编号顺序以及传输次数i获取的。
其中，所述冗余版本起始位置的编号顺序是从存储器中读取的，或者所述冗余版本起始位置的编号顺序是基于初传码率确定的，或者，所述冗余版本起始位置的编号顺序是基于输出比特序列的长度和扩展因子z确定的。
第三方面，提供了一种通信系统中信息处理的装置，包括：
获取单元，用于获取输出比特序列在编码块中的起始位置k 0(i)；
处理单元，用于基于输出比特序列长度E(i)及所述起始位置k 0(i)从所述编码块中确定输出比特序列，其中，所述编码块存储于循环缓存中，i为大于或者等于0的整数。
所述装置可以用于执行上述第一方面或者第一方面任一种可能的实现方式所述的方法，具体参照上述方面的描述。
在一个可能的设计中，本申请提供的信息处理的装置可以包含用于执行上述方法设计中第一方面或者第一方面任一种可能的实现方式相对应的模块。所述模块可以是软件和/或是硬件。
第四方面，提供了一种通信系统中信息处理的装置，包括：
获取单元，用于获取长度为E(i)的软比特序列在软信息缓存中保存的起始位置k 0(i)；
处理单元，用于从起始位置k 0(i)开始将获取到的软比特序列合并保存在软信息缓存中。
所述装置可以用于执行上述第二方面或者第二方面任一种可能的实现方式所述的方法，具体参照上述方面的描述。
在一个可能的设计中，本申请提供的信息处理的装置可以包含用于执行上述方法设计中第二方面或者第二方面任一种可能的实现方式相对应的模块。所述模块可以是软件和/或是硬件。
第五方面，提供了一种通信设备，包括编码器，速率匹配器和收发器，其中：
编码器，用于对信息数据进行编码；
速率匹配器，包括如前述第三方面所述的信息处理的装置，用于确定上述实施例中的输出比特序列；
收发器，用于发送对应于所述速率匹配器的输出比特序列的发送信号。
第六方面，提供了一种通信设备，包括译码器，解速率匹配器和收发器，其中：
收发器，用于接收对应上述方面中所述的输出比特序列的软比特序列的信号。
译码器，用于对软信息缓存中软值比特进行译码；
解速率匹配器，包括如前述第四方面所述的信息处理的装置，用于将上述方面中所述的输出比特序列的软值比特合并保存在软信息缓存中；
第七方面，本发明实施例提供了一种通信系统，该系统包括上述第五方面所述的通信设备和上述第六方面所述的通信设备。
再一方面，本发明实施例提供了一种计算机存储介质，其包含用于执行上述方面所设计的程序。
本申请的又一方面提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
本发明实施例的信息处理的方法、装置、通信设备和通信系统，合理确定初传或者重传的输出比特序列，使得接收端通信设备接收到输出比特序列的软比特序列后译码性能得到改善，译码成功率得到提高，进一步减少重传次数。
附图说明
图1为一LDPC码的基矩阵及其置换矩阵的示意图；
图2为一LDPC码的校验矩阵的结构示意图；
图3为本发明一实施例提供的通信系统的结构图；
图4为本发明另一实施例提供的信息处理方法的流程图；
图5-1为本发明另一实施例提供的编码块的示意图；
图5-2为本发明另一实施例提供的编码块的示意图；
图5-3为本发明另一实施例提供的编码块的示意图；
图6为本发明另一实施例提供的信息处理方法的流程图；
图7为本发明另一实施例提供的信息处理装置的结构图；
图8为本发明另一实施例提供的信息处理装置的结构图；
图9为本发明另一实施例提供的通信设备的结构图；
图10为本发明另一实施例提供的通信设备的结构图。
具体实施方式
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行描述。
图1示出了通信系统中的一种LDPC码的基矩阵及其置换矩阵的示意图。LDPC码的基矩阵具有m*n个元素，如果采用z为扩展因子进行扩展，则可以得到校验矩阵H为(m*z)*(n*z)的矩阵，也就是有m*n个分块矩阵构成，每个分块都是一个z*z的单位矩阵经过循环移位获得。扩展因子z一般根据系统支持的码块大小和信息数据的大小确定的。如图1所示为一个m＝13，n＝38具有QC结构的LDPC码的基矩阵，其码率为(n-m)/n＝0.6579。如果扩展因子z＝4，则矩阵中所有值为-1的元素经过扩展后为一个4*4大小的全0矩阵，其他元素扩展后则为4*4的置换矩阵。置换矩阵可 以由一个单位矩阵I经过相应次数的循环位移得到，位移次数等于对应的矩阵元素的值。如图1所示，基矩阵中值为0的元素扩展后对应的置换矩阵为4*4的单位矩阵I，值为1的元素扩展后对应的置换矩阵为单位矩阵经过1次位移得到的矩阵，以此类推，此处不再赘述。
基矩阵展开后可以作为LDPC码编码或译码用的校验矩阵。一个码长为n，信息序列长度为k，记为(n，k)的LDPC码可以由校验矩阵H唯一确定，校验矩阵H是稀疏矩阵，其每一行表示一个校验方程约束，对应j个编码比特，每一列表示一个编码比特由m个校验方程约束，任意两个校验方程包含至多一个相同的编码比特。如下式(1)给出了一个LDPC码的校验矩阵H及其对应的校验方程的实例：
Figure PCTCN2018074574-appb-000028
图2示出了一个LDPC码的校验矩阵的示例。如图2所示，该校验矩阵包括了核心矩阵和3个扩展矩阵部分。对于信息数据，可以分别采用4个校验矩阵进行编码和译码：核心矩阵，核心矩阵和扩展矩阵部分1构成的校验矩阵1，核心矩阵、扩展矩阵部分1和扩展矩阵部分2构成的校验矩阵2，核心矩阵、扩展矩阵部分1、扩展矩阵部分2和扩展矩阵部分3构成的完整矩阵。这些校验矩阵具有Raptor-like结构，校验位具有双对角和单列重双重结构，核心矩阵通常包括双对角结构部分。如果编码前的信息比特数为k，根据校验矩阵生成的LDPC编码块的码长为n，则码率为k/n，采用不同的校验矩阵进行编码可以得到具备不同码率的LDPC编码块。可以看出在这些编码块中，根据完整矩阵生成的LDPC码的码长最大，具备最低码率为R min；根据核心矩阵生成的LDPC码码长最小，具备最高码率为R max，根据校验矩阵1生成的LDPC码具备的码率为R 1，根据校验矩阵2生成的LDPC码具备的码率为R 2，则R min＜R 2＜R 1＜R max。需要说明的是，在上述示例中，完整矩阵，核心矩阵、校验矩阵1或者校验矩阵2都可以作为LDPC码的基矩阵根据扩展因子扩展后的编码或者译码矩阵。
在通信系统中，信息数据在通信设备(例如，基站或者终端)之间传输，由于无线传播环境复杂多变，容易受到干扰，出现差错。为了可靠地发送信息数据，在发送端，通信设备对信息数据进行CRC校验、信道编码、速率匹配、交织等处理，并将交织后的编码比特映射成调制符号发送给接收端的通信设备。接收设备接收到调制符号后，相应地通过解交织、解速率匹配、译码，CRC校验恢复成信息数据。这些过程可以减少传输差错，提高数据传输的可靠性。
图3示出的通信系统300可广泛用于提供诸如语音，数据等各种类型的通信。所述通信系统可包括多个无线通信设备。清楚起见，图3仅示出了通信设备30和通信设备31。控制信息或者数据信息作为信息序列在通信设备30和通信设备31之间接收和 发送。通信设备30作为发送端通信设备，按照传输块(transmission block，TB)发送信息序列，并对每一传输块增加CRC校验。如果添加校验后的传输块大小超过最大码块长，则需要将传输块划分为若干码块(code block，CB)，每个码块中也可以增加码块CRC校验，或者每组码块中增加码块组CRC校验，还可以对每个码块添加填充比特。通信设备30对每个码块分别进行信道编码，例如，采用LDPC编码，得到相应的编码块。其中，每个编码块中包括信息比特和校验比特，如果信息比特中包括填充比特，填充比特通常表示为“空”(Null)。
编码块或者经过比特重排序的编码块保存在通信设备30的循环缓存中，通信设备30从循环缓存中的编码块顺序获取多个输出比特得到输出比特序列，输出比特是编码块中除填充比特以外的比特，从而输出比特序列是不包括填充比特的。经过交织、映射为调制符号后发送。通信设备30发生重传时将从循环缓存中的编码块选取另一输出比特序列发送，如果顺序获取输出比特达到循环缓存的末位比特时，则从循环缓存的首位比特开始继续选取输出比特。
通信设备31对接收到的调制符号解调，解交织后，将接收到的输出比特序列的软值保存在软信息缓存(soft buffer)中相应位置。如果发生重传，通信设备31将每次重传的输出比特序列的软值合并保存在软信息缓存中，这里的合并是指，如果两次接收到的输出比特的位置相同，则将两次接收到的该输出比特的软值合并。其中，通信设备31中软信息缓存中的位置和通信设备30中循环缓存中的编码块的位置是一一对应的。也就是，如果输出比特在通信设备30中循环缓存中的编码块中的位置是第p比特，则其软值在通信设备31中软信息缓存中的位置也是第p比特。
通信设备31对软信息缓存中的所有软值进行译码得到信息序列的一个码块。由于通信设备31可以获取传输块大小，因此可以确定一个传输块被分割的码块个数以及各码块长度，如果码块中包括CRC比特段，通信设备31还可以利用该CRC比特段对码块进行校验。通信设备31将各码块级联为一个传输块，进一步对传输块进行校验及级联最终得到信息序列。可见通信设备31执行的是通信设备30信息处理方法的逆过程。
需要说明的是，在本发明各实施例中，通信设备30可以是通信系统中的网络设备，如基站，则相应的通信设备31可以是终端。通信设备30也可以是通信系统中的终端，则相应的，通信设备31可以是通信系统中的网络设备，如基站等。
为便于理解下面对本申请中涉及到的一些名词做些说明。
本申请中，名词“网络”和“系统”经常交替使用，但本领域的技术人员可以理解其含义。终端是一种具有通信功能的设备，可以包括具有无线通信功能的手持设备、车载设备、可穿戴设备、计算设备或连接到无线调制解调器的其它处理设备等。在不同的网络中终端可以叫做不同的名称，例如：用户设备，移动台，用户单元，站台，蜂窝电话，个人数字助理，无线调制解调器，无线通信设备，手持设备，膝上型电脑，无绳电话，无线本地环路台等。为描述方便，本申请中简称为终端。基站(base station，BS)，也可称为基站设备，是一种部署在无线接入网用以提供无线通信功能的设备。在不同的无线接入系统中基站的叫法可能有所不同，例如在而在通用移动通讯系统(Universal Mobile Telecommunications System，UMTS)网络中基站称为节点B(NodeB),而在LTE网络中的基站称为演进的节点B(evolved NodeB，eNB或者 eNodeB)，在新空口(new radio,NR)网络中的基站称为收发点(transmission reception point，TRP)或者下一代节点B(generation nodeB，gNB)，或者其他各种演进网络中的基站也可能采用其他叫法。本发明并不限于此。
图4为本发明一实施例提供的信息处理方法的流程示意图，该方法可用于通信系统，该通信系统包括通信设备30和通信设备31。该方法可以由通信设备30来实施，包括：
401：获取输出比特序列在编码块中的起始位置k 0(i)。
在通信设备30中，编码块存储于循环缓存中，编码块大小用N CB表示，编码块中也可以包括填充比特。在对编码块进行初传或者重传时，通信设备30在循环缓存中的编码块中确定输出比特序列用于初传或者重传，输出比特序列是不包括填充比特的。为了方便说明，第i次传输表示初传或者重传，i＝0表示初传，i>0表示重传，i为整数，例如i＝1表示第一次重传，i＝2表示第二次重传等等。重传的上限取决于系统最大重传次数，其中对于每次初传或者重传的输出比特序列，可以是该编码块的一个冗余版本。k 0(i)表示第i次传输的输出比特序列在循环缓存中的编码块中的起始位置，也可以称之为第i次重传的冗余版本rv(i)的起始位置。
402：基于输出比特序列长度E(i)及起始位置k 0(i)从循环缓存中确定输出比特序列。
通信设备30可以基于第i次传输的输出比特序列的长度E(i)和步骤401中获取到的起始位置k 0(i)确定输出比特序列。例如，通信设备30从编码块的第k 0(i)比特开始顺序获取E(i)个比特作为输出比特序列。由于输出比特序列中不包括填充比特，通信设备30从编码块的第k 0(i)比特经过F(i)个比特得到E(i)个比特作为输出比特序列，则其中的填充比特数为F(i)-E(i)，因此其结束的位置是k 0(i)+F(i)，其中，F(i)为编码块中从k 0(i)开始顺序获取E(i)个输出比特的所需的比特数目，F(i)为大于或者等于0的整数。
例如，通信设备30对初传，也就是第0次传输的输出比特序列进行发送后，收到来自通信设备31的否定应答NACK，则通信设备30需要确定第1次传输的输出比特序列，也就是第1个冗余版本rv(1)的起始位置k 0(1)，因此通信设备获取该输出比特序列在存储于循环缓存中的编码块的起始位置k 0(1)，基于输出比特序列的长度E(1)及起始位置k 0(1)确定第1次传输的输出比特序列，也就是确定冗余版本rv(1)。通信设备30将输出比特序列rv(1)发送至通信设备31。若通信设备30接收到来自通信设备31的NACK，则通信设备30需要确定第2次传输的输出比特序列，也就是第2个冗余版本rv(2)的起始位置k 0(2)，基于输出比特序列的长度E(2)及起始位置k 0(2)确定第2次传输的输出比特序列，也就是确定冗余版本rv(2)。以此类推，直至达到最大重传次数，或者通信设备30收到来自通信设备31的肯定应答ACK，则通信设备可以结束该编码块的重传。当然，通信设备30也可以进行多次重传，而无需考虑来自通信设备31的NACK或者ACK。
接收端通信设备31译码时需要对接收到的初传的软值比特和各冗余版本的软值比特进行合并译码。对于采用LDPC编码的编码块，为了提高接收端通信设备的译码性能则要求减少各冗余版本之间重复或者不发的比特数。
以图5-1所示的一个LDPC编码块为例，假设其核心矩阵打孔前的码率为0.89， 其支持的最低码率为0.33，其中包括信息比特和冗余比特，其中信息比特包括系统位打孔比特和不可打孔的信息比特，冗余比特包括不可打孔的双列重校验比特，可以打孔的双列重校验比特和单列重校验比特。打孔也可以表示为不发送，则打孔比特为不被发送的比特，不可打孔的意味着需要被发送的比特。其中，双列重校验比特对应到校验矩阵中的双对角结构部分的列，也可以说是核心矩阵中的双对角结构部分的列。其中不可打孔的信息比特和不可打孔的双列重校验比特构成的输出比特序列e 0的码率最高。
影响LDPC码的译码性能有多种因素，例如，对LDPC码译码时通常要求除信息位以外的冗余部分按照编码的顺序选择构成码字译码。又例如，LDPC码通过对双列重校验比特打孔来获得比核心矩阵支持的原生码率更高的码率，则重传时需要先重传这些被打孔的双列重校验比特，再发送单列重部分被打孔的校验比特。又例如，重传时，若重复的冗余比特占比越高，译码性能越差。
如图5-2所示，有4个起始位置的取值p 0，p 1，p 2和p 3，初传从第0个起始位置p 0获取输出比特序列，也就是冗余版本0，第1次重传从第2个起始位置p 2获取输出比特序列，也就是冗余版本1，则冗余版本0和冗余版本1之间并不连续，有大量跳过的比特不被传输，尤其是双列重校验比特没有被选择。接收端的通信设备接收到两个冗余版本后进行合并译码。而图5-2中跳过的冗余比特由于没有被传输到接收端通信设备，因此无法先于冗余版本1中冗余比特被选择构成码字译码，极大地损失了译码性能。并且图5-2中跳过的比特也包括了被打孔的双列重校验比特，进一步恶化了译码性能。
如图5-3所示，初传从第0个起始位置p 0获取输出比特序列，也就是冗余版本0，第1次重传从第1个起始位置p 1获取输出比特序列，也就是冗余版本1，则冗余版本0和冗余版本1之间虽然连续，对于初传码率较低的情况，会存在较多的重复比特，也会导致译码性能的损失。
步骤401中k 0(i)可以取值为p k，p k为
Figure PCTCN2018074574-appb-000029
中的一个，也就是有k max个起始位置的取值。其中，0≤p k＜N CB，p k为整数，k为整数，0≤k＜k max，N CB为编码块的大小，k max为大于或者等于4的整数。例如，k max＝2 n，n为大于或者等于2的整数，或者，k max＝Nb，Nb为基矩阵的列数。
其中，p k的下标k可以是冗余版本起始位置的编号rvidx。
其中，
Figure PCTCN2018074574-appb-000030
可以通过多种方式定义。例如，该集合可以是仅包含
Figure PCTCN2018074574-appb-000031
这些元素的集合，也可以是其他集合的子集。所述集合
Figure PCTCN2018074574-appb-000032
中的各个元素，可以是按照特定的顺序排列，也可以不按照特定的顺序排列，本申请并不做特别限定。
在第一种可能的实现方式中，k max个取值
Figure PCTCN2018074574-appb-000033
可以是根据差值均匀分布的。两个取值a和b之间的差值可以表示为|a-b|，||表示取绝对值。对于循环缓 存中的编码块的起始位置的取值，若p k≥p k-1，p k和p k-1之间差值为|p k-p k-1|，若p k＜p k-1，p k和p k-1之间差值为|(p k+N CB)-p k-1|。例如，以整数S为差值，相邻两个取值之间差值为S，若k>0，p k可以基于前一取值p k-1得到，如p k满足p k＝(p k-1+S)mod N CB，或者p k也可以基于p 0得到，p k满足p k＝(p 0+k·S)mod N CB。其中，p 0可以是扩展因子的整数倍，p 0＝l·z，l为整数，且0≤l＜Nb。若p 0＝0，则可以简化为p k满足p k＝(k·S)mod N CB。
可以基于编码块大小N CB设置k max个取值
Figure PCTCN2018074574-appb-000034
S可以为
Figure PCTCN2018074574-appb-000035
或者
Figure PCTCN2018074574-appb-000036
在这种方式下，若k>0，p k满足
Figure PCTCN2018074574-appb-000037
或者，
Figure PCTCN2018074574-appb-000038
又例如，p k满足
Figure PCTCN2018074574-appb-000039
或者，
Figure PCTCN2018074574-appb-000040
或者
Figure PCTCN2018074574-appb-000041
或者，
Figure PCTCN2018074574-appb-000042
其中
Figure PCTCN2018074574-appb-000043
表示向上取整，
Figure PCTCN2018074574-appb-000044
表示向下取整。例如，2.1向上取整为3，向下取整为
以编码块长为215比特，k max为8，相邻取值差值为
Figure PCTCN2018074574-appb-000045
比特为例，p 0＝0，则
Figure PCTCN2018074574-appb-000046
中各值满足
Figure PCTCN2018074574-appb-000047
为{0,26,52,78,104,130,156,182}。可以看出在该例子中，
Figure PCTCN2018074574-appb-000048
中的各个元素可以按照从小到大等间隔的方式分布。需要说明的是，此处只是举例说明，本申请不以此为限制，例如
Figure PCTCN2018074574-appb-000049
中的各个元素也可以从大到小的顺序排列，或者相邻元素之间的差值也可以是其他的值。
又例如，k max＝Nb，Nb为基矩阵的列数，由于N CB是基于Nb·z，并经过可能的打孔得到，相邻取值差值可以取为z。对于其中任意一个取值p k，p k＝(k·z)mod N CB。例如，以Nb＝50，z＝4，为例，则
Figure PCTCN2018074574-appb-000050
中各值满足p k＝(k·z)mod N CB，为{0,4,8,……,196}。需要说明的是，此处只是举例说明，并不以此为限制。
增加k max，可以使得各冗余版本的起始位置间的距离减小，基于该起始位置确定的冗余版本也可以提高接收端的通信设备的译码性能。例如，k max可以为大于4的整 数，如，k max＝5，或k max＝2 n，k max达到8个及以上，n为大于2的整数，如8个或者16个，又例如，k max＝Nb，Nb为编码块的基矩阵的列数。此处只是举例说明，并不以此为限制。
上述方法中，每次传输的冗余版本之间的间隔不会变化较大或者重复的比特较多，可以适应多种初传码率，性能比较稳定。
在第二种可能的实现方式中，k max个取值
Figure PCTCN2018074574-appb-000051
也可以按照差值变化的方式设置。例如以p m+1作为分界点，其后的k max-m-2个取值
Figure PCTCN2018074574-appb-000052
可以按照差值递增的方式设置，例如，p m+2-p m+1≤p m+3-p m+2。而在p 0至p m+1之间的m个取值可以按照差值均匀分布，例如，取值差值为
Figure PCTCN2018074574-appb-000053
或者
Figure PCTCN2018074574-appb-000054
或者其他差值变化的方式设置，此处不做限定。
例如，初传时获取一个高码率的输出比特序列，包括信息比特和不可打孔的双列重校验比特，如图5-1中e 0，则该输出比特序列的长度为E 0＝(Nb-Mb+j)*z，其中j为双列重校验比特的个数，或者，不可打孔的双列重校验比特的个数。p m+1可以取值为(Nb-Mb+j)*z。
若p k>(Nb-Mb+j)*z，则p k满足p k-p k-1≤p k+1-p k，其中，m+1<k<k max-1。
若p k＜(Nb-Mb+j)*z，以p 0到p m+1之间m个取值中相邻取值差值为
Figure PCTCN2018074574-appb-000055
或者
Figure PCTCN2018074574-appb-000056
例如，对于k<m+1，p k满足
Figure PCTCN2018074574-appb-000057
或者，
Figure PCTCN2018074574-appb-000058
若p k＝(Nb-Mb+j)*z，也就是p k＝p m+1，k＝m+1。
该方法可以使得靠近信息比特的位置，起始位置的分布越密集，靠近编码块末位比特，起始位置的分别越稀疏。
以图1中所示的基矩阵为例，其中，Nb＝38，Mb＝13，z＝4，核心矩阵H k中最后4列为双对角结构部分，也就是对应的双列重校验比特的列，则双列重校验比特的个数为4，若其中有2列为不可打孔列，则不可打孔的双列重校验比特的个数为2。若j为双列重校验比特的个数，则E r0＝116。若j为不可打孔的双列重校验比特的个数，则E r0＝108。以j为不可打孔的双列重校验比特的个数，k max为8，编码块为152比特为例，p 4＝E r0＝108，p 0＝2，则p 0和p 4之间有p 1,p 2,p 3三个取值，相邻两个取值之间的差值为
Figure PCTCN2018074574-appb-000059
p 4至编码块末位比特之间有p 5,p 6,p 7三个取值，按照差值递减，差值依次为6,10和14，则k max个取值为{2,28,54,80,108,114,124,138}。需要说明的是， 此处仅仅是示例性的以
Figure PCTCN2018074574-appb-000060
中的各个元素可以从小到大的方式分布。可以理解的是本申请不以此为限制，
Figure PCTCN2018074574-appb-000061
中的各个元素也可以从大到小的顺序排列，其相邻元素之间的间隔也可以是其他的值。
对于
Figure PCTCN2018074574-appb-000062
中的取值p k，步骤401中k 0(i)可以通过多种方式获取。
基于前述第一种实现方式或者第二种实现方式，第三种可能的实现方式中，若i>0，起始位置k 0(i)是基于前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)确定的。
为了方便描述，将从前一次传输的输出比特序列的结束位置开始至编码块的末位比特(第N CB-1比特)的方向作为向后的方向，将从前一次传输的输出比特序列的结束位置开始至编码块的首位比特(第0比特)的方向作为向前的方向。
例如，为了减少重复冗余比特的数目，可以基于前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)向后获取起始位置k 0(i)。由于输出比特序列中不包括填充比特，若F(i-1)为编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特所需的比特数目，则前一次获取输出比特序列的结束位置为(k 0(i-1)+F(i-1)-1)mod N CB。将从前一次获取输出比特序列的结束位置向后的方向上的第一个起始位置的取值p k作为k 0(i)，若前一次获取输出比特序列的结束位置大于
Figure PCTCN2018074574-appb-000063
中的最大值，则p k为
Figure PCTCN2018074574-appb-000064
中的最小值。
可以看到，p k为满足p k≥((k 0(i-1)+F(i-1))mod N CB)的最小值。若
Figure PCTCN2018074574-appb-000065
中不存在满足p k≥((k 0(i-1)+F(i-1))mod N CB)的取值，也就是((k 0(i-1)+F(i-1))mod N CB)大于
Figure PCTCN2018074574-appb-000066
中的最大值，则p k为
Figure PCTCN2018074574-appb-000067
中的最小值。
以前述实现方式中{2,28,54,80,108,114,124,138}取值为例，前一次传输的输出比特序列的起始位置k 0(i-1)为2，前一次传输的输出比特序列的长度E(i-1)＝25比特，由于其中有5比特的填充比特，因此前一次从编码块中k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目F(i-1)为30比特，对于第i次传输的输出比特序列k 0(i)，采用本实施例中向后获取起始位置的方法则k 0(i)＝54。若前一次传输的输出比特序列的起始位置k 0(i-1)为124，前一次传输的输出比特序列的长度E(i-1)＝30比特，其中填充比特数目为0，前一次从编码块中k 0(i-1)开始顺序获取E(i-1)个输出比特所需的比特数目为30比特，则k 0(i)＝2。需要说明的是，此处仅是举例，并不限于此。
又例如，为了满足顺序译码的要求，基于前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)向前获取起始位置k 0(i)。由于输出比特序列中不包括填充比特，若F(i-1)为编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特所需的比特数目，则前一次获取输出比特序列的结束位置为(k 0(i-1)+F(i-1)-1)mod N CB。将从前一次获取输出比特序列的结束位置向前的方向上的第一个起始位置的取值 p k作为k 0(i)，若前一次获取输出比特序列的结束位置小于
Figure PCTCN2018074574-appb-000068
中的最小值，则p k为
Figure PCTCN2018074574-appb-000069
中的最大值。可以看到，p k为满足p k≤((k 0(i-1)+F(i-1))mod N CB)的最大值。若
Figure PCTCN2018074574-appb-000070
中不存在满足p k≤((k 0(i-1)+F(i-1))mod N CB)的取值，也就是((k 0(i-1)+F(i-1))mod N CB)小于
Figure PCTCN2018074574-appb-000071
中的最小值，则p k为
Figure PCTCN2018074574-appb-000072
中的最大值。
仍以前述实施例中{2,28,54,80,108,114,124,138}取值，编码块为152比特为例，前一次传输的输出比特序列的起始位置k 0(i-1)为2，前一次传输的输出比特序列的长度E(i-1)＝25比特，由于其中有5比特的填充比特，因此前一次从编码块中k 0(i-1)开始顺序获取E(i-1)个输出比特所需的比特数目F(i-1)为30比特，对于第i次传输的输出比特序列k 0(i)，采用向前获取起始位置的方法则k 0(i)＝28。若前一次传输的输出比特序列的起始位置k 0(i-1)为124，前一次传输的输出比特序列的长度E(i-1)＝20比特，由于其中有9比特的填充比特，因此前一次从编码块中k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目F(i-1)为29比特，则k 0(i)＝138。需要说明的是，此处仅是举例，并不限于此。
又例如，为了平衡重复比特和缺失冗余比特在译码在性能上的损失，可以结合前述两个例子中向前获取k 0(i)和向后获取k 0(i)的结果，将两者中与前一次获取输出比特序列的结束位置差值最小的取值作为k 0(i)。若
Figure PCTCN2018074574-appb-000073
p k为
Figure PCTCN2018074574-appb-000074
中与((k 0(i-1)+F(i-1))mod N CB)之间差值最小的值；或者，若((k 0(i-1)+F(i-1))mod N CB)小于
Figure PCTCN2018074574-appb-000075
中的最小值或者((k 0(i-1)+F(i-1))mod N CB)大于
Figure PCTCN2018074574-appb-000076
中的最大值，p k为
Figure PCTCN2018074574-appb-000077
中的最小值与
Figure PCTCN2018074574-appb-000078
中的最大值
Figure PCTCN2018074574-appb-000079
两者之中与((k 0(i-1)+F(i-1))mod N CB)之间差值最小的值。在一种可能的实现方式中，可以先确定出p k+和p k-，其中，p k+为从前一次获取输出比特序列的结束位置向后的方向上的第一个起始位置的取值，p k-为从前一次获取输出比特序列的结束位置向前的方向上的第一个起始位置的取值，则p k为p k+和p k-之中与((k 0(i-1)+F(i-1))mod N CB)之间差值最小的取值。若p k+和p k-与((k 0(i-1)+F(i-1))mod N CB)之间差值相等，则可以任意或者按照确定取值方向从两者之中选择。
仍以前述实施例中{2,28,54,80,108,114,124,138}取值，编码块长为152比特为例，前一次传输的输出比特序列的起始位置k 0(i-1)为2，前一次传输的输出比特序列的长度E(i-1)＝26比特，前一次从编码块中k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目F(i-1)为30比特。对于第i次传输的输出比特序列k 0(i)，采用本实施例中方法获取起始位置则k 0(i)＝28，若k 0(i-1)为124比特，前一次传输的输出比特序列的长度E(i-1)＝29比特，前一次从编码块中k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的 比特数目F(i-1)为30比特。则向后方向获取的取值为p 0＝2，两者之间差值为1，向前方向获取的取值为p 7＝138，两者之间差值为15，则k 0(i)＝p 0＝2。需要说明的是，此处仅是举例，并不限于此。
又例如，为了平衡重复比特和缺失冗余比特在译码在性能上的损失，也可以基于传输次数i与获取起始位置k 0(i)的方向的对应关系确定第i次传输的起始位置k 0(i)的获取方向，基于前一次传输的输出比特序列的结束位置以及所确定的获取起始位置k 0(i)的方向获取起始位置k 0(i)。可以在通信设备中设置传输次数i和起始位置k 0(i)获取方向的表，例如，如表1，最大重传次数为3，初传不需要设置获取方式，
表1
Figure PCTCN2018074574-appb-000080
仍以前述实施例中{2,28,54,80,108,114,124,138}取值，编码块长为152比特为例，初传的输出比特序列的起始位置k 0(0)为2，初传的输出比特序列的长度E(0)＝20比特，填充比特数为10比特，则F(0)＝30比特。假设每次获取输出比特序列时填充比特数相等，每次传输的输出比特序列长度也相等，采用上述表1中的对应关系获取起始位置，对于第1次传输的输出比特序列向后获取起始位置k 0(1)，则k 0(1)＝54，对于第2次传输的输出比特序列向前获取起始位置k 0(2)＝80，对于第3次传输的输出比特序列获取起始位置k 0(3)＝108。需要说明的是，此处仅是举例，并不限于此。
获取方向中“向前”和“向后”可以通过特定的数值指示，并不限定于字面的表达方式，例如0为“向前”，1为“向后”，或者其他数值表达方式。传输次数i和起始位置k 0(i)获取方向的对应关系也可以通过其他形式来定义，本发明实施例并不限于此。
基于传输次数i可以确定第i次传输的输出比特序列的起始位置的获取方向，基于第i次传输的输出比特序列的起始位置的获取方向，以及前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)向前获取起始位置k 0(i)。
基于前述第一种实现方式或者第二种实现方式，在第四种可能的实现方式中，可以定义每次传输时获取的起始位置的顺序，也可以定义每次传输时p k的下标k的取值顺序。这一顺序可以指示给接收端的通信设备，也可以预先在收发两端通信设备中存储。
其中，p k的下标k可以是冗余版本起始位置的编号rv idx，第i次传输的冗余版本起始位置的编号可以表示为rv idx(i)，起始位置k 0(i)可以是基于冗余版本起始位置的编号rv idx(i mod k max)确定的。
可以采用固定顺序的起始位置获取方法，在一个实施例中，可以定义rv idx的取值顺序，取值顺序中的值的个数可以是k max，也可以为最大重传次数R max，例如，k max＝8 时，rv idx的取值顺序依次为0,3,6,2,5,7,4,1。则初传时，从第p 0比特开始确定输出比特序列，第1次传输k 0(1)＝p 3，从第p 3比特开始确定输出比特序列，第2次传输k 0(2)＝p 6，从第p 6比特开始确定输出比特序列，以此类推，第k max次传输时，则又回到从第p 0比特开始确定输出比特序列。也就是对于第i次传输，k＝rv idx(i mod k max)，k 0(i)＝p k。又例如，最大重传次数R max＝3，rv idx的取值顺序集合为{0,2,3,1}，则初传时，从第p 0比特开始确定输出比特序列，第1次传输k 0(1)＝p 2，从第p 3比特开始确定输出比特序列，第2次传输k 0(2)＝p 3。对于第i次传输，k＝rv idx(i mod R max)，k 0(i)＝p k。
进一步地，rv idx的取值顺序也可以根据初传码率的大小确定，也可以基于每次传输的输出比特序列的长度E和扩展因子z确定。在非自适应重传场景下，初传和重传的输出比特序列的长度是相等的，例如基于
Figure PCTCN2018074574-appb-000081
确定rv idx的取值顺序。
例如，以k max＝8，采用66*82的LDPC矩阵，其中信息位列数为16，对于编码块，rv idx的取值顺序和初传码率的对应关系可以参见表2，例如R 0≥0.8，rv idx取值顺序为{0,2,4,6}。
表2
初传码率R 0 rv idx的取值顺序
R 0≥0.8 0,2,4,6
0.53≤R 0＜0.8 0,3,6,2
R 0＜0.53 0,4,2,6
又例如，以k max＝8，采用66*82的LDPC矩阵，其中信息位列数为16，对于编码块，rv idx的取值顺序和初传码率的对应关系可以参见表3，例如
Figure PCTCN2018074574-appb-000082
rv idx取值顺序为{0,3,6,2}。
表3
Figure PCTCN2018074574-appb-000083
这一方式适用于非自适应性重传，起始位置的信息不需要在每次发送前指示给接收端通信设备。
也可以基于发送端通信设备所指示的rv idx获取输出比特序列在编码块中的起始位置k 0(i)。这一方式适用于自适应重传。
在第五种可能的实现方式中，对于重传，即i>0，第i次传输的输出比特序列和第i-1次传输的输出比特序列首尾相连。在这种方式下，k 0(i)是根据前一次传输的输出比特序列的起始位置k 0(i-1)和前一次传输的输出比特序列的长度E(i-1)确定的，由于输出比特序列中不包括填充比特，因此根据k 0(i-1)和E(i-1)可以得到F(i-1)，F(i-1)为编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目，则k 0(i)＝(k 0(i-1)+F(i-1))mod N CB。在这种方式下，相邻两次传输的输出比特序列是连续的，并且两者之间没有重复的比特，这样的输出比特序列发送至接收端的通信设备，可以达到较佳的译码性能。
进一步地，基于首尾相连的重传方式，还可以在编码块的所有比特被传输过一遍之后，每次重传增加偏移量E offset，也就是k 0(i)＝(k 0(i-1)+F(i-1)+E offset)mod N CB。在这种方式下，若编码块中的末位比特已被传输，则k 0(i)＝(k 0(i-1)+F(i-1)+E offset)mod N CB，否则，k 0(i)＝(k 0(i-1)+F(i-1))mod N CB。这样，所有比特被传输后，通过每次在重传中增加偏移量，使得重复的比特数减少，减少译码性能的损失。
可选地，在前述信息处理方法之后，所述通信设备还可以对所述输出比特序列进行处理，使得在发送或接收时使用该输出比特序列，例如，对输出比特序列进行交织，并映射为调制符号等处理等等。这些处理可以参照现有技术中的相应处理方法，此处不再赘述。
图6为本发明一实施例提供的信息处理方法的流程图，该方法可用于通信系统，该通信系统包括通信设备30和通信设备31。该方法可以由通信设备31来实施，包括：
601：获取长度为E(i)的软比特序列在软信息缓存中保存的起始位置k 0(i)。
602：从起始位置k 0(i)开始将步骤601中的软比特序列合并保存在软信息缓存中。
通信设备30向通信设备31发送如前述各实施例中得到的输出比特序列，可以理解的是，上述实施例中的输出比特序列是速率匹配后的输出比特序列，所述通信设备30可以对速率匹配后的输出比特序列进行交织调制等处理，从而发送对应于所述输出比特序列的发送信号，通信设备31接收所述输出信号并经解调、解交织后，得到输出比特序列对应的软比特序列，也就是输出比特序列中一个比特对应软比特序列中一个软值比特(soft channel bit)。这些软值比特在通信设备31的软信息缓存中保存的位置和通信设备30中循环缓存中的编码块的位置一一对应，软信息缓存的大小与循环缓存中的编码块的大小也是相同的，都可以是N CB。
例如，通信设备30发送的输出比特为1，经过信道传输，通信设备31得到其相应的软值比特为1.45，如果输出比特在编码块中的位置为第5比特，则在通信设备31的软信息缓存中第5软值比特为1.45。需要说明的是此处只是举例说明，本发明实施例并不限于此。如果通信设备30获取的输出比特序列中包括n个输出比特，则通信设备31可以获取到n个对应的软值比特。如果通信设备31两次接收到同一位置的软值 比特，则将两次的软值进行合并，例如，第一次传输时接收到的软值比特为1.45，第二次传输时接收到的软值比特为0.5，则合并后为1.95。需要说明的是，此处仅为举例，并不以此为限制。
可见起始位置k 0(i)及其获取方式具备和前述各实施例相应的特征，可以参见前述各实施例所述，此处不再赘述。需要说明的是，对通信设备30而言，起始位置是相对于循环缓存中的编码块而言，而在通信设备31中，起始位置是相对于软信息缓存而言；在通信设备30侧是从循环缓存中的编码块确定输出比特序列，而在通信设备31侧，是将接收到的软比特序列保存到软信息缓存中。
图7给出了一种信息处理的装置700的结构示意图，该装置可用于如图3所示的通信系统中的通信设备30。装置700也可以称之为速率匹配装置。装置700可用于实现前述方法实施例，参见前述方法实施例中的说明，此处不再赘述。
装置700可以包括获取单元701和处理单元702。其中：
获取单元701用于获取输出比特序列在编码块中的起始位置k 0(i)；处理单元702用于基于输出比特序列长度E(i)及所述起始位置k 0(i)从所述编码块中确定输出比特序列，其中，所述编码块存储于循环缓存中，i为大于或者等于0的整数。关于如何获取k 0(i)，以及基于E(i)和k 0(i)确定输出比特序列，具体可参见上述方法实施例中的说明。
图8给出了一种信息处理的装置800结构示意图，该装置可用于如图3所示的通信系统中的通信设备31。装置800也可以称之为解速率匹配装置。装置800可用于实现前述方法实施例，具体可参见前述方法实施例中的说明。装置800可以包括获取单元801和处理单元802。
所述获取单元801用于获取长度为E(i)的软比特序列在软信息缓存中保存的起始位置k 0(i)；所述处理单元802用于从起始位置k 0(i)开始将获取单元801获取到的软比特序列合并保存在软信息缓存中。
图9给出了一种通信设备的结构示意图，该通信设备可应用于如图3所示的通信系统。通信设备30可以包括编码器301，速率匹配器302和收发器303。编码器301也可以称为编码单元或者编码电路等，主要用于对信息数据进行编码；速率匹配器302也可以称之为速率匹配单元或者速率匹配电路等，主要用于基于经编码器301编码得到的编码块确定要发送的输出比特序列，例如用于确定上述实施例中的输出比特序列，可以包括如图7中的装置700；收发器303也可以称为收发单元、收发机、或者收发电路等，主要用于射频信号的收发，例如用于向通信设备31发送上述实施例中所述的输出比特序列。通信设备30还可以包括其他器件，例如用于产生传输块CRC的器件、码块分割和CRC校验的器件、交织器、调制器等，可分别用于实现如图3中通信设备30的各部分功能。
需要说明的是，通信设备30可以包括一个或多个存储器，以及一个或多个处理器，所述存储器存储有指令，所述处理器耦合到所述存储器，用于调取存储器中的指令以执行上述方法实施例中所描述的各个步骤。所述存储器中还可以包括其他指令以供所 述处理器调用执行通信设备30其他部分的功能，如码块分割和CRC校验、交织、调制等。
图10出了一种通信设备的结构示意图，该通信设备可应用于如图3所示的通信系统。通信设备31可以包括译码器311，解速率匹配器312和收发器313。解速率匹配器312也可以称之为解速率匹配单元或者解速率匹配电路，可用于合并软值比特，例如用于对上述实施例中所述的输出比特序列的软值比特合并保存在软信息缓存中，可以包括如图8中的装置800；译码器311，也可以称为译码单元或者译码电路，主要用于对接收到的信号进行译码，例如用于对软信息缓存中软值比特进行译码；收发器313也可以称为收发单元、收发机、或者收发电路等，主要用于射频信号的收发，例如用于接收通信设备30发送上述实施例中所述的输出比特序列。通信设备31还可以包括其他器件，例如用于传输块CRC校验的器件、码块合并的器件、解交织器、解调制器等，可分别用于实现如图3中通信设备31的各部分功能。
需要说明的是，通信设备31可以包括一个和多个存储器和处理器用于实现如图3中通信设备31的各部分功能。可以每个器件单独设置存储器和处理器。也可以是多个器件公用相同的存储器和处理器。
需要说明的是，通信设备31可以包括一个或多个存储器，以及一个或多个处理器，所述存储器存储有指令，所述处理器耦合到所述存储器，用于调取存储器中的指令以执行上述方法实施例中所描述的各个步骤。所述存储器中还可以包括其他指令以供所述处理器调用执行通信设备30其他部分的功能，如码块合并、解交织、解调制等。
本领域技术任何还可以了解到本发明实施例列出的各种说明性逻辑块(illustrative logical block)和步骤(step)可以通过电子硬件、电脑软件，或两者的结合进行实现。这样的功能是通过硬件还是软件来实现取决于特定的应用和整个系统的设计要求。本领域技术人员可以对于每种特定的应用，可以使用各种方法实现所述的功能，但这种实现不应被理解为超出本发明实施例保护的范围。
本发明实施例中所描述的各种说明性的逻辑单元和电路可以通过通用处理器，数字信号处理器，专用集成电路(ASIC)，现场可编程门阵列(FPGA)或其它可编程逻辑装置，离散门或晶体管逻辑，离散硬件部件，或上述任何组合的设计来实现或操作所描述的功能。通用处理器可以为微处理器，可选地，该通用处理器也可以为任何传统的处理器、控制器、微控制器或状态机。处理器也可以通过计算装置的组合来实现，例如数字信号处理器和微处理器，多个微处理器，一个或多个微处理器联合一个数字信号处理器核，或任何其它类似的配置来实现。
本发明实施例中所描述的方法或算法的步骤可以直接嵌入硬件、处理器执行的指令、或者这两者的结合。存储器可以是RAM存储器、闪存、ROM存储器、EPROM存储器、EEPROM存储器、寄存器、硬盘、可移动磁盘、CD-ROM或本领域中其它任意形式的存储媒介。示例性地，存储器可以与处理器连接，以使得处理器可以从存储器中读取信息，并可以向存储器存写信息。可选地，存储器还可以集成到处理器中。处理器和存储器可以设置于ASIC中，ASIC可以设置于UE中。可选地，处理器和存储器也可以设置于UE中的不同的部件中。
通过以上的实施方式的描述，所属领域的技术人员可以清楚地了解到本发明可以 用硬件实现，或固件实现，或它们的组合方式来实现。当使用软件程序实现时，可以全部或部分地以计算机程序产品的形式实现，所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机指令时，全部或部分地产生按照本发明实施例所述的流程或功能。当使用软件程序实现时，也可以将上述功能存储在计算机可读介质中或作为计算机可读介质上的一个或多个指令或代码进行传输。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一计算机可读存储介质传输。计算机可读介质包括计算机存储介质和通信介质，其中通信介质包括便于从一个地方向另一个地方传送计算机程序的任何介质。存储介质可以是计算机能够存取的任何可用介质。以此为例但不限于：计算机可读介质可以包括RAM、ROM、EEPROM、CD-ROM或其他光盘存储、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质。此外。任何连接可以适当的成为计算机可读介质。例如，如果软件是使用同轴电缆、光纤光缆、双绞线、数字用户线(DSL)或者诸如红外线、无线电和微波之类的无线技术从网站、服务器或者其他远程源传输的，那么同轴电缆、光纤光缆、双绞线、DSL或者诸如红外线、无线和微波之类的无线技术包括在所属介质的定义中。如本发明所使用的，盘(Disk)和碟(disc)包括压缩光碟(CD)、激光碟、光碟、数字通用光碟(DVD)、软盘和蓝光光碟，其中盘通常磁性的复制数据，而碟则用激光来光学的复制数据。上面的组合也应当包括在计算机可读介质的保护范围之内。
总之，以上所述仅为本发明技术方案的较佳实施例而已，并非用于限定本发明的保护范围。凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。

Claims (21)

  1. 一种通信系统中信息处理方法，其特征在于，所述方法包括：
    获取输出比特序列在编码块中的起始位置k 0(i)；
    基于输出比特序列长度E(i)及所述起始位置k 0(i)从所述编码块中确定输出比特序列，其中，所述编码块存储于循环缓存中，i为大于或者等于0的整数，
    k 0(i)取值为p k，p k为
    Figure PCTCN2018074574-appb-100001
    中的一个，其中，0≤p k＜N CB，p k为整数，k为整数，0≤k＜k max，N CB为所述编码块的大小，k max为大于4的整数。
  2. 根据权利要求1所述的方法，其特征在于，k max＝2 n，n为大于2的整数，或者，k max＝Nb，Nb为基矩阵的列数。
  3. 根据权利要求1或者2所述的方法，其特征在于，若k＝0，则p 0＝l·z，其中，l为整数，且0≤l＜Nb，z为所述编码块的扩展因子；或者，若0＜k＜k max，p k＝(p k-1+S)modN CB，S为整数。
  4. 根据权利要求3所述的方法，其特征在于，
    Figure PCTCN2018074574-appb-100002
    或者，
    Figure PCTCN2018074574-appb-100003
    或者，S＝z，z为所述编码块的扩展因子。
  5. 根据权利要求1或2所述的方法，其特征在于，若p k>(Nb-Mb+j)*z，则p k满足p k-p k-1≤p k+1-p k，其中，p m+1＝(Nb-Mb+j)*z，且0<m+1<k<k max-1，j为所述编码块中双列重校验比特的个数，或者j为所述编码块中不可打孔的双列重校验比特的个数，z为所述编码块的扩展因子。
  6. 根据权利要求5所述的方法，其特征在于，若p k＜(Nb-Mb+j)*z，p k满足
    Figure PCTCN2018074574-appb-100004
    或者，
    Figure PCTCN2018074574-appb-100005
    其中，p m+1＝(Nb-Mb+j)*z且0<k<m+1，j为所述编码块中双列重校验比特的个数，或者j为所述编码块中不可打孔的双列重校验比特的个数，z为所述编码块的扩展因子。
  7. 根据权利要求1至6任一项所述的方法，其特征在于，若i>0，所述起始位置k 0(i)是基于前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)确定的。
  8. 根据权利要求7所述的方法，其特征在于，p k为满足p k≥((k 0(i-1)+F(i-1))mod N CB)的最小值；或者，若((k 0(i-1)+F(i-1))mod N CB)大于
    Figure PCTCN2018074574-appb-100006
    中的最大值，则p k为
    Figure PCTCN2018074574-appb-100007
    中的最小值，其中，F(i-1)为所述编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目。
  9. 根据权利要求7所述的方法，其特征在于，p k为满足p k≤((k 0(i-1)+F(i-1))mod N CB)的最大值；或者，若((k 0(i-1)+F(i-1))mod N CB)小于
    Figure PCTCN2018074574-appb-100008
    中的最小值，则p k为
    Figure PCTCN2018074574-appb-100009
    中的最大值，其中，F(i-1)为所述编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目。
  10. 根据权利要求7所述的方法，其特征在于，若
    Figure PCTCN2018074574-appb-100010
    则p k为
    Figure PCTCN2018074574-appb-100011
    中与((k 0(i-1)+F(i-1))mod N CB)之间差值最小的值；或者，若((k 0(i-1)+F(i-1))mod N CB)小于
    Figure PCTCN2018074574-appb-100012
    中的最小值或者((k 0(i-1)+F(i-1))mod N CB)大于
    Figure PCTCN2018074574-appb-100013
    中的最大值，p k为
    Figure PCTCN2018074574-appb-100014
    中的最小值与
    Figure PCTCN2018074574-appb-100015
    中的最大值
    Figure PCTCN2018074574-appb-100016
    两者之中与((k 0(i-1)+F(i-1))mod N CB)之间差值最小的值，其中，F(i-1)为所述编码块中从k 0(i-1)开始顺序获取E(i-1)个输出比特的所需的比特数目。
  11. 根据权利要求7所述的方法，其特征在于，若i>0，所述起始位置k 0(i)是基于前一次传输的输出比特序列的起始位置k 0(i-1)以及前一次传输的输出比特序列长度E(i-1)，以及传输次数i确定的。
  12. 根据权利要求1至6任一项所述的方法，其特征在于，所述起始位置k 0(i)是基于冗余版本起始位置的编号rv idx(i)确定。
  13. 根据权利要求12所述的方法，其特征在于，所述冗余版本编号起始位置的编号rv idx(i)是通过信令获取。
  14. 根据权利要求12所述的方法，其特征在于，所述冗余版本起始位置的编号rv idx(i)是基于冗余版本起始位置的编号顺序以及传输次数i获取的。
  15. 根据权利要求14所述的方法，其特征在于，所述冗余版本起始位置的编号顺序是从存储器中读取的，或者所述冗余版本起始位置的编号顺序是基于初传码率确定的，或者，所述冗余版本起始位置的编号顺序是基于输出比特序列的长度E(i)和扩展因子z确定的。
  16. 一种通信系统中信息处理的方法，其特征在于，所述方法包括：
    获取长度为E(i)的软比特序列在软信息缓存中保存的起始位置k 0(i)；
    从起始位置k 0(i)开始将所述软比特序列合并保存在所述软信息缓存中；其中，i为大于或者等于0的整数，k 0(i)取值为p k，p k为
    Figure PCTCN2018074574-appb-100017
    中的一个，其中，0≤p k＜N CB，p k为整数，k为整数，0≤k＜k max，N CB为所述软信息缓存的大小，k max为大于4的整数。
  17. 一种装置，用于执行如权利要求1至16项任一项所述的方法。
  18. 一种通信设备，其特征在于，所述通信设备包括处理器和存储器，所述存储器存储有指令，所述处理器耦合到所述存储器，用于调取存储器中的指令以执行如权利要求1至16项任一项所述的方法。
  19. 一种计算机可读存储介质，包括指令，当其在计算机上运行时，使得计算机执行如权利要求1至16任一项所述的方法。
  20. 一种计算机程序产品，当其在计算机上运行时，使得计算机执行如权利要求1至16任一项所述的方法。
  21. 一种通信系统，包括第一通信设备和第二通信设备，其中所述第一通信设备用于对信息序列进行编码得到编码块，并对编码块执行如权利要求1至15任一项所述的方法，所述第一通信设备还用于对所述输出比特序列进行交织，调制中的至少一个操作，以生成输出信号，并发送给所述第二通信设备；所述第二通信设备用于接收来自所述第一通信设备的包括所述输出信号的信号，并进行解调，解交织的至少一个操作，以及权利要求16所述的方法以获得所述编码块的软信息缓存，并对所述软信息缓存译码以得到所述信息序列。
PCT/CN2018/074574 2017-02-04 2018-01-30 信息处理的方法、装置、通信设备和通信系统 WO2018141240A1 (zh)

Priority Applications (7)

Application Number Priority Date Filing Date Title
JP2019542221A JP6871396B2 (ja) 2017-02-04 2018-01-30 情報を処理するための方法および装置、通信デバイス、ならびに通信システム
AU2018214850A AU2018214850B2 (en) 2017-02-04 2018-01-30 Method and apparatus for processing information, communications device, and communications system
BR112019016057-4A BR112019016057A2 (pt) 2017-02-04 2018-01-30 Método e aparelho para processar informação, dispositivo de comunicações, terminal, estação base, meio de armazenamento legível por computador e sistema de comunicações
EP18748392.0A EP3570475B1 (en) 2017-02-04 2018-01-30 Rate matching of an ldpc coded block stored in a circular buffer for harq transmissions
RU2019127742A RU2752420C2 (ru) 2017-02-04 2018-01-30 Способ и устройство для обработки информации, устройство связи и система связи
US16/529,438 US11128401B2 (en) 2017-02-04 2019-08-01 Method and apparatus for processing information, communications device, and communications system
US17/406,354 US11742987B2 (en) 2017-02-04 2021-08-19 Method and apparatus for processing information, communications device, and communications system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710064621.XA CN108400844B (zh) 2017-02-04 2017-02-04 信息处理的方法、装置、通信设备和通信系统
CN201710064621.X 2017-02-04

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/529,438 Continuation US11128401B2 (en) 2017-02-04 2019-08-01 Method and apparatus for processing information, communications device, and communications system

Publications (2)

Publication Number Publication Date
WO2018141240A1 true WO2018141240A1 (zh) 2018-08-09
WO2018141240A9 WO2018141240A9 (zh) 2019-11-28

Family

ID=63040266

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/074574 WO2018141240A1 (zh) 2017-02-04 2018-01-30 信息处理的方法、装置、通信设备和通信系统

Country Status (8)

Country Link
US (2) US11128401B2 (zh)
EP (1) EP3570475B1 (zh)
JP (1) JP6871396B2 (zh)
CN (2) CN108400844B (zh)
AU (1) AU2018214850B2 (zh)
BR (1) BR112019016057A2 (zh)
RU (1) RU2752420C2 (zh)
WO (1) WO2018141240A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3540998A4 (en) * 2017-06-19 2020-01-08 Huawei Technologies Co., Ltd. INFORMATION PROCESSING METHOD AND APPARATUS, COMMUNICATION DEVICE, AND COMMUNICATION SYSTEM
JP2020529179A (ja) * 2017-08-10 2020-10-01 ノキア テクノロジーズ オサケユイチア 方法及び装置

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112910622B (zh) * 2015-11-06 2021-11-30 中兴通讯股份有限公司 信道状态测量导频的配置方法及装置、解析方法及装置
CN109391380B (zh) * 2017-08-11 2021-09-14 大唐移动通信设备有限公司 一种harq重传方法、装置及发送设备
US11411672B2 (en) * 2019-09-03 2022-08-09 Electronics And Telecommunication Research Institute Method and apparatus for data transmission in wireless communication system
CN113078911A (zh) * 2020-01-03 2021-07-06 华为技术有限公司 Ldpc码的编码的方法和通信装置
CN113541878B (zh) * 2020-04-14 2022-10-28 华为技术有限公司 一种数据处理方法、装置及设备
CN111884775B (zh) * 2020-07-15 2024-02-27 太仓市同维电子有限公司 一种基于共享缓存的harq传输装置和方法
CN112367157B (zh) * 2020-10-31 2023-05-12 深圳供电局有限公司 一种物联网环境加密方法及装置
US11764911B2 (en) * 2021-04-05 2023-09-19 Nokia Technologies Oy Method of shifting redundancy version for the transmission of a transport block over multiple slots

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101188428A (zh) * 2007-12-10 2008-05-28 中兴通讯股份有限公司 一种ldpc码的有限长度循环缓存的速率匹配方法
WO2008124966A1 (en) * 2007-04-13 2008-10-23 Panasonic Corporation Radio communication apparatus and redundancy version transmission control method
US20100122138A1 (en) * 2007-04-17 2010-05-13 Panasonic Corporation Radio Communication Device and Radio Communication Method

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2134061A1 (en) * 1993-10-28 1995-04-29 Aaron William Ogus Frame buffering of network packets
US5636224A (en) * 1995-04-28 1997-06-03 Motorola Inc. Method and apparatus for interleave/de-interleave addressing in data communication circuits
KR100724921B1 (ko) * 2001-02-16 2007-06-04 삼성전자주식회사 통신시스템에서 부호 생성 및 복호 장치 및 방법
US6785862B1 (en) * 2001-08-14 2004-08-31 Mindspeed Technologies, Inc. Convolutional interleaver employing an efficient memory scheme
US6785863B2 (en) * 2002-09-18 2004-08-31 Motorola, Inc. Method and apparatus for generating parity-check bits from a symbol set
US7058873B2 (en) * 2002-11-07 2006-06-06 Carnegie Mellon University Encoding method using a low density parity check code with a column weight of two
KR101191196B1 (ko) * 2006-06-07 2012-10-15 엘지전자 주식회사 패리티 검사 행렬을 이용하여 부호화 및 복호화하는 방법
CN101005334B (zh) * 2007-01-12 2010-12-29 中兴通讯股份有限公司 一种低密度奇偶校验码的混合自动请求重传包生成方法
US8171383B2 (en) * 2007-04-13 2012-05-01 Broadcom Corporation Method and system for data-rate control by randomized bit-puncturing in communication systems
CN103326843B (zh) * 2007-05-29 2016-06-29 三星电子株式会社 移动通信系统中用于将码元映射到资源的装置和方法
US7890834B2 (en) * 2007-06-20 2011-02-15 Motorola Mobility, Inc. Apparatus comprising a circular buffer and method for assigning redundancy versions to a circular buffer
US8189559B2 (en) * 2007-07-23 2012-05-29 Samsung Electronics Co., Ltd. Rate matching for hybrid ARQ operations
TWI410055B (zh) * 2007-11-26 2013-09-21 Sony Corp Data processing device, data processing method and program product for performing data processing method on computer
KR101445080B1 (ko) * 2008-02-12 2014-09-29 삼성전자 주식회사 하이브리드 자동 반복 요구 방식을 사용하는 통신 시스템에서 신호 송신 방법 및 장치
US9071402B2 (en) * 2008-03-24 2015-06-30 Telefonaktiebolaget L M Ericsson (Publ) Selection of retransmission settings for HARQ in WCDMA and LTE networks
JP5250061B2 (ja) * 2011-01-07 2013-07-31 株式会社エヌ・ティ・ティ・ドコモ 通信制御方法、移動通信システム及び移動端末装置
CN103312442B (zh) * 2012-03-15 2017-11-17 中兴通讯股份有限公司 基于有限长度循环缓存速率匹配的数据发送方法及装置
US9954643B2 (en) * 2012-06-22 2018-04-24 Samsung Electronics Co., Ltd. Communication system with repeat-response combining mechanism and method of operation thereof
GB2505884B (en) * 2012-09-12 2015-06-03 Imagination Tech Ltd Dynamically resizable circular buffers
US10541781B2 (en) * 2016-01-29 2020-01-21 Intel IP Corporation Rate matching using low-density parity-check codes
CN110266448B (zh) * 2017-06-19 2020-11-10 华为技术有限公司 信息处理的方法、通信装置和存储介质

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008124966A1 (en) * 2007-04-13 2008-10-23 Panasonic Corporation Radio communication apparatus and redundancy version transmission control method
US20100122138A1 (en) * 2007-04-17 2010-05-13 Panasonic Corporation Radio Communication Device and Radio Communication Method
CN101188428A (zh) * 2007-12-10 2008-05-28 中兴通讯股份有限公司 一种ldpc码的有限长度循环缓存的速率匹配方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZTE: "Bit rearrangement of LDPC for high order modulation", 3GPP TSG RAN WG1 AH NR MEETING, R1-1700248, 16 January 2017 (2017-01-16), XP051207786 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3540998A4 (en) * 2017-06-19 2020-01-08 Huawei Technologies Co., Ltd. INFORMATION PROCESSING METHOD AND APPARATUS, COMMUNICATION DEVICE, AND COMMUNICATION SYSTEM
US11070316B2 (en) 2017-06-19 2021-07-20 Huawei Technologies Co., Ltd. Information processing method, apparatus, communications device, and communications system
JP2020529179A (ja) * 2017-08-10 2020-10-01 ノキア テクノロジーズ オサケユイチア 方法及び装置
US11044047B2 (en) 2017-08-10 2021-06-22 Nokia Technologies Oy Method and apparatus for using at least one redundancy version for transmission of a data unit
JP2021184638A (ja) * 2017-08-10 2021-12-02 ノキア テクノロジーズ オサケユイチア 方法及び装置

Also Published As

Publication number Publication date
AU2018214850B2 (en) 2020-12-17
BR112019016057A2 (pt) 2020-03-31
US20190356333A1 (en) 2019-11-21
WO2018141240A9 (zh) 2019-11-28
US11128401B2 (en) 2021-09-21
RU2752420C2 (ru) 2021-07-28
JP6871396B2 (ja) 2021-05-12
CN108400844A (zh) 2018-08-14
RU2019127742A3 (zh) 2021-03-04
AU2018214850A1 (en) 2019-09-12
CN112187403A (zh) 2021-01-05
CN112187403B (zh) 2022-01-14
RU2019127742A (ru) 2021-03-04
US20210385015A1 (en) 2021-12-09
JP2020507990A (ja) 2020-03-12
CN108400844B (zh) 2021-07-20
EP3570475B1 (en) 2023-07-26
US11742987B2 (en) 2023-08-29
EP3570475A4 (en) 2019-12-18
EP3570475A1 (en) 2019-11-20

Similar Documents

Publication Publication Date Title
WO2018141240A1 (zh) 信息处理的方法、装置、通信设备和通信系统
JP7017627B2 (ja) 通信システムにおける冗長バージョン設計ソリューション
JP6915061B2 (ja) 情報処理方法、装置、通信デバイスおよび通信システム
WO2017177926A1 (zh) 一种数据传输处理方法和装置
US11438099B2 (en) Information processing method, device, and communications system
TWI436615B (zh) 用於以交錯形式將對數概度比儲存在記憶體中以減少記憶體需求的方法、接收器、裝置與電腦可讀取媒體
CN108173621B (zh) 数据传输的方法、发送设备、接收设备和通信系统
US20090199062A1 (en) Virtual limited buffer modification for rate matching
US8904265B2 (en) Optimal period rate matching for turbo coding
WO2018103638A1 (zh) 数据传输的方法、发送设备、接收设备和通信系统
WO2023226747A1 (zh) 一种信息的重传方法和通信装置
WO2018233334A1 (zh) 信息处理方法、装置、通信设备和通信系统
US20200127682A1 (en) Information processing method, apparatus, and communications device

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: 18748392

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019542221

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112019016057

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 2018748392

Country of ref document: EP

Effective date: 20190813

ENP Entry into the national phase

Ref document number: 2018214850

Country of ref document: AU

Date of ref document: 20180130

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 112019016057

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20190802