CN103036577B - A kind of low-density checksum LDPC code coding circuit structure of low complex degree - Google Patents

A kind of low-density checksum LDPC code coding circuit structure of low complex degree Download PDF

Info

Publication number
CN103036577B
CN103036577B CN201210584037.4A CN201210584037A CN103036577B CN 103036577 B CN103036577 B CN 103036577B CN 201210584037 A CN201210584037 A CN 201210584037A CN 103036577 B CN103036577 B CN 103036577B
Authority
CN
China
Prior art keywords
input
group
check
information sequence
check matrix
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.)
Expired - Fee Related
Application number
CN201210584037.4A
Other languages
Chinese (zh)
Other versions
CN103036577A (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.)
Southeast University Wuxi branch
Original Assignee
Southeast University
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 Southeast University filed Critical Southeast University
Priority to CN201210584037.4A priority Critical patent/CN103036577B/en
Publication of CN103036577A publication Critical patent/CN103036577A/en
Application granted granted Critical
Publication of CN103036577B publication Critical patent/CN103036577B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Error Detection And Correction (AREA)

Abstract

A low-density checksum LDPC code coding circuit structure for low complex degree, the coding circuit structure of this LDPC code comprises multiplying operational circuit, adder operation circuit, and control circuit.This coding circuit is undertaken by row operation by the original uncoded information sequence of input and the check matrix of LDPC code, finally asks for verification sequence to realize.This coding circuit structure is greater than 0.5 for code check, there is the quasi-cyclic LDPC code of near lower triangular form, adopt the mode according to the row operation of advancing of LDPC check matrix, reduce hardware resource, and adopt the compute mode of part parallel, ensure the data throughout of coding circuit, realize the low encoding complexity of the quasi-cyclic LDPC code had close to lower triangular form.

Description

A kind of low-density checksum LDPC code coding circuit structure of low complex degree
Technical field
The invention belongs to digital signal and system regions, relate to the realization of the LDPC code error correcting code circuitry in transfer of data error correcting technique.Being specifically related to the realization of the coding circuit of the LDPC code for the quasi-cyclic with near lower triangular form, is a kind of coding circuit structure of LDPC code of low complex degree.
Background technology
The object of communication is that ignorant for the other side message is sent to the other side in time reliably, improves reliability and the validity of information transmission, is the target that communication work is pursued all the time.Chnnel coding is transmission reliability in order to ensure communication system, overcome Noise and Interference in channel and the jamproof techniques and methods of a custom-designed class.The verification code element adding some necessity that it is artificial in information code element to be sent according to certain rule, at receiving terminal, utilizes the law discovery of these inspection code elements and information code element and corrects mistake, to improve the reliability of information code element transmission.Code element information to be sent is information code element, and artificial adds unnecessary code element for verification code element.The object of chnnel coding attempts to exchange for minimum verification code element the raising of maximum reliability.
In a communications system, error correction coding is used to the reliability and the power utilization that improve transmission, and LDPC (Low-density Parity-check, low-density checksum) code is a kind of error correction coding of better performances.LDPC code is proposed by Gallager at first, but do not cause enough attention, until after Turbo code proposition, people are when studying the iterative decoding of Turbo code, both discoveries have identical characteristic, namely retrain the characteristic of random code set and iterative decoding, start the research climax of LDPC code subsequently.
LDPC code is approached the performance of shannon limit with it and can be realized the feature of iterative decoding by complete parallel, performance is better than other channel coding/decodings in many situations, become the focus of channel error correction encoding research in wireless sense network just gradually, many Systematic selection have been had to use LDPC code, as satellite digital video broadcast standard DVB-S2 and next generation mobile communication system at present.
Be different from other linear block codess, LDPC code is represented by its H matrix.The characteristic of H matrix directly has influence on the encoder complexity of LDPC code.The subject matter that LDPC code faces is its higher encoder complexity and encoding time delay.If adopt common coded system, LDPC code encoder has the encoder complexity becoming quadratic power with code length, and when code length is longer, this is difficult to accept.Therefore, when practical application, main consideration has the LDPC code of the check matrix of ad hoc structure.
LDPC code is a kind of linear error correction code with sparse check matrix.The element of its check matrix except sub-fraction be except 1, other overwhelming majority are zero.Be different from other linear block codess, LDPC code is represented by its check matrix H, and general coded system is also that generator matrix G is converted to check matrix H to complete coding.The common encryption algorithm of LDPC code has: G matrix implementation method, RU decomposition algorithm, LU predecomposition algorithm etc.Wherein RU decomposition algorithm is the most frequently used encryption algorithm of structurized LDPC code.
Summary of the invention
The problem to be solved in the present invention is: be greater than at code check in the LDPC code coding circuit of 0.5 and adopt the coded system of part parallel by row to have great advantage, and current LDPC code coding circuit adopts full parellel or the compute mode of pressing row part parallel, code check being greater than to the LDPC code of 0.5, needing more barrel shifter and accumulator element by row coding compared to encoding by row.
Technical scheme of the present invention is: a kind of low-density checksum LDPC code coding circuit structure of low complex degree, is characterized in that:
Applying the input information from information source that this circuit structure carries out encoding is: the information sequence s of input and verification sequence p is divided into k by z position b=n b-m bindividual group, then therefore whole code word can be expressed as: c = s p = [ s 0 , s 1 , . . . . , s k b - 1 , p 0 , p 1 , . . . . , p m b - 1 ]
If check matrix H is expressed as: H=[H 1h 2], H 1corresponding to information sequence part, H 2corresponding to check code word part, h i, jfor the matrix in block form in check matrix H, a point block size is z;
According to Hc t=0 and H 1and H 2feature obtain
Definition i=0,1 ..., m b-1, equation above can be expressed as,
According to p 0try to achieve: p 10+ ∏ 1p 0
p m b - 1 = λ m b - 1 + Π 1 p 0
p x+1=λ x+p 0+p x
p i+1i+p ii≠0,x,m b-1
Wherein x is corresponding verification sequence part H in check matrix H 2in first be classified as the element place of 0 row value;
Wherein parameter declaration is as follows:
Z is point class value of low density parity check code;
K bfor inputting the group number that information sequence to be encoded carries out according to z position dividing into groups;
N bfor the sequence after encoded carries out the group number that divides into groups according to z position;
M bfor check code word carries out the group number that divides into groups according to z position;
S is information sequence, obtains by after the grouping of z position:
P is check code word, obtains by after the grouping of z position:
P ifor i-th grouping of pressing after the grouping of z position of check code word p;
C be encoded after whole codeword sequence;
H is check matrix, H 1corresponding to information sequence part, H 2corresponding to check code word part;
X is corresponding verification sequence part H in check matrix H 2in first matrix in block form be the line number at the row place of " 0 ".
According to the computational methods of check code word above, the information sequence of input is according to the grouping input of z position;
This circuit structure comprises check matrix memory 801, barrel shifter group 802, accumulator group 803, first-in first-out buffer memory 804, first data selector 805, check code word computing module 806, second data selector 807, address counter 808, control circuit 809 and input control module 810;
Described barrel shifter group 802 comprises m bindividual identical barrel shifter group; Accumulator group 803 comprises m bindividual identical accumulator; m bvalue identical with the line number of the check matrix of LDPC code; The corresponding accumulator of each barrel shifter group;
The information sequence of input is according to the grouping input of z position, and each group information sequence of input is through the check matrix by row corresponding multiplying of barrel shifter group 802 with the LDPC code be stored in check matrix memory 801; This multiplying is completed by barrel shifter, and the operation result of barrel shifter is h i, js j;
The operation that input control circuit 810 controls is: often input one group of information sequence, complete multiplication operation, and the address of check matrix memory 801 adds 1 simultaneously, provides the value of check matrix next column;
Each organizes the result of information sequence through multiplying through accumulator group 803, adds up by corresponding row;
After the input of all information sequences, the grouping by row namely completing the information sequence position corresponding to check matrix of input is multiplied and accumulating operation, and result cumulative is by row λ i;
Control circuit 809, first data selector 805 and check code word computing module 806 pass through to add up, be shifted and register circuit, the result λ cumulative to piecemeal iagain selectively carry out rear adding up of adding up or be shifted, section technique goes out check code word p thus; Namely the process of whole coding is completed;
Finally, the information sequence of input, through first-in first-out buffer memory 804, is exported continuously by the second data selector 807 with check code word, obtains the code word with fault-tolerant ability.
Accompanying drawing explanation
Fig. 1 is LDPC code position in a communications system;
Fig. 2 is a kind of check matrix with the LDPC code of the near lower triangular form of quasi-cyclic;
Fig. 3 is the coding circuit structure of the LDPC code of low complex degree;
Fig. 4 is the implementation of the matrix multiplication operation of LDPC code.
Embodiment
In order to understand the present invention better, make a more detailed description below in conjunction with embodiment and place system.
Technical scheme of the present invention is a kind of error correcting code circuitry structure being applied to the low density parity check code of communication system, this circuit structure is according to LDPC check matrix, carry out a point row operation, then ask for the check code word of input message sequence, realize the low encoding complexity with the quasi-cyclic LDPC code of near lower triangular form; Specific as follows:
This coding circuit structure is the quasi-cyclic LDPC code of near lower triangular form for check matrix; The check matrix H with the LDPC code of this characteristic generally adopts the form of piecemeal to represent, each matrix-block wherein after piecemeal, and the overwhelming majority is null matrix, and other matrix is the result after the unit matrix cyclic shift of z position, and z is the size of the partitioning of matrix;
In the process of coding, the information sequence of input is also according to the grouping input of z position, and each group information sequence of input carries out corresponding multiplying by row through barrel shifter group with the check matrix of LDPC code, and this multiplying is completed by each barrel shifter.In barrel shifter group, the quantity of barrel shifter is identical with the line number of the check matrix of LDPC code.
Input control circuit controls often to input one group of information sequence, completes multiplication operation, and the address of check matrix memory adds 1 simultaneously, provides the value of check matrix next column.Each group information sequence, through the result of multiplying, through accumulator group, adds up by the row of correspondence, and after the input of all information sequences, the grouping by row namely completing the information sequence position corresponding to check matrix of input is multiplied and accumulating operation.
Control circuit control the 1st data selector, and check code word calculating module, by circuit such as cumulative, displacement and registers, the result cumulative to piecemeal above carries out rear adding up of adding up or be shifted again selectively, and section technique goes out check code word thus.Finally, the information sequence of input, through first-in first-out buffer memory, is exported by the 2nd data selector continuously with the check code word calculated, and finally obtains the code word that information sequence has fault-tolerant ability after the check matrix coding of this LDPC code.
Fig. 1 is telecommunication system transceiver structure chart, after LDPC is coded in the information source of transmitter, before modulation, for improving the reliability of transfer of data, receiver section corresponding have LDPC decoding circuit.
Fig. 2 (a) and (b) are a kind of check matrix with the LDPC code of the near lower triangular form of quasi-cyclic, giving a kind of code check in Fig. 2 (a) is 2/3, code length is the check matrix H of the LDPC code of 576, this check matrix adopts the form of the partitioning of matrix to represent, the result that in Fig. 2 (a) figure, the unit matrix of each data representation length z=24 of form is undertaken after ring shift right by the numerical value in form, such as, in Fig. 2 (a), the data of the first row first row carry out the result after ring shift right, are the matrix shown in Fig. 2 (b).Can see from Fig. 2 (a), the most elements in form are zero, also illustrate that the openness of the check matrix of LDPC code.
Fig. 3 is the coding circuit structure with the LDPC code of low complex degree provided, in the process of coding, the information sequence of input is also according to the grouping input of z position, each group information sequence of input carries out corresponding multiplying by row through barrel shifter group 802 with the check matrix 801 of LDPC code, and this multiplying is completed by barrel shifter.In barrel shifter group 802, the quantity of barrel shifter is identical with the line number of the check matrix of LDPC code.
Input control circuit 810, control often to input one group of information sequence, complete multiplication operation, the address of check matrix memory adds 1 simultaneously, provides the value of check matrix next column.Each group information sequence, through the result of multiplying, through 803 accumulator groups, adds up by the row of correspondence, and after the input of all information sequences, the grouping by row namely completing the information sequence position corresponding to check matrix of input is multiplied and accumulating operation.
Control circuit 809, the first data selector 805, and check code word computing module 806, by cumulative, the circuit such as displacement and register, the result cumulative to piecemeal above selectively carries out rear adding up of adding up or be shifted again, and section technique goes out check code word thus.Finally, the information sequence of input, through first-in first-out buffer memory, is exported by the second data selector 807 continuously with the check code word calculated, and finally obtains the code word that information sequence has fault-tolerant ability after the check matrix coding of this LDPC code.
Fig. 4 is the barrel shifter carrying out matrix multiplication operation, and above-mentioned matrix multiplication operation can adopt the barrel shift structure provided in figure to realize.The figure place of the barrel shifter provided in figure is z=8, input data a0-a7, and barrel shifter controls the situation of displacement by input data s0-s2, and the mux finally obtained in the data d0 that is shifted-d7, figure is the data selector of alternative.

Claims (1)

1. a low-density checksum LDPC code coding circuit structure for low complex degree, is characterized in that:
Apply this circuit structure, the information sequence s of input and verification sequence p is divided into k by z position b=n b-m bindividual group, then s = [ s 0 , s 1 , . . . . s k b - 1 ] , p = [ p 0 , p 1 , . . . . , p k b - 1 ] , Therefore whole code word can be expressed as:
c = s p = [ s 0 , s 1 , . . . . , s k b - 1 , p 0 , p 1 , . . . . , p m b - 1 ] ;
If check matrix H is expressed as: H=[H 1h 2], H 1corresponding to information sequence part, H 2corresponding to check code word part, h i,jfor the matrix in block form in check matrix H, i=0,1 ..., m b-1, j=0,1 ..., k b-1, a point block size is that z, i represent line number, and j represents row number, according to Hc t=0 and H 1and H 2feature obtain
Definition i=0,1 ..., m b-1, equation above can be expressed as,
According to p 0try to achieve: p 10+ ∏ 1p 0
p m b - 1 = λ m b - 1 + Π 1 p 0
p x+1=λ x+p 0+p x
p i+1=λ i+p ii≠0,x,m b-1
Wherein parameter declaration is as follows:
Z is point class value of low density parity check code;
K bfor inputting the group number that information sequence to be encoded carries out according to z position dividing into groups;
N bfor the sequence after encoded carries out the group number that divides into groups according to z position;
M bfor check code word carries out the group number that divides into groups according to z position;
S is information sequence, obtains by after the grouping of z position:
P is check code word, obtains by after the grouping of z position:
P ifor i-th grouping of pressing after the grouping of z position of check code word p;
C be encoded after whole codeword sequence;
H is check matrix, H 1corresponding to information sequence part, H 2corresponding to check code word part;
X is corresponding verification sequence part H in check matrix H 2in first matrix in block form be the line number at the row place of " 0 ";
According to the computational methods of check code word above, the information sequence of input is according to the grouping input of z position;
This circuit structure comprises check matrix memory 801, barrel shifter group 802, accumulator group 803, first-in first-out buffer memory 804, first data selector 805, check code word computing module 806, second data selector 807, address counter 808, control circuit 809 and input control module 810;
Described barrel shifter group 802 comprises m bindividual identical barrel shifter group; Accumulator group 803 comprises m bindividual identical accumulator; m bvalue identical with the line number of the check matrix of LDPC code; The corresponding accumulator of each barrel shifter group;
The information sequence of input is according to the grouping input of z position, and each group information sequence of input is through the check matrix by row corresponding multiplying of barrel shifter group 802 with the LDPC code be stored in check matrix memory 801; This multiplying is completed by barrel shifter, and the operation result of barrel shifter is h i,js j;
The operation that input control module 810 controls is: often input one group of information sequence, complete multiplication operation, and the address of check matrix memory 801 adds 1 simultaneously, provides the value of check matrix next column;
Each organizes the result of information sequence through multiplying through accumulator group 803, adds up by corresponding row;
After the input of all information sequences, the grouping by row namely completing the information sequence position corresponding to check matrix of input is multiplied and accumulating operation, and result cumulative is by row λ i;
Control circuit 809, first data selector 805 and check code word computing module 806 pass through to add up, be shifted and register circuit, the result λ cumulative to piecemeal iagain carry out rear adding up of adding up or be shifted, section technique goes out check code word;
Finally, the information sequence of input, through first-in first-out buffer memory 804, is exported continuously by the second data selector 807 with check code word, obtains the code word with fault-tolerant ability.
CN201210584037.4A 2012-12-28 2012-12-28 A kind of low-density checksum LDPC code coding circuit structure of low complex degree Expired - Fee Related CN103036577B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210584037.4A CN103036577B (en) 2012-12-28 2012-12-28 A kind of low-density checksum LDPC code coding circuit structure of low complex degree

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210584037.4A CN103036577B (en) 2012-12-28 2012-12-28 A kind of low-density checksum LDPC code coding circuit structure of low complex degree

Publications (2)

Publication Number Publication Date
CN103036577A CN103036577A (en) 2013-04-10
CN103036577B true CN103036577B (en) 2015-09-30

Family

ID=48023114

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210584037.4A Expired - Fee Related CN103036577B (en) 2012-12-28 2012-12-28 A kind of low-density checksum LDPC code coding circuit structure of low complex degree

Country Status (1)

Country Link
CN (1) CN103036577B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109217878B (en) * 2017-06-30 2021-09-14 重庆软维科技有限公司 Data processing device and method
TWI677878B (en) * 2018-10-12 2019-11-21 慧榮科技股份有限公司 Encoder and associated encoding method and flash memory controller
CN112039535B (en) * 2020-08-17 2023-11-10 西安空间无线电技术研究所 Code rate compatible LDPC encoder based on quasi-cyclic generation matrix

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102055484A (en) * 2010-12-21 2011-05-11 东南大学 LDPC (low density parity code) layering BP (belief propagation) decoding algorithm based on least-mean-square-error criterion and decoder structure
CN102122963A (en) * 2011-04-08 2011-07-13 中国传媒大学 Encoder and encoding method for Quasic-low-density parity-check (QC-LDPC) codes in digital television terrestrial multimedia broadcasting (DTMB) system
CN102340318A (en) * 2011-10-08 2012-02-01 中国科学院上海微系统与信息技术研究所 Method for encoding quasi-cycle LDPC (Low Density Parity Check) codes
CN102394660A (en) * 2011-08-24 2012-03-28 中兴通讯股份有限公司 Coding method of block interleaving quasi-cyclic extension parallel coded LDPC (Low Density Parity Check) codes and coder

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102055484A (en) * 2010-12-21 2011-05-11 东南大学 LDPC (low density parity code) layering BP (belief propagation) decoding algorithm based on least-mean-square-error criterion and decoder structure
CN102122963A (en) * 2011-04-08 2011-07-13 中国传媒大学 Encoder and encoding method for Quasic-low-density parity-check (QC-LDPC) codes in digital television terrestrial multimedia broadcasting (DTMB) system
CN102394660A (en) * 2011-08-24 2012-03-28 中兴通讯股份有限公司 Coding method of block interleaving quasi-cyclic extension parallel coded LDPC (Low Density Parity Check) codes and coder
CN102340318A (en) * 2011-10-08 2012-02-01 中国科学院上海微系统与信息技术研究所 Method for encoding quasi-cycle LDPC (Low Density Parity Check) codes

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
A Serial Concatenated Scheme for LDPC Code to Achieve Better Error Correction Performance;Zhe Wang et al;《2012 2nd International Conference on Consumer Electronics, Communications and Networks》;20120423;全文 *

Also Published As

Publication number Publication date
CN103036577A (en) 2013-04-10

Similar Documents

Publication Publication Date Title
CN101924565B (en) LDPC encoders, decoders, systems and methods
CN101032082B (en) Method and apparatus for encoding and decoding data
CN100592639C (en) Low density parity check coding method, device and parity check matrix generating method
CN101141133B (en) Method of encoding structured low density check code
CN105656604A (en) Bit interleaved polar code modulation method and apparatus
CN111030783B (en) Data transmission method and system for bit interleaving combined source-channel coding modulation
CN102377437B (en) Method and device for coding quasi-cyclic low density parity check codes
CN101902228A (en) Rapid cyclic redundancy check encoding method and device
CN101777926A (en) General decoder of Turbo product code and method thereof
CN100546207C (en) A kind of dual-binary Turbo code encoding method based on the DVB-RCS standard
CN103036577B (en) A kind of low-density checksum LDPC code coding circuit structure of low complex degree
CN101588183A (en) A kind of LDPC sign indicating number fast encoding method and system
CN103023603B (en) Method for realizing bit-interleaved coded modulation based on low-density parity-check (LDPC) matrix
CN103220005A (en) Method for generating LDPC (Low Density Parity Check) code check matrix and LDPC code coding method
CN102820892A (en) Circuit for parallel BCH (broadcast channel) coding, encoder and method
CN107026654B (en) A kind of fast frequency-domain coding method of quasi- circulation q-ary low-density parity-check
CN101567696B (en) Encoder and decoder of Code BCH with changeable parameters
CN1973440A (en) LDPC encoders, decoders, systems and methods
CN101640543B (en) Device and method for encoding LDPC code
CN102412844A (en) Decoding method and decoding device of IRA (irregular repeat-accumulate) series LDPC (low density parity check) codes
CN101350626B (en) Apparatus for encoding Turbo code and method thereof
CN112889221B (en) Offset value determination in a check node processing unit for message passing decoding of non-binary codes
CN105556852A (en) Encoding of low-density parity check for different low-density parity check (LDPC) codes sharing common hardware resources
CN116707707A (en) Combined polarization detection decoding method and related equipment
CN100446427C (en) Method for constructing LDPC code in mobile digital multimedia broadcast system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20170111

Address after: 99 No. 214135 Jiangsu province Wuxi city Wuxi District Linghu Avenue

Patentee after: Southeast University Wuxi branch

Address before: 99 No. 214135 Jiangsu New District of Wuxi City Linghu Avenue

Patentee before: Dongnan Univ.

CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150930

Termination date: 20191228

CF01 Termination of patent right due to non-payment of annual fee