System and method for an asynchronous data buffer having buffer write and read pointers

Abstract
A system and method for facilitating the adjustment of timing parameters between a memory controller operating in a first clock domain and a memory device operating in a second clock domain. A write pointer and a read pointer are monitored to provide a write-read pointer offset representing the timing between when read data is made available by the memory device and when the read data is retrieved by the memory controller. Based on the write-read pointer offset, adjustment to different timing parameters can be made.
Description
TECHNICAL FIELD

The present invention is related generally to a memory system for a processor-based system, and more particularly, to synchronizing the coupling of read data across different clock domains and providing information related to the timing margin in crossing the different clock domains.


BACKGROUND OF THE INVENTION

Computer systems use memory devices, such as dynamic random access memory (“DRAM”) devices, to store data that are accessed by a processor. These memory devices are normally used as system memory in a computer system. In a typical computer system, the processor communicates with the system memory through a processor bus and a memory controller. The memory devices of the system memory, typically arranged in memory modules having multiple memory devices, are coupled through a memory bus to the memory controller. The processor issues a memory request, which includes a memory command, such as a read command, and an address designating the location from which data or instructions are to be read. The memory controller uses the command and address to generate appropriate command signals as well as row and column addresses, which are applied to the system memory through the memory bus. In response to the commands and addresses, data are transferred between the system memory and the processor. The memory controller is often part of a system controller, which also includes bus bridge circuitry for coupling the processor bus to an expansion bus, such as a PCI bus.


In memory systems, high data bandwidth is desirable. Generally, bandwidth limitations are not related to the memory controllers since the memory controllers sequence data to and from the system memory as fast as the memory devices allow. One approach that has been taken to increase bandwidth is to increase the speed of the memory data bus coupling the memory controller to the memory devices. Thus, the same amount of information can be moved over the memory data bus in less time. However, despite increasing memory data bus speeds, a corresponding increase in bandwidth does not result. One reason for the non-linear relationship between data bus speed and bandwidth is the hardware limitations within the memory devices themselves. That is, the memory controller has to schedule all memory commands to the memory devices such that the hardware limitations are honored. Although these hardware limitations can be reduced to some degree through the design of the memory device, a compromise must be made because reducing the hardware limitations typically adds cost, power, and/or size to the memory devices, all of which are undesirable alternatives. Thus, given these constraints, although it is easy for memory devices to move “well-behaved” traffic at ever increasing rates, for example, sequel traffic to the same page of a memory device, it is much more difficult for the memory devices to resolve “badly-behaved traffic,” such as bouncing between different pages or banks of the memory device. As a result, the increase in memory data bus bandwidth does not always yield a corresponding increase in information bandwidth.


In addition to the limited bandwidth between processors and memory devices, the performance of computer systems is also limited by latency problems that increase the time required to read data from system memory devices. More specifically, when a memory device read command is coupled to a system memory device, such as a synchronous DRAM (“SDRAM”) device, the read data are output from the SDRAM device only after a delay of several clock periods. Therefore, although SDRAM devices can synchronously output burst data at a high data rate, the delay in initially providing the data can significantly slow the operating speed of a computer system using such SDRAM devices. Increasing the memory data bus speed can be used to help alleviate the latency issue. However, as with bandwidth, the increase in memory data bus speeds do not yield a linear reduction of latency, for essentially the same reasons previously discussed.


Although increasing memory data bus speed has, to some degree, been successful in increasing bandwidth and reducing latency, other issues are raised by this approach. For example, as the speed of the memory data bus increases, loading on the memory bus needs to be decreased in order to maintain signal integrity since traditionally, there has only been wire between the memory controller and the memory slots into which the memory modules are plugged. Several approaches have been taken to address the memory bus loading issue. For example, reducing the number of memory slots to limit the number of memory modules that contribute to the loading of the memory bus, adding buffer circuits on a memory module in order to provide sufficient fanout of control signals to the memory devices on the memory module, and providing multiple memory device interfaces on the memory module since there are too few memory module connectors on a single memory device interface. The effectiveness of these conventional approaches are, however, limited. A reason why these techniques were used in the past is that it was cost-effective to do so. However, when only one memory module can be plugged in per interface, it becomes too costly to add a separate memory interface for each memory slot. In other words, it pushes the system controllers package out of the commodity range and into the boutique range, thereby, greatly adding cost.


One recent approach that allows for increased memory data bus speed in a cost effective manner is the use of multiple memory devices coupled to the processor through a memory hub. A computer system 100 shown in FIG. 1 uses a memory hub architecture. The computer system 100 includes a processor 104 for performing various computing functions, such as executing specific software to perform specific calculations or tasks. The processor 104 includes a processor bus 106 that normally includes an address bus, a control bus, and a data bus. The processor bus 106 is typically coupled to cache memory 108, which, is typically static random access memory (“SRAM”). Finally, the processor bus 106 is coupled to a system controller 110, which is also sometimes referred to as a bus bridge. The system controller 110 serves as a communications path to the processor 104 for a variety of other components. For example, as shown in FIG. 1, the system controller 110 includes a graphics port that is typically coupled to a graphics controller 112, which is, in turn, coupled to a video terminal 114. The system controller 110 is also coupled to one or more input devices 118, such as a keyboard or a mouse, to allow an operator to interface with the computer system 100. Typically, the computer system 100 also includes one or more output devices 120, such as a printer, coupled to the processor 104 through the system controller 110. One or more data storage devices 124 are also typically coupled to the processor 104 through the system controller 110 to allow the processor 104 to store data or retrieve data from internal or external storage media (not shown). Examples of typical storage devices 124 include hard and floppy disks, tape cassettes, and compact disk read-only memories (CD-ROMs).


The system controller 110 includes a memory hub controller 128 that is coupled to the processor 104. The system controller 110 is further coupled over a high speed bi-directional or unidirectional system controller/hub interface 134 to several memory modules 130a-n. As shown in FIG. 1, the controller/hub interface 134 includes a downstream bus 154 and an upstream bus 156 which are used to couple data, address, and/or control signals away from or toward, respectively, the memory hub controller 128. Typically, the memory modules 130a-n are coupled in a point-to-point or daisy chain architecture such that the memory modules 130a-n are connected one to another in series. Thus, the system controller 110 is coupled to a first memory module 130a, with the first memory module 130a connected to a second memory module 130b, and the second memory module 130b coupled to a third memory module 130c, and so on in a daisy chain fashion. Each memory module 130a-n includes a memory hub 140 that is coupled to the system controller/hub interface 134, and is further coupled a number of memory devices 148 through command, address and data buses, collectively shown as local memory bus 150. The memory hub 140 efficiently routes memory requests and responses between the memory hub controller 128 and the memory devices 148.


The memory devices 148 on the memory modules 130a-n are typically capable of operating at high clock frequencies in order to facilitate the relatively high speed operation of the overall memory system. Consequently, computer systems employing this architecture can also use the high-speed system controller/hub interface 134 to complement the high clock speeds of the memory devices 148. Additionally, with a memory hub based system, signal integrity can be maintained on the system controller/hub interface 134 since the signals are typically transmitted through multiple memory hubs 140 to and from the memory hub controller 128. Moreover, this architecture also provides for easy expansion of the system memory without concern for degradation in signal quality as more memory modules are added, such as occurs in conventional memory bus architectures.


Although the memory hub architecture shown in FIG. 1 provides improved memory system performance, the design of the hub memory system, and more generally, computer systems including such a memory hub architecture, becomes increasingly difficult. For example, in many hub based memory systems, the processor is coupled through a memory hub controller to each of several memory hubs via a high speed bus or link over which signals, such as command, address, or data signals, are transferred at a very high rate. The memory hubs are, in turn, coupled to several memory devices via buses that must also operate at a very high speed. However, as transfer rates increase, the time for which a signal represents valid information is decreasing. As commonly referenced by those ordinarily skilled in the art, the window or “eye” for when the signals are valid decreases at higher transfer rates. With specific reference to data signals, the “data eye” decreases. As understood by one skilled in the art, the data eye for each of the data signals defines the actual duration that each signal is valid after various factors affecting the signal are considered, such as timing skew, voltage and current drive capability, and the like. In the case of timing skew of signals, it often arises from a variety of timing errors such as loading on the lines of the bus, the physical lengths of such lines, and drifting operating conditions.


One approach to alleviating timing problems in memory devices is to use a delay-locked loop (DLL) to lock or align the receipt of read data from a memory device and a capture strobe signal used to latch the read data in a memory hub. More specifically, a read strobe signal is output by the memory devices along with read data signals. Although the timing relationship between the read strobe signal and the read data is generally fixed, the timing of when the read strobe signal and the read data are provided by the memory device to a memory hub may slowly drift in relation to a core clock domain used to synchronize operation of the memory hub and the memory device. The timing may slowly drift due to variations in the operating conditions, such as increasing operating temperature or voltage variations. In such case, the read strobe signal and read data may not be present in the memory hub at the proper time. To alleviate this problem, a DLL included in the memory device is used to maintain synchronization of the operation of the memory device and the memory controller. This is accomplished by the memory device by aligning its output strobe to an input clock signal that is sourced from the memory controller or provided by a common clock signal sourced to the memory controller and memory device. That is, as the timing between the memory device and memory hub begins to drift, the DLL can adjust the timing of internal clock signals of the memory device relative to the core clock signal thereby “re-synchronizing” operation of the memory device and the memory hub. The DLL is thus effective in preventing substantial drifting of the read data strobe and the read data in relation to the core clock domain. As transfer rates increase, however, the timing specifications for the DLL become more stringent and therefore increasingly difficult to meet. DLL circuitry sufficient to accommodate such timing needs often consume substantial power as well. Furthermore, the amount of circuitry required to implement a suitable DLL can materially reduce the amount of space that could otherwise be used for memory device circuitry, thereby either increasing the cost or reducing the storage capacity of such memory devices.


There is accordingly a need for a system and method that avoids the need to precisely control the timing relationships between a memory hub clock domain and the receipt of read data signals at the memory hub in a manner that avoids the need for extensive DLL or DL circuitry.


SUMMARY OF THE INVENTION

In one aspect of the present invention, a system for facilitating the adjustment of timing parameters between a memory controller operating in a first clock domain and a memory device operating in a second clock domain monitors a write pointer and a read pointer to provide a write-read pointer offset representing the timing between when read data is made available by the memory device and when the read data is retrieved by the memory controller. Based on the write-read pointer offset, adjustment to different timing parameters can be made.


Such a system can include a data buffer coupled to the memory device and having a plurality of data locations at which read data are respectively stored and a multiplexer coupled to the data buffer to selectively couple read data stored at respective data locations of the data buffer to an output terminal in accordance with a selection signal. A write pointer circuit is coupled to the memory device and the data buffer to generate a write pointer signal to sequentially select one of the plurality of data locations of the data buffer for storing read data received from the memory device responsive to a strobe signal provided by the memory device. A read pointer circuit is coupled to the multiplexer to generate responsive to the core clock signal a read pointer signal provided to the multiplexer to sequentially select one of the plurality of data locations of the buffer from which the read data stored therein is coupled to the output terminal of the multiplexer. A write-read pointer compare circuit coupled to the write and read pointer circuits compares the write and read pointer signals to generate a write-read pointer offset signal indicative of the comparison.


In another aspect of the present invention, a method of adjusting the relative timing between issuing memory write commands and memory read commands includes storing read data provided by at least one memory device in sequentially selected data locations of a buffer, the data location at which read data are currently stored selected by a write pointer. The read data stored in the buffer is retrieved from sequentially selected data locations, the data location from which read data are currently retrieved selected by a read pointer. A write-read pointer offset is generated indicative of a data location offset between the data location selected by the write pointer and the data location selected by the read pointer, the timing between the issuance of memory write commands and memory read commands is adjusted based on the write-read pointer offset.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a partial block diagram of a computer system having a memory hub based system memory in which embodiments of the present invention can be implemented.



FIG. 2 is a partial block diagram of a memory hub used in the computer system of FIG. 1, which contains read synchronization modules according to an embodiment of the present invention.



FIG. 3 a partial block diagram of a read synchronization circuit according to an embodiment of the present invention.



FIG. 4 is a partial block diagram of a write pointer circuit according to an embodiment of the present invention that may be substituted into the read synchronization circuit of FIG. 3.



FIG. 5 is a partial block diagram of a read pointer circuit and a portion of a compare circuit according to embodiments of the present invention that may be substituted into the read synchronization circuit of FIG. 3.



FIG. 6 is a partial block diagram of another portion of the a compare circuit of FIG. 5.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Embodiments of the present invention are directed to a read data synchronization circuit for coupling read data across two clock domains and providing information on the timing margin between when read data is made available and when the data can be retrieved. Certain details are set forth below to provide a sufficient understanding of various embodiments of the invention. However, it will be clear to one skilled in the art that the invention may be practiced without these particular details. In other instances, well-known circuits, control signals, and timing protocols have not been shown in detail in order to avoid unnecessarily obscuring the invention.



FIG. 2 illustrates a memory hub 200 in which an embodiment of the present invention is implemented. The memory hub 200 can be substituted for the memory hub 140 of FIG. 1. The memory hub 200 is shown in FIG. 2 as being coupled to system memory 240a-d. The system memory 240a-d is representative of different types of memory devices and different numbers of memory devices. For example, in one embodiment, each system memory 240a-d represents a conventional double data rate (DDR) synchronous dynamic random access memory (SDRAM) device. In an alternative embodiment, each of the system memory 240a-d represents a bank of memory having a plurality of memory devices. It will be appreciated that the necessary modifications to the memory hub 200 to accommodate the different types and number of memory devices is within the knowledge of those ordinarily skilled in the art, and will not be discussed herein in the interest of brevity.


Further included in the memory hub 200 are link interfaces 210a, 210b and 212a, 212b for coupling the memory module on which the memory hub 200 is located to the bus system 134. The link interfaces 210a, 210b are coupled to the downstream bus 154 and the link interfaces 212a, 212b are coupled to the upstream bus 156. The link interfaces 210a, 210b and 212a, 212b are conventional, and include conventional circuitry used for transferring data, command, and address information to and from the downstream and upstream busses 154, 156. The link interfaces 210a, 210b and 212a, 212b are coupled to a switch 260 through a plurality of bus and signal lines, represented by busses 214. The busses 214 are conventional, and include a write data bus and a read data bus, although a single bi-directional data bus may alternatively be provided to couple data through the link interfaces 210a, 210b and 212a, 212b.


The switch 260 coupling the link interfaces 210a-d, 212a-d and the memory interfaces 270a-d can be any of a variety of conventional or hereinafter developed switches. For example, the switch 260 can be a conventional cross-bar switch that can simultaneously couple link interfaces 210a, 210b and 212a, 212b and the memory interfaces 270a-d to each other in a variety of arrangements. The switch 260 may also include arbitration logic (not shown) to determine which memory accesses should receive priority over other memory accesses. Bus arbitration performing this function is well known to one skilled in the art. The switch 260 is further coupled to four memory interfaces 270a-d which are, in turn, coupled to the system memory 240a-d, respectively. The switch 260 is coupled to each memory interface through a plurality of bus and signal lines, represented by busses 274. The busses 274 include a write data bus, a read data bus, and a request line.


The memory interfaces 270a-d are adapted to the system memory 240a-d to which it is coupled. More specifically, the memory interfaces 270a-d are specially adapted to provide and receive the specific signals received and generated, respectively, by the system memory 240a-d to which it is coupled. Also, the memory interfaces 270a-d are capable of operating with system memory 240a-d operating at different clock frequencies. As a result, the memory interfaces 270a-d isolate the processor 104 from changes that may occur at the interface between the memory hub 230 and memory devices 240a-d coupled to the memory hub 200, and provide a more controlled environment to which the memory devices 240a-d may interface.


With further reference to FIG. 2, each of the memory interfaces 270a-d includes a respective memory controller 280, a respective write buffer 282, and a respective cache memory unit 284. The memory controller 280 performs the same functions as a conventional memory controller by providing control, address and data signals to the system memory device 240a-d to which it is coupled and receiving data signals from the system memory device 240a-d to which it is coupled. The write buffer 282 and the cache memory unit 284 include the normal components of a buffer and cache memory, including a tag memory, a data memory, a comparator, and the like, as is well known in the art. The write buffer 282 in each memory interface 270a-d can be used to store write requests while a read request is being serviced. The cache memory unit 284 in each memory interface 270a-d allows the processor 104 to receive data responsive to a read command directed to a respective system memory 240a-d without waiting for the system memory 240a-d to provide such data in the event that the data was recently read from or written to that memory device 240a-d.


Embodiments of the present invention provide a read synchronization module 297 for determining timing margin between when read data is provided by the system memory 240 and when the read data is retrieved by the memory controller 280. Typically, the read data is provided according to a memory device clock signal and the read data retrieved according to a core clock signal that has a lower frequency than the memory device clock signal. Based on the timing margin determined by the read synchronization module 297, various timing parameters between the memory controller 280 and the system memory 240 can be adjusted. For example, the memory synchronization module 297 can be used to synchronize the coupling of read data from the memory device with the core clock domain of the memory hub 200 as established by a system clock signal from the memory hub controller 128. By having the memory synchronization module 297 adjust for timing drift of the read strobe signal and read data relative to the core clock signal, it may be possible to eliminate DLL circuitry from the memory device since the memory synchronization module 297 tracks when read data is latched by the memory controller 280 and when the read data is available for reading, and if necessary, adjusts the latching and the reading of the data to accommodate for the timing drift.


Although a single synchronization module 297 is shown in FIG. 2, it is to be understood that a plurality of synchronization modules 297 may also be used, for example, one per memory controller 280. Further, in the embodiment shown in FIG. 2, the synchronization module 297 is shown in communication with the memory device 240c and the memory controller 280c. In some embodiments, the synchronization module 297 may be in communication with one or more memory devices and the controller 100 or memory hub 140 shown in FIG. 1. It will be further appreciated that the read synchronization module 297 may be included as part of the memory controller 280, although shown in FIG. 2 as a separate functional block.



FIG. 3 illustrates a read data synchronization circuit 300 according to an embodiment of the present invention. The read data synchronization circuit 300 can be substituted for the read data synchronization circuit 297 shown in FIG. 2. The read data synchronization circuit 300 shown in FIG. 3 is operable for one bit of the read data. The functional blocks shown in FIG. 3 should be generally repeated for every bit of the read data. It will be appreciated, however, that it may not be necessary for some functional blocks to repeated. Those ordinarily skilled in the art will obtain sufficient understanding from the description provided herein in order to practice the present invention.


The read data synchronization circuit 300 provides for coupling read data across two clock domains, namely coupling read data from the system memory 240 operating according to a memory clock signal and the memory hubs 140 operating according to a core clock signal. Typically, the frequency of the memory clock signal is greater than the frequency of the core clock signal. As shown in FIG. 3, the core clock signal is represented by the CLK signal and the memory clock signal is represented by the RSTB signal. The RSTB signal is a read strobe signal that is transmitted by the system memory 240 along with the read data as an indication that read data is being transmitted, as known in the art. Although the RSTB signal is not the actual memory clock signal, the RSTB signal has a timing relative to, and the same frequency as, the memory clock signal. Thus, when the RSTB signal is clocking, it essentially clocks in time with the memory clock signal. As explained in more detail below, the RSTB signal is used to synchronize read data capture.


The read data synchronization circuit 300 includes a data buffer 304. The buffer 304 is conventional, and can be configured as a first-in-first-out (FIFO) buffer. The buffer 304 includes n data locations for storing up to n data. The buffer 304 is coupled to receive the RSTB signal in order to capture data in response to each clock transition of the RSTB signal. The buffer 304 is further coupled to a write pointer circuit 308. In response to the RSTB signal, the write pointer circuit 308 provides an enable signal EN to the buffer 304 to selectively enable one of the n data locations to which memory read data DQ is to be written. For each transition of the RSTB signal, the write pointer circuit 308 disables the current data location and enables a next data location of the FIFO to which the next memory read data DQ is to be written. In this manner, the data locations of the buffer 304 are incremented through in response to each transition of the RSTB signal so that as new memory read data DQ is provided to the buffer 304, each memory read data DQ is captured at one of the n data locations of the buffer 304 in response to the RSTB signal that is provided with the memory read data DQ. By using the EN signal to select which one of the n data locations to write the memory read data DQ, the EN signal provides a “write pointer” that “points” to the data location in the buffer 304 that memory read data DQ is to be written.


The write pointer circuit 308 operates the buffer 304 as a circular buffer in that after n memory read data DQ are written to the n data locations, the n+1 memory read data DQ will overwrite the memory read data DQ written to a first data location of the buffer 304. Consequently, it is desirable for the memory read data DQ at the first data location to have been retrieved before being overwritten. It will be appreciated that the number of data locations of the buffer 304 should be sufficient to prevent new memory read data DQ written to the buffer 304 according to the memory clock signal from overwriting memory read data DQ already written to the buffer 304, but not yet retrieved according to a lower frequency core clock signal CLK.


A multiplexer 312 is coupled to the buffer 304 to select m of the n data locations and provide the data stored in the m selected data locations as output data DQ_OUT. The output data DQ_OUT is coupled to a latch circuit 314, which latches the m output data DQ_OUT in response to the rising edge of the core clock signal CLK and provides the data as read data DQ_RD. Selection by the multiplexer 312 is based on a selection signal SEL provided by a read pointer circuit 316 that is coupled to the multiplexer 312 and the memory controller 280 (FIG. 2). It will be appreciated by those ordinarily skilled in the art that the SEL signal is indicative of the data locations of the buffer 304 from which data is selected for provision by the multiplexer 312 as output data DQ_OUT. As a result, the SEL signal provides a “read pointer” that “points” to the data locations in the buffer 304 from which data is read. As previously discussed, the memory controller 280 provides memory device command signals CMD and memory address signals ADDR to the system memory 240. The memory sequencer further enables the read pointer circuit 316 at a time relative to sending a read command to the system memory 240 in order to select from the buffer 304 m memory read data DQ to be provided as output data DQ_OUT.


When enabled by the memory controller 280, the read pointer circuit 316 increments through groups of m data locations of the buffer 304 in response to the core clock signal CLK. The multiplexer 312 selects m of the n data locations simultaneously in response to the CLK signal to accommodate the higher clock frequency of the memory clock signal relative to the frequency of the CLK signal. It will be appreciated by those ordinarily skilled in the art that the m number of data locations to be selected by the multiplexer 312 will be based on the number of memory read DQ provided by the system memory 280 for every clock cycle of the CLK signal.


The read data synchronization circuit 300 further includes a compare circuit 320 that is coupled to the write pointer circuit 308 and the read pointer circuit 316. The compare circuit 320 compares the EN and SEL signals to determine an offset between the data location of the buffer 304 to which memory read data DQ is written and the data locations of the buffer 304 from which data is provided by the multiplexer 312 as output data DQ_OUT. That is, with reference to the previous discussion of write and read pointers, the compare circuit 320 determines the offset between the write pointer and the read pointer. A signal OFFSET indicative of the offset between the write and read pointers is generated by the compare circuit 320 and provided to the memory controller 280. As will be explained in more detail below, the offset between the write and read pointers determined by the compare circuit 318 can be used by the memory controller 280 to gauge timing margins, and if appropriate, adjust timing parameters such as to reduce read latency and command turn-around times.


Operation of the read data synchronization circuit 300 will be described with respect to a conventional “burst” read operation for a DDR memory device. As well known, when a burst read operation in a DDR memory device is performed, a first data is provided after a time delay from the latching of a column address by the memory device. Thereafter, new data is provided in response to each transition of a memory clock signal applied to the DDR memory device until the burst operation is terminated. Thus, for each period of the memory clock signal, the DDR memory device outputs data twice, that is, once in response to a rising edge of the memory clock signal and again in response to a falling edge of the memory clock signal.


In operation, the buffer 304 and the multiplexer 312 function to de-serialize the memory read data DQ received from the system memory 240 in accordance with the memory device clock signal to be provided in parallel from the multiplexer 312 according to the core clock signal CLK. The memory controller 280 transmits CMD and ADDR signals to the memory devices 148 in order to execute a burst read operation. At the time the burst read operation is initiated, the write pointer of the write pointer circuit 308 and the read pointer of the read pointer circuit 316 are pointing to the same data location of the buffer 304. Based on the CMD and ADDR signals, the system memory 240 access the memory cell locations corresponding to the ADDR signals to retrieve the requested read data, and provide the requested read data to the buffer 304 as memory read data DQ. Since the present example is directed to a burst read operation, new memory read data DQ is provided to the buffer 304 in response to each transition of the memory clock signal. As previously discussed, the system memory 240 transmits a RSTB signal with each memory read data DQ provided to the buffer 304. In the case of a burst read operation, the RSTB signal clocks between two logic levels at the same frequency as the memory clock signal. Consequently, the write pointer circuit 308 sequentially enables data locations in the buffer 304 in response to each transition of the RSTB signal in order to capture the memory read data DQ provided to the buffer 304 in response to each transition of the memory clock signal.


At a time following the initiation of the burst read operation, the memory controller 280 enables to read pointer circuit 316 to provide a SEL signal to the multiplexer 316 to select groups of m data locations of the buffer 304 for provision as the output data DQ_OUT. The time typically corresponds to t number of clock cycles of the core clock signal CLK after the burst read operation was initiated by the CMD and ADDR signals. In response to the t-th rising edge of the CLK signal, m data locations of the buffer 304 are selected by the multiplexer 312, the data stored therein provided as the output data DQ_OUT, and latched by the latch circuit 314 for provision as read data DQ_RD. For every rising edge of the CLK signal thereafter, a next group of m data locations of the buffer 304 are selected so that the data stored therein are provided as the output read data DQ_OUT and latched by the latch circuit 314. The process of selecting a next group of m data locations of the buffer 304 and latching the data stored in the selected data locations at the latch 314 continues until the last read data of the burst operation is provided as read data DQ_RD. When the last of the read data is read from the buffer 304, the read pointer would have finally caught up to the write pointer.


During the time the write pointer is incrementing, which is representative of the memory read data DQ being written to sequential data locations of the buffer 304 according to the memory clock signal, and the read pointer is incrementing, which is representative of the groups of m data locations being selected by the multiplexer 312 according to the core clock signal CLK, a relative offset between the write pointer and the read pointer can be determined by the compare circuit 320. It will be appreciated that the write and read pointer offset, which is the number of data locations of the buffer 304 between the data location to which the write pointer points and the data location to which the read pointer points, is representative of the timing margin between when read data DQ is made available in the buffer 304 and when the data is selected by the multiplexer 312 for reading. As previously mentioned, it may be advantageous for the timing margins to be adjusted based on the write and read pointer offset, such as for accommodating timing drift, exploiting extra timing margin to reduce read latency, or reducing memory device command turn-around times.


For example, based on the OFFSET signal generated by the compare circuit 318, which is indicative of the offset between the write and read pointers, the memory controller 280 can adjust the timing of when the multiplexer 312 selects a group of m data from the buffer 304 to be provided as DQ_OUT relative to when the memory read data DQ is written to the FIFO 204. This may be desirable in the event that timing drift causes the offset to be relatively small, indicating that the data selected by the multiplexer 312 from the buffer 304 is occurring too soon after the memory read data DQ is written to the buffer 304. It may be desirable to reduce the potential for error resulting from reading data from the buffer 304 before the requested data is actually written to the buffer 304 by having the read pointer circuit 316 and multiplexer 312 select from the buffer 304 at a relatively later time. As a result, the timing of when memory read data DQ is written to the buffer 304 and when the data is selected to be provided as output data DQ_OUT is increased to relax the timing margin. The timing margin can be relaxed by having the memory controller 280 wait an additional clock cycle of the CLK signal before enabling the read pointer circuit 316 to select data from the buffer 304. Similarly, it will be appreciated that the timing of when memory read data DQ is written to the buffer 304 and when the data is selected to be provided as output data DQ_OUT can be decreased to tighten the timing margin where the write and read pointer offset is relatively large, thus reducing read latency.


Additionally, the write and read pointer offset can be used to monitor the memory device command turn-around time. The command turn-around time is representative of the minimum time required between the issuance of a first memory device command and the issuance of a second memory device command. For example, the read-write command turn-around time is the minimum time required after the issuance of a read command before a write command to the same memory device can be issued. The turn-around time includes not only the time necessary for the read command to be transmitted to the memory device and the read data to be obtained after receiving the read command and memory addresses. The read-write turn-around time also includes the time necessary for the read data to be transmitted back on a bidirectional memory device data bus coupled between the memory device and a memory controller, such as a memory hub. That is, in order to avoid a data collision, the write data of the immediately following write command cannot be transmitted on the memory device data bus until the read data is received by the memory controller. Typically, the minimum read-write turn-around time is determined based on a “worst case” scenario where all of the timing parameters are assumed to be the longest allowable time within specification. Based on the write and read pointer offset, however, the “worst case” assumption can be refined to reduce the minimum read-write turn-around time if possible. That is, if the write and read pointer offset is relatively large, indicating that the read data DQ is written to the buffer 304 relatively sooner in time than expected, the memory controller 280 can issue a write command relatively sooner in time after issuing a read command to take advantage of the extra timing margin rather than waiting for the worst-case read-write turn-around time to elapse. For example, the write command can be issued one clock cycle of the CLK signal sooner. It will be appreciated by those ordinarily skilled in the art that analysis of the write-read turn-around time can also be refined from the worst-case scenario through the use of the write and read pointer offset as well.


It will be appreciated that adjustment of timing parameters in the memory system can occur whenever desired. However, the timing parameters are typically adjusted during a time when there are no memory requests pending in order to avoid negatively affecting any memory operations currently in progress. For example, adjustment can be made during a refresh operation for a memory device. During this time, as known in the art, there are no memory operations currently in progress, and adjustment of timing parameters can be made without interference.


The previously discussed examples illustrate the usefulness of embodiments of the present invention. In the first example, the write and read pointer offset was used by the memory controller 280 to adjust the timing of when to retrieve read data from the buffer 304 relative to the issuance of a read command. In the second example, the write and read pointer offset was used by the memory controller 280 to adjust the time of when a subsequent memory device command is issued relative to the issuance of the previous memory device command. It will be appreciated that the information provided by the write and read pointer offset, which can be used more generally to gauge various timing margins of a system including a memory controller and memory device, can be used to adjust timing parameters in addition to the ones previously described. Consequently, the scope of the present invention should not be limited to the specific embodiments described herein.



FIG. 4 illustrates a write pointer circuit 400 according to an embodiment of the present invention. The write pointer circuit 400 can be substituted for the write pointer circuit 308 in FIG. 3. The write pointer circuit 400 includes a first set of series coupled D flip-flops 410-415 clocked according the RSTB signal and further includes a second set of series coupled D flip-flops 420-425 clocked according to the complementary RSTB signal, RSTB_N. The output of the last D flip-flop 415, 425 of each set is coupled back to the input of the first D flip-flop 410, 420, respectively, of the same set. A tap at the output of each of the D flip-flops 410-415 and 420-425 provide an enable signal for a respective data location of a buffer (not shown). As shown in FIG. 4, the write pointer circuit 400 can be used with a buffer having 12 data locations in which to store memory read data, and with a DDR memory device that can provide output data in response to each edge of a memory clock signal. The D flip-flops 410-415 provide enable signals for enabling the even numbered data locations (i.e., location 0, location 2, location 4, etc.) of the buffer and the D flip-flops 420-425 provide enable signals for enabling the odd numbered data locations (i.e., location 1, location 3, location 5, etc.).


In operation, the D flip-flops 410-415 and 420-425 are reset and initialized by an active HIGH reset signal CFGRST_N. When reset, the D flip-flop 410 is set to output a “1” at the next rising edge of the RSTB signal and the D flip-flop 420 is set to output a “1” at the next rising edge of the RSTB_N signal, which coincides with the next falling edge of the RSTB signal. Thus, at the rising edge of the RSTB signal following the HIGH CFGRST_N signal the WPTR0 signal switches from a “0” to a “1,” and at the following falling edge of the RSTB signal (i.e., the next rising edge of the RSTB_N signal) the WPTR0_N signal switches from a “0” to a “1.” At the next rising edge of the RSTB signal, the D flip-flop 411 latches the “1” at the output of the D flip-flop 410 and the output of the D flip-flop 411 switches from a “0” to a “1.” Additionally, since the input of the first D flip-flop 410 is coupled to the output of the last D flip-flop 415, which was reset to a “0” in response to the HIGH CFGRST_N signal, the output of the first D flip-flop 410 switches from a “1” to a “0” in response to the same rising edge of the RSTB signal. Thus, the WPTR1 signal switches from a “0” to a “1” and the WPTR0 signal switches form a “1” to a “0” in response to the rising of the RSTB signal. At the next falling edge of the RSTB signal, the D flip-flop 421 latches the “1” at the output of the D flip-flop 420 and the output of the D flip-flop 421 switches from a “0” to a “1.” Additionally, since the input of the first D flip-flop 420 is coupled to the output of the last D flip-flop 425, which was reset to a “0” in response to the HIGH CFGRST_N signal, the output of the first D flip-flop 420 switches from a “1” to a “0” in response to the same falling edge of the RSTB signal. Thus, the WPTR1_N signal switches from a “0” to a “1” and the WPTR0_N signal switches from a “1” to a “0” in response to the falling edge of the RSTB signal.


As the RSTB signal continues to clock back and forth, a “1” is shifted through the D flip-flops 410-415 every rising edge of the RSTB signal and a “1” is shifted through the D flip-flops 420-425 every falling edge of the RSTB signal. The arrangement of each set of D flip-flops 410-415, 420-425 can be referred to as a “one-hot” arrangement. That is, only one of the D flip-flops of each set 410-415, 420-425 is “hot,” or outputs a “1,” in response to the respective RSTB edge. Consequently, the output signal at each of the D flip-flops 410-415, 420-425 can be used as the EN signal (FIG. 3) to sequentially enable and disable the data locations of a buffer (not shown) in accordance with each clock edge of the RSTB signal, as previously described with respect to the write pointer circuit 308 of the read data synchronization circuit 300.



FIG. 5 illustrates a read pointer circuit 500 and a portion of a compare circuit 502 according to an embodiment of the present invention. The read pointer circuit 500 includes three D flip-flops 510-512 clocked by a CLK signal, which can represent a core clock signal. The three bit output of the D flip-flops 510-512 can be used as the select signal SEL to control a multiplexer to sequentially select groups of m data locations of a buffer for provision as read data. Although not shown in FIG. 5, a conventional binary counter circuit can be coupled to the inputs of the D flip-flops 510-512 to provide an incrementing signal that is latched and output in response to each rising edge of the CLK signal. The counter circuit (not shown) can be included in a memory controller coupled to the read pointer circuit 500. As will be explained in further detail below, when used with the write pointer circuit 400 of FIG. 4, the conventional binary counter circuit coupled to the read pointer circuit 500 should rollover after a six count.


The outputs of the D flip-flops 510-512 are further coupled to multiplexers 520, 530 which represent a portion of the compare circuit 502. Each of the multiplexers 520, 530 receive a respective set of input signals SAMP01-SAMP50 from which each of the multiplexers select for output based on the SEL signal of the D flip-flops 510-512. The output of each of the multiplexers 520, 530 is coupled to a respective pair of series coupled D flip-flops 522, 524 and 532, 534. The two pairs of D flip-flops 522, 524 and 532, 534 are clocked by the CLK signal, and the output of the D flip-flops 524, 534 can be used as an OFFSET signal indicative of the write and read pointer offset. A flip-flop enable signal INC_DEC_CE provided to the D flip-flops 522, 532 is used to enable sampling of the write pointer. It will be appreciated that sampling of the write pointer can occur at any time when desired. However, sampling of the write pointer is typically enabled during burst memory operations, where the write and read pointer offset is a relatively stable value.


The pairs of D flip-flops 522, 524 and 532, 534 provide an arrangement that can be used to reduce instability of the OFFSET signal caused by the meta-stability of D flip-flops at the time input data is latched in response to a rising clock edge. That is, the first D flip-flops 522 and 532 may latch a transitional data value in response to the rising edge of the CLK signal since the input values to the multiplexers are changing according to the higher frequency memory clock signal. However, the second D flip-flops 524, 534 latch a stable output value provided at the output of the first D flip-flops 522, 532. The D flip-flops 510-512, 522, 524, 532, and 534, and the multiplexers 520, 530 are conventional.



FIG. 6 illustrates another portion of the compare circuit 502 shown in FIG. 5. Six three-input OR logic gates 601-606 provide a respective one of the input signals SAMP01-SAMP50 that are coupled to the inputs of the multiplexers 520, 530. The inputs of each of the OR gates 601-606 are coupled to a different combination of the enable signals WPTR0-WPTR5, WPTR0_N-WPTR5_N provided by the write counter circuit 400 (FIG. 4). The OR gates 601-606 are conventional.


The read pointer circuit 500 and the compare circuit 502, including the OR gates 601-606, can be substituted for the read pointer 316 and the compare circuit 320 of the read data synchronization circuit 300. As will be explained in greater detail below, the write pointer circuit 400, the read pointer circuit 500, and the compare circuit 502 can be used together to determine a write and read pointer offset for a read data synchronization circuit having a buffer with 12 data locations and a multiplexer that selects groups of 4 data locations of the buffer for coupling to a latch circuit.


As previously discussed, the write pointer circuit 400 can be used to generate enable signals WPTR0-WPTR5, WPTR0_N-WPTR5_N for sequentially enabling one of twelve data locations of a buffer to which memory read data from a memory device is written. The write pointer circuit 400 operates according to the RSTB signal, which essentially clocks at the same frequency as a memory clock signal. The enable signals WPTR0-WPTR5, WPTR0_N-WPTR5_N are further coupled in various combinations to the input terminals of the OR gates 601-606. The OR gates 601-606 are used to generate signals that are indicative of the location of the write pointer. More specifically, the OR gates 601-606 generate signals indicative of the location of the “one-hot” bit for the D flip-flops 410-415 and 420-425. Based on the location of the one-hot bits, an indication of which data location the write pointer is pointing is provided.


For example, where the one-hot bit for the first set of D flip-flops 410-415 is located at the D flip-flop 411 following a rising edge of the RSTB signal, the output of the OR gates 601 and 602 will be HIGH, while the output of the remaining OR gates 603-606 will remain LOW. At a next falling edge of the RSTB signal, the one-hot bit for the D flip-flops 420-425 is located at the D flip-flop 421, causing in the outputs of the OR gates 601 and 602 to remain HIGH and the outputs of the remaining D flip-flops 603-606 remain LOW. In response to the next rising edge of the RSTB signal, the one-hot bit of the D flip-flops 210-215 moves to the D flip-flop 412. As a result, the output of the OR gate 601 switches LOW, the output of the OR gate 602 remains HIGH, and the output of the OR gate 603 switches HIGH. The OR gates 604-606 remain LOW. At the next falling edge of the RSTB signal, the one-hot bit for the D flip-flops 420-425 moves to the D flip-flop 422. The outputs of the OR gates 602 and 603 remain HIGH, and the outputs of the remaining OR gates 601 and 604-606 remain LOW. At the next rising edge of the RSTB signal, the one-hot bit of the D flip-flops 410-415 moves to the D flip-flop 413, causing the output of the OR gate 602 to switch LOW and the output of the OR gate 604 to switch HIGH. The output of the OR gate 603 remains HIGH and the outputs of the remaining OR gates 601, 602, 605, 606 remain LOW. As demonstrated by the present example, the location of the one-hot bits of the D flip-flops 410-415, 420-425 is represented by which two of the six OR gates 601-606 has HIGH output signals. Generally, a first of the two OR gates having a HIGH output identifies the “trailing” D flip-flop at which the one-hot bit is currently located or was just previously located, and a second of the two OR gates identifies the “leading” D flip-flop at which the one-hot bit is currently located or will soon be located.


The one-hot arrangement of the D flip-flops 410-415 and 420-425 facilitates determination of the write and read pointer offset by avoiding potential sampling errors present with an encoded write pointer scheme. An encoded scheme digitally encodes a value corresponding to the data location to which memory read data is written. For example, when using a three-bit encoded write pointer, pointing to the fourth data location of the 12-data location buffer is represented by 011. In response to the next clock transition of the RSTB signal, the write pointer will increment to 100. Due to the meta-stability of D flip-flops when transitioning in response to a rising edge of a clock signal, sampling at the time the encoded write pointer value is incrementing from 011 to 100 may result in detecting an erroneous write pointer value, such as 111. In contrast, with a one-hot arrangement, any ambiguity as to the location of the write pointer is reduced by having only one “hot” bit in the D flip-flops 410-415, 420-425 to represent the write pointer. It will be appreciated, however, that the advantages of a one-hot arrangement over an encoded arrangement does limit the scope of the present invention. Encoded pointer schemes, such as Gray codes, as well as other pointer schemes, can be used without departing from the scope of the present invention.


The read pointer circuit 500 generates selection signal SEL for a multiplexer (not shown) that selects groups of four data locations of the 12-data location buffer in accordance with the CLK signal. The SEL signal is further used to sequentially select which of the six input signals from the OR gates 601-606 are coupled as a respective output signal of the multiplexers 520, 530. The respective outputs of the multiplexers 520, 530 are latched in response to the rising edge of the CLK signal by the D flip-flops 522, 532, and on the next rising edge of the CLK signal by the D flip-flops 524, 534 to provide an OFFSET signal. By sequencing through the input signals provided by the OR gates 601-606, and latching the output at the D flip-flops 522, 532, and 524, 534, all in response to the rising edges of the CLK signal, the OFFSET signal provided by the D flip-flops 524, 534 is indicative of the write and read pointer offset.


As previously discussed, the memory controller 280 (FIG. 3) receives the OFFSET signal from the compare circuit and uses the write and read pointer offset to determine whether timing parameters should be adjusted. For example, based on the write and read pointer offset, the memory controller 280 can determine whether the timing between issuance of a read command and when the data locations of the buffer are selected for providing the read data should be adjusted to relax or tighten the timing margin. Additionally, based on the write and read pointer offset, analysis of the timing between the issuance of a first memory command and a second memory command can be refined and modified to reduce command turn-around times if desirable.


From the foregoing it will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without deviating from the spirit and scope of the invention. For example, embodiments of the present invention have been described herein with respect to implementation in a memory hub. However, it will be appreciated that the present invention can be used more generally in non-memory hub memory controllers without departing from the scope of the present invention. Thus, alternative embodiments of the present invention include a non-memory hub memory controller having a read data synchronization circuit. Accordingly, the invention is not limited except as by the appended claims.

Claims
  • 1. A method, comprising: storing read data in sequentially selected data locations of a buffer responsive to a first clock signal by providing a selection signal for sequentially selecting the data locations by shifting a first flag bit responsive to a rising edge of a strobe signal through a first set of series-coupled flip-flops having a last flip-flop coupled to a first flip-flop of the first set, and by shifting a second flag bit responsive to a falling edge of the strobe signal through a second set of series-coupled flip-flops having a last flip-flop coupled to a first flip-flop of the second set;retrieving read data from sequentially selected data locations of the buffer responsive to a second clock signal;determining a timing offset associated with coupling data between the first time domain and the second time domain; andadjusting timing parameters responsive to the timing offset.
  • 2. A method, comprising: determining a timing offset between storing read data in sequentially selected data locations of a buffer responsive to a first clock signal and retrieving read data from sequentially selected data locations of the buffer responsive to a second clock signal, the data stored in the buffer by providing a selection signal for sequentially selecting the data locations by shifting a first flag bit in response to a rising edge of a strobe signal through a first set of series-coupled flip-flops having a last flip-flop coupled to a first flip-flop of the first set, and by shifting a second flag bit in response to a falling edge of the strobe signal through a second set of series-coupled flip-flops having a last flip-flop coupled to a first flip-flop of the second set; andexecuting data transfer operations responsive to the timing offset.
  • 3. An apparatus, comprising: a synchronization module operable to couple data between a first time domain and a second time domain, the synchronization module comprising: a first pointer circuit, the first pointer circuit operable to generate a first pointer signal indicative of a data location in a buffer where data is to be stored in responsive to a first clock signal, the first pointer circuit having a first set of series-coupled flip-flops having an output of a last flip-flop coupled to an input of a first flip-flop, the first set of series-coupled flip-flops operable to shift a first flag through each flip-flop in response to a rising edge of the first clock signal, and further having a second set of series-coupled flip-flops having an output of a last flip-flop coupled to an input of a second flip-flop, the second set of series-coupled flip-flops operable to shift a second flag through each flip-flop in response to a rising edge of the second clock signal, output signals of the flip-flops of the first and second sets of series-coupled flip-flops representative of the first pointer signal;a second pointer circuit, the second pointer circuit operable to generate a second pointer signal indicative of a data location in the buffer where data is to be retrieved from responsive to a second clock signal; anda comparison circuit coupled to the first pointer circuit and the second pointer circuit, the comparison circuit operable to compare the first pointer signal and the second pointer signal to generate a pointer offset signal indicative of a pointer offset.
  • 4. A memory hub, comprising: a link interface;a memory device interface;a memory controller coupled to the link interface and the memory device interface;a synchronization module coupled to a memory device, the memory device interface and the memory controller, the memory device operating according to a first clock signal, the synchronization module operable to couple read data from the memory device to the memory controller, the memory controller operable to receive memory requests from the link interface responsive to a second clock signal, the synchronization module comprising: a first pointer circuit, the first pointer circuit operable to generate a first pointer signal indicative of a data location in a buffer where data is to be stored in responsive to the first clock signal;a second pointer circuit, the second pointer circuit operable to generate a second pointer signal indicative of a data location in the buffer where data is to be retrieved from responsive to the second clock signal; anda comparison circuit coupled to the first pointer circuit and the second pointer circuit, the comparison circuit operable to compare the first pointer signal and the second pointer signal to generate a pointer offset signal indicative of a pointer offset;a buffer coupled to the first pointer circuit, the buffer having a plurality of data locations;a selection circuit coupled to the buffer and the second pointer circuit, the selection circuit operable to selectively couple data stored in the plurality of data locations of the buffer to an output terminal of the selection circuit responsive to the second clock signal; anda data latch coupled to the output terminal of the selection circuit to latch the data selectively coupled thereto responsive to the first clock signal.
  • 5. An apparatus, comprising: a synchronization module operable to couple data between a first time domain and a second time domain, the synchronization module comprising:a data buffer configured to be coupled to a memory device and having a plurality of data locations at which read data are respectively stored;a write pointer circuit coupled to the data buffer and adapted to generate a write pointer signal to sequentially select one of the plurality of data locations of the data buffer for storing read data received from the memory device responsive to a strobe signal provided by the memory device;a read pointer circuit coupled to the data buffer and adapted to generate responsive to the core clock signal a read pointer signal to sequentially select one of the plurality of data locations of the buffer from which the read data stored therein, the read pointer including a plurality of flip-flops adapted to output a respective bit of a count value responsive to the core clock signal; anda write-read pointer compare circuit coupled to the write and read pointer circuits to compare the write and read pointer signals and adapted to generate a write-read pointer offset signal indicative of the comparison.
  • 6. The apparatus of claim 5, further comprising a multiplexer coupled to the data buffer and the read pointer circuit, and configured to selectively couple read data stored at respective data locations of the data buffer to an output terminal in accordance with the read pointer signal.
  • 7. The apparatus of claim 6, further comprising a data latch coupled to the output terminal of the multiplexer to latch the read data selectively coupled thereto responsive to the core clock signal.
  • 8. The apparatus of claim 5 wherein the write pointer circuit comprises: a first set of series coupled flip-flops having an output of a last flip-flop coupled to an input of a first flip-flop, the first set of series coupled flip-flops shifting a flag through each flip-flop in response to a rising edge of the strobe signal; anda second set of series coupled flip-flops having an output of a last flip-flop coupled to an input of a first flip-flop, the second set of series coupled flip-flops shifting a flag through each flip-flop in response to a falling edge of the strobe signal,the write pointer signal represented by output signals of the flip-flops of the first and second sets of series coupled flip-flops.
  • 9. The apparatus of claim 8 wherein the write-read compare circuit comprises: a logic circuit having a plurality of input nodes coupled to outputs of each flip-flop of the first and second sets of series coupled flip-flops and further having a plurality of output nodes, the logic circuit adapted to generate flag signals at each of the output nodes indicative of the location of the flag in the first and second sets of series coupled flip-flops;a first multiplexer having a plurality of input terminals coupled to the plurality of output nodes of the logic circuit, a selection terminal coupled to the read pointer circuit, and further having an output terminal, the first multiplexer selectively coupling one of the input terminals to the output terminal according to the read pointer signal provided by the read pointer circuit; anda second multiplexer having a plurality of input terminals coupled to the plurality of output nodes of the logic circuit, a selection terminal coupled to the read pointer circuit, and further having an output terminal, the second multiplexer selectively coupling one of the input terminals to the output terminal according to the read pointer signal provided by the read pointer circuit,the outputs of the first and second multiplexers providing signals representative the write-read pointer offset signal.
  • 10. The apparatus of claim 9 wherein the logic circuit comprises a plurality of three-input logic OR gates, each logic OR gate having first and second inputs coupled to outputs of two flip-flops of the first set of series coupled flip-flops and further having a third input coupled to an output of a respective flip-flop of the second set of series coupled flip-flops.
  • 11. The apparatus of claim 9, further comprising: a first pair of series coupled flip-flops coupled to the output terminal of the first multiplexer, the first pair of series coupled flip-flops shifting the output of the first multiplexer though the flip-flops in response to the core clock signal; anda second pair of series coupled flip-flops coupled to the output terminal of the second multiplexer, the second pair of series coupled flip-flops shifting the output of the second multiplexer though the flip-flops in response to the core clock signal.
  • 12. A data synchronizing circuit for coupling data between a memory controller clocked in accordance with a core clock signal and a memory device clocked in accordance with a memory device clock signal, the data synchronizing circuit comprising: a data buffer having a plurality of memory locations at which to store data and a selection signal node, the data buffer coupled to the memory device to store read data at a respective one of the plurality of data locations selected in accordance with a selection signal;a write pointer circuit coupled to the memory device to receive a data strobe signal and further coupled to the selection signal node of the data buffer to provide a selection signal to sequentially select a data location to which read data from the memory device is written in response to the data strobe signal;a multiplexer having a plurality of input terminals coupled to a respective one of the plurality of data locations of the data buffer and further having an output terminal to which the input terminals are selectively coupled to couple read data from the data buffer to the output terminal according to a multiplexer selection signal applied to a multiplexer selection node;a read pointer circuit having a clock node to which the core clock signal is applied and further having an output node coupled to the multiplexer selection node to provide the multiplexer selection signal to sequentially select the input terminals for coupling to the output terminal of the multiplexer responsive to the core clock signal;a data latch coupled to the output terminal of the multiplexer to latch the read data selectively coupled thereto responsive to the core clock signal; anda pointer comparison circuit coupled to the write and read pointer circuits to compare to which one of the data locations read data received from the memory device are currently stored and from which one of the data locations read data are currently coupled to the output terminal of the multiplexer and generate a write-read pointer offset signal indicative of the comparison.
  • 13. The data synchronizing circuit of claim 12 wherein the read pointer circuit comprises a plurality of flip-flops adapted to output a respective bit of a count value in response to the core clock signal.
  • 14. The data synchronizing circuit of claim 13 wherein the write pointer circuit comprises: a first set of series coupled flip-flops having an output of a last flip-flop coupled to an input of a first flip-flop, the first set of series coupled flip-flops shifting a flag through each flip-flop in response to a rising edge of the data strobe signal; anda second set of series coupled flip-flops having an output of a last flip-flop coupled to an input of a first flip-flop, the second set of series coupled flip-flops shifting a flag through each flip-flop in response to a falling edge of the data strobe signal, the selection signal represented by output signals of the flip-flops of the first and second sets of series coupled flip-flops.
  • 15. The data synchronizing circuit of claim 14 wherein the pointer comparison circuit comprises: a logic circuit having a plurality of input nodes coupled to outputs of each flip-flop of the first and second sets of series coupled flip-flops and further having a plurality of output nodes, the logic circuit adapted to generate flag signals at each of the output nodes indicative of the location of the flag in the first and second sets of series coupled flip-flops;a first multiplexer having a plurality of input terminals coupled to the plurality of output nodes of the logic circuit, a selection terminal coupled to the read pointer circuit, and further having an output terminal, the first multiplexer selectively coupling one of the input terminals to the output terminal according to the multiplexer selection signal provided by the read pointer circuit; anda second multiplexer having a plurality of input terminals coupled to the plurality of output nodes of the logic circuit, a selection terminal coupled to the read pointer circuit, and further having an output terminal, the second multiplexer selectively coupling one of the input terminals to the output terminal according to the multiplexer selection signal provided by the read pointer circuit,the outputs of the first and second multiplexers providing signals representative the write-read pointer offset signal.
  • 16. The data synchronizing circuit of claim 15 wherein the logic circuit comprises a plurality of three-input logic OR gates, each logic OR gate having first and second inputs coupled to outputs of two flip-flops of the first set of series coupled flip-flops and further having a third input coupled to an output of a respective flip-flop of the second set of series coupled flip-flops.
  • 17. The data synchronizing circuit of claim 15, further comprising: a first pair of series coupled flip-flops coupled to the output terminal of the first multiplexer, the first pair of series coupled flip-flops shifting the output of the first multiplexer though the flip-flops in response to the core clock signal; anda second pair of series coupled flip-flops coupled to the output terminal of the second multiplexer, the second pair of series coupled flip-flops shifting the output of the second multiplexer though the flip-flops in response to the core clock signal.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 11/418,897 filed May 4, 2006, and issued as U.S. Pat. No. 7,594,088 on Sep. 22, 2009, which is a continuation of U.S. patent application Ser. No. 10/861,145 filed Jun. 4, 2004 and issued as U.S. Pat. No. 7,519,788 on Apr. 14, 2009. These applications and patents are each incorporated by reference herein.

US Referenced Citations (320)
Number Name Date Kind
4045781 Levy et al. Aug 1977 A
4240143 Besemer et al. Dec 1980 A
4245306 Besemer et al. Jan 1981 A
4253144 Bellamy et al. Feb 1981 A
4253146 Bellamy et al. Feb 1981 A
4608702 Hirzel et al. Aug 1986 A
4707823 Holdren et al. Nov 1987 A
4724520 Athanas et al. Feb 1988 A
4891808 Williams Jan 1990 A
4930128 Suzuki et al. May 1990 A
4953930 Ramsey et al. Sep 1990 A
5133059 Ziegler et al. Jul 1992 A
5241506 Motegi et al. Aug 1993 A
5243703 Farmwald et al. Sep 1993 A
5251303 Fogg, Jr. et al. Oct 1993 A
5269022 Shinjo et al. Dec 1993 A
5317752 Jewett et al. May 1994 A
5319755 Farmwald et al. Jun 1994 A
5327553 Jewett et al. Jul 1994 A
5355391 Horowitz et al. Oct 1994 A
5432823 Gasbarro et al. Jul 1995 A
5432907 Picazo, Jr. et al. Jul 1995 A
5442770 Barratt Aug 1995 A
5461627 Rypinski Oct 1995 A
5465229 Bechtolsheim et al. Nov 1995 A
5465343 Henson et al. Nov 1995 A
5479370 Furuyama et al. Dec 1995 A
5497476 Oldfield et al. Mar 1996 A
5502621 Schumacher et al. Mar 1996 A
5544319 Acton et al. Aug 1996 A
5566325 Bruce, II et al. Oct 1996 A
5577220 Combs et al. Nov 1996 A
5581767 Katsuki et al. Dec 1996 A
5606717 Farmwald et al. Feb 1997 A
5613075 Wade et al. Mar 1997 A
5619670 Shindo Apr 1997 A
5638334 Farmwald et al. Jun 1997 A
5638534 Mote, Jr. Jun 1997 A
5659713 Goodwin et al. Aug 1997 A
5659798 Blumrich et al. Aug 1997 A
5706224 Srinivasan et al. Jan 1998 A
5715456 Bennett et al. Feb 1998 A
5729709 Harness Mar 1998 A
5748616 Riley May 1998 A
5796413 Shipp et al. Aug 1998 A
5818844 Singh et al. Oct 1998 A
5819304 Nilsen et al. Oct 1998 A
5822255 Uchida Oct 1998 A
5832250 Whittaker Nov 1998 A
5838931 Regenold et al. Nov 1998 A
5875352 Gentry et al. Feb 1999 A
5875454 Craft et al. Feb 1999 A
5887159 Burrows Mar 1999 A
5889714 Schumann et al. Mar 1999 A
5928343 Farmwald et al. Jul 1999 A
5953743 Jeddeloh Sep 1999 A
5966724 Ryan Oct 1999 A
5973935 Schoenfeld et al. Oct 1999 A
5973951 Bechtolsheim et al. Oct 1999 A
5978567 Rebane et al. Nov 1999 A
5987196 Noble Nov 1999 A
6006340 O'Connell Dec 1999 A
6023726 Saksena Feb 2000 A
6029250 Keeth Feb 2000 A
6031241 Silfvast et al. Feb 2000 A
6033951 Chao Mar 2000 A
6061263 Boaz et al. May 2000 A
6061296 Ternullo, Jr. et al. May 2000 A
6067262 Irrinki et al. May 2000 A
6073190 Rooney Jun 2000 A
6076139 Welker et al. Jun 2000 A
6079008 Clery, III Jun 2000 A
6092158 Harriman et al. Jul 2000 A
6098158 Lay et al. Aug 2000 A
6105075 Ghaffari Aug 2000 A
6111757 Dell et al. Aug 2000 A
6125431 Kobayashi Sep 2000 A
6128703 Bourekas et al. Oct 2000 A
6128706 Bryg et al. Oct 2000 A
6131149 Lu et al. Oct 2000 A
6134624 Burns et al. Oct 2000 A
6137709 Boaz et al. Oct 2000 A
6144587 Yoshida Nov 2000 A
6145033 Chee Nov 2000 A
6157743 Goris et al. Dec 2000 A
6157962 Hodges et al. Dec 2000 A
6167465 Parvin et al. Dec 2000 A
6167486 Lee et al. Dec 2000 A
6175571 Haddock et al. Jan 2001 B1
6185352 Hurley Feb 2001 B1
6185676 Poplingher et al. Feb 2001 B1
6186400 Dvorkis et al. Feb 2001 B1
6191663 Hannah Feb 2001 B1
6201724 Ishizaki et al. Mar 2001 B1
6208180 Fisch et al. Mar 2001 B1
6212590 Melo et al. Apr 2001 B1
6216178 Stracovsky et al. Apr 2001 B1
6216219 Cai et al. Apr 2001 B1
6219725 Diehl et al. Apr 2001 B1
6223259 Zervens et al. Apr 2001 B1
6223301 Santeler et al. Apr 2001 B1
6233376 Updegrove May 2001 B1
6243769 Rooney Jun 2001 B1
6243831 Mustafa et al. Jun 2001 B1
6246618 Yamamoto et al. Jun 2001 B1
6247107 Christie Jun 2001 B1
6249802 Richardson et al. Jun 2001 B1
6252821 Nizar et al. Jun 2001 B1
6256692 Yoda et al. Jul 2001 B1
6266730 Perino et al. Jul 2001 B1
6272609 Jeddeloh Aug 2001 B1
6285349 Smith Sep 2001 B1
6286083 Chin et al. Sep 2001 B1
6294937 Crafts et al. Sep 2001 B1
6301637 Krull et al. Oct 2001 B1
6321233 Larson Nov 2001 B1
6327642 Lee et al. Dec 2001 B1
6330205 Shimizu et al. Dec 2001 B2
6330639 Fanning et al. Dec 2001 B1
6347055 Motomura Feb 2002 B1
6349363 Cai et al. Feb 2002 B2
6356573 Jonsson et al. Mar 2002 B1
6367074 Bates et al. Apr 2002 B1
6370068 Rhee Apr 2002 B2
6370611 Callison et al. Apr 2002 B1
6373777 Suzuki Apr 2002 B1
6381190 Shinkai Apr 2002 B1
6389514 Rokicki May 2002 B1
6392653 Malandain et al. May 2002 B1
6401149 Dennin et al. Jun 2002 B1
6401213 Jeddeloh Jun 2002 B1
6405280 Ryan Jun 2002 B1
6421744 Morrison et al. Jul 2002 B1
6430696 Keeth Aug 2002 B1
6433785 Garcia et al. Aug 2002 B1
6434639 Haghighi Aug 2002 B1
6434696 Kang Aug 2002 B1
6434736 Schaecher et al. Aug 2002 B1
6438622 Haghighi et al. Aug 2002 B1
6438668 Esfahani et al. Aug 2002 B1
6449308 Knight, Jr. et al. Sep 2002 B1
6453393 Holman et al. Sep 2002 B1
6457116 Mirsky et al. Sep 2002 B1
6460108 McCoskey et al. Oct 2002 B1
6460114 Jeddeloh Oct 2002 B1
6462978 Shibata et al. Oct 2002 B2
6463059 Movshovich et al. Oct 2002 B1
6467013 Nizar Oct 2002 B1
6470422 Cai et al. Oct 2002 B2
6473828 Matsui Oct 2002 B1
6477592 Chen et al. Nov 2002 B1
6477614 Leddige et al. Nov 2002 B1
6477621 Lee et al. Nov 2002 B1
6479322 Kawata et al. Nov 2002 B2
6487628 Duong et al. Nov 2002 B1
6490188 Nuxoll et al. Dec 2002 B2
6493803 Pham et al. Dec 2002 B1
6496193 Surti et al. Dec 2002 B1
6496909 Schimmel Dec 2002 B1
6501471 Venkataraman et al. Dec 2002 B1
6502161 Perego et al. Dec 2002 B1
6505287 Uematsu Jan 2003 B2
6523092 Fanning Feb 2003 B1
6523093 Bogin et al. Feb 2003 B1
6526483 Cho et al. Feb 2003 B1
6539490 Forbes et al. Mar 2003 B1
6552564 Forbes et al. Apr 2003 B1
6553476 Ayaki et al. Apr 2003 B1
6564329 Cheung et al. May 2003 B1
6587912 Leddige et al. Jul 2003 B2
6590816 Perner Jul 2003 B2
6594713 Fuoco et al. Jul 2003 B1
6594722 Willke, II et al. Jul 2003 B1
6598154 Vaid et al. Jul 2003 B1
6611884 Castellano Aug 2003 B2
6615325 Mailloux et al. Sep 2003 B2
6622227 Zumkehr et al. Sep 2003 B2
6628294 Sadowsky et al. Sep 2003 B1
6629220 Dyer Sep 2003 B1
6631440 Jenne et al. Oct 2003 B2
6633959 Arimilli et al. Oct 2003 B2
6636110 Ooishi et al. Oct 2003 B1
6646929 Moss et al. Nov 2003 B1
6647470 Janzen Nov 2003 B1
6658509 Bonella et al. Dec 2003 B1
6662304 Keeth et al. Dec 2003 B2
6665202 Lindahl et al. Dec 2003 B2
6667895 Jang et al. Dec 2003 B2
6681292 Creta et al. Jan 2004 B2
6681302 Cho et al. Jan 2004 B2
6697926 Johnson et al. Feb 2004 B2
6704817 Steinman et al. Mar 2004 B1
6715018 Farnworth et al. Mar 2004 B2
6718440 Maiyuran et al. Apr 2004 B2
6721195 Brunelle et al. Apr 2004 B2
6724685 Braun et al. Apr 2004 B2
6728800 Lee et al. Apr 2004 B1
6731548 Pax May 2004 B2
6735679 Herbst et al. May 2004 B1
6735682 Segelken et al. May 2004 B2
6745275 Chang Jun 2004 B2
6748493 Arroyo et al. Jun 2004 B1
6751703 Chilton Jun 2004 B2
6754117 Jeddeloh Jun 2004 B2
6754812 Abdallah et al. Jun 2004 B1
6756661 Tsuneda et al. Jun 2004 B2
6760833 Dowling Jul 2004 B1
6771538 Shukuri et al. Aug 2004 B2
6772295 Spencer et al. Aug 2004 B2
6775747 Venkatraman Aug 2004 B2
6779036 Deshpande Aug 2004 B1
6782466 Steele et al. Aug 2004 B1
6788104 Singh et al. Sep 2004 B2
6789173 Tanaka et al. Sep 2004 B1
6792059 Yuan et al. Sep 2004 B2
6792496 Aboulenein et al. Sep 2004 B2
6795899 Dodd et al. Sep 2004 B2
6799246 Wise et al. Sep 2004 B1
6799268 Boggs et al. Sep 2004 B1
6804760 Wiliams Oct 2004 B2
6804764 LaBerge et al. Oct 2004 B2
6807630 Lay et al. Oct 2004 B2
6811320 Abbott Nov 2004 B1
6816947 Huffman Nov 2004 B1
6820181 Jeddeloh et al. Nov 2004 B2
6821029 Grung et al. Nov 2004 B1
6823023 Hannah Nov 2004 B1
6829705 Smith Dec 2004 B2
6832303 Tanaka Dec 2004 B2
6845409 Talagala et al. Jan 2005 B1
6889304 Perego et al. May 2005 B2
6910109 Holman et al. Jun 2005 B2
6928528 Hewitt Aug 2005 B1
6941433 Libby et al. Sep 2005 B1
6980042 LaBerge Dec 2005 B2
7006505 Bleszynski et al. Feb 2006 B1
7107415 Jeddeloh et al. Sep 2006 B2
7117316 Jeddeloh Oct 2006 B2
7120727 Lee et al. Oct 2006 B2
7133972 Jeddeloh Nov 2006 B2
7162567 Jeddeloh Jan 2007 B2
7188219 Jeddeloh Mar 2007 B2
7254075 Woo et al. Aug 2007 B2
7315053 Hosomi et al. Jan 2008 B2
7318130 Morrow et al. Jan 2008 B2
7343444 Lee et al. Mar 2008 B2
7412566 Lee et al. Aug 2008 B2
7418526 Jeddeloh Aug 2008 B2
7434081 Jeddeloh et al. Oct 2008 B2
7519788 LaBerge Apr 2009 B2
7529896 Jeddeloh et al. May 2009 B2
7562178 Jeddeloh Jul 2009 B2
7594088 LaBerge Sep 2009 B2
7644253 Jeddeloh Jan 2010 B2
20010039612 Lee Nov 2001 A1
20020002656 Honma et al. Jan 2002 A1
20020078298 Jeddeloh Jun 2002 A1
20020112119 Halbert et al. Aug 2002 A1
20020116588 Beckert et al. Aug 2002 A1
20020120709 Chow et al. Aug 2002 A1
20020144064 Fanning Oct 2002 A1
20020178319 Sanchez-Olea Nov 2002 A1
20030005223 Coulson et al. Jan 2003 A1
20030014578 Pax Jan 2003 A1
20030043158 Wasserman et al. Mar 2003 A1
20030043426 Baker et al. Mar 2003 A1
20030093630 Richard et al. May 2003 A1
20030149809 Jensen et al. Aug 2003 A1
20030156639 Liang Aug 2003 A1
20030158995 Lee et al. Aug 2003 A1
20030163649 Kapur et al. Aug 2003 A1
20030177320 Sah et al. Sep 2003 A1
20030193927 Hronik Oct 2003 A1
20030215042 Gauthier et al. Nov 2003 A1
20030217223 Nino, Jr. et al. Nov 2003 A1
20030223295 Ozguz et al. Dec 2003 A1
20030227798 Pax Dec 2003 A1
20030229762 Maiyuran et al. Dec 2003 A1
20030235072 Kim et al. Dec 2003 A1
20040006671 Handgen et al. Jan 2004 A1
20040015666 Rojas et al. Jan 2004 A1
20040019728 Sharma Jan 2004 A1
20040022094 Radhakrishnan et al. Feb 2004 A1
20040024959 Taylor Feb 2004 A1
20040034753 Jeddeloh Feb 2004 A1
20040039886 Christofferson et al. Feb 2004 A1
20040044833 Ryan Mar 2004 A1
20040049649 Durrant Mar 2004 A1
20040064602 George Apr 2004 A1
20040122988 Han et al. Jun 2004 A1
20040126115 Levy et al. Jul 2004 A1
20040144994 Lee et al. Jul 2004 A1
20040158677 Dodd Aug 2004 A1
20040170196 Susnow Sep 2004 A1
20040236885 Fredriksson et al. Nov 2004 A1
20040260864 Lee et al. Dec 2004 A1
20040260909 Lee et al. Dec 2004 A1
20040268061 Khare et al. Dec 2004 A1
20050044327 Howard et al. Feb 2005 A1
20050060533 Woo et al. Mar 2005 A1
20050066137 Jeddeloh et al. Mar 2005 A1
20050071542 Weber et al. Mar 2005 A1
20050078506 Rao et al. Apr 2005 A1
20050105350 Zimmerman May 2005 A1
20050149774 Jeddeloh et al. Jul 2005 A1
20050216648 Jeddeloh Sep 2005 A1
20050216678 Jeddeloh Sep 2005 A1
20050223161 Jeddeloh Oct 2005 A1
20050228939 Janzen Oct 2005 A1
20050246558 Ku Nov 2005 A1
20060085616 Zeighami et al. Apr 2006 A1
20060168407 Stern Jul 2006 A1
20070033353 Jeddeloh Feb 2007 A1
20070088915 Archambault et al. Apr 2007 A1
20070113027 Jeddeloh May 2007 A1
20070271435 Jeddeloh et al. Nov 2007 A1
20080140952 Lee et al. Jun 2008 A1
20090013143 Jeddeloh et al. Jan 2009 A1
20090125688 Jeddeloh May 2009 A1
20090187714 Lee et al. Jul 2009 A1
Foreign Referenced Citations (25)
Number Date Country
0 395 559 Oct 1990 EP
0 843 261 May 1998 EP
0849685 Jun 1998 EP
1199637 Apr 2002 EP
2 244 157 Nov 1991 GB
06-004401 Jan 1994 JP
06-028180 Feb 1994 JP
08-185383 Jul 1996 JP
10-228413 Aug 1998 JP
2000-268006 Sep 2000 JP
2001265539 Sep 2001 JP
2002-232890 Aug 2002 JP
2000-0067533 Nov 2000 KR
387072 Apr 2000 TW
491970 Jun 2002 TW
WO 9318459 Sep 1993 WO
WO 9319422 Sep 1993 WO
97-04401 Feb 1997 WO
9857489 Dec 1998 WO
99-23570 May 1999 WO
99-34294 Jul 1999 WO
WO 0026798 May 2000 WO
00-43902 Jul 2000 WO
WO 0227499 Apr 2002 WO
WO 03104996 Dec 2003 WO
Related Publications (1)
Number Date Country
20090319745 A1 Dec 2009 US
Continuations (2)
Number Date Country
Parent 11418897 May 2006 US
Child 12553856 US
Parent 10861145 Jun 2004 US
Child 11418897 US