Fault Tolerant Parallel Filters Based on Error Correction Code
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2016, Vol 4, Issue 11
Abstract
Digital filters are widely used in signal processing and communication systems. In some cases, the reliability of those systems is critical, and fault tolerant filter implementations are needed. Next many techniques that exploit the filters’ structure and properties to achieve fault tolerance have been proposed. As technology scales, it enables more complex systems that incorporate many filters. In those complex systems, it is common that some of the filters operate in parallel, for example, by applying the same filter to different input signals. Recently, a simple technique that exploits the presence of parallel filters to achieve fault tolerance has been presented. In this brief, that idea is generalized to show that parallel filters can be protected using error correction codes (ECCs) in which each filter is the equivalent of a bit in a traditional ECC This new scheme allows more efficient protection when the number of parallel filters is large. The proposed scheme coded in VHDL in Xilinx 12.2 and simulated using Modelsim10.1 and implemented on altera Cyclone IV FPGA.
Authors and Affiliations
Akshaya Kattimani, Vivekanand M Bonal
Effect of Invitro Zinc (II) supplementation on Normal and Cancer Cell lines
Zinc is the most abundant trace element which has role in genetic stability and function, present in the cell nucleus, nucleolus and chromosomes, and stabilizes the structure of DNA, RNA and ribosomes and found in many...
A Study of Ring Gear Runout Checking Fixture
Fixtures are widely used in industries due to their quality of increasing the accuracy and minimizing the operational time. Inspection in manufacturing includes measuring, examining, testing, or gauging one or more cha...
A Review on Various Exudate Segmentation Techniques in Fundus Images
Segmentation is a technique of dividing given image into numerous sectors. Its objective is to categorize image into various regions in such a way that every potential object in image get individual sector. Instinctive...
The bounds of crossing number in complete bipartite graphs
We compare the lower bound of crossing number of bipartite and complete bipartite graph with Zarankiewicz conjecture and we illustrate the possible upper bound by a modified Zarankiewicz conjecture.
A New Approach for Finding Maximally Frequent Set in Transactional Database
Data mining is a methodology with the ability to extract information from large data sets and transforming it into understandable form for further use. The information obtained is of great value and has proven to be adv...