WO2008086735A1 - Procédé de génération d'un paquet de demande de retransmission automatique hybride d'un code de vérification de parité faible densité - Google Patents

Procédé de génération d'un paquet de demande de retransmission automatique hybride d'un code de vérification de parité faible densité Download PDF

Info

Publication number
WO2008086735A1
WO2008086735A1 PCT/CN2008/000078 CN2008000078W WO2008086735A1 WO 2008086735 A1 WO2008086735 A1 WO 2008086735A1 CN 2008000078 W CN2008000078 W CN 2008000078W WO 2008086735 A1 WO2008086735 A1 WO 2008086735A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
code
harq
codeword
packet
Prior art date
Application number
PCT/CN2008/000078
Other languages
English (en)
Chinese (zh)
Inventor
Jun Xu
Zhifeng Yuan
Liujun Hu
Original Assignee
Zte Corporation
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 Zte Corporation filed Critical Zte Corporation
Publication of WO2008086735A1 publication Critical patent/WO2008086735A1/fr

Links

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
    • 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/618—Shortening and extension of codes
    • 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
    • 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/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
    • 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
    • H04L1/0068—Rate matching by puncturing
    • 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]

Definitions

  • the present invention relates to the field of digital communications, and more particularly to a hybrid automatic request retransmission or HARQ packet generation method for low density parity check codes.
  • Figure 1 is a typical digital communication system in which all digital communication systems require a channel coder.
  • the channel encoder is designed to combat a wide variety of noises and disturbances during transmission. By artificially adding redundant information, the system has the ability to automatically correct errors, thus ensuring the reliability of digital transmission.
  • Low-density parity check codes are a class of linear block codes that can be defined with very sparse parity check matrices or bipartite graphs, originally discovered by Gallager, so called Gallager codes. After decades of silence, with the development of computer hardware and related theories, MacKay and Neal rediscovered it and proved its ability to approach the Shannon limit. Recent studies have shown that low-density parity codes have the following characteristics: low decoding complexity, linear time coding, performance close to Shannon's limit, parallel decoding, and better performance than Turbo codes under long code length conditions.
  • Low-density parity check code is a linear block code based on sparse check matrix. It is the sparsity of its check matrix that can realize low-complexity coding and decoding. Therefore, the LDPC code is put into practical use.
  • the aforementioned Gallager code is a regular LDPC code (regular LDPCC), and Luby and Mitzemnacher et al. generalize the Gallager code and propose a non-regular LDPC code (irregular LDPCC).
  • LDPC codes have many decoding algorithms. Among them, Message Passing algorithm or Belief Propagation algorithm (BP algorithm) is the mainstream and basic algorithm of LDPC codes. At present, there are many improved effective decoding algorithms. .
  • the graphical representation of the LDPC parity check matrix is a bipartite graph.
  • the bipartite graph and the check matrix have a corresponding relationship, and an M*N parity check matrix H defines a constraint that each N-bit codeword satisfies M parity sets.
  • a bipartite graph includes N variable nodes and M parity nodes.
  • LDPC code A special type of LDPC code has become a mainstream application due to its structured features.
  • the parity check matrix H of this LDPC code be a (Mxz)x(Nxz) matrix, which is composed of MxN block matrices, each block matrix is a different power of the basic permutation matrix of ⁇ , basic permutation
  • the matrix is a unit matrix, they are the cyclic shift matrix of the unit matrix (the default is right shift in the text).
  • the check matrix H has the following form:
  • the basic permutation matrix has the following form
  • z code length / number of columns of the base cell matrix n b , called the spreading factor.
  • the LDPC code codec needs to store a basic matrix.
  • the code length is large, Store a lot of ⁇ matrix, which will cause representation and storage problems. Therefore, when it is necessary to implement the variable code length, a low-density parity check code of a plurality of code lengths within a certain range of the same code rate uses a basic matrix of a form, which is defined as a unified basic matrix Hr.
  • Hr unified basic matrix
  • the correction is to use a spreading factor of different code lengths to correct the non-negative values in the basic matrix.
  • the corrected element value should be smaller than the spreading factor value under the code length.
  • correction algorithms For example, you can use mod, scale+floor, or scale+round to set the non-negative 1 element of the i-th row and j-th column of the base matrix. Correct the non-negative 1 element of the i-th row and j-th column of m ° d afterwards, with:
  • z is the expansion factor corresponding to the current code length, that is, the number of rows or columns of the block square matrix; 2 is the expansion factor corresponding to the maximum supported code length.
  • Mod is the modulo operation, L" is the bottom rounding operation, and Round is the rounding operation.
  • variable Rate The construction of the LDPC code guarantees the flexibility of the LDPC code to meet the requirements of the HARQ implementation.
  • two methods are required:
  • Puncturing Puncturing of BCH codes, convolutional codes, and turbo codes can be widely applied to obtain a flexible code rate. It is also possible to apply puncturing to the LDPC code. By appropriate puncturing, a series of high code rate codes can be obtained by removing (puncturing) the low code rate and some bits of the mother code code word. The encoder generates a complete set of parity face bits, but some bits are not sent (punctured). Decoder insertion wipe In addition to the location (erasures) to the punctured parity bits and then decoding code rate R m. It should be noted that erasure is generally represented by zero, and insertion erasure is to place a zero at the position of the punctured parity bit. The variable nodes of those punctured locations can be considered as erased.
  • Punctured parity bits as shown in Figure 2.
  • expansion unlike puncturing, expansion is to construct a low-density parity check code with variable code rate from high bit rate to low bit rate by adding more parity. For a certain bit rate
  • the code defining the above code rate R m is "base code”
  • the punctured mother code code word can obtain a low-density parity check code with a high code rate, and the mother code code word can be expanded.
  • the low-density parity check code with low code rate, the combination of puncturing and expansion guarantees that the designed low-density parity check code has a sufficiently flexible code rate and ensures sufficient performance, and supports incremental redundant HARQ.
  • the compiler is guaranteed to have as little coding error as possible.
  • Hybrid Automatic Request Retransmission HARQ is an extremely important link adaptation technique in wireless communication systems, which is a combination of coding (FEC) technology and automatic request retransmission (ARQ) technology.
  • the following is a brief introduction to the hybrid automatic request retransmission HARQ method, which includes the transmission method in the transmitter and the reception method in the receiver.
  • the method should be universal.
  • the sending method of the transmitter includes:
  • the transmitter sends the first HARQ packet on the designated HARQ channel, a new HARQ transmission starts, and the retransmission times counter is set to 1;
  • the transmitter waits for the acknowledgement/negation sent by the receiver (ACK/NAK);
  • step c After a certain delay (depending on the synchronous mode or the asynchronous mode, the delay is determined by the system, etc.), if the transmitter receives the ACK, the packet has been correctly received, and the HARQ transmission ends; No Bay ij, retransmission count counter Add 1 to determine whether the number of retransmissions exceeds the maximum number of allowed transmissions. If it exceeds, the current HARQ transmission ends. If not, go to step; d. The transmitter makes another HARQ attempt again on the HARQ channel of the current HARQ transmission, and the transmission time can be selected by the system, and the process goes to step b-.
  • the receiving method of the receiver (Reiciver) includes:
  • the receiver decoder combines the original erroneous and retransmitted coded packets according to a specific combining method; e. If correctly decoded, after a certain delay, sends an ACK in the feedback channel, which channel is allocated by the system; otherwise, sends a NAK , store this HARQ package.
  • the merged method may include full incremental redundancy, partial incremental redundancy, and Chase combining.
  • the hybrid automatic request retransmission HARQ implementation structure a large number of documents and books are introduced. Regardless of the method or structure, the generation of HARQ packets is critical and determines performance and complexity.
  • the present invention will provide a HARQ packet generation method based on the low density parity check code design of the present invention. Summary of the invention
  • the technical problem to be solved by the present invention is to provide a low density parity check code HARQ packet generation method.
  • the present invention provides a hybrid automatic request retransmission packet generation method for a low density parity check code, the method comprising the following steps:
  • the low density parity check code encoder generates an N FIR bit LDPC HARQ mother code code word according to the input bit information group, the code word including a bit information packet, an extended parity bit packet, and a punctured parity bit packet, The generated codeword is sent to the HARQ buffer;
  • the low density parity check code has a code rate basic code, and the basic code is uniquely described by a base matrix m 6 x H 3 ⁇ 4 and an expansion factor z; the punctured basic code obtains a code higher than the code, the parity bits need to substantially code codeword puncturing; expansion rate base code to obtain code below, the increase in m b rows above the last row and last ⁇ ⁇ and an increased
  • the LDPC HARQ mother code codeword generating method comprises the following steps:
  • the encoder is based on '. "(Am 6 max ), spreading factor z, encoding the input ⁇ bit information packet, generating Bit codeword
  • N FIR K + (m b + Am 3 ⁇ 4 max ) z bit codeword.
  • step A2 the LDPC HARQ mother code codeword bit arrangement is performed based on the following formula, and the data of the i-th position before the arrangement is placed at the jth position after the arrangement.
  • L " represents the next rounding, i, j and 1 are all starting from o; i is the bit position index of the pre-arranged code words, j is the bit position index of the aligned code words, ⁇ i, j ⁇ K + (m b +Am b )z,' x is the number of padding bits.
  • P is a puncturing pattern vector with "3 ⁇ 4 elements, is from to" 6 constituting a integer of 1, is punctured index vector p 1 elements.
  • the selection pattern P is produced by pressing - v mt _ 2 ⁇ ... ⁇ P. The order produced.
  • the known ⁇ ,.,., ⁇ , generation method includes the following steps:
  • step A3 the codeword bit selection rule is selected based on the following formula, and the bit of the selected result position is placed in the i-th bit position of the kth HARQ packet.
  • '' indicates the position index of the kth HARQ packet, which is used to identify the bit position of the current HARQ packet with the index i, and the first bit corresponds.
  • the present invention also provides a hybrid automatic request retransmission packet generation method for another low density parity check code, the method comprising the following steps:
  • the low density parity check code encoder generates an N FIR bit LDPC HARQ mother code code word according to the input bit information group, the code word includes a bit information packet, an extended check bit packet, and the deletion The remaining check bits are parsed, and the generated codeword is sent to the HARQ buffer;
  • the LDPC HARQ mother code codeword generating method comprises the following steps:
  • the encoder encodes the input bit information packet according to 11: - ' ⁇ ⁇ ), the spreading factor Z, and generates (+A 6 max bit codeword;
  • N FIR K + ⁇ m b + Am b maii )z ⁇ codeword.
  • step B2 the codeword bit selection rule is selected based on the following formula, and the bit of the selected result position is placed in the i-th bit position of the kth HARQ packet.
  • the present invention also provides a hybrid automatic request retransmission packet generation method for a low density parity check code, the method comprising the following steps:
  • the low density parity check code encoder generates an NTM bit LDPC HARQ mother code codeword according to the input bit information group, the codeword includes a bit information packet, an extended check bit packet, and a punctured check bit packet, and generates The codeword is sent to the HARQ buffer;
  • W is the sum of the lengths of ffk HARQ packets: 0
  • the selection pattern p is generated according to , ⁇ P W _ 2 _>... ⁇ ⁇ .
  • the order produced. Known ⁇ ... ⁇ ), the production method includes the following steps:
  • the low-density parity check code has a code rate R m basic code, and the basic code can be uniquely described by a basic matrix "3 ⁇ 4> ⁇ H 6 and an expansion factor z;
  • the LDPC HARQ mother code codeword generating method comprises the following steps:
  • the system will provide the maximum expansion basis matrix required for coding (m 6 +Am 3 ⁇ 4 max )x(3 ⁇ 4 +Am 6 max ) °" (Am 3 ⁇ 4 max ) expansion factor Z and base matrix size parameters k b , n b + Am b ;
  • the encoder encodes the input k b z bit information packet according to W b xtension (Am 6 max ), spreading factor Z, and generates (3 ⁇ 4 + Bit codeword
  • N FIR K + (m b + Am b mm ) zt ⁇ codewords.
  • the present invention also provides a low density HARQ mother code codeword generation method comprising the following steps: a) The system will provide the maximum expansion basis matrix required for codinggorge3 ⁇ 4 + Am ) x(n b + Am x ) ⁇ ⁇ '"( ⁇ ⁇ ), expansion factor ⁇ and base matrix size parameter, n b +Am b ; b) if the input information packet ⁇ Z, i - needs to be filled with a known bit (such as zero) to constitute / ⁇ information packet;
  • the present invention also provides another low-density HARQ mother code codeword generation method, comprising the following steps: a) According to the information packet length matching principle, the system will provide the maximum expansion basis matrix required for coding (" ⁇ + ⁇ + ⁇ ⁇ ) U ' ension (Am b mm ) , expansion factor ⁇ and basis matrix size parameters k b , n b + ⁇ »3 ⁇ 4;
  • the weight is divided into three cases:
  • the method of the invention systematically solves the defects of incremental redundant HARQ support of LDPC codes, and proposes a HARQ packet generation method for various LDPC codes, which considers the expansion and deletion well.
  • the feature of the residual structured low-density parity check code makes the extended punctured structured low-density parity check code have a very efficient and very complete HARQ packet generation method.
  • the HARQ packet generation method of the present invention has two maximum advantages, one ensures that the performance of the high code rate LDPC code is as high as possible by making the extended puncturing structured low density parity check code have an optimal puncturing distribution. Optimal; another proposed to encode based on the actual code rate, significantly improving the efficiency of the coding. BRIEF abstract
  • Figure 1 is a typical digital communication system
  • Figure 3 is a first method of the method of the present invention
  • Figure 5 is a second method of the method of the present invention. Preferred embodiment of the invention
  • the present invention provides a method A for generating a hybrid automatic repeat request HARQ packet of an Extending-and-Puncturing structured low-density parity check code, the method A comprising the following steps. :
  • the low density parity check code encoder generates an N FIR bit LDPC HARQ mother code code word according to the input bit information group, the code word including a bit information packet, an extended parity bit packet, and a punctured parity bit packet,
  • the generated codeword is sent to a HARQ buffer (buffer);
  • the low density parity check code is a structured expansion/puncturing low density parity check code, having a code rate, a basic code, and a basic matrix m 3 ⁇ 4 x 3 ⁇ 4 ⁇ and an expansion factor.
  • ⁇ Unique description; after puncturing the basic codeword, the code with higher code rate is obtained; after the basic code is expanded, the code with lower code rate is obtained.
  • the +1)x of the low-density parity check code of the code rate R F!R (1) ⁇ is obtained ( 3 ⁇ 4 +1) basic matrix
  • ⁇ TM ⁇ reflects the maximum extent of the base matrix expansion, the lowest possible bit rate for the above low density parity check code 7? ⁇ «3 ⁇ 4
  • the above describes how to maximize the base matrix by puncturing expansion based on the base code.
  • the mother code code word can be obtained after puncturing and expanding. More specifically, in step Al t, as shown in FIG. 4, the LDPCHARQ mother code code word generating method includes the following steps:
  • the encoder is based on ⁇ ⁇ ' ⁇ . " ( ⁇ ⁇ ) , expansion factor ⁇ , encodes the input ⁇ bit information packet to generate (? 3 ⁇ 4 + ⁇ " ⁇ bit codeword; d) If / ⁇ has a padding bit, the padding bit is removed, and the final encoding generates a N ⁇ + ⁇ +A ⁇ bit codeword, where the N ⁇ bit codeword consists of K information bits and (m b + ⁇ nax z consists of z-bits, and the ("3 ⁇ 4 + Am 3 ⁇ 4 max ) z-bit calibration packet includes A ° ax ⁇ ⁇ expansion check bits and ⁇ 2 punctured parity bits.
  • step A1 the LDPC HARQ mother code codeword can also be generated by the following method, and the method includes the following steps:
  • the system will provide the maximum expansion basis matrix (m b + Am b max ) x(n b + ⁇ « 3 ⁇ 4 (Am b maK ), expansion factor Z and basic matrix size parameters required for coding. , n b +Am b ; b) If the input information packet ⁇ z, it is also necessary to fill a known bit (such as zero) to form a yt information packet;
  • step A2 the LDPC HARQ mother code codeword bit arrangement is performed based on the following formula.
  • the data of the i-th position before the arrangement is placed at the jth position after the arrangement.
  • P is a selection pattern vector, having ⁇ elements, consisting of integers from 1 to 1 , which is a predefined arrangement of the above elements. Careful selection of the pattern P is required to ensure the best possible puncturing distribution and to ensure that the performance of the punctured code is as optimal as possible.
  • P is the index of the selection vector P as / elements.
  • P is determined by the check matrix portion of the base matrix of the basic code / ⁇ ⁇ . According to the method
  • code word bit selection is one of the main steps, select the pattern ⁇ representation, first select the ⁇ of the base matrix ⁇ ⁇ . Column corresponding parity bits, if necessary, and then select the corresponding column of the basis matrix of parity bits 116, and so on.
  • the selection pattern P is generated according to P m6 _ 1 ⁇ P mi _ 2 ⁇ - ⁇ P. The order produced.
  • production methods include:
  • the element P can be generated; since the change from "3 ⁇ 4-1" to 0, ⁇ , ⁇ , . ⁇ can be generated in sequence, that is, the selection vector ⁇ can be obtained.
  • the selection vector ⁇ can be obtained.
  • ⁇ 0, j is empty.
  • the codeword bit selection rule is selected based on the following formula. In the codeword after bit alignment, the bits of the obtained result according to the formula are selected and placed in the kth HARQ packet. ⁇ i bit position,
  • W is the sum of the lengths of the first k HARQ packets: ZW 0
  • the present invention further provides a method for generating a hybrid automatic retransmission request HARQ packet of another low density parity check code B.
  • the method B includes the following steps:
  • the low density parity check code encoder generates a 13 ⁇ 4 bit LDPC HARQ mother code codeword according to the input bit information group, the codeword includes a bit information packet, an extended face bit packet, and a punctured check bit packet, and the generated The codeword is sent to the HARQ buffer (buffer);
  • the LDPC HARQ mother code codeword generation method in the step B1) is the same as the LDPC HARQ mother code codeword generation method in the foregoing method A, and will not be described in detail herein. Same, in ⁇ no longer detailed "" description. , One ; , ', , , ,
  • the performance of the so-called puncturing code is optimal, that is, the puncturing code has the best BLER performance on the AWGN channel at each code rate.
  • the values of the selected pattern vectors are selected by different puncturing degrees through simulation.
  • the present invention does not limit the manner in which the optimal performance is specifically determined, and may be determined in other ways.
  • the present invention also provides a method C for generating a hybrid automatic repeat request HARQ packet of an Extending-and-Puncturing ⁇ density parity check code, the method C comprising the following steps:
  • the low density parity check code encoder generates an N FIR bit LDPCHARQ mother code code word according to the input bit information group, the code word includes a bit information packet, an extended check bit packet, and a punctured check bit packet, and the generated The codeword is sent to the HARQ buffer (buffer);
  • the LDPC HARQ mother code codeword generation method is the same as the LDPC HARQ mother code codeword generation method in the foregoing method A, and is not described in detail herein;
  • N ' R is the length of the HARQ mother code word
  • ⁇ represents the length of the kth HARQ packet
  • P is the selection pattern vector, which has "3 ⁇ 4 elements, which are composed of integers from to, which are predefined arrangements of the above elements. You need to carefully select the pattern P to ensure the best possible puncturing distribution, guarantee puncturing The performance of the code is as optimal as possible.
  • P is the index of the selection vector P is / element P is determined by the check matrix portion of the basic matrix of the basic code 3 ⁇ 4 ⁇ H 6 .
  • the code word bit selection is one of the main steps, and the selection pattern P indicates that P of the basic matrix H 6 is first selected.
  • the selection pattern P is generated according to P m4 — !
  • the ⁇ constitutes a collection
  • select an element from R5fet When the ⁇ constitutes a collection, then select an element from R5fet.
  • the element can be generated due to the change from "3 ⁇ 4- 1 to 0", and ⁇ , ⁇ 15 , .., ⁇ can be generated in sequence. , that is, the selection vector ⁇ can be obtained.
  • the present invention provides method A and method
  • Method B and method C are three methods; where method A and method C have the same usage scenario, which is different from method B.
  • Method B has requirements for the structure of the basic matrix of the structured low-density parity check code, and method B gives a specific puncturing method.
  • the designed base matrix (or parity check matrix) should consider this method, that is, the corresponding deletion is required.
  • the base matrix (or parity check matrix) of the residual check node has an optimal puncturing distribution, which ensures that the performance of the punctured code is excellent enough.
  • Method A and Method C are not required for the structure of the underlying matrix of the structured low density parity check code.
  • the hybrid automatic request retransmission packet generation method of the low density parity check code of the invention systematically solves the defect of the incremental redundant HARQ support of the LDPC code, and realizes the support of the low density parity check code for HARQ, and gives A HARQ packet generation method based on the low density parity check code design of the present invention.
  • the extended puncturing structured low-density parity check code have the optimal puncturing distribution, the performance of the high-rate LDPC code is guaranteed to be as optimal as possible; on the other hand, based on the actual code rate, the encoding is performed. Significantly improved the efficiency of the coding.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)

Abstract

L'invention concerne un procédé de génération d'un paquet de demande de retransmission automatique hybride d'un code de vérification de parité faible densité qui comporte : A1) un codeur de code de vérification de parité faible densité qui génère un mot de code de code-mère LDPC HARQ de NFIR bits conformément aux paquets d'informations de K bits mis en entrée, ledit mot de code comportant des paquets d'information de bit, des paquets de bit de vérification d'extension et des paquets de bit de vérification de perforation ; le mot de code généré est transmis au tampon HARQ (1) ; A2) le bit de mot de code de code-mère LDPC HARQ est réarrangé dans le tampon HARQ, l'ordre du bit d'information et du bit de vérification d'extension est inchangé mais l'ordre du bit de vérification de perforation est changé (2) ; A3) le bit de mot de code provenant du mot de code de code-mère HARQ réarrangé est sélectionné de façon ordonnée ; autrement dit, la première transmission est démarrée au premier bit de système ; puis la position de démarrage de chaque transmission suit la position de fin de la dernière transmission, afin de générer une séquence de système binaire du paquet HARQ (3).
PCT/CN2008/000078 2007-01-12 2008-01-11 Procédé de génération d'un paquet de demande de retransmission automatique hybride d'un code de vérification de parité faible densité WO2008086735A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007100729562A CN101005334B (zh) 2007-01-12 2007-01-12 一种低密度奇偶校验码的混合自动请求重传包生成方法
CN200710072956.2 2007-01-12

Publications (1)

Publication Number Publication Date
WO2008086735A1 true WO2008086735A1 (fr) 2008-07-24

Family

ID=38704237

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/000078 WO2008086735A1 (fr) 2007-01-12 2008-01-11 Procédé de génération d'un paquet de demande de retransmission automatique hybride d'un code de vérification de parité faible densité

Country Status (2)

Country Link
CN (1) CN101005334B (fr)
WO (1) WO2008086735A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022036657A1 (fr) * 2020-08-20 2022-02-24 Huawei Technologies Co., Ltd. Extension permutée et codes de contrôle de parité à faible densité raccourcis pour demande de répétition automatique hybride

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101005334B (zh) * 2007-01-12 2010-12-29 中兴通讯股份有限公司 一种低密度奇偶校验码的混合自动请求重传包生成方法
CN101325474B (zh) * 2007-06-12 2012-05-09 中兴通讯股份有限公司 Ldpc码的混合自动请求重传的信道编码及调制映射方法
CN101378303B (zh) * 2007-08-31 2011-05-11 华为技术有限公司 重传低密度奇偶校验码的生成方法、处理方法和装置
WO2009094805A1 (fr) * 2008-01-25 2009-08-06 Panasonic Corporation Appareil de communication radio et procédé d'entrelacement
KR101503058B1 (ko) * 2008-02-26 2015-03-18 삼성전자주식회사 저밀도 패리티 검사 부호를 사용하는 통신 시스템에서의 채널 부호화/복호화 방법 및 장치
CN102651652B (zh) * 2008-05-04 2015-07-29 华为技术有限公司 生成码率兼容ldpc码及harq方案的方法及装置
CN101753264B (zh) * 2008-12-18 2013-06-12 华为技术有限公司 用于评价打孔图案性能的门限值的获取方法和装置
CN107404322B (zh) * 2014-09-17 2020-10-16 上海数字电视国家工程研究中心有限公司 针对低码率ldpc码的校验矩阵及ldpc码字
CN106160937B (zh) 2015-04-15 2019-01-04 中兴通讯股份有限公司 一种实现码块分割的方法及装置
CN104994388B (zh) * 2015-07-16 2018-07-06 兰州大学 改进的不等差错保护喷泉码构造方法
TWI652907B (zh) * 2017-01-09 2019-03-01 聯發科技股份有限公司 用於新無線電低密度奇偶校驗碼的偏移係數和提升因數設計
WO2018126914A1 (fr) * 2017-01-09 2018-07-12 中兴通讯股份有限公司 Procédé et dispositif de codage de code de contrôle de parité à faible densité quasi-cyclique, et support de stockage
CN112187403B (zh) * 2017-02-04 2022-01-14 华为技术有限公司 信息处理的方法、装置、通信设备和通信***
CN108631925B (zh) * 2017-03-24 2022-05-03 中兴通讯股份有限公司 一种准循环低密度奇偶校验编码处理方法及装置
SG11202009379VA (en) 2017-03-24 2020-10-29 Zte Corp Processing method and device for quasi-cyclic low density parity check coding
WO2018218466A1 (fr) * 2017-05-28 2018-12-06 华为技术有限公司 Procédé de traitement d'informations et dispositif de communication
CN110870207B (zh) 2017-06-03 2022-05-10 华为技术有限公司 信息处理的方法和通信装置
CN109150420B (zh) * 2017-06-19 2022-02-25 华为技术有限公司 信息处理的方法、装置、通信设备和通信***
CN109391367B (zh) * 2017-08-11 2022-12-30 华为技术有限公司 通信方法和装置
KR102450664B1 (ko) 2017-09-11 2022-10-04 지티이 코포레이션 Ldpc 코딩된 데이터를 프로세싱하기 위한 방법 및 장치
US11121806B2 (en) * 2018-09-07 2021-09-14 Qualcomm Incorporated Decoding performance
US11817958B2 (en) 2019-09-05 2023-11-14 Apple Inc. MAC-based hybrid automatic repeat request (HARQ)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030126551A1 (en) * 1999-12-20 2003-07-03 Ramesh Mantha Hybrid automatic repeat request system and method
CN1697359A (zh) * 2004-04-22 2005-11-16 三星电子株式会社 用于发送和接收数据的***、装置和方法
CN1714512A (zh) * 2002-11-18 2005-12-28 高通股份有限公司 速率兼容的低密度奇偶校验(ldpc)码
US20060206781A1 (en) * 2005-03-04 2006-09-14 Samsung Electronics Co., Ltd. Method for puncturing low density parity check code
CN101005334A (zh) * 2007-01-12 2007-07-25 中兴通讯股份有限公司 一种低密度奇偶校验码的混合自动请求重传包生成方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1758579A (zh) * 2005-09-26 2006-04-12 北京邮电大学 一种混和自动请求重发的方法和装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030126551A1 (en) * 1999-12-20 2003-07-03 Ramesh Mantha Hybrid automatic repeat request system and method
CN1714512A (zh) * 2002-11-18 2005-12-28 高通股份有限公司 速率兼容的低密度奇偶校验(ldpc)码
CN1697359A (zh) * 2004-04-22 2005-11-16 三星电子株式会社 用于发送和接收数据的***、装置和方法
US20060206781A1 (en) * 2005-03-04 2006-09-14 Samsung Electronics Co., Ltd. Method for puncturing low density parity check code
CN101005334A (zh) * 2007-01-12 2007-07-25 中兴通讯股份有限公司 一种低密度奇偶校验码的混合自动请求重传包生成方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022036657A1 (fr) * 2020-08-20 2022-02-24 Huawei Technologies Co., Ltd. Extension permutée et codes de contrôle de parité à faible densité raccourcis pour demande de répétition automatique hybride

Also Published As

Publication number Publication date
CN101005334A (zh) 2007-07-25
CN101005334B (zh) 2010-12-29

Similar Documents

Publication Publication Date Title
WO2008086735A1 (fr) Procédé de génération d'un paquet de demande de retransmission automatique hybride d'un code de vérification de parité faible densité
JP4291372B2 (ja) 並列連接低密度パリティ検査符号を用いるチャンネル符号化／復号化装置及び方法
CN101217337B (zh) 一种支持递增冗余混合自动重传的低密度奇偶校验码编码装置和方法
CN101325474B (zh) Ldpc码的混合自动请求重传的信道编码及调制映射方法
US7802164B2 (en) Apparatus and method for encoding/decoding block low density parity check codes having variable coding rate
WO2017177926A1 (fr) Procédé et appareil de traitement de transmission de données
JP5354979B2 (ja) 低密度パリティ検査畳み込み符号（ｌｄｐｃ−ｃｃ）符号化器及びｌｄｐｃ−ｃｃ復号器
US8527830B2 (en) Encoding method, encoding device, decoding method and decoding device for low density generator matrix codes
US20040123229A1 (en) Encoding/decoding apparatus using low density parity check code
KR20050046471A (ko) 저밀도 패러티 검사 부호를 병렬 연접하는 채널부호화/복호화 장치 및 방법
JPWO2005107081A1 (ja) 再送制御方法および通信装置
EP1665538A2 (fr) Codes de controle de parite a faible densite pour des vitesses de codage multiples
WO2007080827A1 (fr) Procede de generation de matrice de controle
JPWO2004107640A1 (ja) 再送制御方法および通信装置
JPWO2007091327A1 (ja) Ｌｄｐｃ検査行列生成方法及び検査行列生成器並びに符号再送方法
WO2007072721A1 (fr) Procede de generation de matrice d’inspection, procede de codage, dispositif de communication, systeme de communication et codeur
US20100281332A1 (en) encoding method and device for low density generator matrix codes
EP2096763A1 (fr) Dispositif de codage, procédé de codage, dispositif de codage/décodage, et dispositif de communication
CN101436918B (zh) 结构化低密度奇偶校验码的信道编码方法、装置、及***
KR20070020039A (ko) 재송 제어 방법 및 통신 장치
CN110380734B (zh) 低密度奇偶检查码的编码及译码方法
JP2007329828A (ja) 復号方法、復号器および通信装置

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08700633

Country of ref document: EP

Kind code of ref document: A1