A comparison of binary quasi-cyclic decoder implementations

TitleA comparison of binary quasi-cyclic decoder implementations
Publication TypeConference Paper
Year of Publication2000
AuthorsBandsmer, M., V. K. Bhargava, and T. A. Gulliver
Conference NameElectrical and Computer Engineering, 2000 Canadian Conference on
Pagination280 -286 vol.1
Keywordsbinary codes, binary quasi-cyclic codes, binary quasi-cyclic decoder implementations, circulant matrix, codes rate, codewords, complexity, computational complexity, cyclic codes, decoding, decoding algorithms, error correction codes, generator matrix, hardware implementation, linear codes, linear error correcting code, matrix algebra, software implementation, speed, syndrome computation circuit
Abstract

Decoding algorithms have been developed for binary quasi-cyclic (QC) codes of rates 1/n0 and (n0-1)/n0. 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

URLhttp://dx.doi.org/10.1109/CCECE.2000.849714
DOI10.1109/CCECE.2000.849714

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia