Loading [a11y]/accessibility-menu.js
Binary Access Memory: An optimized lookup table for successive approximation applications | IEEE Conference Publication | IEEE Xplore

Binary Access Memory: An optimized lookup table for successive approximation applications


Abstract:

An optimized memory structure, Binary Access Memory (BAM), is presented for successive approximation applications that employ an error correction lookup table. Unlike tru...Show More

Abstract:

An optimized memory structure, Binary Access Memory (BAM), is presented for successive approximation applications that employ an error correction lookup table. Unlike true random-access memory, the probability of different codes occurring in a binary successive approximation access pattern is not uniformly distributed. BAM exploits this fact in several ways to reduce the number of sub-block switches, the average and worst-case access latency, and power consumption compared to a conventional SRAM lookup table. A simple technique for using BAM in an asynchronous successive approximation design is also presented.
Date of Conference: 15-18 May 2011
Date Added to IEEE Xplore: 04 July 2011
ISBN Information:

ISSN Information:

Conference Location: Rio de Janeiro, Brazil

References

References is not available for this document.