CN101807966B - Parity check code decoder and receiving system - Google Patents

Parity check code decoder and receiving system Download PDF

Info

Publication number
CN101807966B
CN101807966B CN 200910006694 CN200910006694A CN101807966B CN 101807966 B CN101807966 B CN 101807966B CN 200910006694 CN200910006694 CN 200910006694 CN 200910006694 A CN200910006694 A CN 200910006694A CN 101807966 B CN101807966 B CN 101807966B
Authority
CN
China
Prior art keywords
node
inspection
pointer
renewal
subtrator
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.)
Active
Application number
CN 200910006694
Other languages
Chinese (zh)
Other versions
CN101807966A (en
Inventor
王承康
林后唯
洪佳君
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Realtek Semiconductor Corp
Original Assignee
Realtek Semiconductor Corp
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 Realtek Semiconductor Corp filed Critical Realtek Semiconductor Corp
Priority to CN 200910006694 priority Critical patent/CN101807966B/en
Publication of CN101807966A publication Critical patent/CN101807966A/en
Application granted granted Critical
Publication of CN101807966B publication Critical patent/CN101807966B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Error Detection And Correction (AREA)

Abstract

The invention relates to a parity check code decoder, which is suitable for receiving a channel quality ratio and at least N bits to be decoded. The parity check code decoder comprises a verification device, a reliability generating device, a bit exchanging device, an exchange checking device and a reliability updating device, wherein the verification device takes each bit to be decoded as a one-bit node and makes one matrix multiply an N-bit node to obtain an (N-K) checking node; the reliability generating device generates a reliable pointer, which is used as an abnormal check index transmitted to the checking node by the bit node, for each bit node; the bit exchanging device generates an abnormal bit pointer for each checking node so as to transmit to the bit node; the exchange checking device updates a plurality of abnormal check pointers, which are used to be transmitted to the checking nodes by the bit nodes, based on the abnormal bit pointers; and the reliability updating device updates the reliable pointer of each bit node according to the abnormal check pointer so as to determine an updating value of each bit node.

Description

Parity check (ldpc) decoders and receiving system
Technical field
The invention relates to a kind of decoding technique, be meant a kind of low density parity check code (low-density parity-check code, LDPC) decoder and receiving system especially.
Background technology
Low density parity check code (LDPC) is a kind of error correcting code.Because coding gain approaches shannon limit (Shannon limit); Recently also be employed in some communication standards gradually; For example: second generation satellite digital video broadcast (Digital Video Broadcast-Satellite version 2; DVB-S2), digital TV ground multimedia broadcasting (Digital Terrestrial Multimedia Broadcasting, DTMB) or IEEE 802.11.In receiving terminal, the LDPC decoder is that each position to be decoded of self-channel in the future is regarded as a node (bit node), and wherein N position node must satisfy (N-K) individual condition, just can obtain correct decoding.And these conditions promptly are called inspection node (check node).
In order to reduce channel disturbance, the LDPC decoder is checked with these inspection nodes and whether is accurately received these positions to be decoded.Thereby be under zero the prerequisite satisfying these inspection nodes; Make this equipotential node and these inspection node exchange possible the probability (that is: possibly be 0 or 1 probability) of this equipotential node each other, in the hope of restoring these to be decoded that do not receive channel disturbance with iterative manner.Therefore, be called the confidence level transmission (belief propagation, BP).
But the computation complexity of iterative process is quite high, minimumly approaches with (Min-sum) algorithm so adopt.And, more revising, that is skew confidence level transmission (off set-BP) with a side-play amount for fear of therefore excessively estimating the possibility probability.Yet side-play amount can't change with the channel quality, causes this equipotential node probability of iteration gained still accurate inadequately, and the confidence level of decoding output is not good yet jointly.
And Changzheng Ma and Boon Poh Ng are in the paper (LDPC DecodingAlgorithm with Estimation of Noise Variance) that was proposed in 2006; Though also advise carrying out iterative computation next time with the channel quality after upgrading; But computational process is quite complicated, so can cause the burden on the hardware.
Summary of the invention
Therefore; The object of the invention promptly is to provide a kind of parity check (ldpc) decoders and receiving system that can reduce computation complexity and improve the decoding confidence level, adds the consideration of channel quality in iterative process; Can make this equipotential node probability have more accuracy, and help to reduce iterations.
So receiving system of the present invention is applicable to through channel to receive N modulating data through low density parity check code (LDPC) coding at least that comprise: channel estimator calculates the channel quality ratio of reacting this channel quality according to these modulating datas; And LDPC decoder; Obtain N position node at least according to these modulating datas; Comprise: demo plant is multiplied by this N position node with low-density parity check (LDPC) matrix and obtains (N-K) individual inspection node, and each inspection node passes message mutually based on this matrix and at least two position nodes; The reliability generation device is for each node produces reliable indicator, to be used as the different inspection index that this node sends the inspection node that can pass message mutually to; Exchange position device is based on this channel quality ratio and these different inspection indexs, for each inspection node produces at least two dystopy pointers, to send the position node that can pass message mutually respectively to; The switching exam device upgrades a plurality of different inspection pointers based on this isotonic pointer, supplies each node to send the inspection node that can pass message mutually respectively to; And the reliability updating device, come the reliable indicator of Refreshing Every position node according to these different inspection pointers, and then determine the updating value of each node.
And parity check (ldpc) decoders of the present invention; Be applicable to the channel quality ratio that receives the reaction channel quality with N encode through low density parity check code (LDPC) to be decoded at least; Comprise: demo plant; Looking each position to be decoded is a node, and is multiplied by this N position node with low-density parity check (LDPC) matrix and obtains (N-K) individual inspection node, and each inspection node passes message mutually based on this matrix and at least two position nodes; The reliability generation device is for each node produces a reliable indicator, to be used as the different inspection index that this node sends the inspection node that can pass message mutually to; Exchange position device is based on this channel quality ratio and these different inspection indexs, for each inspection node produces at least two dystopy pointers, to send the position node that can pass message mutually respectively to; The switching exam device upgrades a plurality of different inspection pointers based on this isotonic pointer, supplies each node to send the inspection node that can pass message mutually respectively to; And the reliability updating device, come the reliable indicator of Refreshing Every position node according to these different inspection pointers, and then determine the updating value of each node.
Description of drawings
Fig. 1 is a calcspar, and the preferred embodiment of receiving system of the present invention is described;
Fig. 2 is a calcspar, and the preferred embodiment of parity check (ldpc) decoders of the present invention is described;
Fig. 3 is the calcspar of the exchange position device of this preferred embodiment;
Fig. 4 is a sketch map, the corresponding relation that the detail bit node is cautious with inspection;
Fig. 5 (a), 5 (b) and 5 (c) are sketch mapes, and the detail bit node can pass message mutually with inspection is cautious;
Fig. 6 is a flow chart, and the decoding process of LDPC decoder is described;
Fig. 7 is a flow chart, and the execution in step of exchange position device is described;
Fig. 8 is a flow chart, and the execution in step of demo plant is described;
Fig. 9 is a calcspar, and another enforcement aspect of exchange position device is described; And
Figure 10 is a calcspar, and the another enforcement aspect of exchange position device is described.
[main element label declaration]
100 receiving systems
1 low-density odd-even check code decoder
11 reliability generation devices, 128,168,178 multiplex (MUX) unit
12,16,17 exchange position device 13 switching exam devices
121 symbol decision unit, 14 reliability updating devices
122 minimum value screening unit, 15 demo plants
123 product unit, 2 reflection love darts
124,164,174 first subtrator 3 remappers
125,165, second subtrator, 5 channel estimator
126,166,176 first sections value cell 7 channels
127,167,177 second sections value cell 61~65 steps
621~624,651~654 substeps
Embodiment
About aforementioned and other technology contents, characteristics and effect of the present invention, in the following detailed description that cooperates with reference to a graphic preferred embodiment, can clearly appear.
Consult Fig. 1, the preferred embodiment of receiving system 100 of the present invention is applicable to the carrier signal that receives through the LDPC coding through channel 7, and this carrier signal has many style system data.This preferred embodiment comprises LDPC decoder 1, reflection love dart 2 (de-mapper), remapper 3 (re-mapper) and channel estimator 5.In the present embodiment; Carrier signal adopts binary phase shift keying (Binary Phase ShiftKeying; BPSK) modulation system; But also can be two-dimentional phase shift keying (Quadrature Phase ShiftKeying, QPSK), the orthogonal frequency multiplex (MUX) (Orthogonal Frequency Division Multiplex, OFDM) or other.
Channel estimator 5 calculates show channel quality first according to these modulating datas and estimates channel variance σ STARTAnd reflection love dart 2 adopts BPSK rectification mode to judge that these modulating datas are to obtain a plurality of positions to be decoded.For example: when judging that modulating data is 1, then evaluating position to be decoded is 1; And when judging that modulating data is-1, then evaluating position to be decoded is 0.Wherein, judgment principle can adopt rigid or soft.
It is a Node B that LDPC decoder 1 is looked each position to be decoded 0, B 1, B 2..., and decode according to this.And in decoding simultaneously, upgrade this equipotential Node B 0, B 1, B 2... possibly be 1 or 0 probability, and then determine this equipotential Node B 0, B 1, B 2... updating value.Remapper 3 upgrades position, back Node B more according to the BPSK modulation system with these 0, B 1, B 2... be mapped as a plurality of mapping (enum) datas again.Then, channel estimator 5 can be calculated these mapping (enum) data is average as channel variance σ after upgrading with the error between these modulating datas again UPDATE, and the delivery channel mass ratio V ( = σ UPDATE 2 σ START 2 ) Supply the decoding foundation of LDPC decoder 1.
Consult Fig. 2 and Fig. 3, LDPC decoder 1 comprises reliability generation device 11, exchange position device 12, switching exam device 13, reliability updating device 14 and demo plant 15.And an exchange position device 12 has symbol decision unit 121, minimum value screening unit 122, product unit 123, first subtrator 124, second subtrator 125, first section value cell 126, second section value cell 127 and multiplex (MUX) unit 128.
And the demo plant 15 of LDPC decoder 1 is to upgrade a back Node B with matrix size for the low-density parity check (LDPC) matrix of (N-K) * N is multiplied by N 0, B 1, B 2... B N-1Obtain checking node C after (N-K) individual renewal 0, C 1, C 2... C N-K-1Upgrade back inspection node C if it should be noted that these 0, C 1, C 2... C N-K-1Be zero, then position, back Node B is upgraded in representative 0, B 1, B 2... B N-1Not disturbed by channel 7.
This matrix has (N-K) * N element (entry) (element value is 0 or 1), and (N-K)>0.It is 1 that the m+1 of hypothesis matrix is listed as the n+1 row element, then definition inspection node C mWith the position Node B nCan pass message mutually, and same inspection node C mCan pass message mutually with at least two position nodes, m=0 wherein, 1,2... (N-K-1), n=0,1,2...N-1.For instance, if matrix, this equipotential node and these inspection nodes shown in equation (1), then relationships between nodes can Fig. 4 explanation, and passes to same inspection node C 2Message must come the self-alignment Node B 1, B 2, B 4And pass to same position Node B 4Message must come self-check node C 2, C 3
1 0 0 1 0 0 0 0 0 1 0 1 0 1 1 0 1 0 0 0 0 0 1 1 · B 0 B 1 B 2 B 3 B 4 B 5 = C 0 C 1 C 2 C 3 - - - ( 1 )
Consult Fig. 2 and Fig. 6; In order to simplify calculating; All decoding processes of the LDPC decoder 1 of present embodiment are with logarithm similarity ratio (Log-likelihood ratio; LLR) with multiplying convert into better simply add operation (for example: Z=X * Y, get just be LLR (Z)=LLR (X)+LLR (Y) behind the LLR), and decoding step is following:
Step 61: demo plant 15 can a preset iteration metering be zero, and exchange position device 12 also can be preset the biased D of moving of one different (extrinsic).But in side circuit, also can change into based on just estimating channel variance σ STARTProduce this dystopy skew D.
And, based on just estimating channel variance σ START, reliability generation device 11 is the position Node B nProduce like equation (2) first and estimate reliability index Q START_n, to be used as a Node B nSend the inspection node C that can pass message mutually to mDifferent inspection index Q Mn(like Fig. 5 (a)).Therefore, the confidence level of the accuracy of channel variance meeting profound influence reliability index.
Q START _ n = ln [ Pr ( B n = 0 ) Pr ( B n = 1 ) ] = - 2 E B | H | 2 · B n σ START 2 = Q mn - - - ( 2 )
Reliable indicator is meant a Node B nMaybe for 0 probability with possibly be the ratio of 1 probability, and E BBe each process LDPC coded data energy of place, transmission end, and | H| 2Change with modulation system and channel conditions.If the employing multi-carrier modulation, then different BPSK modulating datas the channel strength of process have difference.And present embodiment adopts single carrier, so | H| 2=1.Moreover, because reliability index is the result who gets LLR, so when the position Node B nMaybe be higher for 0 probability, reliability index can be greater than 0.Otherwise reliability index is not more than 0.And maybe be high more for the probability of a particular value (0 or 1), the absolute value of reliability index is big more.
Step 62: exchange position device 12 produces by inspection node C mSend the position Node B that can pass message mutually to nA dystopy pointer R MnIts definition is to satisfy inspection node C mBe under zero the prerequisite, for the position node that can pass message mutually exchange each other maybe probability (that is: possibly maybe possibly be 1 probability for 0 probability) message; And exchange is meant dystopy pointer R MnContained message only comprise from other can with inspection node C mPass the position Node B of message mutually N 'And do not comprise a Node B nItself.With Fig. 5 (b) is example, at inspection node C 2Be that exchange position device 12 can be with the position Node B under zero the prerequisite 1, B 2The message of possible probability inform a Node B 4
Quite complicated in view of the calculating that exchanges messages, so the exchange position device 12 of this preferred embodiment adopts one to simplify describing mode, and be aided with channel quality ratio V and approach dystopy pointer R Mn, shown in equation (3).
R m ≈ [ Π n ′ ∈ N ( m ) \ n sign ( Q mn ′ ) ] · { min n ′ ∈ N ( m ) \ n | Q mn ′ | - D · V } - - - ( 3 )
In the aforesaid equation, | x| is the absolute value of x, N (m) n the representative except the position Node B nOuter other can with inspection node C mPass the position Node B of message mutually N ',
Figure G2009100066949D00062
Refer to the minimum value of G in the x set, and sgn (x) is meant the symbol (plus or minus) of x.
And step 62 comprises like the following substep of Fig. 7 and tries to achieve equation (3):
Substep 621: minimum value screening unit 122 from can with inspection node C mPass the position node (B of message mutually nAnd B N ') different inspection index absolute value | Q Mn|, | Q Mn '| in choose reckling and be used as first set point value, and choose time little person and be used as second set point value.
Substep 622: product unit 123 multiplies each other dystopy skew D and channel quality ratio V and obtains upgrading the back skew.And first subtrator 124 makes first set point value deduct this renewal back skew and obtains first subtraction value.Then, export according to the symbol of first subtraction value by first section value cell 126 and be not less than zero first bit pointer.That is to say, when first subtraction value is not less than zero, be first bit pointer with first subtraction value; When less than zero, be first bit pointer with null value.In like manner, second subtrator 125 is also made a concerted effort to export corresponding second set point value with second section value cell 127 and is not less than zero second bit pointer.
Substep 623: symbol decision unit 121 will belong to N (m) n the position Node B N 'Different inspection index Q Mn 'Symbol (plus or minus) multiply each other and export symbol indication, then continue substep 624.And the execution sequence of this substep 623 is not limited thereto, as long as before substep 624, accomplish.
Substep 624: wherein one of first bit pointer and second bit pointer chosen in multiplex (MUX) unit 128, and it is multiplied by symbol indication of substep 623 and obtains dystopy pointer R MnThe mode of choosing is: for inspection node C m, when first set point value is to be selected from a Node B nDifferent inspection index absolute value | Q Mn|, then multiplex (MUX) unit 128 is the position Node B nChoose second bit pointer and be used as dystopy pointer R MnAnd be all the other relevant bits Node B N 'Choose first bit pointer and be used as dystopy pointer R Mn '
This is because send a Node B to nDystopy pointer R MnThe different inspection index absolute value that does not comprise itself | Q Mn|.So when different inspection index absolute value | Q Mn| be the minimum value of selecting, send a Node B so to nDystopy pointer R MnCan only select time little person to calculate.
And step 62 and known offset confidence level are transmitted the difference of (offset-BP) and be: exchange position device 12 also is multiplied by dystopy skew D with channel quality ratio V, makes dystopy pointer R MnCan be along with upgrading back channel variance σ UPDATEAdjust, but the channel quality of effecting reaction estimation at present and raising decoding confidence level.And when misestimating channel variance σ STARTSo that when adopting excessive dystopy skew D, if not in good time to upgrade back channel variance σ UPDATEAdjust, will procrastinate decoding speed.
In addition, because exchange of the present invention position device 12 is with channel quality ratio V ( = σ UPDATE 2 σ START 2 ) Be multiplied by dystopy skew D and come the effecting reaction channel quality, only need to calculate during iteration in the first time Be multiplied by σ afterwards again UPDATE 2Get final product.And known way normally is multiplied by equation (2) But the σ of iteration each time UPDATE 2All different, so must carry out division calculation again.Therefore, compared to known technology, the present invention adopts multiplication to calculate and (is multiplied by σ UPDATE 2) realize, obviously simply many.
Step 63: switching exam device 13 upgrades by the position Node B nSend the inspection node C that can pass message mutually to mDifferent inspection index Q MnIts definition is: satisfying except inspection node C mOuter other can with the position Node B nPass the inspection node C of message mutually M 'Be under zero the prerequisite, to be inspection node C mWith C M 'Exchange dystopy pointer R each other Mn, R M ' nAnd exchange is meant different inspection index Q MnContained message only comprise from other can with the position Node B nPass the inspection node C of message mutually M 'And do not comprise inspection node C mWith Fig. 5 (c) is example, through the position Node B 4, switching exam device 13 can will satisfy inspection node C 3Be that zero dystopy pointer is informed inspection node C 2
This different inspection index Q MnShown in equation (4), wherein M (n) m representative except inspection node C mOuter other can with the position Node B nPass the inspection node C of message mutually M '
Q mn = Q START _ n + Σ m ′ ∈ M ( n ) \ m R m ′ n - - - ( 4 )
Step 64: reliability updating device 14 is with different inspection pointer Q MnAdd and satisfy inspection node C mDystopy pointer R when being zero Mn, think a Node B nReappraise just like the reliability index Q of equation (5) n, wherein M (n) represent all can with the position Node B nPass the inspection node C of message mutually mWith Fig. 5 (c) is example, and reliability updating device 14 can set satisfy inspection node C 2, C 3Be that zero dystopy pointer is used as a Node B 4Reliability index.
Q n = ln [ Pr ( B n = 0 ) Pr ( B n = 1 ) ] = Q START _ n + Σ m ∈ M ( n ) R mn - - - ( 5 )
In addition, observation equation formula (3) can be known dystopy pointer R MnCan be along with channel quality ratio the V (=σ that estimates UPDATE 2/ σ START 2) adjust, and combine from other can with inspection node C mPass the position Node B of message mutually N 'Institute's message transmitted.So equation (5) is adding dystopy pointer R MnAfter, the reliability index Q that reappraises nMust estimate reliability index Q than just START_nHave more confidence level.
Step 65: demo plant 15 is based on this equipotential Node B nReliability index Q nWhether decision continues iterative computation.
And step 65 comprises the following substep like Fig. 8:
Substep 651: demo plant 15 is based on these reliability indexs Q nUpgrade this equipotential Node B n, and will upgrade position, back Node B nSend remapper 3 to upgrade channel quality ratio V.As reliability index Q nGreater than 0, demo plant 15 is with the position Node B nBe updated to 0.As reliability index Q nBe not more than 0, demo plant 15 is with the position Node B nBe updated to 1.And with the increase of iteration metering, reliability index Q nConfidence level high more, this is representing reliability index Q nHave bigger absolute value.Because reliable indicator is with the position Node B nMaybe for 0 probability with maybe be for the result of the ratio of 1 probability after taking the logarithm, so reliability index Q nAbsolute value big more, upgrade position, back Node B nMight be particular value (0 or 1) more.
Substep 652: demo plant 15 is multiplied by these (N) with low-density parity check (LDPC) matrix and upgrades position, back Node B 0~B N-1Obtain checking node C after (N-K) individual renewal 0~C N-K-1
Substep 653: whether demo plant 15 inspection iteration meterings are greater than an iteration critical value.If then finish decoding process; If not, continue substep 654.
Substep 654: these upgrade back inspection node C demo plant 15 inspections 0~C N-K-1Whether be zero entirely.If then finish decoding process, and get wherein k and upgrade position, a back node and be used as decoding output; If not, then demo plant 15 makes the iteration metering add 1, and rebound step 62 iteration calculates.
The reason of execution in step 65 is: demo plant 15 is reaffirmed these inspection nodes C with low-density parity check (LDPC) matrix 0~C N-K-1Whether be zero, and then infer this equipotential Node B 0~B N-1Can be similar in appearance to the transmission end output of LDPC encoder, to guarantee to reduce the interference of channel 7.And the consideration of channel quality ratio V also helps quicken these inspection nodes C in the step 62 0~C N-K-1Converge to zero, reduce iterations simultaneously.
It should be noted that and also can exchange step 63,64 execution sequence.Be in the step 64, satisfy all can with the position Node B nPass the inspection node C of message mutually mBe under the zero prerequisite, reliability updating device 14 is earlier a position Node B nProduce reliability index Q n Switching exam device 13 again in step 63 with reliability index Q nDeduction satisfies inspection node C mDystopy pointer R when being zero Mn, and the Node B that must put in place nGive inspection node C mDifferent inspection index Q Mn
And it should be noted that in the present embodiment that reliability generation device 11 is based on just estimates channel variance σ STARTProduce and just estimate reliability index Q START_n, channel estimator 5 is based on channel variance σ START, σ UPDATEProduce channel quality ratio V.Yet, also can be based on other parameter that can represent channel quality during design circuit and come computing, for example: signal noise ratio (Signal-to-Noise Ration, SNR).
And exchange position device 16 is implemented in the aspect (like Fig. 9) at another, also can change the execution sequence of these subtrators 164,165 and section value cell 166,167.That is: after 122 screenings of minimum value screening unit, first section value cell 166 retrodeviates the first intercepting value that in-migration output one is not less than this renewal back skew according to first set point value and this renewal.That is to say that skew is the first intercepting value with first set point value after first set point value is not less than this renewal; Skew after upgrading less than this is the first intercepting value with this renewal back skew.In like manner, the second intercepting value of second section corresponding second set point value of value cell 167 outputs.Then, first subtrator 164 makes the first intercepting value deduct this renewal back skew and obtains first bit pointer; Second subtrator 165 makes the second intercepting value deduct this renewal back skew and obtains second bit pointer.At last, multiplex (MUX) unit 168 is again based on first bit pointer and second bit pointer output dystopy pointer R Mn
And the another enforcement aspect (like Figure 10) of exchange position device 17 different with above-mentioned enforcement aspect be: the outputs (i.e. first bit pointer and second bit pointer) that multiplex (MUX) unit 178 directly receives these sections value cells 176,177 choose wherein one, deduct for first subtrator 174 and squint after this renewal and obtain first subtraction value.Then, multiplex (MUX) unit 178 is multiplied by symbol with first subtraction value again and indicates and produce dystopy pointer R Mn
In addition, note that more the LDPC decoder 1 in the foregoing description is independently to start from receiving system 100.
In sum; Parity check (ldpc) decoders of the present invention and receiving system are utilized the channel quality ratio V after channel estimator 5 calculates each iteration, utilize multiplication to calculate by exchange position device 12,16,17 again and adjust dystopy pointer R with channel quality ratio V appositely Mn, can effectively channel quality be reacted on decode procedure, improve confidence level, reduce iterations simultaneously and reduce computational complexity, so can reach the object of the invention really.
The above person of thought; Be merely preferred embodiment of the present invention; When not limiting the scope that the present invention implements with this, the simple equivalent of promptly doing according to claim scope of the present invention and invention description generally changes and modifies, and all still belongs in the scope that claim of the present invention contains.

Claims (16)

1. a receiving system is applicable to through channel to receive N modulating data through low density parity check code LDPC coding at least, comprises:
Channel estimator calculates the channel quality ratio of reacting this channel quality according to these modulating datas; And
The LDPC decoder obtains N position node at least according to these modulating datas, comprising:
Demo plant is multiplied by this N position node with low-density parity check (LDPC) matrix and obtains (N-K) individual inspection node, and each inspection node passes message mutually based on this matrix and at least two position nodes;
The reliability generation device for each node produces a reliable indicator, sends the different inspection index that can pass the inspection node of message with this node mutually to be used as this node;
Exchange position device based on this channel quality ratio and these different inspection indexs, for each inspection node produces at least two dystopy pointers, can check that node passes the position node of message mutually with this to send to respectively;
The switching exam device upgrades a plurality of different inspection pointers based on this isotonic pointer, supplies each node to send the inspection node that can pass message with this node mutually respectively to; And
The reliability updating device comes the reliable indicator of Refreshing Every position node according to these different inspection pointers, and then determines the updating value of each node,
Wherein, the reliable indicator after this demo plant upgrades based on these is upgraded this equipotential node, and is multiplied by these with this low-density parity check (LDPC) matrix and upgrades back position nodes and obtain checking node after (N-K) individual renewal; Afterwards, whether these renewal back inspection nodes of this demo plant inspection continue iterative computation with decision.
2. receiving system according to claim 1; Wherein, This exchange position device has the product unit and first subtrator; This product unit is multiplied by dystopy skew with this channel quality ratio and obtains a renewal back skew, and this first subtrator retrodeviates whole this isotonic pointer of transposition according to this renewal again.
3. based on the described receiving system of claim 2, wherein, this exchange position device also has:
The symbol decision unit will multiply each other except the symbol of different inspection pointer that a certain bits node external enwergy and an inspection node wherein pass other node of message mutually and export symbol indication;
The minimum value screening unit, from can with this wherein an inspection node pass mutually the different inspection index absolute value of position node of message, choose reckling and be used as first set point value, and choose time little person and be used as second set point value;
Second subtrator makes this second set point value deduct the skew of this renewal back and obtains second bit pointer, and this first subtrator makes this first set point value deduct this renewals back squinting and obtain first bit pointer; And
The multiplex (MUX) unit, that chooses this first bit pointer and this second bit pointer wherein one is multiplied by this symbol indication, wherein one checks that node sends the dystopy pointer of this certain bits node to obtain this.
4. receiving system according to claim 3; Wherein, This exchange position device also has first section value cell and second section value cell; This first section value cell is the symbol after subtracting each other according to this first subtrator and make this first bit pointer be not less than zero, and this second section value cell is the symbol after subtracting each other according to this second subtrator and make this second bit pointer be not less than zero.
5. receiving system according to claim 3; Wherein, This exchange position device also has first section value cell and second section value cell, and this first section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this first set point value be not less than this renewal back skew, just is sent to this first subtrator; This second section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this second set point value be not less than this renewal back skew, just is sent to this second subtrator.
6. based on the described receiving system of claim 2, wherein, this exchange position device also has:
The symbol decision unit will multiply each other except the symbol of different inspection pointer that a certain bits node external enwergy and an inspection node wherein pass other node of message mutually and export symbol indication;
The minimum value screening unit, from can with this wherein an inspection node pass mutually the different inspection index absolute value of position node of message, choose reckling and be used as first bit pointer, and choose time little person and be used as second bit pointer; And
The multiplex (MUX) unit, that chooses this first bit pointer and this second bit pointer wherein one is sent to this first subtrator;
And this first subtrator makes this wherein one deduct the skew of this renewal back and obtain first subtraction value, this multiplex (MUX) unit again with this first subtraction value be multiplied by this symbol indicate obtain this wherein an inspection node send the dystopy pointer of this certain bits node to.
7. receiving system according to claim 6; Wherein, This exchange position device also has first section value cell and second section value cell, and this first section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this first bit pointer be not less than this renewal back skew, just is sent to this multiplex (MUX) unit; This second section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this second bit pointer be not less than this renewal back skew, just is sent to this multiplex (MUX) unit.
8. receiving system according to claim 1 also comprises the reflection love dart, carries out just being sent to this channel estimator after rectification handles according to these modulating datas.
9. receiving system according to claim 1; Also comprise remapper; Reception is from the updating value of this equipotential node of LDPC decoder, and shines upon a plurality of mapping (enum) datas more according to this, cooperates these modulating datas to calculate this channel quality ratio for this channel estimator.
10. parity check (ldpc) decoders, be applicable to the channel quality ratio that receives the reaction channel quality with N encode through low density parity check code LDPC to be decoded at least, this decoder comprises:
Demo plant, looking each position to be decoded is a node, and is multiplied by this N position node with low-density parity check (LDPC) matrix and obtains (N-K) individual inspection node, and each inspection node passes message mutually based on this matrix and at least two position nodes;
The reliability generation device for each node produces a reliable indicator, sends a different inspection index that can pass the inspection node of message with this node mutually to be used as this node;
Exchange position device based on this channel quality ratio and these different inspection indexs, for each inspection node produces at least two dystopy pointers, can check that node passes the position node of message mutually with this to send to respectively;
The switching exam device upgrades a plurality of different inspection pointers based on this isotonic pointer, supplies each node to send the inspection node that this node of ability passes message mutually respectively to; And
The reliability updating device comes the reliable indicator of Refreshing Every position node according to these different inspection pointers, and then determines the updating value of each node,
Wherein, the reliable indicator after this demo plant upgrades based on these is upgraded this equipotential node, and is multiplied by these with this low-density parity check (LDPC) matrix and upgrades back position nodes and obtain checking node after (N-K) individual renewal; Afterwards, whether these renewal back inspection nodes of this demo plant inspection continue iterative computation with decision.
11. decoder according to claim 10; Wherein, This exchange position device has the product unit and first subtrator; This product unit is multiplied by dystopy skew with this channel quality ratio and obtains a renewal back skew, and this first subtrator retrodeviates whole this isotonic pointer of transposition according to this renewal again.
12. based on the described decoder of claim 11, wherein, this exchange position device also has:
The symbol decision unit will multiply each other except the symbol of different inspection pointer that a certain bits node external enwergy and an inspection node wherein pass other node of message mutually and export symbol indication;
The minimum value screening unit, from can with this wherein an inspection node pass mutually the different inspection index absolute value of position node of message, choose reckling and be used as first set point value, and choose time little person and be used as second set point value;
Second subtrator makes this second set point value deduct the skew of this renewal back and obtains second bit pointer, and this first subtrator makes this first set point value deduct this renewals back squinting and obtain first bit pointer; And
The multiplex (MUX) unit, that chooses this first bit pointer and this second bit pointer wherein one is multiplied by this symbol indication, wherein one checks that node sends the dystopy pointer of this certain bits node to obtain this.
13. decoder according to claim 12; Wherein, This exchange position device also has first section value cell and second section value cell; This first section value cell is the symbol after subtracting each other according to this first subtrator and make this first bit pointer be not less than zero, and this second section value cell is the symbol after subtracting each other according to this second subtrator and make this second bit pointer be not less than zero.
14. decoder according to claim 12; Wherein, This exchange position device also has first section value cell and second section value cell, and this first section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this first set point value be not less than this renewal back skew, just is sent to this first subtrator; This second section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this second set point value be not less than this renewal back skew, just is sent to this second subtrator.
15. based on the described decoder of claim 11, wherein, this exchange position device also has:
The symbol decision unit will multiply each other except the symbol of different inspection pointer that a certain bits node external enwergy and an inspection node wherein pass other node of message mutually and export symbol indication;
The minimum value screening unit, from can with this wherein an inspection node pass mutually the different inspection index absolute value of position node of message, choose reckling and be used as first bit pointer, and choose time little person and be used as second bit pointer; And
The multiplex (MUX) unit, that chooses this first bit pointer and this second bit pointer wherein one is sent to this first subtrator;
And this first subtrator makes this wherein one deduct the skew of this renewal back and obtain first subtraction value, this multiplex (MUX) unit again with this first subtraction value be multiplied by this symbol indicate obtain this wherein an inspection node send the dystopy pointer of this certain bits node to.
16. decoder according to claim 15; Wherein, This exchange position device also has first section value cell and second section value cell, and this first section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this first bit pointer be not less than this renewal back skew, just is sent to this multiplex (MUX) unit; This second section value cell is to retrodeviate the in-migration adjustment according to this renewal to make this second bit pointer be not less than this renewal back skew, just is sent to this multiplex (MUX) unit.
CN 200910006694 2009-02-13 2009-02-13 Parity check code decoder and receiving system Active CN101807966B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200910006694 CN101807966B (en) 2009-02-13 2009-02-13 Parity check code decoder and receiving system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200910006694 CN101807966B (en) 2009-02-13 2009-02-13 Parity check code decoder and receiving system

Publications (2)

Publication Number Publication Date
CN101807966A CN101807966A (en) 2010-08-18
CN101807966B true CN101807966B (en) 2012-12-12

Family

ID=42609594

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200910006694 Active CN101807966B (en) 2009-02-13 2009-02-13 Parity check code decoder and receiving system

Country Status (1)

Country Link
CN (1) CN101807966B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10554222B2 (en) 2015-03-02 2020-02-04 Samsung Electronics Co., Ltd. Transmitter and parity permutation method thereof
KR102426780B1 (en) * 2015-03-02 2022-07-29 삼성전자주식회사 Transmitter and parity permutation method thereof
RU2725175C1 (en) 2016-11-23 2020-06-30 Фраунхофер-Гезелльшафт Цур Фердерунг Дер Ангевандтен Форшунг Е.Ф. Receiving device, transmitting device, communication network, data signal and method which improves retransmission process in communication network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1771476A (en) * 2003-02-26 2006-05-10 弗拉里奥恩技术公司 Soft information scaling for iterative decoding
CN1798012A (en) * 2004-12-30 2006-07-05 松下电器产业株式会社 Error-correcting method of calibrating reliability based on low density parity code
CN101321043A (en) * 2007-06-08 2008-12-10 大唐移动通信设备有限公司 Decoding method and device for low density check code

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1771476A (en) * 2003-02-26 2006-05-10 弗拉里奥恩技术公司 Soft information scaling for iterative decoding
CN1798012A (en) * 2004-12-30 2006-07-05 松下电器产业株式会社 Error-correcting method of calibrating reliability based on low density parity code
CN101321043A (en) * 2007-06-08 2008-12-10 大唐移动通信设备有限公司 Decoding method and device for low density check code

Also Published As

Publication number Publication date
CN101807966A (en) 2010-08-18

Similar Documents

Publication Publication Date Title
US8527857B2 (en) Parity-check-code decoder and receiving system
CN101854226B (en) Broadcast receiver and method for optimizing a scale factor for a log-likelihood mapper
CN100576168C (en) Be used for the soft information transformation of scale of iterative decoding
CN1951079B (en) Iterative channel and interference estimation and decoding
CN100490351C (en) Satellite communication system using low density parity check code and its method
US7350130B2 (en) Decoding LDPC (low density parity check) code with new operators based on min* operator
US9369152B2 (en) Systems and methods for decoding with late reliability information
CN102468857B (en) System and method of decoding ldpc code blocks
CN103064093B (en) Low density parity check (LDPC) code auxiliary iteration carrier synchronization method of global position system (GPS) receiver
CN102882652B (en) M-APSK (amplitude phase shift keying) signal to noise estimation method based on iterative decoding and decision feedback
CN102412843A (en) Adaptive normalized minimum sum LDPC (Low Density Parity Check Code) decoding method and decoder
US20150095726A1 (en) SNR margin determination based on FEC code and/or ECC decoding statistics
CN104584440A (en) Receiver, transmitter, and communication method
CN101807966B (en) Parity check code decoder and receiving system
CN104539295A (en) Initialization method of novel LDPC (Low Density Parity Check) iterative decoding based on characteristic bit apriori information
CN105703781A (en) Hard decision guided forward and backward estimating method for estimating synchronization erroneous position
CN104393877A (en) Irregular LDPC code linear programming decoding method based on weighting
CN101136639B (en) Systems and methods for reduced complexity ldpc decoding
CN1822509B (en) Low density parity check decoder and its method
CN106656209A (en) Cascaded code method adopting iterative decoding for correcting synchronization errors
US7900126B2 (en) Systems and methods for reduced complexity LDPC decoding
CN111313908B (en) Irregular watermark encoding and decoding method for correcting non-binary insertion/deletion
CN104079303A (en) Iterative carrier synchronizing method based on multi-system LDPC code assistance
Baotic et al. Simulation model of DVB-S2 system
CN112003626B (en) LDPC decoding method, system and medium based on navigation message known bits

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