Assumptions (cont.)
Gate count assumptions:
- 1 full adder equals ADDF gates (ADDF is spreadsheet parameter)
- Technology dependent, typical value might be 2 to 6.
- For Color Component additions, can use ripple carry adders.
- N bit add => ADDF* N gates (linear cost)
- For additions on X,Y, or Z, use accelerated additions
- N bit add => ADDF * N*LOG2(N) ( N Log N cost)
- N x M multiply (keeping MSB N bits) costs MULTF*N*M gates (square cost)
- N bit comparison (eq, lt, gt)
- COMPF*N gates (linear cost for color components)
- COMPF*N * LOG2(N) gates (NlogN cost for X,Y,Z calculations)
- N bit pipeline register = REGF*N gates
- N bit raster op => ROPF*N gates (linear cost)