METHOD AND SYSTEM FOR ON-ASIC ERROR CONTROL DECODING

Abstract

There are provided methods and systems for on-ASIC error control coding for verifying the integrity of data from a memory. For example, there is provided a method for encoding data into a beat. The method can be executed by a digital system configured to receive the data and construct the beat. The method includes assembling, by the digital system, a plurality of words consecutively. The plurality of words can include a first set of words in which each word has a length W, where W is the beat width. The plurality of words can further include a second set of words in which each word has a length that is smaller or equal to W. The method can further include constructing a parity word of length W, wherein each bit in the parity word is a parity associated with a distinct word in the first and second set of words. The method further includes adding the parity word to the plurality of words to form the beat.

Claims

1. A method for decoding a beat of data, the method being executed by a digital system configured to receive the beat, the method including: generating, by the digital system, a syndrome vector from the beat and a predetermined parity check matrix, the generating including computing syndrome components based on the parity check matrix and the beat; accumulating partial contributions of the beat into a register of the digital system based on the syndrome components to create the syndrome vector.

2. The method of claim 1, further including checking whether an error exists in the beat based on the syndrome vector.

3. The method of claim 1, further including receiving the beat from a memory.

4. The method of claim 3, wherein the memory is a DRAM.

5. The method of claim 1, wherein the beat is a memory transfer block.

6. The method of claim 1, wherein the digital system is an on-application specific integrated circuit (on-ASIC) error control coding (ECC) system communicatively coupled to a memory.

7. The method of claim 6, wherein the memory is a DRAM.

8. The method of claim 2, further including correcting the error.

9. The method of claim 1, wherein the beat is a Hamming code.

10. A system configured for decoding a beat of data, the system comprising: a first module configured to generate a syndrome vector from the beat and from a parity check matrix by computing syndrome components based on the parity check matrix and the beat; and a second module configured to accumulate partial contributions of the beat into a register based on the syndrome components to create the syndrome vector.

11. The system of claim 30, wherein the system is further configured to check whether an error exists in the beat based on the syndrome vector.

12. The system of claim 10, wherein the first module is further configured to receive the beat from a memory.

13. The system of claim 12, wherein the memory is a DRAM.

14. The system of claim 10, wherein the beat is a memory transfer block.

15. The system of claim 10, wherein the system is an on-application specific integrated circuit (on-ASIC) error control coding (ECC) system communicatively coupled to a memory.

16. The system of claim 15, wherein the memory is a DRAM.

17. The system of claim 10, wherein the system is further configured to correct the error.

18. The system of claim 10, wherein the beat is a Hamming code.

19. The system of claim 10, wherein the beat is a two-dimensional memory transfer block.

20. The system of claim 10, wherein the system is further configured to receive a plurality of beats.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0013] Illustrative embodiments may take form in various components and arrangements of components. Illustrative embodiments are shown in the accompanying drawings, throughout which like reference numerals may indicate corresponding or similar parts in the various drawings. The drawings are only for purposes of illustrating the embodiments and are not to be construed as limiting the disclosure. Given the following enabling description of the drawings, the novel aspects of the present disclosure should become evident to a person of ordinary skill in the relevant art(s).

[0014] FIG. 1 illustrates a system according to an embodiment.

[0015] FIG. 2 illustrates an encoding scheme according to an embodiment.

[0016] FIG. 3 illustrates a decoding scheme according to an embodiment.

DETAILED DESCRIPTION

[0017] While the illustrative embodiments are described herein for particular applications, it should be understood that the present disclosure is not limited thereto. Those skilled in the art and with access to the teachings provided herein will recognize additional applications, modifications, and embodiments within the scope thereof and additional fields in which the present disclosure would be of significant utility.

[0018] Several embodiments and teachings featured herein provide one or more features for error control coding for assessing data integrity. While the embodiments described are discussed in the context of memory applications, one of ordinary skill in the art will readily recognize that the teachings, methods, systems, and example embodiments can be employed in other applications that require data integrity assessment. Furthermore, while the applications discussed relate to dynamic RAMs (DRAM), one of ordinary skill in the art will readily recognize that the concepts and example embodiments described apply to other types of memories and memory architectures without departing from the intended scope of the present disclosure.

[0019] On-die ECC and link ECCs are often used with DRAM components in order to find errors in memory data before and after transmission of the data to another component. This approach increases the cost of DRAM components, both from a price and area standpoint. Furthermore, this typical approach requires that separate management tasks by the memory controller, and as such, it has a high reliability burden.

[0020] The embodiments provided herein obviate the need for on-die ECC and link ECCs for DRAM components. In the embodiments, these components are replaced by an on-ASIC ECC in DRAM-managed solutions, conferring the advantages of reduced costs and increased reliability, in contrast to the typical approaches described above.

[0021] Data coming from memories are typically organized in bursts of beats. In a DRAM component, the length of a beat in a burst is either 16 or 32 bits. Each beat is thus 8 or 16 bit mode, depending on the direct query (DQ) mode of the component. In an example embodiment for use with a DRAM-managed solution, there is provided a memory transfer block that is composed of BL×W bits. For example, and not by limitation, BL, which is the burst length, can be equal to 16 or 32. Furthermore, W, which is the burst width, which corresponds also to the readout bust width, can be 8 or 16. In alternate embodiments, W can be 9 or 18, depending on the additional DQ or additional pins to exchange data such as DMI pins. In the embodiments, the beat as described above can be encoded to form a memory transfer block (MTB) that includes a code work for further error checking and correction.

[0022] FIG. 1 illustrates an example system 100 according to an embodiment. The system 100 includes a memory 102, which may be, without limitation a DRAM array. One of skill in the art will readily recognize that that the memory may have an arbitrary size. In other words, the teachings featured herein apply to arrays of various sizes. The memory 102 may be interfaced to additional components via a read/write bus 104. The bus 104 may have a predetermined size, as governed by the design of the memory architecture. In the example applications described herein, the bus 104 may be used in its entirety or a subset of bus lines may be used without departing from the teachings of the present disclosure.

[0023] The bus 104 may connect the memory to an encoder 106 which is configured to read data from the memory and construct a codeword 108 which has as error correction information therein. The encoder 106 may be configured to construct the codeword 108 based on data read from the memory 102 via the bus 104 and a predetermined parity check matrix 105 P, which for example may be stored in a register. The data d may be encoded to form a payload that includes parity data p=dP. An exemplary encoding process will be described below with respect to the embodiment featured in FIG. 2.

[0024] The codeword 108 includes a plurality of words from the memory (d0, d1, - - - db) and a parity word appended at the end of the codeword. In the embodiment shown in FIG. 1, the parity word p is appended to the data from the memory 102, but this is by example only and not by limitation. In alternate embodiments, the parity word p may be included anywhere within the codeword 108.

[0025] Furthermore, the codeword 108 of FIG. 1 is shown to have 15 words and a parity word. This is only by example. Specifically, based on the memory 102′s architecture and communication protocols and bus width, the codeword 108 may be a beat of data that has a different size than what is shown in FIG. 1. In the exemplary codeword 108, the beat has 8 DQ bits and 1 DMI for each word in the beat (i.e., the data and the parity words).

[0026] The system 100 can be configured to transmit the codeword 108 after encoding to another system (not shown in its entirety). The other system may have a front-end that has a decoder 110. The decoder 110 may be configured to unpack the codeword 108 and further determine based on the parity word p and additional resources whether there is an error in the data contained in the codeword 108. The decoder 110 may then take several actions, which include identifying the location of the error, fixing the error, or reporting the error and its location to a higher level system, which itself may take additional remedial actions. The system 100 may be configured to transmit beats of data in time t, where each data beat transmitted is structured as described above, i.e., like the codeword 108.

[0027] FIG. 2 illustrates an encoding scheme 200 that may be undertaken by the encoder 106 shown in FIG. 1. The placement of the codeword in the memory transfer block (MTB) may be exploited to simplify the implementation of the encoding engine. Since at each beat the memory receives (or sends) W bit simultaneously, the encoder 106 processes operations that are exactly W-bit wide. The exemplary encoding scheme 200 is described below.

[0028] The parity is computed as p=dP, where d is the data from the memory (d=d_0 d1 . . . db) and P is the parity check matrix 105 shown in FIG. 1, where P=[P0, P1, . . . Pb]. Furthermore, di is the vector of data in the beat i, and db may have length that is smaller than W, i.e., b≤BL=1. The parity is computed as p=dP=d0 P0+d1 P1+. . . +db Pb. It is convenient to store the parity at the end of the payload in the MTB in a parity register. The parity register may be initialized to 0, and it may accumulator the partial contributions of the beats (i.e., d0P0, d1P1, etc.) The parity register thus includes the ECC parity, and its content becomes ready and finalized when the last chunk of data has been processed.

[0029] In the exemplary encoding scheme 200, the BL=16, W=9, BL×W=144, which means that the codeword length is n=144. Considering an extended Hamming code for the parity (r=9), the payload is k=n−r=135.

[0030] Turning now the decoder 110, its operation and structure are described with respect to FIG. 3 and an exemplary decoding scheme 300. In the decoding scheme 300, as an example and not by limitation, we consider linear codes, and in particular the Hamming codes and the BCH codes correcting up to t errors, with t=2,3, . . . As an example, we set t=2 for an exemplary application. The exemplary decoding process starts with the decoder 110 computing the syndrome S starting from the received codeword y. Specifically, the decoder 110 computes S=yH.sup.T. As such, the decoding of the BCH codes starts with computing the syndrome components S.sub.1, S.sub.3, . . . starting from the received codeword y as S.sub.1=y(α), S=y(α.sup.3), or, simply: S.sub.1=yA.sub.i and S.sub.3=yA.sub.3.

[0031] Furthermore, similarly to the parity register of the encoding scheme 200, the syndrome register denoted S initialized to 0, and it can accumulate the partial contributions of the beats to finally contains the syndrome. Its content will be ready after the last data chunk has been processed. Once the syndrome is finalized. The integrity of the data may be assessed based on the syndrome and the codeword received y.

[0032] Generally, the teaching of the present disclosure provides methods and application-specific systems configured to implementing on-ASIC ECC encoding or decoding on beats of data. For example, and without limitation, several general embodiments are now described. One example embodiment provides a method for encoding data into a beat. The method can be executed by a digital system configured to receive the data and construct the beat. The method includes assembling, by the digital system, a plurality of words consecutively.

[0033] The plurality of words can include a first set of words in which each word has a length W, where W is the beat width. The plurality of words can further include a second set of words in which each word has a length that is smaller or equal to W. The method can further include constructing a parity word of length W, wherein each bit in the parity word is a parity associated with a distinct word in the first and second set of words. The method further includes adding the parity word to the plurality of words to form the beat.

[0034] The method can further include receiving the data from a memory. The beat can have a burst length L, and the method can include forming additional beats of size L×W upon receiving the data. The method can include transmitting the plurality of beats in bursts, and burst can include a single beat. The memory may be a DRAM, and the beat may be a memory transfer block from the DRAM.

[0035] The digital system is an on-application specific integrated circuit error control coding system communicatively coupled to the memory. The method can further include initializing a register of the digital system and saving the parity word in the register. Furthermore, adding the parity word to the plurality of words can include appending the parity word to the plurality of words. And appending the parity word can include placing the parity word after the second set of words.

[0036] Another embodiment provides a system configured for encoding data into a beat. The system can include a first module configured to assemble a plurality of words consecutively. The plurality of words can include a first set of words in which each word has a length W, where W is the beat width. The plurality of words can further include a second set of words in which each word has a length that is smaller or equal to W. The system can include a second module configured to construct parity word of length W, and each bit in the parity word may be a parity associated with a distinct word in the first and second set of words. The system can further include a third module configured to add the parity word to the plurality of words to form the beat.

[0037] The system can further include an input section configured to receive the data from a memory, and the beat can have a burst length L. Furthermore, the system can generate additional beats of size L×W upon receiving the data. The system of claim can further include a transmitter section configured to transmit the plurality of beats in bursts, and a burst can include a single beat.

[0038] The memory may be a DRAM, and the beat may be a memory transfer block from the DRAM. The system is an on-application specific integrated circuit error control coding system communicatively coupled to the memory. The system can further include a plurality of registers configured to hold the data beat. Adding the parity word to the plurality of words can include appending the parity word to the plurality of words, for example, after the second set of words.

[0039] Another embodiment provides a method for decoding a beat of data received by a digital system. The method can include generating a syndrome vector from the beat and from a predetermined parity check matrix. Generating the vector can include computing syndrome components based on the parity check matrix and the beat. The method can further include accumulating partial contributions of the beat into a register of the digital system based on the syndrome components in order to create the syndrome vector. The method further includes checking whether an error exists in the beat based on the syndrome vector and correcting the error. The beat may be received from a memory, which may be a DRAM. The beat may be a memory transfer block. The beat may be a Hamming code.

[0040] Yet, another embodiment may provide a system configured for decoding a beat of data. The system may include a first module configured to generate a syndrome vector from the beat and from a parity check matrix by computing syndrome components based on the parity check matrix and the beat. The system may further include a second module configured to accumulate partial contributions of the beat into a register based on the syndrome components to create the syndrome vector.

[0041] The system may be configured to check whether an error exists in the beat based on the syndrome vector. The first module is further configured to receive the beat from a memory. The memory may be a DRAM, and the beat may be a memory transfer block. The system may be an on-application specific integrated circuit (on-ASIC) error control coding (ECC) system communicatively coupled to a memory. The system may be configured to detect and correct an error based on the syndrome vector and the beat. The beat may be a Hamming code. Furthermore, the beat may be a two-dimensional memory transfer block. The system may be further configured to receive a plurality of beats.

[0042] Those skilled in the relevant art(s) will appreciate that various adaptations and modifications of the embodiments described above can be configured without departing from the scope and spirit of the disclosure. Therefore, it is to be understood that, within the scope of the appended claims, the disclosure may be practiced other than as specifically described herein.