Performance of Shaping Codes for Flash Memory
Abstract: In this paper, we formally define general shaping codes and develop a theoretical bound on the tradeoff between code rate and average cost. A consequence of the analysis is a separation theorem, which states that optimal shaping can be achieved by a concatenation of lossless compression and endurance coding. Finally, we specialize the analysis to SLC direct shaping codes and conclude with results of an experimental evaluation of an MLC direct shaping code.
Bio: Yi Liu received the B.E. degree in Physics from Peking University, Beijing, China, in 2014. He is currently a Ph, D, student in the ECE department at UCSD. His current research focuses on shaping codes and flash memory.