Algoritem za iskanje binarnih sekvenc z nizko avtokorelacijo

diplomsko delo

Miha Vuk (Author), Borko Bošković (Mentor), Janez Brest (Co-mentor)

Abstract

V diplomskem delu predstavljamo algoritem za iskanje binarnih sekvenc z nizko avtokorelacijo. S tem algoritmom najdemo binarne sekvence najnižjih dokumentiranih avtokorelacijskih nivojev. Omenjeni algoritem se ponuja z učinkovitim delovanjem in enostavno implementacijo. Skozi diplomsko delo opišemo idejo, kakšna je strategija pristopa in zakaj, predpogoje ter delovanje. Predstavimo lastna opažanja in ugotovitve, do katerih smo prišli med razvojem in raziskovanjem ter prikažemo dobljene rezultate.

Keywords

algoritem;binarna sekvenca;avtokorelacija;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2021
Typology:	2.11 - Undergraduate Thesis
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher:	[M. Vuk]
UDC:	004.421(043.2)
COBISS:	86838531
Views:	283
Downloads:	43
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Algorithm for finding low autocorrelation binary sequences
Secondary abstract:	In this thesis, we present an algorithm for finding low autocorrelation binary sequences. This algorithm is able to find sequences with the lowest documented autocorrelation levels. The mentioned algorithm promises efficiency and simple implementation. Through this thesis, we present the idea behind the design, the approach strategy and why it is used, the prerequisites, and how the algorithm functions. We present newly acquired knowledge and findings reached through the development and research with the results.
Secondary keywords:	algorithm;binary sequence;autocorrelation;
Type (COBISS):	Bachelor thesis/paper
Thesis comment:	Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages:	VII, 46 str
ID:	13409263