Construction of bio-constrained code for DNA data storage

Thumbnail Image
08695057.pdf(387.63 KB)
Accepted Version
Wang, Yixin
Noor-A-Rahim, Md.
Gunawan, Erry
Guan, Yong Liang
Poh, Chueh Loo
Journal Title
Journal ISSN
Volume Title
Institute of Electrical and Electronics Engineers (IEEE)
Research Projects
Organizational Units
Journal Issue
With extremely high density and durable preservation, DNA data storage has become one of the most cutting-edge techniques for long-term data storage. Similar to traditional storage which impose restrictions on the form of encoded data, data stored in DNA storage systems are also subject to two biochemical constraints, i.e., maximum homopolymer run limit and balanced GC content limit. Previous studies used successive process to satisfy these two constraints. As a result, the process suffers low efficiency and high complexity. In this paper, we propose a novel content-balanced run-length limited (C-RLL) code with an efficient code construction method, which generates short DNA sequences that satisfy both constraints at one time. Besides, we develop an encoding method to map binary data into long DNA sequences for DNA data storage, which ensures both local and global stability in terms of satisfying the biochemical constraints. The proposed encoding method has high effective code rate of 1.917 bits per nucleotide and low coding complexity.
DNA , Memory , Silicon , Complexity theory , 3G mobile communication , Precoding , DNA data storage , Run-length limited code , Long term data storage , Constrained code
Wang, Y., Noor-A-Rahim, M., Gunawan, E., Guan, Y. L. and Poh, C. L. (2019) 'Construction of bio-constrained code for DNA data storage', IEEE Communications Letters. doi: 10.1109/LCOMM.2019.2912572
© 2019, IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.