Article

Single Byte Error Correcting—Double Byte Error Detecting Codes for Memory Systems

Musashino Electrical Communication Laboratory, Nippon Telegraph and Telephone Public Corporation
IEEE Transactions on Computers (Impact Factor: 1.47). 08/1982; DOI: 10.1109/TC.1982.1676056
Source: IEEE Xplore

ABSTRACT In a memory that uses byte-organized memory chips, each containing b (≥2) output bits, a single chip failure is likely to affect many bits within a byte. Single byte error correcting–double byte error detecting codes (SbEC–DbED codes) are used in this kind of memory system to increase reliability.

1 Follower
 · 
119 Views
  • Source
    • "All addresses and data are ECC protected, and they are checked and corrected at the input ports of LSI devices. 4-bit block correction and 4-bit double block detection (class of S4EC-S8/4ED [2]) are employed for data paths. If a correctable error is detected, the error is corrected, operation is not interrupted, and duplex operation is maintained. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The PRIMEQUEST is an open architecture 32-way true-SMP server with powerful reliability features, which was designed and is manufactured by Fujitsu Limited. The PRIMEQUEST server was designed with a focus on high reliability and high performance. It incorporates processors of the Intel ® Itanium® processor family (IPF). We utilized rapidly improving silicon device technologies, specifically, high-density and high-speed technologies, in this system to obtain not only high performance but also high reliability. High-frequency data transfer technology, 90-nm silicon technology, and packaging technology providing high densities and optimized cooling were utilized in order to create a high performance system. We developed a new cache-state snooping method. With this method, both high-frequency operation and low-latency memory access even in a large-scale SMP are achieved. And flexible I/O functions are also realized. A system with 32 CPUs and 667-MHz DDR2 memory running at a system bus frequency of 1.3 GHz provides a memory bandwidth of 170 GB/s throughout the system. For high reliability, inter-chip and intra-chip connections are fully duplicated, and many checkers are properly integrated. These checking mechanisms ensure continuous operation by detecting faults and then disconnecting faulty parts and failed paths. We implemented this duplication extensively in the machines of the PRIMEQUEST series; the technology is called dual synchronous system architecture (DSSA). Our estimate of the resulting availability in a clustered system is 99.999%. 1.
  • Source
    • "Construction of codes correcting byte errors and properties of such codes are also studied. Some of the related work can be found in [2], [3]. However, the Lee metric was developed as an alternative to the Hamming metric for certain noisy channels that use phase-shift keying modulation [4]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to fit the large capacity memory systems that use high-density random access memory (RAM) chips with input/output data of 8, 16, and 32 bits. The MacWilliams identity describes how the weight enumerator of a linear code and the weight enumerator of its dual code are related. Also, Lee metric which has attracted many researchers due to its applications. In this paper, we combine these two interesting topics and introduce the m-spotty generalized Lee weights and the m-spotty generalized Lee weight enumerators of a code over Z q and prove a MacWilliams type identity. This generalization includes both the case of the identity given in the paper [I. Siap, MacWilliams identity for m-spotty Lee weight enumerators, Appl. Math. Lett. 23 (1) (2010) 13-16] and the identity given in the paper [M. \"Ozen, V. \c{S}iap, The MacWilliams identity for m-spotty weight enumerators of linear codes over finite fields, Comput. Math. Appl. 61 (4) (2011) 1000-1004] over Z2 and Z3 as special cases.
  • [Show abstract] [Hide abstract]
    ABSTRACT: One of the objectives of coding theory is to ensure reliability of the computer memory systems that use high-density RAM chips with wide I/O data (e.g. 16, 32, 64 bits). Since these chips are highly vulnerable to m-spotty byte errors, this goal can be achieved using m-spotty byte error-control codes. This paper introduces the m-spotty Lee weight enumerator, the split m-spotty Lee weight enumerator and the joint m-spotty Lee weight enumerator for byte error-control codes over the ring of integers modulo ℓ (ℓ ≥ 2 is an integer) and over arbitrary finite fields, and also discusses some of their applications. In addition, MacWilliams type identities are also derived for these enumerators.
    Designs Codes and Cryptography 04/2014; 71(1). DOI:10.1007/s10623-012-9725-z · 0.73 Impact Factor
Show more