CN108429601A - A kind of data processing method and device, data processing equipment - Google Patents
A kind of data processing method and device, data processing equipment Download PDFInfo
- Publication number
- CN108429601A CN108429601A CN201710081555.7A CN201710081555A CN108429601A CN 108429601 A CN108429601 A CN 108429601A CN 201710081555 A CN201710081555 A CN 201710081555A CN 108429601 A CN108429601 A CN 108429601A
- Authority
- CN
- China
- Prior art keywords
- codeword sequence
- generator matrix
- length
- coding
- sequence
- 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
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
-
- 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
-
- 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/0041—Arrangements at the transmitter end
- H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables
-
- 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/0064—Concatenated codes
- H04L1/0065—Serial concatenated codes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a kind of data processing method and device and a kind of data processing equipments.This method includes：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0 bits, generates the first kind codeword sequence that length is K1 bits；It according to preset line index set, selects K1 rows to carry out the second encoding operation to the first kind codeword sequence from preset generator matrix, obtains the second class codeword sequence that length is K2；Wherein, the quantity of the element in the preset line index set is equal to the length K1, the K0, K1 of the first kind codeword sequence, and K2 is positive integer, and K0≤K1≤K2；The second class codeword sequence is sent to receiving terminal by the transmitting terminal.Scheme of the present invention while reducing encoder complexity, can also obtain preferable performance by the way of secondary coding.
Description
Technical field
The present invention relates to wireless mobile telecommunication technology field, espespecially a kind of data processing method and device and a kind of number
According to processing equipment.
Background technology
The transmitting terminal of digital communication system generally includes the parts such as information source, source encoder, channel encoder and modulator,
Receiving terminal generally includes demodulator, channel decoder, source decoder and the stay of two nights.Channel encoder be used for information bit according to
Certain rule introduces redundancy and is uploaded in channel so that receiving terminal channel decoder can correct information to a certain extent
The error code occurred when defeated.
In general, forward error correction (Forward error correction, referred to as FEC) coding is exactly by information ratio
Special sequence generates the process of check bit sequence, and information bit sequence and check bit sequence have collectively constituted the code that we often say
Word bit sequence.
Linear block codes is the code character of one group of regular length, can be expressed as (n, k) block code, commonly used in preceding to entangling
It is wrong.In coding, k information bit is compiled to n block sizes.Due to the 2 of (n, k) block codekA code word constitutes a k dimension
Subspace, thus this 2kA code word can centainly be generated by the substrate of k linear independence, if the k substrate is write as matrix
Form then has
Wherein, any code word in (n, k) block code can be generated by the linear combination of this group of substrate, i.e.,
Wherein, m is information bit sequence, and C is the codeword sequence after coding.G is referred to as the generator matrix of code herein.Obviously,
For each row of generator matrix, as long as meeting linear independence (not accounting for minimum range), and k dimension space
Substrate can arbitrarily select the vector of k linear independence, so the generator matrix G as code is nor unique, however, adopting
With any form, they all generate identical subspace, i.e., same (n, the k) block code.
Due to the presence of interchannel noise, channel coding services the independent sector as mobile communication system, it ensures can
The validity transmitted by property, accuracy and information.Demand most urgent 5G seeks to meet the spectrum efficiency increased significantly and reliable
Property.
Invention content
The present invention provides a kind of data processing method and device and a kind of data processing equipments, meet next-generation logical
Believe system requirements.
In order to reach the object of the invention, the present invention provides a kind of data processing methods, including：
Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0 bits, and it is K1 bits to generate length
First kind codeword sequence；
According to preset line index set, select K1 rows to the first kind code from preset generator matrix
Word sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2；Wherein, the preset line index
The quantity of element in set is equal to the length K1, the K0, K1 of the first kind codeword sequence, and K2 is positive integer, and K0≤
K1≤K2；
The second class codeword sequence is sent to receiving terminal by the transmitting terminal.
Optionally, first encoding operation is：It is encoded by least one following coding mode, and same coding staff
Formula executes one or many：
Checksum coding, cyclic redundancy check coding, Bose-Chaudhuri-Hocquenghem Code, Hamming code coding, convolutional encoding, generator matrix are compiled
Code, Turbo codings, low-density checksum coding, Reed Muller coding, Hash coding.
Optionally, the preset line index set meets：For any two first kind codeword sequence, by the two
The middle longer first kind codeword sequence of length is known as long first kind codeword sequence, another is known as short first kind codeword sequence, then
The line index set of the short first kind codeword sequence is the proper subclass of the line index set of the long first kind codeword sequence.
Optionally, the preset line index set meets：For any two first kind codeword sequence, by the two
The middle longer first kind codeword sequence of length is known as long first kind codeword sequence, another is known as short first kind codeword sequence, then
At least proportional element for p% is not in the long first kind code word sequence in the line index set of the short first kind codeword sequence
In the line index set of row, and 0 ＜ p%≤20%.
Optionally, the p% is 5%, 10% or 20%.
Optionally, described according to preset line index set, K1 rows pair are selected from preset generator matrix
The first kind codeword sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2 and includes：
From a preset generator matrix, the corresponding K1 rows of element in the line index set are selected, and
Continuous N1 is selected to arrange from the generator matrix, the submatrix of composition K1 rows N1 row, with the submatrix to the first kind
Codeword sequence is encoded, and obtains codeword sequence after the coding that length is N1, the N1 is positive integer；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, obtains the length
For the second class codeword sequence of K2.
Optionally, described according to preset line index set, K1 rows pair are selected from preset generator matrix
The first kind codeword sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2 and includes：
From multiple preset generator matrixes, select a columns for the generator matrix of N1, wherein the N1 is just
Integer, the row indicated from the element selected in selected generator matrix in the line index set, the sub- square of composition K1 rows N1 row
Battle array, encodes the first kind codeword sequence with the submatrix, obtains codeword sequence after the coding that length is N1；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, obtains the length
For the second class codeword sequence of K2.
It is optionally, described that the length is carried out to increase bit or deleted bit processing for codeword sequence after the coding of N1,
Obtaining the second class codeword sequence that the length is K2 includes：
If K2≤N1, N1-K2 bit is deleted from codeword sequence after the coding, obtains the length as the of K2
Two class codeword sequences；
If K2>N1 then selects K2-N1 bit to be added to code word sequence after the coding from codeword sequence after the coding
Position before or after row obtains the second class codeword sequence that the length is K2.
Optionally, the N1=2i, the i is nonnegative integer.
Optionally, the multiple preset generator matrix meets following condition：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generation
Matrix and the second generator matrix, if the column number of first generator matrix is less than the column number of second generator matrix,
Second generator matrix includes all column vectors in first generator matrix.
Optionally, the multiple preset generator matrix meets following condition：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generation
Matrix and the second generator matrix, if the column number of first generator matrix is less than the column number of second generator matrix,
At least the column vector of q% is different from the column vector that described second generates in first generator matrix, and 0 ＜ q%≤20%.
Optionally, the q% is 5%, 10% or 20%.
The embodiment of the present invention also provides a kind of data processing equipment, including：
Storage unit, for storing preset generator matrix and preset line index set；
First coding unit generates length for carrying out the first encoding operation to the information bit sequence that length is K0 bits
Degree is the first kind codeword sequence of K1 bits；The K1 is the quantity of the element in the preset line index set；Institute
K0 is stated, K1 is positive integer and K0≤K1；
Second coding unit is used for according to the preset line index set, from the preset generation square
Selection K1 rows carry out the second encoding operation to the first kind codeword sequence in battle array, obtain the second class code word sequence that length is K2
Row；The K1, K2 are positive integer and K1≤K2；
Transmission unit, for the second class codeword sequence to be sent to receiving terminal.
Optionally, first encoding operation is：It is encoded by least one following coding mode, and same coding staff
Formula executes one or many：
Checksum coding, cyclic redundancy check coding, Bose-Chaudhuri-Hocquenghem Code, Hamming code coding, convolutional encoding, generator matrix are compiled
Code, Turbo codings, low-density checksum coding, Reed Muller coding, Hash coding.
Optionally, the preset line index set meets：For any two first kind codeword sequence, by the two
The middle longer first kind codeword sequence of length is known as long first kind codeword sequence, another is known as short first kind codeword sequence, then
The line index set of the short first kind codeword sequence is the proper subclass of the line index set of the long first kind codeword sequence.
Optionally, the preset line index set meets：For any two first kind codeword sequence, by the two
The middle longer first kind codeword sequence of length is known as long first kind codeword sequence, another is known as short first kind codeword sequence, then
At least proportional element for p% is not in the long first kind code word sequence in the line index set of the short first kind codeword sequence
In the line index set of row, and 0 ＜ p%≤20%.
Optionally, the p% is 5%, 10% or 20%.
Optionally, second coding unit is according to preset line index set, from preset generator matrix
Middle selection K1 rows carry out the second encoding operation to the first kind codeword sequence, obtain the second class codeword sequence packet that length is K2
It includes：
From a preset generator matrix, the K1 rows for selecting the element in the line index set to indicate, and
Continuous N1 is selected to arrange from the generator matrix, the submatrix of composition K1 rows N1 row, with the submatrix to first kind code word
Sequence is encoded, and codeword sequence after the coding that length is N1 is obtained, and the N1 is positive integer；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, acquisition length is K2
The second class codeword sequence.
Optionally, described according to preset line index set, K1 rows pair are selected from preset generator matrix
The first kind codeword sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2 and includes：
From multiple preset generator matrixes, select a columns for the generator matrix of N1, wherein the N1 is just
Integer, the row indicated from the element selected in selected generator matrix in the line index set, the sub- square of composition K1 rows N1 row
Battle array, encodes the first kind codeword sequence with the submatrix, obtains codeword sequence after the coding that length is N1；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, acquisition length is K2
The second class codeword sequence.
It is optionally, described that the length is carried out to increase bit or deleted bit processing for codeword sequence after the coding of N1,
Obtaining the second class codeword sequence that length is K2 includes：
If K2≤N1, N1-K2 bit is deleted from codeword sequence after the coding, obtains the length as the of K2
Two class codeword sequences；
If K2>N1 then selects K2-N1 bit to be added to code word sequence after the coding from codeword sequence after the coding
Position before or after row obtains the second class codeword sequence that the length is K2.
Optionally, the N1=2i, wherein i is nonnegative integer.
Optionally, the multiple preset generator matrix meets following condition：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generation
Matrix and the second generator matrix, if the column number of first generator matrix is less than the column number of second generator matrix,
Second generator matrix includes all column vectors in first generator matrix.
Optionally, the multiple preset generator matrix meets following condition：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generation
Matrix and the second generator matrix, if the column number of first generator matrix is less than the column number of second generator matrix,
At least the column vector of q% is different from the column vector that described second generates in first generator matrix, and 0 ＜ q%≤20%.
Optionally, the q% is 5%, 10% or 20%.
The embodiment of the present invention also provides a kind of data processing equipment, including memory and processor, the memory storage
There is program, described program executes following operation when reading execution by the processor：
First encoding operation is carried out to the information bit sequence that length is K0 bits, generates the first kind that length is K1 bits
Codeword sequence；
According to preset line index set, select K1 rows to the first kind code from preset generator matrix
Word sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2；Wherein, the preset line index
The quantity of element in set is equal to the length K1, the K0, K1 of the first kind codeword sequence, and K2 is positive integer, and K0≤
K1≤K2；
The second class codeword sequence is sent to receiving terminal.
Optionally, the preset line index set meets：For any two first kind codeword sequence, by the two
The middle longer first kind codeword sequence of length is known as long first kind codeword sequence, another is known as short first kind codeword sequence, then
The line index set of the short first kind codeword sequence is the proper subclass of the line index set of the long first kind codeword sequence.
Optionally, the preset line index set meets：For any two first kind codeword sequence, by the two
The middle longer first kind codeword sequence of length is known as long first kind codeword sequence, another is known as short first kind codeword sequence, then
At least proportional element for p% is not in the long first kind code word sequence in the line index set of the short first kind codeword sequence
In the line index set of row, and 0 ＜ p%≤20%.
Optionally, described according to preset line index set, K1 rows pair are selected from preset generator matrix
The first kind codeword sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2 and includes：
From a preset generator matrix, the K1 rows for selecting the element in the line index set to indicate, and
Continuous N1 is selected to arrange from the generator matrix, the submatrix of composition K1 rows N1 row, with the submatrix to first kind code word
Sequence is encoded, and codeword sequence after the coding that length is N1 is obtained, and the N1 is positive integer；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, acquisition length is K2
The second class codeword sequence.
Optionally, described according to preset line index set, K1 rows pair are selected from preset generator matrix
The first kind codeword sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2 and includes：
From multiple preset generator matrixes, select a columns for the generator matrix of N1, wherein the N1 is just
Integer, the row indicated from the element selected in selected generator matrix in the line index set, the sub- square of composition K1 rows N1 row
Battle array, encodes the first kind codeword sequence with the submatrix, obtains codeword sequence after the coding that length is N1；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, acquisition length is K2
The second class codeword sequence.
Optionally, the multiple preset generator matrix meets following condition：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generation
Matrix and the second generator matrix, if the column number of first generator matrix is less than the column number of second generator matrix,
Second generator matrix includes all column vectors in first generator matrix.
Optionally, the multiple preset generator matrix meets following condition：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generation
Matrix and the second generator matrix, if the column number of first generator matrix is less than the column number of second generator matrix,
At least the column vector of q% is different from the column vector that described second generates in first generator matrix, and 0 ＜ q%≤20%.
Compared with prior art, a kind of data processing method provided in an embodiment of the present invention carries out information bit sequence
After first encoding operation, then the code word to obtaining carries out the second encoding operation, obtains final codeword sequence.The embodiment of the present invention
The data processing method and device of offer use secondary coding, relative to biography on the basis of traditional generator matrix coding
Generator matrix code of system, secondary coding can obtain better coding efficiency.It is adopted in the selection to generator matrix simultaneously
With generator matrix is selected according to the length of the second class codeword sequence, excessive deletion or also enhancing property of repetition are avoided
Energy；In addition, select the row of instruction to encode information bit sequence from preset generator matrix by line index set, it can
To support the coding of the information bit sequence of different length, while the line index set can have nested spy with generator matrix
Property, i.e. a line index set or a generator matrix can support the information bit sequence of different length encodes to generate difference
Codeword sequence after the coding of length.In compared with the existing technology, the information bit sequence of different length needs different size of
The way of generator matrix, data processing method provided in an embodiment of the present invention simplify the complexity of coding.The embodiment of the present invention
The scheme of offer can also obtain preferable performance while reducing encoder complexity, can be used for the volume of 5G communication systems
Code.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification
It obtains it is clear that understand through the implementation of the invention.The purpose of the present invention and other advantages can be by specification, rights
Specifically noted structure is realized and is obtained in claim and attached drawing.
Description of the drawings
Attached drawing is used for providing further understanding technical solution of the present invention, and a part for constitution instruction, with this
The embodiment of application technical solution for explaining the present invention together, does not constitute the limitation to technical solution of the present invention.
Fig. 1 is data processing method flow chart provided in an embodiment of the present invention；
Fig. 2 is data processing equipment block diagram provided in an embodiment of the present invention.
Specific implementation mode
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention
Embodiment be described in detail.It should be noted that in the absence of conflict, in the embodiment and embodiment in the application
Feature mutually can arbitrarily combine.
Step shown in the flowchart of the accompanying drawings can be in the computer system of such as a group of computer-executable instructions
It executes.Also, although logical order is shown in flow charts, and it in some cases, can be with suitable different from herein
Sequence executes shown or described step.
A kind of data processing method and device provided in an embodiment of the present invention and data processing equipment, can with but it is unlimited
In in NR (New Radio Access Technology, new wireless access technology).
Transmitting terminal described in the embodiment of the present invention can be base station, can also be UE (User Equipment, Yong Hushe
It is standby), the base station can be, but not limited to be gNB (g Node B, g node B), and the receiving terminal can be UE, can also be
Base station, the base station can be, but not limited to be gNB.
Embodiment one
The present embodiment provides a kind of data processing methods, include the following steps：
Step S11：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0 bits, generates length and is
The first kind codeword sequence of K1 bits；
Optionally, first encoding operation is：It is encoded by least one following coding mode, and same coding staff
Formula executes one or many：Checksum coding, cyclic redundancy check coding, Bose-Chaudhuri-Hocquenghem Code, Hamming code coding, convolutional encoding are raw
At matrix coder, Turbo codings, low-density checksum coding, Reed Muller coding, the coding staffs such as Hash (Hash) coding
The combination of formula or the above coding mode.For example, the first encoding operation can carry out a checksum coding,
Can carry out checksum coding or more time checksum coding twice, alternatively, the first encoding operation can be carry out one
Then secondary or multiple checksum coding carries out one or many cyclic redundancy check codings, alternatively, carrying out an even-odd check
Coding carries out one cycle redundancy check coding, then carries out a checksum coding again；Alternatively, the first encoding operation can
To be to carry out one cycle redundancy check coding, a checksum coding is then carried out, a Bose-Chaudhuri-Hocquenghem Code is then carried out；Deng
Deng.The execution number of i.e. above-mentioned each coding mode is unlimited, and the execution sequence of each coding mode is unlimited.
Wherein, generator matrix coding is encoded to information bit sequence using a generator matrix, can refer to background
Associated description in technology.
Wherein, K1=K0+P1, wherein P1 are the quantity of the first check bit generated after the first coding；P1 is positive integer；
Step S12：According to preset line index set setr, K1 rows pair are selected from preset generator matrix
The first kind codeword sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2；Wherein K0, K1, K2
All it is positive integer, and K0≤K1≤K2；The quantity of element in the preset line index set is equal to described first
The length K1 of class codeword sequence；
Step S13：The second class codeword sequence is sent to receiving terminal by the transmitting terminal.
Wherein, the line index set is the set of line number composition, and line index set is used to indicate selection generator matrix
Which row.For example, when line index collection is combined into [1,2 ..., 158], then the 1st, 2 of generator matrix is selected ..., 158 rows.The row
Index set has multiple, and the first kind codeword sequence of different length corresponds to different line index set.
In an alternative embodiment, the preset line index set has telescoping feature, i.e., for arbitrary
Two first kind codeword sequences A and B, it is assumed that its length is respectively K1_A bits and K1_B bits, if K1_A<K1_B, then it is described
The line index set setr_A of first kind codeword sequence A is the true of the line index set setr_B of the first kind codeword sequence B
Subset, i.e.,
In an alternative embodiment, the preset line index set has following feature：For arbitrary two
A first kind codeword sequence A and B, it is assumed that its length is respectively K1_A bits and K1_B bits, if K1_A<K1_B, then described
At least proportional element for p% is not in the row of first kind codeword sequence B in the line index set setr_A of a kind of codeword sequence A
It indexes in set setr_B.Wherein, p% can be set as needed, for example, 0 ＜ p%≤20%, for another example p% can be
5%, 10% or 20%.
Wherein, the preset generator matrix can be one, can also be multiple.
It is described according to preset line index collection in the step S12 in an optional embodiment of the present invention
Setr is closed, selects K1 rows to carry out the second coding to the first kind codeword sequence from preset generator matrix, is grown
Degree is the method for the second class codeword sequence of K2, including：
From a preset generator matrix, the K1 rows for selecting the element in the line index set to indicate, and,
Continuous N1 is selected to arrange, the submatrix of composition K1 rows N1 row encodes first kind codeword sequence with the submatrix, obtains
Codeword sequence after the coding that length is N1, wherein being encoded to first kind codeword sequence with the submatrix to be：By institute
It states first kind codeword sequence to be multiplied with the submatrix, obtains codeword sequence after the coding that length is N1.Optionally, described
N1=2i, i is nonnegative integer；The continuous N1 row of selection, can select foremost or rearmost N1 to arrange, certainly,
It can select intermediate N1 row.
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, acquisition length is K2
The second class codeword sequence.
It is described according to preset line index collection in the step S12 in an optional embodiment of the present invention
Setr is closed, selects K1 rows to carry out the second coding to the first kind codeword sequence from preset generator matrix, is grown
Degree is the method for the second class codeword sequence of K2, including：
From the generator matrix that preset C row N is arranged, continuous N1 rows and N1 is selected to arrange, such as before selecting most
Face or rearmost N1 rows and foremost and rearmost N1 row, the first submatrix of composition N1 rows N1 row.
From the generator matrix that the N1 rows N1 is arranged, the K1 rows for selecting the element in the line index set to indicate, composition
Second submatrix of K1 rows N1 row, encodes the first kind codeword sequence with second submatrix, obtaining length is
Codeword sequence after the coding of N1, the N1=2i, and N1≤N, i are nonnegative integers；Wherein with the submatrix to first kind code
Word sequence carries out coding：The first kind codeword sequence is multiplied with the submatrix, it is N1's to obtain length
Codeword sequence after coding.
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, acquisition length is K2
The second class codeword sequence.
In an alternate embodiment of the present invention where, described that the length is increased for codeword sequence after the coding of N1
Bit or deleted bit processing, obtaining the second class codeword sequence that length is K2 includes：
If K2≤N1, N1-K2 bit is deleted from codeword sequence after the coding, obtains the length as the of K2
Two class codeword sequences；Specifically deletion mode can be：From the codeword sequence after the coding backmost or foremost delete N1-
K2 bit, alternatively, N1-K2 bit is deleted from centre, alternatively, N1-K2 bit, etc. is deleted at interval.
If K2>N1 then selects K2-N1 bit to be added to code word sequence after the coding from codeword sequence after the coding
Position before or after row obtains the second class codeword sequence that the length is K2.
A kind of special case of N1 is N1=N, at this time：
From the generator matrix that the preset C row N is arranged, the element instruction in line index set setr is selected
K1 rows, form the submatrix of a K1 rows N row, first kind codeword sequence encoded with the submatrix, obtains length
For codeword sequence after the coding of N.The columns N of the wherein described preset generator matrix is 2 power, i.e. N=2i, i is non-negative
Integer；
If K2≤N, N-K2 bit is deleted from codeword sequence after the coding, obtains the second class code that length is K2
Word sequence；If K2>N then selects K2-N bit to be added to codeword sequence after the coding from codeword sequence after the coding
Before or after position, obtain length be K2 the second class codeword sequence.
According to the value size of N1 and K2, two kinds of situations can be divided into：
1) as N1 >=K2, then：
From the generator matrix that the preset C rows N is arranged, the K1 of the element instruction in line index set setr is selected
Row, and select continuous N1 to arrange from N row, for example (,) foremost or rearmost N1 row, the submatrix of composition K1 rows N1 row,
First kind codeword sequence is encoded with the submatrix, obtains codeword sequence after the coding that length is N1.
N1-K2 bit is deleted from the code word after the coding, obtains the second class codeword sequence that length is K2 bits.
2) as N1 ＜ K2, then：
From the generator matrix that the preset C rows N is arranged, the corresponding K1 of element in line index set setr is selected
Row, and select continuous N1 to arrange from N row, for example (,) foremost or rearmost N1 row, the submatrix of composition K1 rows N1 row,
First kind codeword sequence is encoded with the submatrix, obtains codeword sequence after the coding that length is N1.From the coding
K2-N1 bit is selected in code word afterwards, is added to after the coding position before or after codeword sequence, obtaining length is
Second class codeword sequence of K2 bits.
When preset generator matrix is multiple, need to select a generator matrix to use from multiple generator matrix
In the second encoding operation, include specifically：
From multiple preset generator matrixes, select a columns for the generator matrix of N2, wherein from the selection
Generator matrix in select the corresponding row of element in the line index set, the submatrix of composition K1 rows N2 row, with the son
Matrix encodes the first kind codeword sequence, obtains codeword sequence after the coding that length is N2；Wherein, one kind of N2 can
Selected value is as follows：N2=2i, i is nonnegative integer.
The length is carried out increasing bit for codeword sequence after the coding of N2 or deleted bit is handled, acquisition length is K2
The second class codeword sequence.Wherein, specifically increase bit and deleted bit processing is identical as described in preceding embodiment, herein not
It repeats again.
Likewise, according to the value size of N2 and K2, two kinds of situations can be divided into：
1) as N2 >=K2：
From multiple preset generator matrixes, select a columns for the generator matrix of N2, from the selected life
At the corresponding row of element selected in matrix in line index set setr, the submatrix of composition K1 rows N2 row, with the submatrix
First kind codeword sequence is encoded, codeword sequence after the coding that length is N2 is obtained；
N2-K2 bit is deleted from the code word after the coding, obtains the second class codeword sequence that length is K2 bits.
2) as N2 ＜ K2：
From multiple preset generator matrixes, select a columns for the generator matrix of N2, from the selected life
At the corresponding row of element selected in matrix in line index set setr, the submatrix of composition K1 rows N2 row, with the submatrix
First kind codeword sequence is encoded, codeword sequence after the coding that length is N2 is obtained.
K2-N2 bit is selected from the code word after the coding, be added to codeword sequence after the coding before or
Position later obtains the second class codeword sequence that length is K2 bits.
In an alternate embodiment of the present invention where, for any two in the multiple preset generator matrix
Generator matrix D and E, the column number of generator matrix D is N2_D, and the column number of generator matrix E is N2_E, if N2_D ＜ N2_E,
Generator matrix E includes all column vectors in matrix generation D.
In an alternate embodiment of the present invention where, for any two in the multiple preset generator matrix
Generator matrix D and E, column number is respectively N2_D and N2_E, if at least q% in N2_D ＜ N2_E, the generator matrix D
Column vector it is different from the column vector in the generator matrix E；Wherein, the ratio q% can be set as needed, for example, 0
＜ q%≤20%, for another example, one of q% 5%, 10% or 20%.
Embodiment two
The present embodiment provides a kind of data processing equipments, as shown in Fig. 2, including storage unit 21, the first coding unit 22,
Second coding unit 23 and transmission unit 24, wherein：
The storage unit 21 is used for, and stores preset generator matrix and preset line index set；
First coding unit 22 is used for, and the first encoding operation is carried out to the information bit sequence that length is K0 bits,
Generate the first kind codeword sequence that length is K1 bits；The K1 is the number of the element in the preset line index set
Amount；The K0, K1 are positive integer and K0≤K1；
Second coding unit 23 is used for, according to the preset line index set, from described preset
It selects K1 rows to carry out the second encoding operation to the first kind codeword sequence in generator matrix, obtains the second class code that length is K2
Word sequence；The K1, K2 are positive integer and K1≤K2；
The transmission unit 24 is used for, and the second class codeword sequence is sent to receiving terminal.
Wherein, the specific coding that how to carry out please refers to method reality in first coding unit 22, the second coding unit 23
Example is applied, details are not described herein again.
Data processing method and device provided in an embodiment of the present invention and data processing equipment, in traditional generation square
Secondary coding is used on the basis of battle array coding, relative to a traditional generator matrix code, secondary coding can obtain more preferably
Coding efficiency.It is used in the selection to generator matrix simultaneously and is selected to generate square according to the length of the second class codeword sequence
Battle array avoids excessive deletion or repeats to also enhance performance；In addition, by line index set from preset generator matrix
It selects corresponding row to encode information bit sequence, can support the coding of the information bit sequence of different length, simultaneously
The line index set and generator matrix can have Nested property, i.e. a line index set or a generator matrix
The information bit sequence coding of different length is supported to generate codeword sequence after the coding of different length.In compared with the existing technology,
The information bit sequence of different length needs the way of different size of generator matrix, at data provided in an embodiment of the present invention
Reason method simplifies the complexity of coding.Scheme provided in an embodiment of the present invention can be with while reducing encoder complexity
Preferable performance is obtained, the coding of 5G communication systems is can be used for.
The application is described further with some specific examples below.
Specific example one
In this example, the first encoding operation encodes for cyclic redundancy check code (CRC), the data processing side which provides
Method includes：
Step 101：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0=150 bits, wherein
First encoding operation is encoded using CRC, generates the first kind codeword sequence that length is K1=158 bits, wherein P1=8 ratios
Spy is the redundant bit generated after CRC is encoded；
Step 102：Transmitting terminal selects row rope from a preset C=200 row, the generator matrix of N=256 row
Draw 158 rows of the K1=158 element instruction in set setr, the submatrix of composition one 158 row 256 row, with the sub- square
Battle array encodes first kind codeword sequence, i.e., is multiplied, is grown with the submatrix with the first kind codeword sequence
Degree is codeword sequence after the coding of 256 bits.
Wherein, the preset line index set has telescoping feature, i.e., for any two first kind code word sequence
Arrange A and B, it is assumed that its length is respectively K1_A=158 bits and K1_B=180 bits, then the row of the first kind codeword sequence A
Index set setr_A is the proper subclass of the line index set setr_B of the first kind codeword sequence B, i.e.,
In this example, it is assumed that the length of the second class codeword sequence is K2=240 bits, from codeword sequence after the coding
Middle N-K2=256-240=16 bit of deletion obtains the second class codeword sequence that length is K2=240；
Step 103：The second class codeword sequence is sent to receiving terminal by transmitting terminal.
Specific example two：
In this example, the first encoding operation is checksum coding, and the data processing method which provides includes：
Step 201：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0=140 bits, wherein
First encoding operation uses checksum coding, generates the first kind codeword sequence that length is K1=152 bits, wherein P1
=12 bits are the redundant bits generated after checksum coding；
Step 202：Transmitting terminal selects row rope from a preset C=200 row, the generator matrix of N=256 row
Draw the corresponding K1=152 rows of element in set setr, the submatrix of composition one 152 row 256 row, with the submatrix pair the
A kind of codeword sequence is encoded, i.e., is multiplied with the submatrix with the first kind codeword sequence, and it is 256 to obtain length
Codeword sequence after the coding of bit.
Wherein, the preset line index set has non-nested feature, i.e., for any two first kind code word
Sequence A and B, it is assumed that its length is respectively K1_A=158 bits and K1_B=180 bits, then the first kind codeword sequence A
The element of the line index set setr_B of at least 5% element and first kind codeword sequence B is not in line index set setr_A
Together.
In this example, it is assumed that the length of the second class codeword sequence is K2=260 bits, is selected from codeword sequence after coding
It selects K2-N=260-256=4 bit and is added to after the coding position before or after codeword sequence, it is K2 to obtain length
Second class codeword sequence of=260 bits.
Step 203：The second class codeword sequence is sent to receiving terminal by transmitting terminal.
Specific example three
Step 301：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0=150 bits, wherein
First encoding operation is encoded using Hash, generates the first kind codeword sequence that length is K1=158 bits, wherein P1=8
Bit is the redundant bit generated after Hash encodes；
Step 302：Transmitting terminal selects row rope from a preset C=300 row, the generator matrix of N=512 row
Draw the corresponding K1=158 rows of element in set setr, and selection foremost or rearmost N1=from N=512 row
256 row, the submatrix of composition 158 rows 256 row, encode first kind codeword sequence with the submatrix, i.e., with described the
A kind of codeword sequence is multiplied with the submatrix, obtains codeword sequence after the coding that length is 256 bits.
In this example, it is assumed that the length of the second class codeword sequence is K2=240 bits, from codeword sequence after the coding
Middle N1-K2=256-240=16 bit of deletion obtains the second class codeword sequence that length is K2=240；
Step 303：The second class codeword sequence is sent to receiving terminal by transmitting terminal.
Specific example four
Step 401：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0=140 bits, wherein
It is K1=152 bits that first encoding operation, which uses the combination of checksum coding and Cyclic Redundancy Code, generation length,
First kind codeword sequence, wherein P1=12 bits are the redundant bits generated after first encoding operation；
Step 402：Transmitting terminal selects row rope from a preset C=300 row, the generator matrix of N=512 row
Draw the corresponding K1=152 rows of element in set setr, and selection foremost or rearmost N1=from N=512 row
256 row, the submatrix of composition 152 rows 256 row, encode first kind codeword sequence with the submatrix, obtaining length is
Codeword sequence after the coding of 256 bits；
In this example, it is assumed that the length of the second class codeword sequence is K2=260 bits, is selected from codeword sequence after coding
It selects K2-N1=260-256=4 bit and is added to after the coding position before or after codeword sequence, obtaining length is
Second class codeword sequence of K2=260 bits；
Step 403：The second class codeword sequence is sent to receiving terminal by the transmitting terminal.
Specific example five
Step 501：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0=150 bits, wherein
First encoding operation is encoded using CRC, generates the first kind codeword sequence that length is K1=158 bits, wherein P1=8 ratios
Spy is the redundant bit generated after CRC is encoded；
Step 502：Transmitting terminal selects a generator matrix from multiple preset generator matrixes.
In this example, it is assumed that have 2 preset generator matrix D and E, column number be respectively N2_D=128 and
N2_E=256, wherein it includes generator matrix that preset multiple generator matrixes, which have telescoping feature, i.e. generator matrix E,
All column vectors in D.
It selects a columns for the generator matrix of N2=256, line index set is selected from the selected generator matrix
The corresponding row of element in setr forms K1=158 rows, the submatrix of N2=256 row, with the submatrix to first kind code word
Sequence is encoded, and codeword sequence after the coding that length is 256 bits is obtained.
N2-K2=256-158=98 bit is deleted from the code word after the coding, obtains length as the of K2 bits
Two class codeword sequences.
Step 503：The second class codeword sequence is sent to receiving terminal by the transmitting terminal.
Specific embodiment six
Step 601：Transmitting terminal carries out the first encoding operation, wherein institute to the information bit sequence that length is K0=50 bits
It states the first encoding operation to encode using CRC, generates the first kind codeword sequence that length is K1=58 bits, wherein P1=8 bits
It is the redundant bit generated after CRC is encoded；
Step 602：Transmitting terminal selects a generator matrix from multiple preset generator matrixes.
In this example, it is assumed that have 2 preset generator matrix D and E, column number be respectively N2_D=128 and
N2_E=256；Wherein, preset multiple generator matrixes do not have telescoping feature, at least 5% in generator matrix D
Column vector it is different from the column vector in generator matrix E.
In this example, it is assumed that the length of the second code word is K2=130 bits.
It selects columns for the generator matrix of N2=128, line index set setr is selected from the selected generator matrix
In the corresponding row of element, form K1=58 rows, N2=128 row submatrix, with the submatrix to first kind codeword sequence
It is encoded, obtains codeword sequence after the coding that length is 128 bits.
The codeword sequence after selecting K2-N2=130-128=2 bit to be added to the coding in codeword sequence after coding
Before or after position, obtain length be K2=130 bits the second class codeword sequence.
Step 603：The second class codeword sequence is sent to receiving terminal by the transmitting terminal.
Specific example seven
Step 701：Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0=140 bits, wherein
First encoding operation generates the first kind code that length is K1=152 bits using the coding mode of Cyclic Redundancy Code twice
Word sequence, wherein P1=12 bits are the redundant bits generated after first encoding operation；Wherein cyclic redundancy code twice
The CRC redundant bits of 8 bits and 4 bits are generated respectively；
Step 702：For transmitting terminal from a preset C=300 row, the generator matrix of N=512 row, selection is continuous
256 rows and 256 row, such as selection foremost or rearmost 256 row and foremost and rearmost 256 row, composition 256
The first submatrix that row 256 arranges.
From the generator matrix that 256 row 256 arranges, 152 rows for selecting the element in the line index set to indicate, group
At the second submatrix that 152 rows 256 arrange, the first kind codeword sequence is encoded with second submatrix, is grown
Degree is codeword sequence after the coding of 256 bits；
In this example, it is assumed that the length of the second class codeword sequence is K2=260 bits, is selected from codeword sequence after coding
It selects K2-N1=260-256=4 bit and is added to after the coding position before or after codeword sequence, obtaining length is
Second class codeword sequence of K2=260 bits；
Step 703：The second class codeword sequence is sent to receiving terminal by the transmitting terminal.
The embodiment of the present invention also provides a kind of data processing equipment, including memory and processor, the memory storage
There is program, described program executes following operation when reading execution by the processor：
First encoding operation is carried out to the information bit sequence that length is K0 bits, generates the first kind that length is K1 bits
Codeword sequence；
According to preset line index set, select K1 rows to the first kind code from preset generator matrix
Word sequence carries out the second encoding operation, obtains the second class codeword sequence that length is K2；Wherein, the preset line index
The quantity of element in set is equal to the length K1, the K0, K1 of the first kind codeword sequence, and K2 is positive integer, and K0≤
K1≤K2；
The second class codeword sequence is sent to receiving terminal.
The embodiment of the present invention also provides a kind of computer read/write memory medium, computer read/write memory medium storage
There is instruction, which is performed, and executes above-mentioned data processing method.The computer read/write memory medium includes：USB flash disk,
Read-only memory (ROM, Read-Only Memory), is moved random access memory (RAM, Random Access Memory)
The various media that can store program code such as dynamic hard disk, magnetic disc or CD.
Although disclosed herein embodiment it is as above, the content only for ease of understanding the present invention and use
Embodiment is not limited to the present invention.Technical staff in any fields of the present invention is taken off not departing from the present invention
Under the premise of the spirit and scope of dew, any modification and variation, but the present invention can be carried out in the form and details of implementation
Scope of patent protection, still should be subject to the scope of the claims as defined in the appended claims.
Claims (31)
1. a kind of data processing method, which is characterized in that including：
Transmitting terminal carries out the first encoding operation to the information bit sequence that length is K0 bits, generates first that length is K1 bits
Class codeword sequence；
According to preset line index set, select K1 rows to the first kind code word sequence from preset generator matrix
Row carry out the second encoding operation, obtain the second class codeword sequence that length is K2；Wherein, the preset line index set
In the quantity of element be equal to the length K1, the K0, K1 of the first kind codeword sequence, K2 is positive integer, and K0≤K1≤
K2；
The second class codeword sequence is sent to receiving terminal by the transmitting terminal.
2. the method as described in claim 1, which is characterized in that first encoding operation is：By at least one following coding
Mode is encoded, and the execution of same coding mode is one or many：
Checksum coding, cyclic redundancy check coding, Bose-Chaudhuri-Hocquenghem Code, Hamming code coding, convolutional encoding, generator matrix coding,
Turbo is encoded, low-density checksum coding, Reed Muller coding, Hash coding.
3. the method as described in claim 1, which is characterized in that the preset line index set meets：For arbitrary
The longer first kind codeword sequence of length in the two is known as long first kind codeword sequence by two first kind codeword sequences, another
A to be known as short first kind codeword sequence, then the line index set of the short first kind codeword sequence is the long first kind code word sequence
The proper subclass of the line index set of row.
4. the method as described in claim 1, which is characterized in that the preset line index set meets：For arbitrary
The longer first kind codeword sequence of length in the two is known as long first kind codeword sequence by two first kind codeword sequences, another
It is a to be known as short first kind codeword sequence, then it is at least proportional for p%'s in the line index set of the short first kind codeword sequence
Element is not in the line index set of the long first kind codeword sequence, and 0 ＜ p%≤20%.
5. method as claimed in claim 4, which is characterized in that the p% is 5%, 10% or 20%.
6. the method as described in claim 1, which is characterized in that it is described according to preset line index set, it is set from advance
It selects K1 rows to carry out the second encoding operation to the first kind codeword sequence in fixed generator matrix, obtains second that length is K2
Class codeword sequence includes：
From a preset generator matrix, the corresponding K1 rows of element in the line index set are selected, and from institute
It states and continuous N1 is selected to arrange in generator matrix, the submatrix of composition K1 rows N1 row, with the submatrix to the first kind code word
Sequence is encoded, and obtains codeword sequence after the coding that length is N1, the N1 is positive integer；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, it is K2 to obtain the length
The second class codeword sequence.
7. the method as described in claim 1, which is characterized in that it is described according to preset line index set, it is set from advance
It selects K1 rows to carry out the second encoding operation to the first kind codeword sequence in fixed generator matrix, obtains second that length is K2
Class codeword sequence includes：
From multiple preset generator matrixes, select a columns for the generator matrix of N1, wherein the N1 is just whole
Number, the row indicated from the element selected in selected generator matrix in the line index set, the submatrix of composition K1 rows N1 row,
The first kind codeword sequence is encoded with the submatrix, obtains codeword sequence after the coding that length is N1；
The length is carried out increasing bit for codeword sequence after the coding of N1 or deleted bit is handled, it is K2 to obtain the length
The second class codeword sequence.
8. method as claimed in claims 6 or 7, which is characterized in that described is codeword sequence after the coding of N1 to the length
It carries out increasing bit or deleted bit processing, obtaining the second class codeword sequence that the length is K2 includes：
If K2≤N1, N1-K2 bit is deleted from codeword sequence after the coding, obtains the second class that the length is K2
Codeword sequence；
If K2>N1, then from selecting K2-N1 bit to be added to codeword sequence after the coding in codeword sequence after the coding
Before or after position, obtain the length be K2 the second class codeword sequence.
9. method as claimed in claims 6 or 7, which is characterized in that the N1=2i, the i is nonnegative integer.
10. the method for claim 7, which is characterized in that the multiple preset generator matrix meets following item
Part：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generator matrix
It is described if the column number of first generator matrix is less than the column number of second generator matrix with the second generator matrix
Second generator matrix includes all column vectors in first generator matrix.
11. the method for claim 7, which is characterized in that the multiple preset generator matrix meets following item
Part：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generator matrix
It is described if the column number of first generator matrix is less than the column number of second generator matrix with the second generator matrix
At least the column vector of q% is different from the column vector that described second generates in first generator matrix, and 0 ＜ q%≤20%.
12. method as claimed in claim 11, which is characterized in that the q% is 5%, 10% or 20%.
13. a kind of data processing equipment, which is characterized in that including：
Storage unit, for storing preset generator matrix and preset line index set；
First coding unit, for carrying out the first encoding operation to the information bit sequence that length is K0 bits, generating length is
The first kind codeword sequence of K1 bits；The K1 is the quantity of the element in the preset line index set；The K0,
K1 is positive integer and K0≤K1；
Second coding unit is used for according to the preset line index set, from the preset generator matrix
It selects K1 rows to carry out the second encoding operation to the first kind codeword sequence, obtains the second class codeword sequence that length is K2；Institute
K1 is stated, K2 is positive integer and K1≤K2；
Transmission unit, for the second class codeword sequence to be sent to receiving terminal.
14. device as claimed in claim 13, which is characterized in that first encoding operation is：It is compiled by least one following
Code mode is encoded, and the execution of same coding mode is one or many：
Checksum coding, cyclic redundancy check coding, Bose-Chaudhuri-Hocquenghem Code, Hamming code coding, convolutional encoding, generator matrix coding,
Turbo is encoded, low-density checksum coding, Reed Muller coding, Hash coding.
15. device as claimed in claim 13, which is characterized in that the preset line index set meets：For appointing
Two first kind codeword sequences of meaning, are known as long first kind codeword sequence, separately by the longer first kind codeword sequence of length in the two
One is known as short first kind codeword sequence, then the line index set of the short first kind codeword sequence is the long first kind code word
The proper subclass of the line index set of sequence.
16. device as claimed in claim 13, which is characterized in that the preset line index set meets：For appointing
Two first kind codeword sequences of meaning, are known as long first kind codeword sequence, separately by the longer first kind codeword sequence of length in the two
One is known as short first kind codeword sequence, then at least proportional in the line index set of the short first kind codeword sequence is p%
Element not in the line index set of the long first kind codeword sequence, and 0 ＜ p%≤20%.
17. device as claimed in claim 16, which is characterized in that the p% is 5%, 10% or 20%.
18. device as claimed in claim 13, which is characterized in that second coding unit is according to preset line index
Set selects K1 rows to carry out the second encoding operation to the first kind codeword sequence, obtains from preset generator matrix
Length is that the second class codeword sequence of K2 includes：
From a preset generator matrix, the K1 rows for selecting the element in the line index set to indicate, and from institute
It states and continuous N1 is selected to arrange in generator matrix, the submatrix of composition K1 rows N1 row, with the submatrix to first kind codeword sequence
It is encoded, obtains codeword sequence after the coding that length is N1, the N1 is positive integer；
Codeword sequence after coding that the length is N1 is carried out increasing bit or deleted bit processing, obtains that length is K2
Two class codeword sequences.
19. device as claimed in claim 13, which is characterized in that it is described according to preset line index set, from advance
It selects K1 rows to carry out the second encoding operation to the first kind codeword sequence in the generator matrix of setting, obtains that length is K2
Two class codeword sequences include：
From multiple preset generator matrixes, select a columns for the generator matrix of N1, wherein the N1 is just whole
Number, the row indicated from the element selected in selected generator matrix in the line index set, the submatrix of composition K1 rows N1 row,
The first kind codeword sequence is encoded with the submatrix, obtains codeword sequence after the coding that length is N1；
Codeword sequence after coding that the length is N1 is carried out increasing bit or deleted bit processing, obtains that length is K2
Two class codeword sequences.
20. the device as described in claim 18 or 19, which is characterized in that described is code word sequence after the coding of N1 to the length
Row carry out increasing bit or deleted bit processing, obtain the second class codeword sequence that length is K2 and include：
If K2≤N1, N1-K2 bit is deleted from codeword sequence after the coding, obtains the second class that the length is K2
Codeword sequence；
If K2>N1, then from selecting K2-N1 bit to be added to codeword sequence after the coding in codeword sequence after the coding
Before or after position, obtain the length be K2 the second class codeword sequence.
21. the device as described in claim 18 or 19, which is characterized in that the N1=2i, wherein i is nonnegative integer.
22. device as claimed in claim 19, which is characterized in that the multiple preset generator matrix meets following item
Part：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generator matrix
It is described if the column number of first generator matrix is less than the column number of second generator matrix with the second generator matrix
Second generator matrix includes all column vectors in first generator matrix.
23. device as claimed in claim 19, which is characterized in that the multiple preset generator matrix meets following item
Part：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generator matrix
It is described if the column number of first generator matrix is less than the column number of second generator matrix with the second generator matrix
At least the column vector of q% is different from the column vector that described second generates in first generator matrix, and 0 ＜ q%≤20%.
24. device as claimed in claim 23, which is characterized in that the q% is 5%, 10% or 20%.
25. a kind of data processing equipment, which is characterized in that including memory and processor, the memory has program stored therein, institute
Program is stated when reading execution by the processor, executes following operation：
First encoding operation is carried out to the information bit sequence that length is K0 bits, generates the first kind code word that length is K1 bits
Sequence；
According to preset line index set, select K1 rows to the first kind code word sequence from preset generator matrix
Row carry out the second encoding operation, obtain the second class codeword sequence that length is K2；Wherein, the preset line index set
In the quantity of element be equal to the length K1, the K0, K1 of the first kind codeword sequence, K2 is positive integer, and K0≤K1≤
K2；
The second class codeword sequence is sent to receiving terminal.
26. equipment as claimed in claim 25, which is characterized in that the preset line index set meets：For appointing
Two first kind codeword sequences of meaning, are known as long first kind codeword sequence, separately by the longer first kind codeword sequence of length in the two
One is known as short first kind codeword sequence, then the line index set of the short first kind codeword sequence is the long first kind code word
The proper subclass of the line index set of sequence.
27. equipment as claimed in claim 25, which is characterized in that the preset line index set meets：For appointing
Two first kind codeword sequences of meaning, are known as long first kind codeword sequence, separately by the longer first kind codeword sequence of length in the two
One is known as short first kind codeword sequence, then at least proportional in the line index set of the short first kind codeword sequence is p%
Element not in the line index set of the long first kind codeword sequence, and 0 ＜ p%≤20%.
28. equipment as claimed in claim 25, which is characterized in that it is described according to preset line index set, from advance
It selects K1 rows to carry out the second encoding operation to the first kind codeword sequence in the generator matrix of setting, obtains that length is K2
Two class codeword sequences include：
From a preset generator matrix, the K1 rows for selecting the element in the line index set to indicate, and from institute
It states and continuous N1 is selected to arrange in generator matrix, the submatrix of composition K1 rows N1 row, with the submatrix to first kind codeword sequence
It is encoded, obtains codeword sequence after the coding that length is N1, the N1 is positive integer；
Codeword sequence after coding that the length is N1 is carried out increasing bit or deleted bit processing, obtains that length is K2
Two class codeword sequences.
29. equipment as claimed in claim 25, which is characterized in that it is described according to preset line index set, from advance
It selects K1 rows to carry out the second encoding operation to the first kind codeword sequence in the generator matrix of setting, obtains that length is K2
Two class codeword sequences include：
From multiple preset generator matrixes, select a columns for the generator matrix of N1, wherein the N1 is just whole
Number, the row indicated from the element selected in selected generator matrix in the line index set, the submatrix of composition K1 rows N1 row,
The first kind codeword sequence is encoded with the submatrix, obtains codeword sequence after the coding that length is N1；
Codeword sequence after coding that the length is N1 is carried out increasing bit or deleted bit processing, obtains that length is K2
Two class codeword sequences.
30. equipment as claimed in claim 29, which is characterized in that the multiple preset generator matrix meets following item
Part：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generator matrix
It is described if the column number of first generator matrix is less than the column number of second generator matrix with the second generator matrix
Second generator matrix includes all column vectors in first generator matrix.
31. equipment as claimed in claim 29, which is characterized in that the multiple preset generator matrix meets following item
Part：
For arbitrary two generator matrixes in the multiple preset generator matrix, it is referred to as the first generator matrix
It is described if the column number of first generator matrix is less than the column number of second generator matrix with the second generator matrix
At least the column vector of q% is different from the column vector that described second generates in first generator matrix, and 0 ＜ q%≤20%.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710081555.7A CN108429601A (en) | 2017-02-15 | 2017-02-15 | A kind of data processing method and device, data processing equipment |
| PCT/CN2018/074967 WO2018149304A1 (en) | 2017-02-15 | 2018-02-01 | Data processing method and device, data processing apparatus, and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710081555.7A CN108429601A (en) | 2017-02-15 | 2017-02-15 | A kind of data processing method and device, data processing equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108429601A true CN108429601A (en) | 2018-08-21 |
Family
ID=63155401
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710081555.7A Pending CN108429601A (en) | 2017-02-15 | 2017-02-15 | A kind of data processing method and device, data processing equipment |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108429601A (en) |
| WO (1) | WO2018149304A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112668015A (en) * | 2019-12-12 | 2021-04-16 | 华控清交信息科技(北京)有限公司 | Data processing method and device and data processing device |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW201106635A (en) * | 2008-10-20 | 2011-02-16 | Agency Science Tech & Res | Computer-aided method for generation of a channel transmission error detection code matrix, encoder, decoder and computer program product |
| CN101882976A (en) * | 2010-07-14 | 2010-11-10 | 北京邮电大学 | Reliable data packet transmission method |
| CN103152652B (en) * | 2013-03-15 | 2015-11-18 | 浙江大学 | A kind of video requency frame data network transfer method of encoding based on Cauchy RS |
| CN105138412B (en) * | 2015-08-19 | 2018-03-20 | 首都师范大学 | The hybrid error correction apparatus and method of embedded microprocessor cache |
-
2017
- 2017-02-15 CN CN201710081555.7A patent/CN108429601A/en active Pending
-
2018
- 2018-02-01 WO PCT/CN2018/074967 patent/WO2018149304A1/en active Application Filing
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112668015A (en) * | 2019-12-12 | 2021-04-16 | 华控清交信息科技(北京)有限公司 | Data processing method and device and data processing device |
| CN112668015B (en) * | 2019-12-12 | 2022-02-01 | 华控清交信息科技(北京)有限公司 | Data processing method and device and data processing device |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2018149304A1 (en) | 2018-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11689220B2 (en) | Method and device for interleaving data | |
| US11509418B2 (en) | Polar code encoding method and device | |
| KR102621627B1 (en) | Apparatus and method for encoding with cyclic redundancy check and polar code | |
| CN100596029C (en) | Method of constructing check matrix for LDPC code, and encoding and decoding device of using the method | |
| CN105453466B (en) | Rate matching method and device for polarization code | |
| CN102405599B (en) | Extension TURBO interleaver for parallel turbo decoding | |
| CN105991227B (en) | Data coding method and device | |
| JP6820438B2 (en) | Information processing method and communication device | |
| EP3614701A1 (en) | Polar code transmission method and device | |
| KR102394139B1 (en) | Method for generating a sequence for a polar code and medium therefor and method and apparatus for transmitting data using thereof | |
| US11245423B2 (en) | Interleaving method and apparatus | |
| CN102077470B (en) | Method and device for encoding by linear block code, and method and device for generating linear block code | |
| CN107733440B (en) | Polygonal structured LDPC processing method and device | |
| CN108429553B (en) | Encoding method, encoding device and equipment of polarization code | |
| CN108429601A (en) | A kind of data processing method and device, data processing equipment | |
| CN107733439B (en) | LDPC (Low Density parity check) coding method, coding device and communication equipment | |
| EP4340231A1 (en) | Polar code encoding method and decoding method and apparatuses | |
| CN100446427C (en) | Method for constructing LDPC code in mobile digital multimedia broadcast system | |
| CN108631913B (en) | Interleaving method based on quasi-cyclic low-density check code and related equipment | |
| CN114826283A (en) | Decoding method, device, equipment and computer readable storage medium | |
| JP2023523254A (en) | Encoding method and apparatus, decoding method and apparatus, and device | |
| CN108429602B (en) | Data processing method and device and transmitting terminal | |
| CN102981924A (en) | Method and device suitable for data storage of dynamic coding | |
| CN111525980A (en) | Decoding method and device | |
| CN108234069B (en) | Low-bit-rate data sending method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180821 |