IMPULSE REGULAR EXPRESSION MATCHING
    1.
    发明申请
    IMPULSE REGULAR EXPRESSION MATCHING 有权
    冲突正则表达式匹配

    公开(公告)号:US20140136465A1

    公开(公告)日:2014-05-15

    申请号:US14156648

    申请日:2014-01-16

    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.

    Abstract translation: 公开了一种用于匹配正则表达式的方法和装置。 维持每个符号的最后出现位置数的符号缓冲器。 当两个常数在正则表达式运算符的任一侧匹配时,查询符号缓冲区以确定正则表达式运算符的补码的成员是否在两个常量之间发生。 如果是这样,那么操作员不满意。 如果没有,那么操作员就满意了。

    Majority-tabular post processing of quasi-cyclic low-density parity-check codes
    2.
    发明授权
    Majority-tabular post processing of quasi-cyclic low-density parity-check codes 有权
    准循环低密度奇偶校验码的大多数表格后处理

    公开(公告)号:US08977939B2

    公开(公告)日:2015-03-10

    申请号:US13723357

    申请日:2012-12-21

    CPC classification number: H03M13/1142

    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.

    Abstract translation: 基于在低密度奇偶校验解码过程中捕获的近码字来找到有效码字的方法包括识别陷印集合配置和应用校正以产生具有有限数量的无效检查的陷印集合。 修正陷阱集合配置以便在陷阱集合表中产生陷阱集合,该表将每个校正的捕获集合与有效码字相关联。

    Majority-Tabular Post Processing of Quasi-Cyclic Low-Density Parity-Check Codes
    3.
    发明申请
    Majority-Tabular Post Processing of Quasi-Cyclic Low-Density Parity-Check Codes 有权
    准循环低密度奇偶校验码的大多数表格后处理

    公开(公告)号:US20140181624A1

    公开(公告)日:2014-06-26

    申请号:US13723357

    申请日:2012-12-21

    CPC classification number: H03M13/1142

    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.

    Abstract translation: 基于在低密度奇偶校验解码过程中捕获的近码字来找到有效码字的方法包括识别陷印集合配置和应用校正以产生具有有限数量的无效检查的陷印集合。 修正陷阱集合配置以便在陷阱集合表中产生陷阱集合,该表将每个校正的捕获集合与有效码字相关联。

Patent Agency Ranking