Performance of Optimal Data Shaping Codes
Yi Liu, Pengfei Huang, Paul H. Siegel
TL;DR
This paper investigates the theoretical limits of data shaping codes for flash memory, proving that optimal shaping combines lossless compression with endurance coding, and analyzes conditions for direct shaping code optimality.
Contribution
It establishes a separation theorem for optimal data shaping, linking compression and endurance coding, and derives the expansion factor minimizing wear cost.
Findings
Optimal data shaping achieved by concatenating compression and endurance coding
Derived the expansion factor that minimizes total wear cost
Established conditions under which direct shaping codes are optimal
Abstract
Data shaping is a coding technique that has been proposed to increase the lifetime of flash memory devices. Several data shaping codes have been described in recent work, including endurance codes and direct shaping codes for structured data. In this paper, we study information-theoretic properties of a general class of data shaping codes and prove a separation theorem stating that optimal data shaping can be achieved by the concatenation of optimal lossless compression with optimal endurance coding. We also determine the expansion factor that minimizes the total wear cost. Finally, we analyze the performance of direct shaping codes and establish a condition for their optimality.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cellular Automata and Applications · Caching and Content Delivery
See pages 1-7 of General_shaping_code_0418.pdf