2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems最新文献

筛选
英文 中文
On jamming-proof signal-code constructions for a multiple access system 多址系统防干扰信码结构研究
D. Osipov
{"title":"On jamming-proof signal-code constructions for a multiple access system","authors":"D. Osipov","doi":"10.1109/RED.2014.7016710","DOIUrl":"https://doi.org/10.1109/RED.2014.7016710","url":null,"abstract":"In what follows signal-code constructions employing block and convolutional nonbinary inner codes that can perform under severe jamming are proposed. Robustness of the proposed signal-code constructions to jamming is verified by means of simulation.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134130470","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}
引用次数: 2
The error-correcting capabilities of low-complexity decoded H-LDPC code as irregular LDPC code 低复杂度解码H-LDPC码作为不规则LDPC码的纠错能力
P. Rybin
{"title":"The error-correcting capabilities of low-complexity decoded H-LDPC code as irregular LDPC code","authors":"P. Rybin","doi":"10.1109/RED.2014.7016711","DOIUrl":"https://doi.org/10.1109/RED.2014.7016711","url":null,"abstract":"This paper deals with the Low-Density Parity-Check codes with the constituent Hamming codes (H-LDPC codes) and two different iterative hard-decision low-complexity decoding algorithms. Both algorithms are based on the same main idea: the decreasing of the syndrome weight on each step of the decoding algorithm. The first decoding algorithm uses the properties of the constituent Hamming code. The best known lower-bound on the guaranteed corrected errors fraction for the H-LDPC codes under the first decoding algorithm was obtained in 2011. The second decoding algorithm considers H-LDPC as the irregular LDPC code and uses the well-known majority decoding algorithm. The lower-bound on the guaranteed corrected errors fraction for H-LDPC code under the second decoding algorithm is introduced for the first time in this paper. Numerical results for the lower-bound, obtained in this paper for H-LDPC code under the second decoding algorithm, significantly exceed the numerical results for the best known lower-bounds, obtained previously for H-LDPC code under the first decoding algorithm.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115822893","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}
引用次数: 0
Generalized supercodes decoding 广义超码译码
A. Abramov, E. Krouk
{"title":"Generalized supercodes decoding","authors":"A. Abramov, E. Krouk","doi":"10.1109/RED.2014.7016692","DOIUrl":"https://doi.org/10.1109/RED.2014.7016692","url":null,"abstract":"Decoding random linear codes is one of the central problems in coding theory and code-based cryptography. In this paper a generalized supercodes decoding algorithm is proposed. The idea of the new algorithm is to keep a list of candidate vectors having an exponential size instead of tending to zero size as it was organized in the original algorithm proposed by Barg, Krouk and van Tilborg.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122963179","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}
引用次数: 0
Analysis of exemplar based inpainting techniques for error concealment 基于实例的错误隐藏绘画技术分析
V. Yastrebov, A. Veselov, B. Filippov
{"title":"Analysis of exemplar based inpainting techniques for error concealment","authors":"V. Yastrebov, A. Veselov, B. Filippov","doi":"10.1109/RED.2014.7016715","DOIUrl":"https://doi.org/10.1109/RED.2014.7016715","url":null,"abstract":"In this paper the problem of decoder side error concealment is considered. A comparison of several restoration methods is presented. All the compared methods belong to the class of exemplar based inpainting algorithms. It is shown that patch based methods are effective for restoration of small macroblocks while block based methods are effective for restoration of large macroblocks.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121144934","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}
引用次数: 3
New iterative turbo code list decoder 新型迭代涡轮码表解码器
Akmal Akmalkhodzhaev, Alexander Kozlov
{"title":"New iterative turbo code list decoder","authors":"Akmal Akmalkhodzhaev, Alexander Kozlov","doi":"10.1109/RED.2014.7016695","DOIUrl":"https://doi.org/10.1109/RED.2014.7016695","url":null,"abstract":"Turbo decoder performance improvement is considered in the work. While on the first iteration of the conventional turbo decoder a priori reliabilities are supposed to be zero in the new scheme it is proposed to estimate and set these values. Algorithm for generation of a list of a priori LLRs is described, where each list sequence is used as an input to independent turbo decoder. As a result list of decoded sequences is obtained from independent turbo decoding processes. Thus new turbo code list decoding algorithm is proposed and parallel turbo decoding technique is introduced. FER simulation results for 3GPP LTE turbo code show 0.4 dB gain for short information sequences and 0.15 dB gain for longer ones. As a criterion of choosing of correct sequence in the list CRC is used.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114976845","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}
引用次数: 5
One subclass of cyclic generalized (L,G) codes with separable Goppa polynomial 具有可分Goppa多项式的循环广义(L,G)码的一个子类
S. Bezzateev
{"title":"One subclass of cyclic generalized (L,G) codes with separable Goppa polynomial","authors":"S. Bezzateev","doi":"10.1109/RED.2014.7016699","DOIUrl":"https://doi.org/10.1109/RED.2014.7016699","url":null,"abstract":"A new subclass of cyclic generalized (L,G) codes with separable Goppa polynomial is constructed.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115371823","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}
引用次数: 1
Numerical and simulation method to estimate metastability time interval for slotted ALOHA 开槽ALOHA亚稳态时间间隔估计的数值模拟方法
Dmitriy Kim, Dmitriy Purgin
{"title":"Numerical and simulation method to estimate metastability time interval for slotted ALOHA","authors":"Dmitriy Kim, Dmitriy Purgin","doi":"10.1109/RED.2014.7016706","DOIUrl":"https://doi.org/10.1109/RED.2014.7016706","url":null,"abstract":"We consider the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). It is well known that this algorithm is not stable, but under some conditions metastability effect is observed (i.e. the algorithm provides the required quality of service on finite but long-term time intervals). We study a method to estimate the metastability time interval for an input stream of i.i.d. sequence of random values.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126737465","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}
引用次数: 0
Iterative known interference cancellation in OFDM systems OFDM系统中迭代已知干扰消除
E. Pustovalov, A. Turlikov
{"title":"Iterative known interference cancellation in OFDM systems","authors":"E. Pustovalov, A. Turlikov","doi":"10.1109/RED.2014.7016718","DOIUrl":"https://doi.org/10.1109/RED.2014.7016718","url":null,"abstract":"Collision resolution via interference cancellation (IC) in packet-based random multiple access (RMA) systems is a promising technique to decrease number of retransmissions and increase overall throughput. This paper proposes novel iterative algorithm of IC in OFDM systems for the case when one of the interfering packets is known to the receiver. Comparing to well-known successive interference cancellation (SIC) methods, proposed algorithm works when there is no significant power imbalance in received signals and receiver could not decode the strongest one. The algorithm exploits the property, that duration of channel response in time domain is constrained while residual interference is widespread over the frequency and time.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129285558","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信