Woven convolutional graph codes with large free distances

Problems of Information Transmission (Impact Factor: 0.6). 03/2011; 47(1):1-14. DOI: 10.1134/S0032946011010017


Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional
graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble
of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi decoding of woven graph codes are presented and discussed.

Full-text preview

Available from:
  • [Show abstract] [Hide abstract]
    ABSTRACT: Currently, the search of good punctured convolutional code (PCC) is mainly based on exhaustive search. Nevertheless, the computational complexity of exhaustive search increases exponentially as the number of encoder's input or the constraint length increases. Therefore, the use of exhaustive search codes is limited in cases of with high bit rates and great constraint lengths. To solve the problem, a new method based on quantum genetic algorithm is proposed for searching good PCCs. The new method optimizes the fitness function through quantum bits encoding and quantum revolving door updating. The experimental results show that the proposed method not only converges quickly but also has good flexibility when compared to exhaustive search.
    No preview · Article · Sep 2013 · Shenzhen Daxue Xuebao (Ligong Ban)/Journal of Shenzhen University Science and Engineering