Patents Assigned to Efficient Channel Coding, Inc.
  • Patent number: 7054391
    Abstract: A processor-implemented method of estimating the saturation level of a transmitter from a transmitted communication signal received from the transmitter comprises generating a received data signal from the transmitted communication signal received from the transmitter, generating a transmitted data signal from the received data signal that corresponds to the actual data signal generated at the transmitter, comparing the transmitted data signal to the received data signal, and estimating the saturation level of the transmitter based on the comparison of the transmitted data signal to the received data signal.
    Type: Grant
    Filed: May 28, 2004
    Date of Patent: May 30, 2006
    Assignee: Efficient Channel Coding, Inc.
    Inventor: William H. Thesling
  • Publication number: 20020162072
    Abstract: Architecture for enhancing the encoding/decoding of information of a channel. A stream of incoming information bits are arranged into a first array of information bits. The first array of information bits are processed into a first code of bits, which bits form a plurality of first code words having a minimum distance to neighboring error events. Selected bits of the first code are rearranged into a second array of bits by intermittent successive rotations of the selected bits of the first code. A second code is then generated from the second array of bits to increase the minimum distance to the neighboring error events.
    Type: Application
    Filed: March 27, 2002
    Publication date: October 31, 2002
    Applicant: Efficient Channel Coding, Inc.
    Inventor: William H. Thesling
  • Publication number: 20020124223
    Abstract: A method of turbo decoding using soft input-soft output information. A vector of data is sampled from a channel of data. The vector of data is then processed to output a final code word of bits. A final reliability vector of reliability values associated with the final code word is generated, such that each bit of the final code word of bits has a corresponding reliability value in the final reliability vector. Corresponding reliability values for one or more bit positions of the final code word are determined by a difference of distance metrics, and corresponding reliability values for one or more bit positions of the final code word are determined utilizing a numerical approximation.
    Type: Application
    Filed: September 11, 2001
    Publication date: September 5, 2002
    Applicant: Efficient Channel Coding, Inc.
    Inventors: William H. Thesling, Sameep Dave
  • Publication number: 20020118737
    Abstract: Architecture for processing a record of burst information in a transmission link. A waveform sampler samples a received waveform containing a record of symbols imposed on a carrier signal. Symbol phase of the record symbols is determined utilizing one or more metrics. Any residual carrier error is corrected, and the carrier signal is removed. The phase and time-of-arrival of the burst information associated with a maximum positive correlation value are then determined.
    Type: Application
    Filed: August 21, 2001
    Publication date: August 29, 2002
    Applicant: Efficient Channel Coding, Inc.
    Inventors: William H. Thesling, Mark Vanderaar
  • Patent number: 5930272
    Abstract: A method for decoding a linear block code of information bits transmitted across a signal channel, comprising the steps of:a) receiving the transmitted signals from the channel and converting the received signals into a number of received vectors r with each received vector having a length of n; and for each vector r,b) performing hard decisions on r to produce a hard decision data vector b and a corresponding reliability information vector a and performing hard decision decoding on b to produce an error pattern e, and further converting each vector b into a center code word; the vector a and the center code word each having a length n;c) identifying a set of j=0 to p nearby code words including the center code word;d) determining, for each nearby code word a difference metric DM.sub.j, wherein each difference metric DM.sub.j is defined by the following relationship:DM.sub.j =.SIGMA..delta..sub.j (I).alpha.(I) for I=0 to nwhere .delta..sub.j .epsilon.(0, 1) is the Hamming difference between b and the j.sup.
    Type: Grant
    Filed: June 10, 1997
    Date of Patent: July 27, 1999
    Assignee: Efficient Channel Coding, Inc.
    Inventor: William H. Thesling