Abstract: A method of searching for candidate codewords for a telecommunications system, the method comprising receiving a sequence of constellation points, producing a received FEC vector comprised of bits from the received constellation points, comparing the received FEC vector with a plurality of candidate codewords within a Dorsch decoding process using an ordered pattern, and terminating the search when a candidate codeword from among the plurality of candidate codewords is found residing within a predetermined range of a specified distance of the received FEC vector.

Abstract: A method of searching for candidate codewords for a telecommunications system, the method comprising receiving a sequence of constellation points, producing a received FEC vector comprised of bits from the received constellation points, comparing the received FEC vector with a plurality of candidate codewords within a Dorsch decoding process using an ordered pattern, and terminating the search when a candidate codeword from among the plurality of candidate codewords is found residing within a predetermined range of a specified distance of the received FEC vector.

Abstract: Methods of transmitting and recovering data traversing a telecommunication channel. Implementations may include forming a first frame of a plurality of frames using a frame module where the first frame includes a first control codeword including information relating to a first format used for a first data payload included in the first frame and where the first control codeword is selected from a non-linear block code and has a first distance spectrum. The method may include forming a second frame of the plurality of frames using the frame module where the second frame includes a second control codeword selected from the non-linear block code and has a second distance spectrum where the second distance spectrum is different from the first distance spectrum. The method may also include transmitting the plurality of frames into a telecommunication channel using a frame transmission module.

Abstract: A method for assigning codes to Huffman trees and repairing invalid Huffman trees is disclosed using a calculated delta and moving nodes within the Huffman tree by adjusting their encode register entries.

Abstract: A data compression system comprising a transmit side having a first receive interface adapted to receive a first quantity of data from a first channel and a compression controller coupled to the first receive interface, a lossless compression controller, and a bandwidth monitor, the lossy compression controller and the bandwidth monitor coupled to a first transmit interface adapted to transmit a compressed first quantity of data into a second telecommunication channel wherein the bandwidth monitor evaluates the bandwidth of the second telecommunication channel and communicates with the compression controller.

Abstract: A method of searching for candidate codewords for a telecommunications system may comprise receiving a constellation point, comparing the received point with points within a Dorsch decoding process using an optimal pattern, and terminating the search when a codeword is found residing within a specified distance of the received point.

Abstract: A method of searching for candidate codewords for a telecommunications system, the method comprising receiving a sequence of constellation points, producing a received FEC vector comprised of bits from the received constellation points, comparing the received FEC vector with a plurality of candidate codewords within a Dorsch decoding process using an ordered pattern, and terminating the search when a candidate codeword from among the plurality of candidate codewords is found residing within a predetermined range of a specified distance of the received FEC vector.

Abstract: A telecommunication system and related methods. Implementations may include implementations of a method of encoding data for transmission, including forming a frame by encoding a message block using a short-block low density parity check (LDPC) code and an encoder to form a short encoded block, modulating the short encoded block using a modulation format and a modulator to form a modulated short encoded block, including the modulated short encoded block in a data payload of the frame, and transmitting the frame into a telecommunication channel with a transmitter. The frame may be one of a plurality of frames and each modulated short encoded block in each of the plurality of frames may have a constant number of symbols. The frame may include a modulation/code pair (ModCod) including information relating to the modulation format and the short-block LDPC code used for encoding and modulation.

Abstract: The current invention involves a forward error detection system, especially for use with Low Density Parity Check codes. A parallel SISO structure allows the decoder to process multiple parity equations at the same time. There is a new SISO decoder which allows for the updating of the Log-likelihood-ratio's in a single operation, as opposed to the two pass traditionally associated with the Tanner Graph's. In the decoder, there is a mapping structure that correctly aligns the stored estimates, the stored differences and the SISO's. There is also the ability to deal with multiple instances of the same data being processed at the same time. This structure manages the updates and the differences in such a manner that all calculations on a single piece of data that are processed in parallel are incorporated correctly in the new updated estimates.

Abstract: The current invention involves a forward error detection system, especially for use with Low Density Parity Check codes. A parallel SISO structure allows the decoder to process multiple parity equations at the same time. There is a new SISO decoder which allows for the updating of the Log-likelihood-ratio's in a single operation, as opposed to the two pass traditionally associated with the Tanner Graph's. In the decoder, there is a mapping structure that correctly aligns the stored estimates, the stored differences and the SISO's. There is also the ability to deal with multiple instances of the same data being processed at the same time. This structure manages the updates and the differences in such a manner that all calculations on a single piece of data that are processed in parallel are incorporated correctly in the new updated estimates.