Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Acta Electronica Sinica》 2017-04
Add to Favorite Get Latest Update

Novel Fountain Codes Based on Modulo and Extended Euclidean

ZHU Wen-jie;YI Ben-shun;GAN Liang-cai;YAO Wei-qing;School of Electronic Information,Wuhan University;Shenzhen Institute of Wuhan University;  
Aiming at the intrinsic problems of Chinese Remainder Theorem in fountain decoding process with modular arithmetic, this paper proposes a decoding algorithm based on extended Euclidean theorem. The linear congruence equations are merged in the extended Euclidean decoding algorithm,which avoids the failure of solving the rate factor when the decomposition factors are non-coprime. In the modular arithmetic fountain encoding process, the original packet is continuously decomposed by the factor,which is randomly selected from the natural number, into the encoded packets consisting of the residues and the factors. When a certain amount of packets are received, it can be achieved to decode successfully. The codec efficiency has been improved as the algorithm has extended the range of the modular arithmetic factor. Through theoretical analysis and numerical simulation, the effectiveness of this decoding algorithm of modular arithmetic fountain code has been proved.
【Fund】: 国家自然科学基金(No.61371125 No.61072041);; 深圳市基础研究项目(No.JCYJ20150630153917254)
【CateGory Index】: TN911.22
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved