This invention pertains to data, and more particularly to detecting errors in data.
When an instruction sequence needs to write data to memory, typically two pieces of information are transmitted to the memory: the command, and the data to be written to memory. It is possible that errors may occur in the transmission of either of these elements. For example, if the command is corrupted, the data may be written to the wrong location in memory. And obviously, if the data is corrupted, then the wrong data may be written to memory.
To address these potential errors, the command and the associated data may be each provided with an error detecting code. Typically, a Cyclic Redundancy Code (CRC) is used. The CRC may then be used by the memory module to determine if there was an error during transmission. If an error is detected, then the memory module may request that the command and associated data be retransmitted.
But transmitting the bits for the CRC takes away from the bandwidth that might be used to transmit commands or data. The number of bits needed to transmit the CRC depends on the specific CRC algorithm implemented. More complicated CRC algorithms are capable of detecting more errors (for example, a simple CRC might detect an error that changes one bit, but not an error that changes two bits), but require more bits to transmit.
Embodiments of the invention address these problems and others in the art.
A typical use for an embodiment of the invention is a command to write data to a memory module, such as memory module 215-1, because typically the command is sent to the memory module separately from the data. Memory module 215 may be any variety of memory module, such as a Dynamic Random Access Memory (DRAM). But a person skilled in the art will recognize that embodiments of the invention are not limited to the particular elements of hardware shown in
Note that code generator 320 takes two inputs, but generates a single code for the two inputs. This may be compared with prior art solutions, where separate codes are generated for each of the command and the data. In combining command 310 and data 315 to generate a single code 325, the implementation has a choice. Code generator 320 may generate a code that provides the same level of error detection (or correction) as prior art code generators, in which case fewer bits are needed, because of the efficiency of combining command 310 and data 315 for a single code 325. Or, code generator 320 may generate a code that uses the same number of bits as would have been generated for command 310 and data 315 separately, thereby increasing the accuracy of code 325.
Further explanation of this choice may prove illustrative. For example, consider a CRC that generates a one byte code for each byte of data to be verified. Further, assume that the command and the data are each only four bits long (that is, each uses only one half of a byte). If a CRC is to be generated for the command and the data separately, then a total of four bytes are needed: one byte (half of which is empty) for the command, one byte (half of which is empty) for the data, and two bytes for the two CRC codes. But if the command and the data are combined into a single byte, then only one byte is needed to store the CRC code (using the same CRC algorithm); this saves on the number of bits that are needed for the code, and therefore reduces the number of bits to be transmitted. Alternatively, a more accurate algorithm might be used instead of the same CRC algorithm, one which detects a greater number of errors in transmission. Such a code might use three bytes, meaning that the same four bytes would be used as in the prior art. This means that the same number of bits are being used as in the prior art, but a greater degree of accuracy is achieved. For example, more errors might be detected than could be detected using the original CRC algorithm, or an error correcting code might be used, to avoid the need for retransmission.
Once code 325 is generated, code 325 may be added to command 310 and 315.
Although
Continuing the theme of a processor transmitting a write command and data to a memory module,
Assuming that command 310 and data 315 are validated or successfully corrected, then they may be processed by circuit 720 to perform the command. For example, if command 310 is a command to write data 315 to memory, then circuit 720 may write data 315 to the location specified in memory module 215-1.
It is worth noting that using a single code does not result in increasing the number of requests to retransmit. In the prior art, if there is an error in either the command or the data, then both command 310 and data 315 are requested to be retransmitted. Using a single code does not change that. As indicated above with reference to the discussion surrounding
Although
At block 935 (
The following discussion is intended to provide a brief, general description of a suitable machine in which certain aspects of the invention may be implemented. Typically, the machine includes a system bus to which is attached processors, memory, e.g., random access memory (RAM), read-only memory (ROM), or other state preserving medium, storage devices, a video interface, and input/output interface ports. The machine may be controlled, at least in part, by input from conventional input devices, such as keyboards, mice, etc., as well as by directives received from another machine, interaction with a virtual reality (VR) environment, biometric feedback, or other input signal. As used herein, the term “machine” is intended to broadly encompass a single machine, or a system of communicatively coupled machines or devices operating together. Exemplary machines include computing devices such as personal computers, workstations, servers, portable computers, handheld devices, telephones, tablets, etc., as well as transportation devices, such as private or public transportation, e.g., automobiles, trains, cabs, etc.
The machine may include embedded controllers, such as programmable or non-programmable logic devices or arrays, Application Specific Integrated Circuits, embedded computers, smart cards, and the like. The machine may utilize one or more connections to one or more remote machines, such as through a network interface, modem, or other communicative coupling. Machines may be interconnected by way of a physical and/or logical network, such as an intranet, the Internet, local area networks, wide area networks, etc. One skilled in the art will appreciated that network communication may utilize various wired and/or wireless short range or long range carriers and protocols, including radio frequency (RF), satellite, microwave, Institute of Electrical and Electronics Engineers (IEEE) 802.11, Bluetooth, optical, infrared, cable, laser, etc.
The invention may be described by reference to or in conjunction with associated data including functions, procedures, data structures, application programs, etc. which when accessed by a machine results in the machine performing tasks or defining abstract data types or low-level hardware contexts. Such embodiments may also be referred to as program products. Associated data may be stored in, for example, the volatile and/or non-volatile memory, e.g., RAM, ROM, etc., or in other storage devices and their associated storage media, including hard-drives, floppy-disks, optical storage, tapes, flash memory, memory sticks, digital video disks, biological storage, etc. Associated data may also be used in conjunction with communications media such antennas, wires, optical fibers, microwaves, radio waves, and other electromagnetic or optical carriers. Associated data may be delivered over transmission environments, including physical and/or logical networks, in the form of packets, serial data, parallel data, propagated signals, etc., and may be used in a compressed or encrypted format. Associated data may be used in a distributed environment, and stored locally and/or remotely for machine access.
Having described and illustrated the principles of the invention with reference to illustrated embodiments, it will be recognized that the illustrated embodiments may be modified in arrangement and detail without departing from such principles. And, though the foregoing discussion has focused on particular embodiments, other configurations are contemplated. In particular, even though expressions such as “illustrated embodiment” or the like are used herein, these phrases are meant to generally reference embodiment possibilities, and are not intended to limit the invention to particular embodiment configurations. As used herein, these terms may reference the same or different embodiments that are combinable into other embodiments. Further, the various embodiments may be combined in any manner desired, to produce combinations not specifically discussed herein.
Consequently, in view of the wide variety of permutations to the embodiments described herein, this detailed description and accompanying material is intended to be illustrative only, and should not be taken as limiting the scope of the invention. What is claimed as the invention, therefore, is all such modifications as may come within the scope and spirit of the following claims and equivalents thereto.
Number | Name | Date | Kind |
---|---|---|---|
3914741 | Bonser et al. | Oct 1975 | A |
4541091 | Nishida et al. | Sep 1985 | A |
4672609 | Humphrey et al. | Jun 1987 | A |
4907228 | Bruckert et al. | Mar 1990 | A |
5173905 | Parkinson et al. | Dec 1992 | A |
5455834 | Chang et al. | Oct 1995 | A |
5530835 | Vashi et al. | Jun 1996 | A |
5940137 | Hulvey | Aug 1999 | A |
5940313 | Senba | Aug 1999 | A |
5996113 | Korn et al. | Nov 1999 | A |
6101198 | Koenig et al. | Aug 2000 | A |
6760743 | Heddes et al. | Jul 2004 | B1 |
7428686 | Aoyama et al. | Sep 2008 | B2 |
20010037406 | Philbrick et al. | Nov 2001 | A1 |
20040139253 | Perego et al. | Jul 2004 | A1 |
20040193821 | Ruhovets et al. | Sep 2004 | A1 |
20050007805 | Ware et al. | Jan 2005 | A1 |
20060095620 | Dreps et al. | May 2006 | A1 |
20060242537 | Dang | Oct 2006 | A1 |
20090013108 | Rajamani | Jan 2009 | A1 |
Number | Date | Country |
---|---|---|
112006000349 | Feb 2008 | DE |
2004193664 | Jul 2004 | JP |
200705170 | Feb 2007 | TW |
2004102403 | Nov 2004 | WO |
2006083899 | Aug 2006 | WO |
Number | Date | Country | |
---|---|---|---|
20060236196 A1 | Oct 2006 | US |