Implementation of XMATCHPRO Merge Algorithm for Lossless Compression

Implementation of XMATCHPRO Merge Algorithm for Lossless Compression
Authors:MATTA ANITHA YADAV, SRI SANKAR RAO

Abstract: In this paper we propose use of product code based schemes to support higher error correction capability. The aim of the work to effectively implement the XMATCHPRO merge algorithm for application related to the product code and data compression. Specifically, we propose product codes which use Reed-Solomon (RS) codes along rows and Hamming codes along columns and have reduced hardware overhead. It is also propose a flexible product code based ECC scheme that migrates to a stronger ECC scheme when the numbers of errors due to increased program/erase cycles increases. While these schemes have slightly larger latency and require additional parity bit storage, they provide an easy mechanism to increase the lifetime of the Flash memory devices. 

Keywords: Error Correction Code, Data Compression.

 INTRODUCTION 

        The first semiconductor chips held one transistor each. Subsequent advances added more and more transistors, and, as a consequence, more individual functions or systems were integrated over time. The first integrated circuits held only a few devices, perhaps as many as ten diodes, transistors, resistors and capacitors, making it possible to fabricate one or more logic gates on a single device. Now known retrospectively as "small-scale integration" (SSI), improvements in technique led to devices with hundreds of logic gates, known as large-scale integration (LSI), i.e. systems with at least a thousand logic gates. Current technology has moved far past this mark and today's microprocessors have many millions of gates and hundreds of millions of individual transistors. At one time, there was an effort to name and calibrate various levels of large-scale integration above VLSI. Terms like Ultra-large-scale Integration (ULSI) were used. But the huge number of gates and transistors available on common devices has rendered such fine distinctions moot.  

                                                                           Read More...