DNA存储场景下的大小喷泉码模型设计

A large and mini fountain code model in DNA storage

在DNA存储等应用场景中,传统喷泉码算法需要占用额外信道资源将源文件分组数目K传递给解码端。在实际应用中,虽然可以将K嵌入在每一个编码数据分组中进行传递,但这种做法会严重浪费信道的带宽。针对上述问题,提出了一种大小喷泉码模型,通过增加小喷泉码这一带外信道来优化关键参数的传递。小喷泉码将每个编码分组中有关参数K所占用空间的粒度降至1 bit,有效减少了带宽资源的消耗。此外,小喷泉码还能适应由于DNA存储介质不均匀所导致的编码序列不定长的限制条件,一定条件下甚至可以完全不占用额外信道带宽。

In application scenarios such as DNA storage,the traditional fountain code algorithm must transmit the number K of source file packets to the decoder through an additional channel.In practical applications,although K can be embedded in each coded data packet to transmit this key parameter,this method will seriously waste the channel's bandwidth.Aiming at the above problems,a large and mini fountain code model is proposed,which optimizes the transmission of critical parameters by adding the out-of-band channel of the mini fountain code.The mini fountain code reduces the granularity of the space occupied by the critical information about the parameter K in each coding group to 1 bit,effectively reducing the consumption of bandwidth resources.In addition,the mini fountain code can also adapt to the restriction of the indefinite length of the coding sequence caused by the inhomogeneity of the DNA storage medium.Under certain conditions,it cannot even occupy additional channel bandwidth at all.