H03M13/1555

Turbo Product Polar Coding with Hard Decision Cleaning
20190036550 · 2019-01-31 ·

An encoder for encoding source information into an encoded codeword used in a communication channel includes a data input to receive source data, a processor, and a memory to store an encoder program. The encoder program makes the processor to encode the source data into a turbo product coding (TPC) structure, and the TPC structure comprises a data block corresponding to the source data, a first parity block including a first column part, a first corner part and a first bottom part, the first parity block being arranged so as to cover a right end column of the data block, a right bottom corner of the data block and a bottom row of the data block by the first column part, the first corner part and the first bottom part, and a second parity block having a row parity block, a joint parity block and a column parity block.

RESOURCE EFFICIENT LIST DECODING OPERATIONS

Certain aspects of the present disclosure provide techniques for Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for determining a minimal list size to use in list decoding operations for reducing resource consumption (e.g., compute, memory, and power) at a decoder. A method includes receiving a codeword comprising a plurality of channel bits encoded with an error-correcting code, the plurality of channel bits comprising, at least, a plurality of information bits, determining a payload size of the codeword, determining a channel capacity metric for the plurality of channel bits, determining a minimal list size for a list decoding operation based on at least the payload size and the channel capacity metric; and performing the list decoding operation on the codeword based on the minimal list size to obtain the plurality of information bits.

Pipelined architecture for iterative decoding of product codes

In one embodiment, a method includes loading first data into a first buffer of an interposer during a first time period and loading second data into a second buffer of the interposer and performing a first decoding operation on the first data using a first decoder during a second time period. The method includes loading third data into a third buffer of the interposer, performing the first decoding operation on the second data using the first decoder, and performing a second decoding operation on the first data using a second decoder during a third time period. Moreover, the method includes loading fourth data into a fourth buffer of the interposer, performing the first decoding operation on the third data using the first decoder, and performing the second decoding operation on the second data during a fourth time period. The first and second decoding operations are C1 or C2 decoding operations.

Resource efficient list decoding operations

Certain aspects of the present disclosure provide techniques for Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for determining a minimal list size to use in list decoding operations for reducing resource consumption (e.g., compute, memory, and power) at a decoder. A method includes receiving a codeword comprising a plurality of channel bits encoded with an error-correcting code, the plurality of channel bits comprising, at least, a plurality of information bits, determining a payload size of the codeword, determining a channel capacity metric for the plurality of channel bits, determining a minimal list size for a list decoding operation based on at least the payload size and the channel capacity metric; and performing the list decoding operation on the codeword based on the minimal list size to obtain the plurality of information bits.