WO2018201912A1

WO2018201912A1 - Method and device for selecting base graph for low-density parity-check code

Info

Publication number: WO2018201912A1
Application number: PCT/CN2018/083743
Authority: WO
Inventors: 张荻; 王加庆; 潘学明; 孙韶辉
Original assignee: 电信科学技术研究院有限公司
Priority date: 2017-05-05
Filing date: 2018-04-19
Publication date: 2018-11-08

Abstract

Provided in the present disclosure are a method and device for selecting a base graph for a low-density parity-check code. The method comprises: acquiring a data information length of data to be coded or decoded and a channel coding rate; determining, according to the data information length and an information length range of base graphs, a target base graph selection policy; and selecting, according to the base graph selection policy and the channel coding rate, a target base graph for the current data to be coded or decoded.

Description

Base map selection method and device for low density parity check code

Cross-reference to related applications

The priority of the Chinese Patent Application No. 201710314028.6 filed on May 5, 2017 in China and the priority of the Chinese Patent Application No. 201710367204.2 filed on May 23, 2017 in China, the entire contents of References are included here.

Technical field

The present disclosure relates to the field of communications technologies, and in particular, to a base map selection method and apparatus for a low density parity check code.

Background technique

3GPP (3rd Generation Partnership Project) uses LDPC (Low Density Parity Check) code for 5G NR (New Radio) enhanced mobile broadband (eMBB, Enhanced Mobile) Broadband) application scenario.

The LDPC code obtains a parity check matrix supporting a specific information length and a code rate by using a lifting method on the base graph base graph, thereby performing coding and decoding. Due to the limitation of the base graph and lifting parameters, the information length and code rate that the parity check matrix can support are limited to a range. Therefore, the information length and code rate range supported by the determined base graph are also determined. Different base graphs can support different information lengths and code rates.

According to the conclusion of the 3GPP meeting, an LDPC coding scheme with two base graphs can be used in the NR, wherein the information length and code rate range supported by the two base graphs are covered by the two base graphs to cover all code lengths and code rates. Different, and there is overlap of coverage.

However, before performing the base graph selection, the base station and the terminal obtain the transport block size (TBs) by querying the stored MCS table by obtaining the Modulation Coding Scheme (MCS) information in the downlink control information (DCI, Downlink Control Information). , Transport Block size) and the value of the target R, and calculate the segmentation result to obtain the targets K and R used by the LDPC compiler code.

It can be seen that the targets K and R are calculated according to the length of the data to be transmitted and the physical resources that the channel can provide. Therefore, when the base graph is selected based on the information length and the code rate range supported by the target K, R and the above two base graphs, the combination of the data length to be transmitted and the channel coding rate may be overlapped due to the inability to cover or overlap. There is a problem that the base graph required to compile the data cannot be explicitly selected.

Summary of the invention

The purpose of the present disclosure is to provide a method and apparatus for selecting a base map of a low density parity check code to solve the problem that the base graph required for the compiled code cannot be explicitly selected in the two base graphs.

In order to achieve the above object, in a first aspect, an embodiment of the present disclosure provides a base map selection method for a low density parity check code, including: acquiring a data information length of a data to be compiled and a channel coding rate; The data information length and the information length range of the base map determine a target base map selection strategy; and determine a target base map of the compiled data according to the target base map selection strategy and the channel coding rate.

Optionally, the step of determining a target base map selection policy according to the length of the data information and the information length range of the base map includes: acquiring a first minimum information length Kmin1 and a first of the first map in the base map a maximum information length Kmax1; acquiring a second minimum information length Kmin2 and a second maximum information length Kmax2 of the second map in the base map; and the first minimum information length and the first maximum information according to the data information length K The size relationship between the length, the second minimum information length, and the second maximum information length determines a target base map selection strategy; wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.

Optionally, the determining, according to the size relationship between the data information length K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length, is determined. The step of selecting a strategy for the target base map includes: determining, when Kmin2≤K<Kmin1, the target base map selection strategy as a first base map selection strategy; and determining a target base map selection strategy when Kmin1≤K≤Kmax2 Selecting a strategy for the second base map; and determining, when Kmax2<K≤Kmax1, the target base map selection strategy is a third base map selection strategy. Optionally, the determining, according to the target base map selection policy and the channel coding rate, the step of determining a target base map of the current compiled data, comprising: acquiring a first minimum coding of the first image in the basic image a code rate Rmin1 and a first maximum coding rate Rmax1; acquiring a second minimum coding rate Rmin2 and a second maximum coding rate Rmax2 of the second picture in the base picture; comparing the channel coding rate R with the first minimum a comparison between an encoding code rate, the first maximum encoding rate, the second minimum encoding rate, and the second maximum encoding rate to obtain a comparison result; and based on the target base map selection strategy and The comparison result determines the target base map; wherein, Rmin2 < Rmin1 < Rmax2 < Rmax1.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result, including: when the target base map selection policy is a first base map selection policy, if Rmin2 ≤ R ≤ Rmax2, the second map is selected as the target base map.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result comprises: when the target base map selection policy is a first base map selection policy, if Rmax2 <R≤Rmax1, the first map is selected as the target base map.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result comprises: selecting a policy in the target base map selection strategy as a second base map, and Kmin1= In the case of Kmax2, if Rmin2 ≤ R ≤ Rmax2, the second map is selected as the target base map.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result comprises: selecting a policy in the target base map selection strategy as a second base map, and Kmin1= In the case of Kmax2, if Rmax2 < R ≤ Rmax1, the first map is selected as the target base map.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result, including: selecting, in the target base map selection strategy, a second base map selection policy, and Kmin1< In the case of Kmax2, if Rmin2 ≤ R < Rmin1, the second map is selected as the target base map.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result, including: selecting, in the target base map selection strategy, a second base map selection policy, and Kmin1< In the case of Kmax2, if Rmax2 ≤ R ≤ Rmax1, the first map is selected as the target base map.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result, including: selecting, in the target base map selection strategy, a second base map selection policy, and Kmin1< When Kmax2, if Rmin1≤R<Rmax2, the preset information length value K0 and the preset encoding code rate value R0 are determined according to the error block performance of the target base map and the delay performance affected by the lifting parameter, and the data is The information length is compared with the preset information length value K0, and the channel coding rate is compared with the preset coding rate value R0. When K0≤K<Kmax2 and R0≤R<Rmax2, the first picture is selected as the The target base map, when K<K0 or R<R0, selects the second map as the target base map.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result includes: when the target base map selection policy is a third base map selection policy, if Rmin2 ≤ R < Rmin1, and the first map supports encoding using K smaller than Kmax1 and R smaller than Rmin1 in the case of K/R ≤ Nmax, then the first map is selected as the target base map; , Nmax = Kmax1/Rmin1.

Optionally, the step of determining the target base map based on the target base map selection policy and the comparison result, including: when the target base map selection policy is a third basic map selection policy, if Rmin1 ≤ R ≤ Rmax1, the first map is selected as the target base map.

Optionally, after the step of determining the target base map of the compiled data, the method further includes: generating a check matrix of the compiled data according to the target base map, the target information length, and the target encoding code rate.

Optionally, when Kmin2≤K<Kmin1, Rmax2<R≤Rmax1, the target information length is obtained by increasing the length of the data information by Kmin1-K zeros; otherwise, the target information length is equal to the Data information length; wherein K represents the length of the data information, Kmin1 represents the first minimum information length of the first picture in the base picture, Kmin2 represents the second minimum information length of the second picture in the base picture, and R represents The channel coding rate, Rmax1 represents a first maximum coding rate of the first picture, and Rmax2 represents a second maximum coding rate of the second picture.

Optionally, the target coding rate is equal to the channel coding rate.

In order to achieve the above object, in a second aspect, an embodiment of the present disclosure further provides a base map selection apparatus for a low density parity check code, including: an acquisition module, configured to acquire data information length and channel coding of data to be compiled. a first determining module, configured to determine a target base map selection policy according to the length of the data information and the information length range of the base map; and a second determining module, configured to select a policy according to the target base map and the The channel coding rate determines the target base map of the compiled data.

Optionally, the first determining module includes: a first acquiring submodule, configured to acquire a first minimum information length Kmin1 and a first maximum information length Kmax1 of the first image in the base map; and a second acquiring submodule, a second minimum information length Kmin2 and a second maximum information length Kmax2 for acquiring the second map in the base map; and a first determining submodule, configured to use the length of the data information K and the first minimum information length, Determining a size relationship between the first maximum information length, the second minimum information length, and the second maximum information length to determine a target base map selection strategy; wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.

Optionally, the first determining submodule includes: a first determining unit, configured to determine, when Kmin2≤K<Kmin1, that the target base map selection policy is a first base map selection policy; When Kmin1≤K≤Kmax2, determining that the target base map selection strategy is a second base map selection strategy; and a third determining unit, configured to determine, when Kmax2<K≤Kmax1, the target base map selection strategy is The third base map selection strategy.

Optionally, the second determining module includes: a third acquiring submodule, configured to acquire a first minimum encoding rate Rmin1 and a first maximum encoding rate Rmax1 of the first image in the base map; and a fourth acquiring a module, configured to obtain a second minimum coding rate Rmin2 and a second maximum coding rate Rmax2 of the second picture in the base map; and a comparison submodule, configured to compare the channel coding rate R with the first minimum coding code a ratio between the first maximum coding rate, the second minimum coding rate, and the second maximum coding rate to obtain a comparison result; and a second determining submodule for The target base map selection strategy and the comparison result determine the target base map; wherein, Rmin2 < Rmin1 < Rmax2 < Rmax1.

Optionally, the second determining submodule includes: a first selecting unit, configured to: when the target base map selection policy is a first base map selection policy, if Rmin2≤R≤Rmax2, select the second The figure serves as the target base map.

Optionally, the second determining submodule includes: a second selecting unit, configured to: when the target base map selection policy is the first base map selection policy, if Rmax2<R≤Rmax1, select the first The figure shows the target base map.

Optionally, the second determining submodule includes: a third selecting unit, configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1=Kmax2, if Rmin2≤R≤Rmax2, The second map is selected as the target base map.

Optionally, the second determining submodule includes: a third selecting unit, configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1=Kmax2, if Rmax2<R≤Rmax1, The first map is selected as the target base map.

Optionally, the second determining submodule includes: a fourth selecting unit, configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1<Kmax2, if Rmin2≤R<Rmin1, The second map is selected as the target base map.

Optionally, the second determining submodule includes: a fifth selecting unit, when the target base map selection policy is a second base map selection strategy, and when Kmin1<Kmax2, if Rmax2≤R≤Rmax1, then selecting The first map is taken as the target base map.

Optionally, the second determining submodule includes: a sixth selecting unit, configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1<Kmax2, if Rmin1≤R<Rmax2, Determining a preset information length value K0 and a preset encoding code rate value R0 according to the error block performance of the target base map and the delay performance affected by the lifting parameter, and the data information length and the preset information length value K0, The channel coding rate is compared with the preset coding rate value R0. When K0≤K<Kmax2 and R0≤R<Rmax2, the first picture is selected as the target base picture, where K<K0 or R< At R0, the second map is selected as the target base map.

Optionally, the second determining submodule includes: a seventh selecting unit, configured to: when the target base map selection policy is a third base map selection policy, if Rmin2≤R<Rmin1, and the first map In the case where K/R ≤ Nmax, encoding using K smaller than Kmax1 and R smaller than Rmin1 is supported, the first map is selected as the target base map; where Nmax = Kmax1/Rmin1.

Optionally, the second determining submodule includes: an eighth selecting unit, configured to: when the target base map selection policy is a third base map selection policy, if Rmin1≤R≤Rmax1, select the first The figure serves as the target base map.

Optionally, the device further includes: a generating module, configured to generate a check matrix of the current compiled data according to the target base map, the target information length, and the target encoding code rate.

Optionally, when Kmin2≤K<Kmin1, Rmax2<R≤Rmax1, the target information length is obtained by increasing the length of the data information by Kmin1-K zeros; otherwise, the target information length is equal to the Length of data information;

K represents the length of the data information, Kmin1 represents the first minimum information length of the first picture in the base map, Kmin2 represents the second minimum information length of the second picture in the base picture, and R represents the channel coding rate Rmax1 represents the first maximum coding rate of the first picture, and Rmax2 represents the second maximum coding rate of the second picture.

Optionally, the target coding rate is equal to the channel coding rate.

In a third aspect, the present disclosure further provides a base map selection apparatus for a low density parity check code, comprising: a processor, a memory, and a bus interface, wherein the bus interface is used to connect the processor and the memory The memory is for storing programs and data, and the processor is configured to read programs and data stored in the memory to control the apparatus to perform the method of the first aspect.

In a fourth aspect, the present disclosure further provides a non-transitory computer readable storage medium comprising: programs and instructions stored on the non-transitory computer readable storage medium, wherein the programs and instructions When executed by a processor of a computer, the processor implements the method of the first aspect above.

The beneficial effects of the above technical solutions of the present disclosure are as follows:

The basic map selection method of the low density parity check code of the embodiment of the present disclosure first obtains the data information length and the channel coding rate of the compiled data to be compiled, and then according to the length of the data information and the information length range of the base map, The appropriate target base map selection strategy is determined. Then, according to the target base map selection strategy and the channel coding rate, the target base map of the compiled data is finally determined. It is avoided that the information length and coding rate supported by the base graph cannot be covered, or when the combination of overlapping data information length and channel coding rate is overwritten, the target base graph that needs to be used cannot be clarified, and the situation is more effectively determined. The target base graph.

DRAWINGS

1 is a flow chart showing the steps of a method for selecting a base map of a low density parity check code according to an embodiment of the present disclosure;

2 is a flow chart of specific steps of a method for selecting a base map of a low density parity check code according to an embodiment of the present disclosure;

3 is a flow chart of specific steps of a method for selecting a base map of a low density parity check code according to an embodiment of the present disclosure;

4 is a schematic structural diagram of a base map selecting apparatus for a low density parity check code according to an embodiment of the present disclosure;

FIG. 5 is a schematic structural diagram of a data compiling device according to an embodiment of the present disclosure.

detailed description

The technical problems, the technical solutions, and the advantages of the present invention will be more clearly described in conjunction with the accompanying drawings and specific embodiments.

The present disclosure provides a base map selection method for low-density parity check codes in a related base graph selection manner, and a base map selection method for low-density parity check codes is selected, and the information length range of the base map is selected. Appropriate selection strategy, and then more clearly determine the target base map of this compiled data.

As shown in FIG. 1 , a base map selection method for a low density parity check code according to an embodiment of the present disclosure includes steps 101-103.

Step 101: Obtain a data information length and a channel coding rate of the data to be compiled.

Step 102: Determine a target base map selection policy according to the length of the data information and the information length range of the base map.

Step 103: Determine a target base map of the compiled data according to the target base map selection policy and the channel coding rate.

Since the base graph to be selected has a respective supported information length and coding rate, in this embodiment, a target base map selection strategy for different information length ranges is set. In this way, after the mobile terminal or the base station knows the data information length and the channel coding code rate of the currently compiled data to be compiled, the mobile terminal or the base station can determine the length according to the length of the data information and the information length of the base map. The appropriate target base map selection strategy is further determined according to the target base map selection strategy and the channel coding rate, and finally the target base map of the compiled data is finally determined. It is avoided that the information length and coding rate supported by the base graph cannot be covered, or when the combination of overlapping data information length and channel coding rate is overwritten, the target base graph that needs to be used cannot be clarified, and the situation is more effectively determined. The target base graph.

It should be appreciated that, according to the conclusions of the 3GPP meeting, an LDPC coding scheme with two base graphs is optionally used in the NR. Among them, the first graph base graph #1 supports information length [Kmin1, Kmax1], and the code rate range [Rmin1, Rmax1]. The second graph base graph #2 supports information length [Kmin2, Kmax2], and the code rate range [Rmin2, Rmax2]. Where Kmin1 represents the first minimum information length of the first figure, Kmax1 represents the first maximum information length of the first picture, Rmin1 represents the first minimum coding rate of the first picture, and Rmax1 represents the first maximum coding code of the first picture. Rate; Kmin2 represents the second minimum information length of the second figure, Kmax2 represents the second maximum information length of the second picture, Rmin1 represents the second minimum coding rate of the second picture, and Rmax2 represents the second maximum of the second picture Code rate. Since both base graphs cover all information lengths and encoding bit rates of the compiled data, Kmin2<Kmin1≤Kmax2<Kmax1, Rmin2<Rmin1<Rmax2<Rmax1, Kmin2 is equal to the minimum information length Kmin of the compiled data, Kmax1 is equal to compile The maximum information length Kmax of the data, Rmin2 is equal to the minimum coding rate Rmin of the compiled data, and Rmax1 is equal to the maximum coding rate Rmax of the compiled data.

It can be seen from the above that in the embodiment of the present disclosure, the set base map selection policy is corresponding to the information length range of the base map. Therefore, specifically, as shown in FIG. 2, in the embodiment of the present disclosure, step 102 includes sub-steps. 1021-1023.

Sub-step 1021, obtaining a first minimum information length Kmin1 and a first maximum information length Kmax1 of the first map in the base map.

Sub-step 1022, acquiring a second minimum information length Kmin2 and a second maximum information length Kmax2 of the second figure in the base map.

Sub-step 1023, determining a target basis according to a size relationship between the data information length K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length Graph selection strategy; wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.

Here, in sub-steps 1021-1023, the mobile terminal or the base station respectively obtains the minimum information length and the maximum information length of the first picture and the second picture in the base picture, and further, according to the length of the data information and the length of each acquired information. The size relationship determines the appropriate target base map selection strategy.

Optionally, the sub-step 1023 includes: when Kmin2≤K<Kmin1, determining that the target base map selection strategy is a first base map selection strategy; and when Kmin1≤K≤Kmax2, determining that the target base map selection strategy is a second base map selection strategy; when Kmax2<K≤Kmax1, determining that the target base map selection strategy is a third base map selection strategy.

Here, based on the set range of the base map selection strategy and the length of the data information, the target base map selection strategy for the final base map selection of the data to be compiled can be determined first to determine the target base map.

It should be further understood that, in the embodiment of the present disclosure, the determination of the target base map is implemented according to the target base map selection strategy and the channel coding rate. Specifically, as shown in FIG. 3, step 103 includes sub-step 1031. -1034.

Sub-step 1031, obtaining a first minimum coding rate Rmin1 and a first maximum coding rate Rmax1 of the first picture in the base picture.

Sub-step 1032, obtaining a second minimum coding rate Rmin2 and a second maximum coding rate Rmax2 of the second picture in the base picture.

Sub-step 1033, comparing the size between the channel coding code rate R and the first minimum coding rate, the first maximum coding rate, the second minimum coding rate, and the second maximum coding rate , get a comparison result.

Step 1034: Determine the target base map based on the target base map selection strategy and the comparison result; wherein, Rmin2<Rmin1<Rmax2<Rmax1.

According to the above steps, firstly, the minimum coding rate and the maximum coding rate of the first picture and the second picture are obtained, and then the size between the channel coding rate and each coding rate is compared, and then the comparison result is determined according to the comparison result. The target base map selection strategy is used to complete the determination of the target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the first base map selection policy, if Rmin2≤R≤Rmax2, selecting the second map as the target base map.

Here, when the determined target base map selection strategy is the first base map selection strategy, by further knowing that Rmin2 ≤ R ≤ Rmax2 by comparing the results, it is determined that the second map, that is, base graph #2 is selected as the target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the first base map selection policy, if Rmax2<R≤Rmax1, the first map is selected as the target base map.

Here, when the determined target base map selection strategy is the first base map selection strategy, by further knowing that Rmax2 < R ≤ Rmax1 by the comparison result, it is determined that the first map, that is, base graph #1 is selected as the target base map.

For example, Kmax1=8448, Kmax2=2000, Kmin1=512, Kmin2=100, Rmin1=1/3, Rmax1=8/9, Rmin2=1/5, Rmax2=2/3, information length unit is bit, code code The unit of the rate is kbps. When the K=500, R=5/6 corresponding to the data to be compiled is obtained, the target base map selection strategy is determined as the first base map selection strategy by Kmin2≤K<Kmin1 by the above method. Then, in the first base map selection strategy, it is determined that the base graph #2 is selected as the target base map of the current compiled data because Rmax2 < R ≤ Rmax1.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the second base map selection policy, and when Kmin1=Kmax2, if Rmin2≤R≤Rmax2, selecting the second map as the target basis Figure.

Here, the selected target base map selection strategy is the second base map selection strategy, and Kmin1=Kmax2, and after further understanding Rmin2≤R≤Rmax2 by the comparison result, it is determined to select the second map, that is, base graph#2 as Target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the second base map selection policy, and Kmin1=Kmax2, if Rmax2<R≤Rmax1, the first map is selected as the target base map.

Here, the selected target base map selection strategy is the second base map selection strategy, and Kmin1=Kmax2, and after further understanding that Rmax2<R≤Rmax1 by the comparison result, it is determined that the first map is selected, that is, base graph#1 is taken as Target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the second base map selection policy, and when Kmin1<Kmax2, if Rmin2≤R<Rmin1, selecting the second map as the target basis Figure.

Here, when the determined target base map selection strategy is the second base map selection strategy, and Kmin1<Kmax2, by further knowing that Rmin2≤R<Rmin1 by the comparison result, it is determined to select the second map, namely base graph#2 as Target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the second base map selection policy, and when Kmin1<Kmax2, if Rmax2≤R≤Rmax1, selecting the first map as the target basis Figure.

Here, when the determined target base map selection strategy is the second base map selection strategy and Kmin1<Kmax2, and the comparison result further knows that Rmax2≤R≤Rmax1, it is determined to select the first map, that is, base graph#1 as Target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the second base map selection policy, and when Kmin1<Kmax2, if Rmin1≤R<Rmax2, according to the error block performance of the target base map and The delay performance affected by the parameter is determined by the preset information length value K0 and the preset encoding rate value R0, and the data information length and the preset information length value K0, the channel coding rate and the preset coding rate The values R0 are respectively compared, and when K0≤K<Kmax2 and R0≤R<Rmax2, the first map is selected as the target base map, and when K<K0 or R<R0, the second map is selected as the The target base map.

Here, when the determined target base map selection strategy is the second base map selection strategy, and Kmin1<Kmax2, by further knowing that Rmin1≤R<Rmax2 through the comparison result, it is also necessary to separately distinguish K from K0, R and R0. For comparison, when K0 ≤ K < Kmax2 and R0 ≤ R < Rmax2, the first map is selected, that is, base graph #1 is used as the target base map, and when K < K0 or R < R0, the second map is selected, that is, base graph# 2 as the target base map. The lifting scale size used by the two base graphs is different. Considering that using a larger lifting size can reduce the delay, the performance is different when the two base graphs are independent. Therefore, the threshold can be selected. The preset information length value K0 and the preset encoding rate value R0 are determined according to the error block performance of the target base map and the delay performance affected by the lifting parameter. In this way, the settings of K0 and R0 will achieve the selected target base map, which can make the lifting code process get larger lifting size, less delay, and better error block. If the second picture is optimized for shorter code blocks, and its block error performance is better than the first picture in the applicable information length and code rate range, K0=Kmax2, R0=Rmax2 can be set to achieve The second picture is used as the target base picture; if the second picture has the largest lifting size value within the applicable information length and code rate range, the hardware parallelism required for the compiled code is high and the delay is low, so K0=Kmax2 can also be set. , R0 = Rmax2, using the second picture as the target base map for encoding and decoding.

Continuing the range of the information length and the code rate supported by the first picture and the second picture in the above example, and setting K0=Kmin1=512, R0=Rmin1=1/3, then K and R for acquiring the data to be compiled , Kmin1 ≤ K < Kmax2 and all combinations within the range of Rmin1 ≤ R < Rmax2 belong to K>K0, R>R0, and the first graph, that is, base graph #1 can be determined as the target base map.

If it is assumed that the base map supports the range, Kmax2=2560, and the others are unchanged, set K0=2000, R0=1/2. If K=2100 and R=0.6, then K and R are in the range of Kmin1≤K≤Kmax2 and Rmin1≤R<Rmax2, belonging to the coincidence range of the base graph, and K>K0, R>R0. A picture, base graph #1, is used as the target base map. If K=1900 and R=0.4, it belongs to the range of K<K0 and R<R0, and the second graph, base graph#2, can be determined as the target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the third base map selection policy, if Rmin2≤R<Rmin1, and the first map is in the case of K/R≤Nmax, support The encoding is performed using K smaller than Kmax1 and R smaller than Rmin1, and the first map is selected as the target base map; wherein Nmax = Kmax1/Rmin1.

Here, when the determined target base map selection strategy is the third base map selection strategy, the comparison result further knows that Rmin2≤R<Rmin1, and the first map supports the use of less than Kmax1 in the case of K/R≤Nmax. K is encoded with R smaller than Rmin1, and the first map is selected as the target base map.

Continuing the range of information length and code rate supported by the first and second figures in the above example, it is assumed that base graph #1 supports the use of K less than Kmax1 and R less than Rmin1 when K/R ≤ Nmax is satisfied. coding. At this time, Nmax=Kmax1/Rmin1=8448/(1/3)=25344. When K=6000, R=1/4, and K/R=24000<Nmax is satisfied at this time, the first map, that is, base graph#1 is determined as the target base map.

Optionally, the sub-step 1034 includes: when the target base map selection policy is the third base map selection policy, if Rmin1≤R≤Rmax1, the first map is selected as the target base map.

Here, when the determined target base map selection strategy is the third base map selection strategy, and further knowing that Rmin1 ≤ R ≤ Rmax1 by comparing the results, it is determined that the first map, that is, base graph #1 is selected as the target base map.

Continuing the range of the information length and the code rate supported by the first picture and the second picture in the above example, when K=8448, R=9/10 corresponding to the data to be compiled is obtained, by the above method, by K=Kmax1, Firstly, the target base map selection strategy is determined as the third base map selection strategy. Then, in the third base map selection strategy, the base graph #1 is determined as the target base map of the compiled data due to Rmin1≤R≤Rmax1. .

After determining the target base map selection strategy as the third base map selection strategy, if Rmin2≤R<Rmin1, base graph#1 does not support any encoding parameter of R<Rmin1, base graph#1 and # cannot be used in this range. 2 Direct encoding, so it will be encoded according to the use of base graph #2. Since the maximum information length supported by base graph #2 is Kmax2, but at this time K>Kmax2, there is a contradiction. That is, when base graph #1 does not support direct encoding of any K and R combinations in the range of Kmax2 ≤ K ≤ Kmax and Rmin2 ≤ R < Rmin1, the targets K and R will not appear in this range.

After determining the target base map, the method of the embodiment of the present disclosure further includes: generating a check matrix of the compiled data according to the target base map, the target information length, and the target encoding code rate.

In order to compile the data to be compiled, a check matrix needs to be generated. Here, after determining the target base map in step 103, the school will be produced based on the target base map and parameters (ie, target information length and target code rate). Check the matrix.

The target coding rate is equal to the channel coding rate.

The target information length is adapted to the above method to explicitly select the base map required for the compiled code. When Kmin2≤K<Kmin1, Rmax2<R≤Rmax1, the target information length is to increase the length of the data information by Kmin1- K is obtained after zero; otherwise, the target information length is equal to the length of the data information; wherein K represents the length of the data information, Kmin1 represents the first minimum information length of the first map in the base map, and Kmin2 represents a second minimum information length of the second figure in the base map, R represents the channel coding rate, Rmax1 represents a first maximum coding rate of the first picture, and Rmax2 represents a second maximum of the second picture Code rate.

Here, when Kmin2 ≤ K < Kmin1, Rmax2 < R ≤ Rmax1, the new information length obtained by increasing the length of the data information by Kmin1-K zeros is used as the target information length for the generation of the check matrix. In other cases, the length of the obtained data information can be directly used as the target information length.

Continuing the range of the information length and the code rate supported by the first picture and the second picture in the above example, when K=500, R=5/6 corresponding to the data to be compiled is obtained, the first picture is determined as the target base picture. The data information length K is zero-padded, supplemented by Kmin1-K=5012-500=12 zeros, and the new information length obtained after zero is used as the target information length for the generation of the check matrix.

In summary, the method of the embodiment of the present disclosure first obtains the data information length and the channel coding rate of the compiled data to be compiled, and then determines an appropriate target according to the length of the data information and the information length range of the base map. The base map selection strategy is further determined according to the target base map selection strategy and the channel coding rate, and finally the target base map of the compiled data is finally determined. It is avoided that the information length and coding rate supported by the base graph cannot be covered, or when the combination of overlapping data information length and channel coding rate is overwritten, the target base graph that needs to be used cannot be clarified, and the situation is more effectively determined. The target base graph.

As shown in FIG. 4, an embodiment of the present disclosure further provides a base map selecting apparatus for a low density parity check code, including: an obtaining module 401, a first determining module 402, and a second determining module 403.

The obtaining module 401 is configured to obtain a data information length and a channel coding rate of the data to be compiled. The first determining module 402 is configured to determine a target base map selection policy according to the length of the data information and the information length range of the base map. The second determining module 403 is configured to determine a target base map of the current compiled data according to the target base map selection policy and the channel coding rate.

Optionally, the first determining module 402 includes a first acquiring submodule, configured to acquire a first minimum information length Kmin1 and a first maximum information length Kmax1 of the first image in the base map, and a second acquiring submodule, a second minimum information length Kmin2 and a second maximum information length Kmax2 for acquiring the second map in the base map; a first determining submodule, configured to use the length of the data information K and the first minimum information length, A size relationship between the first maximum information length, the second minimum information length, and the second maximum information length determines a target base map selection strategy; wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.

Optionally, the first determining submodule includes: a first determining unit, configured to determine, when Kmin2≤K<Kmin1, that the target base map selection policy is a first base map selection policy; When Kmin1≤K≤Kmax2, determining that the target base map selection strategy is a second base map selection strategy; and a third determining unit, configured to determine the target base map selection strategy as Kmax2<K≤Kmax1 Three basic map selection strategies.

Optionally, the second determining module 403 includes: a third acquiring submodule, configured to acquire a first minimum encoding bit rate Rmin1 and a first maximum encoding bit rate Rmax1 of the first image in the base map; a submodule, configured to acquire a second minimum coding rate Rmin2 and a second maximum coding rate Rmax2 of the second picture in the base picture; and a comparison submodule, configured to compare the channel coding rate R with the first minimum coding a comparison between a code rate, the first maximum coding rate, the second minimum coding rate, and the second maximum coding rate to obtain a comparison result; and a second determining submodule for Determining the target base map, wherein Rmin2 < Rmin1 < Rmax2 < Rmax1.

Optionally, the device further includes a generating module, configured to generate a check matrix of the current compiled data according to the target base map, the target information length, and the target encoding code rate.

The apparatus of the embodiment of the present disclosure first obtains the data information length and the channel coding rate of the compiled data to be compiled, and then determines an appropriate target base map selection strategy according to the length of the data information and the information length range of the base map. Then, according to the target base map selection strategy and the channel coding rate, the target base map of the compiled data is finally determined. It is avoided that the information length and coding rate supported by the base graph cannot be covered, or when the combination of overlapping data information length and channel coding rate is overwritten, the target base graph that needs to be used cannot be clarified, and the situation is more effectively determined. The target base graph.

It should be noted that the device is a device for applying the base map selection method of the low-density parity check code described above, and the implementation manner of the foregoing method embodiment is applicable to the device, and the same technical effect can be achieved.

An embodiment of the present disclosure further provides a non-transitory computer readable storage medium having stored thereon a computer program (instruction), the program (instruction) being executed by a processor to implement the following steps: acquiring data of data to be compiled Information length and channel coding rate; determining a target base map selection strategy according to the length of the data information and the information length range of the base map; determining the compiled data according to the target base map selection policy and the channel coding rate The target base map.

Optionally, when the program (instruction) is executed by the processor, the following steps may be further: acquiring a first minimum information length Kmin1 and a first maximum information length Kmax1 of the first image in the base map; acquiring the basic image a second minimum information length Kmin2 and a second maximum information length Kmax2 of the second figure; and the first minimum information length, the first maximum information length, the second minimum information length, and the The size relationship between the second maximum information lengths determines a target base map selection strategy; wherein Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.

Optionally, when the program (instruction) is executed by the processor, the following steps may be further implemented: when Kmin2≤K<Kmin1, determining that the target base map selection strategy is the first base map selection strategy; at Kmin1≤K≤Kmax2 And determining that the target base map selection policy is a second base map selection strategy; when Kmax2<K≤Kmax1, determining that the target base map selection strategy is a third base map selection strategy.

Optionally, when the program (instruction) is executed by the processor, the following steps may be further: acquiring a first minimum coding rate Rmin1 and a first maximum coding rate Rmax1 of the first picture in the base picture; acquiring the basic a second minimum coding rate Rmin2 and a second maximum coding rate Rmax2 of the second picture in the figure; comparing the channel coding rate R with the first minimum coding rate, the first maximum coding rate, the first a comparison between a minimum coding rate and a second maximum coding rate to obtain a comparison result; determining the target base map based on the target base map selection strategy and the comparison result; wherein, Rmin2<Rmin1 <Rmax2<Rmax1.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection policy is the first base map selection policy, if Rmin2≤R≤Rmax2, select the second The figure serves as the target base map.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection policy is the first base map selection policy, if the Rmax2<R≤Rmax1, the first The figure shows the target base map.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection strategy is the second base map selection strategy, and when Kmin1=Kmax2, if Rmin2≤R≤Rmax2, then The second map is selected as the target base map.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection policy is the second base map selection strategy, and Kmin1=Kmax2, if Rmax2<R≤Rmax1, The first map is selected as the target base map.

Optionally, when the program (instruction) is executed by the processor, the following steps may be further implemented: when the target base map selection policy is the second base map selection strategy, and when Kmin1<Kmax2, if Rmin2≤R<Rmin1, then The second map is selected as the target base map.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection policy is the second base map selection strategy, and when Kmin1<Kmax2, if Rmax2≤R≤Rmax1, then The first map is selected as the target base map.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection policy is a second base map selection strategy, and when Kmin1<Kmax2, if Rmin1≤R<Rmax2, then Determining a preset information length value K0 and a preset encoding code rate value R0 according to the error block performance of the target base map and the delay performance affected by the lifting parameter, and the data information length and the preset information length value K0, The channel coding rate is compared with the preset coding rate value R0. When K0≤K<Kmax2 and R0≤R<Rmax2, the first picture is selected as the target base picture, where K<K0 or R< At R0, the second map is selected as the target base map.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection policy is the third base map selection policy, if Rmin2≤R<Rmin1, and the first map In the case where K/R ≤ Nmax, encoding using K smaller than Kmax1 and R smaller than Rmin1 is supported, the first map is selected as the target base map; where Nmax = Kmax1/Rmin1.

Optionally, when the program (instruction) is executed by the processor, the following step may be further implemented: when the target base map selection policy is the third base map selection strategy, if Rmin1≤R≤Rmax1, the first The figure serves as the target base map.

Optionally, when the program (instruction) is executed by the processor, the following steps may be further implemented: generating a check matrix of the compiled data according to the target base map, the target information length, and the target encoding code rate.

Optionally, the target coding code rate is equal to the channel coding code rate.

Non-transitory computer readable media, including both permanent and non-persistent, removable and non-removable media, can be stored by any method or technology. The information can be computer readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory. (ROM), electrically erasable programmable read only memory (EEPROM), flash memory or other memory technology, compact disk read only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, Magnetic tape cartridges, magnetic tape storage or other magnetic storage devices or any other non-transportable media can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary storage of computer readable media, such as modulated data signals and carrier waves.

As shown in FIG. 5, an embodiment of the present disclosure further provides a data compiling device (mobile terminal or base station), including: a processor 500, configured to read a program in the memory 520, and execute the following process: acquiring data to be compiled Data data length and channel coding rate; determining a target base map selection strategy according to the length of the data information and the information length range of the base map; determining the current base map selection policy and the channel coding rate according to the target base map selection strategy The target base map for compiling the data.

The transceiver 510 is configured to receive and transmit data under the control of the processor 500.

In FIG. 5, the bus architecture can include any number of interconnected buses and bridges, specifically linked by one or more processors represented by processor 500 and various circuits of memory represented by memory 520. The bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein. The bus interface provides an interface. Transceiver 510 can be a plurality of components, including a transmitter and a transceiver, providing means for communicating with various other devices on a transmission medium. The processor 500 is responsible for managing the bus architecture and general processing, and the memory 520 can store data used by the processor 500 when performing operations.

Optionally, the processor 500 is further configured to: acquire a first minimum information length Kmin1 and a first maximum information length Kmax1 of the first image in the base map; and acquire a second minimum information length of the second image in the basic image. Kmin2 and a second maximum information length Kmax2; a size between the length of the data information K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length Relationship, determining a target base map selection strategy; wherein, Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.

Optionally, the processor 500 is further configured to: when Kmin2≤K<Kmin1, determine that the target base map selection policy is a first base map selection strategy; and when Kmin1≤K≤Kmax2, determine the target base map selection. The strategy is a second base map selection strategy; when Kmax2<K≤Kmax1, the target base map selection strategy is determined to be a third base map selection strategy.

Optionally, the processor 500 is further configured to: acquire a first minimum coding rate Rmin1 and a first maximum coding rate Rmax1 of the first picture in the base map; and acquire a second minimum of the second picture in the basic picture. a coding rate Rmin2 and a second maximum coding rate Rmax2; comparing a channel coding rate R with the first minimum coding rate, the first maximum coding rate, the second minimum coding rate, and the And a size between the two maximum code rates, a comparison result is obtained; and the target base map is determined based on the target base map selection strategy and the comparison result; wherein, Rmin2<Rmin1<Rmax2<Rmax1.

Optionally, the processor 500 is further configured to: when the target base map selection policy is the first base map selection policy, if Rmin2≤R≤Rmax2, select the second map as the target base map.

Optionally, the processor 500 is further configured to: when the target base map selection policy is the first base map selection policy, if the Rmax2<R≤Rmax1, select the first map as the target base map.

Optionally, the processor 500 is further configured to: when the target base map selection policy is the second base map selection policy, and when Kmin1=Kmax2, if Rmin2≤R≤Rmax2, select the second map as the Target base map.

Optionally, the processor 500 is further configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1=Kmax2, if Rmax2<R≤Rmax1, select the first map as the target basis. Figure.

Optionally, the processor 500 is further configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1<Kmax2, if Rmin2≤R<Rmin1, select the second map as the Target base map.

Optionally, the processor 500 is further configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1<Kmax2, if Rmax2≤R≤Rmax1, select the first map as the Target base map.

Optionally, the processor 500 is further configured to: when the target base map selection policy is a second base map selection policy, and when Kmin1<Kmax2, if Rmin1≤R<Rmax2, according to the error block of the target base map The performance and the delay performance affected by the lifting parameter determine a preset information length value K0, a preset encoding rate value R0, the data information length and a preset information length value K0, the channel encoding rate and a preset encoding The code rate values R0 are respectively compared. When K0≤K<Kmax2 and R0≤R<Rmax2, the first map is selected as the target base map, and when K<K0 or R<R0, the second map is selected. As the target base map.

Optionally, the processor 500 is further configured to: when the target base map selection policy is the third base map selection policy, if Rmin2≤R<Rmin1, and the first map is in the case of K/R≤Nmax Supporting encoding using K smaller than Kmax1 and R smaller than Rmin1, the first map is selected as the target base map; wherein Nmax=Kmax1/Rmin1.

Optionally, the processor 500 is further configured to: when the target base map selection policy is a third base map selection policy, if Rmin1≤R≤Rmax1, select the first map as the target base map.

Optionally, the processor 500 is further configured to: generate a check matrix of the compiled data according to the target base map, the target information length, and the target encoding code rate.

It should be further noted that the mobile terminals described in this specification include, but are not limited to, smartphones, tablets, etc., and many of the functional components described are referred to as modules to more particularly emphasize the independence of their implementation.

In embodiments of the present disclosure, modules may be implemented in software for execution by various types of processors. For example, an identified executable code module can comprise one or more physical or logical blocks of computer instructions, which can be constructed, for example, as an object, procedure, or function. Nonetheless, the executable code of the identified modules need not be physically located together, but may include different instructions stored in different bits that, when logically combined, constitute a module and implement the provisions of the module. purpose.

In practice, the executable code module can be a single instruction or a plurality of instructions, and can even be distributed across multiple different code segments, distributed among different programs, and distributed across multiple memory devices. As such, operational data may be identified within the modules and may be implemented in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed at different locations (including on different storage devices), and may at least partially exist as an electronic signal on a system or network.

When the module can be implemented by software, considering the level of the related hardware process, the module can be implemented in software, and the technician can construct the corresponding hardware circuit to realize the corresponding function without considering the cost. The hardware circuits include conventional Very Large Scale Integration (VLSI) circuits or gate arrays and related semiconductors such as logic chips, transistors, or other discrete components. The modules can also be implemented with programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, and the like.

The above-described exemplary embodiments are described with reference to the drawings, and the various embodiments and embodiments of the present invention are not to be limits. Rather, these exemplary embodiments are provided so that this disclosure will be thorough and complete, and the scope of the disclosure will be disclosed to those skilled in the art. In these figures, component dimensions and relative dimensions may be exaggerated for clarity. The terminology used herein is for the purpose of describing the particular embodiments of the embodiments The singular forms "a", "the", and "the" It will be further understood that the terms "comprises" and/or "comprises", when used in the specification, mean the presence of the features, integers, steps, operations, components and/or components, but does not exclude one or more The presence or addition of features, integers, steps, operations, components, components, and/or their ethnic groups. Unless stated otherwise, a range of values includes the upper and lower limits of the range and any subranges in between.

The above is an alternative embodiment of the present disclosure, and it should be noted that those skilled in the art can also make several improvements and retouchings without departing from the principles of the present disclosure. It should also be considered as the scope of protection of the present disclosure.

Claims

A basic map selection method for a low density parity check code, comprising:

Obtaining a data information length and a channel coding rate of the data to be compiled;

Determining a target base map selection strategy according to the length of the data information and the information length range of the base map;

Determining a target base map of the compiled data according to the target base map selection strategy and the channel coding rate.
The method of selecting a base map selection method for a low density parity check code according to claim 1, wherein the step of determining a target base map selection policy according to the length of the data information and the information length range of the base map comprises:

Obtaining a first minimum information length Kmin1 and a first maximum information length Kmax1 of the first figure in the base map;

Obtaining a second minimum information length Kmin2 and a second maximum information length Kmax2 of the second figure in the base map;

Determining a target base map selection policy according to a size relationship between the data information length K and the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length; Where Kmin2<Kmin1≤Kmax2<Kmax1.
The base map selection method of a low density parity check code according to claim 2, wherein said according to said data information length K and said first minimum information length, said first maximum information length, said second minimum The step of determining a target base map selection policy by the relationship between the length of the information and the second maximum information length includes:

When Kmin2≤K<Kmin1, determining that the target base map selection strategy is a first base map selection strategy;

Determining, when Kmin1≤K≤Kmax2, the target base map selection strategy is a second base map selection strategy;

When Kmax2<K≤Kmax1, it is determined that the target base map selection strategy is a third base map selection strategy.
The base map selection method of a low density parity check code according to claim 3, wherein said step of determining a target base map of the current compiled data according to said target base map selection strategy and said channel coding rate ,include:

Obtaining a first minimum coding rate Rmin1 and a first maximum coding rate Rmax1 of the first picture in the base picture;

Obtaining a second minimum coding rate Rmin2 and a second maximum coding rate Rmax2 of the second picture in the base picture;

Comparing the channel coding rate R with the first minimum coding rate, the first maximum coding rate, the second minimum coding rate, and the second maximum coding rate to obtain a comparison Result;

Determining the target base map based on the target base map selection strategy and the comparison result; wherein, Rmin2 < Rmin1 < Rmax2 < Rmax1.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the first base map selection strategy, if Rmin2≤R≤Rmax2, the second map is selected as the target base map.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the first base map selection strategy, if Rmax2 < R ≤ Rmax1, the first map is selected as the target base map.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the second base map selection strategy, and Kmin1=Kmax2, if Rmin2≤R≤Rmax2, the second map is selected as the target base map.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the second base map selection strategy, and Kmin1=Kmax2, if Rmax2<R≤Rmax1, the first map is selected as the target base map.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the second base map selection strategy, and Kmin1<Kmax2, if Rmin2≤R<Rmin1, the second map is selected as the target base map.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the second base map selection strategy, and Kmin1<Kmax2, if Rmax2≤R≤Rmax1, the first map is selected as the target base map.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the second base map selection strategy, and Kmin1<Kmax2, if Rmin1≤R<Rmax2, determining according to the error block performance of the target base map and the delay performance affected by the lifting parameter Presetting the information length value K0 and the preset encoding code rate value R0, comparing the data information length with the preset information length value K0, the channel coding rate and the preset coding rate value R0, respectively, at K0≤K When <Kmax2 and R0≤R<Rmax2, the first map is selected as the target base map, and when K<K0 or R<R0, the second map is selected as the target base map.
The method of selecting a base map of a low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the third base map selection strategy, if Rmin2≤R<Rmin1, and the first map is in the case of K/R≤Nmax, it is supported to use K less than Kmax1 and less than Rmin1. R is encoded, and the first map is selected as the target base map; wherein Nmax=Kmax1/Rmin1.
The base map selection method of the low density parity check code according to claim 4, wherein the step of determining the target base map based on the target base map selection policy and the comparison result comprises:

When the target base map selection strategy is the third base map selection strategy, if Rmin1≤R≤Rmax1, the first map is selected as the target base map.
The base map selection method of the low density parity check code according to claim 1, wherein after the step of determining the target base map of the compiled data, the method further comprises:

A check matrix of the current compiled data is generated according to the target base map, the target information length, and the target encoding code rate.
The base map selection method of a low density parity check code according to claim 14, wherein when Kmin2 ≤ K < Kmin1, Rmax2 < R ≤ Rmax1, the target information length is to increase the length of the data information by Kmin1 K is obtained after zero; otherwise, the length of the target information is equal to the length of the data information;

K represents the length of the data information, Kmin1 represents the first minimum information length of the first picture in the base map, Kmin2 represents the second minimum information length of the second picture in the base picture, and R represents the channel coding rate Rmax1 represents the first maximum coding rate of the first picture, and Rmax2 represents the second maximum coding rate of the second picture.
The base map selection method of a low density parity check code according to claim 14, wherein said target encoding code rate is equal to said channel coding rate.
A basic map selection device for a low density parity check code, comprising:

An obtaining module, configured to obtain a data information length and a channel coding rate of the data to be compiled;

a first determining module, configured to determine a target base map selection policy according to the length of the data information and the information length range of the base map;

And a second determining module, configured to determine a target base map of the current compiled data according to the target base map selection policy and the channel coding rate.
The base map selection device of the low density parity check code according to claim 17, wherein the first determining module comprises:

a first obtaining submodule, configured to acquire a first minimum information length Kmin1 and a first maximum information length Kmax1 of the first image in the base map;

a second obtaining submodule, configured to acquire a second minimum information length Kmin2 and a second maximum information length Kmax2 of the second graph in the base map;

a first determining submodule, configured to determine, according to a length information K, a size relationship between the first minimum information length, the first maximum information length, the second minimum information length, and the second maximum information length , determining a target base map selection strategy; wherein, Kmin2 < Kmin1 ≤ Kmax2 < Kmax1.
The base map selection device of the low density parity check code according to claim 18, wherein the first determining submodule comprises:

a first determining unit, configured to determine, when Kmin2≤K<Kmin1, the target base map selection policy as a first base map selection strategy;

a second determining unit, configured to determine, when Kmin1≤K≤Kmax2, the target base map selection policy as a second base map selection strategy;

And a third determining unit, configured to determine that the target base map selection policy is a third base map selection policy when Kmax2<K≤Kmax1.
The base map selecting apparatus of the low density parity check code according to claim 19, wherein the second determining module comprises:

a third obtaining submodule, configured to obtain a first minimum encoding bit rate Rmin1 and a first maximum encoding bit rate Rmax1 of the first picture in the base picture;

a fourth obtaining submodule, configured to obtain a second minimum encoding rate Rmin2 and a second maximum encoding rate Rmax2 of the second picture in the base map;

a comparison submodule for comparing a channel coding code rate R with the first minimum coding rate, the first maximum coding rate, the second minimum coding rate, and the second maximum coding rate Size, get a comparison result; and

a second determining submodule, configured to determine the target base map based on the target base map selection policy and the comparison result; wherein, Rmin2<Rmin1<Rmax2<Rmax1.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

a first selecting unit, configured to select the second map as the target base map if the target base map selection policy is the first base map selection policy, if Rmin2≤R≤Rmax2.
The base map selection device of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

And a second selecting unit, configured to: when the target base map selection policy is the first base map selection policy, if the Rmax2<R≤Rmax1, select the first map as the target base map.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

And a third selecting unit, configured to select the second map as the target base map if the target base map selection policy is the second base map selection strategy, and when Kmin1=Kmax2, if Rmin2≤R≤Rmax2.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

And a third selection unit, configured to select the first map as the target base map if the target base map selection policy is the second base map selection strategy, and when Kmin1=Kmax2, if Rmax2<R≤Rmax1.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

And a fourth selecting unit, configured to select the second map as the target base map if the target base map selection policy is the second base map selection policy, and when Kmin1<Kmax2, if Rmin2≤R<Rmin1.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

And a fifth selection unit, when the target base map selection strategy is the second base map selection strategy, and when Kmin1<Kmax2, if Rmax2≤R≤Rmax1, the first map is selected as the target base map.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

a sixth selecting unit, configured to: when the target base map selection strategy is a second base map selection strategy, and when Kmin1<Kmax2, if Rmin1≤R<Rmax2, according to the error block performance of the target base map and the improvement thereof The delay performance affected by the parameter determines a preset information length value K0, a preset encoding code rate value R0, and the data information length and the preset information length value K0, the channel coding rate and the preset coding rate value R0. Comparing, respectively, when K0 ≤ K < Kmax2 and R0 ≤ R < Rmax2, the first map is selected as the target base map, and when K < K0 or R < R0, the second map is selected as the target Foundation drawing.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

a seventh selecting unit, configured to: when the target base map selection policy is the third base map selection strategy, if Rmin2≤R<Rmin1, and the first map is in the case of K/R≤Nmax, the support is smaller than K of Kmax1 and R of Rmin1 are encoded, and the first map is selected as the target base map; wherein Nmax=Kmax1/Rmin1.
The base map selecting apparatus of the low density parity check code according to claim 20, wherein the second determining submodule comprises:

And an eighth selection unit, configured to: when the target base map selection policy is a third base map selection strategy, if Rmin1≤R≤Rmax1, select the first map as the target base map.
The base map selection device of the low density parity check code according to claim 17, further comprising:

And a generating module, configured to generate a check matrix of the compiled data according to the target base map, the target information length, and the target encoding code rate.
The base map selecting apparatus for low-density parity check code according to claim 30, wherein when Kmin2 ≤ K < Kmin1, Rmax2 < R ≤ Rmax1, the target information length is to increase the length of the data information by Kmin1- K is obtained after zero; otherwise, the length of the target information is equal to the length of the data information;

K represents the length of the data information, Kmin1 represents the first minimum information length of the first picture in the base map, Kmin2 represents the second minimum information length of the second picture in the base picture, and R represents the channel coding rate Rmax1 represents the first maximum coding rate of the first picture, and Rmax2 represents the second maximum coding rate of the second picture.
The base map selecting apparatus for low density parity check code according to claim 30, wherein said target encoding code rate is equal to said channel encoding code rate.
A basic map selection device for a low density parity check code, comprising:

a processor, a memory and a bus interface, wherein the bus interface is for connecting the processor and the memory, the memory is for storing programs and data, and the processor is for reading a program stored in the memory And data to control the apparatus to perform the method of any of claims 1-16.
A non-transitory computer readable storage medium comprising:

Programs and instructions stored on the non-transitory computer readable storage medium,

Where the program and instructions are executed by a processor of a computer, the processor implements the method of any of claims 1-16.