US 7,110,322 B2Grant
Memory module including an integrated circuit device
Issue Date:2006-09-19
•31 Claims
•16 Drawing Sheets
Abstract
A memory module including an integrated circuit is disclosed. In one particular exemplary embodiment, the memory module may comprise a plurality of memory devices and an integrated circuit device that is coupled to the plurality of memory devices. The integrated circuit device includes a first circuit to receive control information specifying a write operation, and address information specifying a memory location corresponding to the write operation, wherein the memory location is in a first memory device of the plurality of memory devices, and wherein the control information and the address information are received in a multiplexed format. The integrated circuit device also includes a second circuit, including a plurality of output drivers, to output data after a first number of clock cycles of an external clock signal transpire, wherein the data is to be written to the first memory device during the write operation.
Metadata
Assignee
- Rambus Inc.
Inventors
- Michael Farmwald
- Mark Horowitz
Application Information
Application Number:US 10/939,501
Filing Date:2004-09-14
Priority Date:1990-04-18
Art Unit:2827
Classifications
IPC:
G11C8/00
Patent Drawings (16 sheets)
Description
Cross-Reference to Related Applications
[0001] This patent application is a continuation of U.S. patent application Ser. No. 10/716,595, filed Nov. 20, 2003 (pending); which is a continuation of U.S. patent application Ser. No. 09/801,151, filed Mar. 7, 2001 (now U.S. Pat. No. 6,697,295); which is a continuation of U.S. patent application Ser. No. 09/629,497, filed Jul. 31, 2000 (now U.S. Pat. No. 6,314,051); which is a continuation of U.S. patent application Ser. No. 09/566,551, filed May 8, 2000 (now U.S. Pat. No. 6,266,285); which is a continuation of U.S. patent application Ser. No. 09/213,243 filed Dec. 17, 1998 (now U.S. Pat. No. 6,101,152); which is a continuation of U.S. patent application Ser. No. 09/196,199, filed Nov. 20, 1998 (now U.S. Pat. No. 6,038,195), which is a continuation of U.S. patent application Ser. No. 08/798,520, filed Feb. 10, 1997 (now U.S. Pat. No. 5,841,580); which is a division of U.S. patent application Ser. No. 08/448,657, filed May 24, 1995 (now U.S. Pat. No. 5,638,334); which is a division of U.S. patent application Ser. No. 08/222,646, filed Mar. 31, 1994 (now U.S. Pat. No. 5,513,327); which is a continuation of U.S. patent application Ser. No. 07/954,945, filed Sep. 30, 1992 (now U.S. Pat. No. 5,319,755); which is a continuation of U.S. patent application Ser. No. 07/510,898, filed Apr. 18, 1990 (now abandoned).
Field of the Invention
[0002] An integrated circuit bus interface for computer and video systems is described which allows high speed transfer of blocks of data, particularly to and from memory devices, with reduced power consumption and increased system reliability. A new method of physically implementing the bus architecture is also described.
Background of the Invention
[0003] Semiconductor computer memories have traditionally been designed and structured to use one memory device for each bit, or small group of bits, of any individual computer word, where the word size is governed by the choice of computer. Typical word sizes range from 4 to 64 bits. Each memory device typically is connected in parallel to a series of address lines and connected to one of a series of data lines. When the computer seeks to read from or write to a specific memory location, an address is put on the address lines and some or all of the memory devices are activated using a separate device select line for each needed device. One or more devices may be connected to each data line but typically only a small number of data lines are connected to a single memory device. Thus data line 0 is connected to device(s) 0, data line 1 is connected to-device(s) 1, and so on. Data is thus accessed or provided in parallel for each memory read or write operation. For the system to operate properly, every single memory bit in every memory device must operate dependably and correctly.
[0004] To understand the concept of the present invention, it is helpful to review the architecture of conventional memory devices. Internal to nearly all types of memory devices (including the most widely used Dynamic Random Access Memory (DRAM), Static RAM (SRAM) and Read Only Memory (ROM) devices), a large number of bits are accessed in parallel each time the system carries out a memory access cycle. However, only a small percentage of accessed bits which are available internally each time the memory device is cycled ever make it across the device boundary to the external world.
[0005] Referring to FIG. 1 , all modern DRAM, SRAM and ROM designs have internal architectures with row (word) lines 5 and column (bit) lines 6 to allow the memory cells to tile a two dimensional area 1. One bit of data is stored at the intersection of each word and bit line. When a particular word line is enabled, all of the corresponding data bits are transferred onto the bit lines. Some prior art DRAMs take advantage of this organization to reduce the number of pins needed to transmit the address. The address of a given memory cell is split into two addresses, row and column, each of which can be multiplexed over a bus only half as wide as the memory cell address of the prior art would have required.
Comparison With Prior Art
[0006] Prior art memory systems have attempted to solve the problem of high speed access to memory with limited success. U.S. Pat. No. 3,821,715 (Hoff et. al.), was issued to Intel Corporation for the earliest 4-bit microprocessor. That patent describes a bus connecting a single central processing unit (CPU) with multiple RAMs and ROMs. That bus multiplexes addresses and data over a 4-bit wide bus and uses point-to-point control signals to select particular RAMs or ROMs. The access time is fixed and only a single processing element is permitted. There is no block-mode type of operation, and most important, not all of the interface signals between the devices are bused (the ROM and RAM control lines and the RAM select lines are point-to-point).
[0007] In U.S. Pat. No. 4,315,308 (Jackson), a bus connecting a single CPU to a bus interface unit is described. The invention uses multiplexed address, data, and control information over a single 16-bit wide bus. Block-mode operations are defined, with the length of the block sent as part of the control sequence. In addition, variable access-time operations using a “stretch” cycle signal are provided. There are no multiple processing elements and no capability for multiple outstanding requests, and again, not all of the interface signals are bused.
[0008] In U.S. Pat. No. 4,449,207 (Kung, et. al.), a DRAM is described which multiplexes address and data on an internal bus. The external interface to this DRAM is conventional, with separate control, address and data connections.
[0009] In U.S. Pat. Nos. 4,764,846 and 4,706,166 (Go), a 3-D package arrangement of stacked die with connections along a single edge is described. Such packages are difficult to use because of the point-to-point wiring required to interconnect conventional memory devices with processing elements. Both patents describe complex schemes for solving these problems. No attempt is made to solve the problem by changing the interface.
[0010] In U.S. Pat. No. 3,969,706 (Proebsting, et. al.), the current state-of-the-art DRAM interface is described. The address is two-way multiplexed, and there are separate pins for data and control (RAS, CAS, WE, CS). The number of pins grows with the size of the DRAM, and many of the connections must be made point-to-point in a memory system using such DRAMs.
[0011] There are many backplane buses described in the prior art, but not in the combination described or having the features of this invention. Many backplane buses multiplex addresses and data on a single bus (e.g., the NU bus). ELXSI and others have implemented split-transaction buses (U.S. Pat. Nos. 4,595,923 and 4,481,625 (Roberts)). ELXSI has also implemented a relatively low-voltage-swing current-mode ECL driver (approximately 1 V swing). Address-space registers are implemented on most backplane buses, as is some form of block mode operation.
[0012] Nearly all modern backplane buses implement some type of arbitration scheme, but the arbitration scheme used in this invention differs from each of these. U.S. Pat. Nos. 4,837,682 (Culler), 4,818,985 (Ikeda), 4,779,089 (Theus) and 4,745,548 (Blahut) describe prior art schemes. All involve either log N extra signals, (Theus, Blahut), where N is the number of potential bus requesters, or additional delay to get control of the bus (Ikeda, Culler). None of the buses described in patents or other literature use only bused connections. All contain some point-to-point connections on the backplane. None of the other aspects of this invention such as power reduction by fetching each data block from a single device or compact and low-cost 3-D packaging even apply to backplane buses.
[0013] The clocking scheme used in this invention has not been used before and in fact would be difficult to implement in backplane buses due to the signal degradation caused by connector stubs. U.S. Pat. No. 4,247,817 (Heller) describes a clocking scheme using two clock lines, but relies on ramp-shaped clock signals in contrast to the normal rise-time signals used in the present invention.
[0014] In U.S. Pat. No. 4,646,270 (Voss), a video RAM is described which implements a parallel-load, serial-out shift register on the output of a DRAM. This generally allows greatly improved bandwidth (and has been extended to 2, 4 and greater width shift-out paths.) The rest of the interfaces to the DRAM (RAS, CAS, multiplexed address, etc.) remain the same as for conventional DRAMS.
[0015] One object of the present invention is to use a new bus interface built into semiconductor devices to support high-speed access to large blocks of data from a single memory device by an external user of the data, such as a microprocessor, in an efficient and cost-effective manner.
[0016] Another object of this invention is to provide a clocking scheme to permit high speed clock signals to be sent along the bus with minimal clock skew between devices.
[0017] Another object of this invention is to allow mapping out defective memory devices or portions of memory devices.
[0018] Another object of this invention is to provide a method for distinguishing otherwise identical devices by assigning a unique identifier to each device.
[0019] Yet another object of this invention is to provide a method for transferring address, data and control information over a relatively narrow bus and to provide a method of bus arbitration when multiple devices seek to use the bus simultaneously.
[0020] Another object of this invention is to provide a method of distributing a high-speed memory cache within the DRAM chips of a memory system which is much more effective than previous cache methods.
[0021] Another object of this invention is to provide devices, especially DRAMs, suitable for use with the bus architecture of the invention.
Summary of Invention
[0022] The present invention includes a memory subsystem comprising at least two semiconductor devices, including at least one memory device, connected in parallel to a bus, where the bus includes a plurality of bus lines for carrying substantially all address, data and control information needed by said memory devices, where the control information includes device-select information and the bus has substantially fewer bus lines than the number of bits in a single address, and the bus carries device-select information without the need for separate device-select lines connected directly to individual devices.
[0023] Referring to FIG. 2 , a standard DRAM 13, 14, ROM (or SRAM) 12, microprocessor CPU 11, I/O device, disk controller or other special purpose device such as a high speed switch is modified to use a wholly bus-based interface rather than the prior art combination of point-to-point and bus-based wiring used with conventional versions of these devices. The new bus includes clock signals, power and multiplexed address, data and control signals. In a preferred implementation, 8 bus-data lines and an AddressValid bus line carry address, data and control information for memory addresses up to 40 bits wide. Persons skilled in the art will recognize that 16 bus data lines or other numbers of bus data lines can be used to implement the teaching of this invention. The new bus is used to connect elements such as memory, peripheral, switch and processing units.
[0024] In the system of this invention, DRAMs and other devices receive address and control information over the bus and transmit or receive requested data over the same bus. Each memory device contains only a single bus interface with no other signal pins. Other devices that may be included in the system can connect to the bus and other non-bus lines, such as input/output lines. The bus supports large data block transfers and split transactions to allow a user to achieve high bus utilization. This ability to rapidly read or write a large block of data to one single device at a time is an important advantage of this invention.
[0025] The DRAMs that connect to this bus differ from conventional DRAMs in a number of ways. Registers are provided which may store control information, device identification, device-type and other information appropriate for the chip such as the address range for each independent portion of the device. New bus interface circuits must be added and the internals of prior art DRAM devices need to be modified so they can provide and accept data to and from the bus at the peak data rate of the bus. This requires changes to the column access circuitry in the DRAM, with only a minimal increase in die size. A circuit is provided to generate a low skew internal device clock for devices on the bus, and other circuits provide for demultiplexing input and multiplexing output signals.
[0026] High bus bandwidth is achieved by running the bus at a very high clock rate (hundreds of MHz). This high clock rate is made possible by the constrained environment of the bus. The bus lines are controlled-impedance, doubly-terminated lines. For a data rate of 500 MHz, the maximum bus propagation time is less than 1 ns (the physical bus length is about 10 cm). In addition, because of the packaging used, the pitch of the pins can be very close to the pitch of the pads. The loading on the bus resulting from the individual devices is very small. In a preferred implementation, this generally allows stub capacitances of 1–2 pF and inductances of 0.5–2 nH. Each device 15, 16, 17, shown in FIG. 3 , only hats pins on one side and these pins connect directly to the bus 18. A transceiver device 19 can be included to interface multiple units to a higher order bus through pins 20.
[0027] A primary result of the architecture of this invention is to increase the bandwidth of DRAM access. The invention also reduces manufacturing and production costs, power consumption, and increases packing density and system reliability.
Brief Description of the Drawings
[0028] FIG. 1 is a diagram which illustrates the basic 2-D organization of memory devices.
[0029] FIG. 2 is a schematic block diagram which illustrates the parallel connection of all bus lines and the serial Reset line to each device in the system.
[0030] FIG. 3 is a perspective view of a system of the invention which illustrates the 3-D packaging of semiconductor devices on the primary bus.
[0031] FIG. 4 shows the format of a request packet.
[0032] FIG. 5 shows the format of a retry response from a slave.
[0033] FIG. 6 shows the bus cycles after a request packet collision occurs on the bus and how arbitration is handled.
[0034] FIGS. 7A and 7B show the timing whereby signals from two devices can overlap temporarily and drive the bus at the same time.
[0035] FIGS. 8A and 8B show the connection and timing between bus clocks and devices on the bus.
[0036] FIG. 9 is a perspective view showing how transceivers can be used to connect a number of bus units to a transceiver bus. FIG. 10 is a block and schematic diagram of input/output circuitry used to connect devices to the bus.
[0037] FIG. 11 is a schematic diagram of a clocked sense-amplifier used as a bus input receiver.
[0038] FIG. 12 is a block diagram showing how the internal device clock is generated from two bus clock signals using a set of adjustable delay lines.
[0039] FIG. 13 is a timing diagram showing the relationship of signals in the block diagram of FIG. 12 .
[0040] FIG. 14 is timing diagram of a preferred means of implementing the reset procedure of this invention.
[0041] FIG. 15 is a diagram illustrating the general organization of a 4 Mbit DRAM divided into 8 subarrays.
[0042] FIG. 16 is a block diagram representation of a set of internal registers within each device illustrated in FIG. 2 .
Detailed Description
[0043] The present invention is designed to provide a high speed, multiplexed bus for communication between processing devices and memory devices and to provide devices adapted for use in the bus system. The invention can also be used to connect processing devices and other devices, such as I/O interfaces or disk controllers, with or without memory devices on the bus. The bus consists of a relatively small number of lines connected in parallel to each device on the bus. The bus carries substantially all address, data and control information needed by devices for communication with other devices on the bus. In many systems using the present invention, the bus carries almost every signal between every device in the entire system. There is no need for separate device-select lines since device-select information for each device on the bus is carried over the bus. There is no need for separate address and data lines because address and data information can be sent over the same lines. Using the organization described herein, very large addresses (40 bits in the preferred implementation) and large data blocks (1024 bytes) can be sent over a small number of bus lines (8 plus one control line in the preferred implementation).
[0044] Virtually all of the signals needed by a computer system can be sent over the bus. Persons skilled in the art recognize that certain devices, such as CPUs, may be connected to other signal lines and possibly to independent buses, for example a bus to an independent cache memory, in addition to the bus of this invention. Certain devices, for example cross-point switches, could be connected to multiple, independent buses of this invention. In the preferred implementation, memory devices are provided that have no connections other than the bus connections described herein and CPUs are provided that use the bus of this invention as the principal, if not exclusive, connection to memory and to other devices on the bus.
[0045] All modern DRAM, SRAM and ROM designs have internal architectures with row (word) and column (bit) lines to efficiently tile a 2-D area. Referring to FIG. 1 , one bit of data is stored at the intersection of each word line 5 and bit line 6. When a particular word line is enabled, all of the corresponding data bits are transferred onto the bit lines. This data, about 4000 bits at a time in a 4 MBit DRAM, is then loaded into column sense amplifiers 3 and held for use by the I/O circuits.
[0046] In the invention presented here, the data from the sense amplifiers is enabled 32 bits at a time onto an internal device bus running at approximately 125 MHz. This internal device bus moves the data to the periphery of the devices where the data is multiplexed into an 8-bit wide external bus interface, running at approximately 500 MHz.
[0047] The bus architecture of this invention connects master or bus controller devices, such as CPUs, Direct Memory Access devices (DMAs) or Floating Point Units (FPUs), and slave devices, such as DRAM, SRAM or ROM memory devices. A slave device responds to control signals; a master sends control signals. Persons skilled in the art realize that some devices may behave as both master and slave at various times, depending on the mode of operation and the state of the system. For example, a memory device will typically have only slave functions, while a DMA controller, disk controller or CPU may include both slave and master functions. Many other semiconductor devices, including I/O devices, disk controllers, or other special purpose devices such as high speed switches can be modified for use with the bus of this invention.
[0048] With reference to FIG. 16 , each semiconductor device contains a set of internal registers 170, preferably including a device identification (device ID) register 171, a device-type descriptor register 174, control registers 175 and other registers containing other information relevant to that type of device. In a preferred implementation, semiconductor devices connected to the bus contain registers 172 which specify the memory addresses contained within that device and access-time registers 173 which store a set of one or more delay times at which the device can or should be available to send or receive data.
[0049] Most of these registers can be modified and preferably are set as part of an initialization sequence that occurs when the system is powered up or reset. During the initialization sequence each device on the bus is assigned a unique device ID number, which is stored in the device ID register 171. A bus master can then use these device ID numbers to access and set appropriate registers in other devices, including access-time registers 173, control registers 175, and memory registers 172, to configure the system. Each slave may have one or several access-time registers 173 (four in a preferred embodiment). In a preferred embodiment, one access-time register in each slave is permanently or semi-permanently programmed with a fixed value to facilitate certain control functions. A preferred implementation of an initialization sequence is described below in more detail.
[0050] All information sent between master devices and slave devices is sent over the external bus, which, for example, may be 8 bits wide. This is accomplished by defining a protocol whereby a master device, such as a microprocessor, seizes exclusive control of the external bus (i.e., becomes the bus master) and initiates a bus transaction by sending a request packet (a sequence of bytes comprising address and control information) to one or more slave devices on the bus. An address can consist of 16 to 40 or more bits according to the teachings of this invention. Each slave on the bus must decode the request packet to see if that slave needs to respond to the packet. The slave that the packet is directed to must then begin any internal processes needed to carry out the requested bus transaction at the requested time. The requesting master may also need to transact certain internal processes before the bus transaction begins. After a specified access time the slave(s) respond by returning one or more bytes (8 bits) of data or by storing information made available from the bus. More than one access time can be provided to allow different types of responses to occur at different times.
[0051] A request packet and the corresponding bus access are separated by a selected number of bus cycles, allowing the bus to be used in the intervening bus cycles by the same or other masters for additional requests or brief bus accesses. Thus multiple, independent accesses are permitted, allowing maximum utilization of the bus for transfer of short blocks of data. Transfers of long blocks of data use the bus efficiently even without overlap because the overhead due to bus address, control and access times is small compared to the total time to request and transfer the block.
Device Address Mapping
[0052] Another unique aspect of this invention is that each memory device is a complete, independent memory subsystem with all the functionality of a prior art memory board in a conventional backplane-bus computer system. Individual memory devices may contain a single memory section or may be subdivided into more than one discrete memory section. Memory devices preferably include memory address registers for each discrete memory section. A failed memory device (or even a subsection of a device) can be “mapped out” with only the loss of a small fraction of the memory, maintaining essentially full system capability. Mapping out bad devices can be accomplished in two ways, both compatible with this invention.
[0053] The preferred method uses address registers in each memory device (or independent discrete portion thereof) to store information which defines the range of bus addresses to which this memory device will respond. This is similar to prior art schemes used in memory boards in conventional backplane bus systems. The address registers can include a single pointer, usually pointing to a block of known size, a pointer and a fixed or variable block size value or two pointers, one pointing to the beginning and one to the end (or to the “top” and “bottom”) of each memory block. By appropriate settings of the address registers, a series of functional memory devices or discrete memory sections can be made to respond to a contiguous range of addresses, giving the system access to a contiguous block of good memory, limited primarily by the number of good devices connected to the bus. A block of memory in a first memory device or memory section can be assigned a certain range of addresses, then a block of memory in a next memory device or memory section can be assigned addresses starting with an address one higher (or lower, depending on the memory structure) than the last address of the previous block.
[0054] Preferred devices for use in this invention include device-type register information specifying the type of chip, including how much memory is available in what configuration on that device. A master can perform an appropriate memory test, such as reading and writing each memory cell in one or more selected orders, to test proper functioning of each accessible discrete portion of memory (based in part on information like device ID number and device-type) and write address values (up to 40 bits in the preferred embodiment, 1012 bytes), preferably contiguous, into device address-space registers. Non-functional or impaired memory sections can be assigned a special address value which the system can interpret to avoid using that memory.
[0055] The second approach puts the burden of avoiding the bad devices on the system master or masters. CPUs and DMA controllers typically have some sort of translation look-aside buffers (TLBs) which map virtual to physical (bus) addresses. With relatively simple software, the TLBs can be programmed to use only working memory (data structures describing functional memories are easily generated). For masters which don't contain TLBs (for example, a video display generator), a small, simple RAM can be used to map a contiguous range of addresses onto the addresses of the functional memory devices.
[0056] Either scheme works and permits a system to have a significant percentage of non-functional devices and still continue to operate with the memory which remains. This means that systems built with this invention will have much improved reliability over existing systems, including the ability to build systems with almost no field failures.
Bus
[0057] The preferred bus architecture of this invention comprises 11 signals: BusData[0:7]; AddrValid; Clk1 and Clk2; plus an input reference level and power and ground lines connected in parallel to each device. Signals are driven onto the bus during conventional bus cycles. The notation “Signal[i:j]” refers to a specific range of signals or lines, for example, BusData[0:7] means BusData0, BusData1, . . . BusData7. The bus lines for BusData[0:7] signals form a byte-wide, multiplexed data/address/control bus. AddrValid is used to indicate when the bus is holding a valid address request, and instructs a slave to decode the bus data as an address and, if the address is included on that slave, to handle the pending request. The two clocks together provide a synchronized, high speed clock for all the devices on the bus. In addition to the bused signals, there is one other line (ResetIn, ResetOut) connecting each device in series for use during initialization to assign every device in the system a unique device ID number (described below in detail).
[0058] To facilitate the extremely high data rate of this external bus relative to the gate delays of the internal logic, the bus cycles are grouped into pairs of even/odd cycles. Note that all devices connected to a bus should preferably use the same even/odd labeling of bus cycles and preferably should begin operations on even cycles. This is enforced by the clocking scheme.
Protocol and Bus Operation
[0059] The bus uses a relatively simple, synchronous, split-transaction, block-oriented protocol for bus transactions. One of the goals of the system is to keep the intelligence concentrated in the masters, thus keeping the slaves as simple as possible (since there are typically many more slaves than masters). To reduce the complexity of the slaves, a slave should preferably respond to a request in a specified time, sufficient to allow the slave to begin or possibly complete a device-internal phase including any internal actions that must precede the subsequent bus access phase. The time for this bus access phase is known to all devices on the bus—each master being responsible for making sure that the bus will be free when the bus access begins. Thus the slaves never worry about arbitrating for the bus. This approach eliminates arbitration in single master systems, and also makes the slave-bus interface simpler.
[0060] In a preferred implementation of the invention, to initiate a bus transfer over the bus, a master sends out a request packet, a contiguous series of bytes containing address and control information. It is preferable to use a request packet containing an even number of bytes and also preferable to start each packet on an even bus cycle.
[0061] The device-select function is handled using the bus data lines. AddrValid is driven, which instructs all slaves to decode the request packet address, determine whether they contain the requested address, and if they do, provide the data back to the master (in the case of a read request) or accept data from the master (in the case of a write request) in a data block transfer. A master can also select a specific device by transmitting a device ID number in a request packet. In a preferred implementation, a special device ID number is chosen to indicate that the packet should be interpreted by all devices on the bus. This allows a master to broadcast a message, for example to set a selected control register of all devices with the same value.
[0062] The data block transfer occurs later at a time specified in the request packet control information, preferably beginning on an even cycle. A device begins a data block transfer almost immediately with a device-internal phase as the device initiates certain functions, such as setting up memory addressing, before the bus access phase beings. The time after which a data block is driven onto the bus lines is selected from values stored in slave access-time registers 173. The timing of data for reads and writes is preferably the same; the only difference is which device drives the bus. For reads, the slave drives the bus and the master latches the values from the bus. For writes the master drives the bus and the selected slave latches the values from the bus.
[0063] In a preferred implementation of this invention shown in FIG. 4 , a request packet 22 contains 6 bytes of data—4.5 address bytes and 1.5 control bytes. Each request packet uses all nine bits of the multiplexed data/address lines (AddrValid 23+BusData[0:7] 24) for all six bytes of the request packet. Setting 23 AddrValid=1 in an otherwise unused even cycle indicates the start of an request packet (control information). In a valid request packet, AddrValid 27 must be 0 in the last byte. Asserting this signal in the last byte invalidates the request packet. This is used for the collision detection and arbitration logic (described below). Bytes 25–26 contain the first 35 address bits, Address[0:35]. The last byte contains AddrValid 27 (the invalidation switch) and 28, the remaining address bits, Address[36:39], and BlockSize[0:3] (control information).
[0064] The first byte contains two 4 bit fields containing control information, AccessType[0:3], an op code (operation code) which, for example, specifies the type of access, and Master[0:3], a position reserved for the master sending the packet to include its master ID number. Only master numbers 1 through 15 are allowed—master number 0 is reserved for special system commands. Any packet with Master[0:3]=0 is an invalid or special packet and is treated accordingly.
[0065] The AccessType field specifies whether the requested operation is a read or write and the type of access, for example, whether it is to the control registers or other parts of the device, such as memory. In a preferred implementation, AccessType[0] is a Read/Write switch: if it is a 1, then the operation calls for a read from the slave (the slave to read the requested memory block and drive the memory contents onto the bus); if it is a 0, the operation calls for a write into the slave (the slave to read data from the bus and write it to memory). AccessType[1:3] provides up to 8 different access types for a slave. AccessType[1:2] preferably indicates the timing of the response, which is stored in an access-time register, AccessRegN. The choice of access-time register can be selected directly by having a certain op code select that register, or indirectly by having a slave respond to selected op codes with pre-selected access times (see table below). The remaining bit, AccessType[3] may be used to send additional information about the request to the slaves.
[0066] One special type of access is control register access, which involves addressing a selected register in a selected slave. In the preferred implementation of this invention, AccessType[1:3] equal to zero indicates a control register request and the address field of the packet indicates the desired control register. For example, the most significant two bytes can be the device ID number (specifying which slave is being addressed) and the least significant three bytes can specify a register address and may also represent or include data to be loaded into that control register. Control register accesses are used to initialize the access-time registers, so it is preferable to use a fixed response time which can be preprogrammed or even hard wired, for example the value in AccessReg0, preferably 8 cycles. Control register access can also be used to initialize or modify other registers, including address registers.
[0067] The method of this invention provides for access mode control specifically for the DRAMs. One such access mode determines whether the access is page mode or normal RAS access. In normal mode (in conventional DRAMS and in this invention), the DRAM column sense amps or latches have been precharged to a value intermediate between logical 0 and 1. This precharging allows access to a row in the RAM to begin as soon as the access request for either inputs (writes) or outputs (reads) is received and allows the column sense amps to sense data quickly. In page mode (both conventional and in this invention), the DRAM holds the data in the column sense amps or latches from the previous read or write operation. If a subsequent request to access data is directed to the same row, the DRAM does not need to wait for the data to be sensed (it has been sensed already) and access time for this data is much shorter than the normal access time. Page mode generally allows much faster access to data but to a smaller block of data (equal to the number of sense amps). However, if the requested data is not in the selected row, the access time is longer than the normal access time, since the request must wait for the RAM to precharge before the normal mode access can start. Two access-time registers in each DRAM preferably contain the access times to be used for normal and for page-mode accesses, respectively.
[0068] The access mode also determines whether the DRAM should precharge the sense amplifiers or should save the contents of the sense amps for a subsequent page mode access. Typical settings are “precharge after normal access” and “save after page mode access” but “precharge after page mode access” or “save after normal access” are allowed, selectable modes of operation. The DRAM can also be set to precharge the sense amps if they are not accessed for a selected period of time.
[0069] In page mode, the data stored in the DRAM sense amplifiers may be accessed within much less time than it takes to read out data in normal mode (˜10–20 nS vs. 40–100 nS). This data may be kept available for long periods. However, if these sense amps (and hence bit lines) are not precharged after an access, a subsequent access to a different memory word (row) will suffer a precharge time penalty of about 40–100 nS because the sense amps must precharge before latching in a new value.
[0070] The contents of the sense amps thus may be held and used as a cache, allowing faster, repetitive access to small blocks of data. DRAM-based page-mode caches have been attempted in the prior art using conventional DRAM organizations but they are not very effective because several chips are required per computer word. Such a conventional page-mode cache contains many bits (for example, 32 chips×4 Kbits) but has very few independent storage entries. In other words, at any given points in time the sense amps hold only a few different blocks or memory “locales” (a single block of 4 K words, in the example above). Simulations have shown that upwards of 100 blocks are required to achieve high hit rates (>90% of requests find the requested data already in cache memory) regardless of the size of each block. See, for example, Anant Agarwal, et. al., “An Analytic Cache Model,” ACM Transactions on Computer Systems, Vol. 7(2), pp. 184–215 (May 1989).
[0071] The organization of memory in the present invention allows each DRAM to hold one or more (4 for 4 MBit DRAMS) separately- addressed and independent blocks of data. A personal computer or workstation with 100 such DRAMs (i.e. 400 blocks or locales) can achieve extremely high, very repeatable hit rates (98–99% on average) as compared to the lower (50–80%), widely varying hit rates using DRAMS organized in the conventional fashion. Further, because of the time penalty associated with the deferred precharge on a “miss” of the page-mode cache, the conventional DRAM-based page-mode cache generally has been found to work less well than no cache at all.
[0072] For DRAM slave access, the access types are preferably used in the following way:
[0073]
Persons skilled in the art will recognize that a series of available bits could be designated as switches for controlling these access modes. For example:
| AccessType[1:3] | Use | AccessTime |
|---|---|---|
| 0 | Control Register | Fixed, 8[AccessReg0] |
| Access | ||
| 1 | Unused | Fixed, 8[AccessReg0] |
| 2–3 | Unused | AccessReg1 |
| 4–5 | Page Mode DRAM | AccessReg2 |
| access | ||
| 6–7 | Normal DRAM access | AccessReg3 |
Persons skilled in the art will recognize that a series of available bits could be designated as switches for controlling these access modes. For example:
-
- [0074] AccessType[2]=page mode/normal switch
- [0075] AccessType[3]=precharge/save-data switch
- [0076] BlockSize[0:3] specifies the size of the data block transfer. If BlockSize[0] is 0, the remaining bits are the binary representation of the block size (0–7). If BlockSize[0] is 1, then the remaining bits give the block size as a binary power of 2, from 8 to 1024. A zero-length block can be interpreted as a special command, for example, to refresh a DRAM without returning any data, or to change the DRAM from page mode to normal access mode or vice-versa.
[0077]
Persons skilled in the art will recognize that other block size encoding schemes or values can be used.
| BlockSize[0:2] | Number of Bytes in Block | |
|---|---|---|
| 0–7 | 0–7 respectively | |
| 8 | 8 | |
| 9 | 16 | |
| 10 | 32 | |
| 11 | 64 | |
| 12 | 128 | |
| 13 | 256 | |
| 14 | 512 | |
| 15 | 1024 | |
Persons skilled in the art will recognize that other block size encoding schemes or values can be used.
[0078] In most cases, a slave will respond at the selected access time by reading or writing data from or to the bus over bus lines BusData[0:7] and AddrValid will be at logical 0. In a preferred embodiment, substantially each memory access will involve only a single memory device, that is, a single block will be read from or written to a single memory device.
Retry Format
[0079] In some cases, a slave may not be able to respond correctly to a request, e.g., for a read or write. In such a situation, the slave should return an error message, sometimes called a N(o)ACK(nowledge) or retry message. The retry message can include information about the condition requiring a retry, but this increases system requirements for circuitry in both slave and masters. A simple message indicating only that an error has occurred allows for a less complex slave, and the master can take whatever action is needed to understand and correct the cause of the error.
[0080] For example, under certain conditions a slave might not be able to supply the requested data. During a page-mode access, the DRAM selected must be in page mode and the requested address must match the address of the data held in the sense amps or latches. Each DRAM can check for this match during a page-mode access. If no match is found, the DRAM begins precharging and returns a retry message to the master during the first cycle of the data block (the rest of the returned block is ignored). The master then must wait for the precharge time (which is set to accommodate the type of slave in question stored in a special register, PreChargeReg), and then resend the request as a normal DRAM access (AccessType=6 or 7).
[0081] In the preferred form of the present invention, a slave signals a retry by driving AddrValid true at the time the slave was supposed to begin reading or writing data. A master which expected to write to that slave must monitor Addrvalid during the write and take corrective action if it detects:a retry message. FIG. 5 illustrates the format of a retry message 28 which is useful for read requests, consisting of 23 AddrValid=1 with Master[0:3]=0 in the first (even) cycle. Note that AddrValid is normally 0 for data block transfers and that there is no master 0 (only 1 through 15 are allowed). All DRAMs and masters can easily recognize such a packet as an invalid request packet, and therefore a retry message. In this type of bus transaction all of the fields except for Master[0:3] and AddrValid 23 may be used as information fields, although in the implementation described, the contents are undefined. Persons skilled in the art recognize that another method of signifying a retry message is to add a DataInvalid line and signal to the bus. This signal could be asserted in the case of a NACK.
Bus Arbitration
[0082] In the case of a single master, there are by definition no arbitration problems. The master sends request packets and keeps track of periods when the bus will be busy in response to that packet. The master can schedule multiple requests so that the corresponding data block transfers do not overlap.
[0083] The bus architecture of this invention is also useful in configurations with multiple masters. When two or more masters are on the same bus, each master must keep track of all the pending transactions, so each master knows when it can send a request packet and access the corresponding data block transfer. Situations will arise, however, where two or more masters send a request packet at about the same time and the multiple requests must be detected, then sorted out by some sort of bus arbitration.
[0084] There are many ways for each master to keep track of when the bus is and will be busy. A simple method is for each master to maintain a bus-busy data structure, for example by maintaining two pointers, one to indicate the earliest point in the future when the bus will be busy and the other to indicate the earliest point in the future when the bus will be free, that is, the end of the latest pending data block transfer. Using this information, each master can determine whether and when there is enough time to send a request packet (as described above under Protocol) before the bus becomes busy with another data block transfer and whether the corresponding data block transfer will interfere with pending bus transactions. Thus each master must read every request packet and update its bus-busy data structure to maintain information about when the bus is and will be free.
[0085] With two or more masters on the bus, masters will occasionally transmit independent request packets during the same bus cycle. Those multiple requests will collide as each such master drives the bus simultaneously with different information, resulting in scrambled request information and neither desired data block transfer. In a preferred form of the invention, each device on the bus seeking to write a logical 1 on a BusData or Addrvalid line drives that line with a current sufficient to sustain a voltage greater than or equal to the high-logic value for the system. Devices do not drive lines that should have a logical 0; those lines are simply held at a voltage corresponding to a low-logic value. Each master tests the voltage on at least some, preferably all, bus data and the Addrvalid lines so the master can detect a logical ‘1’ where the expected level is ‘0’ on a line that it does not drive during a given bus cycle but another master does drive.
[0086] Another way to detect collisions is to select one or more bus lines for collision signalling. Each master sending a request drives that line or lines and monitors the selected lines for more than the normal drive current (or a logical value of “>1”), indicating requests by more than one master. Persons skilled in the art will recognize that this can be implemented with a protocol involving BusData and AddrValid lines or could be implemented using an additional bus line.
[0087] In the preferred form of this invention, each master detects collisions by monitoring lines which it does not drive to see if another master is driving those lines. Referring to FIG. 4 , the first byte of the request packet includes the number of each master attempting to use the bus (Master[0:3]). If two masters send packet requests starting at the same point in time, the master numbers will be logical “or”ed together by at least those masters, and thus one or both of the masters, by monitoring the data on the bus and comparing what it sent, can detect a collision. For instance if requests by masters number 2 (0010) and 5 (0101) collide, the bus will be driven with the value Master[0:3]=7 (0010+0101=0111). Master number 5 will detect that the signal Master[2]=1 and master 2 will detect that Master[1] and Master[3]=1, telling both masters that a collision has occurred. Another example is masters 2 and 11, for which the bus will be driven with the value Master[0:3]=11 (0010+1011=1011), and although master 11 can't readily detect this collision, master 2 can. When any collision is detected, each master detecting a collision drives the value of AddrValid 27 in byte 5 of the request packet 22 to 1, which is detected by all masters, including master 11 in the second example above, and forces a bus arbitration cycle, described below.
[0088] Another collision condition may arise where master A sends a request packet in cycle 0 and master B tries to send a request packet starting in cycle 2 of the first request packet, thereby overlapping the first request packet. This will occur from time to time because the bus operates at high speeds, thus the logic in a second-initiating master may not be fast enough to detect a request initiated by a first master in cycle 0 and to react fast enough by delaying its own request. Master B eventually notices that it wasn't supposed to try to send a request packet (and consequently almost surely destroyed the address that master A was trying to send), and, as in the example above of a simultaneous collision, drives a 1 on AddrValid during byte 5 of the first request packet 27 forcing an arbitration. The logic in the preferred implementation is fast enough that a master should detect a request packet by another master by cycle 3 of the first request packet, so no master is likely to attempt to send a potentially colliding request packet later than cycle 2.
[0089] Slave devices do not need to detect a collision directly, but they must wait to do anything irrecoverable until the last byte (byte 5) is read to ensure that the packet is valid. A request packet with Master [0:3] equal to 0 (a retry signal) is ignored and does not cause a collision. The subsequent bytes of such a packet are ignored.
[0090] To begin arbitration after a collision, the masters wait a preselected number of cycles after the aborted request packet (4 cycles in a preferred implementation), then use the next free cycle to arbitrate for the bus (the next available even cycle in the preferred implementation). Each colliding master signals to all other colliding masters that it seeks to send a request packet, a priority is assigned to each of the colliding masters, then each master is allowed to make its request in the order of that priority.
[0091] FIG. 6 illustrates one preferred way of implementing this arbitration. Each colliding master signals its intent to send a request packet by driving a single BusData line during a single bus cycle corresponding to its assigned master number (1–15 in the present example). During two-byte arbitration cycle 29, byte 0 is allocated to requests 1–7 from masters 1–7, respectively, (bit 0 is not used) and byte 1 is allocated to requests 8–15 from masters 8–15, respectively. At least one device and preferably each colliding master reads the values on the bus during the arbitration cycles to determine and store which masters desire to use the bus. Persons skilled in the art will recognize that a single byte can be allocated for arbitration requests if the system includes more bus lines than masters. More than 15 masters can be accommodated by using additional bus cycles.
[0092] A fixed priority scheme (preferably using the master numbers, selecting lowest numbers first) is then used to prioritize, then sequence the requests in a bus arbitration queue which is maintained by at least one device. These requests are queued by each master in the bus-busy data structure and no further requests are allowed until the bus arbitration queue is cleared. Persons skilled in the art will recognize that other priority schemes can be used, including assigning priority according to the physical location of each master.
System Configuration/Reset
[0093] In the bus-based system of this invention, a mechanism is provided to give each device on the a unique device identifier (device ID) after power-up or under other conditions as desired or needed by the system. A master can then use this device ID to access a specific device, particularly to set or modify registers 170 of the specified device, including the control and address registers. In the preferred embodiment, one master is assigned to carry out the entire system configuration process. The master provides a series of unique device ID numbers for each unique device connected to the bus system. In the preferred embodiment, each device connected to the bus contains a special device-type register which specifies the type of device, for instance CPU, 4 MBit memory, 64 MBit memory or disk controller. The configuration master should check each device, determine the device type and set appropriate control registers, including access-time registers 173. The configuration master should check each memory device and set all appropriate memory address registers 172.
[0094] One means to set up unique device ID numbers is to have each device to select a device ID in sequence and store the value in an internal device ID register 171. For example, a master can pass sequential device ID numbers through shift registers in each of a series of devices, or pass a token from device to device whereby the device with the token reads in device ID information from another line or lines. In a preferred embodiment, device ID numbers are assigned to devices according to their physical relationship, for instance, their order along the bus.
[0095] In a preferred embodiment of this invention, the device ID setting is accomplished using a pair of pins on each device, ResetIn and ResetOut. These pins handle normal logic signals and are used only during device ID configuration. On each rising edge of the clock, each device copies ResetIn (an input) into a four-stage reset shift register. The output of the reset shift register is connected to ResetOut, which in turn connects to ResetIn for the next sequentially connected device. Substantially all devices on the bus are thereby daisy-chained together. A first reset signal, for example, while ResetIn at a device is a logical 1, or when a selected bit of the reset shift register goes from zero to non-zero, causes the device to hard reset, for example by clearing all internal registers and resetting all state machines. A second reset signal, for example, the falling edge of ResetIn combined with changeable values on the external bus, causes that device to latch the contents of the external bus into the internal device ID register (Device[0:7]).
[0096] To reset all devices on a bus, a master sets the ResetIn line of the first device to a “1” for long enough to ensure that all devices on the bus have been reset (4 cycles times the number of devices—note that the maximum number of devices on the preferred bus configuration is 256 (8 bits), so that 1024 cycles is always enough time to reset all devices.) Then ResetIn is dropped to “0” and the BusData lines are driven with the first followed by successive device ID numbers, changing after every 4 clock pulses. Successive devices set those device ID numbers into the corresponding device ID register as the falling edge of ResetIn propagates through the shift registers of the daisy-chained devices. FIG. 14 shows ResetIn at a first device going low while a master drives a first device ID onto the bus data lines BusData[0:3]. The first device then latches in that first device ID. After four clock cycles, the master changes BusData[0:3] to the next device ID number and ResetOut at the first device goes low, which pulls ResetIn for the next daisy-chained device low, allowing the next device to latch in the next device ID number from BusData[0:3]. In the preferred embodiment, one master is assigned device ID 0 and it is the responsibility of that master to control the ResetIn line and to drive successive device ID numbers onto the bus at the appropriate times. In the preferred embodiment, each device waits two clock cycles after ResetIn goes low before latching in a device ID number from BusData[0:3].
[0097] Persons skilled in the art recognize that longer device ID numbers could be distributed to devices by having each device read in multiple bytes from the bus and latch the values into the device ID register. Persons skilled in the art also recognize that there are alternative ways of getting device ID numbers to unique devices. For instance, a series of sequential numbers could be clocked along the ResetIn line and at a certain time each device could be instructed to latch the current-reset shift register value into the device ID register.
[0098] The configuration master should choose and set an access time in each access-time register 173 in each slave to a period sufficiently along to allow the slave to perform an actual, desired memory access. For example, for a normal DRAM access, this time must be longer than the row address strobe (RAS) success time. If this condition is not met, the slave may not deliver the correct data. The value stored in a slave access-time register 173 is preferably one-half the number of bus cycles for which the slave device should wait before using the bus in response to a request. Thus an access time value of ‘1’ would indicate that the slave should not access the bus until at least two cycles after the last byte of the request packet has been received. The value of AccessRegO is preferably fixed at 8 (cycles) to facilitate access to control registers.
[0099] The bus architecture of this invention can include more than one master device. The reset or initialization sequence should also include a determination of whether there are multiple masters on the bus, and if so to assign unique master ID numbers to each. Persons skilled in the art will recognize that there are many ways of doing this. For instance, the master could poll each device to determine what type of device it is, for example, by reading a special register then, for each master device, write the next available master ID number into a special register.
ECC
[0100] Error detection and correction (“ECC”) methods well known in the art can be implemented in this system. ECC information typically is calculated for a block of data at the time that block of data is first written into memory. The data block usually has an integral binary size, e.g. 256 bits, and the ECC information uses significantly fewer bits. A potential problem arises in that each binary data block in prior art schemes typically is stored with the ECC bits appended, resulting in a block size that is not an integral binary power.
[0101] In a preferred embodiment of this invention, ECC information is stored separately from the corresponding data, which can then be stored in blocks having integral binary size. ECC information and corresponding data can be stored, for example, in separate DRAM devices. Data can be read without ECC using a single request packet, but to write or read error-corrected data requires two request packets, one for the data and a second for the corresponding ECC information. ECC information may not always be stored permanently and in some situations the ECC information may be available without sending a request packet or without a bus data block transfer.
[0102] In a preferred embodiment, a standard data block size can be selected for use with ECC, and the ECC method will determine the required number of bits of information in a corresponding ECC block. RAMs containing ECC information can be programmed to store an access time that is equal to: (1) the access time of the normal RAM (containing data) plus the time to access a standard data block (for corrected data) minus the time to send a request packet (6 bytes); or (2) the access time of a normal RAM minus the time to access a standard ECC block minus the time to send a request packet. To read a data block and the corresponding ECC block, the master simply issues a request for the data immediately followed by a request for the ECC block. The ECC RAN will wait for the selected access time then drive its data onto the bus right after (in case (1) above)) the data RAM has finished driving out the data block. Persons skilled in the art will recognize that the access time described in case 920 above can be used to drive ECC data before the data is driven onto the bus lines and will recognize that writing data can be done by analogy with the method described for a read. Persons skilled in the art will also recognize the adjustments that must be made in the bus-busy structure and the request packet arbitration methods of this invention in order to accommodate these paired ECC response.
[0103] Since this system is quite flexible, the system designer can choose the size of the data blocks and the number of ECC bits using the memory devices of this invention. Note that the data stream on the bus can be interpreted in various ways. For instance the sequence can be 2n data bytes followed by 2m ECC bytes (or vice versa), or the sequence can be 2k iterations of 8 data bytes plus 1 ECC byte. Other information, such as information used by a directory-based cache coherence scheme, can also be managed this way. See, for example, Anant Agarwal, et al., “Scaleable Directory Schemes for Cache Consistency,” 15th International Symposium on Computer Architecture, June 1988, pp. 280–289. Those skilled in the art will recognize alternative methods of implementing ECC schemes that are within the teachings of this invention.
Low Power 3-D Packaging
[0104] Another major advantage of this invention is that it drastically reduces the memory system power consumption. Nearly all the power consumed by a prior art DRAM is dissipated in performing row access. By using a single row access in a single RAM to supply all the bits for a block request (compared to a row-access in each of multiple RAMs in conventional memory systems) the power per bit can be made very small. Since the power dissipated by memory devices using this invention is significantly reduced, the devices potentially can be placed much closer together than with conventional designs.
[0105] The bus architecture of this invention makes possible an innovative 3-D packaging technology. By using a narrow, multiplexed (time-shared) bus, the pin count for an arbitrarily large memory device can be kept quite small—on the order of 20 pins. Moreover, this pin count can be kept constant from one generation of DRAM density to the next. The low power dissipation allows each package to be smaller, with narrower pin pitches (spacing between the IC pins). With current surface mount technology supporting pin pitches as low as 20 mils, all off-device connections can be implemented on a single edge of the memory device. Semiconductor die useful in this invention preferably have connections or pads along one edge of the die which can then be wired or otherwise connected to the package pins with wires having similar lengths. This geometry also allows for very short leads, preferably with an effective lead length of less than 4 mm. Furthermore, this invention uses only bused interconnections, i.e., each pad on each device is connected by the bus to the corresponding pad of each other device.
[0106] The use of a low pin count and an edge-connected bus permits a simple 3-D package, whereby the devices are stacked and the bus is connected along a single edge of the stack. The fact that all of the signals are bused is important for the implementation of a simple 3-D structure. Without this, the complexity of the “backplane” would be too difficult to make cost effectively with current technology. The individual devices in a stack of the present invention can be packed quite tightly because of the low power dissipated by the entire memory system, permitting the devices to be stacked bumper-to-bumper or top to bottom. Conventional plastic-injection molded small outline. (SO) packages can be used with a pitch of about 2.5 mm (100 mils), but the ultimate limit would be the device die thickness, which is about an order of magnitude smaller, 0.2–0.5 mm using current wafer technology.
Bus Electrical Description
[0107] By using devices with very low power dissipation and close physical packing, the bus can be made quite short, which in turn allows for short propagation times and high data rates. The bus of a preferred embodiment of the present invention consists of a set of resistor-terminated controlled impedance transmission lines which can operate up to a data rate of 500 MHz (2 ns cycles). The characteristics of the transmission lines are strongly affected by the loading caused by the DRAMs (or other slaves) mounted on the bus. These devices add lumped capacitance to the lines which both lowers the impedance of the lines and decreases the transmission speed. In the loaded environment, the bus impedance is likely to be on the order of 25 ohms and the propagation velocity about c/4 (c=the speed of light) or 7.5 cm/ns. To operate at a 2 ns data rate, the transit time on the bus should preferably be kept under 1 ns, to leave 1 ns for the setup and hold time of the input receivers (described below) plus clock skew. Thus the bus lines must be kept quite short, under about 8 cm for maximum performance. Lower performance systems may have much longer lines, e.g. a 4 ns bus may have 24 cm lines (3 ns transit time, 1 ns setup and hold time).
[0108] In the preferred embodiment, the bus uses current source drivers. Each output must be able to sink 50 mA, which provides an output swing of about 500 mV or more. In the preferred embodiment of this invention, the bus is active low. The unasserted state (the high value) is preferably considered a logical zero, and the asserted value (low state) is therefore a logical 1. Those skilled in the art understand that the method of this invention can also be implemented using the opposite logical relation to voltage. The value of the unasserted state is set by the voltage on the termination resistors, and should be high enough to allow the outputs to act as current sources, while being as low as possible to reduce power dissipation. These constraints may yield a termination voltage about 2V above ground in the preferred implementation. Current source drivers cause the output voltage to be proportional to the sum of the sources driving the bus.
[0109] Referring to FIGS. 7A and 7B , although there is no stable condition where two devices drive the bus at the same time, conditions can arise because of propagation delay on the wires where one device, A 41, can start driving its part of the bus 44 while the bus is still being driven by another device, B 42 (already asserting a logical 1 on the bus). In a system using current drivers, when B 42 is driving the bus (before time 46), the value at points 44 and 45 is logical 1. If B 42 switches off at time 46 just when A 41 switches on, the additional drive by device A 41 causes the voltage at the output 44 of A 41 to drop briefly below the normal value. The voltage returns to its normal value at time 47 when the effect of device B 42 turning off is felt. The voltage at point 45 goes to logical 0 when device B 42 turns off, then drops at time 47 when the effect of device A 41 turning on is felt. Since the logical 1 driven by current from device A 41 is propagated irrespective of the previous value on the bus, the value on the bus is guaranteed to settle after one time of flight (tf) delay, that is, the time it takes a signal to propagate from one end of the bus to the other. If a voltage drive was used (as in ECL wired-ORing), a logical 1 on the bus (from device B 42 being previously driven) would prevent the transition put out by device A 41 being felt at the most remote part of the system, e.g., device 43, until the turnoff waveform from device B 42 reached device A 41 plus one time of flight delay, giving a worst case settling time of twice the time of flight delay.
Clocking
[0110] Clocking a high speed bus accurately without introducing error due to propagation delays can be implemented by having each device monitor two bus clock signals and then derive internally a device clock, the true system clock. The bus clock information can be sent on one or two lines to provide a mechanism for each bused device to generate an internal device clock with zero skew relative to all the other device clocks. Referring to FIG. 8A , in the preferred implementation, a bus clock generator 50 at one end of the bus propagates an early bus clock signal in one direction along the bus, for example on line 53 from right to left, to the far end of the bus. The same clock signal then is passed through the direct connection shown to a second line 54, and returns as a late bus clock signal along the bus from the far end to the origin, propagating from left to right. A single bus clock line can be used if it is left unterminated at the far end of the bus, allowing the early bus clock signal to reflect back along the same line as a late bus clock signal.
[0111] FIG. 8 b illustrates how each device 51, 52 receives each of the two bus clock signals at a different time (because of propagation delay along the wires), with constant midpoint in time between the two bus clocks along the bus. At each device 51, 52, the rising edge 55 of Clock1 53 is followed by the rising edge 56 of Clock2 54. Similarly, the falling edge 57 of Clock1 53 is followed by the falling edge 58 of Clock2 54. This waveform relationship is observed at all other devices along the bus. Devices which are closer to the clock generator have a greater separation between Clock1 and Clock2 relative to devices farther from the generator because of the longer time required for each clock pulse to traverse the bus and return along line 54, but the midpoint in time 59, 60 between corresponding rising or falling edges is fixed because, for any given device, the length of each clock line between the far end of the bus and that device is equal. Each device must sample the two bus clocks and generate its own internal device clock at the midpoint of the two.
[0112] Clock distribution problems can be further reduced by using a bus clock and device clock rate equal to the bus cycle data rate divided by two, that is, the bus clock period is twice the bus cycle period. Thus a 500 MHz bus preferably uses a 250 MHz clock rate. This reduction in frequency provides two benefits. First it makes all signals on the bus have the same worst case data rates—data on a 500 MHz bus can only change every 2 ns. Second, clocking at half the bus cycle data rate makes the labeling of the odd and even bus cycles trivial, for example, by defining even cycles to be those when the internal device clock is 0 and odd cycles when the internal device clock is 1.
Multiple Buses
[0113] The limitation on bus length described above restricts the total number of devices that can be placed on a single bus. Using 2.5 mm spacing between devices, a single 8 cm bus will hold about 32 devices. Persons skilled in the art will recognize certain applications of the present invention wherein the overall data rate on the bus is adequate but memory or processing requirements necessitate a much larger number of devices (many more than 32). Larger systems can easily be built using the teachings of this invention by using one or more memory subsystems, designated primary bus units, each of which consists of two or more devices, typically 32 or close to the maximum allowed by bus design requirements, connected to a transceiver device.
[0114] Referring to FIG. 9 , each primary bus unit can be mounted on a single circuit board 66, sometimes called a memory stick. Each transceiver device 19 in turn connects to a transceiver bus 65, similar or identical in electrical and other respects to the primary bus 18 described at length above. In a preferred implementation, all masters are situated on the transceiver bus so there are no transceiver delays between masters and all memory devices are on primary bus units so that all memory access experience an equivalent transceiver delay, but persons skilled in the art will recognize how to implement systems which have masters on more than one bus unit and memory devices on the transceiver bus as well as on primary bus units. In general, each teaching of this invention which refers to a memory device can be practiced using a transceiver device and one or more memory devices on an attached primary bus unit. Other devices, generically referred to as peripheral devices, including disk controllers, video controllers or I/O devices can also be attached to either the transceiver bus or a primary bus unit, as desired. Persons skilled in the art will recognize how to use a single primary bus unit or multiple primary bus units as needed with a transceiver bus in certain system designs.
[0115] The transceivers are quite simple in function. They detect request packets on the transceiver bus and transmit them to their primary bus unit. If the request packet calls for a write to a device on a transceiver's primary bus unit, that transceiver keeps track of the access time and block size and forwards all data from the transceiver bus to the primary bus unit during that time. The transceivers also watch their primary bus unit, forwarding any data that occurs there to the transceiver bus. The high speed of the buses means that the transceivers will need to be pipelined, and will require an additional one or two cycle delay for data to pass through the transceiver in either direction. Access times stored in masters on the transceiver bus must be increased to account for transceiver delay but access times stored in slaves on a primary bus unit should not be modified.
[0116] Persons skilled in the art will recognize that a more sophisticated transceiver can control transmissions to and from primary bus units. An additional control line, TrncvrRW can be bused to all devices on the transceiver bus, using that line in conjunction with the AddrValid line to indicate to all devices on the transceiver bus that the information on the data lines is: 1) a request packet, 2) valid data to a slave, 3) valid data from a slave, or 4) invalid data (or idle bus). Using this extra control line obviates the need for the transceivers to keep track of when data needs to be forwarded from its primary bus to the transceiver bus—all transceivers send all data from their primary bus to the transceiver bus whenever the control signal indicates condition 2) above. In a preferred implementation of this invention, if AddrValid and TrncvrRW are both low, there is no bus activity and the transceivers should remain in an idle state. A controller sending a request packet will drive AddrValid high, indicating to all devices on the transceiver bus that a request packet is being sent which each transceiver should forward to its primary bus unit. Each controller seeking to write to a slave should drive both AddrValid and TrncvrRW high, indicating valid data for a slave is present on the data lines. Each transceiver device will then transmit all data from the transceiver bus lines to each primary bus unit. Any controller expecting to receive information from a slave should also drive the TrncvrRW line high, but not drive AddrValid, thereby indicating to each transceiver to transmit any data coming from any slave on its primary local bus to the transceiver bus. A still more sophisticated transceiver would recognize signals addressed to or coming from its primary bus unit and transmit signals only at requested times.
[0117] An example of the physical mounting of the transceivers is shown in FIG. 9 . One important feature of this physical arrangement is to integrate the bus of each transceiver 19 with the original bus of DRAMs or other devices 15, 16, 17 on the primary bus unit 66. The transceivers 19 have pins on two sides, and are preferably mounted flat on the primary bus unit with a first set of pins connected to primary bus 18. A second set of transceiver pins 20, preferably orthogonal to the first set of pins, are oriented to allow the transceiver 19 to be attached to the transceiver bus 65 in much the same way as the DRAMs were attached to the primary bus unit. The transceiver bus can be generally planar and in a different plane, preferably orthogonal to the plane of each primary bus unit. The transceiver bus can also be generally circular with primary bus units mounted perpendicular and tangential to the transceiver bus.
[0118] Using this two level scheme allows one to easily build a system that contains over 500 slaves (16 buses of 32 DRAMs each). Persons skilled in the art can modify the device ID scheme described above to accommodate more than 256 devices, for example by using a longer device ID or by using additional registers to hold some of the device ID. This scheme can be extended in yet a third dimension to make a second-order transceiver bus, connecting multiple transceiver buses by aligning transceiver bus units parallel to and on top of each other and busing corresponding signal lines through a suitable transceiver. Using such a second-order transceiver bus, one could connect many thousands of slave devices into what is effectively a single bus.
Device Interface
[0119] The device interface to the high-speed bus can be divided into three main parts. The first part is the electrical interface. This part includes the input receivers, bus drivers and clock generation circuitry. The second part contains the address comparison circuitry and timing registers. This part takes the input request packet and determines if the request is for this device, and if it is, starts the internal access and delivers the data to the pins at the correct time. The final part, specifically for memory devices such as DRAMs, is the DRAM column access path. This part needs to provide bandwidth into and out of the DRAM sense amps greater than the bandwidth provided by conventional DRAMs. The implementation of the electrical interface and DRAM column access path are described in more detail in the following sections. Persons skilled in the art recognize how to modify prior-art address comparison circuitry and prior-art register circuitry in order to practice the present invention.
Electrical Interface—Input/Output Circuitry
[0120] A block diagram of the preferred input/output circuit for address/data/control lines is shown in FIG. 10 . This circuitry is particularly well-suited for use in DRAM devices but it can be used or modified by one skilled in the art for use in other devices connected to the bus of this invention. It consists of a set of input receivers 71, 72 and output driver 76 connected to input/output line 69 and 75 and circuitry to use the internal clock 73 and internal clock complement 74 to drive the input interface. The clocked input receivers take advantage of the synchronous nature of the bus. To further reduce the performance requirements for device input receivers, each device pin, and thus each bus line, is connected to two clocked receivers, one to sample the even cycle inputs, the other to sample the odd cycle inputs. By thus de-multiplexing the input 69 at the pin, each clocked amplifier is given a full 2 ns cycle to amplify the bus low-voltage-swing signal into a full value CMOS logic signal. Persons skilled in the art will recognize that additional clocked input receivers can be used within the teachings of this invention. For example, four input receivers could be connected to each device pin and clocked by a modified internal device clock to transfer sequential bits from the bus to internal device circuits, allowing still higher external bus speeds or still longer settling times to amplify the bus low-voltage-swing signal into a full value CMOS logic signal.
[0121] The output drivers are quite simple, and consist of a single NMOS pulldown transistor 76. This transistor is sized so that under worst case conditions it can still sink the 50 mA required by the bus. For 0.8 micron CMOS technology, the transistor will need to be about 200 microns long. Overall bus performance can be improved by using feedback techniques to control output transistor current so that the current through the device is roughly 50 mA under all operating conditions, although this is not absolutely necessary for proper bus operation. An example of one of many methods known to persons skilled in the art for using feedback techniques to control current is described in Hans Schumacher, et al., “CMOS Subnanosecond True-ECL Output Buffer,” J. Solid State Circuits, Vol. 25 (1), pp. 150–154 (Feb. 1990). Controlling this current improves performance and reduces power dissipation. This output driver which can be operated at 500 MHz, can in turn be controlled by a suitable multiplexer with two or more (preferably four) inputs connected to other internal chip circuitry, all of which can be designed according to well known prior art.
[0122] The input receivers of every slave must be able to operate during every cycle to determine whether the signal on the bus is a valid request packet. This requirement leads to a number of constraints on the input circuitry. In addition to requiring small acquisition and resolution delays, the circuits must take little or no DC power, little AC power and inject very little current back into the input or reference lines. The standard clocked DRAM sense amp shown in FIG. 11 satisfies all these requirements except the need for low input currents. When this sense amp goes from sense to sample, the capacitance of the internal nodes 83 and 84 in FIG. 11 is discharged through the current is small, but the sum of such currents from all the inputs into the reference lines summed over all devices can be reasonably large.
[0123] The fact that the sign of the current depends upon on the previous received data makes matters worse. One way to solve this problem is to divide the sample period into two phases. During the first phase, the inputs are shorted to a buffered version of the reference level (which may have an offset).
[0124] During the second phase, the inputs are connected to the true inputs. This scheme does not remove the input current completely, since the input must still charge nodes 83 and 84 from the reference value to the current input value, but it does reduce the total charge required by about a factor of 10 (requiring only a 0.25V change rather than a 2.5V change).
[0125] Persons skilled in the art will recognize that many other methods can be used to provide a clocked amplifier that will operate on very low input currents.
[0126] One important part of the input/output circuitry generates an internal device clock based on early and late bus clocks. Controlling clock skew (the difference in clock timing between devices) is important in a system running with 2 ns cycles, thus the internal device clock is generated so the input sampler and the output driver operate as close in time as possible to midway between the two bus clocks.
[0127] A block diagram of the internal device clock generating circuit is shown in FIG. 12 and the corresponding timing diagram in FIG. 13 . The basic idea behind this circuit is relatively simple. A DC amplifier 102 is used to convert the small swing bus clock into a full-swing CMOS signal. This signal is then fed into a variable delay line 103. The output of delay line 103 feeds three additional delay lines: 104 having a fixed delay; 105 having the same fixed delay plus a second variable delay; and 106 having the same fixed delay plus one half of the second variable delay. The outputs 107, 108 of the delay lines 104 and 105 drive clocked input receivers 101 and 111 connected to early and late bus clock inputs 100 and 110, respectively. These input receivers 101 and 111 have the same design as the receivers described above and shown in FIG. 11 . Variable delay lines 103 and 105 are adjusted via feedback lines 116, 115 so that input receivers 101 and 111 sample the bus clocks just as they transition. Delay lines 103 and 105 are adjusted so that the falling edge 120 of output 107 precedes the falling edge 121 of the early bus clock, Clock1 53, by an amount of time 128 equal to the delay in input sampler 101. Delay line 108 is adjusted in the same way so that falling edge 122 precedes the falling edge 123 of late bus clock, Clock2 54, by the delay 128 in input sampler 111.
[0128] Since the outputs 107 and 108 are synchronized with the two bus clocks and the output 73 of the last delay line 106 is midway between outputs 107 and 108, that is, output 73 follows output 107 by the same amount of time 129 that output 73 precedes output 108, output 73 provides an internal device clock midway between the bus clocks. The falling edge 124 of internal device clock 73 precedes the time of actual input sampling 125 by one sampler delay. Note that this circuit organization automatically balances the delay in substantially all device input receivers 71 and 72 (FIG. 10 ), since outputs 107 and 108 are adjusted so the bus clocks are sampled by input receivers 101 and 111 just as the bus clocks transition.
[0129] In the preferred embodiment, two sets of these delay lines are used, one to generate the true value of the internal device clock 73, and the other to generate the complement 74 without adding any inverter delay. The dual circuit allows generation of truly complementary clocks, with extremely small skew. The complement internal device clock is used to clock the ‘even’ input receivers to sample at time 127, while the true internal device clock is used to clock the ‘odd’ input receivers to sample at time 125. The true and complement internal device clocks 73 and 74, respectively, are also used to select which data is driven to the output drivers. The gate delay between the internal device clock and output circuits driving the bus is slightly greatly than the output circuits driving the bus is slightly greater than the corresponding delay for the input circuits, which means that the new data always will be driven on the bus slightly after the old data has been sampled.
DRAM Column Access Modification
[0130] A block diagram of a conventional 4 MBit DRAM 130 is shown in FIG. 15 . The DRAM memory array is divided into a number of subarrays 150–157, for example, 8. Each subarray is divided into arrays 148, 149 of memory cells. Row address selection is performed by decoders 146. A column decoder 147A, 147B, including column sense amps on either side of the decoder, runs through the core of each subarray. These column sense amps can be set to precharge or latch the most-recently stored value, as described in detail above. Internal I/O lines connect each set of sense-amps, as gated by corresponding column decoders, to input and output circuitry connected ultimately to the device pins. These internal I/O lines are used to drive the data from the selected bit lines to the data pins (some of pins 131–145), or to take the data from the pins and write the selected bit lines. Such a column access path organized by prior art constraints does not have sufficient bandwidth to interface with a high speed bus. The method of this invention does not require changing the overall method used for column access, but does change implementation details. Many of these details have been implemented selectively in certain fast memory devices, but never in conjunction with the bus architecture of this invention.
[0131] Running the internal I/O lines in the conventional way at high bus cycle rates is not possible. In the preferred method, several (preferably 4) bytes are read or written during each cycle and the column access path is modified to run at lower rate (the inverse of the number of bytes accessed per cycle, preferably ¼ of the bus cycle rate). Three different techniques are used to provide the additional internal I/O lines required and to supply data to memory cells at this rate. First, the number of I/O bit lines in each subarray running through the column decoder 147A and 147B is increased, for example, to 16, eight for each of the two columns of column sense amps and the column decoder selects one set of columns from the “top” half 148 of subarray 150 and one set of columns from the “bottom” half 149 during each cycle, where the column decoder selects one column sense amp per I/O bit line. Second, each column I/O line is divided into two halves, carrying data independently over separate internal I/O lines from the left half 147A and right half 147B of each subarray (dividing each subarray into quadrants) and the column decoder selects sense amps from each right and left half of the subarray, doubling the number of bits available at each cycle. Thus each column decode selection turns on n column sense amps, where n equals four (top left and right, bottom left and right quadrants) times the number of I/O lines in the bus to each subarray quadrant (8 lines each×4=32 lines in the preferred implementation). Finally, during each RAS cycle, two different subarrays, e.g. 157 and 153, are accessed. This doubles again the available number of I/O lines containing data. Taken together, these changes increase the internal I/O bandwidth by at least a factor of 8. Four internal buses are used to route these internal I/O lines. Increasing the number of I/O lines and then splitting them in the middle greatly reduces the capacitance of each internal I/O line which in turn reduces the column access time, increasing the column access bandwidth even further.
[0132] The multiple, gated input receivers described above allow high speed input from the device pins onto the internal I/O lines and ultimately into memory. The multiplexed output driver described above is used to keep up with the data flow available using these techniques. Control means are provided to select whether information at the device pins should be treated as an address, and therefore to be decoded, or input or output data to be driven onto or read from the internal I/O lines.
[0133] Each subarray can access 32 bits per cycle, 16 bits from the left subarray and 16 from the right subarray. With 8 I/O lines per sense-amplifier column and accessing two subarrays at a time, the DRAM can provide 64 bits per cycle. This extra I/O bandwidth is not needed for reads (and is probably not used), but may be needed for writes. Availability of write bandwidth is a more difficult problem than read bandwidth because over-writing a value in a sense-amplifier may be a slow operation, depending on how the sense amplifier is connected to the bit line. The extra set of internal I/O lines provides some bandwidth margin for write operations.
[0134] Persons skilled in the art will recognize that many variations of the teachings of this invention can be practiced that still fall within the claims of this invention which follow.
Claims
What is claimed is:
1. A memory module comprising:
a plurality of memory devices; and
an integrated circuit device, coupled to the plurality of memory devices, the integrated circuit device including:
a first circuit to receive:
control information specifying a write operation; and
address information specifying a memory location corresponding to the write operation, wherein the memory location is in a first memory device of the plurality of memory devices, and wherein the control information and the address information are received in a multiplexed format; and
a second circuit, including a plurality of output drivers, to output data after a first number of clock cycles of an external clock signal transpire, wherein the data is to be written to the first memory device during the write operation.
2. The memory module of claim 1, wherein:
the integrated circuit device receives control information specifying a read operation;
the integrated circuit device outputs an operation code corresponding to the read operation to the first memory device;
the first memory device outputs read data in response to the operation code; and
the integrated circuit device further comprises a plurality of input receivers to receive the read data after a second number of clock cycles of the external clock signal transpire.
3. The memory module of claim 1, wherein the plurality of output drivers of the second circuit includes output drivers to output a value to the first memory device, wherein the value is representative of the first number of clock cycles of the external clock signal, wherein the first memory device stores the value in a register.
4. The memory module of claim 1, wherein the integrated circuit device receives a value that is representative of the first number of clock cycles of the external clock signal, and wherein the plurality of output drivers of the second circuit includes output drivers to output the value to the first memory device, wherein the first memory device stores the value in a register.
5. The memory module of claim 1, wherein the plurality of output drivers of the second circuit includes output drivers to output, to the first memory device, a value that indicates an amount of the data output to the first memory device.
6. The memory module of claim 1, wherein the plurality of output drivers of the second circuit includes output drivers to output a value, to the first memory device, that is representative of a data transfer amount associated with a data transfer operation involving the first memory device.
7. The memory module of claim 1, wherein the plurality of output drivers of the second circuit includes at least one output driver to output information that represents a range of addresses to the first memory device, wherein the information uniquely identifies the first memory device from other memory devices of the plurality of memory devices.
8. The memory module of claim 1, wherein the plurality of output drivers of the second circuit includes at least one output driver to output a device identification value to the first memory device, wherein the device identification value uniquely identifies the first memory device from other memory devices of the plurality of memory devices.
9. The memory module of claim 1, wherein the integrated circuit device forwards the address information to the first memory device.
10. The memory module of claim 1, wherein the integrated circuit device forwards the control information to the first memory device.
11. The memory module of claim 1, further including a bus coupling the first memory device to the integrated circuit device, wherein the plurality of output drivers outputs, in a multiplexed format, the control information and the address information to the first memory device using the bus.
12. The memory module of claim 1, wherein the first circuit receives the control information and the address information in a packet format, and wherein the first circuit includes a receiver to receive a signal that indicates the beginning of a packet.
13. The memory module of claim 1, wherein the integrated circuit device stores a value that is representative of the number of clock cycles of the external clock signal.
14. The memory module of claim 1, wherein each output driver of the plurality of output drivers outputs two bits of the data during a single clock cycle of the external clock signal.
15. The memory module of claim 1, wherein the integrated circuit device further includes a third circuit to generate a first internal clock signal, wherein the third circuit includes a feedback loop to control the timing relationship of the first internal clock signal with respect to the external clock signal, wherein the plurality of output drivers outputs the data using the internal clock signal.
16. The memory module of claim 15, wherein the third circuit further generates a second internal clock signal, wherein the first and second internal clock signals are complementary, and wherein the plurality of output drivers further outputs a first portion of the data using the first internal clock signal and the plurality of output drivers outputs a second portion of the data, in succession to the first portion of the data, using the second internal clock signal.
17. The memory module of claim 16, wherein the integrated circuit device receives the external clock signal and a delayed version of the external clock signal, wherein:
transition of the first internal clock signal occurs between a rising edge transition of the clock signal and a rising edge transition of the delayed version of the external clock signal; and
the second internal clock signal is generated such that a transition of the second internal clock signal occurs between a falling edge transition of the external clock signal and a falling edge transition of the delayed version of the external clock signal.
18. The memory module of claim 17, further including:
a first clock line coupled to the integrated circuit device, wherein the integrated circuit device receives the external clock signal from the first clock line; and
a second clock line coupled to the integrated circuit device, wherein the integrated circuit device receives the delayed version of the external clock signal from the second clock line.
19. The memory module of claim 18, wherein the first clock line is coupled to the second clock line, and wherein the first memory device is coupled to the first clock line to receive the external clock signal, and the first memory device is coupled to the second clock line to receive the delayed version of the external clock signal.
20. The memory module of claim 1, wherein output drivers, of the plurality of output drivers provide to the first memory device, control information includes information specifying whether the first memory device is to precharge a plurality of sense amplifiers after performing the write operation, wherein the sense amplifiers are used to write the data to the memory array during the write operation.
21. A method of operation in a memory module that includes a plurality of memory devices and an integrated circuit device, the method comprising:
receiving at pins of the integrated circuit device, in a multiplexed format, control information and address information, the control information specifying a write operation, and the address information specifying a location within a memory array for the write operation, wherein the memory array is located on a first memory device of the plurality of memory devices;
outputting to the memory device, an operation code that corresponds to the write operation; and
receiving at pins of the first memory device, data to be written to the memory array during the write operation, after a predetermined number of clock cycles of an external clock signal transpire, wherein the data is received in response to the operation code.
22. The method of claim 21, further including:
receiving at pins of the integrated circuit device, control information specifying a read operation;
outputting an operation code that corresponds to the control information to the first memory device, wherein the first memory device outputs read data in response to the operation code; and
sampling the read data, output by the first memory device, after a delay time transpires, wherein the sampling is done by input receivers on the integrated circuit device such that each input receiver samples two bits of the read data during a single clock cycle of the external clock signal.
23. The method of claim 21, further including outputting a value to the first memory device, wherein the value is representative of the predetermined number of clock cycles of the external clock signal.
24. The method of claim 21, further including:
receiving a value that is representative of the predetermined number of clock cycles of the external clock signal; and
outputting the value to the first memory device.
25. The method of claim 21, further including outputting to the first memory device, a value that indicates an amount of the data that the first memory device receives from the integrated circuit device.
26. The method of claim 21, further including outputting the data by output drivers on the integrated circuit device such that each output driver outputs two bits of the data for during a single clock cycle of the external clock signal.
27. The method of claim 21, further including forwarding the address information to the first memory device.
28. The method of claim 21, further including forwarding the control information to the first memory device.
29. The method of claim 21, further including:
generating a first internal clock signal using the external clock signal; and
controlling a timing relationship between the first internal clock signal and the external clock signal using a feedback loop;
wherein outputting data includes outputting data using the first internal clock signal.
30. The method of claim 29, further including generating a second internal clock signal, wherein the first and second internal clock signals are complementary, and wherein outputting data includes outputting the data using the second internal clock signal.
31. A memory module comprising:
a plurality of memory devices including a first memory device; and
an integrated circuit device, coupled to the plurality of memory devices, the integrated circuit device including:
means for receiving control information and address information in a multiplexed format, the control information specifying a write operation, and the address information specifying a memory location in the first memory device for the write operation;
means for outputting an operation code, corresponding to the write operation, to the memory device; and
means for outputting data after a predetermined number of clock cycles of an external clock signal transpire from outputting the operation code, wherein the data is to be written to the memory array during the write operation.
Patent Citations (239)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3691534(A) | 1972-09-01 | Veradi et al. | Applicant |
| US3771145(A) | 1973-11-01 | Wiener | Applicant |
| US3821715(A) | 1974-06-01 | Hoff, Jr. et al. | Applicant |
| US3846763(A) | 1974-11-01 | Riikonen | Applicant |
| US3950735(A) | 1976-04-01 | Patel | Applicant |
| US3969706(A) | 1976-07-01 | Proebsting et al. | Applicant |
| US4084154(A) | 1978-04-01 | Panigrahi | Applicant |
| US4092665(A) | 1978-05-01 | Saran | Applicant |
| US4099231(A) | 1978-07-01 | Kotok et al. | Applicant |
| US4183095(A) | 1980-01-01 | Ward | Applicant |
| US4205373(A) | 1980-05-01 | Shah et al. | Applicant |
| US4206833(A) | 1980-06-01 | Goyarts | Applicant |
| US4247817(A) | 1981-01-01 | Heller | Applicant |
| US4253147(A) | 1981-02-01 | MacDougall et al. | Applicant |
| US4257097(A) | 1981-03-01 | Moran | Applicant |
| US4286321(A) | 1981-08-01 | Baker et al. | Applicant |
| US4315308(A) | 1982-02-01 | Jackson | Applicant |
| US4330852(A) | 1982-05-01 | Redwine et al. | Applicant |
| US4360870(A) | 1982-11-01 | McVey | Applicant |
| US4375665(A) | 1983-03-01 | Schmidt | Applicant |
| US4379222(A) | 1983-04-01 | Hayter et al. | Applicant |
| US4394753(A) | 1983-07-01 | Penzel | Applicant |
| US4398248(A) | 1983-08-01 | Hsia et al. | Examiner |
| US4408272(A) | 1983-10-01 | Walters | Applicant |
| US4426685(A) | 1984-01-01 | Lorentzen | Applicant |
| US4445204(A) | 1984-04-01 | Nishiguchi | Applicant |
| US4468733(A) | 1984-08-01 | Oka et al. | Applicant |
| US4470114(A) | 1984-09-01 | Gerhold | Applicant |
| US4480307(A) | 1984-10-01 | Budde et al. | Applicant |
| US4481625(A) | 1984-11-01 | Roberts et al. | Applicant |
| US4493021(A) | 1985-01-01 | Agrawal et al. | Applicant |
| US4494021(A) | 1985-01-01 | Bell et al. | Applicant |
| US4499536(A) | 1985-02-01 | Gemma et al. | Applicant |
| US4506348(A) | 1985-03-01 | Miller et al. | Applicant |
| US4509142(A) | 1985-04-01 | Childers | Applicant |
| US4513372(A) | 1985-04-01 | Ziegler et al. | Applicant |
| US4519034(A) | 1985-05-01 | Smith et al. | Applicant |
| US4520465(A) | 1985-05-01 | Sood | Applicant |
| US4528646(A) | 1985-07-01 | Ochii et al. | Applicant |
| US4536795(A) | 1985-08-01 | Hirota et al. | Applicant |
| US4539658(A) | 1985-09-01 | Shimohigashi et al. | Examiner |
| US4562435(A) | 1985-12-01 | McDonough et al. | Applicant |
| US4570220(A) | 1986-02-01 | Tetrick et al. | Applicant |
| US4597019(A) | 1986-06-01 | Nishimoto et al. | Applicant |
| US4628489(A) | 1986-12-01 | Ong et al. | Applicant |
| US4629909(A) | 1986-12-01 | Cameron | Applicant |
| US4630193(A) | 1986-12-01 | Kris | Applicant |
| US4631659(A) | 1986-12-01 | Hayn, II et al. | Applicant |
| US4637018(A) | 1987-01-01 | Flora et al. | Applicant |
| US4639890(A) | 1987-01-01 | Heilveil et al. | Applicant |
| US4641276(A) | 1987-02-01 | Dunki-Jacobs | Applicant |
| US4644469(A) | 1987-02-01 | Sumi | Applicant |
| US4644532(A) | 1987-02-01 | George et al. | Applicant |
| US4648102(A) | 1987-03-01 | Riso et al. | Applicant |
| US4649511(A) | 1987-03-01 | Gdula | Applicant |
| US4663735(A) | 1987-05-01 | Novak et al. | Applicant |
| US4667305(A) | 1987-05-01 | Dill et al. | Applicant |
| US4675850(A) | 1987-06-01 | Kumanoya et al. | Applicant |
| US4680738(A) | 1987-07-01 | Tam | Applicant |
| US4685088(A) | 1987-08-01 | Iannucci | Applicant |
| US4688197(A) | 1987-08-01 | Novak et al. | Applicant |
| US4703418(A) | 1987-10-01 | James | Applicant |
| US4710904(A) | 1987-12-01 | Suzuki | Applicant |
| US4712194(A) | 1987-12-01 | Yamaguchi et al. | Applicant |
| US4726021(A) | 1988-02-01 | Horiguchi et al. | Applicant |
| US4734880(A) | 1988-03-01 | Collins | Applicant |
| US4739502(A) | 1988-04-01 | Nozaki | Applicant |
| US4744062(A) | 1988-05-01 | Nakamura et al. | Applicant |
| US4747079(A) | 1988-05-01 | Yamaguchi | Applicant |
| US4747081(A) | 1988-05-01 | Heilveil et al. | Applicant |
| US4747100(A) | 1988-05-01 | Roach et al. | Applicant |
| US4754433(A) | 1988-06-01 | Chin et al. | Applicant |
| US4755937(A) | 1988-07-01 | Glier | Applicant |
| US4757473(A) | 1988-07-01 | Kurihara et al. | Applicant |
| US4761567(A) | 1988-08-01 | Walters, Jr. et al. | Applicant |
| US4763249(A) | 1988-08-01 | Bomba et al. | Applicant |
| US4766536(A) | 1988-08-01 | Wilson, Jr. et al. | Applicant |
| US4782439(A) | 1988-11-01 | Borkar et al. | Applicant |
| US4785394(A) | 1988-11-01 | Fischer | Applicant |
| US4785428(A) | 1988-11-01 | Bajwa et al. | Applicant |
| US4788667(A) | 1988-11-01 | Nakano et al. | Applicant |
| US4789960(A) | 1988-12-01 | Willis | Applicant |
| US4792926(A) | 1988-12-01 | Roberts | Applicant |
| US4799199(A) | 1989-01-01 | Scales, III et al. | Applicant |
| US4807189(A) | 1989-02-01 | Pinkham et al. | Applicant |
| US4811202(A) | 1989-03-01 | Schabowski | Applicant |
| US4811364(A) | 1989-03-01 | Sager et al. | Applicant |
| US4821226(A) | 1989-04-01 | Christopher et al. | Applicant |
| US4825287(A) | 1989-04-01 | Baji et al. | Applicant |
| US4839801(A) | 1989-06-01 | Nicely et al. | Applicant |
| US4845664(A) | 1989-07-01 | Aichelmann, Jr. et al. | Applicant |
| US4845670(A) | 1989-07-01 | Nishimoto et al. | Applicant |
| US4845677(A) | 1989-07-01 | Chappell et al. | Applicant |
| US4849937(A) | 1989-07-01 | Yoshimoto | Applicant |
| US4851990(A) | 1989-07-01 | Johnson et al. | Applicant |
| US4858112(A) | 1989-08-01 | Puerzer et al. | Applicant |
| US4858113(A) | 1989-08-01 | Saccardi | Applicant |
| US4860198(A) | 1989-08-01 | Takenaka | Applicant |
| US4864563(A) | 1989-09-01 | Pavey et al. | Applicant |
| US4870562(A) | 1989-09-01 | Kimoto et al. | Applicant |
| USH696(H) | 1989-10-01 | Davidson | Applicant |
| US4873671(A) | 1989-10-01 | Kowshik et al. | Applicant |
| US4876670(A) | 1989-10-01 | Nakabayashi et al. | Applicant |
| US4878166(A) | 1989-10-01 | Johnson et al. | Applicant |
| US4882712(A) | 1989-11-01 | Ohno et al. | Applicant |
| US4891791(A) | 1990-01-01 | Iijima | Applicant |
| US4901036(A) | 1990-02-01 | Herold et al. | Applicant |
| US4905201(A) | 1990-02-01 | Ohira et al. | Applicant |
| US4912630(A) | 1990-03-01 | Cochcroft, Jr. | Applicant |
| US4916670(A) | 1990-04-01 | Suzuki et al. | Applicant |
| US4920483(A) | 1990-04-01 | Pogue et al. | Applicant |
| US4922141(A) | 1990-05-01 | Lofgren et al. | Applicant |
| US4928265(A) | 1990-05-01 | Higuchi et al. | Applicant |
| US4930065(A) | 1990-05-01 | McLagan et al. | Applicant |
| US4933835(A) | 1990-06-01 | Sachs et al. | Applicant |
| US4933953(A) | 1990-06-01 | Yagi | Applicant |
| US4937733(A) | 1990-06-01 | Gillett, Jr. et al. | Applicant |
| US4937734(A) | 1990-06-01 | Bechtolsheim | Applicant |
| US4941128(A) | 1990-07-01 | Wada et al. | Applicant |
| US4947484(A) | 1990-08-01 | Twitty et al. | Applicant |
| US4951251(A) | 1990-08-01 | Yamaguchi et al. | Applicant |
| US4953128(A) | 1990-08-01 | Kawai et al. | Applicant |
| US4953130(A) | 1990-08-01 | Houston | Applicant |
| US4954987(A) | 1990-09-01 | Auvinen et al. | Applicant |
| US4961171(A) | 1990-10-01 | Pinkham et al. | Applicant |
| US4970418(A) | 1990-11-01 | Masterson | Applicant |
| US4975872(A) | 1990-12-01 | Zaiki | Applicant |
| US4975877(A) | 1990-12-01 | Bell | Applicant |
| US4979145(A) | 1990-12-01 | Remington et al. | Applicant |
| US4982400(A) | 1991-01-01 | Ebersole | Applicant |
| US4998262(A) | 1991-03-01 | Wiggers | Applicant |
| US5001672(A) | 1991-03-01 | Ebbers et al. | Applicant |
| US5006982(A) | 1991-04-01 | Ebersole et al. | Applicant |
| US5012408(A) | 1991-04-01 | Conroy | Applicant |
| US5016226(A) | 1991-05-01 | Hiwada et al. | Applicant |
| US5018111(A) | 1991-05-01 | Madland | Applicant |
| US5023835(A) | 1991-06-01 | Akimoto et al. | Applicant |
| US5023838(A) | 1991-06-01 | Herbert | Applicant |
| US5029124(A) | 1991-07-01 | Leahy et al. | Applicant |
| US5034917(A) | 1991-07-01 | Bland et al. | Applicant |
| US5036495(A) | 1991-07-01 | Busch et al. | Applicant |
| US5040153(A) | 1991-08-01 | Fung et al. | Applicant |
| US5051889(A) | 1991-09-01 | Fung et al. | Applicant |
| US5056060(A) | 1991-10-01 | Fitch et al. | Applicant |
| US5077693(A) | 1991-12-01 | Hardee et al. | Applicant |
| US5083296(A) | 1992-01-01 | Hara et al. | Applicant |
| US5099481(A) | 1992-03-01 | Miller | Applicant |
| US5101117(A) | 1992-03-01 | Johnson et al. | Applicant |
| US5107465(A) | 1992-04-01 | Fung et al. | Applicant |
| US5109498(A) | 1992-04-01 | Kamiya et al. | Applicant |
| US5111423(A) | 1992-05-01 | Kopec, Jr. et al. | Applicant |
| US5111486(A) | 1992-05-01 | Oliboni et al. | Applicant |
| US5121382(A) | 1992-06-01 | Yang et al. | Applicant |
| US5123100(A) | 1992-06-01 | Hisada et al. | Applicant |
| US5133064(A) | 1992-07-01 | Hotta et al. | Applicant |
| US5134699(A) | 1992-07-01 | Aria et al. | Applicant |
| US5140688(A) | 1992-08-01 | White et al. | Applicant |
| US5142637(A) | 1992-08-01 | Harlin et al. | Applicant |
| US5148523(A) | 1992-09-01 | Harlin et al. | Applicant |
| US5153856(A) | 1992-10-01 | Takahashi | Applicant |
| US5157776(A) | 1992-10-01 | Foster | Applicant |
| US5173617(A) | 1992-12-01 | Alsup et al. | Applicant |
| US5179667(A) | 1993-01-01 | Iyer | Applicant |
| US5184027(A) | 1993-02-01 | Masuda et al. | Applicant |
| US5206833(A) | 1993-04-01 | Lee | Applicant |
| US5210715(A) | 1993-05-01 | Houston | Applicant |
| US5251309(A) | 1993-10-01 | Kinoshita et al. | Applicant |
| US5276846(A) | 1994-01-01 | Aichelmann, Jr. et al. | Applicant |
| US5287532(A) | 1994-02-01 | Hunt | Applicant |
| US5301278(A) | 1994-04-01 | Bowater et al. | Applicant |
| US5317723(A) | 1994-05-01 | Heap et al. | Applicant |
| US5361277(A) | 1994-11-01 | Grover | Applicant |
| US5371892(A) | 1994-12-01 | Petersen et al. | Applicant |
| US5390149(A) | 1995-02-01 | Vogley et al. | Applicant |
| US5598554(A) | 1997-01-01 | Litaize et al. | Applicant |
| US5684753(A) | 1997-11-01 | Hashimoto et al. | Applicant |
| US5687183(A) | 1997-11-01 | Chesley | Applicant |
| US5742798(A) | 1998-04-01 | Goldrian | Applicant |
| US5847997(A) | 1998-12-01 | Harada et al. | Applicant |
| US6112287(A) | 2000-08-01 | Litaize et al. | Applicant |
| US6185644(B1) | 2001-02-01 | Farmwald et al. | Applicant |
| US6345321(B1) | 2002-02-01 | Litaize et al. | Applicant |
| EP126976 | 1984-12-01 | Applicant | |
| EP166192 | 1986-01-01 | Applicant | |
| EP187289 | 1986-07-01 | Applicant | |
| EP189576 | 1986-08-01 | Applicant | |
| EP246767 | 1987-04-01 | Applicant | |
| EP276871 | 1988-01-01 | Applicant | |
| EP282735 | 1988-09-01 | Applicant | |
| EP334552 | 1989-03-01 | Applicant | |
| EP218523 | 1989-05-01 | Applicant | |
| EP329418(A2) | 1989-08-01 | Applicant | |
| EP348113(A2) | 1989-12-01 | Applicant | |
| EP449052 | 1990-03-01 | Applicant | |
| EP424774 | 1991-05-01 | Applicant | |
| GB2197553 | 1988-05-01 | Applicant | |
| JPS56-82961 | 1981-07-01 | Applicant | |
| JPS57-14922 | 1982-01-01 | Applicant | |
| JP33471/1982 | 1982-02-01 | Applicant | |
| JPSHO58-31637(A) | 1983-02-01 | Applicant | |
| JPSHO59-165285(A) | 1983-03-01 | Applicant | |
| JPSHO60-80193 | 1983-05-01 | Applicant | |
| JPSHO58-184626(A) | 1983-10-01 | Applicant | |
| JPSHO58-192154 | 1983-11-01 | Applicant | |
| JPSHO60-261095(A) | 1984-06-01 | Applicant | |
| JP135684/1984 | 1984-08-01 | Applicant | |
| JPSHO60-554959 | 1985-03-01 | Applicant | |
| JP61028248 | 1986-02-01 | Applicant | |
| JPS61-72350 | 1986-04-01 | Applicant | |
| JPSHO61-1074353 | 1986-05-01 | Applicant | |
| JP61-160129 | 1986-07-01 | Applicant | |
| JP61-160130 | 1986-07-01 | Applicant | |
| JP61-245255 | 1986-10-01 | Applicant | |
| JPSHO61-160556 | 1986-10-01 | Applicant | |
| JPSHO62-16289 | 1987-01-01 | Applicant | |
| JP62-51509 | 1987-03-01 | Applicant | |
| JPSHO62-71428 | 1987-03-01 | Applicant | |
| JP62-135949 | 1987-06-01 | Applicant | |
| JP120553/1987 | 1987-06-01 | Applicant | |
| JPSHO63-34795 | 1988-02-01 | Applicant | |
| JPSHO63-91766 | 1988-04-01 | Applicant | |
| JP63-142445 | 1988-06-01 | Applicant | |
| JP63217452 | 1988-09-01 | Applicant | |
| JPB63-46864 | 1988-09-01 | Applicant | |
| JP63239676 | 1988-10-01 | Applicant | |
| JPSHO63-300310 | 1988-12-01 | Applicant | |
| JPS64-29951 | 1989-01-01 | Applicant | |
| JP1043894 | 1989-02-01 | Applicant | |
| JP6443894 | 1989-02-01 | Applicant | |
| JP1-124193 | 1989-05-01 | Applicant | |
| JP1-159891 | 1989-06-01 | Applicant | |
| JP1-163849 | 1989-06-01 | Applicant | |
| JPA-1-236494 | 1989-09-01 | Applicant | |
| JP1284132 | 1989-11-01 | Applicant | |
| JPHEI2-8950 | 1990-01-01 | Applicant | |
| JP6-103153 | 1994-04-01 | Applicant | |
| JP2000035831(A) | 2000-02-01 | Applicant | |
| WO82/02615 | 1982-08-01 | Applicant | |
| WO89/12936 | 1989-12-01 | Applicant |
Non-Patent Literature (134)
- JPO, Notice Of The Reason For Refusal, Patent Application No. 500879/95, dated Sep. 21, 2004, pp. 1-4.Applicant
- Expert Report of David L. Taylor Regarding Invalidity, dated Jan. 28, 2005, pp. 1-79.Applicant
- Invalidity argument materials of potential licensee relating to claim 1 of U.S. Appl. No. 6,034,918, which is related to present U.S. Appl. No. 10/939,501 by birtue of the fact that both claim priority to U.S. Appl. No. 07/510,898 (now abandoned), citing J.L. Rodengen, The Legend of Amdahl, Write Stuff Syndicate, Inc., 2000, and FACOM M-780, Operating Manual, including two separate English language translations thereof.Applicant
- Invalidity argument materials of potential licensee relating to claim 23 of U.S. Appl. No. 6,038,195, to which present U.S. Appl. No. 10/939,501 claims priority and is related by virtue of the fact that both claim priority to U.S. Appl. No. 07/510,898 (now abandoned), citing J.L. Rodengen, The Legend of Amdahl, Write Stuff Syndicate, In., 2000, and FACOM M-780, Operating Manual, including two separate English language translations thereof.Applicant
- Watanabe, T.; “Session XIX: Hgh Density SRAMS”; IEEE International Solid State Circuits Conference pp. 266-267 91987).Applicant
- Ohno, C.; “Self-Timed RAM: STRAM”; Fujitsu Sci. TechJ., 24, 4, pp. 293-300 (Dec. 1988).Applicant
- “Fast Packet Bus for Microprocessor Systems with caches”, IBM Technical Disclosure Bulletin, pp. 279-282 (Jan. 1989).Applicant
- Gustavson, D. “Scalable Coherent Interface”; Invited paper, COMPCON Spring '89, San Francisco, CA; IEEE, pp. 536-538 (Feb. 27-Mar. 3, 1989).Applicant
- James, D.; “Scalable I/O Architecture for Busses”, pp. 539-544 (Apr. 1989).Applicant
- European Search Report for EPO Patent Application No. 00 101 1832.Applicant
- European Search Report for EPO Patent Application No. 89 30 2613.Applicant
- Z. Amitai, “New System Architectures for DRAM Control and Error Correction”, Monolithic Memories Inc., Electro/87 and Mini/Mico Northeast: Focusing on the OEM Conference Record, pp. 1132, 4/31-3, (Apr. 1987).Applicant
- N. Siddique, “100-MHz DRAM Controller Sparks Multiprocessor Designs”, Electronic Design, pp. 138-141, (Sep. 1986).Applicant
- H. Kuriyama et al., “A 4-Mbit CMOS SRAM with 8-NS Serial Access Time”, IEEE Symposium On VLSI Circuits Digest Of Technical Papers, pp. 51-52, (Jun. 1990).Applicant
- S. Fielder et al., “A 3 NS 1K X 4 Static Self-Timed GaAs RAM”, IEEE Gallium Arsenide Integrated Circuit Symposium Technical Digest, pp. 67-70, (Nov. 1988).Applicant
- JEDEC Standard No. 21C.Applicant
- M. Horowitz et. al., “MIPS-X: A 20-MIPS Peak 32-bit Microprocessor with On-Chip Cache”, IEEE Journal of Solid State Circuits, vol. 22 No. 5, pp. 790-799 (Oct. 1987).Applicant
- T.L. Jermiah et. al., “Synchronous LSSD Packet Switching Memory and I/O Channel,” IBM Tech. Disc. Bul,l vol. 24, No. 10, pp. 4986-4987 (Mar. 1982).Applicant
- L. R. Metzeger, “A 16K CMOS PROM with Polysilicon Fusible Links”, IEEE Journal of Solid State Circuits, vol. 18 No. 5, pp. 562-567 (Oct. 1983).Applicant
- A. Yuen et. al., “A 32K ASIC Synchronous RAM Using a Two-Transistor Basic Cell”, IEEE Journal of Solid State Circuits, vol. 24 No. 1, pp. 57-61 (Feb. 1989).Applicant
- D.T. Wong et al., “An 11-ns 8Kx18 CMOS Static RAM with 0.5-μm Devices”, IEEE Journal of Solid State Circuits, vol. 23 No. 5, pp. 1095-1103 (Oct. 1988).Applicant
- T. Williams et al., “An Experimental 1-Mbit CMOS SRAm with Configurable Organization and Operation”, IEEE Journal of Solid State Circuits, vol. 23 No. 5, pp. 1085-1094 (Oct. 1988).Applicant
- D. Jones, “Synchronous static ram”, Electronics and Wireless World, vol. 93, No. 1622, pp. 1243-1244 (Dec. 1987).Applicant
- F. Miller et al., “High Frequency System Operation Using Synchronous SRAMS”, Midcon/87 Conference Record, pp. 430-432 Chicago, IL, USA; Sep. 15-17, 1987.Applicant
- K. Ohta, “A 1-Mbit DRAM with 33-MHz Serial I/O Ports”, IEEE Journal of Solid State Circuits, vol. 21 No. 5, pp. 649-654 (oct. 1986).Applicant
- K. Nogami et al., “A 9-ns HIT-Delay 32-kbyte Cache Macro for High-Speed RISC”, IEEE Journal of Solid State Circuits, vol. 25 No. 1, pp. 100-108 (Feb. 1990).Applicant
- F. Towler et. al., “A 128k 6.5ns Access/ 5ns Cycle CMOS ECL Static RAM”, 1989 IEEE international Solid State Circuits Conference, (Feb. 1989).Applicant
- M. Kimoto, “A 1.4ns/64kb RAM with 85ps/3680 Logic Gate Array”, 1989 IEEE Custom Integrated Circuits Conference.Applicant
- D. Wendell et. al. “A 3.5ns, 2Kx9 Self Timed SRAM”, 1990 IEEE Symposium on VLSI Circuits (Feb. 1990).Applicant
- E. H. Frank, “The SBUS: Sun's High Performance Bus for RISC Workstations”, Sun Microsystems Inc. 1990.Applicant
- H. L. Kalter et al. “A 50-ns 16Mb DRAm with a 10-ns Data Rate and On-Chip ECC” IEEE Journal of Solid State Circuits, vol. 25 No. 5, pp. 1118-1128 (Oct. 1990).Applicant
- J. Chun et al. “A pipelined 650MHz GaAs 8K ROM with Translation Logic” GaAs IC Symposium 1990.Applicant
- European Search Report for EPO Patent Application No. 00 10 0018.Applicant
- European Search Report for EPO Patent Application No. 00 10 822.Applicant
- Takasugi, A. et al., “A Data-Transfer Architecture for Fast Multi-Bit Serial Acess DRAM,” 11th European Solid State Circuits Conference, Toulouse, France pp. 161-165 (Sep. 1985).Applicant
- Amitai, Z., “Burst Mode Memories Improved Cache Diesign,” WESCON/90 Conference Record, pp. 29-32 (Nov. 1990).Applicant
- Horowitz et al., “MIPS-X: A 20-MIPS Peak 32-Bit Microprocessor with ON-Chip Cache”, IEEE J. Solid State Circuits, vol. . SC-22, No. 5, pp. 790-798 (Oct. 1987).Applicant
- Robert J. Lodi et al., “Chip and System Characteristic of a 2048-Bit MNOS-BORAM LSI Circuit,” 1976 IEEE International Solid-State Circuits Conference (Feb. 18, 1976).Applicant
- 1989 GaAs IC Data Book & Designers Guide, Gigabit Logic Inc. (Aug. 1989).Applicant
- “IC's for Entertainment Electronics, Picture in Picture System Edition 8.89”, Siemens AG, Feb. 1989.Applicant
- Fagan, J.L., “A 16-kbit Nonvolatile Charge Addressed Memory,” IEEE Journal of Solid-State Circuits, vol. SC-11, No. 5, pp. 631-636 (Oct. 1976).Applicant
- Ikeda, Hiroaki et al., “100 M Hz Serial Acess Architecture for 4Md Field Memory,” Symposium of VLSI Circuits, Digest of Technical Papers, pp. 11-12 (Jun. 1990).Applicant
- Schmitt-Landsiedel, Doris, “Pipeline Architecture for Fast CMOS Buffer RAMs,” IEEE Journal of Solid-State Circuits, vol. SC-11, No. 5, pp. 631-636 (Oct. 1976).Applicant
- Svensson, Christer, “High Speed CMOS Chip to Chip Communications Circuit,” IEEE Internatiional Symposium on Circuits and Systems, pp. 2228-2231 (Jun. 1991).Applicant
- Wakayama, Myles, “A 30-MHz Low-Jitter High-Linearity CMOS Voltage-Controlled Oscillator,” IEEE Journal of Solid-State Circuits, vol. SC-22, No. 6, pp. 1074-1081 (Dec. 1987).Applicant
- Whiteside, Frank, “A Dual-Port 65ns 64Kx4 DRAM with a 50MHz Serial Output,” IEEE International Solid-State Circuits Conference Digest (Feb. 1986).Applicant
- Wu, Jich-Tsorng, “A 100-MHz Piplined CMOS Comparator,” IEEE Journal of Solid-State Circuits, vol. 23, No. 6, pp. 1379-1385 (Dec. 1988).Applicant
- Lineback, J. Robert, “System Snags Shouldn't Slow the Boom in Fast Static RAMs,” Electronics, p. 60-62 (Jul. 23, 1997).Applicant
- Graham, Andy and Stewart Sando, “Piplined Static RAM Endows Cache Memories with 1-ns Speed,” Electronic Design, pp. 157-170 (Dec. 1984).Applicant
- Pinkham, Raymond, “A High Speed Dual Port Memory with Simultaneous Serial and Random Mode Access for Video Applications,” IEEE Journal of Solid-State Circuits, vol. SC-19, No. 6, pp. 999-1007 (Dec. 1984).Applicant
- Ishimoto, S. et al., “A 256K Dual Port Memory,” ISSCC Digest of Technical Papers, p. 38-39 (Feb. 1985).Applicant
- Iqbal, Mohammad Shakaib, “Internally Timed RAMs Build Fast Writable Control Stores,” Electronic Design, pp. 93-96 (August 25, 1988).Applicant
- Schnaitter, William M. et al., “A 0.5-GHz CMOS Digital RF Memory Chip,” IEEE Journal of Solid-State Circuits, vol. SC-21, No. 5, pp. 720-726 (Oct. 1986).Applicant
- Bursky, Dave, “Advanced Self-Timed SRAM Pares Access Time to 5ns,” Electronic Desing, pp. 145-147 (Feb. 22, 1990).Applicant
- Tomoji Takada et al., “A Video Codec LSI for High-Definition TV Systems with One-Transistor DRAM Line Memories,” IEEE Journal of Solid-State Circuits, vol. 24, No. 6, pp. 1656-1659 (Dec. 1989).Applicant
- Robert J. Lodi et al., “MNOS-BORAM Memory Characteristics,” IEEE Journal of Solid-State Circuits, vol. SC-11, No. 5, pp. 622-631 (Oct. 1976).Applicant
- Gregory Uvieghara et al., “An On-Chip Smart Memory for a Data-Flow CPU,” IEEE Journal of Solid-State Circuits, vol. 25, No. 1, pp. 84-89 (Feb. 1990).Applicant
- Ray Pinkham et al., “A 128Kx8 70-MHz Multiport Video RAM with Auto Register Reload and 8×4 WRITE Feature,” IEEE Journal of Solid State Circuits, vol. 23, No. 3, pp. 1133-1139 (Oct. 1988).Applicant
- Graham, Andy and Stewart Sando, “Pipelined Static RAM Endows Cache Memories with 1-ns Speed,” Electronic Design pp. 157-170.Applicant
- Hans-Jurgen Mattausch et al., “A Memory-Based High-Speed Digital Delay Line with a Large Adjustable Length,”IEEE Journal of Solid-State Circuits, vol. 23, No. 1, pp. 105-110 (Feb. 1988).Applicant
- Kanopoulos, Nick and Jill H. Hallenbeck, “A First-In, First-Out Memory for Signal Processing Applications,” IEEE Transactions on Circuits and Systems, vol. CAS-33, No. 5, pp. 556-558 (May 1986).Applicant
- Motorola MC88200 Cache/Memory Managment Unit User's Manual, Motorola Inc. 1989.Applicant
- B. Ramakrishna et al., “The Cydra 5 Departmental Supercomputer Design Philosophies, Decisions, and Trade-offs” Computer IEEE, Jan. 1989 pp. 12-35.Applicant
- Ralston, E.D. Reilly, “Encyclopedia of Computer Science”, Chapman & Hall, 1983, p. 1471.Applicant
- S.A. Ward, R.H. Halstead, “Computation Structures”, The MIT Press, McGraw-Hill Book Company, 1990, pp., 174-175, 93, 250-251, and 258-259.Applicant
- Betty Prince, “Semiconductor Memories”, Second Edition, John Wiley & Sons, 1991, pp. 251, 310, 314, 200-201, 467.Applicant
- “Intel MCS-4 Micro Computer Set”, Intel Corporation, Santa Clara, CA, 1972, (pp. 1-12).Applicant
- “MIPS R3010 coprocessor”, IEEE Micro Jun. 1988, (pp. 54-62).Applicant
- “Intel MCS-4 Micro Computer Set Users Manual”, Intel Corporation, Santa Clara, CA, Mar. 1972, (pp. 1-26, and 60-68).Applicant
- “Bipolar/MOS Memories Data Book”, Advanced Micro Devices, Sunnyvale, CA, 1986 (pp. 4-143 to 4-163).Applicant
- “Memories 1986-87 Databook”, Fujitsu Inc., 1986 (pp. 1-102 to 1-128).Applicant
- H. J. Mattausch, et al., “A Memory-Based High-Speed Digital Delay Line With a Large Adjustable Length”, IEEE Journal of Solid State Circuits, vol. 23, No. 1, Feb. 1988 (pp. 105-110).Applicant
- “MIPS Chip Set Implements Full ECL CPU” Microprocessor Report, MicroDesign Resources Inc., vol. 3: No. 12; Dec. 1989.Applicant
- “R6000 System Bus 7 R6020 SBC Specification” MIPS Computer Systems Inc., Sunnyvale, CA, Aug. 22, 1989.Applicant
- R.A. Volz et al., “Position Paper on Global Clock for the Futurebus +”, SCI—1989—doc-59, pp. 1-9.Applicant
- “ECL bus controller hits 266 Mbytes/s” Microprocessor Report, MicroDesign Resources Inc., vol. 4: No. 1; p. 12, Jan. 24, 1990.Applicant
- S. Muchmore, “Designing Computer Systems Based on Multibus II”, New Electronics, vol. 20, No. 16, p. 31-32, Aug. 11, 1987.Applicant
- “Accordion Start-Stop Sequencer for a Variable Cycle Storage Controller”, IBM Technical Disclosure Bulletin, pp. 2074-2075, (a delphion.com reprint on two sheets), Oct. 1986.Applicant
- “Motorola 68030 Cache Organization”, posting to Internet Newsgroup net.arch by aglew@ccvaxa. UUCP, (a google.com reprint on two sheets), Sep. 29, 1986.Applicant
- M. Bazes et al., “A Programmable NMOS DRAM Controller for Microcomputer Systems with Dual-Port Memory and Error Checking And Correction”, IEEE Journal of Solid State Circuits, vol. 18, No. 2, pp. 164-172, Apr. 1983.Applicant
- R. W. Callahan et al., “Burst-Mode PIO Bus Control”, IBM Technical Disclosure Bulletin, vol. 21, No. 4, pp. 1417-1419, ( a delphion.com reprint on two sheets), Sep. 1978.Applicant
- Stanley D. Rosenbaum et al., “A 16 384-Bit High-Density CCD Memory”, IEEE Journal of Solid State Circuits, vol. SC-11, No. 1, pp. 33-39, Feb. 1976.Applicant
- Hopper et al., “Multiple vs. Wide Shared Bus Mulltiprocessors”, Proceedings of the 16th Annual International Symposium on Computer Architecture, Jerusalem, Israel, Jun. 1989, IEEE Computer Society Press, 1989.Applicant
- Gerninger et al., “A Survey of Commercial Parallel Processors”, Computer Architecture News, vol. 16, No. 4, Sep. 1988.Applicant
- Dubois et al., “Effects of cache Coherency in Mulitprocessors”, IEEE Transaction in Coputers, vol. C31, no. 11, pp. 1083-1099, Nov. 1982.Applicant
- Alnes, Norsk Data Report, Nov. 10, 1988, SCi: A Proposal For.Applicant
- Gustavson, David B., Nov. 28, 1988, SCI [ and SCI 2], Scalable Coherent Interface.Applicant
- Gustavson, David B. et al, Aug. 22, 1988, SCIA [ 1 and SCI 2], The Scalable Coherent Interface Project (Superbus), Draft.Applicant
- Johnson, Mark G; Hudson, Edwin L., IEEE Journal of Solid-State Circuits, vol. 23, No. 5, Oct. 1988, Johnson (IEEE Oct. 1988), A Variable Delay Line PLL For CPU- Coprocessor Synchronization.Applicant
- Intel, Intel Publication No. 171873-001 Rev. A, 1981, iAPX432 GDP Datasheet, Intel iAPX43202 VLSI General Data Processor Data Sheet.Applicant
- Intel, Intel Publication No. 17 1874-001 Rev. A, 1981, iAPX432 IP Datasheet, Intel iAPX43203 VLSI Interface Processor Data Sheet.Applicant
- Numata, K. et al., IEEE Journal of Solid State Circuits, vol. 24 No. 4, pp. 900-904, Aug. 1989, New Nibbled -Page Architecture for High Density DRAM's.Applicant
- Peigrom, M. et al,. ESSCIRC Dig. Tech. Papers, pp. 38-40, Sep. 1986, A 32Kbit Variable Length Shift Register for Digital Audio Application.Applicant
- Poon, T. C., et al., IEEE Journal of Solid State Circuits, vol. SC-22, No. 3, pp. 491-494, 1987, A CMOS DRAM-Controller Chip Implementation.Applicant
- Watanabe, S. et al., IEEE Journal of Solid State Circuits, vol. 24 No. 3, p. 763, Jun. 1982, An Experimental 16-Mbit CMOS DRAM Chip with a 100-MHz Serial Read/Write Mode.Applicant
- Schanke, Morten, May 5, 1989, SCIB [ 1 and SCI 2], Proposal for Clock Distribution in SCI.Applicant
- Jedec, JC 42.3 Committee On MOS Memories, Sep. 14, 1988, Minutes Of Meeting No. 47 JC-42.3 Committee On MOS Memories W/Attachment L (Proposal).Applicant
- Jedec, JC 42.3 Committee On Mos Memories, Dec. 7, 1988 Minutes Of Meeting No. 48 JC 42.3 Committee On MOS Memories, Dec. 7, 1988 Minutes Of meeting No. 48 JC 42.3 Committee On MOS Memories WI Attachement L Proposal.Applicant
- Jedec, JC 42.3 Committee On Sep. 12, 1989, Minutes of Meeting No. 51 JC 42.3 MOS Memories Commmittee On MOS Memories.Applicant
- Jedec, JC 42.3 Committee On MOS Memories, Dec. 6, 1989, Minutes Of Meeting No. 52 JC 42.3 Committee On MOS Meories w/Attachment K.Applicant
- Emmerson et al, IEEE MICRO, Dec. 1984, Fault Tolerance Achieved in VLSI.Applicant
- Gelsinger et al., IEEE Spectrum Oct. 1989, Microprocessors circa 2000, 1989 (pp. 43-47).Applicant
- Patterson, David A. et al., Morgan Kaufmaim Publishers, Inc., San Francisco, CA 1996, Computer Architecture A Quantitative Approach (Second Edition), excerpts.Applicant
- Sawada, Kazuhiro et al., IEEE 1988 Custom Integrated Circuits Conference 1988, A 72K CMOS Channelless Gate Array With Embedded 1 Mbit Dynamic RAm.Applicant
- Sutherland, Ivan E., Communications of the ACM, Jun. 1989, vol. 32, No. 6, Micropipelines.Applicant
- Lidington, Gary P., Digital Technical Journal, No. 7, Aug. 1988, pp. 79-86, Overview of the MicroVAX 3 500/3600 Processor Module.Applicant
- Lidington, Gary P., Digital Technical Journal, No. 7, Aug. 1988, pp. 79-86, Overview of the MicroVAX 3500/3600 Processor Module.Applicant
- Copy of Hynix's Amended Supplemental Revised Preliminary Invalidity Contentions.Applicant
- Patternson et al., Computer Architecture A Quantitative Approach.Applicant
- Johnson et al., Session XI: High Speed Logic; THAM 11.3: A Variable Delay Line Phase Loop for CPU-Coprocessor Synchronization , ISSCC 88, Thursday, Feb. 18, 1988, Continental Ballroom 6, 10:00 AM, pp. 142-143, 334 and 336.Applicant
- Jeong et al., Design of PLL-Based Clock Generation Circuits, IEEE Journal of Solid-State Circuits, vol. SC-22d, No. 2, Apr. 1987, pp. 255-261.Applicant
- GigaBit Logic, GaAs IC Data Book & Designer's Guide, May 1988, pp. 1.1-10.3.Applicant
- Intel, Iapx 432 Interconnect Architecture Reference Manual, 1982.Applicant
- Opposition against European patent 0 525 068, (Application No. 91 908 374.1-2201) (German & English Translation), Apr. 15, 2004.Applicant
- Communication of the Technical Board of Appeal 3.5.1 pursuant to Article 11 (1) of the rules of procedure of the Boards of Appeals in the Opposition against European patent 0 525 068 (Application No. 91908374.1-2201), Nov. 20, 2003.Applicant
- Brief Communication in the Opposition against European patent 1 022 642 (Application No. 00108822.8), Apr. 16, 2004.Applicant
- Minutes of the oral proceedings of Feb. 10, 2004 in the Opposition against European patent 0 525 068, Feb. 18, 2004.Applicant
- Lu et al., The Future of DRAMs, ISSCC 88, Feb. 18, 2004, pp. 1-2.Applicant
- Opposition against European patent 1022642, (Application No. 0010822.8) (German & English Translation), Mar. 2, 2004.Applicant
- Opposition against European patent 1004956, (Application No. 00010832.4) (German & English Translation), Mar. 3, 2004.Applicant
- Opposition against European patent 1022642, (Application No. 0010822.8) (German & English Translation), Jul. 15, 2004.Applicant
- Opposition against European patent 1004956, (ApplicationNo. 00010832.4) (German & English Translation), Jul. 15, 2004.Applicant
- Intel, iAPX 43204, iAPX 43205, Fault Tolerant Bus Interface and Memory Control Units, pp. 1-32, Mar. 1983.Applicant
- Intel, Electrical Specificationis for iAPX 43204 Bus-Interface Unit (BIU) and iAPX 43205 Memory Control Unit (MCU), Mar. 1983.Applicant
- Intel, Memory Components Handbook, 1985.Applicant
- Summons To Attend Oral Proceedings Pursuant to Rule 71(1) EPC in the Opposition against European patent 1 004 956, Jul. 20, 2004.Applicant
- Huber, Expert Report Regarding the Invention Claimed in Rambus' EP 0 525 068 patent vs. The CVAX CMCTL—A CMOS Memory Controller Chip and Designing Memory Systems with the 8K×8 iRAM, Jul. 13, 2004.Applicant
- Decision of Feb. 12, 2004, by the Board of Appeals of the EP in the Opposition against European patent 0 525 068 (Application No. 91908374.1).Applicant
- Morgan, The CVAX CMCTL—A CMOS Memory Controller Chip, Digital Technical Journal, No. 7, Aug. 1988, pp. 139-143.Applicant
- Fellin e tal., Intel, Application Note, AP-132, Designing Memory Systems with the 8K×8 iRAM, Jun. 1982.Applicant
- Prince et al., Semiconductor Memories, A Wiley-Interscience Publication, 1983.Applicant
- Decision of the Technical Board of Appeal 3.5.1 of Feb. 12, 2004 in the Opposition against European patent 0 525 068 (Application No. 91908374.1-2201/0525068).Applicant
- J. Peterson, “System Level Concern Set Performance Gains”, High Performance Systems, pp. 71-77 (Sep. 1989).Applicant
- N. Margulis, “Single Rise CPU Ease” High Performance Systems, pp. 34-41 (Sep. 1989).Applicant