{"title":"The control system on the base of signal processing for power quality improvement in electrotechnical complexes of alternative and renewable power sources","authors":"V. Prokhorova, Y. Sychev","doi":"10.1109/RED.2016.7779343","DOIUrl":"https://doi.org/10.1109/RED.2016.7779343","url":null,"abstract":"The paper deals with the problem of creation and developing of effective and perspective control means and methods for correction of voltage and current level and harmonic spectrum by means of active and hybrid correction systems in conditions of distributed generation on the base of renewable and alternative power sources. The main types of active and hybrid correction systems are presented and analyzed. The main existing means and methods of harmonic detection, compensation and signal processing are presented and analyzed. The universal control system structure for active and hybrid correction systems is proposed. The proposed control system structure and algorithm are based on existing theories of harmonic compensation and power decomposition, current physical components, p-q theory and also on modern signal processing methods. The efficiency of proposed algorithm and control system is proved by results of mathematic modeling and computer simulation. The required level of proposed control system redundancy is proved.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131304739","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}
{"title":"Evaluation and comparison of classical and fractal queuing systems","authors":"Tatamikova Tatiana Mikhailovna, Kutuzov Oleg Ivanovich","doi":"10.1109/RED.2016.7779352","DOIUrl":"https://doi.org/10.1109/RED.2016.7779352","url":null,"abstract":"The model of revenues in the self-similar traffic, characterized by the presence of long term dependencies in the traffic routes and the presence of a pulsating structure on many time scales that can adequately reflect the characteristics of network traffic. The models calculate the buffer storage network nodes, which are more realistic in terms of self-similar traffic.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128911475","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}
{"title":"Construction of the inverse matrix to a block upper triangular matrix","authors":"S. Fedorenko, D. Shmelkin","doi":"10.1109/RED.2016.7779326","DOIUrl":"https://doi.org/10.1109/RED.2016.7779326","url":null,"abstract":"A new analytical method of constructing the inverse matrix to the check matrix of the system of embedded inner codes for the generalized error-locating codes is proposed.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120960810","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}
{"title":"On applying one-sample goodness-of-fit statistics to coded FSK decoding","authors":"A. Kreshchuk, V. Potapov","doi":"10.1109/RED.2016.7779332","DOIUrl":"https://doi.org/10.1109/RED.2016.7779332","url":null,"abstract":"In the previous works we have considered decoding coded FSK modulation (similar to Kautz-Singleton codes) transmitted in a channel with strong interference by using a two-sample goodness-of-fit statistics. In this work we consider the applicability of different one-sample goodness-of-fit statistics for the decoding. Using a computer simulation we show that using these statistics may yield lower error rates relative to the known decoders. The most notable of them are Anderson Darling statistic that has the lowest error rates for narrow-band interference and Pearson's x2 and Kuiper statistics that are more resilient to wide-band interference. We can conclude that one-sample goodness-of-fit statistics can be used for Kautz-Singleton codes decoding with relatively low error rates in case of strong interference in the channel.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121066797","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}
{"title":"About one modification of McEliece cryptosystem based on Plotkin construction","authors":"E. Krouk, A. Ovchinnikov, E. Vostokova","doi":"10.1109/RED.2016.7779334","DOIUrl":"https://doi.org/10.1109/RED.2016.7779334","url":null,"abstract":"In this paper the modification of McEliece public-key cryptosystem is considered, which uses the codes based on Plotkin construction as the private key, instead of Goppa codes traditionally considered for this purpose. Proposed modification allows strengthening of McEliece cryptosystem by attacks complication based on the secret code structure.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"51 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124533840","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}
{"title":"On iterative LDPC-based joint decoding scheme for binary input Gaussian multiple access channel","authors":"A. Frolov, P. Rybin, F. Ivanov","doi":"10.1109/RED.2016.7779328","DOIUrl":"https://doi.org/10.1109/RED.2016.7779328","url":null,"abstract":"Non-orthogonal multiple access schemes are of great interest for next generation wireless systems, as such schemes allow to reduce the total number of resources (frequencies or time slots) in comparison to orthogonal transmission (TDMA, FDMA, CDMA). In this paper we consider an iterative LDPC-based joint decoding scheme suggested in [1]. We investigate the most difficult and important problem where all the users have the same power constraint and the same rate. For the case of 2 users we use a known scheme and analyze it by means of simulations. We found the optimal relation between the number of inner and outer iterations. We further extend the scheme for the case of any number of users and investigated the cases of 3 and 4 users by means of simulations. Finally, we showed, that considered non-orthogonal transmission scheme is more efficient (for 2 and 3 users), than orthogonal transmission.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115097354","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}
{"title":"On list-decoding schemes for punctured Reed-Solomon, Gabidulin and subspace codes","authors":"H. Bartz, V. Sidorenko","doi":"10.1109/RED.2016.7779321","DOIUrl":"https://doi.org/10.1109/RED.2016.7779321","url":null,"abstract":"Punctured Reed-Solomon (RS) and Gabidulin (G) codes over the field Fqm with locators from the subfield Fq can be represented as interleaving of m correspondent codes over the subfield Fq or can be considered as virtual interleaving of m correspondent codes over the field Fqm. Using an interpolation-based list decoder, m-interleaved or virtually interleaved codes can be decoded up to the same radius mm+T (d - 1), where d is the code distance in the corresponding metric. An explicit root-finding system for the virtual interleaved decoder that can be solved efficiently over Fq is presented. We show that correspondent decoders over the subfield Fq and the field Fqm are equivalent and conclude that in practice one should use a decoder over the subfield since it has less complexity. For m-interleaved codes over Fq a decoding parameters is introduced that allows to control the decoding radius vs. list size trade off.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129876679","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}
{"title":"Encryption system using the explicit reciprocity law","authors":"S. Vostokov, R. Vostokova","doi":"10.1109/RED.2016.7779357","DOIUrl":"https://doi.org/10.1109/RED.2016.7779357","url":null,"abstract":"In the present paper, we suggest a new method of creating ID-based cryptosystems, which is based on the use the explicit pairing obtained in the papers [1,2]. The classical reciprocity law goes back to Pierre Fermat and is an explicit formula for the product of the power residues in a filed of algebraic numbers. In 1990, on the first congress of mathematics, Hilbert stated the 9th problem and suggested a plan of solving it. His idea was to reduce the problem to finding an explicit formula for the norm residue symbol. This problem was solved completely in 1978 (see [1]). In the present paper, we use the explicit Hilbert pairing for a protocol of authentication without disclosure (see Sec.3).","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127071712","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}
{"title":"On the anonymity of physical-layer network coding against wiretapping","authors":"O. Trushina","doi":"10.1109/RED.2016.7779353","DOIUrl":"https://doi.org/10.1109/RED.2016.7779353","url":null,"abstract":"This paper considers a problem of anonymous transmission in physical-layer network coding against eavesdropping. The task is to organize data transmission so that an adversary can not determine who communicates with whom. It is achieved by making the messages to be untraceable. Scheme based on lattice coset coding strategy and lattice properties is proposed. The point of the scheme is to change input message at a relay side to another random message from the same coset.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122134804","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}
{"title":"Weighted digital watermarking approaches comparison","authors":"N. Voloshina, S. Bezzateev, K. Zhidanov","doi":"10.1109/RED.2016.7779356","DOIUrl":"https://doi.org/10.1109/RED.2016.7779356","url":null,"abstract":"The comparison of efficiency of two such approaches LEBC embedding method and Weighted F5 embedding that are used for weighted structures of container and F5 method that is used for least significant bit(LSB) embedding is made. The comparison metric was found for correct comparison of weighted and unweighted syndrome coding embedding. As a result the efficiency of weighted approach is shown on the example.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131116904","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}