Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (3): 121-125.doi: 10.13190/jbupt.201003.121.huangch

• Reports • Previous Articles     Next Articles

Fountain Codes Based on Modulo and Chaos

HUANG Cheng1,2, YI Ben-shun1, GAN Liang-cai1, XIE Wen-hua1, DENG Zai-hui1   

  1. (1. Electronic Information School, Wuhan University, Wuhan 430079, China; 

    2. China Telecom Wuhan Branch Company, Wuhan 430071, China)

  • Received:2009-08-01 Revised:2010-03-05 Online:2010-06-28 Published:2010-05-14

Abstract:

A new class of fountain codes named Chinese transform (CT) codes is proposed to solve the

 problem of the efficient transmission in high speed wireless network. Different from existing 

fountain codes based on Tanner graph and exclusive OR (XOR) operations, the encoding of CT

 codes transforms finite original symbols into theoretically infinite encoding symbols which are

 generated by integers selected uniformly from the set of primes which are then enveloped into 

packets by chaotic position scrambling algorithm. When enough packets are received from these

 packets, original symbols can be recovered according to the CT decoding algorithm with 100%

 probability. Simulation is also shown. 

 

 

 

Key words: fountain codes, Chinese remainder theorem, chaos, Chinese transform codes