Skip to main content

Error correction codes

  • Chapter
  • First Online:
Inside NAND Flash Memories
  • 4258 Accesses

Abstract

As we have seen in Chap. 13, redundancy covers manufacturing defects while ECC takes care of the failures during the life of the device. This chapter deals with error correction codes applied to NAND Flash memories. In fact, when the memory is placed in its final application, different reasons for errors (see Chap. 4) can damage the written information so that it could happen that the read message is not equal to the original anymore [1].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. R. Micheloni, A. Marelli, R. Ravasio “Error Correction Codes for Non-Volatile Memories”, Springer, 2008.

    Google Scholar 

  2. S. Lin, D. J. Costello, “Error Control Coding”, Prentice Hall, June 2004.

    Google Scholar 

  3. T. K. Moon, “Error Correcting Coding - Mathematical Methods and Algorithms”, Wiley, 2005.

    Book  Google Scholar 

  4. S. B. Wicker, “Error Control for Digital Communication and Storage”, Prentice Hall, 1995.

    Google Scholar 

  5. R. C. Bose, D. K. Ray-Chaudhuri, “On a Class of Error-Correcting Binary Group Codes”, Information and Contribution, vol. 3, March 1960.

    Google Scholar 

  6. E. R. Berlekamp, “Algebraic Coding Theory”, McGraw-Hill, 1968.

    MATH  Google Scholar 

  7. J. Massey, “Shift-Register Synthesis and BCH Decoding”, IEEE Transactions on Informaton Theory, vol. 15, Jan. 1969.

    Google Scholar 

  8. S: Reed, M. T. Shih, T. K. Truong, “VLSI Design of Inverse-Free Berlekamp-Massey Algorithm”, IEEE Proceedings, vol. 138, Sept. 1991.

    Google Scholar 

  9. S. Reed, G. Solomon, “Polynomial Codes over Certain Finite Fields”, Journal of SIAM, vol. 8, June 1960.

    Google Scholar 

  10. R. Micheloni, A. Marelli, R. Ravasio, “Method and System for Correcting Low Latency Errors in Read and Write Non Volatile Memories, Particularly of the Flash Type”, US patents, US 2006/0010363 A1.

    Google Scholar 

  11. R. Micheloni et al.,”A 4Gb 2b/cell NAND Flash Memory with Embedded 5b BCH ECC for 36MB/s System Read Throughput Solid-State Circuits Conference”, 2006. Digest of Technical Papers. ISSCC. 2006 IEEE International, Feb. 2006 Page(s): 497–506.

    MATH  Google Scholar 

  12. R. Micheloni, A. Marelli, R. Ravasio, “Method and System for Correcting Errors in Electronic Memory Device”, US patents US 2006/0005109 A1.

    Google Scholar 

  13. R. Micheloni, A. Marelli, R. Ravasio, “Reading Method of a Memory Device With Embedded Errors Correcting Code and Memory Device With Embedded Error Correcting Code”, US patents US 2007/0234164 A1.

    Google Scholar 

  14. R. G. Gallager, “Low-density parity-check codes,” IRE Transactions on Information Theory, vol. IT-8, pp. 21–28, Jan. 1962.

    Article  MathSciNet  Google Scholar 

  15. V. Zyablov and M. Pinsker, “Estimation of the error-crrection complexity of Gallager low-density codes,” Problemy Peredachi Informatsii, vol. 11, pp. 23–26, Jan. 1975.

    MATH  Google Scholar 

  16. R. M. Tanner, “A recursive approach to low complexity codes,” IEEE Transactions on Information Theory, vol. IT-27, no. 5, pp. 533–547, Sept. 1981.

    Article  MathSciNet  Google Scholar 

  17. G. A. Margulis, “Explicit constructions of graphs without short cycles and low density codes,” Combinatorica, vol. 2, no. 1, pp. 71–78, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  18. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near shannon limit error-correcting coding and decoding: Turbo-codes,” in Proceedings of ICC’93, Geneve, Switzerland, May 1993, pp. 1064–1070.

    Google Scholar 

  19. N. Wiberg, “Codes and decoding on general graphs,” Ph.D. Dissertation, Linkoping University, Sweden, 1996.

    Google Scholar 

  20. D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electronics Letters, vol. 32, pp. 1645–1646, Aug. 1996.

    Article  Google Scholar 

  21. Z. Li, L. Chen, S. Lin, W. Fong, and P.-S. Yeh, “Efficient encoding of quasi-cyclic low-density parity-check codes,” IEEE Transactions on Communications, vol. 54, pp. 71–81, Jan. 2006.

    Article  Google Scholar 

  22. F. Guilloud, E. Boutillon, J. Tousch, and J.-L. Danger, “Generic description and synthesis of LDPC decoders,” IEEE Transactions on Communications, vol. 55, pp. 2084–2091, Nov. 2007.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to T. Zhang .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Zhang, T., Marelli, A., Micheloni, R. (2010). Error correction codes. In: Inside NAND Flash Memories. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9431-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-9431-5_14

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-9430-8

  • Online ISBN: 978-90-481-9431-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics