• DocumentCode
    2559644
  • Title

    A Method of Blind Recognition of Cyclic Code Generator Polynomial

  • Author

    Wang, Jiafneg ; Yue, Yang ; Yao, Jun

  • Author_Institution
    Inst. of Electron. Eng., China Acad. of Eng. Phys., Mianyang, China
  • fYear
    2010
  • fDate
    23-25 Sept. 2010
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In this paper, we first introduce the description of the cyclic code, and according to the features of the cyclic code, build the generator polynomial recognition model in the scenario of coding length known, and then propose an iterative algorithm to reduce the computation complexity; on this basis, through the analysis of the coding frame structure, we build the generator polynomial recognition model and the similar iterative algorithm under the condition of coding length is unknown and frame length is known. Finally, we use two examples to illustrate the recognition procedure and verify the recognition algorithm.
  • Keywords
    computational complexity; cyclic codes; pattern recognition; polynomials; blind recognition method; coding frame structure analysis; coding length; computation complexity; cyclic code generator polynomial recognition model; iterative algorithm; Digital video broadcasting; Encoding; Generators; Iterative methods; Mathematical model; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4244-3708-5
  • Electronic_ISBN
    978-1-4244-3709-2
  • Type

    conf

  • DOI
    10.1109/WICOM.2010.5600940
  • Filename
    5600940