By Topic

Cyclic redundancy checks with factorable generators

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. R. Irvin ; Dept. T81/B503, IBM Corp., Research Triangle Park, NC, USA

Applications are proposed for cyclic redundancy checks (CRCs) that have factorable rather than primitive generator polynomials. Suitable encoding and decoding methods are developed. Factored-generator CRCs are then compared with tandem CRCs that have an inner code and outer code. When the factors of the generator are used as the generators of the inner and outer codes, the two kinds of CRCs have much in common, although their codewords are different. The differences are such that the factored-generator CRC offers an architectural advantage over the tandem CRC, in that the factored-generator CRC enables symmetric partial decoding, which is useful in mixed-transmission-media and point-to-multipoint systems.

Published in:

IEE Proceedings - Communications  (Volume:150 ,  Issue: 1 )