CN101931497A - Decoding device and method for low-density parity-check (LDPC) - Google Patents
Decoding device and method for low-density parity-check (LDPC) Download PDFInfo
- Publication number
- CN101931497A CN101931497A CN2010101650371A CN201010165037A CN101931497A CN 101931497 A CN101931497 A CN 101931497A CN 2010101650371 A CN2010101650371 A CN 2010101650371A CN 201010165037 A CN201010165037 A CN 201010165037A CN 101931497 A CN101931497 A CN 101931497A
- Authority
- CN
- China
- Prior art keywords
- ldpc
- low
- density checksum
- code
- block
- 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
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
- H03M13/1128—Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations
-
- 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/27—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 using interleaving techniques
- H03M13/2778—Interleaver using block-wise interleaving, e.g. the interleaving matrix is sub-divided into sub-matrices and the permutation is performed in blocks of sub-matrices
-
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/3746—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with iterative decoding
- H03M13/3753—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with iterative decoding using iteration stopping criteria
-
- 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/65—Purpose and implementation aspects
- H03M13/6502—Reduction of hardware complexity or efficient processing
- H03M13/6505—Memory efficient implementations
-
- 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/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
- H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
- H04L1/0051—Stopping criteria
-
- 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/0045—Arrangements at the receiver end
- H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mathematical Physics (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention relates to a decoding device and method for low-density parity-check (LDPC), in particular relates to a decoding device and method for LDPC for controlling iteration times of LDPC in a decoding device in an iterative decoding mode.
Description
[technical field]
The present invention relates to the code translator and the method for a kind of low-density checksum (LDPC) sign indicating number, be particularly related in a kind of code translator that utilizes iterative decoding (Iterative Decoding) mode, be used to control the code translator and the method for low-density checksum (LDPC) sign indicating number of iteration (Iteration) number of times of low-density checksum (LDPC) sign indicating number.
[background technology]
The error correcting code of known low-density checksum (LDPC) sign indicating number for having the performance that approaches shannon limit (ShannonLimit), mainly be applicable to satellite television broadcasting specification standards (DigitalVideo Broadcasting Satellite Version2, DVB-S2), (the China Multimedia Mobile Broadcasting of China Mobile multimedia broadcasting system, CMMB) mobile broadcast communication field, high density magnetic recording device, and optical communication field at a high speed such as, and its purposes has the trend that more and more enlarges.
" rediscovering " low-density checksum (LDPC) sign indicating number in 1996 is when using iteration decoding, and its complexity can not increase too much, afterwards the characteristic of this symbol and the research of generation method has been enlivened.Such low-density checksum (LDPC) sign indicating number is near the error correcting code of shannon limit (Shannon Limit), with turbine code be cited as simultaneously can be applicable to the 4th generation mobile communcations system preferable error correcting code.
The meaning of interleaver (Interleaving) is interpreted as " intersection " on dictionary, in communication system, meaning the mode of interleaving signal, for the crowded mistake that reduces the data of preparing transmission the order of row and column being exchanged the back transmits, thereby signal is become, even the situation that the signal that transmits in air causes crowded wrong (Burst Error) takes place because of multipath fading or lightning, rain is descended, data also can be restored.
The decoder of almost most low-density checksum (LDPC) sign indicating number uses iterative decoding (Iterative Decoding) methods such as sum-product algorithm (Sum-Product Algorithm), minimum-sum algorithm.Interative encode method is that the identical process with a low-density checksum (LDPC) code block (is referred to as core process (Core Process) and carries out repeatedly, till satisfying certain conditions.
At this moment so-called specified conditions are, after executing each core process (Core Process), confirm the whether successful inerrancy of result of decoding again, the affirmation condition of perhaps confirming whether to comprise in the process of mistake (generally is referred to as parity check (Parity Check).Under the situation of the mistake that has taken place to correct, iteration core process several times then can successfully be righted the wrong, and at this moment owing to can satisfy specified conditions, thereby does not again need to carry out core process.
But, under the situation of the mistake that generation can't be corrected, can not successfully right the wrong even iteration is carried out core process.Therefore, generally can carry out number of times and control, and be referred to as greatest iteration (Iteration) number of times the iteration of maximum core process.Low in order to prevent serious performance, thus need to use suitable maximum iteration time, and particularly needed maximum iteration time is bigger under the long situation of the length of low-density checksum (LDPC) sign indicating number, is about about 30～50.Like this, along with the increase of required maximum iteration time, the complexity of low-density checksum (LDPC) decoder increases.
Prior art is to be unit and control the method for greatest iteration (Iteration) number of times independently with indivedual low-density checksums (LDPC) code block, generally uses fixing a kind of maximum iteration time.Should suppose during the design decoder that when code block was deciphered, the iterations of its execution reached default maximum when the such prior art of application and to all low-density checksums (LDPC).The time decreased that this is allowed in the time of can causing carrying out once iteration, in low-density checksum (LDPC) decoder, need thus more to handle (Process) side by side, thereby finally cause increasing the problem of the complexity of low-density checksum (LDPC) decoder.
And, having adopted in the communication system of interleaver (Interleaver), the prior art that is used to embody deinterleaver (Deinterleaver) is generally double buffering (Double Buffering) technology.Promptly, use be equivalent to the interleaver block the twice size memory and embody deinterleaver, wherein the input data to deinterleaver are carried out write activity in a deinterleaver block (Block), in another block, the data that write are carried out simultaneously and read action, and transfer out as the dateout of deinterleaver.This method need be equivalent to the memory of twice size of the block of block interleaver, thereby may cause accounting for sizable part of whole system memory.
For example, use the block interleaver of 360 * 384 sizes in China Mobile's broadcast system (CMMB), if when embodying deinterleaver by method same as the prior art, then need sum to reach 2 * 360 * 384=276, the memory of 480words (needing about 1.58Mbits under the situation of 1word=6bits).
[summary of the invention]
In order to address the above problem, the object of the present invention is to provide a kind of device and method that can reduce the complexity of low-density checksum (LDPC) decoder.
And, another object of the present invention is to provide a kind of device and method that can use deinterleaver (Deinterleaver) memory effectively.
In addition, another purpose of the present invention is to provide a kind of, adopted in the communication system of low-density checksum (LDPC) sign indicating number and interleaver the device and method that can control the iterations of interleaver and low-density checksum (LDPC) code character unit simultaneously at the same time.
For solving above-mentioned existing issue, and reach described purpose of the present invention, the code translator of low-density checksum of the present invention (LDPC) sign indicating number, to low-density checksum (Low Density Parity Check by low-density checksum (LDPC) code device coding, LDPC) output of code word is deciphered, it is characterized in that, comprise: code device transmitted by described low-density checksum (LDPC) the low-density checksum that is interleaved (LDPC) code word is carried out the deinterleaver of deinterleaving, carry out low-density checksum (LDPC) decoder of low-density checksum (LDPC) decoding after the data that input is exported by described deinterleaver.
The code translator of low-density checksum of the present invention (LDPC) sign indicating number, it is characterized in that, adopted size to be M * K (columns M, in the code translator of deinterleaver line number K) (Deinterleaver), under the situation of M＞K, use M * M, and the square memory that uses K * K under the reverse situation is in described deinterleaver.
Utilize the interpretation method of low-density checksum (LDPC) sign indicating number of low-density checksum (LDPC) code translator, it is characterized in that, is that unit carries out iterative decoding (Iterative Decoding) with described low-density checksum (LDPC) sign indicating number with the group, thus greatest iteration (Iteration) number of times of described low-density checksum (LDPC) code character unit is controlled.
The interpretation method of low-density checksum of the present invention (LDPC) sign indicating number, it is characterized in that, be that the maximum block iterations that i code block in described low-density checksum (LDPC) code character of L is allowed to when deciphering is determined by following [formula 1] to size.
N (i)=min{N
G-n
g(i)-N
B, min* (L-i), N
B, max... [formula 1]
-Di i the maximum iteration time that the LCPC code block is allowed to: n (i);
The maximum group iterations of-low-density checksum (LDPC) code character: N
G
The sequence number of the indivedual LCPC code blocks in-low-density checksum (LDPC) code character: i=0,1 ..., L-1;
-begin the accumulation group iterations of i low-density checksum (LDPC) when code block is deciphered: n
g(i);
-MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed: N
B, minAnd
-N
B, minThe maximum of value: N
B, max
Of the present invention in the interpretation method of low-density checksum (LDPC) sign indicating number, it is characterized in that, when described formula 1 satisfied the condition of following formula 2, the maximum block iterations that size is allowed to when for the low-density checksum of L (LDPC) code character is interior i code block being deciphered determined by following formula 3.
N
G=L*N
B, min... [formula 2]
The maximum group iterations of-low-density checksum (LDPC) code character: N
G
The quantity of low-density checksum (LDPC) code block in-low-density checksum (LDPC) code character: L; And
-MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed: N
B, min
N (i)=min{i*N
B, min-n
g(i), N
B, max... [formula 3]
-Di i the maximum iteration time that the LCPC code block is allowed to: n (i);
The sequence number of indivedual low-density checksums (LDPC) code block in-low-density checksum (LDPC) code character: i=0,1 ... L-1;
-begin the accumulation group iterations of low-density checksum (LDPC) when code block is deciphered: n
g(i);
-MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed: N
B, minAnd
-N
B, minThe maximum of value: N
B, max
The interpretation method of low-density checksum of the present invention (LDPC) sign indicating number is characterized in that, reading and writing according to rule 1 and carry out described deinterleaver memory.
[rule 1] as example, describes as follows to the work of block deinterleaver the situation of M＞K.At first, the input data of every M the block deinterleaver direction with the row (Row) of deinterleaver memory is write, and repeat K time.When the deinterleaver memory of a block (Block) write end after, to be unit read with the direction of row every K data.At this moment, and reading parallelly, is that unit writes with the input data of next deinterleaver with M.At this moment, carry out the position write can not surmount read the position.Therefore, when to after the reading and write end of the deinterleaver memory of a block, the direction to row reads in the same manner and writes again.
In the interpretation method of low-density checksum of the present invention (LDPC) sign indicating number, it is characterized in that, described low-density checksum (LDPC) code coding method, adopted described deinterleaver code translator, and rule 1 deinterleaver is simultaneously in the adopted system as described, the size of low-density checksum (LDPC) code character can draw by formula 4.
L=floor (M * K/J) or ceil (M * K/J) ... [formula 4]
The length of-low-density checksum (LDPC) sign indicating number: J;
The columns of-block deinterleaver: M; And
The line number of-block deinterleaver: K.
In the interpretation method of low-density checksum of the present invention (LDPC) sign indicating number, it is characterized in that, described L, M, K, J are using behind additional cushion (Buffer) memory between deinterleaver (Deinterleaver) and low-density checksum (LDPC) decoder under the situation that satisfies L＞ceil (M x K/J) under the state that is allowed to.
In the interpretation method of low-density checksum of the present invention (LDPC) sign indicating number, it is characterized in that the size of described buffer storage such as following formula 5.
(L-ceil (M * K/J)) * J......[formula 5]
The length of-low-density checksum (LDPC) sign indicating number: J;
-ceil(M×K/J)＜L；
The columns of-block deinterleaver: M; And
The line number of-block deinterleaver: K.
As mentioned above, use when of the present invention, with low-density checksum (LDPC) code block is after unit bundlees with the group, maximum iteration time to its group unit is controlled, reduce the actual required maximum iteration time of a low-density checksum (LDPC) block thus, can reach the effect that reduces low-density checksum (LDPC) decoder complexity thus.
And the code translator and the method for low-density checksum of the present invention (LDPC) sign indicating number in the communication system that has adopted interleaver (Interleaver), can be used the memory of deinterleaver (Deinterleaver) effectively.
In addition, the code translator and the method for low-density checksum of the present invention (LDPC) sign indicating number, adopted at the same time in the communication system of interleaver (Interleaver) and low-density checksum (LDPC) sign indicating number, the unit that can organize with interleaver (Interleaver) and low-density checksum (LDPC) simultaneously controls iterations.
[description of drawings]
Fig. 1 is the schematic diagram according to the code translator of low-density checksum of the present invention (LDPC) sign indicating number;
Fig. 2 illustrates generally indivedual low-density checksums (LDPC) code block to be carried out the method flow diagram of iterative decoding;
Fig. 3 a is the schematic diagram of existing low-density checksum (LDPC) decoding timing;
Fig. 3 b is the schematic diagram according to low-density checksum of the present invention (LDPC) decoding timing;
Fig. 4 is the flow chart according to low-density checksum of the present invention (LDPC) code coding method;
Fig. 5 a is the structure chart of existing block interleaver; And
Fig. 5 b is the structure chart according to block deinterleaver of the present invention.
[embodiment]
Below, with reference to accompanying drawing to being elaborated according to a particular embodiment of the invention.
Fig. 1 is, according to the schematic diagram of the code translator of low-density checksum of the present invention (LDPC) sign indicating number.
As shown in Figure 1, code translator (200) according to low-density checksum of the present invention (LDPC) sign indicating number comprising: utilize low-density checksum (LDPC) (Low Density Parity Check from low-density checksum (LDPC) encoder (110), low-density checksum (LDPC)) sign indicating number and after encoding, described output is interweaved by interleaver (120), thus low-density checksum (LDPC) code device (100) of output code word; Receive the deinterleaver (210) of carrying out deinterleaving after described low-density checksum (LDPC) code word; And import the data of exporting by described deinterleaver (210), thereby carry out low-density checksum (LDPC) decoder (220) of low-density checksum (LDPC) decoding.
Fig. 2 illustrates generally indivedual low-density checksums (LDPC) code block to be carried out the method flow diagram of iterative decoding.
As shown in Figure 2, it is as follows indivedual low-density checksums (LDPC) code block to be carried out iterative decoding (IterativeDecoding) method.At first, the input of low-density checksum (LDPC) sign indicating number is a unit with low-density checksum (LDPC) code block generally, receive soft (Soft) LLR (the logarithm ratio of similitude, Log-Likelihood Ratio) value (S200) by de-mapping device (Demapper) or deinterleaver (Deinterleaver).This value that receives is made as initial value, and carry out core process (Core Process) (S210) in iteration (Iterative) mode, all judge the end/continuation (S230) of iteration during each iteration (Iteration) by error correction parity check (Parity Check).
At this moment, if reach default maximum iteration time, behind then finishing iteration (S220), and the output error corrigendum result (S240), finish decode procedure.
Fig. 3 a is the schematic diagram of existing low-density checksum (LDPC) decoding timing, Fig. 3 b is that Fig. 4 is the flow chart according to low-density checksum of the present invention (LDPC) code coding method according to the schematic diagram of low-density checksum of the present invention (LDPC) decoding timing.
Shown in Fig. 3 a, the decoding of each low-density checksum (LDPC) block (310) of existing decoding timing (Timing) is assigned with a determining deviation zero hour.This spacing internal fixation has the value accordingly with predetermined maximum block iteration (Iteration) number of times (300) institute.
Therefore, when the decode procedure of a low-density checksum (LDPC) block finishes early, need to wait for the moment up to next block is deciphered.
As Fig. 3 b and shown in Figure 4, the interpretation method of low-density checksum (LDPC) sign indicating number of the low-density checksum according to the present invention (LDPC) decoding timing is as follows.
At first, calculate maximum iteration time (S400) from low-density checksum (LDPC) code block that begins first.And, to the i of described low-density checksum (LDPC) code character (410) (i=0,1 ... L-1) low-density checksum (LDPC) block is deciphered (Decoding) (S410).
At this moment, after the decoding of end low-density checksum (LDPC) block, calculate accumulation iterations so far, thereby upgrade processing (S420).
At last, to the onblock executing decoding (S430) till the L-1 of low-density checksum (LDPC) code character (410), next low-density checksum (LDPC) code character is carried out deciphered when decoding finishes the back.
At this moment, if L-1 block of described low-density checksum (LDPC) code character do not carried out in decoding, then calculate next low-density checksum (LDPC) code block is carried out the required maximum iteration time (S400) of decoding.
Wherein, do not distribute with a determining deviation zero hour of each low-density checksum (LDPC) onblock executing decoding of low-density checksum (LDPC) decoding timing, but distributed brokenly.Described irregular distribution is for behind the decode procedure that finishes a low-density checksum (LDPC) block, can and then begin the decode procedure of next low-density checksum (LDPC) block.
The present invention is the iterations sum that utilizes low-density checksum (LDPC) group to be allowed to, use the iterations of each low-density checksum of Adaptive Control (LDPC) code block, wherein this iterations sum is to bundle and utilize some needed Control Parameter (controlparameter) to produce to L in described low-density checksum (LDPC) group indivedual low-density checksum (LDPC) code blocks.
At this moment, after L low-density checksum (LDPC) code block bundled, be made as a low-density checksum (LDPC) code character, and after merging the quantity of all low-density checksums (LDPC) code block under low-density checksum (LDPC) code character, be made as group iterations (410).And in order to distinguish therewith, the iterations of indivedual low-density checksums (LDPC) code block is made as block iterations (400), the maximum group iterations with low-density checksum (LDPC) code character is made as N in addition
G, and the accumulation group iterations of i low-density checksum (LDPC) when code block begins to decipher in low-density checksum (LDPC) code character is made as n
g(i).The MIN maximum block iterations that must guarantee each described indivedual low-density checksums (LDPC) code block is made as N
B, min, and the maximum that will be worth is made as N
B, maxThe time, the maximum block iterations n (i) that i low-density checksum (LDPC) is allowed to when code block is deciphered can draw by following formula 1.
If, with the maximum group iterations (N of low-density checksum (LDPC) code character
G) when being set at following formula 2, the average maximum block iterations of low-density checksum (LDPC) code block in low-density checksum (LDPC) code character then is N
B, min, and maximum block iterations n (i) formula 3 described as follows.
N (i)=min{N
G-n
g(i)-N
B, min* (L-i), N
B, max... [formula 1]
-Di i the maximum iteration time that the LCPC code block is allowed to: n (i);
The maximum group iterations of-low-density checksum (LDPC) code character: N
G
The sequence number of the indivedual LCPC code blocks in-low-density checksum (LDPC) code character: i=0,1 ..., L-1;
-begin the accumulation group iterations of i low-density checksum (LDPC) when code block is deciphered: n
g(i);
-MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed: N
B, minAnd
-N
B, minThe maximum of value: N
B, max
N
G=L*N
B, min... [formula 2]
The maximum group iterations of-low-density checksum (LDPC) code character: N
G
The quantity of-low-density checksum (LDPC) code block: L; And
-MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed: N
B, min
N (i)=min{i*N
B, min-n
g(i), N
B, max... [formula 3]
-Di i the maximum iteration time that the LCPC code block is allowed to: n (i);
The sequence number of indivedual low-density checksums (LDPC) code block in-low-density checksum (LDPC) code character: i=0,1 ... L-1;
-begin the accumulation group iterations of i low-density checksum (LDPC) when code block is deciphered: n
g(i);
-MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed: N
B, minAnd
-N
B, minThe maximum of value: N
B, max
Aforesaid mode had both ensured MIN maximum block iterations N
B, min, have at the group iterations simultaneously to enlarge maximum block iterations under the situation more than needed.
In addition, compare, can improve low-density checksum (LDPC) decoder performance with prior art with identical average maximum iteration time.And, compare with prior art with identical low-density checksum (LDPC) decoder performance, can reduce average maximum block iterations.
The described low-density checksum that allows (LDPC) sign indicating number and the required MIN maximum block iterations NB of data (Data) transfer rate, min are important factors of decision low-density checksum (LDPC) decoder complexity.Length, encoding rate, the data transfer rate of low-density checksum (LDPC) sign indicating number determine the maximum decoding time that the LDCP sign indicating number of a block is allowed to when deciphering.
And, determine the time that iteration once is allowed to by average maximum block iterations, and should be worth complexity and the amount of memory that influences core process (Core Process).
Wherein, the time that iteration was allowed to once becomes the key factor of direct decision low-density checksum (LDPC) decoder complexity.
Generally speaking, in the decoder of low-density checksum provided by the invention (LDPC) sign indicating number, be that the method that unit controls iterations has reduced required average maximum block iterations with the code character, make time of being allowed to when reducing iteration one time and finally can reduce the complexity of decoder.
Below, in general communication system, the channel code identical with low-density checksum (LDPC) sign indicating number is connected the back with interleaver (Interleaver) and uses in order to reduce the influence to interval error (Burst Error).Interleaver roughly is divided into block interleaver (Block Interleaver) and convolutional deinterleaver (Convolutional Interleaver), the invention provides a kind of, in that low-density checksum (LDPC) sign indicating number is connected in the system that uses behind the block interleaver, be the method that unit controls the iterations of decoder with above-mentioned low-density checksum (LDPC) code character.
Fig. 5 a is the structure chart of existing block interleaver, and Fig. 5 b is the structure chart according to block deinterleaver of the present invention.
Shown in Fig. 5 a, existing interleaver is made as M * K (columns M in the size with described block interleaver (500), line number K) time, prior art is for utilizing double buffering (Double Buffering) method of the memory that is made of two deinterleavers (Deinterleaving) block, one of them block is carried out write activity to the input data of deinterleaver (Deinterleaver), another block is carried out the input data that write and is read action, and it is transferred out as the output of deinterleaver.
Shown in Fig. 5 b, utilize ((ceil (M * K/J)=L or the floor (M * K/J)=L of the relation between the length J of M * K) and low-density checksum (LDPC) yard according to block deinterleaver of the present invention (600), at this moment L is the size of low-density checksum (LDPC) code character of being managed in the decoder), memory with deinterleaver (Deinterleaver) under the situation of M＞K constitutes with M * M, and under the situation opposite with it, constitute with K * K, make and need not double buffering, (600a 600b) embodies deinterleaver and only use a deinterleaver memory block.
Wherein, [rule 1] as example, describes as follows to the work of deinterleaver the situation of M＞K.At first, the input data of every M the deinterleaver block direction with the row (Row) of deinterleaver memory is write, and repeat K time.When the deinterleaver memory of a block write end after, to be unit read with the direction of row (Column) every K data.At this moment, and reading parallelly, is that unit writes with the input data of next deinterleaver with M.At this moment, carry out the position write can not surmount read the position.Therefore, when to after the reading and write end of the deinterleaver memory of a block, the direction to row reads in the same manner and writes again.
Rule 1 is only utilized the foursquare memory block that is a bit larger tham the interleaver block as mentioned above, carries out required the writing and reading of deinterleaving (Deinterleaving) simultaneously.
In addition, when the big or small L of low-density checksum (LDPC) code character draws as required and by following formula 4, control the group iterations of low-density checksum (LDPC) decoder in above-mentioned mode.
L=floor (M * K/J) or ceil (M * K/J) ... [formula 4]
The length of-low-density checksum (LDPC) sign indicating number: J;
The columns of-block deinterleaver: M; And
The line number of-block deinterleaver: K.
At this moment, M=360 when illustrating the situation of existing C MMB, K=384, need 2 * 360 * 384=276 altogether in the double buffering of prior art (Double Buffering) method, the memory of 480words, only need 384 * 384=147, the memory of 456words in the opposite method of the present invention.This account for double buffering constitute (Double Buffering Scheme) 53.3% less than.
In the method for the present invention,, need make L big fully for the needed performance of average maximum block iterations to being provided is provided.At this moment, when the L value greater than the size of interleaver (be more precisely ceil (under the situation of M * K/J), additional cushion (Buffer) memory between deinterleaver and low-density checksum (LDPC) decoder and embodying.
For example, the buffer (Buffer) of additional as following formula 5 sizes and embodying easily.
(L-ceil (M * K/J)) * J......[formula 5]
The length of-low-density checksum (LDPC) sign indicating number: J;
-ceil(M×K/J)＜L；
The columns of-block deinterleaver: M; And
The line number of-block deinterleaver: K.
As mentioned above, though though in the concrete real-time mode of the present invention the preferred embodiment of the invention is illustrated, the general technical staff of the technical field of the invention might carry out multiple variation in the scope that does not exceed category of the present invention.Thereby, the embodiment that interest field of the present invention can not be limited to illustrate, but should determine according to following claim scope and impartial therewith technology.
Claims (9)
1. low-density checksum (Low Density Parity Check to encoding by low-density checksum (LDPC) code device, LDPC) sign indicating number is exported the code translator of low-density checksum (LDPC) sign indicating number of deciphering, it is characterized in that, the code translator of described low-density checksum (LDPC) sign indicating number comprises: the deinterleaver (Deinterleaver) of described low-density checksum (LDPC) low-density checksum that is interleaved device (LDPC) code word that code device transmitted being carried out deinterleaving, and import the data of exporting by described deinterleaver, and carry out low-density checksum (LDPC) decoder of low-density checksum (LDPC) decoding.
2. the code translator of low-density checksum as claimed in claim 1 (LDPC) sign indicating number, it is characterized in that: adopted size to be M * K (columns M, in the code translator of deinterleaver line number K), under the situation of M＞K, use M * M, and under the reverse situation, the square memory that uses K * K is in described deinterleaver.
3. the interpretation method of low-density checksum (LDPC) sign indicating number that utilizes low-density checksum (LDPC) code translator, it is characterized in that: is that unit carries out iterative decoding (Iterative Decoding) with described low-density checksum (LDPC) sign indicating number with the group, thereby controls greatest iteration (Iteration) number of times of the group unit of described low-density checksum (LDPC) sign indicating number.
4. the interpretation method of low-density checksum as claimed in claim 3 (LDPC) sign indicating number, it is characterized in that: to size is that the maximum block iterations that i code block in described low-density checksum (LDPC) code character of L is allowed to when deciphering can determine by following formula 1, wherein n (i) represents i the maximum iteration time that the LCPC code block is allowed to, N
GThe maximum group iterations of expression low-density checksum (LDPC) code character, i=0,1 ..., L-1 represents the sequence number of the indivedual LCPC code blocks in low-density checksum (LDPC) code character, n
g(i) expression begins the accumulation group iterations of i low-density checksum (LDPC) when code block is deciphered, N
B, minRepresent the MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed, N
B, maxExpression N
B, minThe maximum of value, n (i)=min{N
G-n
g(i)-N
B, min* (L-i), N
B, max... [formula 1].
5. the interpretation method of low-density checksum as claimed in claim 4 (LDPC) sign indicating number, it is characterized in that: when described formula 1 satisfies the condition of following formula 2, the maximum block iterations that size is allowed to when for low-density checksum (LDPC) code character of L is interior i code block being deciphered can be determined by following formula 3, wherein N
GThe maximum group iterations of expression low-density checksum (LDPC) code character, L represents the quantity of low-density checksum (LDPC) code block in low-density checksum (LDPC) code character, N
B, minRepresent the MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed, N
G=L*N
B, min... [formula 2], wherein n (i) represents i the maximum iteration time that the LCPC code block is allowed to, i=0,1 ... L-1 represents the sequence number of indivedual low-density checksums (LDPC) code block in low-density checksum (LDPC) code character, n
g(i) expression begins the accumulation group iterations of low-density checksum (LDPC) when code block is deciphered, N
B, minRepresent the MIN maximum block iterations that each indivedual low-density checksums (LDPC) code block must be guaranteed, N
B, maxExpression N
B, minThe maximum of value, n (i)=min{i*N
B, min-n
g(i), N
B, max... [formula 3].
6. the interpretation method of low-density checksum as claimed in claim 2 (LDPC) sign indicating number, it is characterized in that: to the execution of reading and writing of the memory of described deinterleaver as described in the rule 1, described regular 1 is: with the situation of M＞K as example, work to the block deinterleaver describes as follows, at first, the input data of every M the block deinterleaver direction with the row (Row) of deinterleaver memory is write, and repeat K time.After the writing of the deinterleaver memory that finishes a block, is that unit reads with K to the direction of row (Column).At this moment, and reading parallelly, is that unit write to the direction of row with M with the input data of next deinterleaver.At this moment, carry out the position that writes and to surmount the position of reading.Therefore, when to after the reading and write end of the deinterleaver memory of a block, the direction to row reads in the same manner and writes again.
7. claim 1,2,3, the interpretation method of any described low-density checksum (LDPC) sign indicating number in 6, it is characterized in that: at described low-density checksum (LDPC) code coding method, adopted the code translator of described deinterleaver, and rule 1 deinterleaver simultaneously in the adopted system as described, draw the method for the size of low-density checksum (LDPC) code character by following formula 4, wherein J represents the length of low-density checksum (LDPC) sign indicating number, M represents the columns of block deinterleaver, K represents the line number of block deinterleaver, and L=floor (M * K/J) or ceil (M * K/J) ... [formula 4].
8. the interpretation method of low-density checksum as claimed in claim 7 (LDPC) sign indicating number, it is characterized in that: described L, M, K, J (under the situation of M * K/J), are using after the additional buffer (Buffer) between deinterleaver (Deinterleaver) and low-density checksum (LDPC) decoder satisfying L＞ceil under the state that is allowed to.
9. the interpretation method of low-density checksum as claimed in claim 8 (LDPC) sign indicating number, it is characterized in that: the size of described buffer storage such as following formula 5, wherein J represents the length of low-density checksum (LDPC) sign indicating number, ceil (M * K/J)＜L, M represents columns, K represents line number, (L-ceil (M * K/J)) * J...[formula 5].
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1020090057339A KR101181969B1 (en) | 2009-06-26 | 2009-06-26 | Ldpc code decoding method |
| KR10-2009-0057339 | 2009-06-26 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101931497A true CN101931497A (en) | 2010-12-29 |
| CN101931497B CN101931497B (en) | 2014-12-17 |
Family
ID=43370442
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010165037.1A Expired - Fee Related CN101931497B (en) | 2009-06-26 | 2010-04-12 | Decoding device and method for low-density parity-check (LDPC) |
Country Status (2)
| Country | Link |
|---|---|
| KR (1) | KR101181969B1 (en) |
| CN (1) | CN101931497B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108447523A (en) * | 2014-06-17 | 2018-08-24 | 慧荣科技股份有限公司 | Method for controlling a memory device, memory device and controller |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101043533B1 (en) | 2011-01-10 | 2011-06-23 | 이동원 | Led lighting device with high effiency power supply |
| US8826096B2 (en) | 2011-12-29 | 2014-09-02 | Korea Advanced Institute Of Science And Technology | Method of decoding LDPC code for producing several different decoders using parity-check matrix of LDPC code and LDPC code system including the same |
| US9415459B2 (en) | 2012-04-06 | 2016-08-16 | Illinois Tool Works Inc. | Welding systems having non-contact temperature measurement systems |
| US9266182B2 (en) | 2012-04-06 | 2016-02-23 | Illinois Tools Works Inc. | Welding torch with a temperature measurement device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1335995A (en) * | 1999-08-26 | 2002-02-13 | 皇家菲利浦电子有限公司 | A data writing/reading method, a de-interleaving method, a data processing method, a memory and a memory drive apparatus |
| CN1825770A (en) * | 2005-02-26 | 2006-08-30 | 美国博通公司 | Accelerated message passing decoder adapted for decoding LDPC code signal and method |
| CN101047392A (en) * | 2007-03-23 | 2007-10-03 | 北京航空航天大学 | Decoder device of multi-code LDPC code and decoding method |
| CN101150377A (en) * | 2006-09-18 | 2008-03-26 | 国家广播电影电视总局广播科学研究院 | Bit mapping scheme of 32APSK system for low-density checksum coding |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100413421B1 (en) * | 1999-10-08 | 2003-12-31 | 엘지전자 주식회사 | Method for dual Interleaving |
-
2009
- 2009-06-26 KR KR1020090057339A patent/KR101181969B1/en active IP Right Grant
-
2010
- 2010-04-12 CN CN201010165037.1A patent/CN101931497B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1335995A (en) * | 1999-08-26 | 2002-02-13 | 皇家菲利浦电子有限公司 | A data writing/reading method, a de-interleaving method, a data processing method, a memory and a memory drive apparatus |
| CN1825770A (en) * | 2005-02-26 | 2006-08-30 | 美国博通公司 | Accelerated message passing decoder adapted for decoding LDPC code signal and method |
| CN101150377A (en) * | 2006-09-18 | 2008-03-26 | 国家广播电影电视总局广播科学研究院 | Bit mapping scheme of 32APSK system for low-density checksum coding |
| CN101047392A (en) * | 2007-03-23 | 2007-10-03 | 北京航空航天大学 | Decoder device of multi-code LDPC code and decoding method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108447523A (en) * | 2014-06-17 | 2018-08-24 | 慧荣科技股份有限公司 | Method for controlling a memory device, memory device and controller |
| CN108447523B (en) * | 2014-06-17 | 2021-01-22 | 慧荣科技股份有限公司 | Method for controlling a memory device, memory device and controller |
Also Published As
| Publication number | Publication date |
|---|---|
| KR101181969B1 (en) | 2012-09-11 |
| KR20110000013A (en) | 2011-01-03 |
| CN101931497B (en) | 2014-12-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5384187B2 (en) | Queue-based data detection and decoding system and method | |
| US8443267B2 (en) | Systems and methods for hard decision assisted decoding | |
| US8773790B2 (en) | Systems and methods for dynamic scaling in a read data processing system | |
| US7853854B2 (en) | Iterative decoding of a frame of data encoded using a block coding algorithm | |
| CN102223203B (en) | System and method for the dynamic scaling in data decoding system | |
| US8578253B2 (en) | Systems and methods for updating detector parameters in a data processing circuit | |
| JP4291372B2 (en) | Channel encoding / decoding apparatus and method using parallel concatenated low density parity check code | |
| EP2577672B1 (en) | Advanced bitwise operations and apparatus in a multi-level system with nonvolatile memory | |
| CN101820288B (en) | Information processing method of low-density check codes | |
| CN100525119C (en) | Turbo decoder, turbo decoding method, and turbo decoding program | |
| US20020166095A1 (en) | Mechanism for turbo decoding when CRC for partial blocks is provided | |
| US9230596B2 (en) | Systems and methods for variable rate coding in a data processing system | |
| CN101931497A (en) | Decoding device and method for low-density parity-check (LDPC) | |
| US8321746B2 (en) | Systems and methods for quasi-cyclic LDPC code production and decoding | |
| WO2009009950A1 (en) | Qc-ldpc code decoder and corresponding decoding method | |
| US20110264980A1 (en) | Systems and Methods for Low Density Parity Check Data Decoding | |
| CN101273531B (en) | Improved TURBO-decoding information transmission method, apparatus and system of low density parity check code | |
| CN102611463A (en) | Cascade coding and decoding system and method of multi-system low-density parity check code | |
| CN104333435A (en) | Iteration de-mapping decoding device | |
| US9184954B1 (en) | Systems and methods for directed soft data perturbation in layered decoding | |
| US9214959B2 (en) | Systems and methods for skip layer data decoding | |
| JP2008118628A (en) | Error correction code decoding device | |
| WO2010066778A1 (en) | Method for turbo equalization of zarray coded words | |
| CN101958718B (en) | Improved semi-parallel decoder for low density parity check (LDPC) code and decoding method | |
| EP2665190B1 (en) | Decoding of non-binary codes with symbol re-grouping |
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: 20141217 Termination date: 20200412 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |