Loading [a11y]/accessibility-menu.js
A Simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latency | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Monday, 27 January, the IEEE Xplore Author Profile management portal will undergo scheduled maintenance from 9:00-11:00 AM ET (1400-1600 UTC). During this time, access to the portal will be unavailable. We apologize for any inconvenience.

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


Abstract:

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...Show More

Abstract:

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.
Date of Conference: 27 June 2004 - 02 July 2004
Date Added to IEEE Xplore: 10 January 2005
Print ISBN:0-7803-8280-3
Conference Location: Chicago, IL

References

References is not available for this document.