Performance Evaluation of a Novel Direct Table Lookup Method and Architecture with Application to 16-bit Integer Functions
IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06) (2006)
Steamboat Springs, Colorado, USA
Sept. 11, 2006 to Sept. 13, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.2006.52
L. Li , Southern Methodist University
Alex Fit-Florea , Southern Methodist University
M. A. Thornton , Southern Methodist University
D. W. Matula , Southern Methodist University
We describe several integer function properties which in combination allow direct lookup tables to be reduced in size and structure to simpler lookup trees. Our principal result is a novel table lookup method based on a mapping of a lookup tree to a row-by-column ROM with pre and post processing logic substantially reducing the table size. Our lookup architecture allows common 16-bit integer functions such as multiplicative inverse, square, and the discrete log to be realized with table size of order 2-8 Kbytes, in comparison to the 128 Kbyte size of an arbitrary 16-bits-in 16-bits-out function table. The lookup methodology is illustrated with specific development of the 16-bit integer discrete-log function. Implementation for both unnormalized and normalized indices are synthesized into standard cell netlists and performance and area results are given that demonstrate their effectiveness.
D. W. Matula, A. Fit-Florea, L. Li and M. A. Thornton, "Performance Evaluation of a Novel Direct Table Lookup Method and Architecture with Application to 16-bit Integer Functions," IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)(ASAP), Steamboat Springs, Colorado, USA, 2006, pp. 99-104.