WO2018149304A1 - Procédé et dispositif de traitement de données, appareil de traitement de données et support de stockage informatique - Google Patents

Procédé et dispositif de traitement de données, appareil de traitement de données et support de stockage informatique Download PDF

Info

Publication number
WO2018149304A1
WO2018149304A1 PCT/CN2018/074967 CN2018074967W WO2018149304A1 WO 2018149304 A1 WO2018149304 A1 WO 2018149304A1 CN 2018074967 W CN2018074967 W CN 2018074967W WO 2018149304 A1 WO2018149304 A1 WO 2018149304A1
Authority
WO
WIPO (PCT)
Prior art keywords
codeword sequence
length
type
sequence
matrix
Prior art date
Application number
PCT/CN2018/074967
Other languages
English (en)
Chinese (zh)
Inventor
许进
徐俊
陈梦竹
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018149304A1 publication Critical patent/WO2018149304A1/fr

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/0041—Arrangements at the transmitter end
    • H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables
    • 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/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes
    • H04L1/0065—Serial concatenated codes

Definitions

  • the present invention relates to the field of wireless mobile communication technologies, and more particularly to a data processing method and apparatus, and a data processing apparatus and a computer storage medium.
  • the transmitting end of the digital communication system usually includes a source, a source encoder, a channel coder and a modulator
  • the receiving end usually includes a demodulator, a channel decoder, a source decoder and a sink.
  • the channel coder is used to introduce information bits into the information bits according to certain rules so that the receiving channel decoder can correct the errors occurring when the information is transmitted on the channel to some extent.
  • FEC Forward Error Correction
  • a linear block code is a set of fixed length code groups that can be represented as (n, k) block codes, typically for forward error correction. At the time of encoding, k information bits are encoded into n-bit code group lengths. Since the 2 k codewords of the (n, k) block code form a k-dimensional subspace, the 2 k codewords must be generated by k linearly independent substrates, if the k bases are written in the form of a matrix. , there are:
  • any codeword in the (n, k) block code can be generated by a linear combination of the set of substrates, ie
  • G is a generator matrix of codes. Obviously, for each row of the generator matrix, as long as the linear independence is satisfied (the minimum distance is not considered), and the base of a k-dimensional space can arbitrarily select k linearly independent vectors, the generation matrix G as the code is not unique. But regardless of which form they are used, they all generate the same subspace, the same (n, k) group code.
  • the channel coding service is a separate part of the mobile communication system, which guarantees the reliability, accuracy and effectiveness of information transmission.
  • the most urgent need of 5G is to meet a large increase in spectral efficiency and reliability. How to improve channel coding performance is one of the technical problems that need to be solved by 5G.
  • Embodiments of the present invention provide a data processing method and apparatus, and a data processing apparatus and a computer storage medium, which can at least improve channel coding performance and meet the requirements of a next generation communication system.
  • the embodiment of the invention provides a data processing method, including:
  • Performing a second encoding operation on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class codeword sequence of length K2;
  • the number of elements in the preset row index set is equal to the length K1 of the first type codeword sequence, and the K0, K1, K2 are all positive integers, and K0 ⁇ K1 ⁇ K2.
  • the first coding operation is: performing coding according to at least one of the following coding modes, and performing the same coding mode one or more times:
  • Parity coding Parity coding, cyclic redundancy check coding, BCH coding, Hamming code coding, convolutional coding, generator matrix coding, Turbo coding, low density parity check coding, Reed Muller coding, hash coding.
  • the preset row index set satisfies: for any two first type codeword sequences, the first type of codeword sequence having a longer length is referred to as a long first type codeword sequence.
  • the other is referred to as a short first class codeword sequence, and the row index set of the short first class codeword sequence is a true subset of the row index set of the long first class codeword sequence.
  • the preset row index set satisfies: for any two first type codeword sequences, the first type of codeword sequence having a longer length is referred to as a long first type codeword sequence.
  • Another sequence of short first class codewords wherein at least a proportion of the row index set of the short first class codeword sequence is not in the row index set of the long first class codeword sequence. And 0 ⁇ p% ⁇ 20%.
  • the p% is 5%, 10% or 20%.
  • the second encoding operation is performed on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class code having a length of K2.
  • the word sequence includes:
  • the matrix encodes the first type of codeword sequence to obtain a sequence of coded codewords of length N1, where N1 is a positive integer;
  • the second encoding operation is performed on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class code having a length of K2.
  • the word sequence includes:
  • the adding or deleting bit processing is performed on the encoded codeword sequence of length N1, and obtaining the second type of codeword sequence of length K2 includes:
  • K2-N1 bits are selected from the encoded codeword sequence to be added to the previous or subsequent positions of the encoded codeword sequence to obtain the second type of codeword sequence of length K2.
  • the N1 2 i , and the i is a non-negative integer.
  • the plurality of preset generation matrices satisfy the following conditions:
  • the second generation matrix includes all column vectors in the first generation matrix.
  • the plurality of preset generation matrices satisfy the following conditions:
  • the first generation matrix and the second generation matrix For any two of the plurality of preset generation matrices, respectively, the first generation matrix and the second generation matrix, if the number of columns of the first generation matrix is smaller than the second generation matrix The number of columns is such that at least q% of the column vectors in the first generation matrix are different from the second generated column vector, and 0 ⁇ q% ⁇ 20%.
  • the q% is 5%, 10% or 20%.
  • the embodiment of the invention further provides a data processing device, including:
  • a storage unit configured to store a preset generation matrix and a preset set of row indexes
  • a first coding unit configured to perform a first coding operation on the information bit sequence of length K0 bits to generate a first type of codeword sequence of length K1 bits; wherein the K1 is in the preset row index set The number of elements; the K0, K1 is a positive integer and K0 ⁇ K1;
  • a second coding unit configured to perform a second coding operation on the first type of codeword sequence by selecting a K1 row from the preset generation matrix according to the preset row index set, to obtain a length of K2 a second type of codeword sequence; said K1, K2 being a positive integer and K1 ⁇ K2.
  • the first coding operation is: performing coding according to at least one of the following coding modes, and performing the same coding mode one or more times:
  • Parity coding Parity coding, cyclic redundancy check coding, BCH coding, Hamming code coding, convolutional coding, generator matrix coding, Turbo coding, low density parity check coding, Reed Muller coding, hash coding.
  • the preset row index set satisfies: for any two first type codeword sequences, the first type of codeword sequence having a longer length is referred to as a long first type codeword sequence.
  • the other is referred to as a short first class codeword sequence, and the row index set of the short first class codeword sequence is a true subset of the row index set of the long first class codeword sequence.
  • the preset row index set satisfies: for any two first type codeword sequences, the first type of codeword sequence having a longer length is referred to as a long first type codeword sequence.
  • Another sequence of short first class codewords wherein at least a proportion of the row index set of the short first class codeword sequence is not in the row index set of the long first class codeword sequence. And 0 ⁇ p% ⁇ 20%.
  • the p% is 5%, 10% or 20%.
  • the second coding unit performs a second coding operation on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a length of K2.
  • the second type of codeword sequence includes:
  • the matrix encodes the first type of codeword sequence to obtain a sequence of coded codewords of length N1, wherein the N1 is a positive integer;
  • the second encoding operation is performed on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class code having a length of K2.
  • the word sequence includes:
  • the adding or deleting bit processing is performed on the encoded codeword sequence of length N1, and obtaining the second type of codeword sequence of length K2 includes:
  • K2-N1 bits are selected from the encoded codeword sequence to be added to the previous or subsequent positions of the encoded codeword sequence to obtain the second type of codeword sequence of length K2.
  • the N1 2 i , where i is a non-negative integer.
  • the plurality of preset generation matrices satisfy the following conditions:
  • the second generation matrix includes all column vectors in the first generation matrix.
  • the plurality of preset generation matrices satisfy the following conditions:
  • the first generation matrix and the second generation matrix For any two of the plurality of preset generation matrices, respectively, the first generation matrix and the second generation matrix, if the number of columns of the first generation matrix is smaller than the second generation matrix The number of columns is such that at least q% of the column vectors in the first generation matrix are different from the second generated column vector, and 0 ⁇ q% ⁇ 20%.
  • the q% is 5%, 10% or 20%.
  • the embodiment of the present invention further provides a data processing device, including a memory and a processor, where the memory stores a program, and when the program is read and executed by the processor, the following operations are performed:
  • Performing a second encoding operation on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class codeword sequence of length K2;
  • the number of elements in the preset row index set is equal to the length K1 of the first type codeword sequence, and the K0, K1, K2 are all positive integers, and K0 ⁇ K1 ⁇ K2.
  • the preset row index set satisfies: for any two first type codeword sequences, the first type of codeword sequence having a longer length is referred to as a long first type codeword sequence.
  • the other is referred to as a short first class codeword sequence, and the row index set of the short first class codeword sequence is a true subset of the row index set of the long first class codeword sequence.
  • the preset row index set satisfies: for any two first type codeword sequences, the first type of codeword sequence having a longer length is referred to as a long first type codeword sequence.
  • Another sequence of short first class codewords wherein at least a proportion of the row index set of the short first class codeword sequence is not in the row index set of the long first class codeword sequence. And 0 ⁇ p% ⁇ 20%.
  • the second encoding operation is performed on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class code having a length of K2.
  • the word sequence includes:
  • the matrix encodes the first type of codeword sequence to obtain a sequence of coded codewords of length N1, wherein the N1 is a positive integer;
  • the second encoding operation is performed on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class code having a length of K2.
  • the word sequence includes:
  • the plurality of preset generation matrices satisfy the following conditions:
  • the second generation matrix includes all column vectors in the first generation matrix.
  • the plurality of preset generation matrices satisfy the following conditions:
  • the first generation matrix and the second generation matrix For any two of the plurality of preset generation matrices, respectively, the first generation matrix and the second generation matrix, if the number of columns of the first generation matrix is smaller than the second generation matrix The number of columns is such that at least q% of the column vectors in the first generation matrix are different from the second generated column vector, and 0 ⁇ q% ⁇ 20%.
  • Embodiments of the present invention provide a computer storage medium storing computer executable instructions for executing the foregoing data processing method.
  • a data processing method, apparatus, and device, and a computer storage medium provided by the embodiments of the present invention perform a first encoding operation on an information bit sequence, and then perform a second encoding operation on the obtained codeword. Get the final sequence of codewords.
  • the data processing method and apparatus provided by the embodiments of the present invention adopts secondary coding on the basis of the traditional generation matrix coding, and the secondary coding can obtain better coding performance than the conventional primary generation matrix code.
  • the generation matrix is selected according to the length of the second type of codeword sequence, which avoids excessive deletion or repetition and enhances performance; in addition, the row index set is selected from the preset generation matrix.
  • the indicated row encodes the information bit sequence, and can support encoding of information bit sequences of different lengths, and the row index set and the generation matrix can have nesting characteristics, that is, a row index set or a generator matrix can support different lengths.
  • the information bit sequence is encoded to generate a sequence of coded codewords of different lengths.
  • the solution provided by the embodiment of the invention can obtain better performance while reducing coding complexity, and can be used for coding of a 5G communication system.
  • FIG. 1 is a flowchart of a data processing method according to an embodiment of the present invention
  • FIG. 2 is a block diagram of a data processing apparatus according to an embodiment of the present invention.
  • a data processing method and apparatus, and a data processing apparatus provided by the embodiments of the present invention may be used in, but not limited to, NR (New Radio Access Technology).
  • the transmitting end in the embodiment of the present invention may be a base station, or may be a UE (User Equipment, user equipment), and the base station may be, but not limited to, a gNB (g Node B, g node B), and the receiving end It may be a UE or a base station, and the base station may be, but not limited to, a gNB.
  • a gNB g Node B, g node B
  • the receiving end It may be a UE or a base station, and the base station may be, but not limited to, a gNB.
  • This embodiment provides a data processing method, including the following steps:
  • Step S11 The transmitting end performs a first encoding operation on the information bit sequence of length K0 bits to generate a first type of codeword sequence of length K1 bits.
  • the first coding operation is: performing coding according to at least one of the following coding modes, and performing the same coding mode one or more times: parity coding, cyclic redundancy check coding, BCH (Bose, Ray- Chaudhuri and Hocquenghem) coding, Hamming code coding, convolutional coding, generator matrix coding, Turbo coding, low-density parity check coding, Reed Muller coding, hash coding, etc., or the above coding modes A combination of at least two encoding methods.
  • the first encoding operation may be performing parity encoding once, or performing parity encoding twice or more parity encoding, or the first encoding operation may be performing one or more parity checks. Encode and then perform one or more cyclic redundancy check codes. Alternatively, a parity encoding is performed, a cyclic redundancy check encoding is performed, and then parity encoding is performed once. Alternatively, the first encoding operation may be performing one cyclic redundancy check encoding, then performing parity encoding once, then performing BCH encoding once; and the like. That is, the number of executions of each of the above coding modes is not limited, and the order of execution of each coding mode is not limited.
  • the generator matrix coding uses a generator matrix to encode the information bit sequence, and can refer to the related description in the background art.
  • K1 K0+P1
  • P1 is the number of first parity bits generated after the first encoding
  • P1 is a positive integer
  • Step S12 Perform a second encoding operation on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set setr, to obtain a second type of codeword sequence of length K2.
  • K0, K1, K2 are all positive integers, and K0 ⁇ K1 ⁇ K2; the number of elements in the preset row index set is equal to the length K1 of the first type of codeword sequence;
  • Step S13 The transmitting end sends the sequence of the second type of codewords to the receiving end.
  • the row index set is a set of row numbers, and the row index set is used to indicate which rows of the generation matrix are selected. For example, when the row index set is [1, 2, ..., 158], the first, 2, ..., 158 rows of the generated matrix are selected. There are a plurality of row index sets, and the first type codeword sequences of different lengths correspond to different row index sets.
  • the preset set of row indices has a nesting feature, that is, for any two first class codeword sequences A and B, the lengths are assumed to be K1_A bits and K1_B bits, respectively, if K1_A ⁇ K1_B
  • the row index set setr_A of the first type of codeword sequence A is a true subset of the row index set setr_B of the first type of codeword sequence B, that is,
  • the preset set of row indices has the following characteristics: for any two first-type codeword sequences A and B, the lengths are assumed to be K1_A bits and K1_B bits, respectively, if K1_A ⁇ K1_B, then At least a proportion of the row index set setr_A of the first type of codeword sequence A having a p% is not in the row index set setr_B of the first class codeword sequence B.
  • p% can be set as needed, for example, 0 ⁇ p% ⁇ 20%, and for example, p% can be 5%, 10%, or 20%.
  • the predetermined generation matrix may be one or plural.
  • step S12 the selecting a K1 row from a preset generation matrix according to a preset row index set setr, and performing a second sequence on the first type codeword sequence.
  • the codeword sequence is encoded to obtain a coded codeword sequence of length N1, wherein encoding the first class of codeword sequence by using the submatrix may be: performing the first type of codeword sequence and the submatrix Multiply to obtain a sequence of encoded codewords of length N1.
  • the N1 2 i , i is a non-negative integer; the continuous N1 column is selected, and the N1 column of the front or the last side may be selected. Of course, the middle N1 column may also be selected.
  • step S12 the selecting a K1 row from a preset generation matrix according to a preset row index set setr, and performing a second sequence on the first type codeword sequence.
  • N1 rows and N1 columns From a predetermined generation matrix of C rows and N columns, select consecutive N1 rows and N1 columns, for example, select the frontmost or last N1 row and the front and back N1 columns to form the N1 row N1 column.
  • the first submatrix From a predetermined generation matrix of C rows and N columns, select consecutive N1 rows and N1 columns, for example, select the frontmost or last N1 row and the front and back N1 columns to form the N1 row N1 column.
  • the first submatrix From a predetermined generation matrix of C rows and N columns, select consecutive N1 rows and N1 columns, for example, select the frontmost or last N1 row and the front and back N1 columns to form the N1 row N1 column.
  • the adding or deleting bit processing is performed on the encoded codeword sequence of length N1, and obtaining the second type of codeword sequence of length K2 includes:
  • the N1-K2 bits are deleted from the encoded codeword sequence to obtain the second type of codeword sequence of length K2; the specific deletion manner may be: from the encoded codeword N1-K2 bits are deleted at the end or the front of the sequence, or N1-K2 bits are deleted from the middle, or N1-K2 bits are deleted at intervals, and so on.
  • K2-N1 bits are selected from the encoded codeword sequence to be added to the previous or subsequent positions of the encoded codeword sequence to obtain the second type of codeword sequence of length K2.
  • N1 N, at this time:
  • the word sequence is encoded to obtain a sequence of encoded codewords of length N.
  • K2 ⁇ N N-K2 bits are deleted from the encoded codeword sequence to obtain a second type of codeword sequence of length K2; if K2>N, select from the encoded codeword sequence K2-N bits are added to the previous or subsequent position of the encoded codeword sequence to obtain a second type of codeword sequence of length K2.
  • N1 and K2 According to the value of N1 and K2, it can be divided into two cases:
  • the K1 row indicated by the elements in the row index set setr is selected, and the consecutive N1 columns are selected from the N columns, for example, the frontmost or last N1 column, A submatrix constituting a column N1 of the K1 row is used, and the sequence of the first type of codewords is encoded by the submatrix to obtain a sequence of encoded codewords of length N1.
  • N1-K2 bits are deleted from the encoded codeword to obtain a second type of codeword sequence of length K2 bits.
  • the K1 row corresponding to the elements in the row index set setr is selected, and the consecutive N1 columns are selected from the N columns, for example, the frontmost or last N1 column,
  • a submatrix constituting a column N1 of the K1 row is used, and the sequence of the first type of codewords is encoded by the submatrix to obtain a sequence of encoded codewords of length N1.
  • Selecting K2-N1 bits from the encoded codewords is added to the previous or subsequent positions of the encoded codeword sequence to obtain a second type of codeword sequence of length K2 bits.
  • a generating matrix is selected from the plurality of generating matrices for the second encoding operation, and specifically includes:
  • N2 Selecting, from a plurality of preset generation matrices, a generation matrix having a column number N2, wherein a row corresponding to an element in the row index set is selected from the selected generation matrix to form a K1 row N2 column
  • N2 and K2 it can be divided into two cases:
  • N2-K2 bits are deleted from the encoded codeword to obtain a second type of codeword sequence of length K2 bits.
  • Selecting K2-N2 bits from the encoded codewords is added to the previous or subsequent positions of the encoded codeword sequence to obtain a second type of codeword sequence of length K2 bits.
  • the matrix D and E are generated, the number of columns of the generated matrix D is N2_D, and the number of columns of the generated matrix E is N2_E. If N2_D ⁇ N2_E, the generator matrix E contains all the column vectors in the matrix generation D.
  • the matrixes D and E are generated for any two of the plurality of preset generation matrices, and the number of columns is N2_D and N2_E, respectively, if N2_D ⁇ N2_E, then
  • the column vector of at least q% in the generation matrix D is different from the column vector in the generation matrix E; wherein the ratio q% can be set as needed, for example, 0 ⁇ q% ⁇ 20%, for example, q % is one of 5%, 10% or 20%.
  • the present embodiment provides a data processing apparatus, as shown in FIG. 2, including a storage unit 21, a first encoding unit 22, a second encoding unit 23, and a transmitting unit 24, wherein:
  • the storage unit 21 is configured to store a preset generation matrix and a preset row index set
  • the first encoding unit 22 is configured to perform a first encoding operation on the information bit sequence of length K0 bits to generate a first type of codeword sequence of length K1 bits;
  • the K1 is the preset row index The number of elements in the set;
  • the K0, K1 is a positive integer and K0 ⁇ K1;
  • the second encoding unit 23 is configured to perform a second encoding operation on the first type of codeword sequence by selecting a K1 row from the preset generation matrix according to the preset row index set. a second type of codeword sequence of length K2; said K1, K2 being a positive integer and K1 ⁇ K2;
  • the sending unit 24 is configured to send the second type of codeword sequence to the receiving end.
  • the data processing method and apparatus and the data processing apparatus provided by the embodiments of the present invention use secondary coding on the basis of the traditional generation matrix coding, and the secondary coding can obtain better coding than the conventional primary generation matrix code. performance.
  • the generation matrix is selected according to the length of the second type of codeword sequence, which avoids excessive deletion or repetition and enhances performance; in addition, the row index set is selected from the preset generation matrix.
  • the corresponding row encodes the information bit sequence, and can support encoding of information bit sequences of different lengths, and the row index set and the generating matrix can have nesting characteristics, that is, a row index set or a generator matrix can support different lengths.
  • the information bit sequence is encoded to generate a sequence of coded codewords of different lengths. Compared with the prior art, the information bit sequences of different lengths need to have different size generation matrices.
  • the data processing method provided by the embodiments of the present invention simplifies the coding complexity.
  • the solution provided by the embodiment of the invention can obtain better performance while reducing coding complexity, and can be used for coding of a 5G communication system.
  • the first coding operation is a cyclic redundancy check code (CRC) coding
  • the data processing method provided in this embodiment includes:
  • a matrix the first type of codeword sequence is encoded by the sub-matrix, that is, the first type of codeword sequence is multiplied with the sub-matrix to obtain a coded codeword sequence having a length of 256 bits.
  • a row index set setr_A of a class of codeword sequences A is a true subset of the row index set setr_B of the first class codeword sequence B, ie
  • Step 103 The transmitting end sends the second type of codeword sequence to the receiving end.
  • the first encoding operation is parity encoding
  • the data processing method provided in this embodiment includes:
  • the first type of codeword sequence is encoded by the sub-matrix, that is, the first type of codeword sequence is multiplied with the sub-matrix to obtain a coded codeword sequence having a length of 256 bits.
  • K2 260 bits
  • Step 203 The transmitting end sends the second type of codeword sequence to the receiving end.
  • Step 303 The transmitting end sends the second type of codeword sequence to the receiving end.
  • Step 403 The transmitting end sends the second type of codeword sequence to the receiving end.
  • Step 502 The transmitting end selects a generating matrix from a plurality of preset generating matrices.
  • the generator matrix E contains all the column vectors in the generator matrix D.
  • Step 503 The transmitting end sends the second type of codeword sequence to the receiving end.
  • Step 602 The transmitting end selects a generating matrix from a plurality of preset generating matrices.
  • Step 603 The transmitting end sends the second type of codeword sequence to the receiving end.
  • the 256 columns form the first submatrix of 256 rows and 256 columns.
  • the codeword sequence is encoded to obtain a coded codeword sequence of length 256 bits;
  • Step 703 The transmitting end sends the second type of codeword sequence to the receiving end.
  • the embodiment of the present invention further provides a data processing device, including a memory and a processor, where the memory stores a program, and when the program is read and executed by the processor, the following operations are performed:
  • Performing a second encoding operation on the first type of codeword sequence by selecting a K1 row from a preset generation matrix according to a preset row index set, to obtain a second class codeword sequence of length K2;
  • the number of elements in the preset row index set is equal to the length K1 of the first type of codeword sequence, the K0, K1, K2 being a positive integer, and K0 ⁇ K1 ⁇ K2;
  • the embodiment of the present invention further provides a computer readable storage medium (computer storage medium), where the computer readable storage medium (computer storage medium) stores computer executable instructions, and when the instructions are executed, the data processing method is executed.
  • the computer readable storage medium includes: a U disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, a magnetic disk, or an optical disk, and the like. The medium of the code.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention can take the form of a hardware embodiment, a software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) in which computer usable program code is embodied.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • the generation matrix is selected according to the length of the second type of codeword sequence, which avoids excessive deletion or repetition and enhances performance; in addition, the row index set is used from the preset generation matrix.
  • the selected indication row encodes the information bit sequence, and can support coding of information bit sequences of different lengths, and the row index set and the generation matrix can have nesting characteristics, that is, a row index set or a generator matrix can support different lengths.
  • the information bit sequence is encoded to generate encoded codeword sequences of different lengths;

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

Selon certains modes de réalisation, l'invention concerne un procédé et un dispositif de traitement de données, un appareil de traitement de données, et un support de stockage informatique. Le procédé consiste à : effectuer une première opération de codage sur une séquence de bits d'informations comportant une longueur K0 afin de générer une séquence de mot de code de premier type comportant une longueur K1 ; sélectionner, selon un ensemble d'index de colonne préconfiguré, et à partir d'une matrice de génération préconfigurée, des colonnes K1 afin d'effectuer une seconde opération de codage sur la séquence de mot de code de premier type pour obtenir une séquence de mot de code de second type comportant une longueur K2 ; un nombre d'éléments dans l'ensemble d'index de colonnes préconfiguré étant égal à la longueur K1 de la séquence de mots de code de premier type ; K0, K1 et K2 étant tous des entiers positifs ; et K0 ≤ K1 ≤ K2.
PCT/CN2018/074967 2017-02-15 2018-02-01 Procédé et dispositif de traitement de données, appareil de traitement de données et support de stockage informatique WO2018149304A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710081555.7 2017-02-15
CN201710081555.7A CN108429601A (zh) 2017-02-15 2017-02-15 一种数据处理方法和装置、数据处理设备

Publications (1)

Publication Number Publication Date
WO2018149304A1 true WO2018149304A1 (fr) 2018-08-23

Family

ID=63155401

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/074967 WO2018149304A1 (fr) 2017-02-15 2018-02-01 Procédé et dispositif de traitement de données, appareil de traitement de données et support de stockage informatique

Country Status (2)

Country Link
CN (1) CN108429601A (fr)
WO (1) WO2018149304A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112668015B (zh) * 2019-12-12 2022-02-01 华控清交信息科技(北京)有限公司 一种数据处理方法、装置和用于数据处理的装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010047662A1 (fr) * 2008-10-20 2010-04-29 Agency For Science, Technology And Research Procédé assisté par ordinateur pour la génération d’une matrice de codes de détection d’erreurs de transmission de canal, codeur, décodeur et produit-programme informatique
CN101882976A (zh) * 2010-07-14 2010-11-10 北京邮电大学 一种数据包可靠传输方法
CN103152652A (zh) * 2013-03-15 2013-06-12 浙江大学 一种基于柯西rs编码的视频帧数据网络传输方法
CN105138412A (zh) * 2015-08-19 2015-12-09 首都师范大学 嵌入式微处理器高速缓存的混合纠错装置与方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010047662A1 (fr) * 2008-10-20 2010-04-29 Agency For Science, Technology And Research Procédé assisté par ordinateur pour la génération d’une matrice de codes de détection d’erreurs de transmission de canal, codeur, décodeur et produit-programme informatique
CN101882976A (zh) * 2010-07-14 2010-11-10 北京邮电大学 一种数据包可靠传输方法
CN103152652A (zh) * 2013-03-15 2013-06-12 浙江大学 一种基于柯西rs编码的视频帧数据网络传输方法
CN105138412A (zh) * 2015-08-19 2015-12-09 首都师范大学 嵌入式微处理器高速缓存的混合纠错装置与方法

Also Published As

Publication number Publication date
CN108429601A (zh) 2018-08-21

Similar Documents

Publication Publication Date Title
US11509418B2 (en) Polar code encoding method and device
JP6584036B2 (ja) 署名対応Ｐｏｌａｒエンコーダ及びデコーダ
US10146618B2 (en) Distributed data storage with reduced storage overhead using reduced-dependency erasure codes
KR101270815B1 (ko) 다양한 클래스의 코드들을 인코딩 및 디코딩하는 애플리케이션을 갖는 인-플레이스 변환
US7523375B2 (en) Set of irregular LDPC codes with random structure and low encoding complexity
CN101621299B (zh) 一种突发纠错的方法、设备和装置
WO2017194013A1 (fr) Procédé et dispositif de codage à correction d'erreurs
WO2015135298A1 (fr) Procede, dipositif, et support de stockage informatique permettant le support de codage a faible debit binaire
CN108390740B (zh) 一种信息的传输方法、译码方法和装置
KR102289928B1 (ko) 데이터 프로세싱 방법 및 디바이스
US20200081778A1 (en) Distributed storage system, method and apparatus
US11245423B2 (en) Interleaving method and apparatus
JPWO2019130475A1 (ja) 通信路分極を用いた誤り訂正符号化方法および装置、復号方法および装置
JPWO2006106841A1 (ja) 誤り訂正符号化装置
US10606697B2 (en) Method and apparatus for improved data recovery in data storage systems
WO2018149354A1 (fr) Procédé et appareil de codage de code polaire, et dispositif et support de stockage
US11316534B2 (en) Encoding method and device, decoding method and device, and storage medium
KR20090063948A (ko) 복수의 기본 패리티 검사행렬을 이용한 저밀도 패리티 검사부호의 복호화 장치 및 그 방법
US9553611B2 (en) Error correction coding with high-degree overlap among component codes
WO2018219001A1 (fr) Procédé et dispositif de construction d'une matrice de contrôle de code ldpc
WO2018149304A1 (fr) Procédé et dispositif de traitement de données, appareil de traitement de données et support de stockage informatique
US10972220B2 (en) Interleaving method and apparatus
Hou et al. New regenerating codes over binary cyclic codes
WO2018126914A1 (fr) Procédé et dispositif de codage de code de contrôle de parité à faible densité quasi-cyclique, et support de stockage
CN110380734B (zh) 低密度奇偶检查码的编码及译码方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18754992

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18754992

Country of ref document: EP

Kind code of ref document: A1