This paper presents a threshold decoding algorithm which is called as a quasi-orthognal two-step majority-logic decoding algorithm. The algorithm overcomes the threshold decoding algorithm shortcoming-too strict requirement for codes and narrow scope of application. The paper gives the definition of the quasi-orthognal and a basic idea of quasi-orthognal two-step majority-logic decoding, as well as block diagrams for type-Ⅱdecoders and decoding processes. Combine with(7,4) circulate code for the example discussed this kind of to translate the code method, the result enunciation, this kind of application that translated the code method to open widely big few logicses to translate the code method, the logarithms word delivers practical meaning.
With the traditional algorithm, the algorithm is fast decoding and hardware complexity several advantages, thus enabling the decoder is fast, stable performance characteristics.
