|
Library
|
Your profile |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.|
Software systems and computational methods
Reference:
Potekhin E.N., Leukhin A.N.
The methods of optimization of the problem of complete search of
binary aperiodic optimal sequences
// Software systems and computational methods.
2013. ¹ 2.
P. 192-198.
URL: https://en.nbpublish.com/library_read_article.php?id=63026
Potekhin E.N., Leukhin A.N. The methods of optimization of the problem of complete search of binary aperiodic optimal sequencesAbstract: the authors rise a problem of finding the optimal binary aperiodic sequences for the target detection tasks. The article presents an algorithm for a complete search “brunch and bound”, introduces a concept of equal transformations, describes it use for computational complexity reduce. The methods of optimization lower the computational complexity of the algorithm through to the usage modern processor instructions, computational graphic clusters, parallelization, batch search. Keywords: Software, binary sequences, aperiodic sequence, optimal sequence, pulse autocorrelation function, methods of optimization, brunch and bound, NVidia CUDA, equivalent sequences, Barker codes.
This article can be downloaded freely in PDF format for reading. Download article
This article written in Russian. You can find original text of the article here . References
1. Barker R.H. Group synchronizing of binary digital systems, Communication Theory (W. Jackson, ed.), Academic Press, New York, 1953. — pp. 273–287.
2. Sverdlik M.B.Optimal'nye diskretnye signaly // Sov. Radio, 1975. — 200 s. 3. Sverdlik M.B. Raschet FM signalov s khoroshimi korrelyatsionnymi svoystvami // Izvestiya vuzov. Radioelektronika, 1971. — t. 14. — ¹12. 4. Titsworth R.C. Optimal and minimax Sequences // Proc. in International Telemetry Conferece, 1963. 5. Binary pulse compression codes // IEEE Trans, 1967. v. IT-13, no. 2. 6. Pelekhatyy M.I. O nekotorykh blok-konstruktsiyakh, porozhdayushchikh posledovatel'nosti s khoroshimi korrelyatsionnymi svoystvami // Radiotekhnika i elektronika, 1970. — t. 15. — ¹7. 7. Pelekhatyy M.I. Dopolnenie k stat'e «O nekotorykh blok-konstruktsiyakh, porozhdayushchikh posledovatel'-nosti s khoroshimi korrelyatsionnymi svoystvami» // Radiotekhnika i elektronika, 1971. — t. 16. — ¹7. 8. Coxson G.E. Efficient exhaustive search for optimal-peak-sidelobe binary codes // IEEE Trans. Aerospace and Electron. Systems, 2005, V. 41. — pp. 302–308 / G.E. Coxson, J. Russo. 9. Tematicheskiy sayt, posvyashchennyy sintezu signalov i ikh primeneniyu [Elektronnyy resurs]. Data obnovleniya: 15.02.2013 // URL: http://signalslab.marstu.net (data obrashcheniya: 15.02.2013) |
© 1998 – 2024 Nota Bene. Publishing Technologies. NB-Media Ltd.
Eng
