Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338401
F. Ivanov, V. Zyablov, V. Potapov
Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).
{"title":"Low-density parity-check codes based on the independent subgroups","authors":"F. Ivanov, V. Zyablov, V. Potapov","doi":"10.1109/RED.2012.6338401","DOIUrl":"https://doi.org/10.1109/RED.2012.6338401","url":null,"abstract":"Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116697677","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 : 2012-10-25DOI: 10.1109/RED.2012.6338396
S. Bezzateev, N. Voloshina, K. Zhidanov
This paper discusses the approach to construction of steganographic method for the weighted container. To find the efficient solution, concept of Penalty Function is introduced. The analysis of the efficiency of the weighted embedding for the simple model of weighted container is shown.
{"title":"Steganographic method on weighted container","authors":"S. Bezzateev, N. Voloshina, K. Zhidanov","doi":"10.1109/RED.2012.6338396","DOIUrl":"https://doi.org/10.1109/RED.2012.6338396","url":null,"abstract":"This paper discusses the approach to construction of steganographic method for the weighted container. To find the efficient solution, concept of Penalty Function is introduced. The analysis of the efficiency of the weighted embedding for the simple model of weighted container is shown.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116018372","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 : 2012-10-25DOI: 10.1109/RED.2012.6338408
A. Petrov, A. Sergienko
We presented a new algorithm for blind phase offset estimation for signals with quadrature amplitude modulation (QAM). The algorithm is based on a circular harmonic expansion of log-likelihood function (LLF). Retaining one or two most significant terms in this series gives a harmonic or biharmonic circular decomposition of the LLF, this approach leads to notable improvement of the estimation quality comparing to known versions of popular 4th power phase estimation algorithm. Computer simulation results justified the advantages of the proposed method. It was also shown that the simplified implementation of the algorithm with weighting functions independent of signal-to-noise ratio (SNR) does not lead to any notable performance loss. In this paper we present analytical evaluation of estimation variance for both harmonic and biharmonic methods. Computation is based on quadratic approximation of objective function in the neighborhood of the phase offset true value, Taylor expansion of analytical expression for estimation error, and retaining statistical moments of objective function derivatives up to second order. Analytical results demonstrate good agreement with computer simulation for moderate and high SNR values.
{"title":"Analytical evaluation of performance for harmonic and biharmonic methods of blind phase offset estimation","authors":"A. Petrov, A. Sergienko","doi":"10.1109/RED.2012.6338408","DOIUrl":"https://doi.org/10.1109/RED.2012.6338408","url":null,"abstract":"We presented a new algorithm for blind phase offset estimation for signals with quadrature amplitude modulation (QAM). The algorithm is based on a circular harmonic expansion of log-likelihood function (LLF). Retaining one or two most significant terms in this series gives a harmonic or biharmonic circular decomposition of the LLF, this approach leads to notable improvement of the estimation quality comparing to known versions of popular 4th power phase estimation algorithm. Computer simulation results justified the advantages of the proposed method. It was also shown that the simplified implementation of the algorithm with weighting functions independent of signal-to-noise ratio (SNR) does not lead to any notable performance loss. In this paper we present analytical evaluation of estimation variance for both harmonic and biharmonic methods. Computation is based on quadratic approximation of objective function in the neighborhood of the phase offset true value, Taylor expansion of analytical expression for estimation error, and retaining statistical moments of objective function derivatives up to second order. Analytical results demonstrate good agreement with computer simulation for moderate and high SNR values.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126337304","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 : 2012-10-25DOI: 10.1109/RED.2012.6338407
D. Osipov
In what follows the problem of finding upper bounds on denial probability and probability of erroneous decoding in a coded Dynamic Hopset Allocation Frequency Hopping system with noncoherent threshold reception is considered.
本文研究了具有非相干阈值接收的编码动态Hopset分配跳频系统的拒绝概率和误码概率上界问题。
{"title":"Upper bounds for a coded DHA FH OFDMA system with noncoherent threshold reception","authors":"D. Osipov","doi":"10.1109/RED.2012.6338407","DOIUrl":"https://doi.org/10.1109/RED.2012.6338407","url":null,"abstract":"In what follows the problem of finding upper bounds on denial probability and probability of erroneous decoding in a coded Dynamic Hopset Allocation Frequency Hopping system with noncoherent threshold reception is considered.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"1 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131752133","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 : 2012-10-25DOI: 10.1109/RED.2012.6338399
A. Fionov, B. Ryabko
We suggest an approach to constructing low-redundant RLL (d; k)-codes whose complexity does not depend on the code length and is determined solely by the achievable redundancy r, the time and space complexity being O(log2(1/r)) and O(log(1/r)), respectively, as r → 0. First we select code-words whose combinations may constitute all (d; k)-constrained sequences of any length. Then we use arithmetic decoding to produce these codewords with (or close to) optimal probabilities from an input sequence. The coding algorithms and estimates of performance are provided.
{"title":"Construction of high rate run-length limited codes using arithmetic decoding","authors":"A. Fionov, B. Ryabko","doi":"10.1109/RED.2012.6338399","DOIUrl":"https://doi.org/10.1109/RED.2012.6338399","url":null,"abstract":"We suggest an approach to constructing low-redundant RLL (d; k)-codes whose complexity does not depend on the code length and is determined solely by the achievable redundancy r, the time and space complexity being O(log2(1/r)) and O(log(1/r)), respectively, as r → 0. First we select code-words whose combinations may constitute all (d; k)-constrained sequences of any length. Then we use arithmetic decoding to produce these codewords with (or close to) optimal probabilities from an input sequence. The coding algorithms and estimates of performance are provided.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"35 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133587127","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 : 2012-10-25DOI: 10.1109/RED.2012.6338411
A. Rakitskiy, B. Ryabko, A. Fionov
We propose application of method, based on notion of computer capacity, for evaluating the performance of computer systems. Computer capacity is based on the number of different tasks that can be executed in a given time. This characteristic determined only by the computer architecture, and it can be easily computed at the design stage and used for optimizing architectural decisions.
{"title":"Evaluation of computer capacity for P5 intel processors","authors":"A. Rakitskiy, B. Ryabko, A. Fionov","doi":"10.1109/RED.2012.6338411","DOIUrl":"https://doi.org/10.1109/RED.2012.6338411","url":null,"abstract":"We propose application of method, based on notion of computer capacity, for evaluating the performance of computer systems. Computer capacity is based on the number of different tasks that can be executed in a given time. This characteristic determined only by the computer architecture, and it can be easily computed at the design stage and used for optimizing architectural decisions.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134117305","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 : 2012-10-25DOI: 10.1109/RED.2012.6338400
M. Gilmutdinov, A. Veselov, B. Filippov
Distributed video coding (DVC) is a relatively new video coding paradigm based on distributed source coding ideas. This approach does not use motion estimation at the encoder side and allows implementing low-complexity encoding schemes. In the DVC decoding procedure turns to generation of side information using key frames and further side information refinement using the principles of error correction coding. The basic approaches to side information generation for DVC are considered in the paper. A new algorithm of side information generation is proposed. An evaluation of rate-distortion performance of the new DVC scheme based on the described algorithm is given.
{"title":"Analysis of side information generation impact on distributed video coding performance","authors":"M. Gilmutdinov, A. Veselov, B. Filippov","doi":"10.1109/RED.2012.6338400","DOIUrl":"https://doi.org/10.1109/RED.2012.6338400","url":null,"abstract":"Distributed video coding (DVC) is a relatively new video coding paradigm based on distributed source coding ideas. This approach does not use motion estimation at the encoder side and allows implementing low-complexity encoding schemes. In the DVC decoding procedure turns to generation of side information using key frames and further side information refinement using the principles of error correction coding. The basic approaches to side information generation for DVC are considered in the paper. A new algorithm of side information generation is proposed. An evaluation of rate-distortion performance of the new DVC scheme based on the described algorithm is given.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125052742","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 : 2012-10-25DOI: 10.1109/RED.2012.6338394
E. Andreeva
User's identification and authentication procedures realize access control to information. But with development of information technology become important not only authenticate user in the beginning of work with system, but also control his authenticity during working. The solution of this problem may be a system with continuous authentication. Continuous authentication it is such type of authentication when system control user access at each time interval. In this paper I propose model of continuous authentication system using human heart sound signals to access control and show the method of secret sharing in such system.
{"title":"Secret sharing in continuous access control system, using heart sounds","authors":"E. Andreeva","doi":"10.1109/RED.2012.6338394","DOIUrl":"https://doi.org/10.1109/RED.2012.6338394","url":null,"abstract":"User's identification and authentication procedures realize access control to information. But with development of information technology become important not only authenticate user in the beginning of work with system, but also control his authenticity during working. The solution of this problem may be a system with continuous authentication. Continuous authentication it is such type of authentication when system control user access at each time interval. In this paper I propose model of continuous authentication system using human heart sound signals to access control and show the method of secret sharing in such system.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125441062","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 : 2012-10-25DOI: 10.1109/RED.2012.6338403
Wenhui Li, V. Sidorenko
The Chinese remainder codes has been studied when only errors occur. We propose an error-erasure-decoder for the Chinese remainder codes and analyze the decoding radius.
研究了仅发生错误时的中文余码。提出了一种中文余码纠删解码器，并对其译码半径进行了分析。
{"title":"On the error-erasure-decoder of the Chinese remainder codes","authors":"Wenhui Li, V. Sidorenko","doi":"10.1109/RED.2012.6338403","DOIUrl":"https://doi.org/10.1109/RED.2012.6338403","url":null,"abstract":"The Chinese remainder codes has been studied when only errors occur. We propose an error-erasure-decoder for the Chinese remainder codes and analyze the decoding radius.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130785395","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 : 2012-10-25DOI: 10.1109/RED.2012.6338397
N. Blaunstein, Michail Sergeev
The optimization of the channel capacity in the new fourth generation (4G) wireless networks became a key issue during the last decade. In this work, the co-existence of macrocell Base Stations (MBSs) and Femtocell Access Points (FAPs) or home base stations (HBS) with shared and dedicated carrier frequency allocations is considered. The simulation framework for analysis of channel capacity improvement in complex urban environment is introduced. The analysis of heterogeneous network consisting of dedicated femtocells for home coverage in a presence of traditional macrocell pattern is presented. The advantages and drawbacks for different deployment strategies are investigated using the proposed simulation framework.
{"title":"Channel capacity prediction for femtocell-macrocell deployment strategies in dense urban environments with high layout of users","authors":"N. Blaunstein, Michail Sergeev","doi":"10.1109/RED.2012.6338397","DOIUrl":"https://doi.org/10.1109/RED.2012.6338397","url":null,"abstract":"The optimization of the channel capacity in the new fourth generation (4G) wireless networks became a key issue during the last decade. In this work, the co-existence of macrocell Base Stations (MBSs) and Femtocell Access Points (FAPs) or home base stations (HBS) with shared and dedicated carrier frequency allocations is considered. The simulation framework for analysis of channel capacity improvement in complex urban environment is introduced. The analysis of heterogeneous network consisting of dedicated femtocells for home coverage in a presence of traditional macrocell pattern is presented. The advantages and drawbacks for different deployment strategies are investigated using the proposed simulation framework.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127921656","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
扫码关注我们
求助内容：
应助结果提醒方式：