This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Linear Sum Codes for Random Access Memories
September 1988 (vol. 37 no. 9)
pp. 1030-1042
Linear sum codes (LSCs) form a class of error control codes designed to provide on-chip error correction to semiconductor random access memories (RAMs). They use the natural addressing scheme found on RAMs to form and access codewords with a minimum of overhead. The authors formally define linear sum codes and examine some of their characteristics. Specifically, they examine their minimum dista

[1] C. L. Chen and M. S. Hsiao, "Error-correcting codes for semiconductor memories: A state-of-the-art review,"IBM J. Res. Develop., vol. 28, Mar. 1984.
[2] T. C. May and M. H. Woods, "Alpha particle induced soft errors in dynamic RAM's,"IEEE Trans. Electron Devices, vol. ED-26, pp. 2-9, Jan. 1979.
[3] T. Fuja and C. Heegard, "Row/column replacement for the control of hard defects in semiconductor RAM's,"IEEE Trans. Comput., vol. C-35, pp. 996-1000, Nov. 1986.
[4] F. I. Osman, "Error-correction techniques for random-access memories,"IEEE J. Solid-State Circuits, vol. SC-17, pp. 877-881, Oct. 1982.
[5] T. Manoet al., "Circuit techniques for a VLSI memory,"IEEE J. Solid-State Circuits, vol. SC-18, pp. 463-469, Oct. 1983.
[6] J. Yamadaet al., "A sub-micron 1 Mbit dynamic RAM with a 4-bit-ata-time built-in ECC circuit,"IEEE J. Solid State Circuits, vol. SC-19, pp. 627-633, Oct. 1984.
[7] T. Mano, T. Matsumura, J. Yamada, J. Inoue, S. Nakajima, K. Minegishi, K. Miura, T. Matsuda, C. Hashimoto, and H. Namatsu, "Circuit technologies for 16Mbit DRAM's," inIEEE Int, Solid-State Circuits Conf., Dig. Tech, Papers, vol. 30, Feb. 1987, pp. 22-23, 323-324.
[8] J. E. O'Toole, T. M. Trent, and W. D. Parkinson, "256K dynamic error corrected ram," memorandum, Micron Technologies, Inc.
[9] T. Fuja, C. Heegard, and R. Goodman, "Some linear sum codes for random access memories," inProc. IEEE Int. Symp. Inform. Theory, Brighton, England, June 23-28, 1985.
[10] T. Fuja, C. Heegard, and R. Goodman, "The structure and complexity of linear sum codes," inProc. Allerton Conf. Commun., Contr., Comput., Champaign-Urbana, IL, Oct. 2-4, 1985.
[11] M. Y. Hsiao, "A class of optimal minimum odd-weight-column SECDED codes,"IBM J. Res. Develop., vol. 14, pp. 395-401, July 1970.
[12] W. W. Peterson and E. J. Weldon, Jr.,Error-Correcting Codes. Cambridge, MA: MIT Press, 1972.

Index Terms:
linear sum codes; random access memories; LSCs; error control codes; on-chip error correction; semiconductor random access memories; error correcting; error correction codes; random-access storage.
Citation:
T. Fuja, C. Heegard, R. Goodman, "Linear Sum Codes for Random Access Memories," IEEE Transactions on Computers, vol. 37, no. 9, pp. 1030-1042, Sept. 1988, doi:10.1109/12.2254
Usage of this product signifies your acceptance of the Terms of Use.