A.M. Golikov - Ph.D. (Eng.), Associate Professor, Senior Research Scientist, Tomsk State University of Control Systems and Radioelectronics E-mail: rts2_golikov@mail.ru

The cyclic redundancy check (English Cyclic redundancy code, CRC.) ? checksum algorithm for checking the integrity of the transmitted data. CRC algorithm detects all single errors, double faults and errors in an odd number of bits. The concept of cyclic codes is wide enough, but in practice it is usually used to refer to only one species, using the cyclic control (check) redundancy. Resulting in the model allows us to investigate the CRC-codes with the ability to specify any of the polynomial generator and changing the number of the checksum in the frame. The following results and the following conclusions: 1) the higher the degree of the polynomial, the better to exhibit the ability to; 2) for every polynomial has a number of checksums in the block in which it revealing a maximum capacity, with all these points are different polynomials.

 

1. Genri S. Uorren (ml.) Podschet bitov // Algoritmicheskie trjuki dlja programmistov. M.: Viljams. 2007.
2. Sajjt Mathworks. Razdel MATLAB Examples. URL: http://www.mathworks.com/examples/simulink-sommunications/mw/ comm_product-LTEDownlinkExample-lte-phy-downlink-with-spatial-multiplexing
3. Dunia Prieto, Ruben Perez-Aranda Study of undetected error probability of IEEE 802.3 CRC-32 code for MTTFPA analysis // IEEE 802.3bv Task Force. January 2015. P. 12.