Lsi Corporation

Intel Corporation

Sergey Afonin

Alexander S Podkolzin

Lav D Ivanovic

Anatoli Aleksandrovich Bolotov

Mikhail I Grinchuk

Shaohua Yang

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.

Impulse regular expression matching

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.

Majority-tabular post processing of quasi-cyclic low-density parity-check codes

Growing community of inventors

Moscow, Russia

Sergey Afonin