Dominant Error Patterns Research Articles

Towards specialized language support: An elaborated framework for Error Analysis

The global rise in academic scholarship and pressure to publish in high-impact English-medium journals has led to an increased focus on multilingual scholars and the obstacles they face when communicating across academic and professional domains. Although preparing research for scholarly publication is challenging for most academics, multilingual scholars face the added demands of communicating their work in a foreign language. As one of the largest producers of scientific publications worldwide, Japanese scientists wrestle daily with these challenges and typically employ proofreading as a common coping strategy. Motivated by years of supporting Japanese scientists through the proofreading process, this study employs an Error Analysis (EA) framework, elaborated with the functional descriptions of Systemic Functional Linguistics (SFL), to investigate error patterns in research article manuscripts written by thirteen Japanese materials scientists. Results highlight the difficulties that the nominal group constitutes for participants, with almost half (47.81%) of the identified errors occurring within complex nominal groups. Further, the analysis reveals the most dominant error pattern involves errors with articles and plural -s. Findings from the study inform the design of a pedagogical tool to assist Japanese materials scientists and language specialists alike in identifying and rectifying these errors.

Quasi-Primitive Block-Wise Concatenated BCH Codes With Collaborative Decoding for NAND Flash Memories

In this work, we propose a novel design rule of block-wise concatenated Bose-Chaudhuri-Hocquenghem (BC-BCH) codes for storage devices using multi-level per cell (MLC) NAND flash memories. BC-BCH codes designed in accordance with the proposed design rule are called quasi-primitive BC-BCH codes in which constituent BCH codes are deliberately chosen for their lengths to be as close to primitive BCH codes as possible. It will be shown that such quasi-primitive BC-BCH codes can achieve significant improvements of error-correcting capability over the existing BC-BCH codes when an iterative hard-decision based decoding (IHDD) is assumed. In addition, we propose a novel collaborative decoding algorithm which targets at resolving dominant error patterns associated with the IHDD. Error-rate performances of error-control systems with the proposed quasi-primitive BC-BCH and existing BC-BCH codes are compared. For more comprehensive performance comparisons, systems with a hypothetically long BCH code and a product code are also considered in the comparisons.

Error-Pattern-Correcting Cyclic Codes Tailored to a Prescribed Set of Error Cluster Patterns

A new class of cyclic codes is discussed which is highly tailored to a prescribed set of dominant error cluster patterns. The cyclic code construction is based on a generator polynomial that produces a distinct syndrome set for each error pattern in the target set. By tailoring the generator polynomial specifically to the set of dominant error patterns, the code becomes highly effective in handling single and multiple occurrences of dominant error patterns at a very high code rate. A list decoding strategy based on a set of test word-error events is developed for the proposed codes, which efficiently utilizes both the algebraic information from the captured syndrome and the reliability measures provided by the local correlators matched to the dominant error patterns. By forcing a decoder to correct a single-pattern event for each test input word, multiple decoders running in parallel on the list of test words can effectively correct multiple error-pattern occurrences within the channel detector output word.

Iterative Decoding Based on Error Pattern Correction

The error-pattern correction code is a code specialized to correct dominant error patterns observed at the channel detector output in heavy intersymbol interference channels. In this paper, we consider a turbo-equalizer system that utilizes the error-pattern correcting code (EPCC) as a building component. A soft-input soft-output (SISO) decoder for the EPCC is described, and the performance of the proposed turbo equalizer is compared with those of the conventional turbo equalizer and a low density parity check (LDPC) code system.

High-Rate Error-Correction Codes Targeting Dominant Error Patterns

We propose a high-rate error-pattern-correcting code constructed by a generator polynomial targeting a set of known dominant error patterns. This code is based on first constructing a low-rate cyclic code that possesses a distinct syndrome set for each target error pattern. This base code is then extended by simply applying the same generator polynomial to a larger message block. It is shown that the captured syndrome along with a soft metric can be used to correct a single occurrence of any target error pattern within the codeword with high probability. The proposed scheme outperforms, by a significant margin, conventional post-Viterbi error correction based on high-rate error-detection coding. The performance comparison is provided for a high-density perpendicular recording model

Signal Quality Evaluation Method for Over-30-GB Blu-ray Discs

We proposed a new signal quality evaluation method applying a sequenced amplitude margin (SAM) for over 30-GB Blu-ray discs (BDs), where the dominant error pattern differs from lower-density discs (23–27-GB BDs), and conventional signal quality evaluation method such as maximum-likelihood sequence error (MLSE) lose accuracy. We experimentally confirmed the effectiveness of our new method for 30–31.5-GB BDs.

Asymptotic performance comparison of concatenated (turbo) codes over GF(4)

AbstractIn this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over GF(4) over additive white Gaussian noise (AWGN) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non‐binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form k0/(k0 + 1) for k0=1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight‐two and weight‐three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns. Copyright © 2004 John Wiley & Sons, Ltd.