Hierarchical prefetch for semiconductor memories

Static information storage and retrieval – Addressing – Sync/clocking

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

365220, 365221, G11C 800

Patent

active

060814799

ABSTRACT:
A semiconductor memory in accordance with the present invention includes a data path including a plurality of hierarchical stages, each stage including a bit data rate which is different from the other stages. At least two prefetch circuits are disposed between the stages. The at least two prefetch circuits include at least two latches for receiving data bits and storing the data bits until a next stage in the hierarchy is capable of receiving the data bits. The at least two prefetch circuits are coupled between stages such that an overall data rate per stage between stages are substantially equal. Control signals control the at least two latches such that prefetch circuits maintain the overall data rate between the stages.

REFERENCES:
patent: 4933846 (1990-06-01), Humphrey et al.
patent: 5291580 (1994-03-01), Bowden, III et al.
patent: 5471591 (1995-11-01), Edmondson et al.
patent: 5663924 (1997-09-01), Barth, Jr. et al.
patent: 5768212 (1998-06-01), Fujita
patent: 5802005 (1998-09-01), Nakamura et al.
patent: 5812473 (1998-09-01), Tsai
patent: 5835443 (1990-06-01), Fujita
patent: 5923595 (1999-07-01), Kim

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Hierarchical prefetch for semiconductor memories does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Hierarchical prefetch for semiconductor memories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical prefetch for semiconductor memories will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1789835

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.