Controller device and method for operating same

Description

FIELD OF THE INVENTION

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

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.

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.

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

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).

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

In U.S. Pat. No. 4,449,207 (Kung, et. al.), a DRAMS 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.

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.

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.

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.

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. No. 4,837,682 (Culler), U.S. Pat. No. 4,818,985 (Ikeda), U.S. Pat. No. 4,779,089 (Theus) and U.S. Pat. No. 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.

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.

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.

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.

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.

Another object of this invention is to allow mapping out defective memory devices or portions of memory devices Another object of this invention is to provide a method. for distinguishing otherwise identical devices by assigning a unique identifier to each device.

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.

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.

Another object of this invention is to provide devices, especially DRAMs, suitable for use with the bus architecture of the invention.

SUMMARY OF INVENTION

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.

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 La 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.

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.

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 an 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.

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 has 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.

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

FIG. 1 is a diagram which illustrates the basic 2-D organization of memory devices:

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.

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.

FIG. 4 shows the format of a request packet

FIG. 5 shows the format of a retry response from a slave.

FIG. 6 shows the bus cycles after a request packet collision occurs on the bus and how arbitration is handled.

FIGS. 7A and 7B show the timing whereby signals from two devices can overlap temporarily and drive the bus at the same time.

FIGS. 8A and 8B show the connection and timing between bus clocks and devices on the bus.

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.

FIG. 11 is a schematic diagram of a clocked sense-amplifier used as a bus input receiver.

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.

FIG. 13 is a timing diagram showing the relationship of signals in the block diagram of FIG. 12.

FIG. 14 is timing diagram of a preferred means of implementing the reset procedure of this invention.

FIG. 15 is a diagram illustrating the general, organization of a 4 Mbit DRAM divided into 8 subarrays.

FIG. 16 is a block diagram representation of a set of internal registers within each device illustrated in FIG. 2.

DETAILED DESCRIPTION

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).

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.

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.

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.

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.

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.

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.

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.

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

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.

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.

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, 10¹²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.

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.

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

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).

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

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.

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.

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 requ st) 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.

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.

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 ven 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).

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.

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 slav to r ad 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.

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 Acc ssReg0, preferably 8 cycles. Control register access can also be used to initialize or modify other registers, including address registers.

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.

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.

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.

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 giv n point in time the s nse amps hold only a few different blocks or memory “locales” (a single block of 4K 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).

The organization of memory in the present invention allows each DRAM to hold one or more (4 for 4MBit 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.

For DRAM slave access, the access types are preferably used in the following way:

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:

AccessType[2]=page mode/normal switch

AccessType[3]=precharge/save-data switch

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.

BlockSize[0:2]
Number of Byt s 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.

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

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.

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).

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

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.

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.

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.

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 t sts 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.

Another way to detect collisions is to select one or more bus lines for collision signaling. 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.

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.

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 bytes 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.

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.

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.

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 allocat d 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.

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

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.

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.

In a preferred embodiment of this invention, the device ID setting is accomplished using a pair of pins on each device, ResetIn and R setOut. Th se 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]).

To reset all devices on a bus, a master sets the R setIn 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 r sponsibility 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].

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.

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 AccessReg0 is preferably fixed at 8 (cycles) to facilitate access to control registers.

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

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.

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.

In a preferred embodiment, a standard data block size can be selected f or 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 RAM 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.

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 2ⁿdata bytes followed by 2^mECC bytes (or vice versa), or the sequence can be 2^kiterations 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

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.

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.

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 thickn ss, which is about an order of magnitude smaller, 0.2–0.5 mm using current wafer technology.

Bus Electrical Description

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).

In the pref rred 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.

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 (t_f) 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

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.

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 Clock153 is followed by the rising dge 56 of Clock254. Similarly, the falling edge 57 of Clock153 is followed by the falling edge 58 of Clock254. 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 b tween 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.

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 d vice clock is 0 and odd cycles when the internal device clock is 1.

Multiple Buses

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.

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.

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.

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 transceiv r 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.

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.

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

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

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.

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 t chnology, 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 d vice 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 (February 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.

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 reference line 68 and input 69, respectively. This particular 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.

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). 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). 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.

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.

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 s cond 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, Clock153, 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, Clock254, by the delay 128 in input sampler 111.

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.

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

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 n ver in conjunction with th bus architecture of this invention.

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.

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.

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 amplifi r is connected to the bit line. The extra set of internal I/O lines provides some bandwidth margin for write operations.

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

1. A method of operating a controller device, comprising: outputting a value to a memory device;outputting a first operation code to the memory device, wherein the first operation code instructs the memory device to store the value in a register of the memory device;outputting a block size value to the memory device, wherein the block size value indicates an amount of read data to be output by the memory device in response to a second operation code;outputting the second operation code to the memory device, wherein the second operation code instructs the memory device to perform a read operation, wherein the second operation code includes precharge information that indicates whether the memory device should precharge sense amplifiers on the memory device after sensing data corresponding to the read operation; andafter a read delay following the outputting of the second operation code, sampling a first portion of the read data output by the memory device in response to the second operation code, wherein the read delay is selected to correspond to the value output to the memory device for storage in the register.
2. The method of claim 1, wherein outputting the first and second operation codes further comprises outputting the first and second operation codes synchronously with respect to a clock signal.
3. The method of claim 1, wherein outputting the first operation code further comprises outputting the first operation code using pads on the controller device, the pads to connect to a set of external signal lines, and wherein outputting the second operation code further comprises outputting the second operation code using the pads on the controller device used to output the first operation code.
4. The method of claim 1, wherein sampling the first portion of the read data further comprises: for a pad on the controller device from which read data is sampled, sampling two bits of read data from the pad during a clock cycle of a clock signal used by the controller device.
5. The method of claim 4, wherein sampling the first portion of the read data further comprises: for each pad on the controller device from which read data is sampled, sampling two bits of read data during a clock cycle of a clock signal used by the controller device.
6. The method of claim 4, further comprising generating the clock signal internal to the controller device.
7. The method of claim 6, wherein generating the clock signal further comprises: receiving first and second external clock signals; andgenerating the clock signal using the first and second external clock signals.
8. The method of claim 4, further comprising receiving the clock signal from external to the controller device.
9. The method of claim 4, further comprising: outputting a third operation code to the memory device, wherein the third operation code instructs the memory device to perform a write operation; andafter a write delay following the outputting of the third operation code, outputting write data to the memory device, wherein the write delay is selected to correspond to the value output to the memory device for storage in the register.
10. The method of claim 9, wherein the write data is output synchronously with respect to the clock signal.
11. The method of claim 10, wherein the second operation code is output synchronously with respect to the clock signal.
12. The method of claim 11, further comprising: outputting first address information to the memory device, wherein the first address information indicates a location in a memory array of the memory device at which the read data is stored; andoutputting second address information to the memory device, wherein the second address information indicates a location in the memory array at which the write data is to be stored.
13. The method of claim 12, wherein outputting the write data to the memory device further comprises, for a pad on the controller device used to output write data, outputting two bits of write data using the pad during a clock cycle of the clock signal.
14. The method of claim 13, wherein outputting the write data to the memory device further comprises, for each pad on the controller device used to output write data, outputting two bits of write data during a clock cycle of the clock signal.
15. The method of claim 13, wherein outputting the value further comprises outputting the value to the memory device via an external bus, wherein the first address information and the second address information are also output to the memory device via the external bus.
16. The method of claim 15, wherein the read delay and the write delay are about the same.
17. The method of claim 16, wherein outputting the block size value and outputting the second operation code further comprises outputting the block size value and the second operation code to the memory device in a packet.
18. The method of claim 1, further comprising sampling the amount of read data output by the memory device in response to the second operation code, wherein the amount of read data is sampled over a plurality of clock cycles of a clock signal used by the controller device to output the first and second operation codes, and wherein sampling the amount of read data includes sampling the first portion of the read data.
19. A controller device, comprising: output driver circuitry, the output driver circuitry to: output a value to a memory device;output a first operation code to the memory device, wherein the first operation code instructs the memory device to store the value in a register in the memory device;output a block size value to the memory device, wherein the block size value indicates an amount of read data to be output by the memory device in response to a second operation code; andoutput the second operation code to the memory device, wherein the second operation code instructs the memory device to perform a read operation, wherein the second operation code includes precharge information that indicates to the memory device whether the memory device should precharge sense amplifiers on the memory device after sensing data corresponding to the read operation; andinput receiver circuitry to sample a first portion of the read data output by the memory device in response to the second operation code, the input receiver circuitry to sample the first portion of the read data after a read delay following the outputting of the second operation code, wherein the read delay is selected to correspond to the value output to the memory device for storage in the register.
20. The controller device of claim 19, further comprising a plurality of pads to interface with signal lines external to the controller device, wherein the input receiver circuitry is coupled to a first portion of the plurality of pads to receive the first portion of the read data, and wherein for a pad used in the receipt of the first portion of the read data, two bits of read data are received from the pad during a clock cycle of a clock signal used by the controller device.
21. The controller device of claim 20, wherein for each pad used in the receipt of the first portion of the read data, two bits of read data are received during a clock cycle of the clock signal.
22. The controller device of claim 20, further comprising a clock receiver to receive the clock signal from external to the controller device.
23. The controller device of claim 20, further comprising a clock generation circuit to generate the clock signal.
24. The controller device of claim 23, further comprising: a first clock receiver to receive a first external clock signal; anda second clock receiver to receive a second external clock signal,wherein the clock generation circuit is coupled to the first and second clock receivers, and wherein the clock generation circuit generates the clock signal using the first and second external clock signals.
25. The controller device of claim 20, wherein the input receiver circuitry includes, for each pad of the plurality of pads used to receive read data, a first input receiver and a second input receiver.
26. The controller device of claim 19, wherein the output driver circuitry outputs a third operation code to the memory device, wherein the third operation code instructs the memory device to perform a write operation.
27. The controller device of claim 26, wherein the output driver circuitry outputs write data to the memory device after a write delay following outputting of the third operation code, wherein the write delay is selected to correspond to the value output to the memory device for storage in the register.
28. The controller device of claim 27, wherein the output driver circuitry includes a plurality of output drivers, wherein the output driver circuitry outputs at least a portion of the write data using output drivers of the plurality of output drivers that are also used to output the first operation code to the memory device.
29. The controller device of claim 27, wherein the output driver circuitry includes a plurality of output drivers, wherein an output driver of the plurality of output drivers outputs two bits of the write data during a clock cycle of a clock signal used by the controller device.
30. The controller device of claim 29, further comprising a clock receiver to receive the clock signal, wherein the output driver circuitry outputs the write data synchronously with respect to the clock signal.
31. The controller device of claim 19, wherein the output driver circuitry includes: a first set of output drivers to output the first operation code; anda second set of output drivers to output the block size value.
32. A method of controlling a memory device by a controller device, comprising: outputting a value to the memory device;outputting a first operation code to the memory device, wherein the first operation code instructs the memory device to store the value in a register of the memory device;outputting a second operation code to the memory device, wherein the second operation code instructs the memory device to perform a read operation, wherein the second operation code includes precharge information that indicates whether the memory device should precharge sense amplifiers on the memory device after sensing data corresponding to the read operation; andafter a read delay following the outputting of the second operation code, sampling a first portion of read data output by the memory device in response to the second operation code, wherein the read delay is selected to correspond to the value output to the memory device for storage in the register.
33. The method of claim 32, wherein sampling the first portion of read data further comprises: for each pad on the controller device from which read data is sampled, sampling two bits of read data during a clock cycle of a clock signal used by the controller device.
34. The method of claim 33, further comprising: outputting a third operation code to the memory device, wherein the third operation code instructs the memory device to perform a write operation; andafter a write delay following the outputting of the third operation code, outputting write data to the memory device, wherein the write delay is selected to correspond to the value output to the memory device for storage in the register, wherein outputting the write data to the memory device further comprises, for each pad on the controller device used to output write data, outputting two bits of write data during a clock cycle of the clock signal.
35. A controller device, comprising: means for outputting a value to a memory device; means for outputting a first operation code to the memory device, wherein the first operation code instructs the memory device to store the value in a register of the memory device;means for outputting a block size value to the memory device, wherein the block size value indicates an amount of read data to be output by the memory device in response to a second operation code;means for outputting the second operation code to the memory device, wherein the second operation code instructs the memory device to perform a read operation, wherein the second operation code includes precharge information that indicates whether the memory device should precharge sense amplifiers on the memory device after sensing data corresponding to the read operation; andmeans for sampling read data, wherein after a read delay following the outputting of the second operation code, the means for sampling read data samples a first portion of the read data output by the memory device in response to the second operation code, wherein the read delay is selected to correspond to the value output to the memory device for storage in the register.
36. The controller device of claim 35, further comprising: for each pad on the controller device from which read data is sampled, means for sampling two bits of read data during a clock cycle of a clock signal used by the controller device.
37. The controller device of claim 36, further comprising: means for outputting a third operation code to the memory device, wherein the third operation code instructs the memory device to perform a write operation; andmeans for outputting write data to the memory device, wherein after a write delay following the outputting of the third operation code, the means for outputting write data to the memory device outputs write data to the memory device, wherein the write delay is selected to correspond to the value output to the memory device for storage in the register, wherein outputting the write data to the memory device further comprises, for each pad on the controller device used to output write data, outputting two bits of write data during a clock cycle of the clock signal.
38. A controller device, comprising: output driver circuitry, the output driver circuitry to: output a value;output a first operation code, wherein the first operation code represents an instruction to a memory device to store the value in a register in the memory device;output a block size value, wherein the block size value indicates an amount of read data to be output by the memory device in response to a second operation code; andoutput the second operation code, wherein the second operation code represents an instruction to the memory device to perform a read operation, wherein the second operation code includes an indication to the memory device as to whether the memory device should precharge sense amplifiers on the memory device after sensing data corresponding to the read operation; andinput receiver circuitry to sample a first portion of the read data output by the memory device, the input receiver circuitry to sample the first portion of the read data after a read delay following the outputting of the second operation code, wherein the read delay is selected to correspond to the value.

CROSS-REFERENCE OF THE RELATED APPLICATIONS

This patent application is a continuation of U.S. patent application Ser. No. 10/037,171, filed Dec. 21, 2001, now U.S. Pat. No. 6,715,020 which is a continuation of U.S. patent application Ser. No. 09/835,263, filed Apr. 13, 2001, now U.S. Pat. No. 6,751,696 which is a continuation of U.S. patent applicatuin Ser. No. 09/545,648, filed Apr. 10, 2000 (now U.S. Pat. No. 6,378,020); which is a continuation of U.S. patent application Ser. No. 09/161,090, filed Sep. 25, 1998 (now U.S. Pat. No. 6,049,846); which is a division 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/822,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).

US Referenced Citations (309)

Number	Name	Date	Kind
3633166	Picard	Jan 1972	A
3691534	Varadi et al.	Sep 1972	A
3740723	Beausoleil et al.	Jun 1973	A
3758761	Henrion	Sep 1973	A
3771145	Wiener	Nov 1973	A
3821715	Hoff, Jr. et al.	Jun 1974	A
3846763	Riikonen	Nov 1974	A
3882470	Hunter	May 1975	A
3924241	Kronies	Dec 1975	A
3950735	Patel	Apr 1976	A
3967206	Roberson et al.	Jun 1976	A
3969706	Proebsting et al.	Jul 1976	A
3972028	Weber et al.	Jul 1976	A
3975714	Weber et al.	Aug 1976	A
3983537	Parsons et al.	Sep 1976	A
4007452	Hoff, Jr.	Feb 1977	A
4016545	Lipovski	Apr 1977	A
4038648	Chesley	Jul 1977	A
4047246	Kerllenevich et al.	Sep 1977	A
4048673	Hendrie et al.	Sep 1977	A
4084154	Panigraphi	Apr 1978	A
4092665	Saran	May 1978	A
4099231	Kotok et al.	Jul 1978	A
4183095	Ward	Jan 1980	A
4191996	Chesley	Mar 1980	A
4205373	Shah et al.	May 1980	A
4231104	St. Clair	Oct 1980	A
4234934	Thorsrud	Nov 1980	A
4247817	Heller	Jan 1981	A
4249247	Patel	Feb 1981	A
4253147	MacDougall et al.	Feb 1981	A
4257097	Moran	Mar 1981	A
4263650	Bennett et al.	Apr 1981	A
4286321	Baker et al.	Aug 1981	A
4306298	McElroy	Dec 1981	A
4315308	Jackson	Feb 1982	A
4322635	Redwine	Mar 1982	A
4330852	Redwine et al.	May 1982	A
4333142	Chesley	Jun 1982	A
4337523	Hotta et al.	Jun 1982	A
4338569	Petrich	Jul 1982	A
4354258	Sato	Oct 1982	A
4355376	Gould	Oct 1982	A
4360870	McVey	Nov 1982	A
4373183	Means et al.	Feb 1983	A
4375665	Schmidt	Mar 1983	A
4379222	Hayter et al.	Apr 1983	A
4385350	Hansen et al.	May 1983	A
4394753	Penzel	Jul 1983	A
4405996	Stewart	Sep 1983	A
4408272	Walters	Oct 1983	A
4412286	O'Dowd	Oct 1983	A
4426685	Lorentzen	Jan 1984	A
4435762	Milligan et al.	Mar 1984	A
4443864	McElroy	Apr 1984	A
4445204	Nishiguchi	Apr 1984	A
4449207	Kung et al.	May 1984	A
4466127	Ohgishi et al.	Aug 1984	A
4468733	Oka et al.	Aug 1984	A
4468738	Hansen et al.	Aug 1984	A
4470114	Gerhold	Sep 1984	A
4480307	Budde et al.	Oct 1984	A
4481572	Oschner	Nov 1984	A
4481625	Roberts et al.	Nov 1984	A
4481647	Gombert et al.	Nov 1984	A
4482999	Janson et al.	Nov 1984	A
4488218	Grimes	Dec 1984	A
4494021	Bell et al.	Jan 1985	A
4494186	Goss et al.	Jan 1985	A
4499536	Gemma et al.	Feb 1985	A
4500905	Shibata	Feb 1985	A
4506348	Miller	Mar 1985	A
4509142	Childers	Apr 1985	A
4513370	Ziu et al.	Apr 1985	A
4513372	Ziegler et al.	Apr 1985	A
4513374	Hooks, Jr.	Apr 1985	A
4519034	Smith et al.	May 1985	A
4520465	Sood	May 1985	A
4528661	Bahr et al.	Jul 1985	A
4535427	Jiang	Aug 1985	A
4536795	Hirota et al.	Aug 1985	A
4562435	McDonough et al.	Dec 1985	A
4566098	Gammage et al.	Jan 1986	A
4566099	Magerl	Jan 1986	A
4570220	Tetrick et al.	Feb 1986	A
4571672	Hatada et al.	Feb 1986	A
4586167	Fujishima et al.	Apr 1986	A
4589108	Billy	May 1986	A
4595923	McFarland, Jr.	Jun 1986	A
4597019	Nishimoto et al.	Jun 1986	A
4607173	Knoedl, Jr.	Aug 1986	A
4608700	Kirtley, Jr. et al.	Aug 1986	A
4616268	Shida	Oct 1986	A
4625307	Tulpule et al.	Nov 1986	A
4628489	Ong	Dec 1986	A
4629909	Cameron	Dec 1986	A
4630193	Kris	Dec 1986	A
4631659	Hayne et al.	Dec 1986	A
4633735	Sakurai et al.	Jan 1987	A
4635192	Ceccon et al.	Jan 1987	A
4636986	Pinkham	Jan 1987	A
4637018	Flora	Jan 1987	A
4639890	Heilveil et al.	Jan 1987	A
4641276	Dunki-Jacobs	Feb 1987	A
4644469	Sumi	Feb 1987	A
4644532	George et al.	Feb 1987	A
4646270	Voss	Feb 1987	A
4648102	Riso et al.	Mar 1987	A
4649511	Gdula	Mar 1987	A
4649516	Chung et al.	Mar 1987	A
4654655	Kowalski	Mar 1987	A
4656605	Clayton	Apr 1987	A
4660141	Ceccon et al.	Apr 1987	A
4663735	Novak et al.	May 1987	A
4667305	Dill et al.	May 1987	A
4672470	Morimoto et al.	Jun 1987	A
4675813	Locke	Jun 1987	A
4675850	Kumanoya et al.	Jun 1987	A
4680738	Tam	Jul 1987	A
4685088	Ianucci	Aug 1987	A
4688197	Novak et al.	Aug 1987	A
4703418	James	Oct 1987	A
4704678	May	Nov 1987	A
4706166	Go	Nov 1987	A
4710904	Suzuki	Dec 1987	A
4712194	Yamaguchi	Dec 1987	A
4719505	Katznelson	Jan 1988	A
4719602	Hag et al.	Jan 1988	A
4719627	Peterson et al.	Jan 1988	A
4726021	Horiguchi et al.	Feb 1988	A
4734880	Collins	Mar 1988	A
4739502	Nozaki	Apr 1988	A
4745548	Blahut	May 1988	A
4747079	Yamaguchi	May 1988	A
4747081	Heilveil et al.	May 1988	A
4747100	Roach et al.	May 1988	A
4748617	Drewlo	May 1988	A
4750839	Wang et al.	Jun 1988	A
4754433	Chin et al.	Jun 1988	A
4755937	Glier	Jul 1988	A
4757473	Kurihara et al.	Jul 1988	A
4761567	Walters, Jr. et al.	Aug 1988	A
4761799	Arragon	Aug 1988	A
4763249	Bomba et al.	Aug 1988	A
4764846	Go	Aug 1988	A
4766536	Wilson, Jr. et al.	Aug 1988	A
4770640	Walter	Sep 1988	A
4775931	Dickie et al.	Oct 1988	A
4779089	Theus	Oct 1988	A
4782439	Borkar et al.	Nov 1988	A
4785394	Fischer	Nov 1988	A
4785396	Murphy et al.	Nov 1988	A
4785428	Bajwa	Nov 1988	A
4788667	Nakano et al.	Nov 1988	A
4789960	Willis	Dec 1988	A
4792926	Roberts	Dec 1988	A
4799199	Scales, III et al.	Jan 1989	A
4803621	Kelly	Feb 1989	A
4805198	Stern et al.	Feb 1989	A
4807189	Pinkham et al.	Feb 1989	A
4811202	Schabowski	Mar 1989	A
4811364	Sager et al.	Mar 1989	A
4817058	Pinkham	Mar 1989	A
4818985	Ikeda	Apr 1989	A
4821226	Christopher et al.	Apr 1989	A
4825287	Baji et al.	Apr 1989	A
4825416	Tam et al.	Apr 1989	A
4831338	Yamaguchi	May 1989	A
4835674	Collins et al.	May 1989	A
4837682	Culler	Jun 1989	A
4839801	Nicely et al.	Jun 1989	A
4845664	Aichelmann, Jr. et al.	Jul 1989	A
4845670	Nishimoto et al.	Jul 1989	A
4845677	Chappell et al.	Jul 1989	A
4849937	Yoshimoto	Jul 1989	A
4849965	Chomel et al.	Jul 1989	A
4851990	Johnson et al.	Jul 1989	A
4853896	Yamaguchi	Aug 1989	A
4858112	Puerzer et al.	Aug 1989	A
4858113	Saccardi	Aug 1989	A
4860198	Takenaka	Aug 1989	A
4862158	Keller et al.	Aug 1989	A
4864563	Pavey et al.	Sep 1989	A
4870562	Kimoto et al.	Sep 1989	A
4870622	Aria et al.	Sep 1989	A
4870652	Thornton	Sep 1989	A
H696	Davidson	Oct 1989	H
4873671	Kowshik et al.	Oct 1989	A
4875192	Matsumoto	Oct 1989	A
4876670	Nakabayashi et al.	Oct 1989	A
4878166	Johnson et al.	Oct 1989	A
4882669	Miura et al.	Nov 1989	A
4882710	Hashimoto et al.	Nov 1989	A
4882712	Ohno et al.	Nov 1989	A
4891791	Iijima	Jan 1990	A
4901036	Herold et al.	Feb 1990	A
4905201	Ohira et al.	Feb 1990	A
4912630	Cochcroft, Jr.	Mar 1990	A
4916670	Suzuki et al.	Apr 1990	A
4920483	Pogue et al.	Apr 1990	A
4920486	Nielsen	Apr 1990	A
4922141	Lofgren et al.	May 1990	A
4926385	Fujishima et al.	May 1990	A
4928265	Higuchi et al.	May 1990	A
4930065	McLagan et al.	May 1990	A
4933835	Sachs et al.	Jun 1990	A
4933910	Olson et al.	Jun 1990	A
4933953	Yagi	Jun 1990	A
4937733	Gillett, Jr. et al.	Jun 1990	A
4937734	Bechtolsheim	Jun 1990	A
4939510	Masheff et al.	Jul 1990	A
4940909	Mulder et al.	Jul 1990	A
4941128	Wada	Jul 1990	A
4945471	Neches	Jul 1990	A
4945516	Kashiyama	Jul 1990	A
4947484	Twitty et al.	Aug 1990	A
4949301	Joshi et al.	Aug 1990	A
4951251	Yamaguchi et al.	Aug 1990	A
4953128	Kawai et al.	Aug 1990	A
4953130	Houston	Aug 1990	A
4954987	Auvinen et al.	Sep 1990	A
4954992	Kumanoya et al.	Sep 1990	A
4961171	Pinkham et al.	Oct 1990	A
4965792	Yano	Oct 1990	A
4970418	Masterson	Nov 1990	A
4975763	Baudouin et al.	Dec 1990	A
4975872	Zaiki	Dec 1990	A
4975877	Bell	Dec 1990	A
4979145	Remington et al.	Dec 1990	A
4982400	Ebersole	Jan 1991	A
4998069	Nguyen et al.	Mar 1991	A
4998262	Wiggers	Mar 1991	A
5001672	Ebbers	Mar 1991	A
5006982	Ebersole et al.	Apr 1991	A
5009481	Kinoshita et al.	Apr 1991	A
5012408	Conroy	Apr 1991	A
5016226	Hiwada et al.	May 1991	A
5018111	Madland	May 1991	A
5021985	Hu et al.	Jun 1991	A
5023488	Gunning	Jun 1991	A
5023835	Akimoto et al.	Jun 1991	A
5023838	Herbert	Jun 1991	A
5029124	Leahy et al.	Jul 1991	A
5034917	Bland et al.	Jul 1991	A
5034964	Khan et al.	Jul 1991	A
5036495	Busch et al.	Jul 1991	A
5038317	Callan et al.	Aug 1991	A
5038320	Heath et al.	Aug 1991	A
5051889	Fung et al.	Sep 1991	A
5056060	Fitch et al.	Oct 1991	A
5063564	Crandall et al.	Nov 1991	A
5077693	Hardee et al.	Dec 1991	A
5083260	Tsuchiya	Jan 1992	A
5083296	Hara et al.	Jan 1992	A
5093807	Hashimoto et al.	Mar 1992	A
5099481	Miller	Mar 1992	A
5101117	Johnson et al.	Mar 1992	A
5107465	Fung et al.	Apr 1992	A
5107491	Chew	Apr 1992	A
5109498	Kamiya et al.	Apr 1992	A
5111423	Kopec, Jr. et al.	May 1992	A
5111464	Farmwald et al.	May 1992	A
5111486	Oliboni et al.	May 1992	A
5117494	Costes et al.	May 1992	A
5121382	Yang et al.	Jun 1992	A
5123100	Hisada et al.	Jun 1992	A
5129069	Helm et al.	Jul 1992	A
5133064	Hotta et al.	Jul 1992	A
5134699	Aria et al.	Jul 1992	A
5140688	White et al.	Aug 1992	A
5142376	Ogura	Aug 1992	A
5142637	Harlin et al.	Aug 1992	A
5148523	Harlin et al.	Sep 1992	A
5153856	Takahashi	Oct 1992	A
5157776	Foster	Oct 1992	A
5173617	Alsup et al.	Dec 1992	A
5175831	Kumar	Dec 1992	A
5175835	Beighe et al.	Dec 1992	A
5179667	Iyer	Jan 1993	A
5179670	Farmwald et al.	Jan 1993	A
5184027	Masuda et al.	Feb 1993	A
5193149	Awiszio et al.	Mar 1993	A
5193193	Iyer	Mar 1993	A
5193199	Dalrymple et al.	Mar 1993	A
5206833	Lee	Apr 1993	A
5210715	Houston	May 1993	A
5220673	Dalrymple et al.	Jun 1993	A
5226009	Arimoto	Jul 1993	A
5247518	Takiyasu et al.	Sep 1993	A
5251309	Kinoshita et al.	Oct 1993	A
5276846	Aichelmann, Jr. et al.	Jan 1994	A
5287532	Hunt	Feb 1994	A
5301278	Bowater et al.	Apr 1994	A
5317723	Heap et al.	May 1994	A
5361277	Grover	Nov 1994	A
5371892	Petersen et al.	Dec 1994	A
5390149	Vogley et al.	Feb 1995	A
5452420	Engdahl et al.	Sep 1995	A
5513327	Farmwald et al.	Apr 1996	A
5546346	Agata et al.	Aug 1996	A
5590086	Park et al.	Dec 1996	A
5684753	Hashimoto et al.	Nov 1997	A
5742798	Goldrian	Apr 1998	A
5835956	Park et al.	Nov 1998	A
5847997	Harada et al.	Dec 1998	A
6032214	Farmwald et al.	Feb 2000	A
6034918	Farmwald et al.	Mar 2000	A
6038195	Farmwald et al.	Mar 2000	A
6426916	Farmwald et al.	Jul 2002	B2

Foreign Referenced Citations (69)

Number	Date	Country
37 42 487	Jul 1988	DE
0 126 976	Dec 1984	EP
0 166 192	Jan 1986	EP
0 187 289	Jul 1986	EP
0 189 576	Aug 1986	EP
0 246 767	Apr 1987	EP
0 276 871	Jan 1988	EP
0 276 871	Mar 1988	EP
0282735	Sep 1988	EP
0 334 552	Mar 1989	EP
0218523	May 1989	EP
0 329 418	Aug 1989	EP
0 339 224	Nov 1989	EP
0 348 113	Dec 1989	EP
0449052	Mar 1990	EP
0424774	May 1991	EP
1 640 847	Mar 2006	EP
2 197 553	May 1988	GB
02197553	May 1988	GB
2 201 569	Sep 1988	GB
0 329 418	Aug 1989	GB
S56-047996	Apr 1981	JP
S56-82961	Jul 1981	JP
S57-14922	Jan 1982	JP
S57-210495	Dec 1982	JP
SHO 58-31637	Feb 1983	JP
SHO 59-165285	Mar 1983	JP
SHO 60-80193	May 1983	JP
58184647	Oct 1983	JP
SHO 58-184626	Oct 1983	JP
SHO 58-192154	Nov 1983	JP
SHO 60-261095	Jun 1984	JP
1356841984	Aug 1984	JP
SHO 60-55459	May 1985	JP
61028248	Feb 1986	JP
S61-72350	Apr 1986	JP
SHO 61-107453	May 1986	JP
S61-220193	Sep 1986	JP
SHO 61-160556	Oct 1986	JP
SHO 62-16289	Jan 1987	JP
62-51093	Mar 1987	JP
62-51509	Mar 1987	JP
S62-51387	Mar 1987	JP
SHO 62-71428	Mar 1987	JP
1205531987	Jun 1987	JP
SHO 63-34795	Feb 1988	JP
SHO 63-91766	Apr 1988	JP
S63-142445	Jun 1988	JP
63217452	Sep 1988	JP
B63-46864	Sep 1988	JP
63239676	Oct 1988	JP
S63-244389	Oct 1988	JP
SHO 63-300310	Dec 1988	JP
S64-29951	Jan 1989	JP
1043894	Feb 1989	JP
6443894	Feb 1989	JP
1-124193	May 1989	JP
1-159891	Jun 1989	JP
A-1-236494	Sep 1989	JP
J1-232597	Sep 1989	JP
H1-271861	Oct 1989	JP
01-284132	Nov 1989	JP
1284132	Nov 1989	JP
HEI 2-8950	Jan 1990	JP
H03-076094	Apr 1991	JP
2000035831	Feb 2000	JP
8202615	Aug 1982	WO
WO 8906013	Jun 1989	WO
WO 8912936	Dec 1989	WO

Related Publications (1)

	Number	Date	Country
	20060039213 A1	Feb 2006	US

Divisions (3)

	Number	Date	Country
Parent	08798520	Feb 1997	US
Child	09161090		US
Parent	08448657	May 1995	US
Child	08798520		US
Parent	08222646	Mar 1994	US
Child	08448657		US

Continuations (6)

	Number	Date	Country
Parent	10037171	Dec 2001	US
Child	10716596		US
Parent	09835263	Apr 2001	US
Child	10037171		US
Parent	09545648	Apr 2000	US
Child	09835263		US
Parent	09161090	Sep 1998	US
Child	09545648		US
Parent	07954945	Sep 1992	US
Child	08222646		US
Parent	07510898	Apr 1990	US
Child	07954945		US

Controller device and method for operating same

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

International Classifications

Term Extension

Abstract