A Simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latency

A highly parallel maximum a posteriori (MAP) decoding algorithm is proposed for high code rate, R = (n-1)/ n , ordinary (nonpunctured) convolutional codes using trellises of reciprocal dual convolutional codes. The advantages of this approach include a substantial reduction of decoding latency and decoding complexity, and a substantial increase of decoding throughput. Applying the proposed parallel decoding algorithm to a class of serial concatenation codes that consist of high rate ordinary convolutional codes, over additive white Gaussian noise (AWGN) channels, good bit error rate (BER) and block error rate performance, comparable to that of turbo codes and low density parity check (LDPC) codes, can be obtained with smaller overall decoding complexity than that of LDPC codes.