polynomial division remainder

M

Manfred Balik

Guest
How can I calculate the remainder of a polynomial division in an easy way
???
Thanks, Manfred
 
On Wed, 12 May 2004 10:12:48 +0200, "Manfred Balik"
<e8825130@stud4.tuwien.ac.at> wrote:

How can I calculate the remainder of a polynomial division in an easy way
???
Thanks, Manfred
Click to expand...
Is this for a CRC?

Regards,
Allan.
 
"Allan Herriman" <allan.herriman.hates.spam@ctam.com.au.invalid> schrieb im
Newsbeitrag news:i9o3a0dlq1jkau4lahbgfuhdqksv7ojud2@4ax.com...
On Wed, 12 May 2004 10:12:48 +0200, "Manfred Balik"
e8825130@stud4.tuwien.ac.at> wrote:

How can I calculate the remainder of a polynomial division in an easy way
???
Thanks, Manfred

Is this for a CRC?

Regards,
Allan.
Click to expand...
It's not exactly a normal CRC, but it's a checking of a bitstream (I think
so).
Manfred
 
On Wed, 12 May 2004 10:59:03 +0200, "Manfred Balik"
<e8825130@stud4.tuwien.ac.at> wrote:

"Allan Herriman" <allan.herriman.hates.spam@ctam.com.au.invalid> schrieb im
Newsbeitrag news:i9o3a0dlq1jkau4lahbgfuhdqksv7ojud2@4ax.com...
On Wed, 12 May 2004 10:12:48 +0200, "Manfred Balik"
e8825130@stud4.tuwien.ac.at> wrote:

How can I calculate the remainder of a polynomial division in an easy way
???
Thanks, Manfred

Is this for a CRC?

Regards,
Allan.

It's not exactly a normal CRC, but it's a checking of a bitstream (I think
so).
Click to expand...
What is abnormal about it? Do you have a specification you can share?

What is the bit rate? This will determine the approach you take:
lower rates are handled in a bit-serial manner and higher rates are
handled in a bit-parallel manner.
The cutover between serial and parallel implementations will be
between 30-300Mb/s, depending on the technology and what clocks you
have available, etc.

Regards,
Allan.
 
To find a valid telegram in a bitstream I have to divide a 1024 Bit word by
a 76 Bit word
if the reminder=0 it is the valid telegram
if the reminder/=0 the 1024 Bits are shifted and the next bit from the
bitstream is added
divide again, and so on ....

I have tried to program the algorithm like the mathematical division, but
it's much to slow and needs a vast number of logiccells
How can I calculate the remainder of a polynomial division in an easy way
???

Thanks, Manfred

"Allan Herriman" <allan.herriman.hates.spam@ctam.com.au.invalid> schrieb im
Newsbeitrag news:2kq3a0deh1j5qcbkhev30amuodipfr8eb1@4ax.com...
On Wed, 12 May 2004 10:59:03 +0200, "Manfred Balik"
e8825130@stud4.tuwien.ac.at> wrote:


"Allan Herriman" <allan.herriman.hates.spam@ctam.com.au.invalid> schrieb
im
Newsbeitrag news:i9o3a0dlq1jkau4lahbgfuhdqksv7ojud2@4ax.com...
On Wed, 12 May 2004 10:12:48 +0200, "Manfred Balik"
e8825130@stud4.tuwien.ac.at> wrote:

How can I calculate the remainder of a polynomial division in an easy
way
???
Thanks, Manfred

Is this for a CRC?

Regards,
Allan.

It's not exactly a normal CRC, but it's a checking of a bitstream (I
think
so).

What is abnormal about it? Do you have a specification you can share?

What is the bit rate? This will determine the approach you take:
lower rates are handled in a bit-serial manner and higher rates are
handled in a bit-parallel manner.
The cutover between serial and parallel implementations will be
between 30-300Mb/s, depending on the technology and what clocks you
have available, etc.

Regards,
Allan.
Click to expand...
 
Manfred Balik wrote:

I have tried to program the algorithm like the mathematical division, but
it's much to slow and needs a vast number of logiccells
How can I calculate the remainder of a polynomial division in an easy way
Click to expand...
How about a shifter and a few interposed xor gates.

http://groups.google.com/groups?q=lfsr+remainder+hardware

--Mike Treseler
 
You must log in or register to reply here.

Welcome to EDABoard.com

Sponsor

Back
Top