Efficient encoding and decoding algorithm used in Reed-Solomon codes for multiple fault-tolerance memories
暂无分享,去创建一个
[1] Ricardo Reis,et al. An automatic technique for optimizing Reed-Solomon codes to improve fault tolerance in memories , 2005, IEEE Design & Test of Computers.
[2] Zhu Ming,et al. Reliability of Memories Protected by Multibit Error Correction Codes Against MBUs , 2011, IEEE Transactions on Nuclear Science.
[3] Edoardo D. Mastrovito,et al. VLSI Designs for Multiplication over Finite Fields GF (2m) , 1988, AAECC.
[4] H. Puchner,et al. Investigation of multi-bit upsets in a 150 nm technology SRAM device , 2005, IEEE Transactions on Nuclear Science.
[5] R. Koga,et al. Single-word multiple-bit upsets in static random access devices , 1993 .
[6] Liyi Xiao,et al. Low redundancy overhead multibit error correction in memory , 2010, 2010 Academic Symposium on Optoelectronics and Microelectronics Technology and 10th Chinese-Russian Symposium on Laser Physics and Laser TechnologyOptoelectronics Technology (ASOT).
[7] Ofer Amrani,et al. Reed-Muller codes: Projections onto GF (4) and multilevel construction , 2001, IEEE Trans. Inf. Theory.
[8] Dhiraj K. Pradhan,et al. Matrix Codes: Multiple Bit Upsets Tolerant Method for SRAM Memories , 2007, 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007).
[9] J. Draper,et al. Parallel double error correcting code design to mitigate multi-bit upsets in SRAMs , 2008, ESSCIRC 2008 - 34th European Solid-State Circuits Conference.