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

On the Voronoi neighbor ratio for binary linear block codes

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第7期44卷 3064-3072页

作者： Agrell, E Chalmers Univ Technol Dept Informat Theory S-41296 Gothenburg Sweden

Soft-decision decoding of block codes is regarded as the geometrical problem of identifying the Voronoi region within which a given input vector lies. A measure, called the neighbor ratio, is proposed to characterize how many facets a Voronoi region has. Theory and algorithms are presented to determine the neighbor ratio for binary linear block codes and results are given far several types of codes. An asymptotic analysis for long codes reveals that the neighbor ratio depends on whether the code rate is less than 1/2 or not. For rates below this threshold, all pairs of codewords tend to share a Voronoi facet;for higher rates, a relatively small fraction of them do.

关键词： asymptotic properties binary linear block codes Gaussian channel neighbor ratio soft-decision decoding Voronoi regions

来源：评论

学校读者我要写书评

暂无评论

A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1996年第6期42卷 1987-1991页

作者： Shen, BZ Tzeng, KK Wang, C LEHIGH UNIV DEPT ELECT ENGN & COMP SCI BETHLEHEM PA 18015 USA

A new bounded-distance (BD) decoding algorithm is presented for binary linear (n, k, d) block codes on additive white Gaussian noise channels, The algorithm is based on the generalized minimum distance (GMD) decoding algorithm of Forney using the acceptance criterion of Taipale and Pursley (GMD/TP), It is shown that the GMD/TP decoding algorithm is a BD decoding algorithm with effective error coefficient [GRAPHICS] It is also shown that the decision regions of GMD/TP are good inner approximations of those of full GMD decoding, and therefore full GMD decoding is BD and has an effective error coefficient that is well approximated by [GRAPHICS] Moreover, by adding a d-erasure-correction step to GMD decoding, the effective error coefficient can be reduced to A(d), the number of minimum-weight codewords, which is the same as the effective error coefficient of maximum-likelihood decoding, The decoding algorithm is mainly based on algebraic errors-and-erasures decoding and therefore has polynomial rather than exponential complexity.

关键词： bounded-distance decoding generalized minimum-distance decoding errors-and-erasures decoding effective error coefficient binary linear block codes decoding complexity

来源：评论

学校读者我要写书评

暂无评论

ML Soft-decision Decoding for binary linear block codes Based on Trellises of Their Supercodes 29

ML Soft-decision Decoding for Binary Linear Block Codes Base...

引用

29th International Conference on Computer Communications and Networks (ICCCN)

作者： Wu, Ting-Yi Hau, Yunghsiang S. Huawei Technol Co Ltd Labs 2012 CRI Theory Lab Shenzhen Peoples R China Dongguan Univ Technol Dongguan Peoples R China

ISBN: (数字)9781728166070

ISBN: (纸本)9781728166070

Based on the notion of supercodes, we propose a two-phase maximum-likelihood (ML) soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the priority-first search algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the priority-first search algorithm to the trellis corresponding to the linear block code itself, which guarantees to find the ML decision with a constant complexity per information bit at high signal-tonoise ratios (SNRs). Simulations on the extended BCH code of n = 64 and k = 24 show that the proposed two-phase scheme is an order of magnitude more efficient in average decoding complexity than the recursive ML decoding [1] when the SNR per information bit is 8 dB.

关键词： Soft decision decoding maximum likelihood decoding binary linear block codes supercodes

来源：评论

学校读者我要写书评

暂无评论

The construction of periodically time-variant convolutional codes using binary linear block codes

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 2007年第9期90卷 31-40页

作者： Ogasahara, Naonori Kobayashi, Manabu Hirasawa, Shigeichi Toshiba Co Ltd Kawasaki Kanagawa 2128582 Japan Shonan Inst Technol Dept Informat Sci Fujisawa Kanagawa 2518511 Japan Waseda Univ Sch Sci & Engn Tokyo 1698555 Japan

In 1996 Rosenthal and York proposed (time-invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit. In this paper we propose a periodically time-variant convolutional code that can be constructed not only using the BCH parity check matrix but using the check matrix of any binary linear block code and show that the lower bound on the minimum free distance is guaranteed by the minimum free distance of the binary linear block code. In addition, taking 12 binary linear block codes as examples, we perform comparisons of the proposed codes with BCH convolutional codes using three evaluation criteria (minimum free distance, number of delay elements, coding rate) and show that there exist proposed codes that are superior to existing ones. (C) 2007 Wiley Periodicals, Inc. Electron Comin Jpn Pt 3, 90(9):31-40,2007;Published online in Wiley InterScience (***. ***).

关键词： BCH convolutional codes binary linear block codes periodically time-variant convolutional codes minimality condition

来源：评论

学校读者我要写书评

暂无评论

Estimates of the bit error probabilities for linear block codes and symmetric binary-input memoryless channels

Estimates of the bit error probabilities for linear block co...

引用

IEEE Information Theory Workshop

作者： Balakirsky, VB Tech Univ Eindhoven EIDMA NL-5600 MB Eindhoven Netherlands

ISBN: (纸本)0780376293

A coset representation of the bit error probabilities for binary linear block codes and arbitrary symmetric memoryless channels is derived. Such a representation leads to simple upper bounds on the bit error probabilities for code components expressed via 2n code spectra, where n is the code length, and to a "bounded distance decoding" algorithm. The performance of the algorithm is illustrated for the (23,12) Golay code and a particular channel having non-binary output alphabet where it attains a sub-optimum performance.

关键词： linear codes block codes binary codes error statistics decoding Golay codes channel coding memoryless systems coset representation bit error probabilities binary linear block codes upper bounds bounded distance decoding algorithm Golay c Golay codes bit error probability block codes memoryless systems linear block code binary code linear codes Upper bound Channel coding Memoryless channel DECODING code length

来源：评论

学校读者我要写书评

暂无评论

Determination of best shortened linear codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1996年第1期44卷 1-6页

作者： Funk, G ABB Network Control Turgi Switzerland

The quality of a block code is determined by its capability to protect data against undetectable errors and by the number of check bits that are required for that purpose, For a given number of check bits there are codes with optimum bit error detecting capability in shortened block lengths, These codes are determined and tabulated, Residual error characteristics of some of the tabulated codes are compared with those specified in ISO/CCITT or IEC standard data transmission protocols, For block lengths and bit error rates that are typical in process control applications, the residual error rate of the determined codes is more than six orders of magnitude smaller than that of codes specified by widely used standard transmission protocols.

关键词： binary linear block codes maximum distance codes BCH codes shortened codes

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTION TECHNIQUES FOR SYSTEMATIC SEC-DED codes WITH SINGLE BYTE ERROR-DETECTION AND PARTIAL CORRECTION CAPABILITY FOR COMPUTER MEMORY-SYSTEMS

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1995年第2期41卷 584-591页

作者： PENZO, L SCIUTO, D SILVANO, C BULL HN INFORMAT SYST ITALIA DEPT TECHNOL & HARDWARE METHODOLI-20010 PREGNANAITALY

This correspondence proposes three new techniques to construct a class of codes that extends the protection provided by previous single error correcting (SEC)-double error detecting (DED)-single byte error detecting (SBD) codes. The proposed codes are systematic odd-weight-column SEC-DED-SBD codes providing also the correction of any odd number of erroneous bits per byte, where a byte represents a cluster of b bits of the codeword that are fed by the same memory chip or card. These codes are useful for practical applications to enhance the reliability and the data integrity of byte-organized computer memory systems against transient, intermittent, and permanent failures. In particular, they represent a good tradeoff between the overhead in terms of additional check bits and the reliability improvement, due to the capability to correct at least 50% of the multiple errors per byte.

关键词： binary linear block codes BYTE ERRORS COMPUTER MEMORY SYSTEMS ERROR CONTROL codes MEMORY RELIABILITY SEC-DED-SBD codes

来源：评论

学校读者我要写书评

暂无评论

Soft-decision decoding of linear block codes using preprocessing and diversification

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第1期53卷 378-393页

作者： Wu, Yingquan Hadjicostis, Christoforos N. Link A Media Devices Corp Santa Clara CA 95051 USA Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

Order-w reprocessing is a suboptimal soft-decision decoding approach for binary linear block codes in which up to w bits are systematically flipped on the so-called most reliable (information) basis (MRB). This correspondence first incorporates two preprocessing rules into order-w reprocessing and shows that, with appropriate choice of parameters, the proposed order-w reprocessing with preprocessing requires comparable complexity to order-w reprocessing but achieves asymptotically the performance of order-(w + 2) reprocessing. To complement the MRB, a second basis is employed for practical SNRs and this approach is systematically extended to a multibasis order-w reprocessing scheme for high signal-to-noise ratios (SNRs). It is shown that the proposed multibasis scheme significantly enlarges the error-correction radius, a commonly used measure of performance at high SNRs, over the original (single-basis) order-to reprocessing. As a by-product, this approach also precisely characterizes the asymptotic performance of the well-known Chase and generalized minimum distance (GMD) decoding algorithms. The proposed algorithm successfully decodes the (192, 96) Reed-Solomon concatenated code and the (256, 147) extended BCH code in near optimal manner (within 0.01 dB at a block-error rate of 10(-5)) with affordable computational cost.

关键词： asymptotic performance binary linear block codes most reliable basis multibasis preprocessing soft-decision decoding

来源：评论

学校读者我要写书评

暂无评论

Limited-trial chase-like algorithms achieving bounded-distance decoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2004年第12期50卷 3318-3323页

作者： Weber, JH Fossorier, MPC Delft Univ Technol NL-2628 CD Delft Netherlands Univ Hawaii Manoa Honolulu HI 96822 USA

A soft-decision decoder for an error-correcting block code of Hamming distance d is said to achieve bounded-distance (BD) decoding if its error-correction radius is equal to that of a complete Euclidean distance decoder. The Chase decoding algorithms are reliability-based algorithms achieving BD decoding. The least complex version of the original Chase algorithms ("Chase-3") uses O(d) trials of a conventional binary decoder. In this correspondence, we propose classes of Chase-like BD decoding algorithms of lower complexity than the original Chase-3 algorithm. In particular, the least complex members of these classes require only O(d(2/3)) trials.

关键词： asymptotic optimality binary linear block codes bounded-distance (BD) decoding multitrial decoding reliability information soft-decision decoding

来源：评论

学校读者我要写书评

暂无评论

Soft-decision decoding using ordered recodings on the most reliable basis

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第2期53卷 829-836页

作者： Wu, Yingquan Hadjicostis, Christoforos N. Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

This correspondence investigates soft-decision decoding of binary linear block codes using ordered recodings of test error patterns on the so-called "most reliable basis." The analysis demonstrates the optimality of the most reliable basis by showing that, among all possible bases, the most reliable basis minimizes the list error probability for it very general (and well-defined) class of orderings for recoding operations. The correspondence then proposes a suboptimal algorithm which utilizes reprocessing ordering and incorporates two techniques that render it computationally very efficient: 1) an iterative reference recoding technique which simplifies the recoiling operation required for each test error pattern, and 2) an adaptive skipping rule which significantly reduces the average number of recodings. Simulation results with codes of relatively large length show that the proposed algorithm is computationally very efficient in comparison to existing algorithms in the literature.

关键词： binary linear block codes maximum-likelihood (ML) decoding most reliable basis ordered reprocessing soft-decision decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：