Research of fast decoding for longer constraint length convolutional codes

• Published in: Tongxin Xuebao Vol. 31; pp. 57 - 64
• Main Authors: HUANG Xiao-ling, YANG Hua-long
• Format: Journal Article
• Language: Chinese
• Published: Editorial Department of Journal on Communications 01.03.2010
• Subjects: convolutional codes;decoding algorithm;particle swarm optimization;decoding performance
• ISSN: 1000-436X

To overcome the disadvantage of Viterbi decoding algorithm, in which its complexity exponentially increases with the increasing constraint length of convolutional codes, and the decoding delay was too large to fit the decoding of longer constraint length convolutional codes, a fast decoding of convolutional codes for longer constraint length, based on improved particle swarm optimization algorithm, was proposed. The proposed method reduces the searching area in the grid of decoding and shortens the decoding delay by setting the population size M to determine the number of decoding path, therefore was more suitable for longer constraint length convolutional codes. Another method of decoding convolu- tional codes based on self-adapting of decoding width was also proposed. Simulation results show that the proposed both methods have advantages in reducing the computational complexity and the decoding time.