A comparison of binary quasi-cyclic decoder implementations

Decoding algorithms have been developed for binary quasi-cyclic (QC) codes of rates 1/n/sub 0/ and (n/sub 0/-1)/n/sub 0/. This paper presents hardware and software implementations of these algorithms, and compares them with respect to speed and complexity. The algorithms are illustrated with (36,24) and (30,15) QC codes.