Abstract: A method and apparatus are provided for error correction of a communication signal. A multiple fixed threshold scheme for iteratively decoding a received codeword includes making a comparison with a threshold to generate a reconstructed version of the received codeword. The threshold has at least two different values that at used during different iterations. The values of the threshold are fixed having been determined prior to decoding. In an embodiment, the fixed thresholds may be based on values for channel parameters and may be selected by a decoder that receives information regarding the channel parameter from a channel estimation unit monitoring the communication channel. Embodiments include decoding methods and apparatus using a threshold having two of more fixed values during the iterative decoding.

Abstract: A technique to perform fast decoding of a Reed-Solomon code. A first multiplier unit multiplies a matrix Bh with a column vector v using common adders to produce a column vector v1. The vector v represents one of an error locator polynomial, an error evaluator polynomial, and a derivative polynomial for a (n, k) Reed-Solomon code. The matrix Bh is over GF(2) including first h columns of a matrix B. A second multiplier unit multiplies non-unity components of a column vector A with non-zero components of the column vector v1 component-wise in GF(q) to produce a column vector v2, q being equal to n+1. A third multiplier unit multiplies diagonal sub-matrices of a matrix C with corresponding components of the column vector v2 in GF(2) to produce a column vector v3.

Abstract: Code shortening techniques are used to achieve a variety of code lengths and code rates for Euclidean geometry low density parity check (EG-LDPC) codes.

Abstract: Techniques to perform iterative decoding of concatenated low-density parity-check codes (LDPC) are described. Iterative decoding of the concatenated code is achieved by performing T common iterations, wherein a common iteration comprises t1 decoding iterations on the inner LDPC code my means of a first decoder (340) followed by t2 decoding iterations on the outer LDPC code my means of a second decoder (350) , and wherein the two decoders exchange soft-output information.

Abstract: Code shortening techniques are used to achieve a variety of code lengths and code rates for Euclidean geometry low density parity check (EG-LDPC) codes.

Abstract: A method and apparatus are provided for error correction of a communication signal. A multiple fixed threshold scheme for iteratively decoding a received codeword includes making a comparison with a threshold to generate a reconstructed version of the received codeword. The threshold has at least two different values that at used during different iterations. The values of the threshold are fixed having been determined prior to decoding. In an embodiment, the fixed thresholds may be based on values for channel parameters and may be selected by a decoder that receives information regarding the channel parameter from a channel estimation unit monitoring the communication channel. Embodiments include decoding methods and apparatus using a threshold having two of more fixed values during the iterative decoding.

Abstract: A method and apparatus are provided for error correction of a communication signal. Joint operation of forward error correction (FEC) techniques and automatic repeat request (ARQ) techniques are conducted above a physical layer of a communication network. Forward error correction is applied if the number of errors is equal to or less than an error threshold. Automatic repeat request techniques are applied if errors remain in the data decoding using the forward error correction or if an error correcting module reports a failure in the data. In an embodiment, the error threshold is two errors or less. In an embodiment, information is encoded in a data link layer using a forward error correction module providing a code rate of 0.98 or greater.

Abstract: A method and apparatus are provided for error correction of a communication signal. To allow for retransmission of information in response to error determination with respect to a transmission of the information, the operating sampling rate for a communication channel is increased over its normal sampling rate. At the increased operating rate, retransmissions may be made while at least maintaining the overall data rate of the communication channel with respect to its normal sampling rate. The retransmissions may be conducted using automatic repeat request (ARQ) techniques. In an embodiment, operating at increased sampling rate allows for a decrease in the required signal-to-noise ratio at a given bit error rate for the communication channel.

Abstract: A technique to perform fast decoding of a Reed-Solomon code. A first multiplier unit multiplies a matrix Bh with a column vector v using common adders to produce a column vector v1. The vector v represents one of an error locator polynomial, an error evaluator polynomial, and a derivative polynomial for a (n, k) Reed-Solomon code. The matrix Bh is over GF(2) including first h columns of a matrix B. A second multiplier unit multiplies non-unity components of a column vector A with non-zero components of the column vector v1 component-wise in GF(q) to produce a column vector v2, q being equal to n+1. A third multiplier unit multiplies diagonal sub-matrices of a matrix C with corresponding components of the column vector v2 in GF(2) to produce a column vector v3.

Abstract: A method and apparatus are provided for a coding process of a communication signal. A 3-stripes parity-check matrix is generated from a parity-check matrix of a Gilbert low density parity-check code, where the parity-check matrix of the Gilbert low density parity-check code has a first stripe containing identity matrices and a second stripe containing cyclic permutation matrices. A third stripe is added to form a 3-stripes parity-check matrix, which may be applied to the coding process of information in a communication channel.