Abstract

This paper investigates the construction and iterative threshold decoding of low rate Quasi-Cyclic One Step Majority logic codes based on combinatorial designs. These codes are constructed with two type of difference family: cyclic disjoint difference sets and cyclic disjoint difference family. They can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding (ITD) algorithm. We present an amelioration of ITD algorithm for decoding these codes. This algorithm modification can be applicable for every code rate. The performances of this algorithm for decoding these codes on Additive White Gaussian Noise (AWGN) channel, is investigated.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.