WO2006070836A1 - Méthode de retransmission de données - Google Patents

Méthode de retransmission de données Download PDF

Info

Publication number
WO2006070836A1
WO2006070836A1 PCT/JP2005/023971 JP2005023971W WO2006070836A1 WO 2006070836 A1 WO2006070836 A1 WO 2006070836A1 JP 2005023971 W JP2005023971 W JP 2005023971W WO 2006070836 A1 WO2006070836 A1 WO 2006070836A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
check
decoding
code
information bits
Prior art date
Application number
PCT/JP2005/023971
Other languages
English (en)
Japanese (ja)
Inventor
Zhanji Wu
Jifeng Li
Original Assignee
Matsushita Electric Industrial Co., Ltd.
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 Matsushita Electric Industrial Co., Ltd. filed Critical Matsushita Electric Industrial Co., Ltd.
Publication of WO2006070836A1 publication Critical patent/WO2006070836A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • 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/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different 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/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
    • 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/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1671—Details of the supervisory signal the supervisory signal being transmitted together with control information
    • 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

Definitions

  • the present invention relates to a data retransmission method for performing error correction by combining a check-type reliability of a low density parity check (LDPC) code and an automatic repeat request (ARQ) in wireless communication, and more particularly, using an LDPC code.
  • the present invention relates to a data retransmission method that provides high-efficiency and high-reliability error control technology by an error control method that can effectively use soft output information of decoding and reduce the data transmission amount of the reverse channel.
  • Low density parity check (LDPC) code is a powerful forward error correction code method that has been rediscovered over the last decade. Since this error correction code method is close to the Shannon limit under long code configuration conditions, it is considered to be an effective alternative to turbo codes.
  • Next generation mobile communication and deep space communication (Deep It is very likely to be used for space communication).
  • LDPC codes usually adopt a fixed code rate in order to adapt the channel characteristics and satisfy a certain bit error rate.
  • ARQ automatic repeat request
  • the soft decision result of the decoder is not fully utilized.
  • the receiving side and the transmitting side share a fixed puncturing table and cannot flexibly adapt to information bits with inferior quality.
  • the automatic repeat request technology makes effective use of the soft output information of the decoder.
  • the hybrid ARQ technology based on reliability, RB-ARQ, turbo code A forward error correction that uses is proposed by Shea Jane.
  • RB—ARQ technology is based on the limitations of the iterative decoding algorithm. In the region where the SNR (Signal to Noise Ratio) is high, the iterative performance of the turbo code can approach that of maximum likelihood (ML) decoding. However, in the region where the SNR is low, the convergence performance is affected by decoding failure. Decoding failure is mainly due to some bits (bad bits) with poor transmission quality.
  • the LDPC code is a kind of linear block code, and its check matrix adopts a low-density matrix format. At the time of decoding, it is directly checked whether the checking formula is all zero or not. If it is zero, it means that decoding is correct. If not, decoding fails. Therefore, the difference between the LDPC code and the convolutional code is that the self-check can be completed and the CRC check is not required.
  • the LDPC code uses the Sum-Product algorithm and outputs information bits and check-type soft information during the iterative decoding process. Soft information is a logarithmic value of the probability ratio value when the information bit power is SO and 1 and indicates the reliability that the information bit is 0 or 1. Under high SNR conditions, the Sum-Product algorithm converges to maximum likelihood (ML) decoding! /, And is otherwise similar to a turbo code! /.
  • An object of the present invention is to combine check-type reliability of a low density parity check (LDPC) code with an automatic repeat request (ARQ) and to effectively use soft decision information of decoding using an LDPC code.
  • Another object of the present invention is to provide a data retransmission method capable of reducing the reverse channel transmission amount and providing a highly efficient and highly reliable error control technique.
  • the data retransmission method of the present invention includes a step of obtaining a plurality of check equation values by performing low-density parity detection decoding on data received on a receiving side, and a plurality of the check equation values If all of them are not zero, it is determined that there is an error in the data, and a step of notifying the transmitting side through a feedback channel so as to retransmit the related error data, and the transmitting side retransmits the error data in response to the notification. And a step to perform.
  • the soft decision information of decoding by the LDPC code is effectively used. Therefore, the transmission amount of the reverse channel can be reduced, and a highly efficient and reliable error control technique can be provided.
  • LDPC low density parity check
  • ARQ automatic repeat request
  • FIG. 1A Diagram showing a check matrix
  • FIG. 1B Diagram showing bipartite graph of LDPC code
  • FIG.2 Diagram showing upward update of LDPC decoding
  • FIG. 3 is a diagram showing the likelihood ratio output from the LDPC decoding check equation.
  • FIG.4 Diagram showing downward update of LDPC decoding
  • FIG. 5 is a diagram showing combinations of LDPC codes and ARQ according to the embodiment of the present invention.
  • FIG. 6 is a flowchart for performing retransmission on the transmission side according to the embodiment of the present invention.
  • FIG. 8 is a diagram for explaining retransmission processing on the receiving side according to the embodiment of the present invention.
  • FIG. 9 is a flowchart of a data retransmission method combining an LDPC code and ARQ according to an embodiment of the present invention.
  • an inspection formula with low reliability of a soft output result is defined as a defect inspection equation, and a bit connected to the defect inspection equation is defined as a defective bit.
  • decoding of the Sum-Product algorithm is converged mainly by paying attention to the performance improvement of these defect inspection formulas.
  • a sequence index of a fixed ratio defect inspection formula is transmitted on the reverse channel.
  • the present invention can further obtain an estimate of channel quality (SNR) based on soft information of the defect inspection formula, and transmit an SNR quality indication (high SNR or low SNR) on the reverse channel. .
  • SNR channel quality
  • the LDPC code is simplified by taking the contents shown in FIG. 1 as an example. explain.
  • the LDPC code is a linear block code based on a low-density check matrix. Since 1981 proposed by Tanner to represent low-density linear block codes using bipartite graphs, bipartite graphs have become the primary tool for analyzing LDPC codes.
  • the bipartite graph of H is as follows.
  • N nodes for example, xl, x2,..., X9 below the bipartite graph represent N codewords and are called message nodes.
  • the upper M nodes (for example, ⁇ 1, ⁇ 2,..., A6) represent M check expressions and are called check nodes.
  • a lower message node and an upper check node exist in the same check expression, they are connected by an edge.
  • the number of lines connecting each node is called the degree of that node.
  • each check node A is a parent node of the message node X, and each message node X is a child node of the message node A.
  • the bottom row in Figure 1B represents the message nodes (nine), and the top row represents the check nodes (six).
  • Each node represents a check expression of one row of the matrix A and refers to one check bit. Nodes xl, x4, and x9 and node A1 are connected to represent the check expression in the first row.
  • the X node is activated each time it iterates, and tells q a to its associated A node as its reliability.
  • a is “1” or “0”.
  • q a is the reliability when X is in state a in the information in which other check node forces related to X besides A are also provided.
  • Node A after being activated, inform the X node that is connected as a reliability r a.
  • a is “1” or “0”.
  • r a is the probability that the check expression j is satisfied under the condition that the state of the message node X is a and the state distribution of the other message nodes in the check expression A is known.
  • the reliability of all nodes is updated with each iteration.
  • the pseudo posterior probability e a of ⁇ is calculated, and trial determination is performed to obtain a determination sequence. Then, until the judgment sequence satisfies the formula (1) or the number of iterations reaches the preset maximum value. Iterate until
  • A is a check matrix
  • e 1 and e ° are external values that the message node calculates at each iteration, and are called pseudo post erior probabilities of bit i.
  • ⁇ is a normalization factor of e 1 and e °, and ⁇ and ⁇ are expressed as ⁇
  • R a transmitted to the reception sequence bit i by the check expression j is that the state of the message node X is a.
  • Check node A first obtains q and q from message nodes x and X, respectively,
  • Equation (4) The r obtained in this example is expressed by Equation (4).
  • check node A has three message nodes (X, X, X) and
  • q a transmitted to check equation j by received sequence bit i is the probability when X is in state a in the information provided with other check node forces related to X in addition to A. From the calculation, there is q a shown in the following equation (8) (the calculation process is omitted for simplicity).
  • FIG. 4 is a diagram illustrating downward update of LDPC decoding.
  • message node X is associated with three check nodes (A, A, A), so message node X is not i 1 2 ji First, check node A and A force are obtained r and r, respectively, and q is transmitted to check node A.
  • A, A, A check nodes
  • q is transmitted to check node A.
  • the pseudo posterior probability e determines the probability that bit i is 0 or 1 at the end of the current iteration, and this continues the iteration process indirectly. Whether or not to do so is determined.
  • e 1 (e °)> 0.5
  • the decoding vector x (X, X, ..., X)
  • the likelihood ratio of the test formula that starts the next iteration represents the reliability of the decision test. The larger the value, the greater the probability that the test formula is 0, and the higher the reliability of the test formula.
  • the test If the likelihood ratio of the ⁇ expression is 0, it means that the probability that the check expression is 0 or 1 is equal. If the likelihood ratio of the check expression is a positive number, it means that the probability that the check expression is 0 is greater than the probability that it is 1. The larger the value, the greater the probability that it is 0. Become. If the likelihood ratio of the test formula is a negative number, it means that the test formula has a probability power of 1 that is greater than the probability of ⁇ , and the smaller the value, the greater the probability of being 1.
  • the likelihood ratios can be rearranged, and a few check expressions whose likelihood ratio values are equal to or less than the threshold value can be defined as unreliable check expressions.
  • FIG. 5 is a diagram simply showing combinations of LDPC codes and ARQ according to the embodiment of the present invention.
  • the transmitting side 51 sends the data to the receiving side 52 through the forward transmission channel after passing through the LDPC code.
  • the receiving side 52 performs LDPC decoding, and if the decoding result is not correct, the receiving side 52 notifies the transmitting side 51 to retransmit it through the backward transmission channel (reverse feedback channel).
  • a matching test sequence number can be defined on the sending side 51 and the receiving side 52.
  • the number is notified to the transmitting side 51 through the reverse transmission channel and retransmitted.
  • the information bits related to the unreliability check expression are found, and these information bits are retransmitted through the forward transmission channel.
  • some information bits are associated with multiple unreliability checks (assumed to be N), so these information bits are retransmitted N times and are referred to as bad bits.
  • the Bad bits are usually subject to considerable noise pollution, which leads to non-convergence of LD PC decoding with a low instantaneous SNR and cannot be decoded accurately.
  • the more unreliability checking expressions associated with the same bad bit the stronger the decoding error of this bad bit.
  • the receiving side 52 can transmit a CQI (Channel Quality Indicator), which is a force for feeding back the unreliability check expression. From the simulation, when the channel is good (when SNR is high), the average value and the minimum value of the likelihood ratio of the check equation are high. Therefore, the average or minimum value of the likelihood ratio of the check equation can be used as the CQI of the forward transmission channel.
  • CQI Channel Quality Indicator
  • an appropriate likelihood ratio threshold is selected, and if the CQI is higher than the likelihood ratio threshold, the quality of the forward transmission channel is defined as good, and the CQI is lower than the likelihood ratio threshold. For example, the quality of the forward transmission channel is defined as bad.
  • a plurality of threshold levels may be selected to classify the channel quality into a plurality of levels.
  • FIG. 6 is a flowchart for performing retransmission on the transmission side according to the embodiment of the present invention.
  • the transmitting side 51 finds information bits related to this based on the sequence number of the unreliability check expression received from the receiving side.
  • the information bits are rearranged in the order of the sequence numbers (ascending order or descending order). As described above, there may be overlapping defective information bits.
  • the rearranged information bits are interleaved. Interleaving is an effective technical means for overcoming the related fading channel, and the interleaving here is performed after interleaving.
  • step S64 error correction codes such as redundant accumulation (RA) are performed on the information bits after interleaving.
  • step S65 the data is transmitted to the forward transmission channel.
  • This error correction method is based on CRB-ARQ (and home-Reliability-Based Automatic Retransmission request), which is an ARQ technique based on inspection, and employs an LDPC code for forward error correction.
  • the RA code is a special low-complexity turbo code. From Divsalar, Mceliece The force that is seen This codeword was designed by Divsalar et al. Because it is easy to calculate the weight distribution function.
  • the sign key method for (k, Q) RA code overlaps k input information bits u,..., u by Q times bit by bit, and interleaves this kQ bit.
  • FIGS. 7A and 7B are diagrams showing two equivalent coefficients of four check nodes and a third order (4, 3) RA code.
  • Figure 7A is a direct representation of the RA code.
  • the check node connects to itself and sets the exclusive OR of the variables to 0 (a check node with degree 2 equalizes the two variables connected to itself).
  • FIG. 8 is a flowchart of an apparatus for performing retransmission processing on the reception side according to the embodiment of the present invention.
  • the RA code is not passed on the transmitting side, it is not necessary to perform RA decoding 82 as shown by the dotted line block in the figure.
  • the channel output value 81 of the retransmitted information bit is subjected to the maximum ratio combining with the channel output value 84 of the corresponding information bit at the previous reception by the retransmission frame SNR estimator 83, and then the decoding 87 based on the LDPC code is performed. receive.
  • RA decoding 82 is first performed on the channel output value 81 of the retransmitted information bit to obtain a corresponding soft decision value.
  • the retransmitted frame SNR estimator 83 also performs the maximum ratio combining with the corresponding channel output value 84 of the information bit at the previous reception. Since the optimal maximum ratio combining weight should be directly proportional to the corresponding SNR, the SNR (84, 86) of the previous frame and the retransmitted frame must be estimated.
  • Gaussian density evolution the likelihood ratio of the decoded output and the channel output value are contrasting Gaussian density random variables, and their SNR is almost directly proportional to the output average value.
  • the average value is taken with respect to the absolute value of the likelihood ratio of the immediately preceding frame check equation, and is taken as the estimated SNR.
  • the absolute value of the channel output value (without RA code) or the average value of the likelihood ratio after RA decoding (with RA code) is taken as the estimated SNR.
  • the optimal decoding performance can be obtained by performing weighted addition based on the estimated SNR and decoding by inputting the power to the LDPC decoder through normalization.
  • FIG. 9 is a flowchart of a data retransmission method combining the LDPC code and the automatic retransmission request technique according to the embodiment of the present invention.
  • step S901 a backup is taken of the input data.
  • step S902 it is determined from the feedback signal whether the transmission of the previous frame is accurate (ACK) or error (NACK). If the judgment result in step S900 is ACK, in step S903, the LDPC code of the next data frame is transmitted and transmitted to the receiving side through the forward transmission channel. On the other hand, if the determination result in step S902 is NACK, the process proceeds to step S910, and retransmission flow is started on the transmission side.
  • ACK accurate
  • NACK error
  • the receiving side first determines in step S904 whether the received frame is a retransmission frame. If the judgment result in step S904 is a retransmission frame, the process moves to step S911, and the flow of retransmission processing on the corresponding receiving side is started. In step S905, the received data is subjected to LDPC decoding. On the other hand, when it is determined that the data received in step S904 is not a retransmission frame, the process proceeds directly to step S905, and LDPC decoding is performed on the received data. Thereafter, in step S906, it is determined whether or not the decoding is correct. If it is correct, an ACK signal is generated in step S907, fed back to the transmitting side through the reverse feedback channel, and data is output.
  • step S906 If the determination result in step S906 is a decoding error, a NACK signal is generated in step S908, and the reliability of the check equation is calculated by the above-described equation in step S909. Then, in step S912, the sequence number and CQI of the unreliability check expression are generated and provided to the transmitting side through the feedback channel. Thereafter, the data is retransmitted based on the feedback signal received on the transmission side.
  • the power of retransmission information bits can be dynamically allocated to improve decoding quality.
  • each defective bit is retransmitted only once.
  • the number of retransmissions of defective bits is equal to the number of unreliability check expressions associated with defective bits. In other words, since the power of retransmission increases for defective bits that greatly affect decoding performance, decoding performance can be improved.
  • the check-type reliability of the low density parity check (LDPC) code is combined with the automatic repeat request (ARQ), and the soft decision information for decoding by the LDPC code Can effectively reduce the transmission amount of the reverse channel, and can provide high-efficiency and highly reliable error control technology.

Landscapes

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

Abstract

En combinant la fiabilité d’inspection du code de vérification de parité basse densité (LDPC) avec une requête de retransmission automatique (ARQ) et l’utilisation efficace d’informations de décision logicielle de code par le code LDPC, il est possible de proposer une méthode de retransmission de données pouvant réduire la quantité de transmission d’un canal en direction inverse et une technique hautement efficace et hautement fiable de contrôle d’erreur. Selon cette méthode, l’étape (S906) juge si le décodage a été correct. Si l’étape (S906) juge que le décodage n’a pas été correct, l’étape (S908) génère un signal NACK et l’étape (S909) calcule la fiabilité de l’équation d’inspection. Le contrôle est passé à l’étape (S912) pour générer un numéro de séquence et CQI d’une inspection de non-fiabilité qui est fourni au travers d’un canal de retour à un côté émission.
PCT/JP2005/023971 2004-12-30 2005-12-27 Méthode de retransmission de données WO2006070836A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200410081840.1 2004-12-30
CN 200410081840 CN1798012A (zh) 2004-12-30 2004-12-30 基于低密度奇偶校验码的校验式可信度的纠错方法

Publications (1)

Publication Number Publication Date
WO2006070836A1 true WO2006070836A1 (fr) 2006-07-06

Family

ID=36614948

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2005/023971 WO2006070836A1 (fr) 2004-12-30 2005-12-27 Méthode de retransmission de données

Country Status (2)

Country Link
CN (1) CN1798012A (fr)
WO (1) WO2006070836A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008091223A1 (fr) * 2007-01-25 2008-07-31 Panasonic Corporation Technique de commande de la retransmission
JP2010509790A (ja) * 2005-11-15 2010-03-25 ラマト アット テル アビブ ユニバーシティ リミテッド 多段階誤り訂正方法及び装置
CN111953446A (zh) * 2019-05-14 2020-11-17 中兴通讯股份有限公司 软信息硬判决配置方法、装置、设备及可读存储介质

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101102173B (zh) * 2006-07-05 2011-04-20 华为技术有限公司 一种自动请求重发方法及系统
US7580469B2 (en) * 2006-07-06 2009-08-25 Provigent Ltd Communication link control using iterative code metrics
CN101232346B (zh) * 2007-01-25 2013-03-20 华为技术有限公司 低密度奇偶校验码译码方法和译码装置
CN101106437B (zh) * 2007-08-08 2010-06-09 清华大学 一种有限几何低密度奇偶校验码的译码方法
CN101378304A (zh) 2007-08-28 2009-03-04 华为技术有限公司 基于低密度校验码的重传传输方法及传输设备
CN101807966B (zh) * 2009-02-13 2012-12-12 瑞昱半导体股份有限公司 奇偶校验码解码器及接收系统
CN101854242B (zh) * 2009-04-01 2012-05-30 电子科技大学 基于反馈和LDPC码构建wire-tap信道I的方法
US11005635B2 (en) * 2015-09-22 2021-05-11 Qualcomm Incorporated Reliable channel assisted hybrid-arq
CN106059713B (zh) * 2016-07-25 2019-01-29 河南科技大学 一种通过bsbc构建第一类窃听信道的方法
CN106844085A (zh) * 2016-12-30 2017-06-13 北京联想核芯科技有限公司 数据处理方法和装置
CN110048803B (zh) * 2018-01-17 2021-11-12 中兴通讯股份有限公司 一种低密度奇偶校验码译码的方法、装置和设备
CN110913173B (zh) * 2019-10-30 2023-03-31 湖北大学 一种无人机图像传输系统

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001352253A (ja) * 2000-06-08 2001-12-21 Sony Corp 符号化装置及び符号化方法、並びに、復号装置及び復号方法
JP2004112800A (ja) * 2002-09-17 2004-04-08 Samsung Electronics Co Ltd 適応的ハイブリッド自動再伝送要求方法及び装置

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001352253A (ja) * 2000-06-08 2001-12-21 Sony Corp 符号化装置及び符号化方法、並びに、復号装置及び復号方法
JP2004112800A (ja) * 2002-09-17 2004-04-08 Samsung Electronics Co Ltd 適応的ハイブリッド自動再伝送要求方法及び装置

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
INABA Y., OHTSUKI T.: "Tei Mitsudo Parity Kensa(LDPC) Fugo no Mochiita Reliability-Based Hybrid ARQ (RB-ARQ) Hoshiki", IEICE TECHNICAL REPORT, vol. 104, no. 598, 27 January 2005 (2005-01-27), pages 129 - 134, XP003000401 *
LI J. ET AL: "Rate-Compatible Low Density Parity Check Codes for Capacity-Approaching ARQ Schemes in Packet Data Communications", PROCEEDINGS OF INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INTERNET AND INFORMATION TECHNOLOGY (CIIT), 18 November 2002 (2002-11-18), US VIRGIN ISLANDS, pages 201 - 206, XP002339009 *
ROONGTA A. ET AL: "Reliability-based hybrid ARQ for partial-time jamming channels", MILITARY COMMUNICATIONS CONFERENCE 2004 (MILCOM 2004), vol. 2, 31 October 2004 (2004-10-31), pages 686 - 692, XP010825715 *
SESIA S. ET AL: "Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes", IEEE TRANSACTIONS ON COMMUNICATIONS, vol. 52, no. 8, August 2004 (2004-08-01), pages 1311 - 1321, XP001221240 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010509790A (ja) * 2005-11-15 2010-03-25 ラマト アット テル アビブ ユニバーシティ リミテッド 多段階誤り訂正方法及び装置
WO2008091223A1 (fr) * 2007-01-25 2008-07-31 Panasonic Corporation Technique de commande de la retransmission
US9059846B2 (en) 2007-01-25 2015-06-16 Panasonic Corporation Retransmission control technique
CN111953446A (zh) * 2019-05-14 2020-11-17 中兴通讯股份有限公司 软信息硬判决配置方法、装置、设备及可读存储介质
CN111953446B (zh) * 2019-05-14 2023-05-16 中兴通讯股份有限公司 软信息硬判决配置方法、装置、设备及可读存储介质

Also Published As

Publication number Publication date
CN1798012A (zh) 2006-07-05

Similar Documents

Publication Publication Date Title
WO2006070836A1 (fr) Méthode de retransmission de données
US11451243B2 (en) Method and apparatus for decoding data in communication or broadcasting system
US7975189B2 (en) Error rate estimation/application to code-rate adaption
JP3911263B2 (ja) 適応的ハイブリッド自動再伝送要求方法及び装置
KR100584170B1 (ko) 터보 부호화된 복합 재전송 방식 시스템 및 오류 검출 방법
US8327234B2 (en) Code block reordering prior to forward error correction decoding based on predicted code block reliability
US7747922B2 (en) Adaptive hybrid ARQ systems with BCJR decoding
US20060190801A1 (en) Apparatus and method for generating low density parity check code using zigzag code in a communication system
CN1886926B (zh) 用于计算接收信号误码率的方法和设备
US7600172B2 (en) Method and device for decoding packets of data within a hybrid ARQ scheme
CN109964426B (zh) 用于解析接收信号的信号接收器和方法、通信系统
CN107294652A (zh) 一种数据混合重传处理方法和装置
JPWO2008126422A1 (ja) 再送方法、通信システム、および送信装置
WO2018161852A1 (fr) Système et procédé permettant d'utiliser de codes externes avec des blocs de code de longueur non égale
Mohammadi et al. Simple hybrid ARQ schemes based on systematic polar codes for IoT applications
US20080294967A1 (en) Incremental Redundancy Coding System
CN109428670A (zh) 一种数据差错校验方法及装置、计算机存储介质
CA2694933C (fr) Reordonnancement des blocs de code prealable au decodage de correction d'erreurs sans circuit de retour en fonction des previsions de fiabilite des blocs de code
US8402338B2 (en) Method of error control
KR20150033863A (ko) 비이진 ldpc 부호를 사용하는 수신기에서 데이터를 복호하는 방법 및 장치
Chaudhary et al. Error control techniques and their applications
Liang et al. A systematic multi-packet HARQ scheme using polar codes for IoT
Lin et al. An adaptive hybrid ARQ scheme with constant packet lengths
Keeratihuttayakorn et al. Low complexity partial retransmission arq with hard-decision message-passing technique
CN114915373B (zh) 一种基于ir-harq的scma加窗联合检测和译码方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 05822521

Country of ref document: EP

Kind code of ref document: A1

WWW Wipo information: withdrawn in national office

Ref document number: 5822521

Country of ref document: EP