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

recursive decoding and its performance for low-rate Reed-Muller codes

IEEE TRANSACTIONS ON INFORMATION THEORY 2004年第5期50卷 811-823页

作者： Dumer, I Univ Calif Riverside Coll Engn Riverside CA 92521 USA

recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixed order r. An algorithm is designed that has complexity of order n log n and corrects most error patterns of weight up to n(1/2 - epsilon) given that E exceeds n(-1/2r) This improves the asymptotic bounds known for decoding RM codes with nonexponential complexity. To evaluate decoding capability, we develop a probabilistic technique that disintegrates decoding into a sequence of recursive steps. Although dependent, subsequent outputs can be tightly evaluated under the assumption that all preceding decodings are correct. In turn, this allows us to employ second-order analysis and find the error weights for which the decoding error probability vanishes on the entire sequence of decoding steps as the code length n grows.

关键词： decoding threshold Plotkin construction recursive decoding Reed-Muller (RM) codes

来源：评论

学校读者我要写书评

暂无评论

Error exponents for recursive decoding of Reed-Muller codes on a binary-symmetric channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第11期52卷 4880-4891页

作者： Burnashev, Marat Dumer, Ilya Russian Acad Sci Inst Informat Transmiss Problems Moscow 101447 Russia Univ Calif Riverside Coll Engn Riverside CA 92521 USA

Error exponents are studied for recursive decoding of Reed-Muller (RM) codes and their subcodes used on a binary-symmetric channel. The decoding process is first decomposed into similar steps, with one new information bit derived in each step. Multiple recursive additions and multiplications of the randomly corrupted channel outputs 1 are performed using a specific order of these two operations in each step. Recalculated random outputs are compared in terms of their exponential moments. As a result, tight analytical bounds are obtained for decoding error probability of the two recursive algorithms considered in the paper. For both algorithms, the derived error exponents almost coincide with simulation results. Comparison of these bounds with similar bounds for bounded distance decoding and majority decoding shows that recursive decoding can reduce the output error probability of the latter two algorithms by five or more orders of magnitude even on the short block length of 256. It is also proven that the error probability of recursive decoding can be exponentially reduced by eliminating one or a few information bits from the original RM code.

关键词： binary-symmetric channel Chernoff bound Plotkin construction recursive decoding Reed-Muller (RM) codes

来源：评论

学校读者我要写书评

暂无评论

A Soft-Decision recursive decoding Algorithm Using Iterative Bounded-Distance decoding for u|u plus v Codes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2014年第4期E97A卷 996-1000页

作者： Tokushige, Hitoshi Kumamoto Gakuen Univ Kumamoto 8628680 Japan

A soft-decision recursive decoding algorithm (RDA) for the class of the binary linear block codes recursively generated using a u vertical bar u + v-construction method is proposed. It is well known that Reed-Muller (RM) codes are in this class. A code in this class can be decomposed into left and right components. At a recursive level of the RDA, if the component is decomposable, the RDA is performed for the left component and then for the cosets generated from the left decoding result and the right component. The result of this level is obtained by concatenating the left and right decoding results. If the component is indecomposable, a proposed iterative bounded-distance decoding algorithm is performed. Computer simulations were made to evaluate the RDA for RM codes over an additive white Gaussian-noise channel using binary phase-shift keying modulation. The results show that the block error rates of the RDA are relatively close to those of the maximum-likelihood decoding for the third-order RM code of length 2(6) and better than those of the Chase II decoding for the third-order RM codes of length 2(6) and 2(7). and the fourth-order RM code of length 2(8).

关键词： recursive decoding iterative decoding bounded-distance decoding u vertical bar u plus v-construction Reed-Muller code

来源：评论

学校读者我要写书评

暂无评论

Semi-Exhaustive Reduced-Complexity recursive Block decoding for MIMO Systems 23

Semi-Exhaustive Reduced-Complexity Recursive Block Decoding ...

引用

23rd International Conference on Telecommunications (ICT)

作者： Khsiba, Mohamed-Achraf Rekaya-Ben Othman, Ghaya Telecom ParisTech 46 Rue Barrault F-75013 Paris France

ISBN: (纸本)9781509019908

In this work we propose a new recursive block decoding method for MIMO systems. A complexity reduction is obtained compared to existing methods by avoiding the exhaustive decoding on one block. We propose the use of a semi-exhaustive search using a list composed of the Maximum Likelihood (ML) solution and its neighborhoods. We show through error probability derivation that we can achieve the full diversity by fixing a judicious choice of the list size or equivalently a threshold metric. A desired diversity order can be obtained by changing the list size. Simulation results show the obtained performances and the complexity gain.

关键词： MIMO systems recursive decoding Block decoding Diversity order Reduced complexity

来源：评论

学校读者我要写书评

暂无评论

Soft-decision decoding of Reed-Muller codes: A simplified algorithm

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第3期52卷 954-963页

作者： Dumer, I Univ Calif Riverside Coll Engn Riverside CA 92521 USA

Soft-decision decoding is considered for general Reed-Muller (RM) codes of length n and distance d used over a memoryless channel. A recursive decoding algorithm is designed and its decoding threshold is derived for long RM codes. The algorithm has complexity of order n In n and corrects most error patterns of the Euclidean weight of order root n/ln n, instead of the decoding threshold root d/2 of the bounded distance decoding. Also, for long RM codes of fixed rate R, the new algorithm increases 4/pi times the decoding threshold of its hard-decision counterpart.

关键词： decoding threshold memoryless channel Plotkin construction recursive decoding Reed-Muller (RM) codes

来源：评论

学校读者我要写书评

暂无评论

Error Exponents for Two Soft-Decision decoding Algorithms of Reed-Muller Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第9期55卷 4108-4118页

作者： Burnashev, Marat V. Dumer, Ilya Russian Acad Sci Inst Informat Transmiss Problems Moscow 101447 Russia Univ Calif Riverside Coll Engn Riverside CA 92521 USA

Error exponents are studied for recursive and majority decoding of general Reed-Muller (RM) codes RM(r, m) used on the additive white Gaussian noise (AWGN) channels. Both algorithms have low complexity and correct many error patterns whose weight exceeds half the code distance. decoding consists of multiple consecutive steps, which repeatedly recalculate the input symbols and determine different information symbols using soft-decision majority voting. For any code RM(r, m), we estimate the probabilities of the information symbols obtained in these recalculations and derive the analytical upper bounds for the block error rates of the recursive and majority decoding. In the case of a low noise, we also obtain the lower bounds and show that the upper bounds are tight. For a higher noise, these bounds closely approach our simulation results.

关键词： Chernoff bound Gaussian channel majority decoding recursive decoding Reed-Muller (RM) codes

来源：评论

学校读者我要写书评

暂无评论

Acquisition of m-sequences using recursive soft sequential estimation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2004年第2期52卷 199-204页

作者： Yang, LL Hanzo, L Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England

A novel sequential estimation method is proposed for the initial synchronization of pseudonoise (PN) signals derived from m-sequences. This sequential estimation method is designed based on the principle of recursive soft-in/soft-out (SISO) decoding, and we refer to it as the recursive soft sequential estimation (RSSE) acquisition scheme. The RSSE acquisition scheme exhibits a complexity similar to that of a conventional m-sequence generator, which increases only linearly with the number of stages in the m-sequence generator. Our simulation results also show that the acquisition time of the proposed RSSE acquisition scheme is also linearly dependent on the number of stages in the m-sequence generator. Owing to the above properties, the employment of the proposed RSSE acquisition scheme is beneficial for the acquisition of long m-sequences.

关键词： acquisition initial synchronization maximum-likelihood (ML) estimation m-sequence pseudonoise (PN) signals recursive decoding sequential estimation soft-in/soft-out (SISO) decoding spread-spectrum signals

来源：评论

学校读者我要写书评

暂无评论

recursive error correction for general Reed-Muller codes

引用

DISCRETE APPLIED MATHEMATICS 2006年第2期154卷 253-269页

作者： Dumer, I Shabunov, K Univ Calif Riverside Coll Engn Riverside CA 92521 USA

Reed-Muller (RM) codes of growing length n and distance d are considered over a binary symmetric channel. A recursive decoding algorithm is designed that has complexity of order n log n and Corrects most error patterns of weight (d In d)/2. The presented algorithm outperforms other algorithms with nonexponential decoding complexity, which are known for RM codes. We evaluate code performance using a new probabilistic technique that disintegrates decoding into a sequence of recursive steps. This allows us to define the most error-prone information symbols and find the highest transition error probability p, which yields a vanishing output error probability on long codes. (c) 2005 Elsevier B.V. All rights reserved.

关键词： recursive decoding decoding threshold plotkin construction Reed-Muller codes

来源：评论

学校读者我要写书评

暂无评论

recursive error correction for general Reed-Muller codes

Recursive error correction for general Reed-Muller codes

引用

International Workshop on Coding and Cryptography (WCC 2003)

作者： Dumer, I Shabunov, K Univ Calif Riverside Coll Engn Riverside CA 92521 USA

关键词： recursive decoding decoding threshold plotkin construction Reed-Muller codes

来源：评论

学校读者我要写书评

暂无评论

Extended recursive Soft Sequential Estimation of m-sequences 9

Extended Recursive Soft Sequential Estimation of m-sequences

引用

9th International Conference of Information and Communiation Technologies (AICT)

作者： Balanov, Michael Prozorov, Dmitriy MIREA Dept Radio Commun Syst Moscow Russia Vyatka State Univ Dept Elect Facil Kirov Russia

ISBN: (纸本)9781467368551

A new type of recursive soft sequential estimation (RSSE) algorithm is presented. The algorithm can be used for fast initial synchronization of pseudonoise (PN) signals based on m-sequences. The key feature of the algorithm is the grouping of binary symbols and the reception of the group as a whole symbol. Different numbers of binary symbols in the group lead to different estimation algorithms in a noisy environment. We showed the equivalence of a full parallel search algorithm and the proposed one when the number of binary symbols in the group is equal to the length of shift register in m-sequence generator. The complexity of the algorithm does not depend on the length of shift register and exponentially grows with the number of binary symbols in the group. Bearing in mind the above remarks the proposed RSSE algorithm is suitable for initial synchronization of long m-sequences. The simulation showed that the acquisition time becomes shorter when the size of the group is larger.

关键词： Acquisition initial synchronization maximum-likelihood (ML) estimation m-sequence pseudonoise (PN) signals recursive decoding sequential estimation full parallel search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：