• DocumentCode
    548487
  • Title

    A quick coding method based on dynamic table look-up for arbitrary bit length polynomial division in embedded system

  • Author

    Zhu, Tongyu ; Zhong, Zhenhan ; Zhang, Jufu

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Beihang Univ., Beijing, China
  • fYear
    2011
  • fDate
    21-23 June 2011
  • Firstpage
    15
  • Lastpage
    19
  • Abstract
    Aiming at the limitation and low effect in Model 2 Polynomial division´s software realization of embedded system, this paper gives a complete solution to generate codes in condition of arbitrary bit length generator polynomial and source codes with arbitrary width. This solution contains algorithms for dynamic table set-up as well as a general modify logic to solve the any length problem. Test and Evaluation are given. The result shows that compared to the traditional hardware simulation method, we have got a huge progress in time consuming with just a little more space consumption.
  • Keywords
    cyclic redundancy check codes; embedded systems; polynomials; table lookup; CRC code; Model 2 polynomial division software; arbitrary bit length polynomial division; arbitrary width source codes; code generation; dynamic table look-up; dynamic table set-up; embedded system; interlaced code; quick coding method; Algorithm design and analysis; Encoding; Generators; Hardware; Heuristic algorithms; Polynomials; Software; arbitrary bit length; generator polynomial; model 2 polynomial division;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networked Computing and Advanced Information Management (NCM), 2011 7th International Conference on
  • Conference_Location
    Gyeongju
  • Print_ISBN
    978-1-4577-0185-6
  • Electronic_ISBN
    978-89-88678-37-4
  • Type

    conf

  • Filename
    5967509