CN1852029A - Low-density odd-parity check-code decoding method adopting uniform quantizing variable range - Google Patents
Low-density odd-parity check-code decoding method adopting uniform quantizing variable range Download PDFInfo
- Publication number
- CN1852029A CN1852029A CN 200610012000 CN200610012000A CN1852029A CN 1852029 A CN1852029 A CN 1852029A CN 200610012000 CN200610012000 CN 200610012000 CN 200610012000 A CN200610012000 A CN 200610012000A CN 1852029 A CN1852029 A CN 1852029A
- Authority
- CN
- China
- Prior art keywords
- llr
- bit
- prime
- node
- shift
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000013139 quantization Methods 0.000 claims abstract description 47
- 238000011002 quantification Methods 0.000 claims description 22
- 238000012795 verification Methods 0.000 claims description 5
- 239000011159 matrix material Substances 0.000 description 20
- 238000012545 processing Methods 0.000 description 6
- 238000012804 iterative process Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000006073 displacement reaction Methods 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000007620 mathematical function Methods 0.000 description 1
- 238000006386 neutralization reaction Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Landscapes
- Error Detection And Correction (AREA)
Abstract
This invention relates to a decoding method applying low density odd-even check codes of variable sphere uniform quantization including: selecting a group of parameters for decoding, initializing the soft information of the ith code cell of the LDPC code, the outer information output to the bit node I from the check node and their iterative times, decoding the variable sphere uniform quantization to the initialized and quantized soft information and outer information, totalizing all soft information and outer information of all the bit nodes to get the decodes, carrying out the following hard decision to all decode results to get the output result: if the check sum of the output result sequence is zero, or the iterative times reach to the maximum times, then the decode is finished, otherwise the time is plus with 1 to continue the decode.
Description
Technical field
The invention belongs to communication channel decoding technique field, the effectively and fast numerical quantization method of a kind of employing low density parity check code (LDPC sign indicating number) correcting error of information channel when particularly adopting forward error control (FEC) technology to be used for transfer of data and storage.
Background technology
Data cause various mistakes through regular meeting in storage and transmission course.The reason that produces this mistake has synchronization loss, the multipath fading in the wireless transmission, the magnetic track in the magnetic storage in random noise, the demodulating process damaged etc.This burst error is generally that aperiodicity occurs and duration length is indefinite.Because the existence of these mistakes, limited the memory capacity of memory under the rate of information throughput under the specific bandwidth and the particular area greatly.Particularly in wireless multimedia transmission system, because lot of data will and be subjected in the serious channel that disturbs of various bursts with very high reliability transmission at limited bandwidth, this problem becomes more outstanding.
In order to solve the integrity problem in transfer of data and the storage, adopt the method for chnnel coding usually.In current existing channel coding method, the low density parity check code of Ti Chuing (LDPC sign indicating number) has the most powerful error correcting capability recently, has very strong application prospect.
The LDPC sign indicating number is a kind of binary packet sign indicating number, and this sign indicating number adopts the supersparsity matrix as check matrix.The number of nonzero element is very rare in every row in the matrix (every row), and the position is random distribution.For convenience of description, the number of nonzero element is the weight of this row (row) in the definition delegation (row).For the convenience of describing, adopt the distribution of weight formula to describe this matrix.The column weight amount of same class LDPC code check matrix distributes and can be expressed as with distributed:
λ in the formula
iExpression weight be i be listed in deal shared in the matrix, d
vValue for the maximum of column weight amount in the matrix.Equally, the capable distribution of weight of same class LDPC code check matrix adopts following formula to describe:
ρ in the formula Chinese style
jExpression weight is the row of j shared deal in matrix, d
cMaximum for row weight in the matrix.Because the LDPC sign indicating number is block code, for any legal code word V, with the product of check matrix H be zero, i.e. HV
T=0.By this check equations as can be known, the same code element of the only corresponding LDPC sign indicating number of the nonzero element of every row in the check matrix has formed a constraint that is equivalent to duplication code.For the ease of the description in the decode procedure, defining this restriction relation is a bit node, and the exponent number of node is the weight of these row.And the nonzero element of every row in the check matrix becomes a constraint that is equivalent to check code with pairing LDPC symbol mapped.It is a check-node that this verification of same definition is closed, and the exponent number of node is the weight of this row.Each nonzero element in the matrix had both participated in the restriction relation of bit node, had participated in the restriction relation of check-node again, thereby can to define the pairing pass of matrix nonzero element be " tie line " that links these two kinds of nodes.In iterative decoding process, decoder utilizes the restriction relation of pairing check-node of the row and column of matrix and bit node to carry out iterative decoding.In iterative process, at first utilize the restriction relation of bit node to decipher, the soft information that is input as the receiving sequence correspondence of each bit node (is probability that each symbol is got " 1 " is taken from right logarithm gained again divided by the probability of getting " 0 " value, comprise two information altogether, an information is which value former symbol most probable gets, and another information has then been represented the degree of reliability of this value) and relevant check-node in the output of last once iteration; Subsequently, the output of bit node is delivered to corresponding check-node by " tie line ", utilizes the restriction relation of check-node to decipher again.In this process, a kind of output of node becomes the input of another node, and nonzero element pairing " tie line " becomes " passage " of these two kinds of node input and output exchange messages in the matrix.
The supersparsity characteristic of check matrix has fully been used in the decoding of LDPC sign indicating number, restriction relation by bit node and check-node calculates and the output external information (external information i.e. the information about some code element values that obtains of the restriction relation of all other code elements that belong to a code word by code word, and adopting external information is positive feedback to occur in iterative process alternately.), and feed back mutually, carry out iterative decoding.
Current, the standard interpretation method of LDPC sign indicating number for and amass interpretation method.
This and long-pending interpretation method comprise the steps:
1) initialization:
(1) receiving terminal utilizes sequence of real numbers R
1 N, to the soft information LLR (R of i code element of LDPC sign indicating number
i) be initialized as:
In the formula: σ
2Be the standard variance of interchannel noise,
(2) external information that check-node j is outputed to bit node i is initialized as zero, that is:
LLR(r
ij)=0 (5)
In the formula: r
IjFor output to the external information of bit node i from check-node j;
(3) iterations is initialized as l;
2) soft information and external information after the initialization in the step 1) are deciphered:
(1) the bit node i is output as after the external information of check-node j and soft information decoding:
Col[i in the formula] location sets of expression check matrix H i row nonzero element, q
IjBe external information from bit node i to check-node j;
(2) the external information decoding back output valve that check-node j is outputed to bit node i is:
Row[j in the formula] location sets of expression check matrix H j capable nonzero element, and Ψ (x) be a mathematical function of hyperbolic tangent function tanh (x) extension, as shown in the formula:
3) the soft information of all bit nodes and external information summation being obtained decode results is:
4) resulting decode results is carried out following hard decision and obtains exporting the result:
5) if output as a result sequence verification and be zero, or iterations reaches maximum iteration time, then decoding finishes; Otherwise iterations adds 1, changes step 2 over to).
Consider the realization on hardware (as FPGA, ASIC etc.), above-mentioned LDPC decoding algorithm must carry out numerical quantization and carry out the computing of limited precision.And at present comparatively general numerical quantization algorithm is that the soft information and the external information in the iterative process of input are carried out uniform quantization, and the step of uniform quantization is step 1) and the step 2 at above-mentioned decoding) in the quantization method that carries out of soft information, external information and external information decoding back output valve be:
To the quantification of the step-lengths such as value employing of output after soft information, external information and the external information decoding, promptly with quantizing element set { (2
Q-1-1) ,-2
Q-1..., 2
Q-1, (2
Q-1-1) value that differs minimum } with it represents, exceed ± (2
Q-1-1) value uses respectively ± and (2
Q-1-1) block, wherein q is a quantizing bit number.
Above-mentioned quantization method is the uniform quantization method, but uniform quantization brings the deficiency of following two aspects: the one, and the loss on the performance; The 2nd, quantizing bit number is higher.Because the hardware size of LDPC decoding and quantizing bit number are approximated to the exponential increase relation, need pay bigger cost on the hardware resource in order to reach preferable performance.
And non-uniform quantizing adopts on to the processing of formula (8) and does not wait step-length to quantize, taken into full account the nonlinear characteristic of formula (8), improved decoding performance to a certain extent, but bring other problem: the nonlinear transformation that is adopted in the non-uniform quantizing process causes formula (6) (7) to be not easy to adopt simple addition and displacement to realize, has increased the implementation complexity of hardware.
Summary of the invention
The objective of the invention is to overcome the deficiency in the numerical quantization method of existing low density parity check code decoding, a kind of low density parity check code decoding method of new employing variable range uniform quantization is proposed, the present invention can obtain better decoding performance with less quantizing bit number, reduce the resource and the scale of hardware significantly, and reached the decoding performance when not quantizing.
The low density parity check code decoding method of the employing variable range uniform quantization that the present invention proposes is characterized in that, selects one group of parameter (Q, k
Max, k
Shift, λ
Shift), wherein, Q is a quantizing bit number, k
MaxBe maximum iteration time, k
ShiftFor switching the iterations of quantizing range and step-length, λ
ShiftFor quantizing range and step-length being carried out the factor of companding, use described parameter to decipher: this interpretation method may further comprise the steps:
1) initialization:
(1) receiving terminal utilizes sequence of real numbers R
1 N, to the soft information LLR (R of i code element of LDPC sign indicating number
i) carry out initialization and be quantified as:
Q wherein
fBe the shared bit number of the fractional part of Q;
(2) external information that check-node j is outputed to bit node i is initialized as zero and be quantified as Q bit zero, that is:
LLR(r
j,i)=0,(
j,i)∈{(m,n)|H
m,n=1} (12)
(3) iterations is initialized as 1;
2) soft information and external information after initialization in the step 1) and the quantification are deciphered: if iterations k<K
Shift,
(1) external information and the soft information decoding of bit node i to check-node j also is output as after the quantification:
In the formula: T
v() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the numerical value of being deposited in the table is:
T
v(x)=Ψ(|x|) (14)
Wherein,
The scope of its quantification is [(2
Q-1-1)/2
Qf, (2Q
-1-1)/2
Qf], quantization step is 1/2
Qf
(2) check-node j is outputed to the external information decoding of bit node i and quantize after output valve be:
Wherein
In the formula, T
u() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the numerical value of being deposited in the table is:
T
u(x)=Ψ(x) (18)
The scope of its quantification is [(2
Q-1-1)/2
Qf, (2
Q-1-1)/2
Qf], quantization step is 1/2
Qf
As iterations k 〉=k
Shift,
(1) external information and the soft information decoding of bit node i to check-node j also is output as after the quantification:
In the formula: T
v() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the scope of its quantification is
(2) check-node j is outputed to the external information decoding of bit node i and quantize after output valve be:
T
u() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the scope of its quantification are [λ
Shift(2
Q-1-1)/2
Qfλ
Shift* (2
Q-1-1)/2
Qf], quantization step is λ
Shift/ 2
Qf
3) the soft information of all bit nodes and external information summation being obtained decode results is:
4) resulting decode results is carried out following hard decision and obtains exporting the result:
6) if output as a result sequence verification and be zero, or iterations reaches maximum iteration time, then decoding finishes; Otherwise iterations adds 1, changes step 2 over to).
Characteristics of the present invention and effect:
In the process of method of the present invention based on the LDPC iterative decoding, be revealed as statistics monotonically increasing trend with the absolute value of the output information of node along with the increase of iterations, the output information of long-pending node converges on these characteristics of zero gradually along with the increase of iterations, with node and long-pending node iterative process in adopt variable quantizing range and quantization step that iteration information is quantized respectively, to adapt in the iterative process and the variation tendency of the value of node and long-pending node.When iteration initial, to be arranged to the same with quantization step with the quantizing range of node and long-pending node, surpass the scope and step-length switching times of setting when iterations after, to all enlarge a factor with the quantizing range and the step-length of node output information, simultaneously the quantizing range and the step-length of long-pending node output information are all compressed a factor, continue iteration then and go down until the decoding end.
The present invention can obtain better decoding performance with less quantizing bit number, the resource and the scale of hardware have been reduced significantly, and reach decoding performance when not quantizing, aspect performance and complexity compromise, to significantly be better than the interpretation method of existing uniform quantization and non-uniform quantizing.
Embodiment
The low density parity check code decoding method of the employing variable range uniform quantization that the present invention proposes is described in detail as follows in conjunction with the embodiments:
The major parameter of the LDPC sign indicating number of present embodiment is: code length equals 2032 bits, and code check is
The column weight amount is distributed
Be λ (x)=0.0039x+0.4961x
2+ 0.2500x
3+ 0.2500x
7, row distribution of weight formula is ρ (x)=0.0079x
6+ 0.9921x
7, one group of parameter that present embodiment is selected is: Q=4, k
Max=64, k
Shift=6, λ
Shift=2;
The selection principle of parameter is as follows: Q is a quantizing bit number, select 4~16 according to the constraint of the requirement of decoding performance and hardware resource between positive integer value, the smaller the better under the requirement of satisfying decoding performance; k
MaxBe maximum iteration time, select the value that varies in size according to the quality of the channel conditions of LDPC applied environment, correct with the iterative decoding that guarantees LDPC under condition of severe, its value is the integer value between 20~100; k
ShiftFor switching the iterations of quantizing range and step-length, to select with the variation tendency of iterations added value according to external information in the LDPC decode procedure, basic principle is to allow k
ShiftThe value of the external information of both sides can be easier to cut into two different spans, k
ShiftValue be k
Max Between integer value; λ
ShiftFor quantizing range and step-length being carried out the factor of companding, according to k
ShiftThe statistics multiple relation of both sides external information value determines that its span is the real number value between 1.0~16.0.
The step that present embodiment utilization above-mentioned parameter is deciphered is as follows:
1) initialization:
(1) receiving terminal utilizes sequence of real numbers R
1 N, to the soft information LLR (R of i code element of LDPC sign indicating number
i) carry out initialization and be quantified as:
Q wherein
f=1; Quantizing range [3.5 3.5], quantization step 0.5
(2) external information that check-node j is outputed to bit node i is initialized as zero and be quantified as 4 bits zero, that is:
LLR(r
j,i)=0000,(j,i)∈{(m,n)|H
m,n=1} (24)
(3) iterations is initialized as 1;
2) soft information and external information after initialization in the step 1) and the quantification are deciphered:
If iterations k<6,
(1) external information and the soft information decoding of bit node i to check-node j also is output as after the quantification:
In the formula: T
v() is meant look up table operations, totally 4 bit bit wides, 2
4=16 degree of depth, the numerical value of being deposited in the table is:
T
v(x)=Ψ(|x|) (26)
Wherein,
The scope of its quantification is [(2
4-1-1)/2
1, (2
4-1-1)/2
1], quantization step is 1/2
1
(2) check-node j is outputed to the external information decoding of bit node i and quantize after output valve be:
Wherein
In the formula, T
v() is meant look up table operations, totally 4 bit bit wides, 2
4=16 degree of depth, the numerical value of being deposited in the table is:
T
u(x)=Ψ(x) (30)
The scope of its quantification is [(2
4-1-1)/2
1, (2
4-1-1)/2
1], quantization step is 1/2
1When iterations k 〉=6,
(1) external information and the soft information decoding to bit node i check-node j also is output as after the quantification:
In the formula: T
v() is meant look up table operations, totally 4 bit bit wides, 2
4=16 degree of depth, the scope of its quantification is
(2) check-node j is outputed to the external information decoding of bit node i and quantize after output valve be:
T
u() is meant look up table operations, totally 4 bit bit wides, 2
4=16 degree of depth, the scope of its quantification are [2 * (2
4-1-1)/2
12 * (2
4-1-1)/2
1], quantization step is 2/2
1
4) resulting decode results is carried out following hard decision and obtains exporting the result:
If output as a result sequence verification and be zero, or iterations reaches maximum iteration time, then decoding finishes; Otherwise iterations adds 1, changes step 2 over to).
The effect of present embodiment is described as follows:
Table 1 and table 2 have been listed a LDPC sign indicating number employing standard and long-pending decoding algorithm under the BIAWGN channel respectively, 4 bit uniform quantizations, 6 bit uniform quantizations and resulting decoding performance of numerical quantization method algorithm of the present invention and relevant hardware implementation complexity.By table 1 as seen, under the condition of low signal-to-noise ratio, both error-correcting performances are more or less the same; Under the condition of high s/n ratio, the error-correcting performance of quantization algorithm gained of the present invention is than 4 bit uniform quantizations, and 6 bit uniform quantizations will be got well, and are almost the same with non-quantized decoding performance.In addition, as known from Table 2, the decoding complexity of method of the present invention obviously reduces.The resource of its long-pending node processing unit of neutralization descends about 50% than the uniform quantization method resource needed of at least 6 bits of the needs that reach better performance is general.
As seen, the present invention greatly reduces the hardware implementation complexity of LDPC in the decoding performance that has guaranteed LDPC.
Method of the present invention can be useful in the environment of various use LDPC, as the decoding of the LDPC in the wireless communication system, and the LDPC decoding of optical fiber and the LDPC decoding in the magnetic storage etc.
The performance of the different bit number numerical quantization of table 1. method under the BIAWGN channel
E b/N 0 (dB) | 2.0475 | 1.7237 | 1.5144 | 1.4116 | 1.1103 |
Do not quantize | 4.646e-7 | 2.920e-5 | 4.878e-4 | 1.387e-3 | 1.085e-2 |
4 bit uniform quantizations | 3.150e-5 | 3.503e-4 | 2.178e-3 | 5.181e-3 | 2.917e-2 |
6 bit uniform quantizations | 1.550e-6 | 7.068-5 | 8.060e-4 | 2.506e-3 | 2.097e-2 |
Algorithm of the present invention | 4.383e-7 | 3.189e-5 | 5.528e-4 | 2.068e-3 | 1.725e-2 |
The FPGA of the various quantization methods of table 2 realizes the Resources list
Unit (LUT) | 4 bit uniform quantizations | Algorithm of the present invention | 6 bit uniform quantizations |
Degree be 2 with the node processing unit | 28 | 30 | 68 |
Degree be 3 with the node processing unit | 52 | 54 | 111 |
Degree be 7 with the node processing unit | 170 | 176 | 323 |
Degree is 7 long-pending node processing unit | 145 | 159 | 323 |
Claims (1)
1, a kind of low density parity check code decoding method that adopts the variable range uniform quantization is characterized in that, selects one group of parameter (Q, k
Max, k
Shift, λ
Shift), wherein, Q is a quantizing bit number, k
MaxBe maximum iteration time, k
ShiftFor switching the iterations of quantizing range and step-length, λ
ShiftFor quantizing range and step-length being carried out the factor of companding, use described parameter to decipher: this interpretation method may further comprise the steps:
1) initialization:
(1) receiving terminal utilizes sequence of real numbers R
1 N, to the soft information LLR (R of i code element of LDPC sign indicating number
i) carry out initialization and be quantified as:
Q wherein
fBe the shared bit number of the fractional part of Q;
(2) external information that check-node j is outputed to bit node i is initialized as zero and be quantified as Q bit zero, that is:
LLR(r
j,i)=0,(j,i)∈{(m,n)|H
m,n=1}
(3) iterations is initialized as 1;
2) soft information after initialization in the step 1) and the quantification and external information are carried out variable range uniform quantization decoding:
If iterations k<k
Shift,
(1) external information and the soft information decoding of bit node i to check-node j also is output as after the quantification:
In the formula: T
v() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the numerical value of being deposited in the table is:
T
v(x)=Ψ(|x|)
Wherein,
The scope of its quantification is [(2
Q-1-1)/2
Qf, (2
Q-1-1)/2
Qf], quantization step is 1/2
Qf
(2) check-node j is outputed to the external information decoding of bit node i and quantize after output valve be:
Wherein
In the formula, T
u() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the numerical value of being deposited in the table is: T
u(x)=Ψ (x)
The scope of its quantification is [(2
Q-1-1)/2
Qf, (2
Q-1-1)/2
Qf], quantization step is 1/2
QfAs iterations k 〉=k
Shift,
(1) external information and the soft information decoding of bit node i to check-node j also is output as after the quantification:
In the formula: T
v() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the scope of its quantification is
(2) check-node j is outputed to the external information decoding of bit node i and quantize after output valve be:
T
u() is meant look up table operations, is total to Q bit bit wide, 2
QThe degree of depth, the scope of its quantification are [λ
Shift* (2
Q-1-1)/2
Qfλ
Shift* (2
Q-1-1)/2
Qf], quantization step is λ
Shift/ 2
Qf
3) the soft information of all bit nodes and external information summation being obtained decode results is:
4) resulting decode results is carried out following hard decision and obtains exporting the result:
5) if output as a result sequence verification and be zero, or iterations reaches maximum iteration time, then decoding finishes; Otherwise iterations adds 1, changes step 2 over to).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2006100120009A CN100499378C (en) | 2006-05-26 | 2006-05-26 | Low-density odd-parity check-code decoding method adopting uniform quantizing variable range |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2006100120009A CN100499378C (en) | 2006-05-26 | 2006-05-26 | Low-density odd-parity check-code decoding method adopting uniform quantizing variable range |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1852029A true CN1852029A (en) | 2006-10-25 |
CN100499378C CN100499378C (en) | 2009-06-10 |
Family
ID=37133501
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNB2006100120009A Expired - Fee Related CN100499378C (en) | 2006-05-26 | 2006-05-26 | Low-density odd-parity check-code decoding method adopting uniform quantizing variable range |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN100499378C (en) |
Cited By (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2008080272A1 (en) * | 2006-12-29 | 2008-07-10 | Zte Corporation | A decoding method for ldpc code based on bp arithmetic |
CN101854179A (en) * | 2010-05-26 | 2010-10-06 | 厦门大学 | 5bit quantization method applied to LDPC decoding |
CN101465654B (en) * | 2009-01-06 | 2012-07-18 | 中山大学 | Method for judging decode halt of LDPC code based on checksum error mode |
CN101562456B (en) * | 2009-06-03 | 2012-08-22 | 华北电力大学(保定) | Code assisting frame synchronizing method based on soft decoding information of low-density parity check codes |
US8402340B2 (en) | 2008-11-14 | 2013-03-19 | Realtek Semiconductor Corp. | Parity-check-code decoder and recording controller |
CN101807928B (en) * | 2009-02-13 | 2013-06-05 | 瑞昱半导体股份有限公司 | Recording controller and parity check code decoder |
WO2013117076A1 (en) * | 2012-02-07 | 2013-08-15 | 中兴通讯股份有限公司 | Method and system for iterative decoding |
CN103259545A (en) * | 2013-04-26 | 2013-08-21 | 西安理工大学 | Quasi-cyclic low density odd-even check code belief propagation decoding method based on oscillation |
US8527857B2 (en) | 2008-11-07 | 2013-09-03 | Realtek Semiconductur Corp. | Parity-check-code decoder and receiving system |
CN103957015A (en) * | 2014-05-12 | 2014-07-30 | 福州大学 | Nonuniform quantizing coding method used for decoding LDPC code and application of method in decoder |
CN105187072A (en) * | 2015-08-31 | 2015-12-23 | 四川特伦特科技股份有限公司 | Low-delay LDPC decoding method |
WO2016119120A1 (en) * | 2015-01-27 | 2016-08-04 | 华为技术有限公司 | Fec decoding apparatus and method |
US10447300B2 (en) | 2015-10-13 | 2019-10-15 | Hauwei Technologies Co., Ltd. | Decoding device, decoding method, and signal transmission system |
CN111446970A (en) * | 2020-02-11 | 2020-07-24 | 上海威固信息技术股份有限公司 | Method for preprocessing low-density parity check code decoding soft decision information |
CN112398765A (en) * | 2019-08-15 | 2021-02-23 | 华为技术有限公司 | Signal processing method, receiver and digital processing chip |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7234098B2 (en) * | 2003-10-27 | 2007-06-19 | The Directv Group, Inc. | Method and apparatus for providing reduced memory low density parity check (LDPC) codes |
CN100440737C (en) * | 2003-12-04 | 2008-12-03 | 北京泰美世纪科技有限公司 | High structural LDPC coding and decoding method and coder and decoder |
-
2006
- 2006-05-26 CN CNB2006100120009A patent/CN100499378C/en not_active Expired - Fee Related
Cited By (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8250449B2 (en) | 2006-12-29 | 2012-08-21 | Zte Corporation | Decoding method for LDPC code based on BP arithmetic |
WO2008080272A1 (en) * | 2006-12-29 | 2008-07-10 | Zte Corporation | A decoding method for ldpc code based on bp arithmetic |
US8527857B2 (en) | 2008-11-07 | 2013-09-03 | Realtek Semiconductur Corp. | Parity-check-code decoder and receiving system |
US8402340B2 (en) | 2008-11-14 | 2013-03-19 | Realtek Semiconductor Corp. | Parity-check-code decoder and recording controller |
CN101465654B (en) * | 2009-01-06 | 2012-07-18 | 中山大学 | Method for judging decode halt of LDPC code based on checksum error mode |
CN101807928B (en) * | 2009-02-13 | 2013-06-05 | 瑞昱半导体股份有限公司 | Recording controller and parity check code decoder |
CN101562456B (en) * | 2009-06-03 | 2012-08-22 | 华北电力大学(保定) | Code assisting frame synchronizing method based on soft decoding information of low-density parity check codes |
CN101854179B (en) * | 2010-05-26 | 2012-09-05 | 厦门大学 | 5bit quantization method applied to LDPC decoding |
CN101854179A (en) * | 2010-05-26 | 2010-10-06 | 厦门大学 | 5bit quantization method applied to LDPC decoding |
WO2013117076A1 (en) * | 2012-02-07 | 2013-08-15 | 中兴通讯股份有限公司 | Method and system for iterative decoding |
CN103259545A (en) * | 2013-04-26 | 2013-08-21 | 西安理工大学 | Quasi-cyclic low density odd-even check code belief propagation decoding method based on oscillation |
CN103259545B (en) * | 2013-04-26 | 2017-02-15 | 西安理工大学 | Quasi-cyclic low density odd-even check code belief propagation decoding method based on oscillation |
CN103957015B (en) * | 2014-05-12 | 2017-02-01 | 福州大学 | Nonuniform quantizing coding method used for decoding LDPC code and application of method in decoder |
CN103957015A (en) * | 2014-05-12 | 2014-07-30 | 福州大学 | Nonuniform quantizing coding method used for decoding LDPC code and application of method in decoder |
WO2016119120A1 (en) * | 2015-01-27 | 2016-08-04 | 华为技术有限公司 | Fec decoding apparatus and method |
CN107210755A (en) * | 2015-01-27 | 2017-09-26 | 华为技术有限公司 | A kind of device and method of FEC decodings |
US10505672B2 (en) | 2015-01-27 | 2019-12-10 | Huawei Technologies Co., Ltd. | FEC decoding apparatus and method |
CN107210755B (en) * | 2015-01-27 | 2020-03-10 | 华为技术有限公司 | FEC decoding device and method |
CN105187072A (en) * | 2015-08-31 | 2015-12-23 | 四川特伦特科技股份有限公司 | Low-delay LDPC decoding method |
US10447300B2 (en) | 2015-10-13 | 2019-10-15 | Hauwei Technologies Co., Ltd. | Decoding device, decoding method, and signal transmission system |
CN112398765A (en) * | 2019-08-15 | 2021-02-23 | 华为技术有限公司 | Signal processing method, receiver and digital processing chip |
CN112398765B (en) * | 2019-08-15 | 2021-10-01 | 华为技术有限公司 | Signal processing method, receiver and digital processing chip |
CN111446970A (en) * | 2020-02-11 | 2020-07-24 | 上海威固信息技术股份有限公司 | Method for preprocessing low-density parity check code decoding soft decision information |
Also Published As
Publication number | Publication date |
---|---|
CN100499378C (en) | 2009-06-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN1852029A (en) | Low-density odd-parity check-code decoding method adopting uniform quantizing variable range | |
CN1111962C (en) | Parallel concatenated tail-biting convolutional code and decorder therefor | |
CN1286276C (en) | Random-access multi-directional CDMA2000 TURBO code interleaver | |
US10560218B2 (en) | Apparatus and methods for decoding assistant bit-based polar code construction | |
CN1947368A (en) | Apparatus and method for coding/decoding block low density parity check code with variable block length | |
CN101039119A (en) | Encoding and decoding methods and systems | |
CN1282312C (en) | Method and system for decoding low-density parity check code | |
CN1306713C (en) | Error correction in CDMA mobile communication system using turbo codes | |
CN1839577A (en) | Scaling and quantizing soft-decision metrics for decoding | |
CN101079638A (en) | Low density parity check decoding system and method for reducing complexity | |
CN101080873A (en) | Apparatus and method for decoding using channel code | |
CN1859013A (en) | Low density odd-even check code iterative sequencing statistical decoding method | |
CN1558556A (en) | Systematic code design method for irregular low density parity check code and communication system thereof | |
CN1252935C (en) | Information source-channel united coding method based on low-density odd-even check coding | |
US10666392B2 (en) | Apparatus and methods for rate matching in polar coding | |
EP1800407A1 (en) | System and method for adaptive low-density parity-check (ldpc) coding | |
CN1316829A (en) | Error correction coding type digital transmission method | |
CN1976238A (en) | Method for constituting quasi-circulating low-density parity check code based on block fill algorithm | |
CN1405981A (en) | Improved correcting decoding method for non-regular low-density parity-check code | |
CN108809518B (en) | Method for constructing cascade Spinal code for reducing error performance | |
CN113676188A (en) | Long LDPC code with high code rate | |
CN101060481A (en) | A Turbo code transmission block segmenting method | |
CN110912566A (en) | Channel decoding method of digital audio broadcasting system based on sliding window function | |
CN1258886C (en) | Method and apparatus for combined puncturing and repeating of code symbols in comunication system | |
CN101060339A (en) | A Turbo coding and decoding device and method realized in SCDMA system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090610 Termination date: 20190526 |
|
CF01 | Termination of patent right due to non-payment of annual fee |