binary polynomial division help

I'm struggling with binary polynomial division.

I have a vector of data which is a message sent over a wireless link.

I have formed the data in to a vector of 1x341 which although it holds doubles actually contains only binary (0 or 1) values in each element.

I'm trying to determine the parity given g(x) = x^75 + x^73 ....... + x + 1

The spec states that the parity must be checked by determining if the first n bits (considered as a polynomial) are divisible by g(x). I'm assuming n is my 341 bit message.

Any suggestions how I go about this division?

[Star Strider]

I believe you have to use the Communication System Toolbox function gfdeconv.

Answer 1

[Adrian Holmes]

Thanks for the replies. gfdeconv worked for me once I had corrected my error in the code generating polynomial (g(x)).

Now to work out how to implement that in VHDL.......

:)

Answer 2

[Matt J]

Use the DECONV command to perform polynomial division.

[Walter Roberson]

Interesting approach.