CPC H04N 19/93 (2014.11) [H04N 19/184 (2014.11); H04N 19/91 (2014.11)] | 20 Claims |
1. A coding method, wherein the method comprises:
obtaining a plurality of pieces of run-length encoding (RLE) data and a plurality of distribution probabilities corresponding to the plurality of pieces of RLE data;
sorting the plurality of pieces of RLE data based on the plurality of distribution probabilities;
mapping the plurality of pieces of sorted RLE data onto a plurality of pieces of reassembled data;
expanding the plurality of pieces of reassembled data into a plurality of pieces of binary data;
generating a first matrix based on the plurality of pieces of binary data;
calculating an occurrence probability of a bit 1 in each column in the first matrix based on the plurality of distribution probabilities;
determining, based on the occurrence probability, a code sequence by processing a source signal, wherein the code sequence comprises a first set and a second set, the first set comprises one or more bits reserved after processing the source signal, and the second set comprises one or more bits discarded after processing the source signal; and
decoding a first vector to output a third set, wherein the first vector is an all-0 sequence, or a vector obtained by multiplying a vector corresponding to the first set and a polarization matrix, and the third set comprises the one or more bits reserved after processing the source signal and one or more locations at which a decoding error occurs in the one or more bits discarded after processing the source signal.
|