35 results about "Successive cancellation list" patented technology

Various embodiments are described of a system and method for improved SCL decoder operation. In particular, various embodiments are described which improve the efficiency of the buffer management based on updated path metric statistics. In some embodiments, the SCL decoder may perform selective replacement to limit the extent of LLR updates per row only to the statistics that have changed since the previous update cycle. In some embodiments, the SCL decoder may perform deferred updates, which may involves in-place calculation of both ûφ=0 and ûφ=1 bit estimate (LLR) updates based on the row from which the updated row will be derived.

A method is proposed for operating a solid state storage device. The method comprises: encoding information and frozen bits into polar encoded bits; storing the polar encoded bits; reading the polar encoded bits, wherein the read polar encoded bits include the frozen bits and unfrozen bits, and performing a SCL decoding. The SCL decoding comprises: providing a list of candidate decoding paths; duplicating the candidate decoding paths; determining a maximum list size indicative of an allowed maximum number of candidate decoding paths that can be contained in the list of candidate decoding paths; pruning at least one duplicated candidate decoding path according to the maximum list size, and including in the list of candidate decoding paths a number of non-pruned duplicated candidate decoding paths not higher than the maximum list size; and selecting a decoding path from the list of candidate decoding paths.

The invention discloses a polarization code decoding method based on a bit flipping serial elimination list algorithm, and solves the problem that an existing SCL (Successive Cancellation List) algorithm has higher time complexity. The method comprises the following steps: step (1), receiving a sequence to be decoded by a communication terminal; step (2), performing SC (Successive Cancellation) decoding on the received sequence to be decoded; step (3), judging whether an SC decoded sequence passes CRC (Cyclic Redundancy Check); step (4), initializing the list width and the number of bit flipping; step (5), selecting a judgment error position set; step (6), selecting one element from the judgment error position set; step (7), decoding by using the bit flipping serial elimination list algorithm; step (8), judging whether elements in the judgment error position set are all selected or not; step (9), the decoding is successful; and step (10), the decoding fails. According to the polarization code decoding method based on the bit flipping serial elimination list algorithm provided by the invention, the SC decoding is carried out firstly, and when the decoding fails, bit flipping and list decoding are combined for re-decoding, thus the decoding performance is improved, and the time complexity of a decoding algorithm is reduced.

A method of low complexity SCL decoding for polar codes is disclosed. The method comprises receiving a codeword vector generated using polar encoding, and sequentially decoding multiple bits included in a source vector from the received codeword vector based on the successive cancellation list (SCL) decoding, wherein the decoding is configured not to perform a comparison of reliability between candidate decoding paths for a subset of information bits included in the source vector, but to determine value of the subset of information bits based on a reliability of the corresponding bit.

A method of storing survivor data generated while decoding channel polarization codes in a memory module includes setting a list size that corresponds to a number of decoder units used to decode the channel polarization codes, inputting a stream of input bits to the decoder units, and sequentially decoding the input bits. Each input bit is decoded using all previous input bits decoded before the each input bit. The method further includes selecting a plurality of survivor bits from among the decoded input bits, and storing the selected survivor bits in the memory module in a binary tree configuration. The number of edges in each level of the binary tree configuration does not exceed the list size.