A Fast Decoding Algorithm for Convolutional Codes based on the Finite State Machine Representation

A. El Bourichi, H. Yasuura, and A. Matsuzawa (Japan)


Fast decoding, low power, high data rate, convolutional codes


Maximum-likelihood decoding of convolutional codes based on the trellis representation, such as the Viterbi algorithm (VA), are impractical for relatively long constraint lengths. This paper proposes a novel decoding algorithm for convolutional codes based on characteristics of their finite state machine (FSM) representation. Furthermore, the delay and hardware complexity because of the metric calculations and comparisons are avoided, which makes the proposed algorithm suitable for fast high-data rate wireless applications. Simulation results show that the proposed algorithm can result in a 70% reduction in power consumption while offering comparable bit error rate performance to VA.

Important Links:

Go Back