DocumentCode
2746772
Title
High-speed CRC computations using improved state-space transformations
Author
Kennedy, Christopher ; Reyhani-Masoleh, Arash
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Western Ontario, London, ON, Canada
fYear
2009
fDate
7-9 June 2009
Firstpage
9
Lastpage
14
Abstract
Previously, a state-space similarity transform was proposed to reduce the feedback loop complexity of a parallel Cyclic Redundancy Check architecture and enable retiming. This paper investigates the open research question concerning the impact of varying the vector used to construct the transformation matrix. We perform exhaustive searches of the vector space for frequently referenced generator polynomials when the input size is equal to the degree of the generator polynomial. The set of vectors which yield minimal hardware state-space representations is obtained. Then, application-specific integrated circuit (ASIC) experiments are performed. The ASIC implementation results for the minimized state spaces demonstrate improvement in both area and timing as compared to the original ones. Finally, it is concluded that the vectors obtained for a fixed generator polynomial are also good choices for other input sizes.
Keywords
application specific integrated circuits; codecs; cyclic redundancy check codes; matrix decomposition; state-space methods; application specific integrated circuit; feedback loop complexity; fixed generator polynomial; parallel cyclic redundancy check; state space transformation; transformation matrix; Application specific integrated circuits; Computer architecture; Concurrent computing; Cyclic redundancy check; Delay; Feedback loop; Hardware; Parallel architectures; Polynomials; Timing; Cyclic Redundancy Check (CRC); application-specific integrated circuit (ASIC); optimization; state-space similarity transformation;
fLanguage
English
Publisher
ieee
Conference_Titel
Electro/Information Technology, 2009. eit '09. IEEE International Conference on
Conference_Location
Windsor, ON
Print_ISBN
978-1-4244-3354-4
Electronic_ISBN
978-1-4244-3355-1
Type
conf
DOI
10.1109/EIT.2009.5189575
Filename
5189575
Link To Document