Apparatus and method for low density parity check code decoding in a first processing device, wherein the method includes receiving a first bit-word of a first length related to a log-likelihood ratio of a bit of a signal; obtaining a second bit-word of a second length that is shorter than the first length, wherein obtaining the second bit-word comprises applying a correction to the first bit-word; and determining a message depending on a set of second bit-words, wherein the set of second bit-words includes the second bit-word.

A method and an apparatus for decoding polar codes, the method comprising: determining a starting level for processing an overflow according to a number of encoded bits of a received polar encoded codeword, an input bit-width, and an internal bit-width of a decoder; multiplying an output Log-Likelihood Ratio (LLR) value and two input LLR values of the G function by a first coefficient and a second coefficient respectively; and finally, the LLR values corresponding to the received codeword are decoded to obtain decoded bits.

This disclosure provides a data retransmission method and apparatus. The method includes: A transmitting device obtains information to be transmitted for a t.sup.th time, where the information to be transmitted for the t.sup.th time includes R.sub.t extension locations and information to be transmitted for a (t−1).sup.th time, and the extension locations include M.sub.t information bits and L.sub.t check bits corresponding to the M.sub.t information bits. The transmitting device then performs Polar encoding on the information to be transmitted for the t.sup.th time, to obtain a codeword after the Polar encoding, obtains a codeword for (t−1).sup.th retransmission based on the codeword after the Polar encoding, and transmits the codeword for (t−1).sup.th retransmission. A receiving device performs polar decoding after receiving the codeword for (t−1).sup.th retransmission, to obtain a decoding result of codewords for t times of transmission. By performing, on an encoding side, check encoding on the information bits in an extension part, a decoding path can be reduced in a decoding process, thereby greatly reducing decoding complexity, and reducing storage overheads and calculation overheads.

Provided are a data communication processing method and device. The method includes: acquiring a modulation order and a target code rate; calculating an intermediate number N.sub.info of information bits at least according to a total number of resource elements, the modulation order and the target code rate; quantizing the intermediate number N.sub.info of the information bits to obtain the quantized intermediate number N′.sub.info; determining a transport block size (TBS) according to the quantized intermediate number N′.sub.info.

Provided are a data communication processing method and device. The method includes: acquiring a modulation order and a target code rate; calculating an intermediate number N.sub.info of information bits at least according to a total number of resource elements, the modulation order and the target code rate; quantizing the intermediate number N.sub.info of the information bits to obtain the quantized intermediate number N′.sub.info; determining a transport block size (TBS) according to the quantized intermediate number N′.sub.info.

According to some embodiments, a method of operation of a transmit node in a wireless communication system comprises performing polar encoding of a set of K information bits to thereby generate a set of polar-encoded information bits. The K information bits are mapped to the first K bit locations in an information sequence S.sub.N. The information sequence S.sub.N is a ranked sequence of N information bit locations among a plurality of input bits for the polar encoding where N is equivalent to a code length. A size of the information sequence S.sub.N is greater than or equal to K. The information sequence S.sub.N is optimized for the specific value of the code length (N). The method may further comprise transmitting the set of polar-encoded information bits.

Read data associated with Flash storage that is in a Flash storage state is received. One of a plurality of log-likelihood ratio (LLR) mapping tables is selected based at least in part on: (1) the Flash storage state and (2) a decoding attempt count associated with a finite-precision low-density parity-check (LDPC) decoder. A set of one or more LLR values is generated using the read data and the selected LLR mapping table, where each LLR value in the set of LLR values has a same finite precision as the finite-precision LDPC decoder. The finite-precision LDPC decoder generates the error-corrected read data using the set of LLR values and outputs it.

A data storage device includes a memory device and a controller coupled to the memory device. The controller is configured to determine an error correction code (ECC) code length for KV pair data and/or an ECC code rate for the KV pair data, where the ECC code length and the ECC code rate are selected according to a value length and decoding capability of the KV pair data, generate ECC parity based on the selecting, and program the KV pair data and the generated ECC parity to the memory device.

A coded signal is received via a physical channel. The coded signal is encoded by a parity check matrix. In some examples, the coded signal is low density parity check-encoded. The coded signal is decoded to determine a result signal. Said decoding alternatingly updates, for each one of a number of iterations, bit node values representing bits of the result signal and check node values representing constrains of the parity check matrix. In some examples, the decoding determines the result signal at a first precision and updates at least partly at a second precision which is lower than the first precision. In further examples, the number of iterations is dynamically adjusted.

A method and apparatus for decoding quasi-cyclic LDPC codes using a vertical layered iterative message passing algorithm. The algorithm of the method improves the efficiency of the check node update by using one or more additional magnitudes, predicted with predictive magnitude maps, for the computation of messages and update of the check node states. The method allows reducing the computational complexity, as well as the storage requirements, of the processing units in the check node update. Several embodiments for the apparatus are presented, using one or more predictive magnitude maps, targeting significant savings in resource usage and power consumption, while minimizing the impact on the error correction performance loss.