Pre-computing for Speed

• Some functions are too complex for 10-ns logic implementation

  • pipelining is not always possible

• An alternative is to pre-compute all the possible results and store them in memory

  • select a result according to the inputs

• Function time is independent of complexity

  • 0.6 ns SelectRAM+ access time
  • 3.3 ns Block SelectRAM+ access time

• The function table can be smaller than the logic

이전 슬라이드

다음 슬라이드

첫 슬라이드로 이동

그래픽 버전 보기