{"title":"An upper bound on the error probability of a communication system with nonparametric detection","authors":"D. Osipov","doi":"10.1109/RED.2016.7779338","DOIUrl":"https://doi.org/10.1109/RED.2016.7779338","url":null,"abstract":"In what follows a channel model that describes a class of communication systems employing a certain nonparametric receiver is considered. In particular a block coded transmission via the channel under consideration and soft-input mismatched decoding are considered. The paper deals with a problem of finding an upper bound on the probability of erroneous decoding. In order to obtain the bound in question a second version of the Duman-Salehi bound is applied. For the system under consideration a closed form for the normalized tilting measure minimizing the bound under consideration is obtained.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"3 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":"116166832","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":"Semi-blind approach to reception of short QAM data packets with pilot symbols","authors":"A. Sergienko","doi":"10.1109/RED.2016.7779348","DOIUrl":"https://doi.org/10.1109/RED.2016.7779348","url":null,"abstract":"Coherent reception of signals with digital modulation requires information about the channel state, in particular, about the magnitude decay and phase offset introduced by the channel. Actually, receiving side usually estimates channel state using special pilot elements incorporated into the signal structure. Transmission of these redundant pilot signals requires extra power and time-frequency resource, that reduces spectral and energy efficiency of the communication system, so the number of pilots should be minimized. The paper describes two views on the reception of short data packets transmitted using quadrature amplitude modulation. On the one hand, coherent reception with semi-blind channel estimation is considered, namely, signal level and phase offset estimation is performed by blind algorithms using all symbols of the packet, and pilot symbols are only used to resolve ambiguity inherent for blind estimates of phase offset. On the other hand, the whole packet can be treated as a signal from a signal set suitable for noncoherent reception. High-correlation approximation for bit error probability is evaluated and compared with results obtained for coherent reception with channel estimation. Computer simulation showed that even for moderately short QAM packets bit error probability for semi-blind channel estimation is close to achievable limits for noncoherent reception of the packet as a whole with a loss about 0.4 dB.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"138 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":"121634160","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":"Extra power backup for balancing of power grid with renewables","authors":"S. Foss, Dmitriy Kim, G. Georgiev, A. Turlikov","doi":"10.1109/RED.2016.7779327","DOIUrl":"https://doi.org/10.1109/RED.2016.7779327","url":null,"abstract":"We introduce a number of mathematical models for the management of an electrical power system in the presence of renewable generation. We also study the impact of power systems of neighbouring countries on the grid.","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":"130286238","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":"Applications of two-faced processes to random number generation","authors":"B. Ryabko, N. Savina","doi":"10.1109/RED.2016.7779347","DOIUrl":"https://doi.org/10.1109/RED.2016.7779347","url":null,"abstract":"Random and pseudorandom number generators (RNG and PRNG) are used for many purposes including cryptographic, modeling and simulation applications. For such applications a generated bit sequence should mimic true random, i.e., by definition, such a sequence could be interpreted as the result of the flips of a fair coin with sides that are labeled 0 and 1 (i.e., it is the Bernoulli process with p(0) = p(1) = 1/2). It is known that the Shannon entropy of this process is 1 per letter, whereas for any other stationary process with binary alphabet the Shannon entopy is stricly less than 1. On the other hand, the entropy of the PRNG output should be much less than 1 bit (per letter), but the output sequence should look like truly random. We describe random processes for which these, contradictory at first glance, properties, are valid. More precisely, it is shown that there exist binary-alphabet random processes whose entropy is less than 1 bit (per letter), but the frequency of occurrence of any word |u| goes to 2-|u|, where |u| is the length of u. In turn, it gives a possibility to construct RNG and PRNG which possess theoretical guarantees. This possibility is important for applications such as those in cryptography. We performed some experiments in which low-entropy sequences are transformed into two-faced sequences.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"6 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":"128759292","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":"Local-adaptive blocks-based predictor for lossless image compression","authors":"D. Novikov, N. Egorov, M. Gilmutdinov","doi":"10.1109/RED.2016.7779337","DOIUrl":"https://doi.org/10.1109/RED.2016.7779337","url":null,"abstract":"Pixel intensity prediction is one of significant parts used in most lossless image compression algorithms. A new method based on local adaptation and neighboring blocks data analysis is introduced in this paper. Proposed method belongs to a class of low-complexity methods to be appropriate for realtime compression systems. Description of algorithm is presented as optimization problem solution. Its feasibility is also proven using presented autocorrelation experiment. This experiment allows to understand feasibility of local gradients intensities usage in proposed prediction procedure. Experimental results performed on various open image test sets show that proposed method outperforms state-of-the-art low complexity prediction methods used in modern lossless image compression standards and algorithms.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"25 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":"125096215","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":"Efficiency of transport layer coding in networks with changing capacities","authors":"D. Malichenko","doi":"10.1109/RED.2016.7779335","DOIUrl":"https://doi.org/10.1109/RED.2016.7779335","url":null,"abstract":"This work considers application of error correcting codes on transport layer of network in condition of changing channel capacities. Changing channel capacities make this work different from others. The mean message delay is a parameter of interest. Simulation model of the network is used for the research. The network model is based on Kleinrock's one. Regular grid topology is used in simulation. The research gives dependency of average message delay on intensity of changes in channel capacities. The dependencies for transmission using transport layer coding and for transmission without application of transport coding are compared.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"53 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":"115591779","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":"Signature codes for a special class of multiple access channel","authors":"E. Egorova, V. Potapova","doi":"10.1109/RED.2016.7779325","DOIUrl":"https://doi.org/10.1109/RED.2016.7779325","url":null,"abstract":"A specific noiseless multiple-access channel model is studied in this paper. Proofs for lower and upper bounds on the achievable-rate of corresponding codes are given.","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":"122057548","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":"A low-complexity SCMA detector for AWGN channel based on solving overdetermined systems of linear equations","authors":"V. P. Klimentyev, A. Sergienko","doi":"10.1109/RED.2016.7779331","DOIUrl":"https://doi.org/10.1109/RED.2016.7779331","url":null,"abstract":"Sparse code multiple access (SCMA) is one of proposed non-orthogonal multiple access schemes for Fifth generation (5G) wireless communication standard. Maximum likelihood (ML) algorithm for SCMA detection has very high complexity and can not be implemented in real-time applications. Message Passing Algorithm (MPA) has smaller complexity, but it is still high. In this paper, we propose a new SCMA detector for AWGN channel which complexity is smaller than that of simplified log-domain MPA. This algorithm is based on antipodal symmetry of codewords in codebooks. Because of this property decoding process is reduced to the solution of a small number of overdetermined systems of linear equations. The performance of the proposed algorithm is equivalent to Max-Log-MPA with 2-3 iterations. The implementation of the algorithm is well parallelized, calculations of inverse matrices are performed in advance and obtained results are stored in memory, i. e. operations with very high computational complexity need not be performed in real-time application.","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":"128961918","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":"Boundary value for data gathering time in distributed control systems with sporadic accidents","authors":"K. Smirnov","doi":"10.1109/RED.2016.7779350","DOIUrl":"https://doi.org/10.1109/RED.2016.7779350","url":null,"abstract":"We consider a distributed WSNs with event-based reporting. A data gathering time is an important attribute for such systems. Due to that fact, a lot of media access protocols have been designed to meet special demands of particular applied application. To analyze and compare the variety of protocols the lower bound of data gathering time is required. In the paper we propose a special technique to determine a boundary value for mean data gathering time. The obtained general result takes into account an information on operating conditions of the system and system algorithms as well. We also derive some exact expressions for the particular most used models.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"129 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":"124038380","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":"Spatial processing redundancy and accuracy of multichannel estimation of radar object angular coordinates","authors":"V. Pavlov","doi":"10.1109/RED.2016.7779340","DOIUrl":"https://doi.org/10.1109/RED.2016.7779340","url":null,"abstract":"The paper studies the accuracy characteristics of radar object angular coordinates estimation fulfilled by the spatially multichannel procedures, which are based upon a ring shaped model of radar signal receiving and differ among themselves by redundancy factor. It is shown in analytical evaluation that the spatial processing structures of minimal and ultimate redundancies are equate by potential accuracy criterion when signal-to-noise ratio is high, otherwise at the area of low signal-to-noise ratios the advancement of redundancy factor is resulted in estimation error reduction down to Cramer-Rao bound.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"15 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":"127174033","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}