Matrix codes for reliable and cost efficient memory chips

  • Authors:
  • Costas Argyrides;Dhiraj K. Pradhan;Taskin Kocak

  • Affiliations:
  • Department of Computer Science, University of Bristol, Bristol, U.K.;Department of Computer Science, University of Bristol, Bristol, U.K.;Department of Computer Engineering, Bahcesehir University, Istanbul, Turkey

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a method to protect memories against multiple bit upsets and to improve manufacturing yield. The proposed method, called a Matrix code, combines Hamming and Parity codes to assure the improvement of reliability and yield of the memory chips in the presence of high defects and multiple bit-upsets. The method is evaluated using fault injection experiments. The results are compared to well-known techniques such as Reed-Muller and Hamming codes. The proposed technique performs better than the Hamming codes and achieves comparable performance with Reed-Muller codes with very favorable implementation gains such as 25% reduction in area and power consumption. It also achieves reliability increase by more than 50% in some cases. Further, the yield benefits provided by the proposed method, measured by the yield improvements per cost metric, is up to 300% better than the ones provided by Reed-Muller codes.