Re: cyclic redundancy check 4-bit
- From: mojaveg@xxxxxxxxxxxxxxxxxxxxxxxxxxxxx (Everett M. Greene)
- Date: Sat, 12 May 2007 08:54:23 PST
Paul Keinanen <keinanen@xxxxxx> writes:
With very low data rates and hundreds of megabytes or PC RAM and lots
of processing power, storing a sequence of signals into RAM and
matching all possible delayed versions of the PRN key is sooner or
later going to bring up a good correlation.
Wouldn't smoke signals or carrier pigeons be faster?
.
- References:
- Re: cyclic redundancy check 4-bit
- From: Vladimir Vassilevsky
- Re: cyclic redundancy check 4-bit
- From: Dave Hansen
- Re: cyclic redundancy check 4-bit
- From: Paul Keinanen
- Re: cyclic redundancy check 4-bit
- From: bwv539
- Re: cyclic redundancy check 4-bit
- From: Vladimir Vassilevsky
- Re: cyclic redundancy check 4-bit
- From: msg
- Re: cyclic redundancy check 4-bit
- From: Everett M. Greene
- Re: cyclic redundancy check 4-bit
- From: Paul Keinanen
- Re: cyclic redundancy check 4-bit
- From: Vladimir Vassilevsky
- Re: cyclic redundancy check 4-bit
- From: Paul Keinanen
- Re: cyclic redundancy check 4-bit
- Prev by Date: Re: Simple/Fast Algorithm for binary logarithm in C (on ARM7)
- Next by Date: Re: MicroSys SBC1190 Problems
- Previous by thread: Re: cyclic redundancy check 4-bit
- Next by thread: Re: cyclic redundancy check 4-bit
- Index(es):
Relevant Pages
|