From owner-freebsd-hackers Thu Jan 23 08:00:14 1997 Return-Path: Received: (from root@localhost) by freefall.freebsd.org (8.8.5/8.8.5) id IAA25902 for hackers-outgoing; Thu, 23 Jan 1997 08:00:14 -0800 (PST) Received: from terra.Sarnoff.COM (terra.sarnoff.com [130.33.11.203]) by freefall.freebsd.org (8.8.5/8.8.5) with SMTP id IAA25897 for ; Thu, 23 Jan 1997 08:00:12 -0800 (PST) Received: (from rminnich@localhost) by terra.Sarnoff.COM (8.6.12/8.6.12) id KAA29043; Thu, 23 Jan 1997 10:59:07 -0500 Date: Thu, 23 Jan 1997 10:59:06 -0500 (EST) From: "Ron G. Minnich" X-Sender: rminnich@terra To: Michael Smith cc: hackers@freebsd.org Subject: Re: CRC-16 algorithms? In-Reply-To: <199701231336.AAA21608@genesis.atrad.adelaide.edu.au> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-hackers@freebsd.org X-Loop: FreeBSD.org Precedence: bulk On Fri, 24 Jan 1997, Michael Smith wrote: > Hmm, I was actually assuming that it was accumulated 8 bits at a time; > the RAM is normally accessed in 8-bit lots, and there's an odd number > of bytes involved... yes but you can accumulate a CRC of any degree (8, 16, 32, etc.) with any number of bits at a time. For example, lots of hardware accumulates it a bit at a time (at the serial input). The nature of the CRC polynomical is not really affected by how many bits at a time you compute it. I have a C program that computes the atm crc-32 8 bits at a time, as well as a VHDL program that computes it 64 bits at a time. Not that any of this helps your current problem :-) ron