CN101075812A - Method for constructing system low-density code with parallel cascade - Google Patents

Method for constructing system low-density code with parallel cascade Download PDF

Info

Publication number
CN101075812A
CN101075812A CNA2007100235948A CN200710023594A CN101075812A CN 101075812 A CN101075812 A CN 101075812A CN A2007100235948 A CNA2007100235948 A CN A2007100235948A CN 200710023594 A CN200710023594 A CN 200710023594A CN 101075812 A CN101075812 A CN 101075812A
Authority
CN
China
Prior art keywords
sequence
system form
matrix
interleaver
density code
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
Application number
CNA2007100235948A
Other languages
Chinese (zh)
Other versions
CN101075812B (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.)
University of Science and Technology of China USTC
Original Assignee
University of Science and Technology of China USTC
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 University of Science and Technology of China USTC filed Critical University of Science and Technology of China USTC
Priority to CN2007100235948A priority Critical patent/CN101075812B/en
Publication of CN101075812A publication Critical patent/CN101075812A/en
Application granted granted Critical
Publication of CN101075812B publication Critical patent/CN101075812B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Error Detection And Correction (AREA)

Abstract

The method comprises: according to the column correlation between the switching matrix H1'and the initial matrix H1, designing an interleaver with least correlation; using said interleaver to parallel cascade the encoders of low density code in two system formations as encoder so as to construct a system formation low density code in parallel cascade structure, which has low encode complexity and better performance.

Description

A kind of building method of system form low-density code of parallel cascade structure
Technical field:
The invention belongs to the channel coding/decoding technical field, particularly the building method of the system form low-density code of parallel cascade structure.
Background technology:
Low-density code (LDPC Codes) technology is generally believed it is important technology in the 4th third-generation mobile communication system.
U.S.'s " Institute of Radio Engineers journal (information theory periodical) " (IRE Transactions on InformationTheory, vol.IT-8, NO.1, p21-28, January, 1962) at first proposed the notion of LDPC sign indicating number, the every characteristic to the LDPC sign indicating number in the literary composition is analyzed, but does not provide a kind of fixing building method.This is because the building method of LDPC sign indicating number has very big flexibility.The encoder complexity of common LDPC sign indicating number is very high, mainly is because matrix multiplication operation that relates in LDPC sign indicating number cataloged procedure and matrix stores all are difficult to simplify.U.S.'s " international electronics and The Institution of Electrical Engineers's consumer electronics journal (international forum of Circuits and Systems) " (IEEE International Symposium on Circuitsand Systems, vol.2, p26-29, May, 2002) a kind of LDPC sign indicating number with system form structure has been proposed, its check matrix is the system form matrix of a standard, therefore cataloged procedure can directly utilize check matrix to finish, again because this check matrix is a sparse matrix, so the complexity of coding reduces greatly.But owing to contain a large amount of column weights in its check matrix is 1 row, influenced the error-correcting performance of this LDPC sign indicating number, so the LDPC code performance that this method construct goes out is relatively poor.
Summary of the invention:
The present invention proposes a kind of building method of system form low-density code of parallel cascade structure, constructing the low-density code of the lower and better performances of a class complexity, can be simple in structure, make error-correcting performance that bigger lifting be arranged in the advantage that encoder complexity is low in retention system form low-density code.
The building method of the system form low-density code of parallel cascade structure of the present invention, comprise: construct a system form low-density code and an interleaver, the size of the check matrix H of this system form low-density code is m * n, m<n wherein, the left side of check matrix H is that a size is the initial matrix H of m * (n-m) 1, the right is the unit matrix I that a size is m * m;
It is characterized in that:
Design the interleaver of the correlation minimum that makes between the two-way verification sequence in the following way: at first to initial matrix H 1Be listed as exchange, calculate through the switching matrix H after the row exchange by following formula then 1' with initial matrix H 1Between the column weight correlation:
C i = Σ k = 1 m H 1 ( k , i ) × H 1 ′ ( k , i ) , 1 ≤ i ≤ n - m
W = Σ i C i , 1 ≤ i ≤ n - m (1)
Wherein, m and n represent the line number and the columns of check matrix H, C respectively iExpression switching matrix H 1' i row and initial matrix H 1I row between the column weight coefficient correlation, W represents switching matrix H 1' with initial matrix H 1The column weight coefficient correlation; At last under the situation with the W minimum pairing row exchange sequence as the interleaved order of interleaver;
Utilize this interleaver that the encoder parallel cascade of the system form low-density code of two structures is risen and be used as encoder, described two encoders that are used for parallel cascade are respectively first encoder and second encoder, and these two encoders are identical; The original coding sequence is carried out obtaining the interweaving encoding sequence after the interleaving treatment, utilize first encoder and second encoder simultaneously original coding sequence and interweaving encoding sequence to be encoded then respectively, obtain the original checksums sequence respectively and the verification sequence that interweaves; By the order of original coding sequence, original checksums sequence and the verification sequence that interweaves these three combined sequence are risen at last and be used as a complete coded frame;
Utilize this interleaver and corresponding deinterleaver that the decoder of two system form low-density codes is together in series as decoder again, described two decoders that are used to connect are respectively first decoder and second decoder, these two decoders adopt identical or different conventional low-density code decoding algorithm, comprise and long-pending decoding algorithm, minimum and decoding algorithm or Probability Decoding algorithm; Utilize first decoder that the confidence level of original coding sequence and the confidence level of original checksums sequence are decoded earlier, obtain the confidence level of interweaving encoding sequence after the confidence level of the original coding sequence that first decoder is exported is handled through interleaver then, utilize second decoder that the confidence level of interweaving encoding sequence and the confidence level of the verification sequence that interweaves are decoded again, the confidence level of the original coding sequence after obtaining upgrading after the confidence level of the interweaving encoding sequence that second decoder is exported is handled by deinterleaver again, between two decoders, carry out iteration by this flow process then, until satisfy till the decoding end condition, promptly construct the system form low-density code of the parallel cascade structure of the lower and better performances of encoder complexity.
The advantage of system form low-density code is the system form structure of its check matrix, helps very much to reduce encoder complexity, and shortcoming then is that error-correcting performance is relatively poor; Building method of the present invention is the system form low-density code of two system form low-density codes being got up to construct a kind of parallel cascade structure by the interleaver parallel cascade of particular design, because the parallel cascade operation can not influence the system form structure of the check matrix that is used for cascade fully, so the low-density code of the present invention's structure has simple structure suitable with the system form low-density code and low encoder complexity.Simultaneously because the interleaver in the parallel cascade structure is that coded sequence has been introduced more restriction relation, so the performance of the low-density code of the present invention's structure has a distinct increment than the performance of existing system form low-density code.
The system form low-density code of the parallel cascade structure that the inventive method constructs, have and the suitable low encoder complexity of existing General System form low-density code, and have excellent more error-correcting performance, therefore have bigger actual application value than existing General System form low-density code.
Description of drawings:
Fig. 1 is that size is the structural representation of 675 * 1800 system form matrix H.
Fig. 2 is the coder structure schematic diagram of the system form low-density code of parallel cascade structure.
Fig. 3 is the decoder architecture schematic diagram of the system form low-density code of parallel cascade structure.
Fig. 4 is the performance simulation comparison curves of system form low-density code that adopts the parallel cascade structure of relevant interleaver and uncorrelated interleaver respectively.
Fig. 5 is the performance simulation comparison curves of the system form low-density code and the system form low-density code of parallel cascade structure.
Embodiment:
Embodiment 1:
One, the structure size is 675 * 1800 the system form matrix H check matrix as low-density code:
Construct a size and be 675 * 1800 system form matrix H, this matrix left side is that a size is 675 * 1125 initial matrix H 1, the right is that a size is 675 * 675 unit matrix I; With the check matrix of system form matrix H, can construct a group system form low-density code as low-density code.It is 675 * 1800 system form matrix H that matrix shown in Figure 1 is the size of constructing in the present embodiment; Oblique line among the figure is actually by a series of continuous points and is constituted, and the element in these some expression system form matrix H on the correspondence position is 1, and is blank then represent that the element on the correspondence position is 0; The virgule of left-half is represented initial matrix H among the figure 1In element 1 because the random distribution of element 1 has caused the difference in length between the different virgules, the element 1 among the long oblique line representation unit matrix I of right half part on the diagonal.
The size of system form matrix can design according to the actual requirements, need only guarantee that its system form gets final product.Set its size in the present embodiment and be 675 * 1800 examples of choosing arbitrarily just.If the size of the system form matrix that constructs is m * n, m<n wherein, then the code length of the system form low-density code of the parallel cascade structure that constructs of the inventive method is n+m, code rate is (n-m)/(n+m).
Two, the interleaver of design correlation minimum
In order to introduce more restriction relation as far as possible, must be according to initial matrix H 1Column weight distribution design the interleaver of correlation minimum.
The interleaver operation is actual to be exactly initial matrix H 1Row exchanges, the switching matrix H that obtains by the row exchange 1' with initial matrix H 1Between the column weight correlation can utilize formula (1) to calculate, wherein the column weight correlation between these two matrixes of the more little explanation of W is more little, the correlation of corresponding interleaver is also more little, the interleaver that satisfies W=0 is uncorrelated interleaver.The correlation of interleaver is more little, and the correlation between the two-way verification sequence is just more little, and performance boost is also just obvious more.
For this problem is described vividerly, specially selected for use the relevant interleaver of a W=3375 and the uncorrelated interleaver of W=0 to compare in the present embodiment.Fig. 4 has provided the performance simulation comparison curves of the system form low-density code of the parallel cascade structure that adopts relevant interleaver and uncorrelated interleaver respectively: relevant interleaver performance curve b has represented to adopt the performance of system form low-density code of parallel cascade structure of the relevant interleaver of W=3375; Uncorrelated interleaver performance curve c has represented to adopt the performance of system form low-density code of parallel cascade structure of the uncorrelated interleaver of W=0.Can see that from the emulation comparative result low-density code of the relevant interleaver of low-density code ratio employing that adopts uncorrelated interleaver has the performance boost about 0.4dB.
Need to prove, for the initial matrix H of different structure characteristics 1, have very big-difference according to the interleaver of formula (1) design, for the initial matrix H that has 1Possibly can't design uncorrelated interleaver, then may design a plurality of different uncorrelated interleavers for what have, so the interleaver that only need choose the W minimum during actual design gets final product.At the initial matrix H that constructs in the present embodiment 1Can design a plurality of uncorrelated interleavers, just select one of them arbitrarily for use at this.
Three, the encoder of the system form low-density code of structure parallel cascade structure
Utilize the encoder parallel cascade of the interleaver of above-mentioned design, just obtain the encoder of system form low-density code of the parallel cascade structure of the inventive method structure two identical system form low-density codes.
Fig. 2 has provided the structural representation of this encoder.As shown in Figure 2, the job step of the encoder among the present invention is:
(1), by interleaving block A original coding sequence 1 is carried out obtaining interweaving encoding sequence 2 after the interleaving treatment;
(2), by the first coding module B original coding sequence 1 is carried out encoding process and obtains original checksums sequence 3, by the second coding module C interweaving encoding sequence 2 is carried out obtaining interweaving after the encoding process verification sequence 4;
(3), by the sequential combination of original coding sequence 1, original checksums sequence 3 and the verification sequence 4 that interweaves, be final coded sequence.
Four, the decoder of the system form low-density code of structure parallel cascade structure
Utilize the interleaver of above-mentioned design and corresponding deinterleaver that the decoder of two system form low-density codes is together in series, just obtain the decoder of system form low-density code of the parallel cascade structure of the inventive method structure.
Fig. 3 has provided the structural representation of this decoder, the P among the figure 1fThe channel posterior probability of expression original coding sequence 1; P 3fThe channel posterior probability of expression original checksums sequence 3; P 4fThe interweave channel posterior probability of verification sequence 4 of expression; P 1eAnd P 2eThe decoding input prior probability of representing original coding sequence 1 and interweaving encoding sequence 2 respectively; P 1And P 2The decoding output posterior probability of representing original coding sequence 1 and interweaving encoding sequence 2 respectively.As shown in Figure 3, the job step of the decoder among the present invention is:
(1), by the first decoder module D to P 1fAnd P 3fDecode;
(2), judge by the first judge module C whether the decoded result of the first decoder module D is correct, if correctly, then the decoding of original coding sequence 1 output posterior probability P 1Deliver to hard decision module H, and export final decoded result, carry out interleaving treatment otherwise deliver to interleaving block E by this module;
(3), by interweave the as a result P of the second decoder module F to interleaving block E 2eAnd P 4fDecode;
(4), check by the second judge module I whether the decoded result of the second decoder module F is correct, if correctly, then the decoding of interweaving encoding sequence 2 output posterior probability P 2Deliver to hard decision module H, and export final decoded result, carry out the deinterleaving processing otherwise deliver to de-interleaving block G by this module;
(5), by the first decoder module D to the deinterleaving of de-interleaving block G P as a result 1eAnd the decoding posterior probability of the original checksums sequence that first decoder module D decoding obtains in the step (1) is decoded;
(6), finish until decoding repeating step (2)-(5).
The first decoder module D and the second decoder module F in the present embodiment have all adopted and long-pending decoding algorithm, and its decode procedure is as follows:
The system of setting up departments adopts binary phase shift keying (BPSK) modulation system, and channel is additive white Gaussian noise channel (AWGN).If coded sequence to be sent is x=(x 1, x 2... x N), wherein N is the length of coded sequence, the data of receiver reception can be write so: y=(y 1, y 2... y N), wherein:
y i=s i+n i i=1,2,…N
s i=2x i-1 i=1,2,…N(1)
N wherein iBe that average is zero, variance is N 0/ 2 white Gaussian noise.
For convenience of explanation, define following notion earlier:
N (m): { n:H Mn'=1}, expression during check matrix H ' m is capable all values be 1 row, N (m) n then represent to remove among the N (m) other all row beyond the n row.
M (n): { m:H Mn'=1}, all values is 1 row in expression check matrix H ' n row.M (n) m then represent to remove among the M (n) m other all row beyond capable.
L Mn: expression passes to the probabilistic information of bit node n from check-node m.
q Mn: expression passes to the probabilistic information of check-node m from bit node n.
q n: representing the posterior probability information of n bit, also is the foundation of decoding hard decision output.
It should be noted that the probabilistic information that relates to here all be log-domain probability (Log-Likelihood Ratio, LLR), according to above definition, can be simply being summarized as follows with long-pending decoding algorithm:
Initialization, promptly calculate initial posterior probability according to received signal and channel information:
q mn = 4 y n N 0 - - - ( 2 )
Horizontal iteration is promptly according to q MnCalculate L Mn:
L mn = ( Π n ′ ∈ N ( m ) \ n α m n ′ ) × Q ( Π n ′ ∈ N ( m ) \ n Q ( β m n ′ ) )
α wherein Mn=sign (q Mn)
β mn=|q mn|
Q ( x ) = log e x + 1 e x - 1 (3)
Vertical iteration is promptly according to L MnCalculate q Mn:
q mn = 4 y n N 0 + Σ m ′ ∈ M ( n ) \ m L m ′ n - - - ( 4 )
Judgement output and end condition:
q n = 4 y n N 0 + Σ m ∈ M ( n ) L mn
x &prime; n = 1 , q n > 0 0 , q n < 0 (5)
Reach in limited time when satisfying H ' x '=0 or iterations, stop decode procedure and output decoder as a result x '=(x ' 1, x ' 2... x ' N), otherwise continue iterative process.
The detailed introduction of above algorithm can be referring to U.S.'s " international electronics and The Institution of Electrical Engineers's consumer electronics journal (information theory periodical) " (IEEE Transactions on Information Theory, vol.45, NO.2, p399-431, March, 1999).
The first decoder module D and the second decoder module F can also adopt minimum and decoding algorithm or Probability Decoding algorithm, they can adopt identical or different decoding algorithm respectively, described minimum can be referring to U.S.'s " international electronics and The Institution of Electrical Engineers's consumer electronics journal (periodical of communicating by letter) " (IEEETransactions on Communications with decoding algorithm and Probability Decoding algorithm, vol.47, NO.5, p673-680, May, 1999) with U.S.'s " international electronics and The Institution of Electrical Engineers's consumer electronics journal (periodical of communicating by letter) " (IEEE Transactions on Communications, vol.53, NO.8, p1288-1298, August, 2005).
Five, simulation performance
Utilize software to carry out performance simulation, under additive white Gaussian noise (AWGN) channel condition and under binary phase shift keying (BPSK) modulation system, the system form low-density code of the parallel cascade structure of comparison the inventive method structure and the performance of the pairing system form low-density code of system form matrix H.
Fig. 5 has provided the performance simulation comparison curves of the system form low-density code and the system form low-density code of parallel cascade structure: the performance that poor-performing curve d represents that code length is 1125, code check is 0.4 system form low-density code, better performances curve e represents the performance with the system form low-density code of the parallel cascade structure of the code length 2475 of the inventive method structure, code check 0.455.Simulation result from Fig. 5 can see that the system form low-density code performance of the parallel cascade structure of the inventive method structure is than the high approximately 1.5dB of performance of system form low-density code.
Six, computational complexity relatively
Because two system form matrixes in the parallel cascade structure are duplicate, therefore can't cause the increase of memory space.Though the coding operand of the system form low-density code of parallel cascade structure is the twice of original system form low-density code, but because the coding operand of system form low-density code itself is very low, so the common relatively low-density code of the coding operand of the system form low-density code of parallel cascade structure is still very low.Code length is 1125, the Modulo-two operation amount of the system form low-density code of code check 0.4 is 3375 times, and memory space needs 33750 bits; Code length is 2475, the Modulo-two operation amount of the system form low-density code of the parallel cascade structure of code check 0.455 is 6750 times, and memory space needs 33750 bits.
The interleaver of the inventive method utilization design gets up two system form low-density code parallel cascades, and for coded sequence has been introduced more verification relation, so performance has a distinct increment than system form low-density code; Simultaneously because the parallel cascade operation can not destroy the structure that is used for cascaded system form matrix, so the system form low-density code of the parallel cascade structure that constructs is simple in structure from having kept the system form low-density code to the full extent, the advantage that encoder complexity is low has and is beneficial to very much hard-wired simple structure.It is comparatively nervous and error-correcting performance is had certain requirements in the system that the system form low-density code of the parallel cascade structure that the present invention constructed is well suited for being applied in resource.

Claims (1)

1, a kind of building method of system form low-density code of parallel cascade structure, comprise: construct a system form low-density code and an interleaver, the size of the check matrix H of this system form low-density code is m * n, m<n wherein, the left side of check matrix H is that a size is the initial matrix H of m * (n-m) 1, the right is the unit matrix I that a size is m * m;
It is characterized in that:
Design the interleaver of the correlation minimum that makes between the two-way verification sequence in the following way: at first to initial matrix H 1Be listed as exchange, calculate through the switching matrix H after the row exchange by following formula then 1' with initial matrix H 1Between the column weight correlation:
C i = &Sigma; k = 1 m H 1 ( k , i ) &times; H 1 &prime; ( k , i ) , 1 &le; i &le; n - m
W = &Sigma; i C i , 1 &le; i &le; n - m (1)
Wherein, m and n represent the line number and the columns of check matrix H, C respectively iExpression switching matrix H 1' i row and initial matrix H 1I row between the column weight coefficient correlation, W represents switching matrix H 1' with initial matrix H 1The column weight coefficient correlation; At last under the situation with the W minimum pairing row exchange sequence as the interleaved order of interleaver;
Utilize this interleaver that the encoder parallel cascade of the system form low-density code of two structures is risen and be used as encoder, described two encoders that are used for parallel cascade are respectively first encoder and second encoder, and these two encoders are identical; The original coding sequence is carried out obtaining the interweaving encoding sequence after the interleaving treatment, utilize first encoder and second encoder simultaneously original coding sequence and interweaving encoding sequence to be encoded then respectively, obtain the original checksums sequence respectively and the verification sequence that interweaves; By the order of original coding sequence, original checksums sequence and the verification sequence that interweaves these three combined sequence are risen at last and be used as a complete coded frame;
Utilize this interleaver and corresponding deinterleaver that the decoder of two system form low-density codes is together in series as decoder again, described two decoders that are used to connect are respectively first decoder and second decoder, these two decoders adopt identical or different conventional low-density code decoding algorithm, comprise and long-pending decoding algorithm, minimum and decoding algorithm or Probability Decoding algorithm; Utilize first decoder that the confidence level of original coding sequence and the confidence level of original checksums sequence are decoded earlier, obtain the confidence level of interweaving encoding sequence after the confidence level of the original coding sequence that first decoder is exported is handled through interleaver then, utilize second decoder that the confidence level of interweaving encoding sequence and the confidence level of the verification sequence that interweaves are decoded again, the confidence level of the original coding sequence after obtaining upgrading after the confidence level of the interweaving encoding sequence that second decoder is exported is handled by deinterleaver again, between two decoders, carry out iteration by this flow process then, until satisfy till the decoding end condition, promptly construct the system form low-density code of parallel cascade structure.
CN2007100235948A 2007-06-08 2007-06-08 Method for constructing system low-density code with parallel cascade Expired - Fee Related CN101075812B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2007100235948A CN101075812B (en) 2007-06-08 2007-06-08 Method for constructing system low-density code with parallel cascade

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2007100235948A CN101075812B (en) 2007-06-08 2007-06-08 Method for constructing system low-density code with parallel cascade

Publications (2)

Publication Number Publication Date
CN101075812A true CN101075812A (en) 2007-11-21
CN101075812B CN101075812B (en) 2011-01-05

Family

ID=38976661

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2007100235948A Expired - Fee Related CN101075812B (en) 2007-06-08 2007-06-08 Method for constructing system low-density code with parallel cascade

Country Status (1)

Country Link
CN (1) CN101075812B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101938331A (en) * 2010-09-03 2011-01-05 北京全路通信信号研究设计院 Data communication method, device and system
CN102111241A (en) * 2011-03-04 2011-06-29 四川虹微技术有限公司 Method for stopping LDPC iterative decoding in advance
CN101345607B (en) * 2008-08-14 2012-07-25 西安电子科技大学 Encoding/decoding method of multidimensional crossing parallel cascade single-parity check code
CN105227193A (en) * 2015-09-29 2016-01-06 北京邮电大学 Based on the Turbo constructive code Mixed cascading coding and decoding method of LDPC
CN112968708A (en) * 2013-06-14 2021-06-15 三星电子株式会社 Transmitting apparatus and receiving apparatus

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2295791C (en) * 1997-07-30 2006-06-13 Samsung Electronics Co., Ltd. Adaptive channel encoding method and device
CN1509093A (en) * 1998-08-06 2004-06-30 ���ǵ�����ʽ���� Channel coding/decoding in communication system
KR100918763B1 (en) * 2003-11-14 2009-09-24 삼성전자주식회사 Interleaving apparatus and method in a channel coder using a parallel concatenated low density parity check code
CN1780152A (en) * 2004-11-17 2006-05-31 松下电器产业株式会社 Interative encode method and system

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101345607B (en) * 2008-08-14 2012-07-25 西安电子科技大学 Encoding/decoding method of multidimensional crossing parallel cascade single-parity check code
CN101938331A (en) * 2010-09-03 2011-01-05 北京全路通信信号研究设计院 Data communication method, device and system
CN101938331B (en) * 2010-09-03 2013-06-26 北京全路通信信号研究设计院有限公司 Data communication method, device and system
CN102111241A (en) * 2011-03-04 2011-06-29 四川虹微技术有限公司 Method for stopping LDPC iterative decoding in advance
CN102111241B (en) * 2011-03-04 2013-07-03 四川虹微技术有限公司 Method for stopping LDPC iterative decoding in advance
CN112968708A (en) * 2013-06-14 2021-06-15 三星电子株式会社 Transmitting apparatus and receiving apparatus
CN112968708B (en) * 2013-06-14 2023-08-22 三星电子株式会社 Transmitting apparatus and receiving apparatus
US11824558B2 (en) 2013-06-14 2023-11-21 Samsung Electronics Co., Ltd. Method and apparatus for encoding and decoding of low density parity check codes
CN105227193A (en) * 2015-09-29 2016-01-06 北京邮电大学 Based on the Turbo constructive code Mixed cascading coding and decoding method of LDPC
CN105227193B (en) * 2015-09-29 2018-09-28 北京邮电大学 Turbo constructive code Mixed cascading coding and decoding methods based on LDPC

Also Published As

Publication number Publication date
CN101075812B (en) 2011-01-05

Similar Documents

Publication Publication Date Title
CN102164026B (en) Fountain code compiling method based on deep space communication environment
CN101075811A (en) Quasi-circulation low-density code with tridiagonal structure and its construction
JP2008501287A (en) Apparatus and method for encoding / decoding block low density parity check code
US8145986B2 (en) Multi-CSI (Cyclic Shifted Identity) sub-matrix based LDPC (Low Density Parity Check) codes
CN102394660A (en) Coding method of block interleaving quasi-cyclic extension parallel coded LDPC (Low Density Parity Check) codes and coder
CN1855730A (en) Method for encoding/decoding concatenated ldgm code
CN101132252A (en) Quantified minimizing and coding method for low-density parity code
CN104158550A (en) A method for constructing a code-rate-compatible protograph LDPC code based on deep space communication environment
CN101075812A (en) Method for constructing system low-density code with parallel cascade
CN101345607B (en) Encoding/decoding method of multidimensional crossing parallel cascade single-parity check code
CN100546207C (en) A kind of dual-binary Turbo code encoding method based on the DVB-RCS standard
CN101594152B (en) LDPC code decoding method for realizing simultaneous operation of horizontal operation and vertical operation
CN104883194A (en) H matrix construction method of RS-LDPC two-dimensional product code and slide truncation decoding method thereof
CN1753315A (en) Coding method of low density oven odd check code
CN102725964B (en) Encoding method, decoding method, encoding device, and decoding device
CN114285417A (en) Encoding method of global coupling low-density parity check code
CN1822510A (en) High speed storage demand reducing low density correction code decoder
CN103401655B (en) A kind of method of carrying out decoding with LDPC Decoding Message storage organization
CN102611462B (en) LDPC-CC (Low-Density Parity-Check Convolution Codes) decoding algorithm and decoder
CN1805291A (en) Parallel low intensity parity code encoding method and encoding apparatus
CN108880748B (en) Coding and decoding method of rateless Spinal code based on Latin square matrix
CN103338044B (en) Protograph code for deep space optical communication system
CN106603084B (en) It is a kind of for punching the preprocess method of LDPC Hard decision decoding
CN101789795B (en) Encoding method based on multi-rate protograph low density parity check code and encoder
CN101635574B (en) Method for increasing convergence rate of decoder for hierarchical irregular low-density check code

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

Termination date: 20150608

EXPY Termination of patent right or utility model