CN102315911B - A kind of low density parity check code encoding method and device - Google Patents

Abstract

The invention discloses a kind of low density parity check coding method and device, including：According to data available bit length N '_pfThe code block number N of the information sequence segmentation to needing to encode is determined with the information bit length under encoder bit rate R_CW；According to the code block number N_CWThe information sequence for needing to encode is split；Bit padding is carried out to the code block that segmentation is obtained；Code block after bit padding is encoded, the code block after coding is attached in order.The present invention considers resource situation when the information sequence to needing to encode determines that the code block of segmentation is digital, makes the message length of code block more reasonable, and the matching treatment in encoded later stage, makes filling or deleted bit evenly, improves systematic function.

Description

Low-density parity check code coding method and device

Technical Field

The present invention relates to the field of encoding and decoding technologies, and in particular, to a method and an apparatus for encoding a low density parity check code.

Background

At present, digital communication systems are commonly used communication systems. Fig. 1 is a block diagram of a conventional digital communication system, as shown in fig. 1, the digital communication system is composed of a transmitting end, a channel and a receiving end, wherein the transmitting end generally includes a source, a source encoder, a channel encoder and a modulator, the receiving end generally includes a demodulator, a channel decoder, a source decoder and a signal sink, a channel (or a storage medium) exists between the transmitting end and the receiving end, and a noise source exists in the channel.

In a digital communication system, a channel coding link comprises code block segmentation, coding and decoding, rate matching and the like, which are the most critical technologies of the whole digital communication physical layer and determine the effectiveness and reliability of the bottom transmission of the digital communication system.

The Low-Density Parity-Check Codes (LDPC) have excellent performance, can obtain the error resistance performance close to the Shannon limit under certain conditions, has lower error code level compared with Turbo Codes, and has high practicability under the condition of high speed due to the characteristic of parallelism.

Because the code length of LDPC can only be set at some specific values, and bits actually required to be encoded are often longer, see fig. 2, in a channel coding link, uncoded bits need to be divided into code blocks and processed to some extent, so that each code block can meet the requirement of the length of encoded information, and after encoding, certain processing needs to be performed to match the resource bearing.

In the prior art, when code blocks are segmented, generally, only the code blocks are uniformly divided as much as possible without considering the resource condition, and only the matching resources are subjected to certain processing after the coding, so that the filling or deleting bits are concentrated when the resources are matched at the later stage, and the number of the filled or deleted bits is large, thereby affecting the coding performance.

Disclosure of Invention

The invention provides a low-density parity check code coding method and device, which can avoid centralized filling or deleting of bits when resources are matched and improve coding performance.

To solve the above technical problem, a low density parity check coding method of the present invention includes:

according to available data bit length N'_pfAnd determining the code for dividing the information sequence to be coded according to the information bit length at the coding code rate RNumber of blocks N_CW；

According to the code block number N_CWDividing the information sequence to be coded;

bit filling is carried out on the segmented code blocks;

and coding the code blocks after the bit filling, and connecting the coded code blocks in sequence.

Further, the length N 'according to available data bits'_pfAnd the information bit length under the coding code rate R determines the code block number N for dividing the information sequence to be coded_CWThe method comprises the following steps:

taking the information bit length under the coding code rate R as the maximum information bit length N under the coding code rate R_{meslen_max}；

Get theWherein,indicating an upward integer.

Further, according to the code block number N_CWThe information sequence to be coded is segmented, and the segmentation comprises the following steps:

determining an average basic information bit length N_meslen，Wherein,represents a downward integer;

determining rem, rem being N_pf-N_CW*N_meslenWherein N is_pfThe length of the information sequence to be coded;

will requireSplitting of a coded information sequence into N_CWTaking the length of rem code blocks as N_meslen+1, taking the rest N_CWLength of rem code blocks is N_meslen。

Further, the bit-filling the segmented code block includes:

determining information bit length N of code block_{meslen_cl}；

Determining the number of filling bits of the segmented code block, wherein the number of the filling bits is the length N of the information bits_{meslen_cl}Difference values with respective lengths of the segmented code blocks;

and respectively carrying out bit filling on the code blocks according to the determined filling bit number of each code block.

Further, the information bit length N of the code block is determined_{meslen_cl}The method comprises the following steps:

searching for preparation information length N 'larger than code block under the coding code rate R from corresponding information of spreading factor-code rate-code length-information bit length'_meslenIs used as the information bit length N of the code block_{meslen_cl}Wherein the preparation information length of the code block

Further, still include:

determining the information bit length N of the code block_{meslen_cl}Then, inquiring the information bit length N_{meslen_cl}Corresponding spreading factor zf and code length L_LDPC。

Further, the encoding the bit-padded code block includes:

according to the information bit length N_{meslen_cl}Corresponding spreading factor zf and code length L_LDPCDetermining a coding matrix, using the determined codingAnd the matrix carries out low-density parity check coding on the code blocks after the bit filling.

Further, the method further includes, after encoding the bit-padded code blocks, performing puncturing or repetition processing on the encoded code blocks before connecting the encoded code blocks in sequence, including:

calculating the total length N of quasi-transmitted bits_bitrpt＝N_CW*L_LDPC-N_paddingWhereinN_padding，ithe number of padding bits for the ith code block obtained by segmentation is set;

calculating the length N of the code bit which can be carried by each frame_bitpf；

Calculating the total length N of quasi-transmitted bits_bitrptThe length N of code bit which can be carried by each frame_bitpfDifference N ═ N_bitrpt-N_bitpf；

When N is more than 0, taking the total bit number N of the punch_puncN according to N_puncDetermining the number of bits deleted from each coded code block, and executing bit deletion operation;

when N is less than 0, taking the total number of repeated bits N_repAccording to N |, by_repThe number of bits to be padded for each coded code block is determined, and the padding operation is performed.

Further, said is according to N_puncDetermining the number of bits to delete for each coded code block, and performing bit deletion operation includes: determining the number of parity bits for an average erasureDetermining rem_p＝N_punc-N_puncpcw*N_CWFor rem in the coded code block_pLast N of code block erasure check bits_puncpcw+1 bits, puncturing the rest of the code blocksLast N except the check bits_puncpcwA bit;

said according to N_repDetermining the number of bits to be padded into each coded code block, and performing padding operation comprises: determining the number of parity bits for an average repetitionDetermining rem_r＝N_rep-N_reppcw*N_CWRem in coded code blocks_rEnd of code block repetition padding N_reppcw+1 bits, with N being repeatedly padded at the end of the code block for the remaining code blocks_reppcwAnd (4) a bit.

Further, in the corresponding information of the spreading factor, the code rate, the code length and the information bit length, the minimum information bit length is N under different code rates_inflAnd N is_inflThe corresponding spreading factor and code length are zf_minAnd L_LDPC,min(ii) a Greater than N_inflEach level of information bit length of 2nN_inflAnd 2nN_inflThe corresponding spreading factor and code length are 2nzf respectively_minAnd 2nL_LDPC,minWherein n is a natural number.

Further, when the code rate is 1/2, the minimum information bit length N_infl128, corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 256, respectively;

at code rate of 2/3, minimum information bit length N_infl256, corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 384, respectively;

at code rate of 3/4, minimum information bit length N_inflAt 384, the corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 512, respectively;

at code rate of 5/6, minimum information bit length N_inflAt 640, the corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 768, respectively;

at code rate of 7/8, minimum information bit length N_infl896, the corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 1024 respectively.

Further, a low density parity check encoding apparatus includes: code block number determination unit, code block segmentation unit, code block padding unit, coding unit and code block connection unit, wherein:

the code block number determination unit is used for determining the code block number according to the available data bit length N'_pfAnd the information bit length under the coding code rate R determines the code block number N for dividing the information sequence to be coded_CW；

The code block segmentation unit is used for dividing the code block into N code blocks according to the number of the code blocks_CWDividing the information sequence to be coded;

the code block filling unit is used for carrying out bit filling on the segmented code blocks;

the encoding unit is used for encoding the code block after the bit filling;

and the code block connecting unit is used for connecting the coded code blocks in sequence.

Further, the code block number determining unit is specifically configured to take the information bit length at the coding rate R as the maximum information bit length N at the coding rate R_{meslen_max}Get theWherein,indicating an upward integer.

Further, the code block segmentation unit is specifically configured to determine an average basic information bit length N_meslen，Wherein,represents a downward integer; determining rem, rem being N_pf-N_CW*N_meslenWherein N is_pfThe length of the information sequence to be coded; dividing the information sequence to be coded into N_CWTaking the length of rem code blocks as N_meslen+1, taking the rest N_CWLength of rem code blocks is N_meslen。

Further, the device also comprises a punching and repeating processing unit, wherein:

the puncturing and repeating unit is configured to puncture or repeat the encoded code block, and includes: calculating the total length N of quasi-transmitted bits_bitrptAnd the length N of the code bit which can be carried by each frame_bitpf(ii) a Calculating the total length N of quasi-transmitted bits_bitrptThe length N of code bit which can be carried by each frame_bitpfDifference N ═ N_bitrpt-N_bitpf(ii) a When N is more than 0, taking the total bit number N of the punch_puncN according to N_puncDetermining the number of bits deleted from each coded code block, and executing bit deletion operation; when N is less than 0, taking the total number of repeated bits N_repAccording to N |, by_repThe number of bits to be padded for each coded code block is determined, and the padding operation is performed.

Further, the puncturing and repetition processing unit is according to N_puncDetermining the number of bits to be deleted for each coded code block, and performing bit deletion operation, in particular determining the number of parity bits to be deleted on averageDetermining rem_p＝N_punc-N_puncpcw*N_CWFor rem in the coded code block_pLast N of code block erasure check bits_puncpcw+1 piecesBits, last N of the erasure check bits for the remaining code blocks_puncpcwA bit;

the puncturing and repetition processing unit is according to N_repDetermining the number of bits to be padded into each coded code block, and performing padding operation specifically to determine the number of parity bits for average repetitionDetermining rem_r＝N_rep-N_reppcw*N_CWRem in coded code blocks_rEnd of code block repetition padding N_reppcw+1 bits, with N being repeatedly padded at the end of the code block for the remaining code blocks_reppcwAnd (4) a bit.

In summary, the present invention considers the resource situation when determining the code of the segmented code block for the information sequence to be encoded, so as to make the information length of the code block more reasonable, and through the matching processing at the later stage of encoding, the filling or deleting bits are more uniform, and the system performance is improved.

Drawings

FIG. 1 is a diagram of a typical digital communication system of the prior art;

FIG. 2 is a diagram illustrating a prior art process of channel coding a link and modulating data;

FIG. 3 is a flow chart of a low density parity check coding method according to an embodiment of the present invention;

fig. 4 is an architecture diagram of a low density parity check coding apparatus according to an embodiment of the present invention.

Detailed Description

In this embodiment, the length of the information sequence to be encoded is N_pfThe uncoded data bit length that each frame can carry is called available data bit length N'_pfThe coding rate R is known.

As shown in fig. 3, the low density parity check coding method according to this embodiment includes:

step 301: determining the number N of code blocks segmented for an information sequence to be encoded_CW；

The number of segmented code blocks may be according to an available data bit length of N'_pfAnd determining the length of the information bit at the coding code rate R. For a determined number N of segmented code blocks_CWMore reasonable, can take the maximum information bit length N under the coding code rate R_{meslen_max}Determining the number N of segmented code blocks_CW。N_{meslen_max}The maximum information bit length in the information bit lengths corresponding to the coding rate R is the information bit length required when the maximum expansion factor at the coding rate R is used for coding.

The number of segmented code blocks is of usable data bit length N'_pfAnd a maximum information bit length N_{meslen_max}The ratio of (A) is an integer upwards, namely:wherein,indicating that an integer is taken up for x.

Step 302: determining the information bit length, the spreading factor and the code length of the code block;

the information bit length, the spreading factor, and the code length of the code block may be according to the available data bit length N'_pfAnd the number N of segmented code blocks_CWAnd (4) determining.

In particular, the information bit length N_{meslen_cl}The preparation information length N 'larger than the code block at the coding code rate R can be searched in the table 1'_meslenIs the minimum value of the information bit lengths of (1), which is the information bit length N of the code block_{meslen_cl}. All in oneThen, the information bit length N can be obtained_{meslen_cl}Corresponding spreading factor zf and code length L_LDPC。

Preparation information length N 'of the code block'_meslenIs a usable data bit length of N'_pfAnd the number N of segmented code blocks_CWThe ratio of (A) is an integer upwards, namely:

the determination of the information bit length, the spreading factor and the code length of the code block may also be performed after the code block segmentation of the information sequence to be encoded, and then the number of padding bits of each code block is determined.

In the corresponding information of the spreading factor, code rate, code length, and information bit length of the present embodiment, the minimum information bit length is N at different code rates_inflAnd N is_inflThe corresponding spreading factor and code length are zf_minAnd L_LDPC,min(ii) a Greater than N_inflEach level of information bit length of 2nN_inflAnd 2nN_inflThe corresponding spreading factor and code length are 2nzf respectively_minAnd 2nL_LDPC,minWherein n is a natural number. Table 1 below records some of the spreading factor-code rate-code length-information bit length correspondence information in this embodiment.

TABLE 1

Step 303: carrying out code block segmentation on the information sequence to be coded according to the number of segmented code blocks;

the code block segmentation of the information sequence to be encoded includes:

3031: determining an average basic information bit length N_meslen，N_meslenFor the length N of the information sequence to be coded_pfAnd the number N of code blocks_CWThe ratio of (a) to (b) is an integer,

3032: determining rem, rem being N_pf-N_CW*N_meslen；

3033: dividing the information sequence to be coded, and taking the length of rem code blocks as N_meslen+1, the remainder N_CWLength of rem code blocks is N_meslen。

The length of the first rem code blocks can be taken as N_meslen+1。

Step 304: determining the filling bit number of each code block, and filling the bits of the code blocks according to the determined filling bit number of each code block to ensure that the length of each code block reaches the information bit length N_{meslen_cl}；

The number of filling bits of each code block is the information bit length N_{meslen_cl}Determining the number N of bits needed to be filled in the ith code block according to the difference value of the respective lengths of the code blocks_padding,iComprises the following steps:

filling all 0 bits in the front of each code block according to the determined filling bit number of each code block to ensure that the length of each code block reaches the information bit length N_{meslen_cl}. Total number of padding bits is

Step 305: respectively coding each code block according to the coding rate and the information bit length of the code block;

after filling bits into each code block, the obtained length is N_{meslen_cl}The code block is sent to an LDPC coding module for coding, and a coding matrix consists of a coding rate R and an information bit length N_{meslen_cl}Corresponding spreading factor zf and code length L_LDPCThus obtaining the product.

Step 306: the coded code block is subjected to punching or repeated treatment;

the front of the code block is information bits after coding, the back of the code block is check bits, the puncturing means deleting part of check bits after the code block after coding, and the repetition means adding some bit resetting after the check bits after coding.

If the total coded bits after coding do not match the length of the coded bits that can be carried by the resource after removing the number of bits of the total filling part before coding, further processing for deleting the check bits or repeating the information bits is needed.

The bits filled before coding need to be deleted after coding, so that the total length N of the bits to be transmitted_bitrptIs N_CW*L_LDPC-N_paddingLength of coded bits N that each frame can carry_bitpfThe product of the number of data symbols carried by each frame and the number of coded bits carried by each data symbol, i.e. the length N of coded bits that can be carried by each frame_bitpfIs N_sympss*N_cbpsymCalculating the difference between the two to obtain the total number of punctured or repeated bits N_puncOr N_repTaking N as N_CW*L_LDPC-N_padding-N_sympss*N_cbpsymAnd the difference value between the total coded bits except the total filling bits before coding and the number of coded bits which can be carried by the resource is shown.

If N is present>0, then take N_puncN, N being deleted altogether_puncOne check bit to match the resource bearer. The number of check bits to be deleted in each code block is as uniform as possible.

rem_p＝N_punc-N_puncpcw*N_CW

Front rem_pCheck bit deletion last N of code blocks_puncpcw+1 bits, check bits of the rest of the code blocks delete the last N_puncpcwOne bit, namely:

if N is present<0, then take N_repN is to be filled in total_repAnd (4) a bit. The number of repeated information bits to be filled in each coding block after the check bit is also as uniform as possible.

rem_r＝N_rep-N_reppcw*N_CW

Front rem_rRepeated padding of the preceding N after the check bits of a code block_reppcw+1 information bits (I)₀,I₁…,I_reppcw) Check bits of the remaining code blocks repeatedly fill the preceding N_reppcwAn information bit (I)₀,I₁…,I_reppcw-1) I.e. by

Step 307: the processed code blocks are concatenated in order.

Application example 1:

assuming that there are 544 OFDM data symbols per frame, the number of coded bits carried per symbol is 600 bits (both the number of symbols and the number of bits carried per symbol refer to the pure data portion, excluding the pure data portion) depending on the resourcePreamble, control signaling, pilot, etc.), the data transmitted from the upper layer is N_pf174300 bits, the coding rate is 2/3, the available data bit length N'_pf＝N_sympf*N_cbpsym*R＝544*600*2/3＝217600。

According to the above hypothetical definition, the present embodiment comprises the following steps:

1, number of segmented code blocks

2, determining the information bit length N of the code block_{meslen_cl}；

Preparation information length is N'_meslen：

Minimum code rate of 2/3 in table is greater than N'_meslenInformation bit length N of_{meslen_cl}4096. And the same

Spreading factor zf corresponding to information bit length is 512, and code length L_LDPC6144. 3, determining the average basic information bit length N of the code block_meslen；

rem＝N_pf-N_CW*N_meslen＝174300-54*3227＝42

The first 42 code blocks have a length of N_meslen+ 1-3227 + 1-3228, and the last 12 code blocks have a length N_meslen3227. The number of zero bits to be padded per code block is:

the number of bits per code block padding:

total number of padding bits is

The module is partitioned and bits are padded as described above.

4, sending the code block into an encoder for encoding;

and 5, deleting the zero bits filled before coding after coding, and calculating whether the total bit number is matched with the resources:

N＝N_CW*L_LDPC-N_padding-N_sympss*N_cbpsym＝54*6144-46884-326400

＝-41508

N<0, then N needs to be filled in total_rep41508 bits. The number of repeated information bits to be filled after the check bits in each code block is as uniform as possible.

rem_r＝N_rep-N_reppcw*N_CW＝41508-768*54＝36

Repeated padding of the preceding N after the check bits of the first 36 code blocks_reppcw769 information bits, and the check bits of the last 18 code blocks are then repeated to fill the previous N bits_reppcw768 information bits.

And 6, connecting the processed coded code blocks in sequence.

Application example 2:

assuming that each frame has 120 OFDM data symbols according to resources, the number of coded bits carried by each symbol is 150 bits (the number of symbols and the number of bits carried by each symbol refer to a pure data portion excluding preamble, control signaling, pilot, etc.), and the data transmitted from the upper layer is N_pf10000 bits, 5/6 coding rate, N 'is available data bit length'_pf＝N_sympf*N_cbpsym*R＝120*150*5/6＝15000。

According to the above hypothetical definition, the present embodiment comprises the following steps:

1, number of segmented code blocks

2, determining the information bit length N of the code block_{meslen_cl}；

Preparation information length is N'_meslen：

Minimum code rate of 5/6 in table is greater than N'_meslenInformation bit length N of_{meslen_cl}Is 7680. The spreading factor zf corresponding to the information bit length is 384, and the code length L is_LDPC＝9216。

3, determining the average basic information bit length N of the code block_meslen：

rem＝N_pf-N_CW*N_meslen＝0

Average basic information bit length of code block is N_meslen5000 bits, the number of zero bits to be padded per code block is:

the number of filling bits per code block is: 7680 Bisa 5000 ═ 2680

Total number of padding bits is

The module is partitioned and bits are padded as described above.

And 4, sending the code block to an encoder for encoding.

And 5, deleting the zero bits filled before coding after coding, and calculating whether the total bit number is matched with the resources:

N＝N_CW*L_LDPC-N_padding-N_sympss*N_cbpsym＝2*9216-5360-120*150＝-4928

N<0, then N needs to be filled in total_rep4928 bits. The number of repeated information bits to be filled after the check bits in each code block is as uniform as possible.

rem_r＝N_rep-N_reppcw*N_CW＝0

Each code block repeatedly fills the first 2464 information bits after the check bits.

And 6, connecting the processed code words of the encoders in sequence.

Fig. 4 shows a low density parity check coding apparatus according to this embodiment, including: code block number determination unit, code block segmentation unit, code block padding unit, coding unit and code block connection unit, wherein:

a code block number determination unit for determining the number of code blocks according to the available data bit length N'_pfAnd the information bit length under the coding code rate R determines the code block number N for dividing the information sequence to be coded_CW；

The code block number determining unit is specifically configured to take the information bit length at the coding rate R as the maximum information bit length N at the coding rate R_{meslen_max}Get itWherein,indicating an upward integer.

A code block segmentation unit for dividing the code block into N code blocks_CWDividing an information sequence to be coded;

the code block segmentation unit is specifically adapted to determine an average basic information bit length N_meslen，Wherein,represents a downward integer; determining rem, rem being N_pf-N_CW*N_meslenWherein N is_pfThe length of the information sequence to be coded; dividing the information sequence to be coded into N_CWTaking the length of rem code blocks as N_meslen+1, taking the rest N_CWLength of rem code blocks is N_meslen。

A code block padding unit for bit-padding the segmented code block;

a coding unit for coding the bit-padded code block;

and the code block connecting unit is used for connecting the coded code blocks in sequence.

The device also comprises a punching and repeating processing unit which is used for punching or repeating the coded code block and comprises: calculating the total length N of quasi-transmitted bits_bitrptAnd the length N of the code bit which can be carried by each frame_bitpf(ii) a Calculating the total length N of quasi-transmitted bits_bitrptThe length N of code bit which can be carried by each frame_bitpfDifference N ═ N_bitrpt-N_bitpf(ii) a When N is more than 0, taking the total bit number N of the punch_puncN according to N_puncDetermining the number of bits deleted from each coded code block, and executing bit deletion operation; when N is less than 0, taking the total number of repeated bits N_repAccording to N |, by_repThe number of bits to be padded for each coded code block is determined, and the padding operation is performed.

The puncturing and repetition processing unit is based on N_puncDetermining the number of bits to be deleted for each coded code block, and performing bit deletion operation, in particular determining the number of parity bits to be deleted on averageDetermining rem_p＝N_punc-N_puncpcw*N_CWFor rem in the coded code block_pLast N of code block erasure check bits_puncpcw+1 bits, last N of erasure check bits for the rest of the code block_puncpcwA bit;

the puncturing and repetition processing unit is based on N_repDetermining the number of bits to be padded into each coded code block, and performing padding operation specifically to determine the number of parity bits for average repetitionDetermining rem_r＝N_rep-N_reppcw*N_CWRem in coded code blocks_rEnd of code block repetition padding N_reppcw+1 bits, with N being repeatedly padded at the end of the code block for the remaining code blocks_reppcwAnd (4) a bit.

It will be understood by those skilled in the art that all or part of the steps of the above methods may be implemented by instructing the relevant hardware through a program, and the program may be stored in a computer readable storage medium, such as a read-only memory, a magnetic or optical disk, and the like. Alternatively, all or part of the steps of the foregoing embodiments may also be implemented by using one or more integrated circuits, and accordingly, each module/unit in the foregoing embodiments may be implemented in the form of hardware, and may also be implemented in the form of a software functional module. The present invention is not limited to any specific form of combination of hardware and software.

The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (14)

1. A low density parity check coding method, comprising:

according to available data bit length N'_pfAnd the information bit length under the coding code rate R determines the code block number N for dividing the information sequence to be coded_CW；

According to the code block number N_CWDividing the information sequence to be coded;

bit filling is carried out on the segmented code blocks;

coding the code blocks after bit filling, and connecting the coded code blocks in sequence;

according to the code block number N_CWThe information sequence to be coded is segmented, and the segmentation comprises the following steps:

determining an average basic information bit length N_meslen，Wherein,represents a downward integer;

determining rem, rem being N_pf-N_CW*N_meslenWherein N is_pfThe length of the information sequence to be coded;

dividing the information sequence to be coded into N_CWTaking the length of rem code blocks as N_meslen+1, taking the rest N_CWLength of rem code blocks is N_meslen。

2. The method of claim 1, wherein the function is according to a usable data bit length of N'_pfAnd the information bit length under the coding code rate R determines the code block number N for dividing the information sequence to be coded_CWThe method comprises the following steps:

taking the information bit length under the coding code rate R as the maximum information bit length N under the coding code rate R_{meslen_max}；

Get theWherein,indicating an upward integer.

3. The method of claim 1 or 2, wherein the bit-filling the segmented code blocks comprises:

determining information bit length N of code block_{meslen_cl}；

Determining the number of filling bits of the segmented code block, wherein the number of the filling bits is the length N of the information bits_{meslen_cl}Difference values with respective lengths of the segmented code blocks;

and respectively carrying out bit filling on the code blocks according to the determined filling bit number of each code block.

4. The method of claim 3, wherein the determining information bit length N of code blocks_{meslen_cl}The method comprises the following steps:

searching for preparation information length N 'larger than code block under the coding code rate R from corresponding information of spreading factor-code rate-code length-information bit length'_meslenIs used as the information bit length N of the code block_{meslen_cl}Wherein the preparation information length of the code block

5. The method of claim 4, further comprising:

determining the information bit length N of the code block_{meslen_cl}Then, inquiring the information bit length N_{meslen_cl}Corresponding spreading factor zf and code length L_LDPC。

6. The method of claim 5, wherein the encoding the bit-filled code block comprises:

according to the information bit length N_{meslen_cl}Corresponding spreading factor zf and code length L_LDPCAnd determining a coding matrix, and performing low-density parity check coding on the code block subjected to bit filling by adopting the determined coding matrix.

7. The method of claim 5, further comprising puncturing or repeating the encoded code blocks after the encoding the bit-padded code blocks and before concatenating the encoded code blocks in order, comprising:

calculating the total length N of quasi-transmitted bits_bitrpt＝N_CW*L_LDPC-N_paddingWhereinN_padding，ithe number of padding bits for the ith code block obtained by segmentation is set;

calculating the length N of the code bit which can be carried by each frame_bitpf；

Calculating the total length N of quasi-transmitted bits_bitrptThe length N of code bit which can be carried by each frame_bitpfDifference N ═ N_bitrpt-N_bitpf；

When N is more than 0, taking the total bit number N of the punch_puncN according to N_puncDetermining the number of bits deleted from each coded code block, and executing bit deletion operation;

when N is less than 0, taking the total number of repeated bits N_repAccording to N |, by_repThe number of bits to be padded for each coded code block is determined, and the padding operation is performed.

8. The method of claim 7, wherein:

said according to N_puncDetermining the number of bits to delete for each coded code block, and performing bit deletion operation includes: determining the number of parity bits for an average erasureDetermining rem_p＝N_punc-N_puncpcw*N_CWFor rem in the coded code block_pLast N of code block erasure check bits_puncpcw+1 bits, last N of erasure check bits for the rest of the code block_puncpcwA bit;

said according to N_repDetermining the number of bits to be padded into each coded code block, and performing padding operation comprises: determining the number of parity bits for an average repetitionDetermining rem_r＝N_rep-N_reppcw*N_CWRem in coded code blocks_rEnd of code block repetition padding N_reppcw+1 bits, with N being repeatedly padded at the end of the code block for the remaining code blocks_reppcwAnd (4) a bit.

9. The method of claim 4, wherein:

in the corresponding information of the expansion factor, the code rate, the code length and the information bit length, the minimum information bit length is N under different code rates_inflAnd N is_inflThe corresponding spreading factor and code length are zf_minAnd L_LDPC,min(ii) a Greater than N_inflEach level of information bit length of 2nN_inflAnd 2nN_inflThe corresponding spreading factor and code length are 2nzf respectively_minAnd 2nL_LDPC,minWherein n is a natural number.

10. The method of claim 9, wherein:

at code rate of 1/2, minimum information bit length N_infl128, corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 256, respectively;

at code rate of 2/3, minimum information bit length N_infl256, corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 384, respectively;

at code rate of 3/4, minimum information bit length N_inflAt 384, the corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 512, respectively;

at code rate of 5/6, minimum information bit length N_infl640, corresponding minimum spreading factorChild zf_minAnd a minimum code length L_LDPC,min32 and 768, respectively;

at code rate of 7/8, minimum information bit length N_infl896, the corresponding minimum spreading factor zf_minAnd a minimum code length L_LDPC,min32 and 1024 respectively.

11. A low density parity check encoding apparatus, comprising: code block number determination unit, code block segmentation unit, code block padding unit, coding unit and code block connection unit, wherein:

the code block number determination unit is used for determining the code block number according to the available data bit length N'_pfAnd the information bit length under the coding code rate R determines the code block number N for dividing the information sequence to be coded_CW；

The code block segmentation unit is used for dividing the code block into N code blocks according to the number of the code blocks_CWDividing the information sequence to be coded;

the code block filling unit is used for carrying out bit filling on the segmented code blocks;

the encoding unit is used for encoding the code block after the bit filling;

the code block connecting unit is used for connecting the coded code blocks in sequence;

the code block segmentation unit is specifically configured to determine an average basic information bit length N_meslen，Wherein,represents a downward integer; determining rem, rem being N_pf-N_CW*N_meslenWherein N is_pfThe length of the information sequence to be coded; dividing the information sequence to be coded into N_CWTaking the length of rem code blocks as N_meslen+1, taking the rest N_CWLength of rem code blocks is N_meslen。

12. The apparatus of claim 11, wherein:

the code block number determining unit is specifically configured to take the information bit length at the coding rate R as the maximum information bit length N at the coding rate R_{meslen_max}Get theWherein,indicating an upward integer.

13. The apparatus of claim 11, further comprising a puncture and repeat processing unit, wherein:

the puncturing and repeating unit is configured to puncture or repeat the encoded code block, and includes: calculating the total length N of quasi-transmitted bits_bitrptAnd the length N of the code bit which can be carried by each frame_bitpf(ii) a Calculating the total length N of quasi-transmitted bits_bitrptThe length N of code bit which can be carried by each frame_bitpfDifference N ═ N_bitrpt-N_bitpf(ii) a When N is more than 0, taking the total bit number N of the punch_puncN according to N_puncDetermining the number of bits deleted from each coded code block, and executing bit deletion operation; when N is less than 0, taking the total number of repeated bits N_repAccording to N |, by_repThe number of bits to be padded for each coded code block is determined, and the padding operation is performed.

14. The apparatus of claim 13, wherein:

the puncturing and repetition processing unit is according to N_puncDetermining the number of bits to be deleted for each coded code block, and performing bit deletion operation, in particular determining the number of parity bits to be deleted on averageDetermining rem_p＝N_punc-N_puncpcw*N_CWFor rem in the coded code block_pLast N of code block erasure check bits_puncpcw+1 bits, last N of erasure check bits for the rest of the code block_puncpcwA bit;

the puncturing and repetition processing unit is according to N_repDetermining the number of bits to be padded into each coded code block, and performing padding operation specifically to determine the number of parity bits for average repetitionDetermining rem_r＝N_rep-N_reppcw*N_CWRem in coded code blocks_rEnd of code block repetition padding N_reppcw+1 bits, with N being repeatedly padded at the end of the code block for the remaining code blocks_reppcwAnd (4) a bit.