Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338402
A. Kreshchuk, V. Potapov
In this paper we consider the coded modulation for Multiple Input Multiple Output (MIMO) channels described earlier in [1]. We study the Permutation Free (PF) and Permutation and Repetition Free (PRF) codes and their cardinality. We propose a new lower bound on PF and PRF code cardinality. We compare it to existing codes cardinality and to the existing upper bound. Then we study the error correction efficiency of these codes with computer simulation. The results of the simulation show that error correction efficiency increases with the length of the PF or PRF code.
{"title":"On some MIMO coded modulations based on hadamard matrices","authors":"A. Kreshchuk, V. Potapov","doi":"10.1109/RED.2012.6338402","DOIUrl":"https://doi.org/10.1109/RED.2012.6338402","url":null,"abstract":"In this paper we consider the coded modulation for Multiple Input Multiple Output (MIMO) channels described earlier in [1]. We study the Permutation Free (PF) and Permutation and Repetition Free (PRF) codes and their cardinality. We propose a new lower bound on PF and PRF code cardinality. We compare it to existing codes cardinality and to the existing upper bound. Then we study the error correction efficiency of these codes with computer simulation. The results of the simulation show that error correction efficiency increases with the length of the PF or PRF code.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130473040","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.6338417
I. Zhilin, V. Zyablov
The influence of the computational precision used in BP decoder on LDPC codes performance is studied. It is shown that an error floor can be lowered and pseudo-codewords are made possible to decode by increasing computational precision.
{"title":"Effects of belief propagation computational precision on LDPC codes error floors","authors":"I. Zhilin, V. Zyablov","doi":"10.1109/RED.2012.6338417","DOIUrl":"https://doi.org/10.1109/RED.2012.6338417","url":null,"abstract":"The influence of the computational precision used in BP decoder on LDPC codes performance is studied. It is shown that an error floor can be lowered and pseudo-codewords are made possible to decode by increasing computational precision.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124816189","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.6338393
A. Afanasyeva, S. Bezzateev, E. Linsky, V. Petrov, Daeyoub Kim
A new threshold identity-based encryption scheme secure against a chosen identity attack is proposed in this paper. The construction extends the identity-based encryption scheme by Cocks.
{"title":"Threshold identity based encryption scheme on quadratic residues","authors":"A. Afanasyeva, S. Bezzateev, E. Linsky, V. Petrov, Daeyoub Kim","doi":"10.1109/RED.2012.6338393","DOIUrl":"https://doi.org/10.1109/RED.2012.6338393","url":null,"abstract":"A new threshold identity-based encryption scheme secure against a chosen identity attack is proposed in this paper. The construction extends the identity-based encryption scheme by Cocks.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123425417","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.6338409
P. Pristavka, Boris Ryabko
We describe and experimentally investigate a method to construct forecasting algorithms for stationary and ergodic processes based on universal measures (or so-called universal data compressors). Using the time series of solar activity indices as a research target, we show that the quality of the predictions is higher than that of known methods forecasts.
{"title":"Experimental investigation of the efficiency of universal measures based forecasting methods","authors":"P. Pristavka, Boris Ryabko","doi":"10.1109/RED.2012.6338409","DOIUrl":"https://doi.org/10.1109/RED.2012.6338409","url":null,"abstract":"We describe and experimentally investigate a method to construct forecasting algorithms for stationary and ergodic processes based on universal measures (or so-called universal data compressors). Using the time series of solar activity indices as a research target, we show that the quality of the predictions is higher than that of known methods forecasts.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129344144","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.6338410
E. Pustovalov, A. Turlikov
Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.
{"title":"Random multiple access in q-ary disjunctive channel","authors":"E. Pustovalov, A. Turlikov","doi":"10.1109/RED.2012.6338410","DOIUrl":"https://doi.org/10.1109/RED.2012.6338410","url":null,"abstract":"Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms. It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel. The algorithm has throughput of 0.603 which is grater than throughput of conventional RMA algorithms that do not exploit properties of considered channel.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132791711","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
扫码关注我们
求助内容：
应助结果提醒方式：