A Quasi—Orthognal L— Step Majority—Logic Decoding Algorithm
Zhao Xiaoqu · 1990
This paper describes an approach to extend one step quasi-orthognal majority-logic decoding algorithm to L-step algorithm. This approach relaxes the requirement Of orthognal property of codes. The paper presents the definition of the quasiorthognality on the set of error digital, the basic idea of quasiorthognal L-step majority-logic decoding, the block diagrams of decoder and decoding processes. The decoding precesses are discussed in term of Hamming codes. The result shows that the applied field of the majority-logic decoding algorithm can be extended, and the decoding hardware can be simplified by using the decoding algorithm.