Advertisement

A Method for Reducing the Complexity of Meggitt Decoder

  • Jiayan Zhang
  • Shuai Wang
  • Hao Lu
  • Hongchao An
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 463)

Abstract

The decoding principle of linear block code is based on the syndrome which determines the error location of the received codeword. When considering the Hamming code, there will be eight syndromes with eight decoding circuits when there is one bit error. Cyclic code is a special case of linear block codes which is still a cyclic code after cyclic shift. Therefore, it is possible to get another error pattern of the cyclic code after the cyclic shift of one error pattern. Meggitt decoder can take advantage of the cyclic shift characteristic to divide any error pattern and all the corresponding cyclic shift error patterns into one category. And the same type of error patterns can use the same decoding circuit which can simplify the complexity of the decoder. If the (n, k) cyclic code is to correct t bits error, it is easy to derivation the total number of the error patterns. But there exists error patterns that can be classified as one type. The total number of error pattern types will be discussed in this paper. And the computation complexity of error pattern types of Meggitt decoder will be reduced when using the method proposed in this paper.

Keywords

Cyclic code Meggitt decoder Types of error pattern 

Notes

Acknowledgments

This work was supported by the Fundamental Research Funds for the Center Universities (Grant No. HIT.MKSTISP.2016 13).

References

  1. 1.
    Calkavur, S.: Binary cyclic codes and minimal codewords. Comput. Technol. Appl. Engl. 9, 486–489 (2013)Google Scholar
  2. 2.
    Feyziyev, F.G., Babavand, A.M.: Description of decoding of cyclic codes in the class of sequential machines based on the Meggitt theorem. Autom. Control Comput. Sci. 46(4), 164–169 (2012)Google Scholar
  3. 3.
    Lin, S., Costell, D.J.: Error Control Coding, pp. 25–65. Person Education Inc., Upper Saddle River (2004)Google Scholar
  4. 4.
    Bhaintwal, M.: Skew quasi-cyclic codes over Galois rings. Des. Codes Crypt. 62(1), 85–101 (2012)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Harbin Institute of TechnologyHarbinChina

Personalised recommendations