Re: spreading code with low autocorrelation
- From: "Thomas Magma" <somewhere@xxxxxxxxxxxxxxxxxx>
- Date: Wed, 22 Aug 2007 16:55:47 GMT
This is a problem that only has to be done once, so it's worth
keeping your computer humming for a while, depending on
your constraints.
I think it might blow the budget of my project if I were to rent a super
computer to run for 5 or 10 years to do what you suggested. However if I did
discover a large Barker sequence, I would probably forget about my project
and sprint down to the closest patent office.
How long would it take your computer to iterate through all the possible
combinations of 2^65536 determining the merit factor of each?
Thomas
.
- References:
- spreading code with low autocorrelation
- From: Thomas Magma
- Re: spreading code with low autocorrelation
- From: julius
- Re: spreading code with low autocorrelation
- From: Thomas Magma
- Re: spreading code with low autocorrelation
- From: julius
- spreading code with low autocorrelation
- Prev by Date: Re: low pass filter is always integrator?
- Next by Date: Re: low pass filter is always integrator?
- Previous by thread: Re: spreading code with low autocorrelation
- Next by thread: Re: spreading code with low autocorrelation
- Index(es):
Relevant Pages
|