Sergei Viktorovich Shalagin

Dr. Sergei Viktorovich Shalagin

Kazan National Research Technical University named after A. N. Tupolev - KAI
orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2016
Verified
Conference Paper
Closed access
VZV. M. Zakharov
V. M. Zakharov
SSSergei Viktorovich Shalagin
Sergei Viktorovich Shalagin
A general method of designing digital devices has been proposed to execute discrete orthogonal transformations on distributed programmable architecture system, the elements of which are field programmable logic arrays (FPGA). The digital devices mentioned above are implemented using similar IP cores that allow executing distributed computations on the Galois field in the FPGA architecture.

1 January 2017 in Russian Aeronautics (Iz VUZ)
Verified
Journal Article
Closed access
PDF file
YEYu. K. Evdokimov
Yu. K. Evdokimov
VZV. M. Zakharov
V. M. Zakharov
SSSergei Viktorovich Shalagin
Sergei Viktorovich Shalagin
The complexity has been evaluated for the devices determined on the basis of the structural pattern proposed, which are implemented on the distributed programmable-architecture computing systems.

1 January 2004 in Russian Microelectronics
Verified
Journal Article
Closed access
PDF file
SSSergei Viktorovich Shalagin
Sergei Viktorovich Shalagin

21 May 2018 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
VZV M Zakharov
V M Zakharov
SSSergei Viktorovich Shalagin
Sergei Viktorovich Shalagin
BEB F Eminov
B F Eminov
A method has been proposed to represent lumped Markov chains by minimal polynomials over a finite field. The accuracy of representing lumped stochastic matrices, the law of lumped Markov chains depends linearly on the minimum degree of polynomials over field GF(q). The method allows constructing the realizations of lumped Markov chains on linear shift registers with a pre-defined "linear complexity".

1 October 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
VZV M Zakharov
V M Zakharov
SSSergei Viktorovich Shalagin
Sergei Viktorovich Shalagin
BEB F Eminov
B F Eminov
The formed sets of ergodic stochastic matrices are focused on solving the problem of classifying probabilistic automaton models by certain criteria/parameters of similarities or differences in the structures of ergodic stochastic matrices using the methods of applied multivariate mathematical statistics. The algorithms developed allow forming a variety of the sets of stochastic matrices through changing the transition and random entry function in a probabilistic automaton. Transition function of the autonomous probabilistic automaton allows using the probabilistic automaton operation algorithm proposed to form the sets of ergodic stochastic matrices that differ in their potencies and structures, based on implementing state set permutations with repetitions and changing the random input variable probability distributions. Defining various autonomous deterministic automaton output functions, we can use the algorithm developed to form the sets of ergodic stochastic matrices that differ in their potencies, with a specified limiting vector, based on implementing the permutations of a set of output letters with repetitions. We are also presenting the evaluations of the potencies of the sets of ergodic stochastic matrices with rational elements, represented by autonomous probabilistic automata under the given constraints.

1 January 2016
Verified
Conference Paper
Closed access
VZV. M. Zakharov
V. M. Zakharov
BEB. F. Eminov
B. F. Eminov
SSSergei Viktorovich Shalagin
Sergei Viktorovich Shalagin
A polynomial model of functions of lumped Markov's chains over finite field is represented. The authors represent a particular case of Markov's chains functions - the hidden Markov's models (HMM). A definition of the HMM stochastic equivalency was implemented based on stochastic matrix lumpability and asymptotic characteristics of HMM. The paper provides a polynomial representation of an equivalent HMM over the finite field GF(2n). It estimates a minimal order of the field GF(2n) for polynomial HMM representation, depending on the stochastic matrices implying vector size and possessing lumpability characteristic.