Comtech Ef Data Corporation

Comtech Aha Corporation

Comtect Ef Data Corp.

Patrick Owsley

Brian A Banister

Jason Franklin

Tom Hansen

Seth Sjoholm

Nathan Hungerford

Ed Coulter

Sean Michael Collison

Sean M Collison

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.

Method of identifying a correct decoding codeward

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.

Telecommunication block code

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.

Assigning codes to and repairing Huffman trees

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. A decimation controller is adapted to lossy compress a portion of a second data quantity in the first telecommunication channel in response to a lossy compression control signal communicated by the compression controller to form a reduced second data quantity if the compression controller determines, that the bandwidth second transmission channel is insufficient to carry the first data quantity when compressed.

Data compression system and related methods

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.

Encoding and decoding systems and related methods

A method and system for detecting matching strings in a string of characters utilizing content addressable memory using primary and secondary matches is disclosed.

Content-addressable memories and state machines for performing three-byte matches and secondary matches, and for providing error protection

A method and system for detecting matching strings in a string of characters utilizing content addressable memory is disclosed.

Content-addressable memories and state machines for performing three-byte matches and for providing error protection

A method and system for decompressing dynamic Huffman coded bit streams is disclosed.

Decompressing dynamic huffman coded bit streams

Huffman trees may be rapidly and effectively created by sorting a plurality of nodes by weight in an insertion sorter stack, popping the two lowest weighted nodes from the insertion sorter stack, forming a branch node from the popped entries, and placing the branch node into the insertion sorter.

Generating dynamic huffman codes

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.

SISO decoder

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-ratios in a single operation, as opposed to the two pass traditionally associated with the Tanner Graphs. In the decoder, there is a mapping structure that correctly aligns the stored estimates, the stored differences and the SISOs. 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.

Growing community of inventors

Moscow, ID, United States of America

Patrick Owsley