earticle

논문검색

The K-Partition Flash Code with BIFC-based Sharing and some Variants

초록

영어

Flash codes are used to handle decoding and encoding of digital information to flash memory devices. The performance of a flash code is usually evaluated using the write deficiency metric. This paper introduces the K-Partition Flash Code (KPFC) with BIFC-based sharing and explores some of its variants KPFC is a coding scheme that involves a sharing mechanism within partitions of a flash memory block. The technique was designed to allow more cell writes to flash devices in order to improve its performance by lowering its write deficiency. Computer simulations were conducted to estimate the average case performances of the flash codes. Simulation results showed that its performance is generally better than the flash codes in literature.

목차

Abstract
 1. Introduction
 2. Preliminaries
 3. Related Literature
  3.1 Index-less Indexed Flash Code and Layered Index-less Indexed Flash Code
  3.2 Bimodal Flash Code and 2-Split Bimodal Flash Code
  3.3 Binary Indexed Flash Code and BIFC-RCM
  3.4 Simple Segmentation Flash Code and the Phoenix Flash Code
 4. Computer Simulation for Average Case Write Deficiency
 5. K-Partition Flash Code with BIFC-based Sharing and its Variants
  5.1. KPFC-s
  5.2. KPFC-r
  5.3. KPFC-m
  5.4. KPFC-r and KPFC-m in Steady Dominated Distributions
 6. Comparison of KPFC variants with existing Flash Codes
 7. Conclusion
 References

저자정보

  • Riz Rupert L. Ortiz Ateneo de Manila University
  • Proceso L. Fernandez, Jr. Ateneo de Manila University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.