US 2006/0041824 A1Published application

Method and apparatus for computing parity characters for a codeword of a cyclic code

AssigneeMediatek Incorporation

InventorJia-Horng SHIEH

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method for computing parity characters for a codeword of a cyclic code successively generates a sum of an output value and a respective message character of a first message section adjacent to parity characters within a first block. The method then successively multiplies a respective sum by corresponding coefficients of a generator polynomial to generate at least one product. The method further successively multiplies a respective message character of every message section other than the first message section by coefficients of a corresponding shift polynomial to generate a plurality of products, before finally, successively summing corresponding products to generate the output value.

Claims20

Dependent claims

An apparatus for computing parity characters for a codeword of a cyclic code, the parity characters having intermediate locations between a first block and a second block of the codeword, the first block or the second block comprising a plurality of message sections and each message section comprising at least one message character, the apparatus comprising:

an adder module comprising at least one adder;
a first adder electrically connected to the adder, for successively generating a sum of an output value from the adder and a respective message character of a first message section adjacent to the parity characters within the first block;
a first multiplier module electrically connected to the first adder, the first multiplier module comprising at least one first multiplier for successively multiplying a respective sum from the first adder by corresponding coefficients of a generator polynomial to generate at least one product;
and
a plurality of multiplier modules for generating a plurality of products, each of the plurality of multiplier modules comprising at least one multiplier, the multiplier electrically connected to the adder, for successively multiplying a respective message character of every message section other than the first message section by coefficients of a corresponding shift polynomial to generate at least one product;
wherein the adder successively sums corresponding products obtained by the first multiplier and by the multiplier of the respective multiplier modules.

3 more elements

An apparatus for computing parity characters for a codeword of a cyclic code, the parity characters having intermediate locations between a first block and a second block of the codeword, the first block or the second block comprising at least one message section and each message section comprising at least one message character, the apparatus comprising:

a reverse module for reversing the message characters of respective message sections to generate corresponding reversed message sections;
an adder module comprising at least one adder;
a first adder electrically connected to the adder, for successively generating a sum of an output value from the adder and a respective message character of a reversed message section corresponding to a second message section adjacent to the parity characters within the second block;
a first multiplier module electrically connected to the first adder, the first multiplier module comprising at least one first multiplier for successively multiplying a respective sum obtained by the first adder by corresponding coefficients of a reverse generator polynomial to generate at least one product;
and
a multiplier module for generating a plurality of products, the multiplier module comprising at least one multiplier, the multiplier electrically connected to the adder, for successively multiplying a respective message character of every reversed message section other than the reversed message section corresponding to the second message section by coefficients of a corresponding shift polynomial to generate a plurality of products;
wherein the adder successively sums corresponding products obtained by the first multiplier and by the multiplier of the respective multiplier module.

4 more elements

Dependencies are inferred from the claim text.