원문정보
초록
영어
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.
목차
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