Patents by Inventor Sergey Afonin

Sergey Afonin 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).

  • Impulse regular expression matching
    Patent number: 9177251
    Abstract: Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied.
    Type: Grant
    Filed: January 16, 2014
    Date of Patent: November 3, 2015
    Assignee: Intel Corporation
    Inventors: Alexander Podkolzin, Lav Ivanovic, Anatoli Bolotov, Mikhail Grinchuk, Sergey Afonin
  • Majority-tabular post processing of quasi-cyclic low-density parity-check codes
    Patent number: 8977939
    Abstract: A method for finding a valid codeword based on a near codeword trapping in a low-density parity-check decoding process includes identifying trapping set configurations and applying corrections to produce trapping sets with a limited number of invalid checks. Trapping set configurations are corrected in order to produce a trapping set in a table of trapping sets, the table associating each corrected trapping set with a valid codeword.
    Type: Grant
    Filed: December 21, 2012
    Date of Patent: March 10, 2015
    Assignee: LSI Corporation
    Inventors: Alexander S. Podkolzin, Shaohua Yang, Lav D. Ivanovic, Sergey Afonin
  • Majority-Tabular Post Processing of Quasi-Cyclic Low-Density Parity-Check Codes
    Publication number: 20140181624
    Abstract: A method for finding a valid codeword based on a near codeword trapping in a low-density parity-check decoding process includes identifying trapping set configurations and applying corrections to produce trapping sets with a limited number of invalid checks. Trapping set configurations are corrected in order to produce a trapping set in a table of trapping sets, the table associating each corrected trapping set with a valid codeword.
    Type: Application
    Filed: December 21, 2012
    Publication date: June 26, 2014
    Applicant: LSI CORPORATION
    Inventors: Alexander S. Podkolzin, Shaohua Yang, Lav D. Ivanovic, Sergey Afonin
  • IMPULSE REGULAR EXPRESSION MATCHING
    Publication number: 20140136465
    Abstract: Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied.
    Type: Application
    Filed: January 16, 2014
    Publication date: May 15, 2014
    Applicant: LSI CORPORATION
    Inventors: Alexander Podkolzin, Lav Ivanovic, Anatoli Bolotov, Mikhail Grinchuk, Sergey Afonin
  • Impulse regular expression matching
    Patent number: 8650146
    Abstract: Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied.
    Type: Grant
    Filed: June 24, 2010
    Date of Patent: February 11, 2014
    Assignee: LSI Corporation
    Inventors: Alexander Podkolzin, Lav Ivanovic, Anatoli Bolotov, Mikhail Grinchuk, Sergey Afonin
  • IMPULSE REGULAR EXPRESSION MATCHING
    Publication number: 20110320397
    Abstract: Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied.
    Type: Application
    Filed: June 24, 2010
    Publication date: December 29, 2011
    Inventors: Alexander Podkolzin, Lav Ivanovic, Anatoli Bolotov, Mikhail Grinchuk, Sergey Afonin