Patents by Inventor Andrey P. Sokolov

Andrey P. Sokolov 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: 20120278648
    Abstract: An apparatus having a first memory and a circuit is disclosed. The first memory may be configured to store a plurality of timers. Each of the timers may have a respective value that indicates an expiration time. A first one of the timers nearest to expiring is generally stored at a first address of the first memory. The circuit may be configured to (i) assert a signal in response to the respective value of the first timer matching a counter of time, (ii) read a second of the timers and a third of the timers both from a second address of the first memory, (iii) sort the second timer and the third timer to determine which expires next and (iv) replace the first timer by writing one of the second timer or the third timer that expires next into the first memory at the first address.
    Type: Application
    Filed: October 27, 2011
    Publication date: November 1, 2012
    Inventors: Elyar E. Gasanov, Ilya V. Neznanov, Yurii S. Shutkin, Andrey P. Sokolov, Pavel A. Panteleev
  • Publication number: 20120166501
    Abstract: An apparatus generally having a first circuit, a second circuit and a third circuit is disclosed. The first circuit may be configured to generate a plurality of first signals carrying (i) a maximum value among a plurality of input values and (ii) a plurality of difference values based on the input values. The second circuit may be configured to generate a plurality of second signals carrying a plurality of intermediate values based on the difference values. The intermediate values are generally respective powers of two. The third circuit may be configured to generate a third signal carrying an output value by adding the maximum value and the intermediate values. The output value may be a Jacobian logarithm computation of the input values.
    Type: Application
    Filed: August 3, 2011
    Publication date: June 28, 2012
    Inventors: Andrey P. Sokolov, Sergey B. Gashkov, Elyar E. Gasanov, Pavel A. Panteleev, Ilya V. Neznanov
  • Publication number: 20120144274
    Abstract: A method for forward error correction decoding is disclosed. The method generally includes steps (A) to (D). Step (A) may calculate a plurality of metrics of a codeword using a forward error correction process on a trellis having a plurality of stages. Step (B) may update the metrics over each of the stages. Step (C) may permute the metrics in each of the stages. Step (D) may generate a signal carrying a plurality of decoded bits of the codeword.
    Type: Application
    Filed: June 13, 2011
    Publication date: June 7, 2012
    Inventors: Elyar E. Gasanov, Pavel A. Panteleev, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
  • Publication number: 20120137190
    Abstract: An apparatus generally including a first circuit and a second circuit is disclosed. The first circuit may be configured to (i) receive a configuration signal that identifies a current one of a plurality of communications standards and (ii) generate a plurality of matrix elements based on the configuration signal. The second circuit may include a plurality of matrixes. The second circuit may be configured to (i) fill the matrixes with the matrix elements and (ii) generate an encoded signal by forward error correction encoding an input signal using the matrixes. The encoded signal generally complies with the current communications standard.
    Type: Application
    Filed: May 26, 2011
    Publication date: May 31, 2012
    Inventors: Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
  • Publication number: 20120134325
    Abstract: A method for branch metric calculation in a plurality of communications standards is disclosed. The method generally includes steps (A) to (C). Step (A) may calculate a plurality of sum values by adding a plurality of first values related to a plurality of information bits, a plurality of second values related to the information bits and a plurality of third values related to a plurality of parity bits. Step (B) may generate a plurality of permutated values by permutating the sum values based on a configuration signal. The configuration signal generally identifies a current one of the communications standards. Step (C) may generate a plurality of branch metrics values by adding pairs of the permutated values.
    Type: Application
    Filed: June 9, 2011
    Publication date: May 31, 2012
    Inventors: Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
  • Publication number: 20120128102
    Abstract: An apparatus having a first circuit, a second circuit and a third circuit is disclosed. The first circuit may be configured to generate a plurality of load values corresponding to a trellis of a decoding process. The second circuit generally includes a plurality of calculation layers. The calculation layers may be configured to generate a plurality of maximum values in response to the load values. The third circuit may be configured to generate a plurality of L-values of the decoding process in response to the maximum values.
    Type: Application
    Filed: May 25, 2011
    Publication date: May 24, 2012
    Inventors: Andrey P. Sokolov, Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Yurii S. Shutkin
  • Publication number: 20120117359
    Abstract: An apparatus generally including a memory and a circuit is disclosed. The memory may be configured to store a plurality of instructions. Each of the instructions generally includes a corresponding command and a corresponding command repeat count. At least one of the instructions may include a subprocedure call. The circuit may be configured to (i) decode the instructions one at a time and (ii) present a sequence of the commands at an interface. The sequence (i) may be based on the decoding and (ii) may have no delays between consecutive the commands at the interface.
    Type: Application
    Filed: May 12, 2011
    Publication date: May 10, 2012
    Inventors: Yurii S. Shutkin, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Pavel A. Panteleev
  • Publication number: 20120054586
    Abstract: An apparatus generally having a port, a first circuit and a second circuit is disclosed. The port may be configured to receive a current length of a codeword. The current length may be less than a maximum length of the codeword that the apparatus is designed to decode. The first circuit may be configured to calculate in parallel (i) a sequence of intermediate syndromes from the codeword and (ii) a sequence of correction values based on the current length. The second circuit may be configured to generate a particular number of updated syndromes by modifying the intermediate syndromes with the correction values. The particular number is generally twice a maximum error limit of the codeword.
    Type: Application
    Filed: March 10, 2011
    Publication date: March 1, 2012
    Inventors: Pavel A. Panteleev, Elyar E. Gasanov, Ilya V. Neznanov, Andrey P. Sokolov, Yurii S. Shutkin
  • Publication number: 20110239079
    Abstract: A circuit having a first circuit and a memory is disclosed. The first circuit may be configured to (i) receive a control signal that identifies a current one of a plurality of wireless communication standards and a code word size and (ii) generate a plurality of tables corresponding to both the current wireless communication standard and the code word size. Each of the tables generally has a plurality of indices. Up to two of the indices may be generated by the first circuit per clock cycle. Each of the tables generally comprises a permutation table of a turbo code interleaver. The memory may be configured to store the tables.
    Type: Application
    Filed: September 30, 2010
    Publication date: September 29, 2011
    Inventors: Andrey P. Sokolov, Elyar E. Gasanov, Ilya V. Neznanov, Pavel A. Aliseychik, Pavel A. Panteleev
  • Publication number: 20100299580
    Abstract: An apparatus generally having a first circuit, a second circuit and a third circuit is disclosed. The first circuit may be configured to calculate a plurality of preliminary syndromes from a plurality of received symbols. The second circuit may be configured to calculate a plurality of normal syndromes by modifying the preliminary syndromes using at most two Galois Field multiplications. The third circuit is generally configured to calculate an errata polynomial based on the normal syndromes.
    Type: Application
    Filed: November 24, 2009
    Publication date: November 25, 2010
    Inventors: Ilya V. Neznanov, Elyar E. Gasanov, Pavel A. Panteleev, Pavel A. Aliseychik, Andrey P. Sokolov
  • Publication number: 20100281344
    Abstract: An apparatus having a first circuit and a second circuit is disclosed. The first circuit may (i) generate a decoded codeword by decoding a first codeword a plurality of times based on a respective plurality of erasure location vectors and (ii) assert a fail signal upon each failure of the decoding of the first codeword, the decoding comprising an error-and-erasure Reed-Solomon decoding. The second circuit may (i) generate a count of the assertions of the fail signal and (ii) generate the erasure location vectors based on (a) the count and (b) a plurality of reliability items corresponding to the first codeword.
    Type: Application
    Filed: November 4, 2009
    Publication date: November 4, 2010
    Inventors: Elyar E. Gasanov, Andrey P. Sokolov, Pavel A. Panteleev, Ilya V. Neznanov, Pavel A. Aliseychik