Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431303
Semyon Dorokhin
ISS-OFDM is a relatively new type of modulation which received undeservedly little attention and was forgotten. This paper shows that it is possible to revive ISS-OFDM as a new fading-resistant spread spectrum technique. This study focuses on ISS-OFDM synchronization issues, primary on joint sampling clock and carrier frequency offset (SCO and CFO) estimation. It is the first paper investigating this question in context of ISS-OFDM. The impact of SCO and CFO is studied analytically and two new joint SCO and CFO estimators are proposed and compared with the one commonly used in OFDM systems. One of the proposed estimators outperforms the conventional one.
{"title":"Joint SCO and CFO estimation algorithm for ISS-OFDM systems","authors":"Semyon Dorokhin","doi":"10.1109/EnT50437.2020.9431303","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431303","url":null,"abstract":"ISS-OFDM is a relatively new type of modulation which received undeservedly little attention and was forgotten. This paper shows that it is possible to revive ISS-OFDM as a new fading-resistant spread spectrum technique. This study focuses on ISS-OFDM synchronization issues, primary on joint sampling clock and carrier frequency offset (SCO and CFO) estimation. It is the first paper investigating this question in context of ISS-OFDM. The impact of SCO and CFO is studied analytically and two new joint SCO and CFO estimators are proposed and compared with the one commonly used in OFDM systems. One of the proposed estimators outperforms the conventional one.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124424031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431249
A. Nazarov, M. Babenko, E. Golimblevskaia
The Residue Number System is a modern powerful tool for solving a number of specialized tasks: digital signal processing, cryptography, increasing reliability, accelerating computations, etc. The effectiveness of its use largely depends on the solution of the problem of reducing the delay and area costs for the reverse conversion of numerical data to the weighted number system. The paper considers the main methods of reverse conversion from the residue number system to the weighted number system. Their hardware implementation on FPGA and a comparative analysis are presented.
{"title":"Hardware Implementation of the Reverse Conversion RNS-WNS on FPGA","authors":"A. Nazarov, M. Babenko, E. Golimblevskaia","doi":"10.1109/EnT50437.2020.9431249","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431249","url":null,"abstract":"The Residue Number System is a modern powerful tool for solving a number of specialized tasks: digital signal processing, cryptography, increasing reliability, accelerating computations, etc. The effectiveness of its use largely depends on the solution of the problem of reducing the delay and area costs for the reverse conversion of numerical data to the weighted number system. The paper considers the main methods of reverse conversion from the residue number system to the weighted number system. Their hardware implementation on FPGA and a comparative analysis are presented.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"67 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124840048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431301
A. Khashimov, D. Klygach, M. Vakhitov
A dynamic pattern for a given direction is determined as a set of values of the electromagnetic fields radiated by the phased array or scattered by closely located objects. An asymptotic correspondence of two- and three-dimensional antenna theory problems based on nontrivial formulation of the Lorentz lemma is considered. The mathematical model that includes phased array and scattering objects is formulated as a system of the integral equations of a block structure. Such a formulation is useful for supercomputer modeling in the case of various initial data. We consider a case that is important for practical application, when the scattering objects are metals with finite conductivity. The Leontovich impedance boundary conditions are used for these objects. It is shown that the numerical solution of such a mathematical model requires the use of a specific variant of the perturbation method. The obtained results for dynamic patterns of scattering can be used to correct the initial phase distribution of the array.
{"title":"Dynamic Patterns of Scattering for Phased Array Modeling","authors":"A. Khashimov, D. Klygach, M. Vakhitov","doi":"10.1109/EnT50437.2020.9431301","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431301","url":null,"abstract":"A dynamic pattern for a given direction is determined as a set of values of the electromagnetic fields radiated by the phased array or scattered by closely located objects. An asymptotic correspondence of two- and three-dimensional antenna theory problems based on nontrivial formulation of the Lorentz lemma is considered. The mathematical model that includes phased array and scattering objects is formulated as a system of the integral equations of a block structure. Such a formulation is useful for supercomputer modeling in the case of various initial data. We consider a case that is important for practical application, when the scattering objects are metals with finite conductivity. The Leontovich impedance boundary conditions are used for these objects. It is shown that the numerical solution of such a mathematical model requires the use of a specific variant of the perturbation method. The obtained results for dynamic patterns of scattering can be used to correct the initial phase distribution of the array.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125415504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431273
G. V. Zaytsev, A. D. Khzmalyan
A method is proposed to construct polynomial windows for spectral analysis with an arbitrary spectrum sidelobe envelope falloff rate $V$ ≥ 6 decibel per octave. The method constructs windows with the minimum level of the highest spectrum sidelobe in a specified frequency region outside the main lobe. The falloff rate is realized exactly and is independent of accuracy of window coefficients. The windows are simple to calculate and can be implemented in real-time embedded systems. A number of optimal windows are synthesized with the spectrum sidelobe falloff rates of 6, 9, 12, 15, 18, and 24 decibels per octave and the window parameters are provided. Characteristics of the windows constructed are analyzed and compared with those of the known windows.
{"title":"A Family of Optimal Polynomial Windows for Harmonic Analysis with Arbitrary Spectrum Sidelobe Falloff Rate","authors":"G. V. Zaytsev, A. D. Khzmalyan","doi":"10.1109/EnT50437.2020.9431273","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431273","url":null,"abstract":"A method is proposed to construct polynomial windows for spectral analysis with an arbitrary spectrum sidelobe envelope falloff rate $V$ ≥ 6 decibel per octave. The method constructs windows with the minimum level of the highest spectrum sidelobe in a specified frequency region outside the main lobe. The falloff rate is realized exactly and is independent of accuracy of window coefficients. The windows are simple to calculate and can be implemented in real-time embedded systems. A number of optimal windows are synthesized with the spectrum sidelobe falloff rates of 6, 9, 12, 15, 18, and 24 decibels per octave and the window parameters are provided. Characteristics of the windows constructed are analyzed and compared with those of the known windows.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126675338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431285
R. Nigmatullin, Alexander Ivchenko, Semyon Dorokhin
We propose a new approach to traffic preprocessing called Differentiation of Sliding Rescaled Ranges (DSRR) expanding the ideas laid down by H.E. Hurst. We apply proposed approach on the characterizing encrypted and unencrypted traffic on the well-known ISCXVPN2016 dataset. We deploy DSRR for flow-base features and then solve the task VPN vs nonVPN with basic machine learning models. With DSRR and Random Forest, we obtain 0.971 Precision, 0.969 Recall and improve this result to 0.976 using statistical analysis of features in comparison with Neural Network approach that gives 0.93 Precision via 2D-CNN. The proposed method and the results can be found at https://github.com/AleksandrIvchenko/dsrr_vpn_nonvpn.
{"title":"Differentiation of Sliding Rescaled Ranges: New Approach to Encrypted and VPN Traffic Detection","authors":"R. Nigmatullin, Alexander Ivchenko, Semyon Dorokhin","doi":"10.1109/EnT50437.2020.9431285","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431285","url":null,"abstract":"We propose a new approach to traffic preprocessing called Differentiation of Sliding Rescaled Ranges (DSRR) expanding the ideas laid down by H.E. Hurst. We apply proposed approach on the characterizing encrypted and unencrypted traffic on the well-known ISCXVPN2016 dataset. We deploy DSRR for flow-base features and then solve the task VPN vs nonVPN with basic machine learning models. With DSRR and Random Forest, we obtain 0.971 Precision, 0.969 Recall and improve this result to 0.976 using statistical analysis of features in comparison with Neural Network approach that gives 0.93 Precision via 2D-CNN. The proposed method and the results can be found at https://github.com/AleksandrIvchenko/dsrr_vpn_nonvpn.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121301653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431260
M. M. Kushneryov, S. Skobelev
A two-dimensional problem of scattering of E-polarized plane electromagnetic wave by Mikaelian lens including its generalized modification with the focus located outside the lens at a specified distance from its surface is considered. The problem is solved numerically with use of the hybrid projection method and the method of integral equations for the electric field strength in the lens. A number of new results concerning the features of wave focusing by the lens at different relations between its parameters as well as comparison of effectiveness of the methods used in the analysis are presented and discussed.
{"title":"Analysis of Wave Focusing by Mikaelian Lenses in 2D Case of E-Polarization","authors":"M. M. Kushneryov, S. Skobelev","doi":"10.1109/EnT50437.2020.9431260","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431260","url":null,"abstract":"A two-dimensional problem of scattering of E-polarized plane electromagnetic wave by Mikaelian lens including its generalized modification with the focus located outside the lens at a specified distance from its surface is considered. The problem is solved numerically with use of the hybrid projection method and the method of integral equations for the electric field strength in the lens. A number of new results concerning the features of wave focusing by the lens at different relations between its parameters as well as comparison of effectiveness of the methods used in the analysis are presented and discussed.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124915034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431304
A. Nazarov, M. Babenko, E. Golimblevskaia
The Residue number system is a modern powerful tool for solving a number of specialized tasks: digital signal processing, cryptography, increasing reliability, accelerating computations, etc. The effectiveness of its use largely depends on the solution of the problem of reducing the delay and area costs for the forward conversion of numerical data from the weighted number system to the residue number system and reverse conversion. The paper proposes a method of forward conversion to the residue number system based on distributed data processing. It's hardware implementation on FPGA and comparison with the standard algorithm of the IEEE Numeric_std library are presented.
{"title":"Efficient Hardware Implementation of Forward Conversion WNS-RNS on FPGA","authors":"A. Nazarov, M. Babenko, E. Golimblevskaia","doi":"10.1109/EnT50437.2020.9431304","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431304","url":null,"abstract":"The Residue number system is a modern powerful tool for solving a number of specialized tasks: digital signal processing, cryptography, increasing reliability, accelerating computations, etc. The effectiveness of its use largely depends on the solution of the problem of reducing the delay and area costs for the forward conversion of numerical data from the weighted number system to the residue number system and reverse conversion. The paper proposes a method of forward conversion to the residue number system based on distributed data processing. It's hardware implementation on FPGA and comparison with the standard algorithm of the IEEE Numeric_std library are presented.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125288897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431268
I. Sibikina, N. Davidyuk, I. Kosmacheva, I. Kuchin, S. Belov
Users data as a result of their interaction with various services (applications, video systems, etc.) is accumulated in all kinds of databases stored in them both in anonymized and non-anonymized form. In this connection, during processing data there are risks of comparing and extracting additional personal information obtained from different sources having correlations with each other. This can put a user in a vulnerable position when such information gets to unscrupulous third parties. However, taking into account the volume of circulating user data, we are talking about big personal data (BPD). According to the law safe processing of user's data is based on the principles of their consent and compliance of the purposes of such processing with the stated ones. In practice, this is not always controlled, and with the growth of the amount of information and services, users, such a problem requires a solution. In the article, the authors propose the algorithm for organizing control over the use of BPD on the basis of the importance coefficients of various attributes that need to be depersonalized and the profiles of the purposes of PD processing. It is proposed to establish profiles of the purposes of PD processing and check the volume of attributes for redundancy as a result of an expert assessment using the method of constructing linguistic scales.
{"title":"The Algorithm for Controlling the Use of Big Personal Data","authors":"I. Sibikina, N. Davidyuk, I. Kosmacheva, I. Kuchin, S. Belov","doi":"10.1109/EnT50437.2020.9431268","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431268","url":null,"abstract":"Users data as a result of their interaction with various services (applications, video systems, etc.) is accumulated in all kinds of databases stored in them both in anonymized and non-anonymized form. In this connection, during processing data there are risks of comparing and extracting additional personal information obtained from different sources having correlations with each other. This can put a user in a vulnerable position when such information gets to unscrupulous third parties. However, taking into account the volume of circulating user data, we are talking about big personal data (BPD). According to the law safe processing of user's data is based on the principles of their consent and compliance of the purposes of such processing with the stated ones. In practice, this is not always controlled, and with the growth of the amount of information and services, users, such a problem requires a solution. In the article, the authors propose the algorithm for organizing control over the use of BPD on the basis of the importance coefficients of various attributes that need to be depersonalized and the profiles of the purposes of PD processing. It is proposed to establish profiles of the purposes of PD processing and check the volume of attributes for redundancy as a result of an expert assessment using the method of constructing linguistic scales.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125619540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431297
P. Stepanov, G. Nikonova, T. Pavlychenko, A. Gil
The article covers such an attack as Address Resolution Protocol (ARP) spoofing, and its implementation using the scapy software. Such attacks are of rather dangerous type since they are based on the flaws of the ARP protocol. A detailed analysis of the stages of the attack and the sequence of effects on the attacked node are given. An example of the script that sends a fake ARP packet is proposed.
{"title":"Attack on the Address Resolution Protocol","authors":"P. Stepanov, G. Nikonova, T. Pavlychenko, A. Gil","doi":"10.1109/EnT50437.2020.9431297","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431297","url":null,"abstract":"The article covers such an attack as Address Resolution Protocol (ARP) spoofing, and its implementation using the scapy software. Such attacks are of rather dangerous type since they are based on the flaws of the ARP protocol. A detailed analysis of the stages of the attack and the sequence of effects on the attacked node are given. An example of the script that sends a fake ARP packet is proposed.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131820138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431309
M. Poltavtseva, Pavel V. Semyanov, Elizaveta A. Zaitzeva
When solving information security problems, one needs to analyze and evaluate the similarity of heterogeneous semi-structured objects sets. The authors propose to use for this an approach on the basis of case analysis. The data is represented as a set of objects (use cases), each of which is described by a variable set of properties. The paper proposes measures to evaluate the similarity of individual objects and precedents, presents the results of the similarity evaluation method experimental testing. The authors present the architecture of the analysis system and the method of its learning.
{"title":"Heterogeneous Semi-Structured Data Analysis in Information Security","authors":"M. Poltavtseva, Pavel V. Semyanov, Elizaveta A. Zaitzeva","doi":"10.1109/EnT50437.2020.9431309","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431309","url":null,"abstract":"When solving information security problems, one needs to analyze and evaluate the similarity of heterogeneous semi-structured objects sets. The authors propose to use for this an approach on the basis of case analysis. The data is represented as a set of objects (use cases), each of which is described by a variable set of properties. The paper proposes measures to evaluate the similarity of individual objects and precedents, presents the results of the similarity evaluation method experimental testing. The authors present the architecture of the analysis system and the method of its learning.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117128987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：