CN109150191A - The method, apparatus and communication equipment of information processing - Google Patents

The method, apparatus and communication equipment of information processing Download PDF

Info

Publication number
CN109150191A
CN109150191A CN201710454030.3A CN201710454030A CN109150191A CN 109150191 A CN109150191 A CN 109150191A CN 201710454030 A CN201710454030 A CN 201710454030A CN 109150191 A CN109150191 A CN 109150191A
Authority
CN
China
Prior art keywords
matrix
column
row
submatrix
weight
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710454030.3A
Other languages
Chinese (zh)
Inventor
金杰
童文
王俊
亚历山大·帕特尤斯基
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201810771585.5A priority Critical patent/CN109067407B/en
Priority to CN201710454030.3A priority patent/CN109150191A/en
Priority to JP2019556313A priority patent/JP6820438B2/en
Priority to KR1020197027252A priority patent/KR102194029B1/en
Priority to CN201780092144.6A priority patent/CN110754042B/en
Priority to CN202010009164.6A priority patent/CN111416625B/en
Priority to EP22198435.4A priority patent/EP4187794A1/en
Priority to RU2019133313A priority patent/RU2740154C1/en
Priority to PCT/CN2017/092878 priority patent/WO2018227681A1/en
Priority to EP17913431.7A priority patent/EP3588786B1/en
Priority to BR112019020158-0A priority patent/BR112019020158B1/en
Priority to CA3055231A priority patent/CA3055231C/en
Priority to AU2017418080A priority patent/AU2017418080B9/en
Priority to PCT/CN2018/091423 priority patent/WO2018228514A1/en
Publication of CN109150191A publication Critical patent/CN109150191A/en
Priority to US16/566,331 priority patent/US10742235B2/en
Priority to ZA2019/06314A priority patent/ZA201906314B/en
Priority to US16/923,841 priority patent/US11296726B2/en
Priority to JP2021000141A priority patent/JP7221999B2/en
Priority to US17/684,144 priority patent/US11611356B2/en
Priority to US18/185,998 priority patent/US11996863B2/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/1154—Low-density parity-check convolutional codes [LDPC-CC]
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)

Abstract

This application discloses coding method, device, communication equipment and communication systems.This method comprises: being encoded using low-density checksum LDPC matrix to input bit sequence；Wherein, the LDPC matrix is obtained based on base figure, and the base figure includes submatrix A, B, C, D and E, wherein the submatrix A is mARow nAThe matrix of column, mA、nAFor positive integer, and 4≤mA≤ 7, nA=10；The submatrix B is mARow mAThe matrix of column, the submatrix B include the submatrix B ' of the column that weight is 3 and double diagonal arrangements；The submatrix D includes m in matrix FDRow, the matrix F are mFRow (mA+nA) column matrix, mD、mFFor positive integer, 0≤mD≤mF, 35≤mF≤38；The submatrix C is mARow mDThe full 0 matrix of column；The submatrix E is mDRow mDThe unit matrix of column.Coding method, device, communication equipment and the communication system of the application, can support the code requirement of the information bit sequence of different lengths.

Description

The method, apparatus and communication equipment of information processing
Technical field
The present embodiments relate to the communications field more particularly to the methods and communication device of information processing.
Background technique
Low-density checksum (low density parity check, LDPC) code is a kind of with sparse check matrix Linear block coding, have flexible structure, the low feature of decoding complexity.Since it is calculated using the iterative decoding of part parallel Method, to have higher throughput than traditional Turbo code.LDPC code can be used for the error correcting code of communication system, to improve The reliability and power utilization of transmission.LDPC code can also be widely used in space communication, fiber optic communication, personal communication System, ADSL and magnetic recording equipment etc..It has contemplated that at present using LDPC code in the 5th third-generation mobile communication as channel coding side One of formula.
It in actual use, can be using the LDPC matrix with special construction feature.This has special construction The LDPC matrix H of feature can be extended to obtain by the LDPC basic matrix of quasi- circulation (quasi cycle, QC) structure.
Under normal conditions, information bit sequence length to be encoded is differed from dozens to hundreds of, the code of communication system requirements Rate is also flexible and changeable.The coding for how supporting the information bit sequence of different lengths meets the code rate requirement of system, becomes one Problem to be solved.
Summary of the invention
The embodiment of the invention provides a kind of method of information processing, communication device and systems, can support different lengths Information bit sequence coding and decoding, meet the flexible code length code rate requirement of system.
In a first aspect, providing a kind of coding method and encoder, the encoder uses low-density checksum LDPC Matrix encodes list entries.
Second aspect, provides a kind of interpretation method and decoder, and the decoder uses low-density checksum LDPC Matrix decodes list entries.
In the first implementation of above-mentioned first aspect or second aspect: the LDPC matrix is obtained based on base figure , the base figure includes submatrix A, B, C, D and E, wherein
The submatrix A is mARow nAThe matrix of column, mA、nAFor positive integer, and 4≤mA≤ 7, nA=10；
The submatrix B is mARow mAThe matrix of column, the submatrix B include the son of the column that weight is 3 and double diagonal arrangements Matrix B '；
The submatrix D includes m in matrix FDRow, the matrix F are mFRow (mA+nA) column matrix, mD、mFIt is positive whole Number, 0≤mD≤mF, 35≤mF≤38；
The submatrix C is mARow mDThe full 0 matrix of column；
The submatrix E is mDRow mDThe unit matrix of column.
Based on above-mentioned implementation, in one possible implementation, arbitrary neighborhood in last 10 row of the base figure Two rows are orthogonal.
It include at least 5 in last 10 row of the base figure in one possible implementation based on above-mentioned implementation Group, each group includes at least 2 rows in described at least 5 groups, and at least 2 rows are orthogonal.
Based on any of the above-described implementation, in one possible implementation, the weight of 9 rows is 3,1 in the matrix F Capable weight is 2.
In a kind of design, in the matrix F, wherein it be 18,1 column weight is 11,2 that the weight of 1 column, which be 16,1 weight arranged, The weight of column is that the weight that the weight that the weight that the weight that the weight of 10,1 column is 9,1 column is 8,1 column is 7,1 column is 6,2 column is The weight of 4,1 column is that the weight of 3,2 column is 2.
Meet orthohormbic structure in the matrix F in another possible implementation based on the first implementation Line number be more than or equal to 10, and, in the matrix F, wherein 1 column weight be 16,1 arrange weight be that 18,1 column weight is It is the weights of 9,1 column be the weights of 8,1 column be the weight of 7,1 column is the power of 6,2 column that the weight of 11,2 column, which is the weight of 10,1 column, Weight is that the weight that the weight of 4,1 column is 3,2 column is 2.
In another design, in the matrix F, the weight of 9 rows is that the weight of 3,1 row is 2.
In another design, the matrix F includes at least 10 rows, and two row of arbitrary neighborhood is orthogonal at least 10 rows.
In another design, the matrix F includes including at least 2 rows for each group at least 5 groups, described at least 5 groups, described At least 2 rows are orthogonal.Optionally, at least 2 rows can be continuous row.For example, at least 10 rows can be base figure Last 10 row of 30a.
In any of the above-described implementation, if mA> 4, weight of remaining column is 0 in the matrix F.
For example, meet in 10 rows of orthohormbic structure in matrix F may include such as the 25th row to the 34th row in base Figure 30 a and Each row or each column of the matrix-block of 0th column to the 13rd column composition, alternatively, meeting in 10 rows of orthohormbic structure in matrix F can be with Each row or each column of matrix-block including the 25th row to the 34th row in such as base Figure 30 a and the 0th column to the 16th column composition.Wherein It can exchange between each row in matrix F, can be also exchanged with each other between each column.
Based on above-mentioned implementation, the basic matrix of base Figure 30 a can be for such as basic matrix 30b-1,30b-2,30b-3,30b- 4, the transformed matrix of the row/column of any of 30b-5,30b-6,30b-7 and 30b-8 matrix or the matrix.
Based on above-mentioned implementation, the excursion matrix of matrix F can with 30b-1 into 30b-8 in any matrix the 7th row to The transformed matrix of row/column of matrix or the matrix shown in 41 rows and the 0th column to the 16th column；Or matrix F is inclined Move matrix may include 30b-1 into 30b-8 in any matrix the 4th row to the 41st row and the 0th column to the 14th column shown in square The transformed matrix of row/column of battle array or the matrix.
In order to support that different masses are long, LDPC code needs different spreading factor Z, be based on aforementioned implementation, one kind can In the implementation of energy, corresponding basic matrix is used based on different spreading factor Z.For example, Z=a × 2j, a ∈ 2,3, 5,7,9,11,13,15 },
If spreading factor Z=2 × 2j, j=0, one in 1,2,3,4,5,6,7, then the excursion matrix of matrix F can be In 30b-1 the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed square of row/column Battle array；Or the excursion matrix of matrix F can be in 30b-1 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column, The either transformed matrix of row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-1, The either transformed matrix of row/column of the matrix.
If spreading factor Z=3 × 2j, j=0, one in 1,2,3,4,5,6,7, then the excursion matrix of matrix F can be In 30b-2 the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed square of row/column Battle array；Or the excursion matrix of matrix F can be in 30b-2 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column, The either transformed matrix of row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-2, The either transformed matrix of row/column of the matrix.
If spreading factor Z=5 × 2j, j=0, one in 1,2,3,4,5,6, then the excursion matrix of matrix F can be In 30b-3 the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed square of row/column Battle array；Or the excursion matrix of matrix F can be in 30b-3 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column, The either transformed matrix of row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-3, The either transformed matrix of row/column of the matrix.
If spreading factor Z=7 × 2j, j=0, one in 1,2,3,4,5, then the excursion matrix of matrix F can be 30b- In 4 the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed matrix of row/column； Perhaps the excursion matrix of matrix F can be in 30b-4 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column or It is the transformed matrix of row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-4, or It is the transformed matrix of row/column of the matrix.
If spreading factor Z=9 × 2j, j=0, one in 1,2,3,4,5, then the excursion matrix of matrix F can be 30b- In 5 the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed matrix of row/column； Perhaps the excursion matrix of matrix F can be in 30b-5 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column or It is the transformed matrix of row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-5, or It is the transformed matrix of row/column of the matrix.
If spreading factor Z=11 × 2j, j=0, one in 1,2,3,4,5, then the excursion matrix of matrix F can be In 30b-6 the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed square of row/column Battle array；Or the excursion matrix of matrix F can be in 30b-6 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column, The either transformed matrix of row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-6, The either transformed matrix of row/column of the matrix.
If spreading factor Z=13 × 2j, j=0, one in 1,2,3,4, then the excursion matrix of matrix F can be 30b-7 In the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed matrix of row/column；Or The excursion matrix of person's matrix F can be in 30b-7 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column, either The transformed matrix of the row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-7, either The transformed matrix of the row/column of the matrix.
If spreading factor Z=15 × 2j, j=0, one in 1,2,3,4, then the excursion matrix of matrix F can be 30b-8 In the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed matrix of row/column；Or The excursion matrix of person's matrix F can be in 30b-8 matrix shown in the 4th row to the 41st row and the 0th column to the 14th column, either The transformed matrix of the row/column of the matrix.Correspondingly, the basic matrix of base Figure 30 a can be matrix shown in 30b-8, either The transformed matrix of the row/column of the matrix.
It further, optionally, can also be according to above-mentioned each set for each spreading factor Z based on above-mentioned implementation Basic matrix obtain the i-th row jth column element P in the basic matrix of Zi,j=f (Vi,j, Z), wherein Vi,jIt is the place spreading factor Z I-th row jth column element in the basic matrix of set.
For example,
In another possible implementation, Ji Tu or basic matrix can also include the built-in punching bit of at least 1 column Column.
The base figure and basic matrix of LDPC matrix in above-mentioned each implementation can satisfy a length of 20 to 2560 bit of block The performance requirement of code block.
Based on any possible implementation of above-mentioned various aspects or various aspects, in another possible implementation In, further includes: determine spreading factor Z.For example, determining the value of spreading factor Z according to the length K of list entries, such as: if defeated Entering sequence length is K, and the minimum value for meeting 10*Z >=K can be determined in the spreading factor that multiple systems define.
Optionally, LDPC matrix can be obtained based on the corresponding basic matrix of Z, alternatively, the excursion matrix based on Z obtains.
For the communication equipment of transmitting terminal, carrying out coding to the list entries using LDPC matrix includes:
The list entries is encoded using spreading factor Z corresponding LDPC matrix；Or spreading factor Z is corresponding LDPC matrix have passed through row/column transformation, and the matrix after being encoded using the transformed matrix of row/column to list entries is to described List entries is encoded.Row/column transformation refers to row transformation, rank transformation or row transformation and rank transformation in the application.
For the communication equipment of receiving end, carrying out decoding to list entries using LDPC matrix includes:
List entries is decoded using spreading factor Z corresponding LDPC matrix；Or the corresponding LDPC of spreading factor Z Matrix have passed through row/column transformation, and the matrix after being encoded using the transformed matrix of row/column to list entries is to the input Sequence is encoded.Row/column transformation refers to row transformation, rank transformation or row transformation and rank transformation in the application.
In one possible implementation, LDPC matrix can be saved, list entries is carried out using the LDPC matrix Coding, or the LDPC matrix that (row/column transformation) or extension acquisition can be used for encoding is converted based on the LDPC matrix.
In alternatively possible implementation, parameter can be saved, according to the parameter can obtain for encode or The LDPC matrix of person's decoding, so as to which list entries is encoded or decoded based on LDPC matrix.The parameter includes At least one of: base figure, basic matrix are based on Ji Tu or the transformed transformation matrix of basic matrix row/column, are based on Ji Tu or group moment The extended matrix of battle array, in basic matrix the deviant of nonzero element or with any parameter for obtaining LDPC matrix correlation.
In another possible implementation, the basic matrix of LDPC matrix can be saved in memory.
In another possible implementation, the base figure of LDPC matrix is saved in memory, the group moment of LDPC matrix The deviant of nonzero element can save in memory in battle array.
A kind of base based on above-mentioned each possible implementation, in possible design, for LDPC coding or decoding At least one in figure and basic matrix is that at least one in the base figure and basic matrix of above-mentioned LDPC matrix exchanges or arrange friendship through space It is obtained after changing or going exchange and column exchange.
The third aspect, providing a kind of communication device may include for executing corresponding module in above method design. The module can be software and/or be hardware.
In a possible design, the communication device that the third aspect provides, including processor and transmitting-receiving subassembly, the processing Device and transmitting-receiving subassembly can be used for realizing the function of each section in above-mentioned coding or interpretation method.In this design, if this is logical T unit is that terminal, base station or other network equipments, transmitting-receiving subassembly can be transceiver, if the communication device is base band Chip or base band veneer, transmitting-receiving subassembly can be the input/output circuitry of baseband chip or base band veneer, for realizing defeated Enter/reception/transmission of output signal.The communication device can also include optionally memory, for storing data and/or refer to It enables.
In one implementation, the processor may include the encoder as described in above-mentioned first aspect and determination Unit.The determination unit is for determining to spreading factor Z needed for list entries coding.The encoder is for described in use The corresponding LDPC matrix of spreading factor Z encodes the list entries.
In another implementation, the processor may include decoder as described in above-mentioned second aspect and obtain Take unit.The acquiring unit is used to obtain the soft value and spreading factor Z of LDPC code.The decoder is used to be based on spreading factor The corresponding basic matrix H of ZBThe soft value of LDPC code is decoded to obtain information bit sequence.
Fourth aspect provides a kind of communication device, including one or more processors.
In a kind of possible design, one or more processors can realize the function of encoder described in first aspect Can, in alternatively possible design, encoder described in first aspect can be a part of the processor, processor in addition to The function of realizing encoder described in first aspect, can also realize other function.
In a kind of possible design, one or more processors can realize the function of decoder described in second aspect Can, in alternatively possible design, decoder described in second aspect can be a part of the processor.
Optionally, the communication device can also include transceiver and antenna.
Optionally, the communication device can also include for generating the device of transmission block CRC, for code block segmentation and The device of CRC check, the interleaver for intertexture or modulator for modulation treatment etc..
Optionally, the communication device can also include the demodulator for demodulation operation, the deinterleaving for deinterleaving Device or device etc. for solving rate-matched.The function of these devices can be realized by one or more processors.
In a kind of possible design, the function of these devices can be realized by one or more processors.
5th aspect, the embodiment of the invention provides a kind of communication system, which includes described in the above-mentioned third aspect Communication device.
6th aspect, the embodiment of the invention provides a kind of communication system, which includes one or more fourth aspects The communication device.
In another aspect, program is stored thereon with the embodiment of the invention provides a kind of computer storage medium, when its operation When, so that computer executes method described in above-mentioned aspect.
The another aspect of the application provides a kind of computer program product comprising instruction, when it runs on computers When, so that computer executes method described in above-mentioned various aspects.
Method, apparatus, communication equipment and the communication system of the information processing of the embodiment of the present invention, in coding efficiency and mistake It can adapt to the flexible and changeable code length code rate needs of system on leveling.
Detailed description of the invention
Fig. 1 is the schematic diagram of the base figure of a LDPC code, basic matrix and its cyclic permutation matrices；
Fig. 2 is the structural schematic diagram of the base figure of a LDPC code；
Fig. 3 a is the schematic diagram for the LDPC code base figure that one embodiment of the invention provides；
Fig. 3 b is the schematic diagram of the basic matrix of base figure shown in Fig. 3 a；
Fig. 4 be another embodiment of the present invention provides performance schematic diagram；
Fig. 5 be another embodiment of the present invention provides information processing unit structural schematic diagram；
Fig. 6 be another embodiment of the present invention provides communication system schematic diagram.
Specific embodiment
A little explanations are done to some nouns being related in the application below for ease of understanding.
In the application, noun " network " and " system " are often used alternatingly, and " device " and " equipment " is also often used alternatingly, But it will be appreciated by those skilled in the art that its meaning." communication device " can be chip (such as baseband chip or data-signal Handle chip or general-purpose chip etc.), terminal, base station or other network equipments.Terminal is a kind of with communication function Equipment, may include the handheld device with wireless communication function, mobile unit, wearable device, calculate equipment or connection To other processing equipments etc. of radio modem.Terminal can be called different titles in different networks, such as: it uses Family equipment, mobile station, subscriber unit, platform, cellular phone, personal digital assistant, radio modem, wireless communication are set It is standby, handheld device, laptop computer, wireless phone, wireless local loop platform etc..For convenience of description, in the application referred to as eventually End.Base station (base station, BS), alternatively referred to as base station equipment are that one kind is deployed in wireless access network to provide wirelessly The equipment of communication function.The call of base station may be different in different wireless access systems, such as and general shifting Base station is known as node in dynamic communication system (Universal Mobile Telecommunications System, UMTS) network B (NodeB), and base station in the lte networks is known as the node B (evolved NodeB, eNB or eNodeB) of evolution, new Eat dishes without rice or wine the base station in (new radio, NR) network be known as transmitting-receiving point (transmission reception point, TRP) or Base station in person's next generation's node B (generation nodeB, gNB) or other various evolvement networks may also use it His call.The present invention is not limited thereto.
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention is described.
LDPC code can usually be indicated with parity check matrix H.The parity check matrix H of LDPC code can pass through base figure (base graph) and offset (shift) value obtain.Base figure usually may include m*n matrix element (entry), can use m The matrix form of row n column indicates that the value of matrix element is 0 or 1, the element that intermediate value is 0, sometimes also referred to as neutral element, It indicates that the element can be replaced by the full null matrix (zero matrix) of Z*Z, is worth the element for 1, sometimes also referred to as non-zero Element indicates that the element can be replaced by the cyclic permutation matrices (circulant permutation matrix) of Z*Z.Also It is to say, what each matrix element represented is a full null matrix or a cyclic permutation matrices.10a show one as shown in figure 1 A illustrative m=4, n=20 have each element in the base figure of the LDPC code of QC structure.It should be noted that, in this document, The line number and row number of base figure and matrix are numbered from 0, it is only for facilitate understanding.It is understood that line number It can also be numbered from 1 with row number, then corresponding line number and row number add 1 on the basis of line number shown in this article and row number.
The element value that the i-th row jth arranges in Ruo Jitu is 1, deviant Pi,j, Pi,jFor the integer more than or equal to 0, The element for then indicating that the value of the i-th row jth column is 1 can be by Pi,jThe cyclic permutation matrices of corresponding Z*Z are replaced, the cyclic permutation Matrix can be by carrying out P for the unit matrix of Z*Zi,jSecondary cyclic shift to the right obtains.As it can be seen that the member for being 0 by value each in base figure Element is replaced with the full null matrix of Z*Z, and each value is carried out for 1 element using the cyclic permutation matrices of the corresponding Z*Z of its deviant It replaces, then the parity matrix of available LDPC code.Z is positive integer, can also be referred to as extension (lifting) factor, It can be determined according to the size for the code block size and information data that system is supported.It can be seen that the size of parity check matrix H is (m* Z)*(n*Z).For example, spreading factor Z=4, then each neutral element is replaced by the full 0 matrix 11a of a 4*4 size, if P2,3= 2, then the non-zero element of the 2nd row the 3rd column is replaced by the cyclic permutation matrices 11d of 4*4, which is the unit matrix 11b by 4*4 By 2 times to the right cyclic shift obtain, if P2,4=0, then the non-zero element of the 2nd row the 4th column is replaced by unit matrix 11b.It needs It is noted that be only merely illustrative herein, it is not limited thereto system.
Due to Pi,jIt can be and obtained based on spreading factor Z, the element for being 1 for same position upper value, using difference Spreading factor Z there may be different Pi,j.It is realized to simplify, usual system can also define the basic matrix of a m*n (basematrix), the position of each element corresponds in each element and Ji Tu in basic matrix, the neutral element in base figure Position is constant in basic matrix, indicates using -1, and position is not in basic matrix for the nonzero element that the i-th row jth train value is 1 in base figure Become, is represented by Vi,j, Vi,jIt can be the deviant defined relative to a predetermined or specific spreading factor Z, for example, being Relative to largest extension factor Z in gathering where spreading factor ZmaxDeviant, then, wherein Vi,jIt can be using collection where Z Largest extension factor Z in conjunctionmaxWhen the i-th row jth column non-zero element deviant.In the embodiment of the present application, sometimes also by base Matrix is known as the excursion matrix of base figure matrix.
Pi,jIt can be based on Vi,jIt is obtained with Z.For example, P can be expressed asi,j=f (Vi,j, Z), wherein f (Vi,j, Z) indicate with Vi,jIt is the function of parameter with Z.For example,
10b show the corresponding basic matrix of base Figure 10 a as shown in figure 1.
It can also include built-in punching (built-in puncture) ratio of p column in the base figure or basic matrix of usual LDPC code Spy's column, p can be 0~2 integer, these column participate in coding, but it encodes corresponding systematic bits and is not sent, then LDPC The code rate of code basic matrix meets R=(n-m)/(n-p).For the basic matrix of 4 rows 20 column (4*20), if there is 2 column Built-in punching bit column, then code rate is (20-4)/(20-2)=8/9.
The LDPC code used in wireless communication system, the matrix size of base figure are m*n, may include 5 sub- matrix As, B, C, D and E, wherein the weight of matrix is determined by the number of nonzero element, and capable weight (row weight), which refers in a line, includes Nonzero element number, the weight (column weight) of column refers to the number for the nonzero element for including in a column.As shown in 200 in Fig. 2, Wherein:
Submatrix A is mARow nAThe matrix of column, size can be mA*nA, wherein each column corresponds to Z system in LDPC code System bit, systematic bits are sometimes referred to as information bit.
Submatrix B is mARow mAThe square matrix of column, size can be mA*mA, each column is corresponding to Z school in LDPC code Test bit.Submatrix B includes the submatrix B ' of double diagonal arrangements and the rectangular array (referred to as 3 column rearrangement) that a column weight is 3, The rectangular array that middle column weight is 3 can be located at before submatrix B ', as shown in 20a in Fig. 2；Submatrix B can also include one column or The rectangular array (referred to as single-row rearrangement) that multiple row column weight is 1, for example, a kind of possible implementation such as 20b or 20c institute in Fig. 2 Show.
The matrix for being typically based on submatrix A and B generation is kernel matrix, can be used to support the coding of high code rate.
Submatrix C is full null matrix, size mA×mD。
Submatrix E is unit matrix, size mD×mD。
Submatrix D size is mD×(nA+mA), it usually can be used to the check bit for generating low bit- rate.
Since the structure of submatrix C and E determine that the two-part structure of submatrix A, B and D is the coding and decoding of LDPC code relatively One of influence factor of performance.
Usual LDPC code can be obtained based on Ji Tu and basic matrix, can using the method for Density evolution to Ji Tu or basic matrix To determine the UPS upper performance score of LDPC code, and determine according to the deviant in basic matrix the error floor of LDPC code.Improve Compiling code performance and reducing error floor is one of determining base figure and target of basic matrix.Code length is flexibly more in wireless communication system Become, for example, it may be 40 bits, 1280 than top grade, and Fig. 3 a, 3b are the base figure and basic matrix example of a LDPC code respectively, can Meet the performance requirement of the code block of a length of 20 to 2560 bit of block.For convenience of description and understand, in top side in 3a, 3b in attached drawing And the leftmost side, respectively illustrate row number and line number.
Fig. 4 gives the performance schematic diagram of LDPC code shown in Fig. 3 a~3b, and LDPC 1 indicates that the LDPC code is based on base The corresponding each basic matrix of Figure 30 a encodes, and LDPC 2 indicates a kind of common LDPC code as a comparison, wherein horizontal seat Mark indicates that the length of information bit sequence, unit are bit, and ordinate is symbol signal-to-noise ratio (Es/N0), performance curve BLER When being 0.0001, the performance of LDPC 1 and LDPC 2 the symbol signal-to-noise ratio under different information bit sequence length.It can be seen that Under same BLER, symbol signal-to-noise ratio of the LDPC 1 under different information bit sequence length is lower than LDPC 2, that is, performance Better than LDPC 2.
Fig. 3 a show base Figure 30 a example an of LDPC code, wherein and top line 0~51 indicates column number in figure, Most one column 0~41 of the left side indicate row number, that is, the matrix size of base Figure 30 a for 42 rows 52 column.
Submatrix A correspondence system bit, size mARow 10 arranges, wherein 4≤mA≤ 7, for example, mA=4, in base Figure 30 a In by the 0th row to the 3rd row and the 0th column to the 9th column element constitute, in another example, mA> 4, with mAFor=7, in base Figure 30 a In by the 0th row to the 6th row and the 0th column to the 9th column element constitute；
Submatrix B corresponds to check bit, size mARow mAColumn, by the 0th row to (m in base Figure 30 aA- 1) row and 10th arranges to (10+mA- 1) element arranged is constituted；
Submatrix A and submatrix B constitutes the kernel matrix part of LDPC code base figure, namely constitutes a mARow (mA+ nA) column matrix, can be used for high code rate coding.For the convenience of description, below with mAFor=7, the core square of the base figure of LDPC code Battle array part is that 7 rows 17 arrange.
It wherein, may include that punching bit built in 2 column arranges in submatrix A, then after punching, code that kernel matrix can be supported Rate is 10/ (17-2)=2/3.
It wherein, include that 1 column 3 column are rearranged in submatrix B, i.e. the 0th column (the 10th column of kernel matrix) column weight of submatrix B is The 1st to 3 column (the 11st to 13 column of kernel matrix) of 3, submatrix B, the double diagonal arrangements of the 0th to 3 behavior, submatrix B further includes 3 The column of list column weight.
With mAIt include 2 row weights for 10 row in the kernel matrix of base Figure 30 a for=7, the row that 2 row weights are 8, The row that the row and 1 row weight that 2 row weights are 6 are 4.It is, each row in the kernel matrix that submatrix A and submatrix B is constituted Weight is respectively 8,10,8,10,4,6 and 6.It should be noted that the sequence of each row can exchange in kernel matrix, such as 0th row and the exchange of the 2nd row, the 1st row and the exchange of the 3rd row etc..It can be respectively the 0th to the 6th in the kernel matrix of base Figure 30 a One of it goes, each row shown in the 0th to the 16th column,.These rows sequence can exchange, and the sequence respectively arranged can also exchange.For example, can The 8th column of kernel matrix and the 14th are arranged exchange etc..It should be noted that be only for example herein, in practical application, column sequence Exchange, the exchange of row sequence, being can be according to system requirements flexible design.
It is understood that row exchange does not change matrix due between can exchanging, arrange between row matrix or exchanging The weight of middle column, column exchange do not change the weight of row in matrix, and the number of nonzero element is that no change has taken place in matrix.Through The weight of each row of base figure after space exchange and column exchange does not change.It is exchanged using through space, or column exchange, Huo Zhehang Base figure after exchange and column exchange does not influence performance.
It should be noted that in the application, do not influence that performance refers to says from whole, influences to be subjected to, in tolerance It is interior, for example, it may be possible to performance declines within the allowable range to certain scenes or in certain ranges, but in certain scenes or In the certain ranges of person, performance makes moderate progress, and see influences less performance on the whole.
For the base figure or basic matrix that are given generally for a LDPC code, a small amount of of matrix element is modified to performance Influence is acceptable.For example, in one implementation, can be modified on a small quantity based on the kernel matrix of base Figure 30 a, For example, wherein the weight of 1 row meets more than or equal to 2, and is less than or equal to 5, the weight of remaining 6 row meets be greater than respectively Or it is equal to 6, and be less than or equal to 12.It is appreciated that being also referred to scheme provided by the present application, make some of them row Weight increases or decreases 1~2, and the application is defined not to this.
In order to obtain flexible code rate, submatrix C, submatrix D and son of corresponding size can be added based on kernel matrix Matrix E, to obtain different code rates.Since submatrix C is full null matrix, submatrix is unit matrix, and size is mainly root It is determined according to code rate, structure is relatively fixed.Influence compiling code performance essentially consists in kernel matrix and the part submatrix D.? Ranks are added on the basis of kernel matrix, form the available different code rates in the corresponding part C, D and E.For example, can be with base figure The kernel matrix part of 30a or the kernel matrix part of base Figure 80 a are as kernel matrix, to meet different code rate codings or translating The demand of code, adds corresponding submatrix C, D and E.
The columns m of submatrix DDFor the sum of the columns of submatrix A and B, line number is mainly related to code rate.With base Figure 30 a For, if mA=4, then the columns of corresponding submatrix D is (nA+mA)=14 arrange, if mA=7, then the column of corresponding submatrix D Number is (nA+mAThe column of)=17=.If the code rate that LDPC code is supported is Rm, then the size of its base figure or basic matrix is m*n, wherein N=nA/Rm+ p, m=n-nA=nA/Rm+p-nA.If lowest bit rate Rm=1/5, built-in punching columns p=2 are with base Figure 30 a Example, then n=52, the line number m of m=42, submatrix DDMaximum can be m-mA=42-mAIf mA=4, then 0≤mD≤ 38, if mA =7, then 0≤mD≤35。
For the convenience of description, can define a size is mFRow (mA+nA) column matrix F, then submatrix D may include M thereinDRow, that is, 0≤mD≤mF, and 35≤mF≤38.Still with mAFor=7, in base Figure 30 a, mA+mD=42.If mD= 35, correspondingly submatrix D size is 35 rows 17 column, that is, submatrix D, that is, matrix F, and the code rate that corresponding LDPC code is supported is 10/ 50=1/5.As it can be seen that for mAThe 7th row to the 41st row and the 0th column to the matrix that the 17th column are constituted are in=7, base Figure 30 a Matrix F.For mAThe 4th row to the 41st row and the 0th column to the matrix that the 13rd column are constituted are matrix F in=4, base Figure 30 a.It needs It is noted that be only for example herein, it is not limited thereto, mAOr any integer value in 4 to 7, the columns of matrix F It is corresponding to change.
In the present invention, the same row of adjacent rows at most only has 1 nonzero element in Ruo Jitu, then this two row is being each other just It hands over.In Ruo Jitu adjacent rows in addition to part arrange other than other column in, same row at most only have 1 nonzero element, then this two Row is quasi-orthogonal.
Matrix F may include the quasi- orthohormbic structure of multirow and at least two row orthohormbic structures.For example, matrix F includes at least 15 rows Meet the row of quasi- orthohormbic structure, it is same in remaining column in this 15 row in 2 row of arbitrary neighborhood other than built-in punching bit column In column in most only one nonzero elements, that is, matrix F at least 15 rows in addition to built-in punching bit column other than remaining The matrix-block that column are constituted has orthohormbic structure.Matrix F can also include the row that 10 to 20 rows meet orthohormbic structure, that is, these In row, in same row at most only one nonzero element in 2 row of arbitrary neighborhood, that is, built-in punching bit column also at most only One nonzero element.
For example, last 10 row meets orthohormbic structure in matrix F by taking base Figure 30 a as an example, wherein the weight of 9 rows is 3,1 row Weight is 2.The column weight distribution of matrix F can be, wherein it is 11,2 column that the weight that the weight of 1 column is 16,1 column, which is 18,1 column weight, Weight be the weights of 10,1 column be the weights of 9,1 column be the weights of 8,1 column be the weights of 7,1 column be the weights of 6,2 column be 4,1 The weight of column is that the weight of 3,2 column is 2.If mA> 4, weight of remaining column is 0 in the matrix F.
With mAFor=7, in the matrix F exemplified by base Figure 30 a, row is followed successively by 5,3,4,4,4,3,4,4,3,4 again, 4,3,3,3,3,2,3,3,2,4,2,3,2,4,2,3,3,3,3,3,2,3,3,3,3.
Since submatrix E is unit matrix, the weight of every a line is respectively 8,10,8,10,4,6,6 in base Figure 30 a, 6,4,5,5,5,4,5,5,4,5,5,4,4,4,4,3,4,4,3,5,3,4,3,5,3,4,4,4,4,4,3,4,4,4,4.
Still with mAFor=7, if mD=15, LDPC code base figure neutron matrix D size is 15 rows 17 column, be can be by base figure The matrix of the 0-14 row of matrix F in 30a, that is, the 7th row to the 21st row of base Figure 30 a, the 0th column to the 16th column is constituted, right The code rate for answering LDPC code to support is 10/30=1/3, that is, under the code rate, the base figure of LDPC code corresponding to base Figure 30 a the 0 row to the 21st row, the matrix part that the 0th column are constituted to the 31st column, wherein submatrix E is the unit matrix of 15 rows 15 column, sub- square Battle array C is the full 0 matrix of 7 rows 15 column；
If mD=25, LDPC code base figure neutron matrix D size is 25 rows 17 column, be can be by the of matrix F in base Figure 30 a The matrix of 0-24 row, that is, the 7th row to the 31st row of base Figure 30 a, the 0th column to the 16th column is constituted, corresponding LDPC code branch The code rate held is 10/40=1/4, that is, under the code rate, the base figure of LDPC code corresponding to base Figure 30 a the 0th row to the 31st Row, the matrix part that the 0th column are constituted to the 41st column, wherein submatrix E is the unit matrix of 25 rows 25 column, and submatrix C is 7 rows 25 The full 0 matrix of column.
And so on, it does not illustrate one by one.
It should be noted that each row can be exchanged with each other in the base figure and basic matrix of LDPC code, each column are also can be with It is exchanged with each other.For example, the 34th row of base Figure 30 a and the 36th row can be swapped, and the 44th column and the 45th column are carried out Exchange.In another example submatrix D includes m in matrix FDRow, this mDRow can be exchanged without row, can also will wherein a line or more Capable exchange is carried out between row, submatrix E is still diagonal arrangement, row, column exchange is not done, for example, by the 27th row of matrix F and the 29th The exchange of traveling every trade, submatrix D includes m in matrix FDRow, submatrix E is still diagonal arrangement.Matrix F is before carrying out capable exchange One quasi-orthogonal matrix remains as a quasi-orthogonal matrix after exchange.It is understood that Ruo Jitu or basic matrix Including submatrix D, then column are also required to swap in corresponding submatrix D when the column to kernel matrix swap.
Multiple basic matrix examples that basic matrix 30b-1 to 30b-8 as shown in Figure 3b is base Figure 30 a.Wherein, in base Figure 30 a Position of the nonzero element of i-th row jth column in each matrix of basic matrix 30b-1 to 30b-8 is constant, is worth for deviant Vi,j, null element Element is indicated in excursion matrix with -1 or null.Wherein, submatrix D partially may include accordingly matrix F in basic matrix Excursion matrix mDRow, can be according to the different selection m of code rateDValue.The corresponding excursion matrix of submatrix D is the inclined of matrix F Move the m in matrixDRow.
Wherein, in a kind of possible implementation, the excursion matrix of matrix F can be 30b-1 any matrix into 30b-8 In the 7th row to the 41st row and the 0th column to the 16th column shown in matrix or the matrix the transformed matrix of row/column；Or The excursion matrix of person's matrix F may include 30b-1 into 30b-8 in any matrix the 4th row to the 41st row and the 0th column to the 14th The transformed matrix of the row/column of matrix or the matrix shown in column.
In order to support that different masses are long, LDPC code needs different spreading factor Z, for example, for spreading factor Z=a × 2j, a∈{2,3,5,7,9,11,13,15}.8 set as described in table one can be divided into:
Table one
Set 1 Z=2 × 2j, j=0,1,2,3,4,5,6,7
Set 2 Z=3 × 2j, j=0,1,2,3,4,5,6,7
Set 3 Z=5 × 2j, j=0,1,2,3,4,5,6
Set 4 Z=7 × 2j, j=0,1,2,3,4,5
Set 5 Z=9 × 2j, j=0,1,2,3,4,5
Set 6 Z=11 × 2j, j=0,1,2,3,4,5
Set 7 Z=13 × 2j, j=0,1,2,3,4
Set 8 Z=15 × 2j, j=0,1,2,3,4
In order to guarantee the LDPC code performance under different masses are long, the set that can be based respectively on different spreading factor Z is used Corresponding basic matrix.
Wherein, in one possible implementation:
If spreading factor Z is one gathered in 1, the excursion matrix of matrix F can be in 30b-1 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-1 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-1 Transformed matrix；
If spreading factor Z is one gathered in 2, the excursion matrix of matrix F can be in 30b-2 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-2 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-2 Transformed matrix；
If spreading factor Z is one gathered in 3, the excursion matrix of matrix F can be in 30b-3 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-3 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-3 Transformed matrix；
If spreading factor Z is one gathered in 4, the excursion matrix of matrix F can be in 30b-4 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-4 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-4 Transformed matrix；
If spreading factor Z is one gathered in 5, the excursion matrix of matrix F can be in 30b-5 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-5 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-5 Transformed matrix；
If spreading factor Z is one gathered in 6, the excursion matrix of matrix F can be in 30b-6 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-6 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-6 Transformed matrix；
If spreading factor Z is one gathered in 7, the excursion matrix of matrix F can be in 30b-7 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-7 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-7 Transformed matrix；
If spreading factor Z is one gathered in 8, the excursion matrix of matrix F can be in 30b-8 the 7th row to the 41st The transformed matrix of row/column of matrix or the matrix shown in row and the 0th column to the 16th column；Or the offset of matrix F Matrix can be matrix shown in the 4th row to the 41st row in 30b-8 and the 0th column to the 14th column or the row/column of the matrix Transformed matrix.Correspondingly, the basic matrix of base Figure 30 a can be the row/column of matrix or the matrix shown in 30b-8 Transformed matrix.
For example, determining the value of spreading factor Z according to the length K of list entries, such as:, can if list entries length is K The value of spreading factor using the minimum value for meeting 10*Z >=K determining in the spreading factor that multiple systems define as matrix. Further, it is possible to select corresponding basic matrix according to determining spreading factor.
Likewise, each row is also that can exchange in basic matrix, each column can also be exchanged.Ruo Jitu is exchanged or is arranged through space At least one of exchange exchange, then the basic matrix of corresponding portion is also similarly exchanged.
It is understood that quasi- orthohormbic structure is not limited only to adjacent rows in the application, meet quasi- orthohormbic structure Matrix may be designed in comprising multiple groups, each group includes at least 2 rows, such as 3 rows or 4 rows etc., includes in each group Row be quasi-orthogonal.
In performance chart shown in Fig. 4, LDPC 1 indicates that the LDPC code is based on the corresponding basic matrix of base Figure 30 a What coding obtained, LDPC 2 indicates a kind of common LDPC code as a comparison, and wherein abscissa indicates information bit sequence Length, unit are bit, and ordinate is symbol signal-to-noise ratio (Es/N0), when performance curve is that BLER is respectively 0.01 and 0.0001, The performance of LDPC 1 and LDPC 2 symbol signal-to-noise ratio under different information bit sequence length.It can be seen that in same BLER Under, symbol signal-to-noise ratio of the LDPC 1 under different information bit sequence length is lower than LDPC 2, that is, performance is better than LDPC 2.
In the coding method that one embodiment of the invention provides, encoder compiles list entries using LDPC matrix Code；The base figure of the LDPC matrix can be any base figure in aforementioned exemplary, and the basic matrix of the LDPC matrix can show to be aforementioned Any basic matrix in example.Wherein, the list entries of encoder can be information bit sequence.
Further, further includes: determine spreading factor Z；Spreading factor Z can be determined according to the length K of list entries Value.Information bit sequence is otherwise referred to as code block (code block), can be divided by carrying out code block to transmission block It arrives.If information bit sequence length is K, the minimum for meeting 10*Z >=K can be determined in the spreading factor that multiple systems define Value, for example, K=128, the spreading factor that system defines includes the spreading factor in respectively gathering in aforementioned table one, for example, 2,3,4, 5,6,7,8,9,10,11,12,13,14,15,16,18,20,22,24,26,28,30,32,36,40,44,48,52,56,60, 64,72,80,88,96,104,112,120,128,144,160,176,192,208,224,240,256, then it can determine that Z is 13, in set 7.It should be noted that only illustrate herein, it is not limited thereto system.
Encoder, which carries out coding to list entries using LDPC matrix, can be using the corresponding LDPC matrix of spreading factor Z List entries is encoded.
For example, Z is 13, in set 7, then LDPC matrix is obtained to input sequence based on 7 corresponding basic matrix 3b-7 of set Column are encoded；
It, can also be with the basic matrix of spreading factor Z, the i-th row jth column element P in another designi,jMeet following relationships:
Wherein, Vi,jIt can be the deviant of the element of the i-th row jth column in the basic matrix gathered where Z, that is, where Z The deviant of the nonzero element of the i-th row jth column of the basic matrix of the largest extension factor in set.
For example, by taking Z is 13 as an example, the element P of the i-th row jth column in basic matrixi,jMeet
Wherein, Vi,jIt is the deviant for the non-zero element that the i-th row jth arranges in basic matrix 3b-7.
It should be noted that be only for example herein, the invention is not limited thereto.
Wherein LDPC matrix basic matrix HBIt can be any basic matrix enumerated in foregoing embodiments or relative to preceding State any basic matrix enumerated and transformation occurs for words and deeds sequence or column sequence converts, or row sequence and column sequence it is equal The basic matrix converted, base figure include at least submatrix A and submatrix B, can also include submatrix C, submatrix D and son Matrix E, each section can be with reference to the descriptions in foregoing embodiments, and details are not described herein again.
In one possible implementation, the basic matrix H of LDPC codeBIt can be stored in memory, encoder obtains The corresponding LDPC matrix of spreading factor Z is taken, to encode to list entries.In another possible implementation, by In the basic matrix H of LDPC codeBHave it is multiple, according to matrix structure preservation can occupy biggish memory space, can also be by LDPC code Base figure save in memory, progressively or column by column saves the deviant of nonzero element in each basic matrix respectively, then basis The deviant of base figure and the corresponding basic matrix of spreading factor Z obtains LDPC matrix.
It should be noted that only illustrate herein, it is not limited thereto system.
It, can be according to Z to basic matrix H when being encoded to information bit sequenceBIt is extended the LDPC square encoded Battle array H.To basic matrix HBIn each nonzero element Pi,j, determine the cyclic permutation matrices h of Z*Z sizei,j, wherein hi,jFor unit square Battle array passes through Pi,jThe cyclic permutation matrices that secondary cyclic shift obtains, by hi,jReplace nonzero element Pi,j, by the full zero moment of Z*Z size Battle array replacement basic matrix HBIn neutral element, to obtain parity check matrix H；
In a communications system, LDPC code is obtained after above method coding can be used.After obtaining LDPC code, communication device, also It can carry out following one or more operations: rate-matched is carried out to LDPC code；According to interleaving scheme to rate-matched after LDPC code is interleaved；The LDPC code after intertexture is modulated according to modulation scheme to obtain bit sequence B；Send bit sequence B。
Another embodiment of the present invention provides interpretation method in, decoder translates list entries using LDPC matrix Code；The base figure of the LDPC matrix can be any base figure in aforementioned exemplary, the basic matrix H of the LDPC matrixBIt can be aforementioned Any basic matrix in example.Wherein, the list entries of decoder can be the soft value sequence of LDPC code.
Further, further includes: determine spreading factor Z.The communication equipment of receiving end can receive comprising being compiled based on LDPC The signal of code, obtains the soft value sequence of wherein LDPC code, and determines corresponding spreading factor Z.
Decoder, which carries out decoding to list entries using LDPC matrix, can be using the corresponding LDPC matrix of spreading factor Z The soft value sequence of LDPC code is decoded.
Wherein LDPC matrix basic matrix HBIt can be any basic matrix enumerated in foregoing embodiments or relative to preceding State any basic matrix enumerated and transformation occurs for words and deeds sequence or column sequence converts, or row sequence and column sequence it is equal The basic matrix converted, base figure include at least submatrix A and submatrix B, can also include submatrix C, submatrix D and son Matrix E, each section can be with reference to the descriptions in foregoing embodiments, and details are not described herein again.
In a kind of possible design, the basic matrix H of LDPC codeBCan be stored in memory, get extension because The corresponding LDPC matrix of sub- Z can decode the soft value of LDPC code；
In another possible implementation, due to the basic matrix of LDPC code have it is multiple, according to matrix structure save meeting Biggish memory space is occupied, the base figure of LDPC code can also be saved in memory, progressively or column by column saves each respectively Then the deviant of nonzero element in basic matrix obtains LDPC according to the deviant of Ji Tu and the corresponding basic matrix of spreading factor Z Matrix.
It should be noted that only illustrate herein, it is not limited thereto system.
Decoding is the inverse process of coding, the basic matrix H usedBWith identical as the basic matrix in coding method embodiment Feature.To basic matrix HBExtension obtains LDPC matrix H can also be with reference encoder embodiment of the method.
In a communications system, before the interpretation method, communication device can also carry out following one or more operations: connect Packet receiving contains the signal encoded based on LDPC, demodulates to signal, deinterleaves and solve rate-matched and obtain the soft value of LDPC code.
In one possible implementation, following one or more can be saved:
A) for obtaining any basic matrix H enumerated in above-mentioned each implementationBIn parameter, based on the parameter can be with Obtain the basic matrix HB；For example, the parameter may include following one or more: the deviant in basic matrix, alternatively, expanding The factor is opened up, alternatively, the base figure of basic matrix, alternatively, code rate etc..
B) any basic matrix H enumerated in above-mentioned each implementationB；
C) it is based on the basic matrix HBMatrix after extension；
D) based on any basic matrix H enumerated in above-mentioned each implementationBBy the transformed basic matrix of row/column.This Shen Please in, row/column transformation refers to row transformation or rank transformation or row transformation and rank transformation；
E) based on the matrix after the transformed basic matrix extension of the row/column.
In one possible implementation, list entries is encoded using low-density checksum LDPC matrix, It can be during coding or decoding, one or more kinds of progress in the following way:
I. basic matrix H a) is obtained based on above-mentionedB, the basic matrix H based on acquisitionBCoding or decoding；Or based on acquisition Basic matrix HBRow/column exchange is carried out, based on the transformed basic matrix coding of row/column or decoding.Here it is encoded based on basic matrix Or decoding can also include optionally extended matrix coding or decoding based on basic matrix；
Ii. the basic matrix for being based on b) or d) saving (saves basic matrix HBOr save based on basic matrix HBRow/column becomes Basic matrix after changing) coding perhaps decodes or the basic matrix based on the preservation carries out row/column transformation, it is converted based on row/column Basic matrix coding or decoding afterwards.Here, it encodes or decodes based on basic matrix, can also include being based on group moment optionally The extended matrix coding of battle array or decoding；
Iii. it is based on c) or e) being encoded or being decoded.
Preservation involved in the application, what can be referred to is stored in one or more memory.It is one or Multiple memories can be individual setting, be also possible to be integrated in encoder or decoder, processor, chip, communication dress It sets or terminal.One or more of memories are also possible to a part and are separately provided, a part be integrated in decoder, In processor, chip, communication device or terminal, the type of memory can be any form of storage medium, and the application is simultaneously Not to this restriction.
Fig. 5 gives a kind of structural schematic diagram of communication device 500, and device 500 can be used for realizing above method embodiment Described in method, may refer to the explanation in above method embodiment.The communication device 500 can be chip, and base station is whole End or other network equipments.
The communication device 500 includes one or more processors 501.The processor 501 can be general processor Or application specific processor etc..Such as it can be baseband processor or central processing unit.Baseband processor can be used for communication protocols View and communication data handled, central processing unit can be used for communication device (e.g., base station, terminal or chip etc.) into Row control, executes software program, the data of processing software program.
In a kind of possible design, the communication device 500 includes one or more processors 501, and described one A or multiple processors 501 can realize the function of above-mentioned encoder, and in alternatively possible design, above-mentioned encoder be can be A part of the processor 501, function of the processor 501 in addition to realizing encoder, can also realize other function.
The communication device 500 encodes list entries using LDPC matrix；The base figure of the LDPC matrix can be Any base figure in aforementioned exemplary or words and deeds sequence generation transformation or column sequence relative to the aforementioned any base figure enumerated It converts, or the base figure that row sequence and column sequence convert, the basic matrix H of the LDPC matrixBIt can be aforementioned reality Apply any basic matrix in example or words and deeds sequence generation transformation or column sequence relative to the aforementioned any basic matrix enumerated It converts, or the basic matrix that row sequence and column sequence convert.Wherein, the list entries of encoder can be information Bit sequence.
In a kind of possible design, one or more processors 501 can realize the function of above-mentioned decoder, another In a kind of possible design, above-mentioned decoder can be a part of the processor 501.
The communication device 500 may be used in LDPC matrix and decode to list entries；The base figure of the LDPC matrix Can for any base figure in aforementioned exemplary or relative to the aforementioned any base figure enumerated and words and deeds sequence occur transformation or Column sequence converts, or the base figure that row sequence and column sequence convert, the basic matrix H of the LDPC matrixBCan be Any basic matrix in aforementioned exemplary or words and deeds sequence generation transformation or column relative to the aforementioned any basic matrix enumerated Sequence converts, or the basic matrix that row sequence and column sequence convert.Wherein, the list entries of decoder can be Soft value sequence.
In a kind of optional design, processor 501 also may include instruction 503, and described instruction can be in the processor On be run so that the communication device 500 execute above method embodiment described in method.
In another possible design, communication device 500 also may include circuit, and aforementioned side may be implemented in the circuit The function of encoder or decoder or encoder and decoder in method embodiment.
Optionally, it may include one or more memories 502 in the communication device 500, have instruction 504 thereon, Described instruction can be run on the processor, so that the communication device 500 executes described in above method embodiment Method.Optionally, data can also be stored in the memory.It also can store instruction and/or number in optional processor According to.The processor and memory can be separately provided, and also can integrate together.Optionally, one or more memories 502 Can store parameter relevant to basic matrix, such as deviant, base figure expands to matrix, each row in basic matrix based on base figure, Spreading factor etc..Optionally, one or more of memories 502 can store basic matrix or be extended based on basic matrix To matrix.
Optionally, the communication device 500 can also include transceiver 505 and antenna 506.The processor 501 can With referred to as processing unit, communication device (terminal or base station) is controlled.It is single that the transceiver 505 is properly termed as transmitting-receiving Member, transceiver, transmission circuit or transceiver etc., for realizing the transmission-receiving function of communication device by antenna 506
Optionally, the communication device 500 can also include for generating the device of transmission block CRC, for code block segmentation With the device of CRC check, the interleaver for intertexture or the modulator for modulation treatment etc..One or more can be passed through A processor 501 realizes the function of these devices.
Optionally, the communication device 500 can also include the demodulator for demodulation operation, the solution for deinterleaving Interleaver or device etc. for solving rate-matched.These devices can be realized by one or more processors 501 Function.
Fig. 6 gives a kind of schematic diagram of communication system 600, includes that communication equipment 60 and communication are set in communication system 600 Standby 61, wherein information data sends and receivees between communication equipment 60 and communication equipment 61.Communication equipment 60 and 61 can be The communication fill 500 or communication equipment for 60 and communication device 500 is respectively included, information data is received and transmitted. In one example, communication equipment 60 can be terminal, and corresponding communication equipment 61 can be base station；In another example, Communication equipment 60 is base station, and corresponding communication equipment 61 can be terminal.
Art technology is any it will also be appreciated that the various illustrative components, blocks that the embodiment of the present invention is listed (illustrative logical block) and step (step) can by electronic hardware, computer software, or both knot Conjunction is realized.Such function is that the design for depending on specific application and whole system is realized by hardware or software It is required that.Those skilled in the art can be used various methods and realize the function, but this for every kind of specific application Kind, which is realized, is understood not to the range beyond protection of the embodiment of the present invention.
Various illustrative logic units described in the embodiment of the present invention and circuit can be by general processors, number Word signal processor, specific integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logic devices, from Door or transistor logic are dissipated, discrete hardware components or above-mentioned any combination of design carry out implementation or operation described function.It is logical It can be microprocessor with processor, optionally, which may be any traditional processor, controller, micro- Controller or state machine.Processor can also be realized by the combination of computing device, such as digital signal processor and Wei Chu Device, multi-microprocessor are managed, one or more microprocessors combine a digital signal processor core or any other like Configuration is to realize.
The finger that the step of method described in the embodiment of the present invention or algorithm can be directly embedded into hardware, processor executes Order or the combination of the two.Memory can be RAM memory, flash memory, ROM memory, eprom memory, EEPROM and deposit Other any form of storaging mediums in reservoir, register, hard disk, moveable magnetic disc, CD-ROM or this field.For example, storage Device can be connect with processor, so that processor can read information from memory, and can be to memory stored and written information. Optionally, memory can also be integrated into the processor.Processor and memory can be set in ASIC, and ASIC can be set In UE.Optionally, processor and memory also can be set in the different components in UE.
Through the above description of the embodiments, it is apparent to those skilled in the art that the present invention can be with It is realized with hardware realization or firmware realization or their combination mode.When using software program realize when, can all or It partly realizes in the form of a computer program product, the computer program product includes one or more computer instructions. When loading on computers and executing the computer instruction, entirely or partly generate according to stream described in the embodiment of the present invention Journey or function.When being realized using software program, above-mentioned function can also be stored in computer-readable medium or as meter One or more instructions or code on calculation machine readable medium are transmitted.The computer can be general purpose computer, dedicated Computer, computer network or other programmable devices.The computer instruction can store in computer-readable storage medium In matter, or transmit from a computer readable storage medium to another computer readable storage medium.Computer-readable medium Including computer storage media and communication media, wherein communication media includes convenient for transmitting and counting from a place to another place Any medium of calculation machine program.Storage medium can be any usable medium that computer can access.As example but unlimited In: computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disc storages, magnetic disk storage medium or Other magnetic storage apparatus or can be used in carry or store have instruction or data structure form desired program code simultaneously It can be by any other medium of computer access.Furthermore.Any connection appropriate can become computer-readable medium.Example Such as, if software is using coaxial cable, optical fiber cable, twisted pair, Digital Subscriber Line (DSL) or such as infrared ray, wirelessly What the wireless technology of electricity and microwave etc was transmitted from website, server or other remote sources, then coaxial cable, optical fiber light The wireless technology of cable, twisted pair, DSL or such as infrared ray, wireless and microwave etc includes in the definition of affiliated medium.Such as Used in the present invention, disk (Disk) and dish (disc) include compression optical disc (CD), laser disc, optical disc, Digital Versatile Disc (DVD), floppy disk and Blu-ray Disc, the usually magnetic replicate data of which disk, and dish is then with laser come optical replicate data.On The combination in face should also be as including within the protection scope of computer-readable medium.
In short, being not intended to limit of the invention the foregoing is merely the preferred embodiment of technical solution of the present invention Protection scope.All within the spirits and principles of the present invention, any modification, equivalent replacement, improvement and so on should be included in Within protection scope of the present invention.

Claims (23)

1. a kind of coding method, which is characterized in that the described method includes:
List entries is encoded using low-density checksum LDPC matrix；
The LDPC matrix is obtained based on base figure, and the base figure includes submatrix A, submatrix B, submatrix C, submatrix D With submatrix E, wherein
The submatrix A is mARow nAThe matrix of column, mA、nAFor positive integer, and 4≤mA≤ 7, nA=10；
The submatrix B is mARow mAThe matrix of column, the submatrix B include the submatrix of the column that weight is 3 and double diagonal arrangements B'；
The submatrix D includes m in matrix FDRow, the matrix F are mFRow (mA+nA) column matrix, mD、mFFor positive integer, 0≤ mD≤mF, 35≤mF≤38；
The submatrix C is mARow mDThe full 0 matrix of column；
The submatrix E is mDRow mDThe unit matrix of column；
Wherein, in the matrix F, the weight of 9 rows is that the weight of 3,1 row is 2.
2. a kind of interpretation method, which is characterized in that the described method includes:
List entries is decoded using low-density checksum LDPC matrix；
The LDPC matrix is obtained based on base figure, and the base figure includes submatrix A, submatrix B, submatrix C, submatrix D With submatrix E, wherein
The submatrix A is mARow nAThe matrix of column, mA、nAFor positive integer, and 4≤mA≤ 7, nA=10；
The submatrix B is mARow mAThe matrix of column, the submatrix B include the submatrix of the column that weight is 3 and double diagonal arrangements B'；
The submatrix D includes m in matrix FDRow, the matrix F are mFRow (mA+nA) column matrix, mD、mFFor positive integer, 0≤ mD≤mF, 35≤mF≤38；
The submatrix C is mARow mDThe full 0 matrix of column；
The submatrix E is mDRow mDThe unit matrix of column；
Wherein, in the matrix F, the weight of 9 rows is that the weight of 3,1 row is 2.
3. method according to claim 1 or 2, which is characterized in that in the matrix F, wherein the weight of 1 column is 16,1 column Weight be 18,1 column weight be 11,2 column weight be 10,1 column weight be 9,1 arrange weight be 8,1 arrange weight be 7,1 The weight of column is that the weight that the weight that the weight of 6,2 column is 4,1 column is 3,2 column is 2.
4. according to the method described in claim 3, it is characterized in that, if mA> 4, weight of remaining column is 0 in the matrix F.
5. a kind of coding method, which is characterized in that the described method includes:
List entries is encoded using low-density checksum LDPC matrix；
The LDPC matrix is obtained based on base figure, and the base figure includes submatrix A, submatrix B, submatrix C, submatrix D With submatrix E, wherein
The submatrix A is mARow nAThe matrix of column, mA、nAFor positive integer, and 4≤mA≤ 7, nA=10；
The submatrix B is mARow mAThe matrix of column, the submatrix B include the submatrix of the column that weight is 3 and double diagonal arrangements B'；
The submatrix D includes m in matrix FDRow, the matrix F are mFRow (mA+nA) column matrix, mD、mFFor positive integer, 0≤ mD≤mF, 35≤mF≤38；
The submatrix C is mARow mDThe full 0 matrix of column；
The submatrix E is mDRow mDThe unit matrix of column；
Wherein, it is that the weight that 18,1 column weight is 11,2 column is that wherein the weight of 1 column, which is the weight of 16,1 column, in the matrix F It is the weights of 8,1 column be the weights of 7,1 column be the weight of 6,2 column is the weight of 4,1 column that the weight of 10,1 column, which is the weight of 9,1 column, Weight for 3,2 column is 2.
6. a kind of interpretation method, which is characterized in that the described method includes:
List entries is decoded using low-density checksum LDPC matrix；
The LDPC matrix is obtained based on base figure, and the base figure includes submatrix A, submatrix B, submatrix C, submatrix D With submatrix E, wherein
The submatrix A is mARow nAThe matrix of column, mA、nAFor positive integer, and 4≤mA≤ 7, nA=10；
The submatrix B is mARow mAThe matrix of column, the submatrix B include the submatrix of the column that weight is 3 and double diagonal arrangements B'；
The submatrix D includes m in matrix FDRow, the matrix F are mFRow (mA+nA) column matrix, mD、mFFor positive integer, 0≤ mD≤mF, 35≤mF≤38；
The submatrix C is mARow mDThe full 0 matrix of column；
The submatrix E is mDRow mDThe unit matrix of column；
Wherein, in the matrix F, wherein the weight that the weight of 1 column is 16,1 column is that the weight that 18,1 column weight is 11,2 column is It is the weights of 8,1 column be the weights of 7,1 column be the weight of 6,2 column is the weight of 4,1 column that the weight of 10,1 column, which is the weight of 9,1 column, Weight for 3,2 column is 2.
7. method according to claim 5 or 6, which is characterized in that if mA> 4, weight of remaining column is in the matrix F 0。
8. according to the described in any item methods of claim 5 to 7, which is characterized in that meet the 10 of orthohormbic structure in the matrix F In row, the weight of 9 rows is that the weight of 3,1 row is 2.
9. method according to any one of claims 1 to 9, the matrix F includes at least 10 rows, is appointed at least 10 rows Adjacent rows of anticipating are orthogonal.
10. method according to any one of claims 1 to 9, the matrix F includes every at least 5 groups, described at least 5 groups One group includes at least 2 rows, and at least 2 rows are orthogonal.Optionally, at least 2 rows can be continuous row.
11. method according to claim 9 or 10, which is characterized in that 10 rows in the matrix F, wherein 14 in 1 row It is classified as,
14 column in remaining 9 row are one of the following respectively,
12. according to the method for claim 11, which is characterized in that 14 column in 10 rows in the matrix F include following Each row, or each column:
13. according to the method for claim 12, which is characterized in that mA=7, the weight of each row of the matrix F is respectively as follows:
5,3,4,4,4,3,4,4,3,4,4,3,3,3,3,2,3,3,2,4,2,3,2,4,2,3,3,3,3,3,2,3,3,3,3.
14. according to the method for claim 13, which is characterized in that 14 column in the matrix F include following row, or Each column:
15. according to the method for claim 14, which is characterized in that mA+mD=42, the base figure includes as each in base Figure 30 a Capable or each column.
16. according to claim 1 to 15 described in any item methods, which is characterized in that the LDPC matrix is based on the base Base figure of the figure after space exchanges or arranges exchange or row exchange and column exchange obtains.
17. a kind of device, for executing such as the described in any item methods of claim 1 to 16.
18. a kind of communication device, which is characterized in that the communication device includes processor, memory and is stored in memory Instruction that is upper and can running on a processor, when described instruction is run, so that the communication device executes such as claim 1 To 16 described in any item methods.
19. a kind of terminal, which is characterized in that filled including communication described in device as claimed in claim 17 or claim 18 It sets.
20. a kind of base station, which is characterized in that filled including communication described in device as claimed in claim 17 or claim 18 It sets.
21. a kind of communication system, it is characterised in that including terminal as claimed in claim 19 and as claimed in claim 20 Base station.
22. a kind of computer readable storage medium, including instruction, when run on a computer, so that computer executes such as The described in any item methods of claim 1 to 16.
23. a kind of computer program product, when run on a computer, so that computer perform claim requires 1 to 16 Method described in one.
CN201710454030.3A 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing Pending CN109150191A (en)

Priority Applications (20)

Application Number Priority Date Filing Date Title
CN201810771585.5A CN109067407B (en) 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing
CN201710454030.3A CN109150191A (en) 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing
EP17913431.7A EP3588786B1 (en) 2017-06-15 2017-07-13 Qc-ldpc codes for 3gpp 5g mobile radio
CA3055231A CA3055231C (en) 2017-06-15 2017-07-13 Information processing method and communication apparatus
CN201780092144.6A CN110754042B (en) 2017-06-15 2017-07-13 Information processing method and communication device
CN202010009164.6A CN111416625B (en) 2017-06-15 2017-07-13 Information processing method and communication device
EP22198435.4A EP4187794A1 (en) 2017-06-15 2017-07-13 Qc-ldpc codes for 3gpp 5g mobile radio
RU2019133313A RU2740154C1 (en) 2017-06-15 2017-07-13 Information processing method and communication device
PCT/CN2017/092878 WO2018227681A1 (en) 2017-06-15 2017-07-13 Information processing method and communication apparatus
JP2019556313A JP6820438B2 (en) 2017-06-15 2017-07-13 Information processing method and communication device
BR112019020158-0A BR112019020158B1 (en) 2017-06-15 2017-07-13 ENCODING METHOD, DECODING METHOD, INFORMATION PROCESSING METHOD, APPLIANCE, TERMINAL, BASE STATION, COMMUNICATION SYSTEM, COMPUTER-READable STORAGE MEDIA AND COMPUTER PROGRAM PRODUCT
KR1020197027252A KR102194029B1 (en) 2017-06-15 2017-07-13 Information processing method and communication device
AU2017418080A AU2017418080B9 (en) 2017-06-15 2017-07-13 Information processing method and communication apparatus
PCT/CN2018/091423 WO2018228514A1 (en) 2017-06-15 2018-06-15 Method for information processing and communication device
US16/566,331 US10742235B2 (en) 2017-06-15 2019-09-10 Method and apparatus for low density parity check channel coding in wireless communication system
ZA2019/06314A ZA201906314B (en) 2017-06-15 2019-09-25 Information processing method and communication apparatus
US16/923,841 US11296726B2 (en) 2017-06-15 2020-07-08 Method and apparatus for low density parity check channel coding in wireless communication system
JP2021000141A JP7221999B2 (en) 2017-06-15 2021-01-04 Information processing method and communication device
US17/684,144 US11611356B2 (en) 2017-06-15 2022-03-01 Method and apparatus for low density parity check channel coding in wireless communication system
US18/185,998 US11996863B2 (en) 2017-06-15 2023-03-17 Method and apparatus for low density parity check channel coding in wireless communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710454030.3A CN109150191A (en) 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing

Related Child Applications (1)

Application Number Title Priority Date Filing Date
CN201810771585.5A Division CN109067407B (en) 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing

Publications (1)

Publication Number Publication Date
CN109150191A true CN109150191A (en) 2019-01-04

Family

ID=64816458

Family Applications (2)

Application Number Title Priority Date Filing Date
CN201810771585.5A Active CN109067407B (en) 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing
CN201710454030.3A Pending CN109150191A (en) 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing

Family Applications Before (1)

Application Number Title Priority Date Filing Date
CN201810771585.5A Active CN109067407B (en) 2017-06-15 2017-06-15 The method, apparatus and communication equipment of information processing

Country Status (1)

Country Link
CN (2) CN109067407B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
USRE49989E1 (en) 2017-06-10 2024-05-28 Qualcomm Incorporated Communication techniques involving pairwise orthogonality of adjacent rows in LPDC code

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011029362A1 (en) * 2009-09-11 2011-03-17 北京泰美世纪科技有限公司 Configuration method of ldpc code check matrix and encoding method and encoding apparatus based on the configuration method
CN105075128A (en) * 2013-02-13 2015-11-18 高通股份有限公司 Design for lifted ldpc codes having high parallelism, low error floor, and simple encoding principle
US20160087648A1 (en) * 2014-09-18 2016-03-24 Broadcom Corporation Puncture-aware low density parity check (LDPC) decoding
CN105827251A (en) * 2015-01-23 2016-08-03 英派尔科技开发有限公司 Parity check code encoder
US20160345028A1 (en) * 2015-05-19 2016-11-24 Samsung Electronics Co., Ltd. Transmitting apparatus and interleaving method thereof

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1961499B (en) * 2004-04-02 2013-06-05 苹果公司 Space-time transmit diversity systems and methods for OFDM applications
CN101515839A (en) * 2008-02-22 2009-08-26 大唐移动通信设备有限公司 Method, device and system for outputting codes
CN101662290B (en) * 2008-08-26 2013-08-28 华为技术有限公司 Method and device for generating and coding quasi-cyclic LDPC code
CN101834613B (en) * 2009-03-09 2012-11-21 电信科学技术研究院 Encoding method of LDPC (Low Density Parity Check) code and encoder
CN102315911B (en) * 2011-09-29 2017-10-27 中兴通讯股份有限公司 A kind of low density parity check code encoding method and device
WO2014199865A1 (en) * 2013-06-12 2014-12-18 ソニー株式会社 Data processing device, and data processing method
CN104917536B (en) * 2014-03-11 2019-11-12 中兴通讯股份有限公司 A kind of method and device for supporting Low Bit-rate Coding

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011029362A1 (en) * 2009-09-11 2011-03-17 北京泰美世纪科技有限公司 Configuration method of ldpc code check matrix and encoding method and encoding apparatus based on the configuration method
CN105075128A (en) * 2013-02-13 2015-11-18 高通股份有限公司 Design for lifted ldpc codes having high parallelism, low error floor, and simple encoding principle
US20160087648A1 (en) * 2014-09-18 2016-03-24 Broadcom Corporation Puncture-aware low density parity check (LDPC) decoding
CN105827251A (en) * 2015-01-23 2016-08-03 英派尔科技开发有限公司 Parity check code encoder
US20160345028A1 (en) * 2015-05-19 2016-11-24 Samsung Electronics Co., Ltd. Transmitting apparatus and interleaving method thereof

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
USRE49989E1 (en) 2017-06-10 2024-05-28 Qualcomm Incorporated Communication techniques involving pairwise orthogonality of adjacent rows in LPDC code

Also Published As

Publication number Publication date
CN109067407B (en) 2019-11-15
CN109067407A (en) 2018-12-21

Similar Documents

Publication Publication Date Title
US11689220B2 (en) Method and device for interleaving data
CN109327225B (en) The method, apparatus and communication equipment of information processing
CN110535474B (en) Information processing method and communication device
JP6815537B2 (en) Information processing methods, equipment, and communication equipment
CN108809487A (en) Method, base station and the terminal device of transmission data
KR20200017520A (en) Polar Code Encoding Method and Device
JP6820438B2 (en) Information processing method and communication device
CN116366072A (en) Data encoding method and apparatus therefor
TW202116021A (en) Joint encoding schemes with interleaver and tone mapper for multi-ru operation
CN108809486A (en) Polar code coding/decoding methods and device
CN109150191A (en) The method, apparatus and communication equipment of information processing
CN107733439B (en) LDPC (Low Density parity check) coding method, coding device and communication equipment
WO2018171748A1 (en) Resource mapping method and apparatus thereof
CN103516478A (en) Method and device for information sending
US8443253B2 (en) Turbo decoding device and communication device
WO2018201597A1 (en) Information processing method and communication apparatus
WO2018201540A1 (en) Information processing method and communication apparatus
WO2024164762A1 (en) Data transmission methods, communication apparatuses, and storage medium
WO2018201547A1 (en) Information processing method and communication apparatus
WO2018201609A1 (en) Information processing method and communication apparatus

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination