Patent ID: 8726138
Filing Date: 2014-05-13
Classification: H03M

Abstract:
1. A method for performing a tail biting convolution code (TBCC) decoding scheme, comprising: receiving a packet of one or more blocks of encoded data bits, each block being encoded with a redundancy such that a final decoding state of each block is identical to a starting decoding state of that block; replicating a predetermined number of one or more blocks of the received packet prior to initializing a probability of each starting decoding state; appending at least one replicated block to the received packet; initializing a probability of each starting decoding state to equal probabilities; forward tracing from each starting decoding state to each identical final decoding state for each block in the appended packet prior to selecting M most likely final states; constructing a trellis over the length of the appended packet based on the forward tracing; selecting, by a processor, the M most likely final states from a set of more than M possible final decoding states for each block in the appended packet, each selected final decoding state having an associated identical starting decoding state; applying, by the processor, a maximum liklihood (ML) algorithm to select a most likely path from a set of paths between pairs of the selected final decoding states and the associated starting decoding states for each block in the appended packet, the selected most likely path comprising a minimum value among values for each path of the set of paths; and obtaining, by a decoder, decoded data bits by tracing back from the selected most likely path for each block in the appended packet.