摘要
为解决数字喷泉码编码分组中度和邻接关系间的传输与恢复问题,提出一种基于一维Markov映射(ODMM)的LT编解码算法。根据ODMM的相空间分布特性,通过映射方程产生均匀分布的伪随机序列,实现对编码分组的度和邻接数据的选取,用混沌方程初值作为公钥,实现喷泉码的度与邻接关系的低开销传输与恢复。仿真结果表明,该算法结构简单,能降低传输消耗,提高译码成功率。
An algorithm of LT coding and decoding based on One-dimensional Markov Mapping（ODMM） is presented to solve the problem of transmission and recovering of degree and adjacency relationship in block coding of fountain codes.According to the distribution of ODMM in phase space,the degree and adjacency data in block coding are selected through uniform distributed pseudorandom sequence which is generated by the mapping equation.Using the initial value of chaotic equation as public keys,the low overhead transmission and recovering of degree and adjacency relationship of fountain codes are implemented.Results of simulation show that the algorithm is easy to realize,reduces the losses in transmission and increases the success rate of decoding.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第23期264-266,共3页
Computer Engineering
基金
教育部博士学科点专项基金资助项目(20090031110029)
天津市自然科学基金资助重点项目(08JCZDJC21900)
关键词
喷泉码
LT码
一维Markov映射
混沌映射
伪随机序列
均匀分布
fountain codes
LT code
One-dimensional Markov Mapping（ODMM）
chaotic mapping
pseudorandom sequence
uniform distribution
