Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80.
Anatolii N. LeukhinEgor N. PotekhinPublished in: SETA (2014)
Keyphrases
- exhaustive search
- dynamic programming
- brute force
- computational complexity
- search methods
- optimal solution
- solution space
- nearest neighbor search
- search space
- simulated annealing
- fixed length
- lower bound
- minimum variance
- computationally feasible
- bit string
- hidden markov models
- variable length
- sampling rate
- greedy search
- minimum cost
- minimum length
- markov random field
- wavelet transform