A flash code utilizing dynamic segment allocation

A novel flash code is proposed, and shown to have good average-case performance through computer simulation. The proposed code utilizes dynamic segments which are allocated in an erase block of a flash memory. A segment consists of one or more slices which have 2 cells. A segment is dynamic in the sense that it can be expanded to accommodate as many write operations as possible, and the expansion contributes to assign more number of cells to more frequently written bits. The average write deficiency of the code is evaluated by computer simulation, and shown to have better performance than ILIFC which was proposed by Mahdavifar et al. This result suggests that we can accommodate more data in a fixed-size erase block, and, allow longer life-time cycle of flash memory products.