摘要 |
A combination of an infrequently-called tiny multiplication unit and a "differential" unit that quickly computes T <img id="CUSTOM-CHARACTER-00001" he="2.12mm" wi="2.12mm" file="US20080270505A1-20081030-P00001.TIF" img-content="character" img-format="tif"/> (n+1) basing on known T <img id="CUSTOM-CHARACTER-00002" he="2.12mm" wi="2.12mm" file="US20080270505A1-20081030-P00001.TIF" img-content="character" img-format="tif"/> n. The schedule (how often the multiplication unit is called) can be considered as a parameter of the algorithm. The proposed architecture of the "differential" unit is efficient both in terms of speed (delay) and area (gate count).
|