发明名称 Method and apparatus for efficient programmable cyclic redundancy check (CRC)
摘要 A method and apparatus to optimize each of the plurality of reduction stages in a Cyclic Redundancy Check (CRC) circuit to produce a residue for a block of data decreases area used to perform the reduction while maintaining the same delay through the plurality of stages of the reduction logic. A hybrid mix of Karatsuba algorithm, classical multiplications and serial division in various stages in the CRC reduction circuit results in about a twenty percent reduction in area on the average with no decrease in critical path delay.
申请公布号 US9052985(B2) 申请公布日期 2015.06.09
申请号 US200711963147 申请日期 2007.12.21
申请人 Intel Corporation 发明人 Gopal Vinodh;Ozturk Erdinc;Wolrich Gilbert M.;Feghali Wajdi K.
分类号 G06F7/72;H03M13/09 主分类号 G06F7/72
代理机构 Lowenstein Sandler LLP 代理人 Lowenstein Sandler LLP
主权项 1. An apparatus comprising: a plurality of reduction stages, each one of the plurality of the reduction stages to compute a product of a first operand with a first size and a second operand with a second size, wherein the first size and the second size are different sizes; wherein the first size of the first operand corresponds to one of the plurality of reduction stages; wherein each reduction state uses a multiplication algorithm in view of the size of the first operand; wherein when the first size of the first operand is less than or equal to a first threshold size, then the multiplication algorithm used to compute the product of the first operand and the second operand is a classical multiplication technique; wherein when the first size of the first operand is greater than the first threshold size, then the multiplication algorithm used to compute the product of the first operand and the second operand is a one level application of a Karatsuba (KA) multiplication technique or a two level application of the KA multiplication technique; and wherein the first threshold value is four bits.
地址 Santa Clara CA US