论文部分内容阅读
为了解决高速无线网络中的传输有效性问题,提出一类新的喷泉码机制及其编译码算法,称为中国变换(CT)码.不同于基于因子图和异或(XOR)运算的现有喷泉码机制,该码的编码算法通过在素数集中均匀选取素数将有限长度的原始分组不断分解为包含余数的编码分组,通过混沌位置置乱算法生成编码分组,接收端只要从这些编码分组中接收固定数量的分组,即能以100%的概率恢复译码.仿真实验验证了新喷泉码的机制及构造的有效性.
In order to solve the problem of transmission efficiency in high-speed wireless networks, a new type of fountain code mechanism and its coding and decoding algorithm is proposed, which is called China Transform (CT) code.Different from the existing methods of factor graph and XOR Fountain code mechanism. The coding algorithm of this code decodes the original packet of finite length into the encoded packets containing the remainder by uniformly selecting the prime numbers in the prime number set, and generates the encoded packets by the chaotic position scrambling algorithm. The receiving end only needs to receive the encoded packets from these encoded packets A fixed number of packets, that is, with a probability of 100% to restore the decoding.Experimental results show that the new fountain code mechanism and the validity of the structure.