检索结果-内蒙古大学图书馆

A QC-LDPC Code Based Digital Signature algorithm

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2019年第5期35卷 1061-1074页

作者： Ren, Fang Yang, Xue-Fei Zheng, Dong Xian Univ Posts & Telecommun Sch Telecommun & Informat Engn Xian 710121 Shaanxi Peoples R China Xian Univ Posts & Telecommun Natl Engn Lab Wireless Secur Xian 710121 Shaanxi Peoples R China

Courtois-Finiasz-Sendrier (CFS) digital signature algorithm, which proposed in 2001, is the most important code based digital signature algorithm and can resist the known attack of quantum algorithms such as Shor algorithm and Grover algorithm. But the efficiency of CFS is very low because of the extremely low signing speed and the large public key size. In this paper, a variation of CFS algorithm is presented. Instead of the Goppa code and the Patterson decoding algorithm, the new algorithm selects the Quasi-Cyclic Low Density Parity Check (QC-LDPC) code and the Belief Propagation (BP) decoding algorithm in the signing process. Compared with CFS algorithm, the new algorithm greatly reduces the storage space of public key and improves the efficiency of signature without compromising the security.

关键词： code based cryptography digital signature QC-LDPC code decoding algorithm CFS algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimisation of convergence-aware coded PDMA for 5G wireless systems

引用

IET COMMUNICATIONS 2019年第2期13卷 243-250页

作者： Xu, Jin Han, Xueqin Ding, Hanqing Li, Zhigang Yu, Zeqi Dai, Xiaoming Zhengzhou Univ Light Ind Sch Comp & Commun Engn 136 Kexue Rd Zhengzhou Henan Peoples R China Univ Sci & Technol Beijing Sch Comp & Commun Engn 30 Xueyuan Rd Beijing Peoples R China

Orthogonal frequency division multiplexing-based pattern division multiple access (PDMA) is considered as a promising multiple access scheme for future wireless communication systems due to its high spectral efficiency and powerful ability to support massive users. In this study, it is shown that two pattern matrices with unequal diversity gain in the PDMA system have better convergence performance compared with the signature matrices in a traditional low-density signature multiple access system by simulations and extrinsic information transfer (EXIT) chart analysis. For a low-density parity check (LDPC)-coded PDMA system, the EXIT characteristics between the front-end multiple-user detector (MUD) and the LDPC decoder may be mismatch, which usually leads to degraded performance when an iterative detection and decoding algorithm is used. To overcome this problem, a two-stage iterative optimisation algorithm, which is easy to implement is proposed to find an optimal (near optimal) degree distribution pair for the LDPC code. Both EXIT chart analysis and simulation results demonstrate that the proposed algorithm exhibits further performance gain compared with regular (3,6) LDPC-coded systems under both an additive white Gaussian noise channel and a Rayleigh fading channel.

关键词： Rayleigh channels multi-access systems decoding OFDM modulation AWGN channels parity check codes 5G mobile communication optimisation matrix algebra iterative methods pattern matrices unequal diversity gain signature matrices low-density signature multiple access system extrinsic information transfer chart analysis low-density parity check-coded PDMA system EXIT characteristics multiple-user detector LDPC decoder iterative detection decoding algorithm two-stage iterative optimisation algorithm optimal degree distribution pair 5G wireless systems orthogonal frequency division multiplexing Rayleigh fading channel additive white Gaussian noise channel front-end multiple-user detector LDPC-coded PDMA system EXIT chart analysis convergence-aware coded PDMA pattern division multiple access spectral efficiency wireless communication systems multiple access scheme

来源：评论

学校读者我要写书评

暂无评论

An Efficient Weighted Bit-Flipping algorithm for decoding LDPC Codes Based on Log-Likelihood Ratio of Bit Error Probability

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2017年第12期E100B卷 2095-2103页

作者： Chen, Tso-Cho Lu, Erl-Huei Li, Chia-Jung Huang, Kuo-Tsang China Univ Sci & Technol Dept Avion Hsinchu Taiwan Chang Gung Univ Dept Elect Engn Taoyuan Taiwan

In this paper, a weighted multiple bit flipping (WMBF) algorithman for decoding low-density parity-check (LDPC) codes is proposed first. Then the improved WMBF algorithm which we call the efficient weighted bit-flipping (EWBF) algorithm is developed. The EWBF algorithm can dynamically choose either multiple bit-flipping or single bit-flipping in each iteration according to the log-likelihood ratio of the error probability of the received bits. Thus, it can efficiently increase the convergence speed of decoding and prevent the decoding process from falling into loop traps. Compared with the parallel weighted bit-flipping (PWBF) algorithm, the EWBF algorithm can achieve significantly lower computational complexity without performance degradation when the Euclidean geometry (EG)-LDPC codes are decoded. Furthermore, the flipping criterion does not require any parameter adjustment.

关键词： low-density parity-check codes weighted bit-flipping multiple bit-flipping decoding algorithm log-likelihood ratio convergence speed

来源：评论

学校读者我要写书评

暂无评论

Knowledge-aided informed dynamic scheduling for LDPC decoding of short blocks

引用

IET COMMUNICATIONS 2018年第9期12卷 1094-1101页

作者： Healy, Cornelius Shao, Zhichao Oliveira, Robert M. de Lamare, Rodrigo C. Mendes, Luciano L. Pontifical Catholic Univ Rio de Janeiro Ctr Telecommun Studies CETUC Rio De Janeiro Brazil Univ York Dept Elect Engn York N Yorkshire England Inatel Santa Rita Do Sapucai Brazil

Low-density parity-check (LDPC) codes have excellent performance for a wide range of applications at reasonable complexity. LDPC codes with short blocks avoid the high latency of codes with large block lengths, making them potential candidates for ultra reliable low-latency applications of future wireless standards. In this work, a novel informed dynamic scheduling (IDS) strategy for decoding LDPC codes, denoted reliability-based residual belief propagation (Rel-RBP), is developed by exploiting the reliability of the message and the residuals of the possible updates to choose the messages to be used by the decoding algorithm. A different measure for each iteration of the IDS schemes is also presented, which underlies the high cost of those algorithms in terms of computational complexity and motivates the development of the proposed strategy. Simulations show that Rel-RBP speeds up the decoding at reduced complexity and results in error rate performance gains over prior work.

关键词： computational complexity decoding parity check codes telecommunication scheduling telecommunication network reliability short blocks block lengths future wireless standards dynamic scheduling strategy decoding LDPC codes Rel-RBP decoding algorithm IDS schemes computational complexity reduced complexity LDPC decoding low-density parity-check codes ultra reliable low-latency applications reliability-based residual belief propagation knowledge-aided informed dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

One Realization of the Generalized (L, G)-Codes

One Realization of the Generalized (L, G)-Codes

引用

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)

作者： I. K. Noskov S. V. Bezzateev ITMO University Saint-Petersburg Russia Saint-Petersburg State University of Aerospace Instrumentation Saint-Petersburg Russia

In this work we consider one possible approach of realization of the generalized (L, G)-codes with a separable polynomial G(x) and rational functions with a denominator degree greater than 1 as the locators set L.

ISBN: (数字)9781728149448

ISBN: (纸本)9781728149455

关键词： error-correcting codes Goppa codes Generalized (L G)-codes decoding algorithm irreducible polynomials Goppa codes Error correction codes decoding algorithm Irreducible polynomial Locators rational functions

来源：评论

学校读者我要写书评

暂无评论

VLSI Implementation of decoding algorithms using EG-LDPC Codes 7

VLSI Implementation of decoding algorithms using EG-LDPC Cod...

引用

7th International Conference on Advances in Computing and Communications (ICACC)

作者： Prasad, M. N. Giri Reddy, C. Chinnapu Babu, J. Chinna JNTU Univ Anantapuramu Andhra Pradesh India Oo CTE Vijayawada Andhra Pradesh India

The LDPC codes are Shannon Limit codes that can achieve low bit error rates for SNR applications. The features of LDPC Codes are reduction in the decoding time, latency and as well as no error-floors at high SNRs. The proposed algorithms are SBF, MSA, and MLDD. The various decoding algorithms have been compared for these codes. The parameters are describing the which algorithm further helps in selecting the better decoder used for Medical and Signal Processing Applications. These codes are also used in Generating the Barcodes depends on the size of the Parity Check matrix. (C) 2017 The Authors. Published by Elsevier B.V.

关键词： LDPC codes decoding algorithm Shannon limit Soft Decision decoding Hard Decision decoding

来源：评论

学校读者我要写书评

暂无评论

On the Prospects of Optimization Theory

On the Prospects of Optimization Theory

引用

Digital Signal Processing and its Applications (DSPA), International Conference on

作者： V.V. Zolotarev G.V. Ovechkin Space Research Institute Moscow Russian Federation Faculty of Computer Engineering Ryazan State Radio Engineering University named after V.F.Utkin Ryazan Russian Federation

ISBN: (数字)9781728175287

ISBN: (纸本)9781728175294

The situation resulted from the solution of Shannon problem by optimization theory of error-correcting coding in the applied studies of coding theory is analyzed. Unresolved problems of classical (algebraic) theory are discussed. The results for main clusters of decoding algorithms built on the basis of Optimization Theory (OT) are considered. Further tasks for OT development are given, the methods for their solution are offered. Broad possibilities shown by new versions of Viterbi algorithm are mentioned. Advantages of main OT paradigms including the advantages of symbolic codes and divergent coding are shown. A special group of decoding algorithms with direct metrics control (DDMC) is singled out. The main ways to develop coding theory for the coming years and for the future are listed.

关键词： digital communication systems data storage systems error-correcting coding block Viterbi algorithm computer modeling self-orthogonal codes symbolic codes concatenated codes multithreshold decoders divergent coding DATA STORAGE SYSTEMS Digital communication systems Concatenated codes Optimization theory Computer Simulation Error correction codes Symbolic codes Shannon's theory orthogonal codes decoding algorithm Viterbi algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient decoding of Random Errors for Quantum Expander Codes 2018

Efficient Decoding of Random Errors for Quantum Expander Cod...

引用

50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC)

作者： Fawzi, Omar Grospellier, Antoine Leverrier, Anthony Univ Lyon UCBL CNRS INRIAENS LyonLIPUMR 5668 F-69364 Lyon France INRIA Paris France

ISBN: (纸本)9781450355599

We show that quantum expander codes, a constant-rate family of quantum low-density parity check (LDPC) codes, with the quasi linear time decoding algorithm of Leverrier, Tillich and Zemor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with a negligible failure probability. Finding codes with these properties is also motivated by Gottesman's construction of fault tolerant schemes with constant space overhead. In order to obtain this result, we study a notion of alpha-percolation: for a random subset E of vertices of a given graph, we consider the size of the largest connected alpha-subset of E, where Xis an alpha-subset of E if vertical bar X boolean AND E vertical bar >= alpha vertical bar X vertical bar.

关键词： decoding algorithm quantum error correction expander codes percolation

来源：评论

学校读者我要写书评

暂无评论

A Modified Method for General LDPC Bit-flipping decoding

A Modified Method for General LDPC Bit-flipping Decoding

引用

2019第七届计算机与通信管理国际会议

作者： Ruizhen Wu Lin Wang Hua Feng Wei He Intel Mobile Communications Technology(Xi'an) Ltd

A modified method for general LDPC bit-flipping decoding is proposed in this *** proposed method consists of two parts:multi-bit flipping judgement algorithm and multi-bit flipping compensation algorithm,the first part trying to find the maximum acceptable number of bits to flipping at the same time to accelerated convergence process,and the second part to compensates the new errors introduced by the first *** proposed decoding method can be easily used to modify different BF algorithms which means the hardware implementation is *** simulation results show that the proposed method can achieve 2.75% to 36.05% of bit-flipping timing reduction,3.0% to 18.1% of BER reduction at SNR 0.2 dB to 4 dB compared with classic BF,IMWBF,LCWBF,and RRWBF.

关键词： LDPC Bit-flipping decoding algorithm 5G

来源：评论

学校读者我要写书评

暂无评论

A Hardware decoding algorithm for Long-distance Transmission for Well Logging

引用

JOURNAL OF ENVIRONMENTAL AND ENGINEERING GEOPHYSICS 2012年第1期17卷 39-47页

作者： Cao, Ping Song, Ke-Zhu Yang, Jun-Feng Univ Sci & Technol China State Key Lab Particle Detect & Elect Hefei 230026 Peoples R China

Long-distance data transmission plays an important role in geophysical applications. This paper introduces a chip-encoded version of the Manchester-II decoding algorithm that can be used for long-distance transmission for well logging. It can be realized easily in a field programmable gate array (FPGA) hardware chip. We designed a wave tracking technique to optimize the algorithm's real-time decoding, adaptive capacity, and robust decoding. The algorithm could be divided into two modules, a data pre-processing module and a data decoding module, which is comprised of AMI code extraction and Manchester-II decoding. With the help of this algorithm, Manchester-II data transmitted via a 7,000 meter armored cable can be decoded in real time. Measurements in the lab and in situ show that communication systems based on this algorithm decoded correctly and achieved good bit error rate specifications. Compared to traditional methods using some specified encoding chips or digital signal processors, transmissions realized with this algorithm are less expensive and showed better adaptability and real-time performance. In addition to borehole geophysical applications, this algorithm can be used in environmental and engineering geophysical applications where data transmission over long distances is needed, whether on the surface or deep into the Earth.

关键词： decoding COMMUNICATION SYSTEMS decoding algorithm long distance transmission Remote WELLS Well logging adaptive capacity algorithms data transmission Field programmable gate arrays Computer hardware Real time

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：