TY - GEN
T1 - A quick coding method based on dynamic table look-up for arbitrary bit length polynomial division in embedded system
AU - Zhu, Tongyu
AU - Zhong, Zhenhan
AU - Zhang, Jufu
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - arbitrary bit length
KW - generator polynomial
KW - model 2 polynomial division
UR - https://www.scopus.com/pages/publications/80052115504
M3 - 会议稿件
AN - SCOPUS:80052115504
SN - 9788988678367
T3 - Proceedings - 7th International Conference on Networked Computing and Advanced Information Management, NCM 2011
SP - 15
EP - 19
BT - Proceedings - 7th International Conference on Networked Computing and Advanced Information Management, NCM 2011
T2 - 7th International Conference on Networked Computing and Advanced Information Management, NCM 2011
Y2 - 21 June 2011 through 23 June 2011
ER -