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

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS 1996年第12期43卷 998-1001页

作者： Wang, Y AbdElBarr, M KING FAHD UNIV PETR & MINERALS COLL COMP SCI & ENGNDEPT COMMUN ENGNDHAHRAN 31261SAUDI ARABIA

In this brief, a divide-and-conquer based RNS (residue number system) decoding algorithm is proposed. The basic idea of this algorithm is to decompose a set of moduli into groups each of size two moduli and to decode a given number in a two moduli representation. The time complexity of the algorithm used is O(log n), where n is the size of the moduli set. There is no assumption made on the elements of the module set. In addition, the algorithm requires less ROM size and smaller size module adders compared to those requried by existing approaches.

关键词： adders computational complexity decoding divide and conquer methods residue number systems RNS decoding ROM size decoding algorithm divide-and-conquer based RNS module adders module set time complexity two moduli representation divide and conquer methods adders residue number systems decoding algorithm algorithms complexity classes decoding

来源：评论

学校读者我要写书评

暂无评论

Novel decoding algorithms for decode-and-forward cooperative beamforming systems

引用

IET COMMUNICATIONS 2014年第17期8卷 3012-3018页

作者： Lee, Kyungchun Seoul Natl Univ Sci & Technol Dept Elect & Informat Engn Convergence Inst Biomed Engn & Biomat Seoul 139743 South Korea

In this study, two novel decoding algorithms for cooperative beamforming (CBF) systems are proposed. In decode-and-forward-based CBF, multiple relay nodes decode the packets transmitted from the source node and forward them to the destination node. However, decoding errors at the relay nodes cause erroneous retransmission of packets, which degrades the signal decoding performance at the destination node. To solve this problem, the optimal decoding strategy is derived;this strategy takes the potential errors in forwarded signals into account in the computation of the likelihood ratio of coded bits. Furthermore, to reduce the required computational complexity, a suboptimal decoding algorithm, which assumes that only one of the multiple relayed signals potentially contains errors in each time slot, is also proposed. In simulation results, it is observed that the proposed decoding algorithms for CBF provide performance improvements in terms of the achievable packet error rates with respect to the conventional schemes.

关键词： array signal processing cooperative communication decode and forward communication network coding packet radio networks relay networks (telecommunication) decoding algorithm decode and forward based CBF system cooperative beamforming relay node transmitted packet decoding source node destination node decoding error packet retransmission packet error rate coded bits likelihood ratio optimal decoding strategy destination node signal decoding performance

来源：评论

学校读者我要写书评

暂无评论

On Blahut's decoding algorithms for two-dimensional BCH codes

引用

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

作者： Madhusudhana, HS Siddiqi, MU Spectrum Infotech Private Ltd Bangalore 560047 Karnataka India Indian Inst Technol Dept Elect Engn Kanpur 208016 Uttar Pradesh India

It is shown that decoding of cyclic codes in the DFT domain is equivalent to an appropriate deconvolution problem. A two-dimensional (2-D) generalization of Blahut's one-dimensional (1-D) linear complexity theorem is obtained and utilized to determine the error-correcting capability of 2-D BCH codes, as afforded by code's defining array of zeros, with regard to correction of burst-errors. The 2-D linear complexity theorem is further utilized to present a new approach for decoding of cyclic codes, in general, and 2-D BCH codes in particular, An alternative exposition of Blahut's decoding algorithms, in the DFT domain, for random and burst error correction in 2-D BCH codes is given from deconvolution viewpoint. Some modifications for efficient implementation of Blahut's decoding algorithms for random and burst error correction are suggested and improved decoding algorithms are presented. It is shown that the improved decoding algorithm requires at most half the number of passes through the Berlekamp-Massey algorithm compared to the Blahut's decoding algorithm, It is shown that Blahut's decoding algorithms have optimal error-correcting capability and improved decoding algorithms have less computational complexity, A comparative study of various time-and spectral-domain implementations of 2-D BCH decoding algorithms is also given.

关键词： Blahut's burst-error decoding algorithm linear complexity quasi-cyclic burst-error 2-D BCH code

来源：评论

学校读者我要写书评

暂无评论

A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第3期51卷 1196-1198页

作者： Fedorenko, SV St Petersburg State Univ Dept Distributed Comp & Networking St Petersburg 194021 Russia

A simple and natural Gao algorithm for decoding algebraic codes is described. Its relation to the Welch-Berlekamp and Euclidean algorithms is given.

关键词： decoding algorithm decoding Reed-Solomon (RS) codes Euclidean algorithm key equation RS codes remainder decoding Welch-Beriekamp algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-checking circuits and decoding algorithms for binary Hamming and BCH codes and Reed-Solomon codes over GF(2^m)

引用

PROBLEMS OF INFORMATION TRANSMISSION 2008年第2期44卷 99-111页

作者： Boyarinov, I. M. RAS Inst Syst Anal Moscow 117901 Russia

We consider problems of detecting errors in combinational circuits and algorithms for the decoding of linear codes. We show that a totally self-checking combinatorial circuit for the decoding of a binary Hamming [n, k] code can be constructed if and only if n = 2(r) - 1, r = n-k. We introduce the notion of a totally self-checking combinational circuit detecting error clusters of size at most mu;for shortened Hamming [n,k] codes, we construct totally self-checking decoding combinational circuits detecting error clusters of size at most mu, 2 <= mu < n-k. We describe single-error protected and self-checking algorithms: the extended Euclidean algorithm and decoding algorithms for binary BCH codes and Reed-Solomon codes over GF(2(m)).

关键词： self-checking Reed-Solomon codes Binary decoding algorithm Combinational circuits algorithms Euclidean algorithm decoding totally self-checking linear codes BCH codes

来源：评论

学校读者我要写书评

暂无评论

Fast Encoding and decoding algorithms for Arbitrary (n, k) Reed-Solomon Codes Over F2m

引用

IEEE COMMUNICATIONS LETTERS 2020年第4期24卷 716-719页

作者： Tang, Nianqi Lin, Yun Huawei Technol Co Ltd Shenzhen 518129 Peoples R China

Recently, a new polynomial basis over finite fields was proposed such that the computational complexity of the fast Fourier transform (FFT) is (O(nlogn) . Based on FFTs, the encoding and decoding algorithms for Reed-Solomon (RS) codes were proposed, which are shown to have the lowest computational complexity in the literature. However, these algorithms require that the code length and the number of parity symbols must be power of two. In this letter, we present the encoding and decoding algorithms for arbitrary RS codes based on FFTs. Furthermore, these new algorithms also reach the best known complexity bound.

关键词： Reed-solomon codes fast fourier transform decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Unified scaling factor approach for turbo decoding algorithms

引用

IET COMMUNICATIONS 2010年第8期4卷 905-914页

作者： Yue, D. -W. Nguyen, H. H. Dalian Maritime Univ Coll Informat Sci & Technol Dalian Peoples R China Univ Saskatchewan Dept Elect & Comp Engn Saskatoon SK S7N 5A9 Canada

Turbo (iterative) decoding can be implemented with a large family of soft- input soft-output (SISO) algorithms, including suboptimal but practical algorithms such as the soft- output Viterbi algorithm (SOVA) and max-log-MAP algorithm. The performance with these practical algorithms can be improved with simple scaling factor methods. However, their theoretical analysis was mainly based on the relaxed assumption proposed by Papke et al. that the extrinsic information is Gaussian distributed. This study proposes a novel scaling factor approach for reducing both the overestimation of reliability values and the correlation between the intrinsic and extrinsic information. Explicit formulae for computing the scaling factors are derived based on mathematical statistics. A key difference compared to the scaling factor method of Papke et al. is that the proposed scaling factors can be computed off-line. The numerical results show that when implemented in the decoding algorithm of block component codes, the proposed scaling factor approach improves the performance of turbo decoding over additive white Gaussian noise and Rayleigh fading channels. It is superior than the method by Papke et al. in both performance and complexity.

关键词： Turbo Raleigh fading channels Scale factor decoding AWGN large family Worm gears decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

List-decoding Gabidulin Codes via Interpolation and the Euclidean algorithm

List-Decoding Gabidulin Codes via Interpolation and the Eucl...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Kuijper, Margreta Trautmann, Anna-Lena Univ Melbourne Dept Elect & Elect Engn Melbourne Vic 3010 Australia Monash Univ Dept Elect & Comp Syst Engn Clayton Vic 3800 Australia

ISBN: (纸本)9784885522925

We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric.

关键词： decoding Encoding Interpolation Measurement Polynomials Vectors Euclidean algorithm decoding Cloning Vectors Codes Interpolation Polynomial decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

In Search of More Robust decoding algorithms for Neural Prostheses, a Data Driven Approach

In Search of More Robust Decoding Algorithms for Neural Pros...

引用

32nd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBC 10)

作者： Subasi, Erk Townsend, Benjamin Scherberger, Hansjorg Univ Zurich Inst Neuroinformat ETH Zurich CH-8057 Zurich Switzerland

ISBN: (纸本)9781424441242

In the past decade the field of neural interface systems has enjoyed an increase in attention from the scientific community and the general public, in part due to the enormous potential that such systems have to increase the quality of life for paralyzed patients. While significant progress has been made, serious challenges remain to be addressed from both biological and engineering perspectives. A key issue is how to optimize the decoding of neural information, such that neural signals are correctly mapped to effectors that interact with the outside world - like robotic hands and limbs or the patient's own muscles. Here we present some recent progress on tackling this problem by applying the latest developments in machine learning. Neural data was collected from macaque monkeys performing a real-time hand grasp decoding task. Signals were recorded via chronically implanted electrodes in the anterior intraparietal cortex (AIP) and ventral premotor cortex (F5), brain areas that are known to be involved in the transformation of visual signals into hand grasping instructions. We present a comparative study of different classical machine learning methods with an application of decoding of hand postures, as well as a new approach for more robust decoding. Results suggests that combining data-driven algorithmic approaches with well-known parametric methods could lead to better performing and more robust learners, which may have direct implications for future clinical devices.

关键词： AIP anterior intraparietal cortex biomedical electrodes brain chronically implanted electrodes data driven approach decoding algorithm effectors hand grasping instructions learning (artificial intelligence) macaque monkeys machine learning medical control systems medical signal processing neural information decoding optimization neural interface systems neural prostheses neural signals neurophysiology prosthetics real time hand grasp decoding task ventral premotor cortex visual signal transformation

来源：评论

学校读者我要写书评

暂无评论

Energy Consumption Analysis of Image Encoding and decoding algorithms 4

Energy Consumption Analysis of Image Encoding and Decoding A...

引用

4th International Workshop on Green and Sustainable Software (GREENS)

作者： Rashid, Mohammad Ardito, Luca Torchiano, Marco Politecn Torino Dept Control & Comp Engn Turin Italy

ISBN: (纸本)9781467370493

Context: energy consumption represents an important issue with limited and embedded devices. Such devices, e.g. smartphones, process many images, both to render the UI and for application specific purposes. Goal: we aim to evaluate the energy consumption of different image encoding/decoding algorithms. Method: we run a series of experiments on a ARM based platform, and we collected the energy consumed in performing typical image encoding and decoding tasks. Result: we found that there is a significant difference among codecs in terms of energy consumption. Most of the energy consumption relates to the computational efficiency of the algorithm (i.e. the time performance) though the type of processing and the algorithm may affect the average power usage up to 37%, thus indirectly affecting the energy consumption. Conclusion: JPEG compression is significantly more energy efficient than PNG both for encoding and decoding. Further studies should focus on the additional features that affect energy consumption beyond computational complexity.

关键词： energy consumption image coding algorithms decoding algorithm energy consumption analysis decoding codecs additional features PPP1R14B gene algorithm efficiency Energy efficiency Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：