Comments and Ratings

grat c> i think your calculation is worng. i hav calculated by hand as well, it gives crc=1 0 0.i think the code is correct.

thanks.

i used wiki's example to check for its correctness:
http://en.wikipedia.org/wiki/Cyclic_redundancy_check#Computation_of_CRC

msg = [1 1 0 1 0 0 1 1 1 0 1 1 0 0]; poly = [1 0 1 1];
the program gives r = 1 0 0

i've also tried to do the XORs by hand...
i found it is indeed 1 0 1, not sure where goes wrong

Communication toolbox is not required. Another reviewer (Andrea Silvestri) is right: "the for cycle could be replaced with on single line: r=mod(r,2) "

hao

Good Work..

I feel the for loop is not required..

yes, msk has problem

Muy simple y completo

Superb

your code can only work if the number of data streams are below 360 bits. any higher bits gives error. using GFCONV method works fine

Daty Daty: Look at http://www.mathworks.com/support/solutions/files/s1-P6U4E/CRC.m

You can modify here the Polynom

im zid zid

Easy to follow. For the previous comment, please understand how CRC is done and you will find the code straight forward. Code is self explanatory.

This is a script, contains no useful help, spits out incomprehensible values, and does not run for normal but apparently unexpected inputs (you have to edit the file to see what is expected as input ...).

good work