Michael Borisovich Sergeev

Michael Borisovich Sergeev

Auto-generated profile, based on publicly available information

Michael Borisovich Sergeev

Saint-Petersburg State University of Aerospace Instrumentation

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 July 2014 in Automatic Control and Computer Sciences
Verified
Journal Article
Closed access
PDF file
ASA. M. Sergeev
A. M. Sergeev
Properties of generalized Hadamard matrices and a conjecture on the existence of Mersenne matrices included into the former are discussed. A new classification of few-level quasi-orthogonal matrices, including matrices of even and odd orders, is presented. Matrices of Euler, Mersenne, and Hadamard are considered. The fundamental differences between the matrices of Mersenne and Fermat, which explain the failure of the proof of the Hadamard conjecture, are shown.

21 June 2019 in Information and Control Systems
Verified
Journal Article
Open access
PDF file
MSM. B. Sergeev
M. B. Sergeev
VNVadim A. Nenashev
Vadim A. Nenashev
ASA. M. Sergeev
A. M. Sergeev
Introduction: The problem of noise-free encoding for an open radio channel is of great importance for data transfer. The results presented in this paper are aimed at stimulating scientific interest in new codes and bases derived from quasi-orthogonal matrices, as a basis for the revision of signal processing algorithms.Purpose: Search for new code sequences as combinations of codes formed from the rows of Mersenne and Raghavarao quasi-orthogonal matrices, as well as complex and more efficient Barker — Mersenne — Raghavarao codes.Results: We studied nested code sequences derived from the rows of quasi-orthogonal cyclic matrices of Mersenne, Raghavarao and Hadamard, providing estimates for the characteristics of the autocorrelation function of nested Barker, Mersenne and Raghavarao codes, and their combinations: in particular, the ratio between the main peak and the maximum positive and negative “side lobes”. We have synthesized new codes, including nested ones, formed on the basis of quasi-orthogonal matrices with better characteristics than the known Barker codes and their nested constructions. The results are significant, as this research influences the establishment and development of methods for isolation, detection and processing of useful information. The results of the work have a long aftermath because new original code synthesis methods need to be studied, modified, generalized and expanded for new application fields.Practical relevance: The practical application of the obtained results guarantees an increase in accuracy of location systems, and detection of a useful signal in noisy background. In particular, these results can be used in radar systems with high distance resolution, when detecting physical objects, including hidden ones.

1 January 2016 in Information and Control Systems
Verified
Journal Article
Closed access
NBN. A. Balonin
N. A. Balonin
SISaint-Petersburg State University of Aerospace Instrumentation
Saint-Petersburg State University of Aerospace Instrumentation
MSM. B. Sergeev
M. B. Sergeev

1 May 2015 in Automatic Control and Computer Sciences
Verified
Journal Article
Closed access
PDF file
NBN. A. Balonin
N. A. Balonin
AVA. A. Vostrikov
A. A. Vostrikov
MSM. B. Sergeev
M. B. Sergeev
The general definition of quasi-orthogonal matrices, the definition of low-level matrices, and partial definitions of quasi-orthogonal Mersenne and Euler matrices are considered. New quasi-orthogonal symmetric Seidel matrices that exist on odd orders and three-level Legendre symbols used to calculate elements of these matrices are defined. A method to calculate Euler matrices via Mersenne matrices is given. A relation between asymmetric and symmetric odd-order Mersenne and Seidel matrices is shown to exist. A new, modified Sylvester method for calculating Euler matrices using symmetric circulant Seidel matrices is proposed.

27 May 2015
Verified
Book Chapter
Closed access
PDF file
NBNikolay Balonin
Nikolay Balonin
AVAnton Vostrikov
Anton Vostrikov
MSMikhail Sergeev
Mikhail Sergeev

27 May 2015
Verified
Book Chapter
Closed access
PDF file
AVAnton Vostrikov
Anton Vostrikov
MSMikhail Sergeev
Mikhail Sergeev