Patent ID: 9184769
Filing Date: 2015-11-10
Classification: H03M

Abstract:
1. A method for decoding a sequence of symbols, said sequence having been generated by calculating a cyclic redundancy check value for an initial message, combining the initial message and the cyclic redundancy check value to produce a transformed message and encoding the transformed message; the decoding comprising the generation of a plurality of path hypotheses across a trellis comprising nodes and branches, said branches representing the possible transitions between said nodes, as well as the selection of the most probable path hypothesis from said path hypotheses, with respect to the sequence of symbols, wherein said nodes represent the elements of a Cartesian product of at least the set of encoder states likely to have performed said encoding and the set of calculator states likely to have calculated the cyclic redundancy check value, and wherein a transition from a first node, corresponding to a first encoder state and a first calculator state, to a second node, corresponding to a second encoder state and a second calculator state, is possible,