Abstract
Residue position-coded lookup table processing is reviewed. Position-coded modulo m lookup tables with gate complexities equal to m2, 2m, 4√m, and factored m2 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.
© 1987 Optical Society of America
Full Article | PDF ArticleMore Like This
A. P. Goutzoulis, E. C. Malarkey, D. K. Davies, J. C. Bradley, and P. R. Beaudet
Appl. Opt. 27(9) 1674-1681 (1988)
Kwon-Yeon Lee, Young-Ju Kim, and Han-Kyu Park
Appl. Opt. 32(20) 3684-3689 (1993)
Akis P. Goutzoulis
Appl. Opt. 28(19) 4167-4175 (1989)