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

IEEE Global Telecommunications Conference (GLOBECOM 03)

作者： Ren, J Michigan State Univ Dept Elect & Comp Engn E Landing MI 48864 USA

ISBN: (纸本)0780379748

We first prove that every Hermitian code is a direct sum of concatenated Reed-Solomon codes over GF(q(2)), which provides a new method to calculate the dimension of the Hermitian code. Based on this, we present a new decoding algorithm for Hermitian code. Our algorithm is especially efficient in decoding burst errors. Finally, a method to optimize Hermitian code is obtained. The optimized code maintains the same dimension and error correctability, but the complexity for burst error correction can be reduced from O(n(5/3)) to O(n).

关键词： Hermitian code Reed-Solomon code concatenation burst error decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Graphical codes revisited

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第1期43卷 136-146页

作者： Jungnickel, D Vanstone, SA UNIV WATERLOO DEPT COMBINATOR & OPTIMIZAT WATERLOO ON N2L 3G1 CANADA

It is well-known that the set of all even subgraphs of a connected graph G on p vertices with q edges forms a binary linear code C = C-E(G) with parameters [q, q - p + 1, g], where g is the girth of G. Such codes were studied systematically by Bredeson and Hakimi [7], [14] who were concerned with the problems of augmenting C to a larger [q, k, g]-code and of efficiently decoding such augmented graphical codes, We will give a new approach to these problems by requiring the augmented codes to be graphical (i,e,, they should still consist of spanning subgraphs of G), On one hand, we present two construction methods which turn out to contain the methods proposed by Hakimi and Bredeson [14] as special cases (even though it is not clear from their paper that their augmented codes are in fact graphical), As we will show, this not only gives a better understanding of their construction, it also results in augmenting codes of larger dimension. We look at the case of 1-error-correcting graphical codes in some detail, In particular, we show how to obtain the extended Hamming codes as ''purely'' graphical codes by our approach, On the other hand, we follow a suggestion of Ntafos and Hakimi [26] and use techniques from combinatorial optimization to give decoding procedures for graphical codes which turn out to be considerably more efficient than the approach via majority logic decoding proposed by Bredeson and Hakimi. We also consider the decoding problem for the even graphical code based on the complete graph K-2n in more detail: we discuss an efficient hardware implementation of an encoding/decoding scheme for these codes and we also show that things may be arranged in such a way that one can also correct all adjacent double errors, Finally, we briefly discuss nonlinear graphical codes.

关键词： graphical code binary code decoding algorithm Chinese postman problem

来源：评论

学校读者我要写书评

暂无评论

Investigating the Effect of Different Channel Coding on the Performance of Sparse Code Multiple Access over AWGN Channel

引用

WIRELESS PERSONAL COMMUNICATIONS 2023年 1-21页

作者： Muhammed, Younus A. Yousif, Raghad Z. Soran Univ Coll Sci Dept Comp Sci Soran KRG Iraq Salahaddin Univ Erbil Coll Sci Dept Phys Erbil KRG Iraq Catholic Univ Erbil Coll Informat Technol Dept IT Erbil KRG Iraq

The next generation of wireless communication systems requires simultaneous and reliable connectivity on a huge scale. Selecting the proper channel coding for sparse code multiple access (SCMA) as code domain non-orthogonal multiple access techniques is crucial for meeting the needs of the internet of things (IoT), which is the foundational technology in fifth generation wireless networks (5G). SCMA is a multiplexing technology that maximizes spectrum efficiency while increasing accessibility. In this research, the bit error rate (BER) of three joint systems has been compared: Joint Turbo code and SCMA (JTCSCMA), Joint low density parity check (LDPC) code and SCAM (JLC-SCMA), and Joint Polar code and SCMA (JPC-SCMA) for downlink sites supporting the IoT. Thus, the channel coder parameters of the proposed systems have been examined in an effort to enhance the overall performance of the combined systems. The simulation results demonstrated that the JPC-SCMA system outperformed other suggested systems over an AWGN channel while requiring less computational complexity. At BER 10(-4), the JPC-SCMA system exhibited an SNR improvement of 1 dB over JLC-SCMA and 2.8 dB over JTC. Additionally, at BER 10(-2), it was observed that JPC-SCMA produced a gain of 4.5 dB at iteration 5 with interleaved case.

关键词： SCMA Channel coding MPA decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Superresolved imaging of remote moving targets

引用

OPTICS LETTERS 2006年第5期31卷 586-588页

作者： García, J Zalevsky, Z Ferreira, C Univ Valencia Dept Opt E-46100 Burjassot Spain Bar Ilan Univ Sch Engn IL-52900 Ramat Gan Israel

We present a superresolving approach that allows one to exceed the diffraction limit and recover highly resolved contours of moving targets from a sequence of low-resolution images. The presented approach is suitable for remote sensing applications. The resolution decoding algorithm that is used to recover the highresolution features of the target can be run partially via optical means and that way can be used to reduce the required computational complexity. (c) 2006 Optical Society of America.

关键词： Road Moving Imaging decoding algorithm complexity classes Remote image resolution

来源：评论

学校读者我要写书评

暂无评论

LDPC check node implementation using reversible logic

引用

IET CIRCUITS DEVICES & SYSTEMS 2019年第4期13卷 443-455页

作者： Awais, Muhammad Razzaq, Anas Ahmed, Ashfaq Masera, Guido COMSATS Univ Islamabad Dept Elect & Comp Engn Wah Campus Islamabad Pakistan Politecn Torino Dept Elect & Telecommun Turin Italy

Reversible logic is an emerging digital design paradigm which promises low energy dissipation;thanks to its information-lossless nature. True potential of this exciting concept can only be assessed by facing the design of practical complexity applications. Low density parity check (LDPC) decoding is one such application from forward error correction domain. The core of LDPC decoding is the check node (CN) processor, which executes the decoding algorithm and constitutes a major portion of decoder's overall power consumption. This work proposes a low-power LDPC CN architecture using reversible logic gates. Transistor level design and full custom layout of proposed architecture is carried out on UMC 90 nm complementary metal-oxide-semiconductor technology. All reversible blocks of proposed CN are optimised for quantum cost, garbage outputs and transistor count. The CN functionality is validated with post-layout simulations, layout versus schematic checks and design rule checks. The proposed CN occupies a post-layout area of 0.013 mm(2), achieves up to 4.3 GHz frequency and consumes 52 mu W power. The performance of proposed CN is also compared with its implementation using irreversible gates. The proposed CN achieves about 300% reduction in power delay product with affordable complexity as compared to its classical implementation.

关键词： practical complexity applications logic gates postlayout simulations forward error correction domain low-power electronics schematic checks reversible logic gates logic circuits forward error correction postlayout area LDPC check node implementation decoding transistor level design complementary metal–oxide–semiconductor technology CN functionality power delay product LDPC decoding logic design digital design paradigm CMOS integrated circuits reversible blocks information-lossless nature low-power LDPC CN architecture low density parity check decoding check node processor decoding algorithm transistors parity check codes low energy dissipation

来源：评论

学校读者我要写书评

暂无评论

Low-rank parity-check codes over finite commutative rings

引用

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 2024年 1-27页

作者： Kamche, Hermann Tchatchiem Kalachi, Herve Tale Djomou, Franck Rivel Kamwa Fouotsa, Emmanuel Univ Neuchatel Inst Math Neuchatel Switzerland Natl Adv Sch Engn Yaounde Dept Comp Engn Yaounde Cameroon Univ Dschang Fac Sci Dept Math & Comp Sci Dschang Cameroon Univ Bamenda Higher Teacher Training Coll Dept Math Bamenda Cameroon

Low-Rank Parity-Check (LRPC) codes are a class of rank metric codes that have many applications specifically in network coding and cryptography. Recently, LRPC codes have been extended to Galois rings which are a specific case of finite rings. In this paper, we first define LRPC codes over finite commutative local rings, which are bricks of finite rings, with an efficient decoder. We improve the theoretical bound of the failure probability of the decoder. Then, we extend the work to arbitrary finite commutative rings. Certain conditions are generally used to ensure the success of the decoder. Over finite fields, one of these conditions is to choose a prime number as the extension degree of the Galois field. We have shown that one can construct LRPC codes without this condition on the degree of Galois extension.

关键词： decoding algorithm Finite rings Galois extension LRPC codes Local rings Rank metric codes

来源：评论

学校读者我要写书评

暂无评论

Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems

引用

SWARM AND EVOLUTIONARY COMPUTATION 2014年第0期14卷 66-75页

作者： Azad, Md. Abul Kalam Rocha, Ana Maria A. C. Fernandes, Edite M. G. P. Univ Minho Algoritmi R&D Ctr Sch Engn P-4710057 Braga Portugal Univ Minho Sch Engn Dept Prod & Syst P-4710057 Braga Portugal

The 0-1 multidimensional knapsack problem (MKP) arises in many fields of optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an artificial fish swarm algorithm has been developed in continuous global optimization. The algorithm uses a population of points in space to represent the position of fish in the school. In this paper, a binary version of the artificial fish swarm algorithm is proposed for solving the 0-1 MKP. In the proposed method, a point is represented by a binary string of 0/1 bits. Each bit of a trial point is generated by copying the corresponding bit from the current point or from some other specified point, with equal probability. Occasionally, some randomly chosen bits of a selected point are changed from 0 to 1, or 1 to 0, with an user defined probability. The infeasible solutions are made feasible by a decoding algorithm. A simple heuristic add item is implemented to each feasible point aiming to improve the quality of that solution. A periodic reinitialization of the population greatly improves the quality of the solutions obtained by the algorithm. The proposed method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method gives a competitive performance when solving this kind of problems. (C 2013 Elsevier B.V. All rights reserved.

关键词： 0-1 knapsack problem Multidimensional knapsack Artificial fish swarm decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第1期44卷 367-378页

作者： Canteaut, A Chabaud, F Inst Natl Rech Informat & Automat Projet Codes F-78153 Le Chesnay France Liens F-75230 Paris 05 France

An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it notably points out some weaknesses in McEliece&#... 详细信息

关键词： BCH codes decoding algorithm error-correcting codes McEliece's cryptosystem minimum weight

来源：评论

学校读者我要写书评

暂无评论

Efficient speech recognition using subvector quantization and discrete-mixture HMMS

引用

COMPUTER SPEECH AND LANGUAGE 2000年第1期14卷 33-46页

作者： Digalakis, V Tsakalidis, S Harizakis, C Neumeyer, L Tech Univ Crete Dept Elect & Comp Engn Hania 73100 Greece SRI Int Menlo Park CA 94025 USA

This paper introduces a new form of observation distributions for hidden Markov models (HMMs), combining subvector quantization and mixtures of discrete distributions. Despite what is generally believed, we show that discrete-distribution HMMs can outperform continuous-density HMMs at significantly faster decoding speeds. Performance of the discrete HMMs is improved by using product-code vector quantization (VQ) and mixtures of discrete distributions. The decoding speed of the discrete HMMs is also improved by quantizing subvectors of coefficients, since this reduces the number of table lookups needed to compute the output probabilities. We present efficient training and decoding algorithms for the discrete-mixture HMMs (DMHMMs). Our experimental results in the air-travel information domain show that the high level of recognition accuracy of continuous-mixture-density HMMs (CDHMMs) can be maintained at significantly faster decoding speeds. Moreover, we show that when the same number of mixture components is used in DMHMMs and CDHMMs, the new models exhibit superior recognition performance. (C) 2000 Academic Press.

关键词： mixtures discrete element decoding algorithm quantizer numerical invariant decoding Vector quantization discrete data Hidden Markov models Information Field

来源：评论

学校读者我要写书评

暂无评论

Research on the application of LDPC code in chaotic sequence image encryption

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第3-Sup期22卷 S6359-S6370页

作者： Wang, Zhong-xun Lou, Yang Wang, Wen-qi Zhang, Min Li, Xiao-lin Yantai Univ Inst Sci & Technol Optoelect Informat Yantai Peoples R China

Low density parity check code (LDPC) is a linear block code whose performance is close to Shannon's limit. Compared with other decoding algorithms, it has low decoding complexity and flexible structure. So it becomes people's research hotspots. In recent years, LDPC code codec algorithm has been improved, and is widely used in deep space communications, optical fiber communications, mobile communications and underwater and other fields. Using chaotic sequence single-layer mapping plus pixel scrambling can complete chaotic image encryption, because some chaotic sequence is poor robust, in the process of channel transmission, it is difficult to ensure that the information can be destroyed after the attack In this paper, LDPC codes are introduced, and in the chaotic image encryption, block coding is used to form error protection to improve the stability of the image transmission process and improve the transmission quality.

关键词： LDPC code Logistic chaotic sequence image encryption Coding algorithm decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：