Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The peak sidelobe level (PSL) of a binary sequence is the largest absolute value of all its nontrivial aperiodic autocorrelations. A classical prob- lem of digital sequence design is to determine how slowly the PSL of a length n binary sequence can grow, as n becomes large. Moon and Moser shod in 1968 that the growth rate of the PSL of almost all length n binary sequences lies beten order p nlogn and p n, but since then no theoretical improvement to these bounds has been found.  present the first numerical evidence on the tightness of these bounds, showing that the PSL of almost all binary sequences of length n appears to grow exactly like order p nlogn, and that the PSL of almost all m-sequences of length n appears to grow exactly like order p n. In the case of m-sequences, a key algorithmic insight reveals behaviour that was previously ll beyond the range of computation.
['D. V. Dmitriev', 'Jonathan Jedwab']
I am writing a research paper on a idea BOUNDS ON THE GROWTH RATE OF THE PEAK SIDELOBE LEVEL OF BINARY SEQUENCES
[{"from": "human", "value": "I am writing a research paper on a idea BOUNDS ON THE GROWTH RATE OF THE PEAK SIDELOBE LEVEL OF BINARY SEQUENCES"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The peak sidelobe level (PSL) of a binary sequence is the largest absolute value of all its nontrivial aperiodic autocorrelations. A classical prob- lem of digital sequence design is to determine how slowly the PSL of a length n binary sequence can grow, as n becomes large. Moon and Moser shod in 1968 that the growth rate of the PSL of almost all length n binary sequences lies beten order p nlogn and p n, but since then no theoretical improvement to these bounds has been found.  present the first numerical evidence on the tightness of these bounds, showing that the PSL of almost all binary sequences of length n appears to grow exactly like order p nlogn, and that the PSL of almost all m-sequences of length n appears to grow exactly like order p n. In the case of m-sequences, a key algorithmic insight reveals behaviour that was previously ll beyond the range of computation."}]