Use of LDPC base map for nr
By determining the number of parity bits based on the linear error correction code basic diagram and the number of information bits in a 5G network, and using different LDPC basic diagrams, channel encoding is optimized, the problem of large CRC overhead is solved, and spectral efficiency and performance are improved.
Patent Information
- Application Number
- CN202411201388.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2017-08-18
- Publication Date
- 2024-11-22
AI Technical Summary
In 5G networks, it is difficult for the prior art to effectively optimize channel encoding, especially when using LDPC basic graphs, resulting in excessive CRC overhead, affecting spectral efficiency and performance.
When generating code blocks, the number of parity bits is determined based on the applied linear error correction code basic graph and the number of information bits, and different LDPC basic graphs are used to optimize the encoding, reducing CRC overhead, while maintaining error detection capabilities.
It improves the performance and spectrum efficiency of the channel, reduces CRC overhead, adapts to the implementation capabilities of different UEs, and ensures channel coding optimization in 5G networks.
Smart Images

Figure CN119010921A_ABST
Abstract
Description
[0001] This application is a divisional application of an invention patent application with an application date of August 18, 2017, application number 2017800940339, and invention name “USE OF LDPC BASE MAP FOR NR”. Technical Field
[0002] The present invention relates to apparatus, methods and computer program products related to using an LDPC base graph in a network, such as a NR network. Background Art
[0003] The following meanings of abbreviations used in this specification apply:
[0004] 3GPP Third Generation Partnership Project
[0005] 5G Fifth Generation
[0006] BG basic diagram
[0007] CB Code Block
[0008] CBG Code Block Group
[0009] CBS code block size
[0010] CRC Cyclic Redundancy Check
[0011] GF(2) Galois Field(2)
[0012] gNB 5G base station
[0013] FFS needs further study
[0014] LDPC Low-density parity check
[0015] LTE Long Term Evolution
[0016] MCS Modulation and Coding Scheme
[0017] NR New Radio
[0018] PC Polar Code
[0019] PCM Parity Check Matrix
[0020] TB Transport Block
[0021] TBS Transport Block Size
[0022] UE User Equipment
[0023] URLLC ultra-reliable and low-latency communications
[0024] Embodiments of the present invention relate to channel coding optimization in networks such as 5G, but are not limited thereto. In the following, some considerations on CRC attachment for smaller TBs are given by referring to reference [1]: R1-1711533 "CRC attachment for Smaller TBs" Nokia, Alcatel-Lucent Shanghai Bell.
[0025] In the Ran1 NR Ad-Hoc#2 meeting, two LDPC basemaps were agreed to support data channels in 5G. Their usage was agreed to be as follows.
[0026] protocol :
[0027] Basemap #1 is used for initial transmission and subsequent retransmissions of the same TB in the following situations:
[0028] –CBS>X or initial transmission code rate>Y
[0029] Base diagram #2 is used for initial transmission and subsequent retransmission of the same TB in the following cases:
[0030] – CBS <= X and initial transmission code rate <= Y
[0031] Working hypothesis: X = 2560 and Y = 0.67
[0032] – After PCM decides whether X can be expanded to 3840 and / or Y can be expanded to 0.75, for further study
[0033] It will be examined how the receiver knows the code rate of the initial transmission in each case and how it is precisely defined.
[0034] Whether some UE capabilities may not require the implementation of two base graphs is for further study.
[0035] For CRC attachment, LDPC codes have inherent error detection capabilities and can be used to reduce CRC overhead. In the Ran1#88bis meeting, an agreement was reached to attach 24 CRC bits to the TB when the TB is larger than a threshold. However, the threshold was not agreed upon. In particular, the agreement in Ran1#88bis was that
[0036] protocol :
[0037] At least for TBs larger than a threshold (e.g., about 512 bits), the number of bits of the TB-level CRC is: L TB,CRC =24 bits
[0038] L for TB less than the threshold TB,CRC The value of the threshold (not excluding 0) is subject to further discussion.
[0039] After code block (CB) segmentation, if a TB is segmented into 2 or more CBs, then:
[0040] – CB level CRC is applied, i.e. CRC bits are attached to each code block individually (as in LTE)
[0041] –The number of bits of CB level CRC is: 0 <L CB,CRC <=24 bits
[0042] Once the base graph is agreed upon, the exact L(s) will be agreed upon, taking into account the inherent LDPC PC capabilities. CB,CRC
[0043] For a code block group (CBG) of all CBs containing 2 or more CBs but not TBs,
[0044] Whether to append any additional CRC bits to the CBG is for further discussion
[0045] – will be in (multiple) L CB,CRC The value of
[0046] On the MCS table, LTE uses 5 bits to indicate the MCS in the control payload. All of these will use Turbo codes and are independent of the use of the MCS table and coding scheme. For NR, how to utilize this MCS field requires more discussion because the base map used can be different.
[0047] To optimize performance, the use of two basis maps must be considered when defining other details of NR. Summary of the invention
[0048] Embodiments of the present invention address this situation and aim to overcome the above-mentioned problems, as well as optimize the performance on the coded channel.
[0049] According to a first aspect of the present invention, a device is provided, which includes at least one processor, at least one memory including computer program code, and the at least one processor is arranged together with the at least one memory and the computer program code to cause the device to at least perform: generate a code block, the code block including information bits and parity bits, the parity bits being generated by performing a cyclic redundancy check on the information bits; determine the number of parity bits used in generating the code block based on an applied linear error correction code base graph and / or based on the number of information bits; and encode the code block by using the applied linear error correction code base graph.
[0050] According to a second aspect of the present invention, there is provided a method, the method comprising:
[0051] generating a code block, the code block comprising information bits and parity check bits, the parity check bits being generated by performing a cyclic redundancy check on the information bits,
[0052] determining the number of parity check bits used when generating the code block based on the applied linear error correction code base map and / or based on the number of information bits, and
[0053] The code blocks are encoded by using an applied linear error correction code basis graph.
[0054] The first and second aspects may be modified as follows:
[0055] For example, the number of parity bits used in generating a code block may be determined based on a comparison of the number of information bits to a threshold, where the threshold may be defined by the maximum code block size supported by the applied linear error correction code base graph.
[0056] The applied linear error correction code base graph can be selected from a first linear error correction code base graph and a second linear error correction code base graph, wherein the number of parity check bits used in generating a code block for the second linear error correction code base graph can be smaller than the number of parity check bits used in generating a code block for the first linear error correction code base graph.
[0057] The applied linear error correction code basis map may be selected from the first linear error correction code basis map and the second linear error correction code basis map based on the number of information bits.
[0058] The information bits may be included in the transport block, and segmentation of the transport block size may not be applied when the second linear error correction code base map is used.
[0059] Information bits may be included in a transport block, and when a second linear error correction code base graph is used, segmenting the transport block into at least two code blocks may be performed, wherein in this case, the same number of parity bits may be used for each code block as when segmentation is not applied.
[0060] The number of parity check bits for the first linear error correction code base graph may be 24, and / or the number of parity check bits for the second linear error correction code base graph may be 16.
[0061] When determining the number of parity bits used in a generated code block based on an applied linear error correction code base graph, a modulation and coding scheme table based on the applied linear error correction code base graph may be referenced.
[0062] A modulation and coding scheme table for providing information about a modulation and coding scheme may be referenced, wherein the table specifies information about a modulation and coding scheme including a nested structure, wherein different modulation and coding schemes are referenced by corresponding indexes, wherein the index consists of a plurality of bits, and an index indicating a modulation and coding scheme related to a second linear error correction code base diagram is indicated by a number of bits that is less than the number of index bits indicating a modulation and coding scheme related to a first linear error correction code base diagram.
[0063] When the number of bits used to indicate the index of the modulation and coding scheme related to the second linear error correction code basis diagram is defined as Y, and the number of bits used to indicate the index of the modulation and coding scheme related to the first linear error correction code basis diagram is defined as X, the first XY leading bit in the index indicating the modulation and coding scheme related to the second linear error correction code basis diagram can be set to 0.
[0064] The linear error correction code may include an LDPC (Low Density Parity Check) code and / or a polar code.
[0065] According to a third aspect of the present invention, a device is provided, which includes at least one processor, at least one memory including computer program code, and the at least one processor is arranged together with the at least one memory and the computer program code to cause the device to at least perform: providing a modulation and coding scheme table, the modulation and coding scheme table including information about the modulation and coding scheme, wherein the table specifies information about the modulation and coding scheme including a nested structure, wherein different modulation and coding schemes are referenced by corresponding indexes, wherein the index consists of multiple bits, and the index indicating the modulation and coding scheme related to the second linear error correction code base diagram is indicated by a number of bits, which is less than the number of index bits indicating the modulation and coding scheme related to the first linear error correction code base diagram.
[0066] According to a fourth aspect of the present invention, there is provided a method, the method comprising:
[0067] providing a modulation and coding scheme table including information about the modulation and coding scheme,
[0068] wherein the table specifies information about modulation and coding schemes including a nested structure, wherein different modulation and coding schemes are referenced by corresponding indexes, wherein the indexes consist of a plurality of bits, and the index indicating the modulation and coding scheme associated with the second linear error correction code basis graph is indicated by a number of bits that is less than the number of bits of the index indicating the modulation and coding scheme associated with the first linear error correction code basis graph.
[0069] The third and fourth aspects can be modified as follows:
[0070] When the number of bits used to indicate the index of the modulation and coding scheme related to the second linear error correction code basis diagram is defined as Y, and the number of bits used to indicate the index of the modulation and coding scheme related to the first linear error correction code basis diagram is defined as X, the first XY leading bit in the index indicating the modulation and coding scheme related to the second linear error correction code basis diagram can be set to 0.
[0071] The linear error correction code may include an LDPC (Low Density Parity Check) code and / or a polar code.
[0072] According to a fifth aspect of the present invention, a computer program product is provided, the computer program product comprising code means for executing the method according to the second aspect and / or the fourth aspect when running on a processing means or module. The computer program product can be implemented on a computer readable medium, and / or the computer program product can be directly loaded into the internal memory of the computer and / or can be transmitted via a network by at least one of uploading, downloading and pushing processes.
[0073] According to a sixth aspect of the present invention, there is provided a device, the device comprising:
[0074] means for generating a code block including information bits and parity check bits, the parity check bits being generated by performing a cyclic redundancy check on the information bits,
[0075] means for determining the number of parity check bits used when generating a code block based on an applied linear error correction code base map and / or based on the number of information bits, and
[0076] Means for encoding a code block by using an applied linear error correction code basis graph.
[0077] According to a seventh aspect of the present invention, there is provided a device comprising
[0078] means for providing a modulation and coding scheme table comprising information about the modulation and coding scheme,
[0079] wherein the table specifies information about modulation and coding schemes including a nested structure, wherein different modulation and coding schemes are referenced by corresponding indexes, wherein the index consists of a plurality of bits, and an index indicating a modulation and coding scheme associated with a second linear error correction code basis graph is indicated by a number of bits that is less than the number of index bits indicating a modulation and coding scheme associated with a first linear error correction code basis graph. BRIEF DESCRIPTION OF THE DRAWINGS
[0080] These and other objects, features, details and advantages will become more apparent from the following detailed description of embodiments of the present invention taken in conjunction with the accompanying drawings, in which:
[0081] Figure 1A The diagram shows an apparatus according to an embodiment of the present invention.
[0082] Figure 1B The method according to an embodiment of the present invention is illustrated.
[0083] Figure 2 shows a nested MCS table for basic paragraph #2 according to an embodiment of the present invention, and
[0084] Figure 3 Examples of 4-bit MCS and 5-bit MCS tables according to an embodiment of the present invention are shown. DETAILED DESCRIPTION
[0085] Hereinafter, embodiments of the present invention will be described. However, it should be understood that the description is given only by way of example, and the described embodiments should by no means be understood to limit the present invention thereto.
[0086] In the following, some issues related to the inventor's CRC attachment and generating the MCS table for NR are described.
[0087] Regarding CRC attachment, it should be noted that typically most uplink and downlink traffic runs with smaller TB sizes and good performance is very important. Moreover, transmission resources are limited and the number of information bits and CRC bits determines the code rate of the transmission operation. Reducing the CRC overhead helps improve spectral efficiency and thereby improve performance, but should be done without sacrificing the error detection capability of the TB. LDPC codes can provide additional support for error detection, which can ultimately reduce the CRC overhead. In the above-mentioned reference [1], the impact of CRC bits on the effective code rate was studied, where it was found that the CRC bits changed significantly when the effective code rate increased to 1000 bits. However, it should be noted that some UEs may not implement two base graphs and have an arbitrary number because the threshold may cost the UE implementation cost. For example, if the UE only operates with base graph #2, the maximum TBS supported is 2560 bits (including CRC). Therefore, using approximately 1000 bits as a boundary creates the need to implement two CRC shift registers at the UE for the same base graph.
[0088] Regarding the MCS field, it should be noted that when finalizing the MCS table for NR, it is necessary to ensure that the two base maps #1 and #2 can operate independently of each other. For example, some UEs may only implement base map #2, and some UEs may only implement base map #1. It is foreseeable that ultra-reliable low-latency communications will use base map #2 and require good granularity in terms of spectral efficiency in the MCS table. Having a random MCS table without considering the use of the base map may lead to inefficient NR operation.
[0089] In the following, by reference Figure 1A and Figure 1B A general overview of embodiments of the present invention is described.
[0090] In particular, Figure 1A A UE or gNB 1 is shown as an example of a first apparatus according to the present embodiment. The apparatus 1 includes at least one processor 11 and at least one memory 12 including computer program code. The at least one processor 11 is arranged together with the at least one memory 12 and the computer program code to cause the apparatus to at least perform: generating a code block, the code block including information bits and parity check bits, the parity check bits being generated by performing a cyclic redundancy check on the information bits; determining the number of parity check bits used in generating the code block based on an applied linear error correction code base graph and / or based on the number of information bits; and encoding the code block by using the applied linear error correction code base graph.
[0091] In other words, by referring to Figure 1B The flowchart shown, that is, in step S1, the number of parity check bits used to generate the code block is determined based on the applied linear error correction code base map and / or based on the number of information bits. In step S2, the code block is generated, and in step S1, the code block is encoded using the linear error correction code base map.
[0092] For example, the linear error correction code may be an LDPC code.
[0093] Therefore, the number of parity bits used for CRC is different based on the applied LDPC base graph and / or the number of information bits. In this way, the performance of the channel can be optimized.
[0094] In addition, when determining the number of parity check bits used in a generated code block based on an applied linear error correction code (e.g., LDPC) base graph, an MCS table based on the base graph of the linear error correction code may be referenced. That is, for example, the MCS table may contain an indication of how many parity check bits should be used depending on the applied LDPC base graph.
[0095] The apparatus 1 may further comprise an input / output (I / O) unit or function (interface) 13 connected to the processor 11 in order to provide connection to other elements in a network, etc.
[0096] In addition, in the device 1, at least one processor 11 can, together with at least one memory and computer program code, cause the device to at least perform: provide an [MCS] table, the [MCS] table including modulation and coding schemes of information about modulation and coding schemes, wherein the table specifies information about modulation and coding schemes including a nested structure, wherein different modulation and coding schemes are referenced by corresponding indexes, wherein the index consists of multiple bits, and the index indicating the modulation and coding scheme related to the second linear error correction code base diagram is indicated by a number of bits, which is less than the number of index bits indicating the modulation and coding scheme related to the first linear error correction code base diagram.
[0097] It should be noted that the above process may also be performed by another device other than device 1 (i.e., another device other than UE or gNB).
[0098] Therefore, according to some embodiments of the present invention, CRC and MCS tables are considered for 5G LDPC codes. That is, depending on the selected base graph and / or the number of information bits, CRCs of different lengths are used. The second aspect considers the organization of the modulation and coding set (MCS). Here, the MCS is "nested", that is, the method is not continuous and may overlap. Therefore, according to an embodiment of the present invention, a method for defining a threshold value of a CRC length and an MCS table is provided.
[0099] In this way, performance can be optimized.
[0100] In the following, some more details of embodiments of the invention are described.
[0101] According to some embodiments of the present invention, the CRC attachment is different for different basemaps and it will be defined based on the TBS threshold.
[0102] When LDPC base graph #2 is used, TBS segmentation is not used.
[0103] The value of the threshold is defined by the maximum code block size supported by LDPC base graph #2. For example,
[0104] The value of the threshold may be 2560-L bits, where L is the CRC length.
[0105] - The CRC length for base map #2 will be smaller than the CRC length used above the threshold.
[0106] When the code rate is higher than the maximum value supported by base chart #2, the TBS below the threshold still uses a similar CRC length.
[0107] Furthermore, the MCS table will contain a nested structure that provides a good granularity for base map #1 and base map #2 to provide spectral efficiency.
[0108] · The X-bit MCS field is used to represent the complete MCS table, i.e., when using two base graphs.
[0109] · The Y < X-bit MCS field is used for base graph #2. Figure 2 An example is shown below.
[0110] · The system can only operate with a single base graph, in which it can use a smaller number of bits for the MCS field.
[0111] Some additional detailed embodiments are described below.
[0112] First, CRC attachment is described, where it is assumed that the maximum code block size supported by LDPC segment #2 is 2560.
[0113] In this example, the input bits for CRC calculation are represented by a0, a1, a2, a3,..., a A-1 and the parity check bits are represented by p0, p1, p2, p3,..., p L-1 where A is the size of the input sequence and L is the number of parity check bits. The parity check bits are generated by one of the following cyclic generator polynomials:
[0114] g CRC24A (D) = [D 24 + D 23 + D 18 + D 17 + D 14 + D 11 + D 10 + D 7 + D 6 + D 5 + D 4 + D 3 + D + 1] or
[0115] g CRC24B (D) = [D 24 + D 23 + D 6 + D 5 + D + 1]
[0116] g CRC16 (D) = [D 16 + D 12 + D 5 + 1]
[0117] Encoding is performed in systematic form, which means that in GF(2), the polynomial:
[0118] a0D A+L-1 + a1D A+L-2 +... + aA-1 D L +p0D L-1 +p1D L-2 +...+p L-2 D 1 +p L-1
[0119] When divided by the corresponding CRC generator polynomial, the remainder is 0.
[0120] The bits after CRC attachment are b0, b1, b2, b3, ..., b B-1 Indicates that B = A + L. k and b k The relationship between them is:
[0121] b k =a k For k = 0, 1, 2, ..., A-1
[0122] D k =p k-A For k=A, A+1, A++2,..., A+L-1.
[0123] If A is not greater than 2560-L1, a CRC sequence of L=L1 bits is attached to the TBS. For example, L1=16. Otherwise, a CRC sequence of L=24 bits is attached to the TBS.
[0124] In the following embodiments, more detailed examples regarding the MCS table are described.
[0125] The MCS table of URLLC or UE using BG#2 can use a 4-bit MCS index so that it is nested in a large MCS table. In this case, it may not be necessary to redefine the TBS size or retain the active table.
[0126] Figure 3 A corresponding example is shown, where the left part shows a 4-bit MCS table and the right part shows a 5-bit table. The 4-bit MCS table is nested within the 5-bit MCS table. Therefore, a UE (or gNB) that only supports BG#2 can reference the 4-bit MCS table within the 5-bit MCS table by setting the leading bit to zero.
[0127] The present invention is not limited to the specific embodiments described above, and various modifications are possible.
[0128] For example, in the above embodiments, specific numbers are given. However, the present invention is not limited thereto. That is, for example, the maximum code block size supported by LDPC base graph #2 is not limited to 2560, and can be any suitable number.
[0129] Furthermore, according to the above embodiment, the number of LDPC base graphs whose applied LDPC base graph is to be selected is two. However, the number may be higher.
[0130] Furthermore, in the above embodiments, LDPC codes are used for channel coding. However, the present invention is not limited thereto, and any other suitable linear error correction code, such as polar codes, may be applied.
[0131] Furthermore, it is also possible to use different coding schemes, for example, polar codes for short blocks and LDPC for large blocks. Due to the different inherent error detection (LDPC has inherent detection, while polar codes do not), the CRC attachment may not need to be different. However, it is possible to match the CRC lengths to simplify the implementation. In this way, the same error detection capability can be provided across the operating regions. For example, it is possible to attach 19 CRC parity bits for polar codes and use the same size for LDPC codes.
[0132] In addition, in the above embodiment, it is described that segmentation is not applied when using LDPC base graph #2. However, the present invention is not limited to this. That is, according to an alternative embodiment, when a second linear error correction code (e.g., LDPC) base graph is used, a transmission block including information bits can be segmented into at least two code blocks. In this case, the same number of parity check bits as in the case where segmentation is not applied is used for each code block. That is, for TB and CB levels, CRC attachment remains equal, thereby simplifying implementation.
[0133] In addition, when using segmentation using BG#2, CRC overhead can be considered when determining the number of CBx. To this end, the number of CBs can be determined as follows:
[0134] For example, if the TB size is B, and we need the CRC attachment for TB and CB to be L, the number of CBs can be calculated as follows:
[0135] Number of CBs = Ceil(B+L / (2560-L))
[0136] It should be noted that the operation "Ceil()" indicates the smallest integer greater than or equal to a given number.
[0137] In addition, a threshold can be used to determine whether to apply segmentation. In this case, the basis Figure 2 The maximum size supported should be the threshold. For example, when 2560 is the maximum size supported by base map #2, TB+CRC=2560 should be the threshold.
[0138] For the purposes of the present invention as herein described, it should be noted that:
[0139] - the method steps that may be implemented as software code parts and executed using a processor at a network element or terminal (as an example of a device, an apparatus and / or its modules, or as an example of an entity including an apparatus and / or a module) are independent of the software code and may be specified using any known or future developed programming language as long as the functions defined by the method steps are preserved;
[0140] - Generally, any method step is suitable for being implemented in software or hardware without changing the idea of the invention in terms of the implemented functionality;
[0141] - the method steps and / or devices, units or components that may be implemented as hardware components at the above-mentioned apparatus or any (multiple) modules thereof (for example, devices that perform the functions of the apparatus according to the embodiments described above, the eNode-B described above, etc.) are independent of hardware and can be implemented using any known or future developed hardware technology or any mixture of these technologies, such as MOS (metal oxide semiconductor), CMOS (complementary MOS), BiMOS (bipolar MOS), BiCMOS (bipolar CMOS), ECL (emitter coupled logic), TTL (transistor-transistor logic), etc., for example using ASIC (application specific IC (integrated circuit)) components, FPGA (field programmable gate array) components, CPLD (complex programmable logic device) components or DSP (digital signal processor) components;
[0142] - a device, unit or component (e.g. any of the above defined means or their corresponding components) may be implemented as an individual device, unit or component, but this does not exclude its implementation in a distributed manner throughout the system, as long as the functionality of the device, unit or component is preserved;
[0143] - The device may be represented by a semiconductor chip, a chipset or a (hardware) module comprising such a chip or chipset; however, the following possibility is not excluded: the functions of the device or module are not implemented by hardware, but are implemented as software in a (software) module, such as a computer program or a computer program product comprising an executable software code portion for execution / running on a processor. ;
[0144] - For example, a device may be considered as one apparatus or as a component of more than one apparatus, whether they cooperate in functionality or are functionally independent of each other but in the same apparatus housing.
[0145] It should be noted that the above embodiments and examples are provided for illustrative purposes only and are by no means intended to limit the present invention thereto. On the contrary, all changes and modifications falling within the spirit and scope of the appended claims are intended to be included.
Claims
1. An apparatus for processing information, comprising at least one processor, at least one memory including computer program code, and the at least one processor together with the at least one memory and the computer program code is arranged to cause the apparatus to perform at least: generating a code block, the code block comprising information bits of a transport block and parity check bits, the parity check bits being generated by performing a cyclic redundancy check on the information bits, selecting a linear error correction code basis graph from a first linear error correction code basis graph and a second linear error correction code basis graph based on at least one of: a number of information bits or a code rate for an initial transmission of the transport block, wherein a maximum code block size supported by the second linear error correction code basis graph is smaller than a maximum code block size supported by the first linear error correction code basis graph, determining a number of parity check bits for generating the code block based on the number of information bits, wherein determining the number of parity check bits comprises comparing the number of information bits with a first threshold, the first threshold being defined by the maximum code block size supported by the second linear error correction code base graph, and The code block is encoded by using the selected linear error correction code basis graph.
2. The apparatus according to claim 1, wherein the at least one processor together with the at least one memory and the computer program code is arranged to cause the apparatus to further perform: The linear error correction code base graph is selected from the first linear error correction code base graph and the second linear error correction code base graph based on the number of information bits.
3. The apparatus according to claim 1 or 2, wherein the information bits are included in the transport block, and when the second linear error correction code base map is used, segmentation of the transport block size is not applied.
4. The apparatus according to claim 1 or 2, wherein the information bits are included in the transport block, and the at least one processor together with the at least one memory and the computer program code is arranged to cause the apparatus to further perform: When the second linear error correction code base graph is used, segmenting the transport block into at least two code blocks, The same number of parity bits as in the case where segmentation is not applied is used for each code block.
5. The apparatus according to any one of claims 1 to 2, wherein the at least one processor together with the at least one memory and the computer program code is arranged to cause the apparatus to further perform: In determining the number of parity bits used to generate the code block based on the selected linear error correction code basis map, a modulation and coding scheme table based on the selected linear error correction code basis map is referenced.
6. The apparatus according to any one of claims 1 to 2, wherein the at least one processor together with the at least one memory and the computer program code is arranged to cause the apparatus to further perform: a modulation and coding scheme table providing information about the modulation and coding scheme, wherein the table specifies information about modulation and coding schemes including a nested structure, wherein different modulation and coding schemes are referenced by corresponding indexes, wherein the indexes are composed of a plurality of bits, and the index indicating the modulation and coding scheme associated with the second linear error correction code basis graph is indicated by a smaller number of bits than the number of bits of the index indicating the modulation and coding scheme associated with the first linear error correction code basis graph.
7. The apparatus of claim 6, wherein when the number of bits used to indicate the index of the modulation and coding scheme associated with the second linear error correction code basis diagram is defined as Y, and the number of bits used to indicate the index of the modulation and coding scheme associated with the first linear error correction code basis diagram is defined as X, first XY leading bits in the index indicating the modulation and coding scheme associated with the second linear error correction code basis diagram are set to 0.
8. The apparatus according to any one of claims 1 to 2, wherein the linear error correction code comprises an LDPC (Low Density Parity Check) code and / or a polar code.
9. A method of processing information, include: generating a code block, the code block comprising information bits of a transport block and parity check bits, the parity check bits being generated by performing a cyclic redundancy check on the information bits, selecting a linear error correction code basis graph from a first linear error correction code basis graph and a second linear error correction code basis graph based on at least one of: a number of information bits or a code rate for an initial transmission of the transport block, wherein a maximum code block size supported by the second linear error correction code basis graph is smaller than a maximum code block size supported by the first linear error correction code basis graph, determining a number of parity check bits for generating the code block based on the number of information bits, wherein determining the number of parity check bits comprises comparing the number of information bits with a first threshold, the first threshold being defined by the maximum code block size supported by the second linear error correction code base graph, and The code block is encoded by using the selected linear error correction code basis graph.
10. The method according to claim 9, further comprising: include: The selected linear error correction code basis map is selected from the first linear error correction code basis map and the second linear error correction code basis map based on the number of information bits.
11. The method according to claim 9 or 10, wherein the information bits are included in the transport block, and when the second linear error correction code base map is used, segmentation of the transport block size is not applied.
12. The method according to claim 9 or 10, wherein the information bits are included in the transport block, and the method further include: When the second linear error correction code basis graph is used, segmenting the transport block into at least two code blocks is performed, The same number of parity bits is used for each code block as in the case where segmentation is not applied.
13. The method according to any one of claims 9 to 10, further comprising: include: In determining the number of parity bits used to generate the code block based on the selected linear error correction code basis map, a modulation and coding scheme table based on the selected linear error correction code basis map is referenced.
14. The method according to any one of claims 9 to 10, further comprising: include: a modulation and coding scheme table providing information about the modulation and coding scheme, wherein the table specifies information about modulation and coding schemes including a nested structure, wherein different modulation and coding schemes are referenced by corresponding indexes, wherein the indexes are composed of a plurality of bits, and the index indicating the modulation and coding scheme associated with the second linear error correction code basis graph is indicated by a smaller number of bits than the number of bits of the index indicating the modulation and coding scheme associated with the first linear error correction code basis graph.
15. The method of claim 14, wherein when the number of bits used to indicate the index of the modulation and coding scheme associated with the second linear error correction code basis diagram is defined as Y, and the number of bits used to indicate the index of the modulation and coding scheme associated with the first linear error correction code basis diagram is defined as X, first XY leading bits in the index indicating the modulation and coding scheme associated with the second linear error correction code basis diagram are set to 0.
16. The method according to any one of claims 9 to 10, wherein the linear error correction code comprises an LDPC (Low Density Parity Check) code and / or a polar code.
17. A computer program product comprising code means for performing the method according to any one of claims 9 to 16 when run on a processing means or module.
18. The computer program product according to claim 17, wherein the computer program product is implemented on a computer-readable medium, and / or the computer program product is directly loadable into an internal memory of a computer, and / or is transmittable via a network by at least one of an upload, download and push process.
