Patents by Inventor Yi-Chen Li

Yi-Chen Li has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20070266302
    Abstract: In the method of rate-matching, software is used to calculate at least one rate-matching parameter for data, and dedicated hardware is used to perform at least one of a puncturing and repetition process on data based on the calculated rate-matching parameter. In rate de-matching, software is again used to calculate at least one rate de-matching parameter for received data, and dedicated hardware is used to compensate for puncturing and repetition based on the calculated rate de-matching parameter.
    Type: Application
    Filed: July 19, 2007
    Publication date: November 15, 2007
    Inventors: Mark Barry, Yi-Chen Li, Oliver Ridler
  • Publication number: 20060242476
    Abstract: An interleaver address generator is provided with pruning avoidance technology. It anticipates the points in time when incorrect addresses are computed by an IAG, and bypasses these events. It produces a stream of valid, contiguous addresses for all specified code block sizes. A single address computation engine firstly ‘trains’ itself about violating generated addresses (for a related block size) during the initial H1 half-iteration of decoder operation, and then produces a continuous, correct stream of addresses as required by the turbo decoder. Thus regions of pruned addresses are determined, and then training is performed only in these regions. Thus, computation and population of a pruned event table is determined in less than 1/10 the time required to do a conventional style full training. The resulting pruned event table is compressed down to 256 bits.
    Type: Application
    Filed: April 12, 2005
    Publication date: October 26, 2006
    Inventors: Mark Bickerstaff, Yi-Chen Li, Chris Nicol, Bejamin Widdup
  • Publication number: 20040213183
    Abstract: In a communication method, data from a plurality of channels is combined into a composite channel by writing data from the plurality of channels as one-bit symbols to a memory, and reading out the data from memory to form the composite channel. The combining of radio frames from the channels forms a coded composite transport channel for transmitting the data in the downlink. To form the coded composite transport channel, an input process is initiated to write data for each radio frame of a transport channel as one bit symbols to a memory of an interleaver. On an output side of the interleaver, an output process to read out the data stored in the memory is performed to form the coded composite transport channel.
    Type: Application
    Filed: April 25, 2003
    Publication date: October 28, 2004
    Inventors: Mark Barry, Hettiachchi Upul Gunawardana, Yi-Chen Li, Koen van den Beld