Nothing Special   »   [go: up one dir, main page]

CN108023677B - Information processing method and device and wireless communication equipment - Google Patents

Information processing method and device and wireless communication equipment Download PDF

Info

Publication number
CN108023677B
CN108023677B CN201710061834.7A CN201710061834A CN108023677B CN 108023677 B CN108023677 B CN 108023677B CN 201710061834 A CN201710061834 A CN 201710061834A CN 108023677 B CN108023677 B CN 108023677B
Authority
CN
China
Prior art keywords
base matrix
equal
matrix
factor
spreading factor
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.)
Active
Application number
CN201710061834.7A
Other languages
Chinese (zh)
Other versions
CN108023677A (en
Inventor
郑晨
马亮
魏岳军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
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
Publication of CN108023677A publication Critical patent/CN108023677A/en
Application granted granted Critical
Publication of CN108023677B publication Critical patent/CN108023677B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • 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
    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Landscapes

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

Abstract

The present application provides a numberA method of data transmission and a wireless communication device. Wherein the method comprises the following steps: acquiring a first base matrix of the LDPC code; according to the first base matrix and the spreading factor zfAnd free factor rfThe information sequence is encoded to obtain a first encoding sequence. By adopting the method and the equipment provided by the application, the free factor r is introducedfAs one degree of freedom, the factor z can be generated and expandedfWhen the corresponding second base matrix is adopted, completely different second base matrix structure distribution is obtained, thereby lightening the spreading factor zfThe second base matrix generated as described below has a problem of a high error floor.

Description

Information processing method and device and wireless communication equipment
The present application claims priority of chinese patent applications, whose entire contents are incorporated by reference, of chinese patent office, application number is 201610973373.6, entitled "method for generating base matrix for low density parity check code and wireless communication device" filed on 3/11/2016, chinese patent applications, whose application number is 201610985850.0, entitled "method for generating base matrix for low density parity check code and wireless communication device", filed on 9/11/2016, chinese patent applications, whose application number is 201611141250.2, entitled "method for data transmission and wireless communication device", filed on 12/2016, and chinese patent applications, whose application number is 201710010645.7, entitled "method for data transmission and wireless communication device", filed on 6/1/2017.
Technical Field
The embodiment of the invention relates to the field of communication, in particular to an information processing method, an information processing device and wireless communication equipment.
Background
Low Density Parity Check (LDPC) codes are a class of linear block codes with sparse check matrices. The LDPC not only has good performance approaching to the Shannon limit, but also has the characteristic of flexible structure and low decoding complexity, so the LDPC can be widely applied to various communication systems.
When using LDPC for data transmission, a base matrix needs to be constructed for a wireless communication device first. In a wireless communication system, radio Resource Blocks (RBs) of different sizes may be allocated to a wireless communication device according to different transmission requirements, and the LDPC length supported by the wireless communication device is different under the RBs of different sizes. In order to enable the wireless communication device to be compatible with the LDPC with different code lengths, a base matrix formed by m rows and n columns of matrix elements may be generated in advance, where m is n-k, the product of k and the spreading factor is the length of an information sequence in the LDPC, and values of m, n, and k are positive integers and are preset to the spreading factor corresponding to each LDPC length. After the LDPC length is determined, the data transmission equipment firstly acquires an expansion factor corresponding to the code length, and then uses the expansion factor and the base matrix for expansion, so as to obtain a check matrix corresponding to the code length. By adopting the method, different check matrixes can be obtained on the basis of the base matrix when the LDPC lengths are different, so that the wireless communication equipment can support the LDPC with different code lengths.
However, when the same base matrix is expanded by using a plurality of different spreading factors, it is often difficult to ensure that each check matrix formed has good loop length characteristics, e.g., the number of 4 loops is small. Under certain spreading factors, the base matrix generated by spreading the base matrix has a higher error floor, thereby affecting the reliability of data transmission by using the LDPC with the code length corresponding to the spreading factor.
Disclosure of Invention
The application provides an information processing method, an information processing device and wireless communication equipment, which aim to solve the problem that a base matrix generated by expanding the base matrix has a higher error floor under certain spreading factors, and the transmission reliability of data processed by the method is improved.
In a first aspect, the present application provides a method for generating a check matrix of a low density parity check code, including: acquiring a first base matrix of an LDPC code, wherein m is the row number of the first base matrix, and n is the column number of the first base matrix; obtaining a spreading factor z of the first base matrixfWherein z isfThe value of (a) is a positive integer; generating a second base matrix of the LDPC code, wherein m is the number of rows of the second base matrix, n is the number of columns of the second base matrix, matrix elements equal to-1 in the first base matrix are identical in position to matrix elements equal to-1 in the second base matrix, and at least one matrix element p in the ith row and the jth column of the second base matrix existsf,i,jIs based on the matrix element p of the ith row and the jth column in the first base matrixi,jZ is saidfAnd free factor rfIs generated in which pf,i,j＜zf，rfThe values of m, n, i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n.
With this implementation, by introducing the free factor rfAs one degree of freedom, the free factor r of the transformfCan be at the generation and expansion factor zfAnd obtaining completely different matrix structure distribution when corresponding to the second base matrix. So that the spreading factor z can be used directlyfWhen the error level of the base matrix obtained by expanding the first base matrix is higher, the second base matrix with lower error level is obtained by changing the structural distribution of the matrix, and the expansion factor z is reducedfThe second base matrix generated as described below has a problem of a high error floor.
With reference to the first aspect, in a first possible implementation manner of the first aspect, a ring length characteristic of the second base matrix is better than or equal to that of the first base matrix.
With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect,
Figure BDA0001219790000000021
wherein c is a preset constant; or,
Figure BDA0001219790000000022
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or,
Figure BDA0001219790000000023
or,
Figure BDA0001219790000000024
in the above mode, pf,i,jThe values are integers:
Figure BDA0001219790000000025
or
Figure BDA0001219790000000026
Wherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000027
or
Figure BDA0001219790000000028
Wherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000031
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or,
Figure BDA0001219790000000032
or
Figure BDA0001219790000000033
Or,
Figure BDA0001219790000000034
or
Figure BDA0001219790000000035
In each of the above embodiments, c may be an integer power of 2, or may be zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
With reference to the first aspect or the first to second possible implementation manners of the first aspect, in a third possible implementation manner of the first aspect, before the obtaining the second base matrix of the LDPC code, the method further includes: obtaining the spreading factor zfCorresponding free factor rf。
With reference to the first aspect to or the first to third possible implementation manners of the first aspect, in a fourth possible implementation manner of the first aspect, the method further includes: and coding the sequence to be coded by using the second base matrix, thereby obtaining a first coded sequence.
With reference to the first aspect to or the first to third possible implementation manners of the first aspect, in a fifth possible implementation manner of the first aspect, the method further includes: obtaining a second coding sequence; coding the second encoded sequence using the second basis matrix.
In a second aspect, the present application further provides a method for data transmission, where the method includes: acquiring a first base matrix of a low-density parity check LDPC code, wherein m is the row number of the first base matrix, n is the column number of the first base matrix, and the values of m and n are positive integers;
according to the first base matrix and the spreading factor zfAnd free factor rfCoding the information sequence to obtain a first coding sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0.
With reference to the second aspect, in a first possible implementation manner of the second aspect, the scaling factor z is a function of the first base matrixfAnd free factor rfEncoding an information sequence to obtain a first encoding sequence, comprising: for each ith row and jth column of matrix elements p in the first base matrixi,jThe spreading factor zfAnd free factor rfCalculating pf,i,jWherein p isf,i,j＜zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n; according to pf,i,jThe information sequence is encoded to obtain a first encoding sequence.
With reference to the second aspect or the first possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, the method further includes: and transmitting the first coding sequence.
In a third aspect, the present application further provides a method for data transmission, where the method includes: acquiring a first base matrix of a low-density parity check LDPC code, wherein m is the row number of the first base matrix, n is the column number of the first base matrix, and the values of m and n are positive integers;
according to the first base matrix and the spreading factor zfAnd free factor rfDecoding the first code sequence to obtain an information sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0.
With reference to the third aspect, in a first possible implementation manner of the third aspect, the spreading factor z is determined according to the first base matrixfAnd free factor rfDecoding the second coding sequence to obtain an information sequence, comprising: for each ith row and jth column of matrix elements p in the first base matrixi,jThe spreading factor zfAnd free factor rfCalculating pf,i,jWherein p isf,i,j＜zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n; according to pf,i,jAnd decoding the second coding sequence to obtain an information sequence.
With reference to the third aspect or the first possible implementation manner of the third aspect, in a second possible implementation manner of the third aspect, the method further includes: receiving the first encoded sequence.
With reference to the above aspects and any one of various possible implementations, one possible implementation is as follows:
Figure BDA0001219790000000041
wherein c is a preset constant; or,
Figure BDA0001219790000000042
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or,
Figure BDA0001219790000000043
or,
Figure BDA0001219790000000044
in the above mode, pf,i,jThe values are integers:
Figure BDA0001219790000000045
or
Figure BDA0001219790000000046
Wherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000047
or
Figure BDA0001219790000000048
Wherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000049
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or,
Figure BDA0001219790000000051
or
Figure BDA0001219790000000052
Or,
Figure BDA0001219790000000053
or
Figure BDA0001219790000000054
In each of the above embodiments, c may be an integer power of 2, or may be zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
With reference to the above aspects and any one of various possible implementations, one possible implementation is as follows:
pf,i,jthe following formula is satisfied:
Figure BDA0001219790000000055
wherein, g1(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g2(zf) Is represented by zfIs a function of a parameter, and g2(zf)≤zfThe values are integers.
In combination with the above implementations, in one possible implementation, g1(pi,j,rf) May be such that the following formula is satisfied:
Figure BDA0001219790000000056
or
Figure BDA0001219790000000057
Wherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000058
or
Figure BDA0001219790000000059
Wherein c is a constant and is not equal to 0; or,
g1(pi,j,rf)＝pi,j+(c-pi,j)rfwherein c is a constant and is not equal to 0; or,
Figure BDA00012197900000000510
or
Figure BDA00012197900000000511
Or,
Figure BDA00012197900000000512
or
Figure BDA00012197900000000513
In combination with the above implementations, in one possible implementation, g2(zf) The following formula can be satisfied: g2(zf)＝zfOr,
Figure BDA00012197900000000514
in each of the above embodiments, c may be an integer power of 2, or may be zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
With reference to the above aspects and any one of various possible implementations, one possible implementation is as follows: p is a radical off,i,jThe following formula is satisfied:
Figure BDA0001219790000000061
wherein, g3(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g4(zf) Is represented by zfIs a function of a parameter, and 0 < g4(zf)≤1。
In combination with the above implementations, in one possible implementation, g3(pi,j,rf) The following formula is satisfied:
g3(pi,j,rf)＝(pi,j+rf) modc, where c is a constant and is not equal to 0; or,
g3(pi,j,rf)＝(pi,j·rf) modc, where c is a constant and is not equal to 0.
In combination with the above implementations, in one possible implementation, g4(zf) The following formula is satisfied:
g4(zf)＝zfc; or,
Figure BDA0001219790000000062
wherein c is a constant and is not equal to 0.
In each of the above embodiments, c may be an integer power of 2, or may be zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
In a fourth aspect, the present application also provides a wireless communication device that may include unit modules, e.g., an acquisition unit, a processing unit, a transmission unit, etc., for performing the methods described in the foregoing aspects and various implementations. The functions to be realized by the acquisition unit can be realized by a transceiver of the wireless communication equipment or realized by controlling the transceiver by a processor; the functions to be realized by the sending unit can also be realized by a transceiver of the wireless communication device, or the transceiver can also be controlled by a processor; the functions to be performed by the processing unit may then be performed by the processor.
In a fifth aspect, the present application also provides a wireless communication device that may include unit modules, e.g., an acquisition unit, a processing unit, a receiving unit, etc., for performing the methods described in the foregoing aspects and various implementations. The functions to be realized by the acquisition unit can be realized by a transceiver of the wireless communication equipment or realized by controlling the transceiver by a processor; the functions to be realized by the receiving unit can also be realized by a transceiver of the wireless communication device, or the transceiver can also be controlled by a processor; the functions to be performed by the processing unit may then be performed by the processor.
In a sixth aspect, the present application further provides a storage medium, where the storage medium may store a program, and the program may include some or all of the steps in the embodiments of the second base matrix generation method, the encoding method, or the decoding method provided in the present application when executed.
By using this applicationPlease provide a method and apparatus for introducing a free factor rfAs one degree of freedom, the free factor r of the transformfCan be at the generation and expansion factor zfAnd obtaining completely different matrix structure distribution when corresponding to the second base matrix. So that the spreading factor z can be used directlyfWhen the error level of the base matrix obtained by expanding the first base matrix is higher, the second base matrix with lower error level is obtained by changing the structural distribution of the matrix, and the expansion factor z is reducedfThe generated second base matrix has the problem of higher error level, and the reliability of data transmission is improved.
Drawings
In order to more clearly explain the technical solution of the present application, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious to those skilled in the art that other drawings can be obtained according to the drawings without any creative effort.
FIG. 1 is a schematic flow chart illustrating an embodiment of a method for generating a base matrix of an LDPC code according to the present application;
FIG. 2 is a schematic representation of an embodiment of a first basis matrix of the present application;
FIG. 3 is a flowchart illustrating an embodiment of the encoding method of the present application;
FIG. 4 is a flowchart illustrating an embodiment of a decoding method of the present application;
FIG. 5 is a block diagram of an embodiment of a wireless communication device of the present application;
fig. 6 is a schematic structural diagram of another embodiment of a wireless communication device according to the present application.
Detailed Description
The embodiment of the application can be applied to a wireless communication system comprising wireless communication equipment such as network equipment and terminal equipment (terminal device or terminal equipment). For example, LTE system, or other wireless communication systems using various radio access technologies, such as systems using code division multiple access, frequency division multiple access, time division multiple access, orthogonal frequency division multiple access, single carrier frequency division multiple access, and the like, and subsequently evolved systems, such as fifth generation (5G) systems, and the like. The wireless communication device in the embodiments of the present application may be any device in a wireless communication system, such as a network device or a terminal device.
The terminal device may be a device providing voice or data connectivity to a user, a handheld device with wireless connectivity, or other processing device connected to a wireless modem. Wireless terminals, which may be mobile terminals such as mobile telephones (or "cellular" telephones) and computers having mobile terminals, such as portable, pocket, hand-held, computer-included, or vehicle-mounted mobile devices, may communicate with one or more core networks via a Radio Access Network (RAN), which exchanges language and/or data with the RAN. For example, devices such as Personal Communication Service (PCS) phones, cordless phones, Session Initiation Protocol (SIP) phones, Wireless Local Loop (WLL) stations, and Personal Digital Assistants (PDAs) are used. A wireless terminal may also be referred to as a system, a Subscriber Unit (SU), a Subscriber Station (SS), a Mobile Station (MS), a Remote Station (RS), an Access Point (AP), a Remote Terminal (RT), an Access Terminal (AT), a User Terminal (UT), a User Agent (UA), a User Equipment (UE), or a User Equipment (UE).
The network device may be a base station or an access point or may refer to a device in an access network that communicates over the air-interface, through one or more sectors, with wireless terminals. The base station may be configured to interconvert the received air frame and the IP packet as a router between the wireless terminal and the rest of the access network, where the rest of the access network may include an Internet Protocol (IP) network. The base station may also coordinate management of attributes for the air interface. For example, the Base Station may be a Base Transceiver Station (BTS) in GSM or CDMA, a Base Station (NodeB) in WCDMA, or an evolved Node B (eNodeB) in LTE, and the present application is not limited thereto.
In the embodiments of the present specification,
Figure BDA0001219790000000071
meaning that the log value is rounded up,
Figure BDA0001219790000000072
indicating a rounding down of the logarithmic value and mod indicating a modulo operation.
Fig. 1 is a schematic flow chart of an embodiment of the information processing method of the present application. The generation method shown in this embodiment may be performed by a wireless communication device.
In step 101, a wireless communication device obtains a first base matrix of an LDPC code.
The first base matrix may include m rows and n columns of matrix elements, and the code rate may be
Figure BDA0001219790000000081
Or may have other values. For convenience of description, each row of the first base matrix may be represented by 0 th to m-1 th rows, respectively, and each column of the first base matrix may be represented by 0 th to n-1 th columns, respectively. The matrix elements in the ith row and jth column of the first base matrix can be denoted as pi,j。
The wireless communication device may obtain the first basis matrix directly from other devices; or, the number of rows m and the number of columns n may be obtained first, and then the first basis matrix may be constructed by using a density evolution theory or a progressive edge growth (PEG for short). Wherein, the values of m and n can be determined according to the data transmission requirement of the wireless communication equipment. The method of obtaining or constructing the base matrix is not described herein.
Step 102, obtaining an expansion factor zf。
The wireless communication device needs to acquire a spreading factor in addition to the first base matrixzf. Wherein the spreading factor zfThe value of (a) can be determined by the code length of the coding sequence. Generally, z isfThe product of the value of (a) and the number of columns of the basis matrix is the code length of the coding sequence, and the coding sequence can be a sequence obtained by coding the information sequence.
Spreading factor zfThe expansion factor may be any expansion factor that needs to be supported by the first base matrix, or may also be any expansion factor that needs to be supported by the first base matrix, and when the first base matrix is directly expanded, a certain expansion factor of the second base matrix with a higher error level is generated. Wherein, the error level is higher may mean that the error level is higher than a predetermined limit value, and the predetermined limit value may be determined according to an actual requirement of data transmission.
Wherein the spreading factor zfIs a positive integer and needs to be less than the maximum value z of the spreading factor supported by the base matrixmax，zmaxThe value is a preset positive integer. Wherein z ismaxDetermined by the maximum value of the code length of the code sequence, zmaxThe product of the number of columns of the base matrix is the maximum value of the code length of the code sequence. For example, if the base matrix includes 30 columns and the maximum value of the code length of the code sequence is 9600, the maximum value z of the spreading factor supported by the base matrix ismaxIs 320, and z isfMay be any one of 1 to 320.
And 103, generating a second base matrix of the LDPC code.
The wireless communication equipment acquires the first basic matrix and the spreading factor zfThereafter, a scaling factor z may be generatedfAnd the corresponding second base matrix, wherein the number of rows of the second base matrix is m, and the number of columns of the second base matrix is n. When generating the second base matrix, the wireless communication device may correspondingly replace each matrix element of the first base matrix, whose value is not-1, with a corresponding replacement element, where each replacement element may be a corresponding replacement element that is generated by the wireless communication device according to the matrix element and the spreading factor zfAnd free factor rfThe generated replacement element. Wherein the matrix element at ith row and jth column of the first base matrix canTo use pi,jThe replacement element corresponding to the matrix element in the ith row and the jth column in the second base matrix can be represented by pf,i,jAnd (4) showing.
The matrix elements equal to-1 in the first base matrix are in the same positions as the matrix elements equal to-1 in the second base matrix, and at least one matrix element p in the ith row and the jth column of the second base matrix existsf,i,jIs based on the matrix element p of the ith row and the jth column in the first base matrixi,jZ is saidfAnd free factor rfGenerated wherein the pf is,i,j＜zf，rfThe values of m, n, i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n. And the ring length characteristic of the second basis matrix may be better than or equal to the first basis matrix. Wherein, for two matrices a and B, if l represents the ring length, a (l) represents the number of rings with length l in matrix a, and B (l) represents the number of rings with length l in matrix B, a matrix with excellent ring length characteristics can be determined as follows:
l＝4；
comparing A (l) with B (l) (1)
If A (l) is less than B (l), the ring length characteristic of the matrix A is better than that of the matrix B, and the comparison is finished;
if A (l) is larger than B (l), the ring length characteristic of the matrix B is better than that of the matrix A, and the comparison is finished;
if A (l) equals B (l):
if l reaches a maximum value:
the ring length characteristic of the matrix A is equal to the ring length characteristic of the matrix B, and the comparison is finished;
otherwise l equals l +2, return to (1).
The comparison method of the loop length characteristics of the matrix described above is also applicable to other embodiments of the present invention.
For example, if the number of 4 rings of the second base matrix is less than the number of 4 rings of the first base matrix, it indicates that the ring length characteristic of the second base matrix is better than that of the first base matrix. For another example, if the number of 4 loops of the second base matrix is equal to the number of 4 loops of the first base matrix, the number of 6 loops of the second base matrix is further compared, and if the number of 6 loops of the second base matrix is smaller than the number of 6 loops of the first base matrix, the loop length characteristic of the second base matrix is better than that of the first base matrix. For another example, if the numbers of 4-rings and 6-rings of the second base matrix and the first base matrix are equal, respectively, and 6-rings have reached the maximum ring length, it is indicated that the ring length characteristics of the second base matrix and the first base matrix are equal. It should be noted that the above embodiments are only examples, and the embodiments of the present invention are not limited thereto.
To ensure that the finally generated second base matrix has a lower error floor with respect to the first base matrix, the loop length characteristic of the second base matrix may be made better than or equal to the first base matrix. In order to make the ring length characteristic of the second base matrix better than that of the first base matrix, the replacement element pf,i,jThere is also a need to satisfy: the matrix element pi,jReplacement by a corresponding replacement element pf,i,jThe replacement of at least one ring in the front matrix can be eliminated. I.e., if in the pre-replacement matrix, (a)1-a2+a3-a4+...-al)％zf0, wherein a1,a2,a3,a4,...,alReplacing each matrix element on any ring with the length of l in the matrix before replacement, wherein l is an even number which is greater than or equal to 4; then in the post-replacement matrix, (a)1'-a2'+a3'-a4'+...-al')％zfNot equal to 0, wherein, a1',a2',a3',a4',...,al' is a matrix element in the post-replacement matrix, and aq' position in matrix after replacement and aqThe positions in the matrix before replacement are the same, q ═ 1, 2, 3, 4. Wherein the pre-replacement matrix is a matrix of pi,jReplacement by pf,i,jThe former matrix, the alternative matrix is to replace the element pi,jReplacement by pf,i,jThe matrix is then generated.
pf,i,jCan be generated by the wireless communication device using a preset generating function, wherein the preset generating function can be expressed as y (p)i,j,zf,rf) I.e. pf,i,j＝y(pi,j,zf,rf). Wherein r isfIs a free factor and can be a random value; r isfThe values of m, n, i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n.
The preset generation function pf,i,j＝y(pi,j,zf,rf) May include a variety of. For example, the preset generating function
Figure BDA0001219790000000101
Wherein c is a preset constant; or, the preset generating function
Figure BDA0001219790000000102
Wherein z ismaxThe maximum value of the spreading factor supported by the first base matrix; or, the preset generating function
Figure BDA0001219790000000103
Or, the preset generating function
Figure BDA0001219790000000104
It should be noted that the above are only examples of the preset generating functions, and there are many generating functions that meet the predetermined condition, and they are not listed here.
pf,i,jUsually, values are integers, and parts of the above function that may generate fractional numbers may be rounded up or rounded down, for example:
Figure BDA0001219790000000105
can be obtained by rounding
Figure BDA0001219790000000106
Or
Figure BDA0001219790000000107
Or can be obtained by rounding
Figure BDA0001219790000000108
Or
Figure BDA0001219790000000109
Figure BDA00012197900000001010
Can be obtained by rounding
Figure BDA00012197900000001011
Or
Figure BDA00012197900000001012
Figure BDA00012197900000001013
Can be obtained by rounding
Figure BDA0001219790000000111
Or
Figure BDA0001219790000000112
Or can be obtained by rounding
Figure BDA0001219790000000113
Or
Figure BDA0001219790000000114
Wherein,
Figure BDA0001219790000000115
meaning that the log value is rounded up,
Figure BDA0001219790000000116
indicating that the log value is rounded down.
In the above formula, c is constant and is not equal to 0, for simplicityCalculation, c may typically be an integer power of 2, or may take the value zmax。
It should be noted that the above are only examples and are not limited thereto.
Since the output parameter of the preset generating function comprises pi,j,zf,rfWherein p isi,j,zfHave been determined according to rfThe values of the first base matrixes are different, the finally generated second base matrixes are different, and the performances of the second base matrixes are different. Thus, the wireless communication device can also select an appropriate rfSo that the finally generated second base matrix has better performance.
The wireless communication device may first acquire k candidate free factors, which may be acquired by the wireless communication device from other devices or may also be randomly generated by the wireless communication device. Due to pi,j,zfAfter k candidate free factors are obtained, the wireless communication device can respectively generate k candidate matrices, wherein each candidate matrix corresponds to one of the candidate free factors; and then selecting one with the optimal ring length characteristic from the candidate matrixes as the second base matrix. If the ring length characteristic of one candidate matrix is respectively superior to the ring length characteristics of the other k-1 candidate matrices, the ring length characteristic of the candidate matrix is optimal, that is, the candidate matrix is used as a second base matrix, if s candidate matrices exist, s is larger than 1 and smaller than k +1, the ring length characteristics of the s candidate matrices are equal, and the s candidate matrices are superior to the other k-s candidate matrices, one of the s candidate matrices is selected as the second base matrix, for example, one of the s candidate matrices can be selected as the second base matrix according to actual performance simulation.
And generating a kth alternative matrix corresponding to the kth alternative free factor after each matrix element which is not-1 in the first base matrix is replaced by the kth replacement element corresponding to the kth alternative free factor.
Wherein, the matrix element p is positioned in the ith row and the jth column of the first base matrixi,jCorresponding kth replacement element pf,k,i,jGenerating a function p from a presetf,i,j＝y(pi,j,zf,rf，k) Generation, the preset generation function pf,i,j＝y(pi,j,zf,rf.k) Has an output range of pf,i,j＜zf，rf.kThe values of m, n, i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n.
The applicants have found that for each zfAll have one rfCan cause p to bei,jReplacement by pf,i,jThe ring length characteristic of the generated second basis matrix is better than that of the directly used zfAnd expanding the obtained second base matrix for the first base matrix.
For example, when the first basis matrix is as shown in FIG. 2, zfAnd rfThe corresponding relationship between z and z can be shown in table 1, and it should be noted that z in table 1fIs expressed in the form of a 10-ary system, and rfIs expressed in 16-ary.
TABLE 1
Figure BDA0001219790000000121
Figure BDA0001219790000000131
Since z is determined after the first basis matrix is determinedfAnd rfThe corresponding relation between the z and the z can be correspondingly determined, so that the z can be saved in the memory of the wireless communication equipmentfAnd rfThe corresponding relation between them. When the second base matrix needs to be generated, the wireless communication equipment acquires the zfThen, the corresponding r can be directly obtained according to the corresponding relationf.
By adopting the method provided by the embodiment, the expansion factor z is usedfOn the basis of constructing a second base matrix, a free factor r is introducedfAs a degree of freedom by adjusting rfThe values of (A) can obtain completely different LDPC matrix structure distribution, thereby obtaining error correctionThe second base matrix with different layers can reduce the problem that the second base matrix generated by expanding the base matrix has higher error level under certain spreading factors. Compared with the method of adopting a plurality of matrixes to realize continuous code length construction, only one extra r needs to be storedfThe table is only needed, the required storage space is small, and the description is simple.
According to the technical scheme, by improving the shift factor calculation method under different expansion factors, the low-error flat-layer LDPC with a series of lengths can be realized by the first base matrix, and compared with the traditional shift factor calculation method, the method can effectively eliminate the dead pixel and ensure that the check matrix generated under all the expansion factors has lower error flat layers.
Fig. 3 is a schematic flow chart of an embodiment of the information processing method of the present application. The wireless communication device may encode using the second basis matrix generated by the foregoing embodiments.
If the wireless communication device is a sending-end device, the wireless communication device may encode a to-be-coded sequence using the second basis matrix after generating the second basis matrix. Therefore, when the wireless communication device is a sending end device, as shown in fig. 3, after step 103, the method may further include:
and 104, coding the sequence to be coded by using the second base matrix, thereby obtaining a first coded sequence.
After the second basis matrix is generated, the wireless communication device may encode the sequence to be encoded using the second basis matrix. The sequence to be coded may be obtained by the wireless communication device before generating the second base matrix, or may also be obtained by the wireless communication device after generating the second base matrix. Here, it should be noted that the execution order between step 101 and step 102 is not limited in the present application.
And 105, transmitting the first coding sequence.
After the first code sequence is generated, the wireless communication device may modulate and transmit the first code sequence. The process of modulating and transmitting the first encoded sequence is not described in detail herein.
In the above embodiments of the method, the wireless communication device obtains the first base matrix of the LDPC code, and may obtain the spreading factor z according to the first base matrixfAnd free factor rfThe information sequence is encoded to obtain a first encoding sequence. Wherein, the base matrix corresponding to the check matrix of the first coding sequence is a second base matrix, and at least one matrix element p in the ith row and the jth column exists in the second base matrixf, i ,jIs based on the matrix element p of the ith row and the jth column in the first base matrixi,jThe spreading factor zfAnd free factor rfIs generated in which pf,i,j＜zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n.
In one possible implementation, pf,i,jThe following formula is satisfied:
Figure BDA0001219790000000141
wherein, g1(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g2(zf) Is represented by zfIs a function of a parameter, and g2(zf)≤zfThe values are integers.
Wherein, g1(pi,j,rf) May be such that the following formula is satisfied:
Figure BDA0001219790000000142
or
Figure BDA0001219790000000143
Wherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000144
or
Figure BDA0001219790000000145
Wherein c is a constant and is not equal to 0; or,
g1(pi,j,rf)＝pi,j+(c-pi,j)rfwherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000146
or
Figure BDA0001219790000000147
Or,
Figure BDA0001219790000000148
or
Figure BDA0001219790000000149
Or,
Figure BDA00012197900000001410
or
Figure BDA00012197900000001411
g2(zf) The following formula can be satisfied: g2(zf)＝zfOr,
Figure BDA00012197900000001412
in the above formula, c is a constant and is not equal to 0, and for simplicity of calculation, c may be an integer power of 2, or may take the value zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
The function satisfying the above formula can be obtained in various forms, for example,
Figure BDA00012197900000001413
wherein c is a preset constant; or,
Figure BDA00012197900000001414
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or,
Figure BDA0001219790000000151
or,
Figure BDA0001219790000000152
pf,i,jusually, values are integers, and parts of the above function that may generate fractional numbers may be rounded up or rounded down, for example:
Figure BDA0001219790000000153
can be obtained by rounding
Figure BDA0001219790000000154
Or
Figure BDA0001219790000000155
Or can be obtained by rounding
Figure BDA0001219790000000156
Or
Figure BDA0001219790000000157
Figure BDA0001219790000000158
Can be obtained by rounding
Figure BDA0001219790000000159
Or
Figure BDA00012197900000001510
Figure BDA00012197900000001511
Can be obtained by rounding
Figure BDA00012197900000001512
Or
Figure BDA00012197900000001513
Or can be obtained by rounding
Figure BDA00012197900000001514
Or
Figure BDA00012197900000001515
Wherein,
Figure BDA0001219790000000161
meaning that the log value is rounded up,
Figure BDA0001219790000000162
indicating that the log value is rounded down.
In the above formula, c is a constant and is not equal to 0, and for simplicity of calculation, c may be an integer power of 2, 2nN is a positive integer or a value zmax。
For example, for
Figure BDA0001219790000000163
Or
Figure BDA0001219790000000164
c may be a value of 2nOr a constant of e.g. 4 or 8, or a value of zmax。
For the
Figure BDA0001219790000000165
Then
Figure BDA0001219790000000166
Or,
Figure BDA0001219790000000167
another example is:
Figure BDA0001219790000000168
or
Figure BDA0001219790000000169
It should be noted that the above are only examples and are not limited thereto.
In yet another possible implementation, pf,i,jThe following formula is satisfied:
Figure BDA00012197900000001610
wherein, g3(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g4(zf) Is represented by zfIs a function of a parameter, and 0 < g4(zf)≤1。
Wherein, g3(pi,j,rf) The following formula is satisfied:
g3(pi,j,rf)＝(pi,j+rf) modc, where c is a constant and is not equal to 0; or,
g3(pi,j,rf)＝(pi,j·rf) modc, where c is a constant and is not equal to 0.
g4(zf) Satisfies the followingThe formula:
g4(zf)＝zfc, or alternatively,
Figure BDA00012197900000001611
wherein c is a constant and is not equal to 0.
In the above formula, c is a constant and is not equal to 0, and for simplicity of calculation, c may be an integer power of 2, 2nN is a positive integer or a value zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
For example:
Figure BDA0001219790000000171
another example is:
Figure BDA0001219790000000172
it should be noted that the above are only examples and are not limited thereto.
Optionally, the wireless communication device may also obtain a spreading factor zfAnd free factor rf。
In the foregoing embodiment, the step of generating the second base matrix is only an optional implementation manner, and may also be performed for the element p in each first base matrixi,jAccording to pi,jExpansion factor zfAnd free factor rfCalculating pf,i,jAccording to pf,i,jThe information sequence is encoded to obtain a first encoding sequence. It should be noted that the present invention is not limited thereto. Since the check matrix of the first code sequence has a lower error floor, the reliability of data transmission can be improved.
Fig. 4 is a schematic flowchart of an embodiment of the information processing method according to the present application. The wireless communication device may decode using the second basis matrix generated by the foregoing embodiments.
If the wireless communication device is a receiving end device, the wireless communication device may decode the received code sequence using the second basis matrix after generating the second basis matrix. Therefore, when the wireless communication device is a receiving end device, as shown in fig. 4, after step 103, the method may further include:
and 106, acquiring a second coding sequence.
The wireless communication device can receive the wireless signal transmitted by other devices, and then demodulate and the like on the wireless signal to generate the second code sequence. The specific manner of obtaining the second coding sequence is not described herein.
Step 107, decoding the second encoded sequence using the second basis matrix.
After the second code sequence is generated, the wireless communication device may decode the second code sequence using the second basis matrix. The specific manner in which the wireless communication device decodes the second encoded sequence is not described in detail herein.
In the above embodiments, the wireless communication device obtains the first base matrix of the LDPC code, and the spreading factor z is based on the first base matrixfAnd free factor rfAnd decoding the second coding sequence to obtain an information sequence. Wherein, the base matrix corresponding to the check matrix of the second coding sequence is a second base matrix, and at least one matrix element p in the ith row and the jth column exists in the second base matrixf,i,jIs based on the matrix element p of the ith row and the jth column in the first base matrixi,jThe spreading factor zfAnd free factor rfIs generated in which pf,i,j＜zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n.
In one possible implementation, pf,i,jThe following formula is satisfied:
Figure BDA0001219790000000173
wherein, g1(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, takeThe value is an integer, g2(zf) Is represented by zfIs a function of a parameter, and g2(zf)≤zfThe values are integers.
Wherein, g1(pi,j,rf) May be such that the following formula is satisfied:
Figure BDA0001219790000000181
or
Figure BDA0001219790000000182
Wherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000183
or
Figure BDA0001219790000000184
Wherein c is a constant and is not equal to 0; or,
g1(pi,j,rf)＝pi,j+(c-pi,j)rfwherein c is a constant and is not equal to 0; or,
Figure BDA0001219790000000185
or
Figure BDA0001219790000000186
Or,
Figure BDA0001219790000000187
or
Figure BDA0001219790000000188
Or,
Figure BDA0001219790000000189
or
Figure BDA00012197900000001810
g2(zf) The following formula can be satisfied: g2(zf)＝zfOr,
Figure BDA00012197900000001811
in the above formula, c is a constant and is not equal to 0, and for simplicity of calculation, c may be an integer power of 2, or may take the value zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
The function satisfying the above formula can be obtained in various forms, for example,
Figure BDA00012197900000001812
wherein c is a preset constant; or,
Figure BDA00012197900000001813
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or,
Figure BDA00012197900000001814
or,
Figure BDA00012197900000001815
pf,i,jusually, values are integers, and parts of the above function that may generate fractional numbers may be rounded up or rounded down, for example:
Figure BDA00012197900000001816
can be obtained by rounding
Figure BDA0001219790000000191
Or
Figure BDA0001219790000000192
Or can be obtained by rounding
Figure BDA0001219790000000193
Or
Figure BDA0001219790000000194
Figure BDA0001219790000000195
Can be obtained by rounding
Figure BDA0001219790000000196
Or
Figure BDA0001219790000000197
Figure BDA0001219790000000198
Can be obtained by rounding
Figure BDA0001219790000000199
Or
Figure BDA00012197900000001910
Or can be obtained by rounding
Figure BDA00012197900000001911
Or
Figure BDA00012197900000001912
Wherein,
Figure BDA00012197900000001913
meaning that the log value is rounded up,
Figure BDA00012197900000001914
indicating that the log value is rounded down.
In the above formula, c is a constant and is not equal to 0, and for simplicity of calculation, c may be an integer power of 2, 2nN is a positive integer or a value zmax. For example, for
Figure BDA00012197900000001915
Or
Figure BDA00012197900000001916
c may be a value of 2nOr a constant of e.g. 4 or 8, or a value of zmax。
For the
Figure BDA00012197900000001917
Then
Figure BDA00012197900000001918
Or,
Figure BDA0001219790000000201
another example is:
Figure BDA0001219790000000202
or
Figure BDA0001219790000000203
It should be noted that the above are only examples and are not limited thereto.
In yet another possible implementation, pf,i,jThe following formula is satisfied:
Figure BDA0001219790000000204
wherein, g3(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g4(zf) Is represented by zfIs a function of a parameter, and 0 < g4(zf)≤1。
Wherein, g3(pi,j,rf) The following formula is satisfied:
g3(pi,j,rf)＝(pi,j+rf) modc, where c is a constant and is not equal to 0; or,
g3(pi,j,rf)＝(pi,j+rf) modc, where c is a constant and is not equal to 0.
g4(zf) The following formula is satisfied:
g4(zf)＝zfc; or,
Figure BDA0001219790000000205
wherein c is a constant and is not equal to 0.
In the above formula, c is a constant and is not equal to 0, and for simplicity of calculation, c may be an integer power of 2, 2nN is a positive integer or a value zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
For example:
Figure BDA0001219790000000206
another example is:
Figure BDA0001219790000000207
it should be noted that the above are only examples and are not limited thereto. Reference may also be made to the preceding method examples for pf,i,jIs describedThe above-mentioned processes are described.
Optionally, the wireless communication device may also obtain a spreading factor zfAnd free factor rf。
In the foregoing embodiment, the step of generating the second base matrix is only an optional implementation manner, and may also be performed for the element p in each first base matrixi,jAccording to pi,jExpansion factor zfAnd free factor rfCalculating pf,i,jAccording to pf,i,jThe information sequence is decoded. It should be noted that the present invention is not limited thereto.
Since the check matrix of the second code sequence has a lower error floor, the reliability of data transmission can be improved.
Referring to fig. 5, a schematic structural diagram of an embodiment of the wireless communication device of the present application is shown. As shown in fig. 5, the wireless communication apparatus includes: an acquisition unit 501, a processing unit 502, and a transmission unit 503.
Wherein the obtaining unit 501 obtains a first base matrix of an LDPC code and a spreading factor z of the first base matrixfWherein m is the number of rows of the first base matrix, n is the number of columns of the first base matrix, and zfIs a positive integer. A processing unit 502, configured to generate a second base matrix of the LDPC code, where m is a number of rows of the second base matrix, n is a number of columns of the second base matrix, a matrix element in the first base matrix that is equal to-1 is the same as a matrix element in the second base matrix that is equal to-1 in position, and at least one matrix element p in an ith row and a jth column of the second base matrix existsf,i,jIs based on the matrix element p of the ith row and the jth column in the first base matrixi,jZ is saidfAnd free factor rfIs generated in which pf,i,j＜zf，rfThe values of m, n, i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n.
Optionally, the ring length characteristic of the second basis matrix is better than or equal to that of the first basis matrix.
Alternatively to this, the first and second parts may,
Figure BDA0001219790000000211
wherein c is a preset constant; or,
Figure BDA0001219790000000212
wherein z ismaxSpreading factor z to be supported for initial base matrixfMaximum value of (d); or,
Figure BDA0001219790000000213
or,
Figure BDA0001219790000000214
pf,i,jusually, values are integers, and parts of the above function that may generate fractional numbers may be rounded up or rounded down, for example:
Figure BDA0001219790000000215
can be obtained by rounding
Figure BDA0001219790000000216
Or
Figure BDA0001219790000000217
Or can be obtained by rounding
Figure BDA0001219790000000221
Or
Figure BDA0001219790000000222
Figure BDA0001219790000000223
Can be obtained by rounding
Figure BDA0001219790000000224
Or
Figure BDA0001219790000000225
Figure BDA0001219790000000226
Can be obtained by rounding
Figure BDA0001219790000000227
Or
Figure BDA0001219790000000228
Or can be obtained by rounding
Figure BDA0001219790000000229
Or
Figure BDA00012197900000002210
Wherein,
Figure BDA00012197900000002211
meaning that the log value is rounded up,
Figure BDA00012197900000002212
indicating that the log value is rounded down.
It should be noted that the above are only examples and are not limited thereto.
pf,i,jReference may also be made to the description of the foregoing method embodiments, which are not repeated here.
Optionally, the obtaining unit 501 may be further configured to obtain the spreading factor zfCorresponding free factor rf. Wherein the free factor rfThe acquisition unit 501 may acquire the second base matrix of the LDPC code before acquiring.
Optionally, the processing unit 502 is further configured to encode the sequence to be encoded by using the second basis matrix, so as to obtain a first encoding sequence; the transmitting unit 503 is further configured to transmit the first coding sequence.
Optionally, the obtaining unit 501 is further configured to obtain a second coding sequence; the processing unit 502 is further configured to code the second coding sequence using the second base matrix.
In another embodiment of the present application, the wireless communication device includes an obtaining unit and a processing unit, where the obtaining unit is configured to obtain a first base matrix of a low density parity check LDPC code, where m is a row number of the first base matrix, n is a column number of the first base matrix, and values of m and n are positive integers; a processing unit for generating a first base matrix, a spreading factor zfAnd free factor rfCoding the information sequence to obtain a first coding sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0.
Optionally, the obtaining unit is further configured to obtain the spreading factor zfAnd free factor rf。
In a possible implementation manner, the processing unit is specifically configured to apply, to each ith row and jth column of the matrix element p in the first base matrixi,jAccording to pi,jExpansion factor zfAnd free factor rfCalculating pf,i,jAccording to pf,i,jCoding an information sequence to obtain a first coding sequence, wherein pf,i,j＜zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n. For example,
Figure BDA0001219790000000231
wherein c is a preset constant; or,
Figure BDA0001219790000000232
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or，
Figure BDA0001219790000000233
Or,
Figure BDA0001219790000000234
pf,i,jusually, values are integers, and parts of the above function that may generate fractional numbers may be rounded up or rounded down, for example:
Figure BDA0001219790000000235
can be obtained by rounding
Figure BDA0001219790000000236
Or
Figure BDA0001219790000000237
Or can be obtained by rounding
Figure BDA0001219790000000238
Or
Figure BDA0001219790000000239
Figure BDA00012197900000002310
Can be obtained by rounding
Figure BDA0001219790000000241
Or
Figure BDA0001219790000000242
Figure BDA0001219790000000243
Can be obtained by rounding
Figure BDA0001219790000000244
Or
Figure BDA0001219790000000245
Or can be obtained by rounding
Figure BDA0001219790000000246
Or
Figure BDA0001219790000000247
Wherein,
Figure BDA0001219790000000248
meaning that the log value is rounded up,
Figure BDA0001219790000000249
indicating that the log value is rounded down.
It should be noted that the above are only examples and are not limited thereto.
pf,i,jReference may also be made to the description of the foregoing method embodiments, which are not repeated here.
In the foregoing embodiment, the obtaining unit 501 and the processing unit 502 may also be used as a device for implementing the information processing method in the foregoing embodiment, and the wireless communication device includes the device.
Optionally, the wireless communication device further comprises a transmitting unit for transmitting the first code sequence.
In another embodiment of the present application, the wireless communication device includes an obtaining unit and a processing unit, where the obtaining unit is configured to obtain a first base matrix of a low density parity check LDPC code, where m is a row number of the first base matrix, n is a column number of the first base matrix, and values of m and n are positive integers; a processing unit for processing the data according toThe first base matrix, spreading factor zfAnd free factor rfDecoding the second code sequence to obtain an information sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0.
Optionally, the obtaining unit is further configured to obtain the spreading factor zfAnd free factor rf。
In a possible implementation manner, the processing unit is specifically configured to apply, to each ith row and jth column of the matrix element p in the first base matrixi,jAccording to pi,jExpansion factor zfAnd free factor rfCalculating pf,i,jAccording to pf,i,jDecoding the second coding sequence to obtain an information sequence, wherein pf,i,j＜zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n. For example,
Figure BDA00012197900000002410
wherein c is a preset constant; or,
Figure BDA00012197900000002411
wherein z ismaxSpreading factor z to be supported for the first base matrixfMaximum value of (d); or,
Figure BDA0001219790000000251
or,
Figure BDA0001219790000000252
pf,i,jusually, values are integers, and parts of the above function that may generate fractional numbers may be rounded up or rounded down, for example:
Figure BDA0001219790000000253
can be obtained by rounding
Figure BDA0001219790000000254
Or
Figure BDA0001219790000000255
Or can be obtained by rounding
Figure BDA0001219790000000256
Or
Figure BDA0001219790000000257
Figure BDA0001219790000000258
Can be obtained by rounding
Figure BDA0001219790000000259
Or
Figure BDA00012197900000002510
Figure BDA00012197900000002511
Can be obtained by rounding
Figure BDA00012197900000002512
Or
Figure BDA00012197900000002513
Or can be obtained by rounding
Figure BDA0001219790000000261
Or
Figure BDA0001219790000000262
Wherein,
Figure BDA0001219790000000263
meaning that the log value is rounded up,
Figure BDA0001219790000000264
indicating that the log value is rounded down.
It should be noted that the above are only examples and are not limited thereto.
pf,i,jReference may also be made to the description of the foregoing method embodiments, which are not repeated here.
Optionally, the wireless communication device further comprises a receiving unit for receiving the second code sequence.
Referring to fig. 6 for the present application, fig. 6 is a schematic structural diagram of another embodiment of a wireless communication device for the present application.
Fig. 6 is a schematic structural diagram of an embodiment of a wireless communication device according to the present application. The wireless communication device may be the wireless communication device in any of the foregoing embodiments, and may be configured to perform the second basis matrix generation method shown in fig. 1, or may also be configured to perform the encoding method shown in fig. 2, or may also be configured to perform the decoding method shown in fig. 3, or may also be configured to perform the foregoing data transmission method.
As shown in fig. 6, the wireless communication device may include a processor 601, a memory 602, and a transceiver 603, and the transceiver 603 may include a receiver, a transmitter, an antenna, and the like. The wireless communication device may also include more or fewer components, or may combine certain components, or a different arrangement of components, which is not limited in this application.
The processor 601 is a control center of the wireless communication device, connects various parts of the entire wireless communication device using various interfaces and lines, and performs various functions of the wireless communication device and/or processes data by operating or executing software programs and/or modules stored in the memory 602 and calling data stored in the memory. The processor 601 may be composed of an Integrated Circuit (IC), for example, a single packaged IC, or a plurality of packaged ICs connected with the same or different functions. For example, the processor may include only a Central Processing Unit (CPU), or may be a combination of a GPU, a Digital Signal Processor (DSP), and a control chip (e.g., a baseband chip) in the transceiver 603. In the embodiments of the present application, the CPU may be a single arithmetic core or may include multiple arithmetic cores.
The transceiver 603 is configured to establish a communication channel through which the wireless communication device connects to the receiving device, thereby enabling data transmission between the wireless communication devices. The transceiver 603 may include a Wireless Local Area Network (WLAN) module, a bluetooth module, a baseband (base band) module, and other communication modules, and a Radio Frequency (RF) circuit corresponding to the communication module, and is configured to perform wireless local area network communication, bluetooth communication, infrared communication, and/or cellular communication system communication, such as Wideband Code Division Multiple Access (WCDMA) and/or High Speed Downlink Packet Access (HSDPA). The transceiver 603 is used to control communications among the components in the wireless communication device and may support direct memory access (dma).
In various embodiments of the present application, the various transceivers 603 of the transceivers 603 are typically in the form of integrated circuit chips (integrated circuit chips) and may be selectively combined without including all of the transceivers 603 and corresponding antenna groups. For example, the transceiver 603 may include only a baseband chip, a radio frequency chip, and corresponding antenna to provide communication functions in a cellular communication system. The wireless communication device may be connected to a cellular network (cellular network) or the internet (internet) via a wireless communication connection established by the transceiver 603, such as a wireless local area network access or a WCDMA access. In some alternative embodiments of the present application, the communication module, e.g., baseband module, in the transceiver 603 may be integrated into a processor, typically an APQ + MDM family platform as provided by Qualcomm corporation. The radio frequency circuit is used for receiving and sending signals in the process of information transceiving or conversation. For example, after receiving the downlink information of the network device, the downlink information is sent to the processor for processing; in addition, the data for designing upstream is sent to the network device. Typically, the radio frequency circuitry includes well-known circuitry for performing these functions, including but not limited to an antenna system, a radio frequency transceiver, one or more amplifiers, a tuner, one or more oscillators, a digital signal processor, a codec (codec) chipset, a Subscriber Identity Module (SIM) card, memory, and so forth. In addition, the radio frequency circuitry may also communicate with networks and other devices via wireless communications. The wireless communication may use any communication standard or protocol, including but not limited to global system for mobile communication (GSM), general packet radio service (gprs), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), High Speed Uplink Packet Access (HSUPA), Long Term Evolution (LTE), email, Short Message Service (SMS), and the like.
In the embodiment of the present application, the wireless communication device may be configured to implement the respective method steps of the channel state information reference signal receiving method in the foregoing embodiments. The functions to be implemented by the obtaining unit 501 may be implemented by the transceiver 603 of the wireless communication device, or implemented by the processor 601 controlling the transceiver 603; the functions to be implemented by the sending unit 503 may also be implemented by the transceiver 603 of the wireless communication device, or may also be implemented by the processor 601 controlling the transceiver 603; the functions to be performed by the processing unit 502 may be implemented by the processor 601.
In a specific implementation, the present application further provides a computer storage medium, where the computer storage medium may store a program, and the program may include some or all of the steps in each embodiment of the LDPC code base matrix generation method, the LDPC code encoding method, or the LDPC code decoding method provided in the present application when executed. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM) or a Random Access Memory (RAM).
Those skilled in the art will clearly understand that the techniques in the embodiments of the present application may be implemented by way of software plus a required general hardware platform. Based on such understanding, the technical solutions in the embodiments of the present application may be essentially implemented or a part contributing to the prior art may be embodied in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the embodiments or some parts of the embodiments of the present application.
The same and similar parts in the various embodiments in this specification may be referred to each other. In particular, for the embodiments of the network device and the wireless communication device, since they are basically similar to the embodiments of the method, the description is simple, and the relevant points can be referred to the description in the embodiments of the method.
The above-described embodiments of the present application do not limit the scope of the present application.

Claims (22)

1. A method of information processing, comprising:
acquiring a first base matrix of a low-density parity check LDPC code, wherein m is the row number of the first base matrix, n is the column number of the first base matrix, and the values of m and n are positive integers;
according to the first base matrix and the spreading factor zfAnd free factor rfCoding the information sequence to obtain a first coding sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0;
wherein the first base matrix is a function of a spreading factor zfAnd free factor rfFor information sequencesCoding to obtain a first coding sequence, comprising:
for each ith row and jth column of matrix elements p in the first base matrixi,jAccording to pi,jThe spreading factor zfAnd free factor rfCalculating pf,i,jWherein p isf,i,j<zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n;
according to pf,i,jCoding the information sequence to obtain the first coding sequence;
wherein,
pf,i,jthe following formula is satisfied:
Figure FDA0002647769300000011
wherein, g1(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g2(zf) Is represented by zfIs a function of a parameter, and g2(zf)≤zfThe values are integers.
2. The method of claim 1, wherein g is1(pi,j,rf) The following formula is satisfied:
Figure FDA0002647769300000012
or
Figure FDA0002647769300000013
Wherein c is a constant and is not equal to 0;
Figure FDA0002647769300000014
or
Figure FDA0002647769300000015
Wherein c is a constant and is not equal to 0; or,
g1(pi,j,rf)＝pi,j+(c-pi,j)rfwherein c is a constant and is not equal to 0; or,
Figure FDA0002647769300000016
or
Figure FDA0002647769300000017
Or,
Figure FDA0002647769300000018
or
Figure FDA0002647769300000019
3. The method of claim 1, wherein g is2(zf) The following formula is satisfied:
g2(zf)＝zf(ii) a Or,
Figure FDA00026477693000000110
4. the method of claim 2, wherein c ═ z is determinedmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
5. The method according to any one of claims 1 to 4, further comprising:
and transmitting the first coding sequence.
6. A method of information processing, comprising:
acquiring a first base matrix of a low-density parity check LDPC code, wherein m is the row number of the first base matrix, n is the column number of the first base matrix, and the values of m and n are positive integers;
according to the first base matrix and the spreading factor zfAnd free factor rfCoding the information sequence to obtain a first coding sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0;
wherein the first base matrix is a function of a spreading factor zfAnd free factor rfEncoding an information sequence to obtain a first encoding sequence, comprising:
for each ith row and jth column of matrix elements p in the first base matrixi,jAccording to pi,jThe spreading factor zfAnd free factor rfCalculating pf,i,jWherein p isf,i,j<zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n;
according to pf,i,jCoding the information sequence to obtain the first coding sequence;
wherein,
pf,i,jthe following formula is satisfied:
Figure FDA0002647769300000021
wherein, g3(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g4(zf) Is represented by zfIs a function of a parameter, and 0<g4(zf)≤1。
7. The method of claim 6, wherein g is3(pi,j,rf) The following formula is satisfied:
g3(pi,j,rf)＝(pi,j+rf) modc, where c is a constant and is not equal to 0; or,
g3(pi,j,rf)＝(pi,j·rf) modc, where c is a constant and is not equal to 0.
8. The method of claim 6, wherein g is4(zf) The following formula is satisfied:
g4(zf)＝zfc, or alternatively,
Figure FDA0002647769300000022
wherein c is a constant and is not equal to 0.
9. The method of claim 7, wherein c ═ zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
10. The method according to any one of claims 6 to 9, further comprising:
and transmitting the first coding sequence.
11. An information processing apparatus, comprising:
an obtaining unit, configured to obtain a first base matrix of a low density parity check LDPC code, where m is a number of rows of the first base matrix and n is a number of columns of the first base matrix;
a processing unit for generating a first base matrix, a spreading factor zfAnd free factor rfCoding the information sequence to obtain a first coding sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0;
wherein the processing unit is specifically configured to, for each ith row and jth column of matrix elements p in the first base matrixi,jAccording to pi,jThe spreading factor zfAnd free factor rfCalculating pf,i,jWherein p isf,i,j<zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n;
according to pf,i,jCoding the information sequence to obtain a first coding sequence;
wherein p isf,i,jThe following formula is satisfied:
Figure FDA0002647769300000031
wherein, g1(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g2(zf) Is represented by zfIs a function of a parameter, and g2(zf)≤zfThe values are integers.
12. The apparatus of claim 11, wherein g is1(pi,j,rf) The following formula is satisfied:
Figure FDA0002647769300000032
or
Figure FDA0002647769300000033
Wherein c is a constant and is not equal to 0;
Figure FDA0002647769300000034
or
Figure FDA0002647769300000035
Wherein c is a constant and is not equal to 0; or,
g1(pi,j,rf)＝pi,j+(c-pi,j)rfwherein c is a constant and is not equal to 0; or,
Figure FDA0002647769300000036
or
Figure FDA0002647769300000037
Or,
Figure FDA0002647769300000039
or
Figure FDA00026477693000000310
13. The apparatus of claim 11, wherein g is2(zf) The following formula is satisfied:
g2(zf)＝zf(ii) a Or,
Figure FDA00026477693000000311
14. the apparatus of claim 12, wherein g is2(zf) The following formula is satisfied:
g2(zf)＝zf(ii) a Or,
Figure FDA00026477693000000312
15. the apparatus of claim 12 or 14, wherein c-zmax，zmaxSpreading factor z to be supported for the first base matrixfIs measured.
16. An information processing apparatus, comprising:
an obtaining unit, configured to obtain a first base matrix of a low density parity check LDPC code, where m is a number of rows of the first base matrix and n is a number of columns of the first base matrix;
a processing unit for generating a first base matrix, a spreading factor zfAnd free factor rfCoding the information sequence to obtain a first coding sequence, wherein zfIs a positive integer, rfIs an integer greater than or equal to 0;
wherein the processing unit is specifically configured to, for each ith row and jth column of matrix elements p in the first base matrixi,jAccording to pi,jThe spreading factor zfAnd free factor rfCalculating pf,i,jWherein p isf,i,j<zfThe values of i and j are integers, i is more than or equal to 0 and less than m, and j is more than or equal to 0 and less than n;
wherein p isf,i,jThe following formula is satisfied:
Figure FDA0002647769300000041
wherein, g3(pi,j,rf) Is represented by pi,j,rfAs a function of the parameter, taking the value as an integer, g4(zf) Is represented by zfIs a function of a parameter, and 0<g4(zf)≤1。
17. The apparatus of claim 16, wherein g is3(pi,j,rf) The following formula is satisfied:
g3(pi,j,rf)＝(pi,j+rf) modc, where c is a constant and is not equal to 0; or,
g3(pi,j,rf)＝(pi,j·rf) modc, where c is a constant and is not equal to 0.
18. The apparatus of claim 17, wherein g is4(zf) The following formula is satisfied:
g4(zf)＝zfc, or alternatively,
Figure FDA0002647769300000042
wherein c is a constant and is not equal to 0.
19. The apparatus according to any one of claims 17 and 18, wherein c-zmax，zmaxIs a stand forThe spreading factor z to be supported by the first base matrixfIs measured.
20. A wireless communication device, characterized in that it comprises the apparatus of any of claims 11 to 19.
21. The communication device according to claim 20, wherein the wireless communication device further comprises a transmitting unit:
and the sending unit is used for sending the first coding sequence.
22. A storage medium, characterized in that it stores a computer program which, when executed by a computer device, is capable of implementing the method of any one of claims 1 to 10.
CN201710061834.7A 2016-11-03 2017-01-26 Information processing method and device and wireless communication equipment Active CN108023677B (en)

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
CN2016109733736 2016-11-03
CN201610973373 2016-11-03
CN2016109858500 2016-11-09
CN201610985850 2016-11-09
CN2016111412502 2016-12-12
CN201611141250 2016-12-12
CN201710010645 2017-01-06
CN2017100106457 2017-01-06

Publications (2)

Publication Number Publication Date
CN108023677A CN108023677A (en) 2018-05-11
CN108023677B true CN108023677B (en) 2020-12-08

Family

ID=62079185

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710061834.7A Active CN108023677B (en) 2016-11-03 2017-01-26 Information processing method and device and wireless communication equipment

Country Status (1)

Country Link
CN (1) CN108023677B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111327330B (en) * 2018-12-14 2022-04-08 深圳市中兴微电子技术有限公司 Information processing method, information processing equipment and computer storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1924001A1 (en) * 2005-08-10 2008-05-21 Mitsubishi Electric Corporation Test matrix generating method, encoding method, decoding method, communication apparatus, communication system, encoder and decoder
CN101217337A (en) * 2007-01-01 2008-07-09 中兴通讯股份有限公司 A low density parity code encoding device and method supporting incremental redundancy hybrid automatic repeat
CN101325474A (en) * 2007-06-12 2008-12-17 中兴通讯股份有限公司 Method for encoding channel of mixed automatic request retransmission and modulation mapping of LDPC code
CN101436918A (en) * 2007-11-15 2009-05-20 中兴通讯股份有限公司 Channel encoding method, apparatus and system for structured low density parity check code
CN101453297A (en) * 2007-12-07 2009-06-10 中兴通讯股份有限公司 Encoding method and apparatus for low density generation matrix code, and decoding method and apparatus

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1924001A1 (en) * 2005-08-10 2008-05-21 Mitsubishi Electric Corporation Test matrix generating method, encoding method, decoding method, communication apparatus, communication system, encoder and decoder
CN101217337A (en) * 2007-01-01 2008-07-09 中兴通讯股份有限公司 A low density parity code encoding device and method supporting incremental redundancy hybrid automatic repeat
CN101325474A (en) * 2007-06-12 2008-12-17 中兴通讯股份有限公司 Method for encoding channel of mixed automatic request retransmission and modulation mapping of LDPC code
CN101436918A (en) * 2007-11-15 2009-05-20 中兴通讯股份有限公司 Channel encoding method, apparatus and system for structured low density parity check code
CN101453297A (en) * 2007-12-07 2009-06-10 中兴通讯股份有限公司 Encoding method and apparatus for low density generation matrix code, and decoding method and apparatus

Also Published As

Publication number Publication date
CN108023677A (en) 2018-05-11

Similar Documents

Publication Publication Date Title
WO2018202096A1 (en) Method for transmitting data, terminal device, and network device
CN110890906B (en) Method and equipment for transmitting and receiving antenna information
EP3902184A1 (en) Wireless communication method and apparatus
EP3553980B1 (en) Method for transmitting data, terminal device and network device
US20190357184A1 (en) Method for Transmitting Downlink Control Information, Terminal Device and Network Device
CN114339987A (en) Transmission method and device of positioning reference signal, storage medium and terminal
US10651968B2 (en) Data transmission method and communication device
US11246129B2 (en) Method for transmitting signal, network device and terminal device
CN109150396B (en) Send method, terminal, the network equipment, chip and the computer readable storage medium of data
CN112134650B (en) Data transmission method and receiving end equipment
KR20200007038A (en) Method of transmitting instruction information, method of receiving instruction information, apparatus and system
US11469779B2 (en) Efficient polar code construction in 5G
US20240090006A1 (en) Wireless communication method and network device
CN108023598B (en) Encoding method, decoding method and wireless communication device
RU2737171C1 (en) Information transmission method, terminal device and network device
CN108781454B (en) Bit block size determination method and device
CN108631941B (en) Communication method and device
CN110612679B (en) Information processing method and communication device
CN108023677B (en) Information processing method and device and wireless communication equipment
CN109286991B (en) The method and apparatus of information transmission
CN113243133B (en) Communication method and device
CN108134648B (en) Broadcast channel sending method, receiving method and equipment
EP3512238A1 (en) Method for transmitting information, terminal device, and network device
CN115913450A (en) Method and device for acquiring information

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
GR01 Patent grant
GR01 Patent grant