Complexity of residue position-coded lookup table array processors

Residue position-coded lookup table processing is reviewed. Position-coded modulo m lookup tables with gate complexities equal to m(2), 2m, 4 radicalm, and factored m(2) are discussed. The complexity of a 2-D array processor is analytically calculated and a comparison made for all four types of lookup table. A preliminary analysis is presented that compares the complexities of the residue processor with that of its electronic digital counterpart.