The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Error correction codes (ECCs) are commonly used in computer systems to protect information from errors. For example, single error correction (SEC) codes are frequently used for memory protection. Due to continuous technology scaling, soft errors on registers have become a major concern, and ECCs are required to protect them. Nevertheless, using an ECC increases delay, area and power consumption. In...
Flash memories use the amount of charge (e.g., electrons) trapped in floating gate transistors to represent data. Charge leakage will cause data retention problem by unidirectionally shifting the cell-level distribution. Balanced codes are an effective means to adjust read thresholds adaptively and tolerate the charge leakage under unknown retention environments. For multi-level cell (MLC) flash memories...
One serious challenge for flash memories is data reliability. In this work, we present the content-replication codeword problem, and it leads to our proposed joint decoder. We focus on joint decoding algorithms and study their theoretical decoding performances. The proposed scheme is novel for flash memories, and we show their reliability can be enhanced by increasing the diversity of error-correcting...
This contribution presents a data compression scheme for applications in non-volatile flash memories. The objective of the data compression algorithm is to reduce the amount of user data such that the redundancy of the error correction coding can be increased in order to improve the reliability of the data storage system. The data compression is performed on block level considering data blocks of...
Hash functions are widely deployed in many cryptographic applications, such as message integrity checks, digital signatures, message authentication codes (MACs), and many other applications. In fact, hash functions are mainly dedicated to detect tampering and prove of message authenticity. Thus, if the hash digest does not match the sent digest, this indicates modification in the data or in the hash...
Memory is an important part of any digital circuit in which data is stored and retrieved. Technology scaling, lower operating voltages and high integration densities leads for failures in the reliability of memories. The main problem is Single Event Upsets (SEUs) that alters the memories from its normal way of functioning. This paper presents design and implementation of Majority Logic (ML) detecting/decoding...
Proofs of retrievability (POR) are interactive protocols that allow a verifier to check the consistent existence and availability of data residing at a potentially untrusted storage provider, e.g., a cloud. While most POR protocols strictly refer to static files, i.e., content that is read-only, dynamic PORs shall achieve the same security guarantees (existence, consistency and the possibility to...
The scaling down of semiconductor technology in FPGA increases the soft errors due to radiation effects in space. To address this technological challenge a novel coding technique, Counter Matrix Code (CMC) is proposed to protect the SRAM based FPGA's configuration memories (FCM) against radiation induced Multiple Bit Upsets (MBU) with Low cost and maximum correction capability. The proposed CMC is...
This paper proposes an audio watermarking method based on dynamic phase coding and error control coding. The technique of quantization index modulation is employed for embedding watermarks into the phase spectrum of audio signals. Since most of the audio information is distributed in moderately low frequencies, to increase robustness, this frequency region is chosen for embedding watermarks. Phase...
Most cache designs support single or double bit-level error detection and correction in cache lines. However, a single error may distort a whole byte or even more, resulting in much higher decoding complexity than that of bit-level distortions. Thereby this paper proposes a new group testing based error correcting code (GTB code) for byte-level error locating and correcting which provides much stronger...
This paper presents a coding scheme to improve the performance of three-dimensional (3D) audio. The scheme is designed by the idea of joint source channel coding (JSCC) and is implemented by Expanding Window Fountain (EWF) codes for the 3D audio bitstreams after source coding of spatial squeeze surround audio coding (S3AC). EWF is one of unequal error protection (UEP) LT codes and the proposed scheme...
The energy used to transmit a single bit of data between the devices in sensor networks is equal to the energy for performing hundreds of instructions in those devices. Thus the reduction of the data necessary to transmit, while keeping the same functionality of the employed algorithms is a formidable and challenging scientific task. We describe an algorithm called Small Set of Allowed Coefficients...
In this paper, we highlight the class of spatially coupled codes and discuss their applicability to long-haul and submarine optical communication systems. We first demonstrate how to optimize irregular spatially coupled LDPC codes for their use in optical communications with limited decoding hardware complexity and then present simulation results with an FPGA-based decoder where we show that very...
Increase in design complication for current and future era of microelectronics technologies and mechanisms used for data transmission leads to an increased sensitivity to bit-flip errors. As we know, multiple cores are built in a single system on chip (SoC) and to test that SoC, test vectors are transferred from automatic test equipment (ATE) via serial communication link. Now if there is a defect...
In 3D-HEVC, single depth intra mode has been applied and has been integrated into depth intra skip mode for efficient depth map coding. With single depth intra mode, one 2N×2N prediction unit (PU) is predicted without high computational prediction process. In this paper, we propose a fast single depth intra mode decision method to address the problem of high computational complexity burden in depth...
Research works exploring coding for Flash memories typically seek to correct errors taking place during normal device operation. In this paper, we study the design of codes that protect Flash devices dealing with the unusual class of errors caused by exposure to large radiation dosages. Significant radiation exposure can take place, for example, when Flash is used as on-board memory in satellites...
This paper constructs WOM codes that combine rewriting and error correction for mitigating the reliability and the endurance problems in flash memory.We consider a rewriting model that is of practical interest to flash applications where only the second write uses WOM codes. Our WOM code construction is based on binary erasure quantization with LDGM codes, where the rewriting uses message passing...
A very simple coding scheme, called multi-user repetition-aided irregular repeat-accumulate (IRA) code, is proposed to approach the multiple-access channel (MAC) capacity. The main idea is that not only parity checks, which are generated by an IRA encoder, but also repetitions are used in each user's codeword to reduce the coding and decoding complexities. Repetition is a simple way to construct a...
Consider the problem of reliable multicast over a network in the presence of adversarial errors. In contrast to traditional network error correction codes designed for a given network capacity and a given number of errors, we study an arguably more realistic setting that prior knowledge on the network and adversary parameters is not available. For this setting we propose efficient and throughput-optimal...
We present a constraint-coding scheme to correct large numbers of asymmetric magnitude-1 errors in multi-level non-volatile memories. The scheme is shown to deliver better correction capability compared to known alternatives, while admitting low-complexity of decoding. Our results include an algebraic formulation of the constraint, necessary and sufficient conditions for correctability, a maximum-likelihood...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.