Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper presents a (274,256,2) DEC BCH decoder for NOR flash memories to improve the reliability. From the step-by-step algorithm, the decoding mechanism can be derived from a simple checking equation and its fully-parallel architecture is implemented to meet the low latency requirement. Moreover, the composite field arithmetic without extra field conversion hardware is applied to the whole decoder...
The present paper proposes an early stopping method for iterative turbo decoding. Many criterions were proposed to date, motivated by a variety of reasons, such as increasing average decoding throughput or reducing average decoder power consumption. The method is devised on observing the behavior of LLR (Log-Likelihood Ratio). Simulation results in comparing the proposed method with some normalization...
Due to the use of commodity software and hardware, crash-stop and Byzantine failures are likely to be more prevalent in today's large-scale distributed storage systems. Regenerating codes have been shown to be a more efficient way to disperse information across multiple nodes and recover crash-stop failures in the literature. In this paper, we present the design of regeneration codes in conjunction...
A double error correcting (DEC) BCH codec is designed for NOR flash memory systems to improve reliability. Due to the latency constraint less than 10 ns, the fully parallel architecture with huge hardware cost is utilized to process both the encoding and decoding scheme within one clock cycle. Notice that encoder and decoder will not be activated simultaneously in NOR flash applications, so we combine...
LDPC codes are among the few FEC schemes that have been used for distributed data compression schemes, like the Slepian-Wolf encoding. An LDPC code having good degree distribution polynomials, along with a large girth and large minimum distance, can compress close to the Slepian-Wolf limit. In this paper, we describe a method to choose good degree distribution polynomials and the corresponding code...
An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs...
Biometrics, such as irises and fingerprints, enable secure and non-repudiable authentication. Fuzzy vault is a scheme that can monolithically bind secret to biometric templates. Moreover, the modified fuzzy vault (MFV) leads to less entropy loss and requires less memory for storing the sketches. This paper proposes a novel low-complexity scheme to compute the monic polynomial for the sketch during...
In recent years permutation codes have emerged as a field of great interest with new applications being suggested. In this paper we investigate two distance metrics and their induced weight functions on subgroups of the symmetric group, Sn, of permutations on n elements. Specifically, we introduce the Euclidean weight and compare its weight distribution to that of the Kendall tau weight. Our primary...
This paper considers the problem of source coding for computing functions of correlated i.i.d. random sources. The approach of combining standard and linear random coding for this problem was first introduced by Ahlswede and Han, in the special case of computing the modulo-two sum. In this paper, making use of an adapted version of that method, we generalize their result to more sophisticated scenarios,...
We consider two methods that construct high rate punctured convolutional codes. First, we present best high rate R = (n−1)/n punctured convolutional codes, for n = 5,6, · · ·, 16, which are found by exhaustive searches. To obtain the best code, we use a regular convolutional code whose weight spectrum is equivalent to that of each punctured convolutional code. We search these regular equivalent codes...
This paper deals with cyclic-redundancy-check (CRC) bits stored in the memory of tags of electronic product code (EPC) class-1 generation-2 UHF radio-frequency identification (RFID) systems. It is shown that tag memory bits transmitted via backscattering to a reader have two levels of error protection. The structure and properties of the underlying binary linear unequal-error-protection (UEP) (128,112,4)...
For cyclic codes we proposed a lower bound of minimum distance by discrete Fourier transform (DFT). In this paper, we will show the procedure for construction of the independent set, give the designed minimum distance of binary cyclic codes of odd lengths from 69 to 99 using the proposed lower bound.
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by multidimensional DFT and linear recurrence relations from Grobner basis and is applied to erasure-and-error decoding and systematic encoding. The computational complexity...
Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions which have multiple poles and/or zeros on their defining curves. Thus, they are more general than one-point codes which are an important class of algebraic codes. In this paper, we give several improved codes of multipoint codes derived from Hermitian curves by using an improving method introduced by Feng...
Algebraic error correcting codes (ECC) are widely used to implement reliability features in modern servers and systems and pose a formidable verification challenge. We present a novel methodology and techniques for provably correct design of ECC logics. The methodology is comprised of a design specification method that directly exposes the ECC algorithm's underlying math to a verification layer, encapsulated...
The work presented in this paper focuses on an efficient erasure-only decoding algorithm for Generalized Reed-Solomon (in short, GRS) codes. The underlying principle of previous decoding algorithms for GRS is first to recover the codewords and further to obtain the original messages. Greatly different from the previous solutions, our novel algorithm, referred to as Direct Erasure-only Decoding, can...
Forward error correction (FEC) is an effective means of reliable communications in wireless networks. Among all error-correcting codes, the recently developed fountain codes are known for their low complexity and rateless features. In the literature, fountain codes are mostly adopted in point-to-point communications. In this paper, we will investigate decomposed fountain codes for distributed dual-hop...
Abstract-This paper presents an extremely compact, highly efficient hardware implementation of the Reed Solomon (RS) decoder. Such efficiency is of critical importance for the next generation of passive optical networks featuring bit rates of 10 Gb/s, high bit error rates and high cost sensitivity. RS codes are widely used for error correction in optical communication networks. The central element...
In modern communication systems, high-speed and high-reliability is the two most important yardsticks. but digital code may be distorted during the transmission, so we should and must encoding some redundant bits to assure the received code correct to enhance the reliability of the communication systems. This thesis is to expound the encoding and decoding theory of CRC and design it by VHDL language...
SMS has a variety of advantages and disadvantages for M-Commerce purpose. The advantages are it is easy to use, a common messaging tool among consumers, works across all wireless operators, affordable for mobile users, no specific software required for installation, allows banks and financial institutions to provide real-time information to consumers and employees and stored messages can be accessed...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.