Error detection and correction

are the most usual way to represent, change and communicate information. This data however s subject to errors due to a variety of factors, such as deterioration of magnetic tape over time, or a scratch on a CD or DVD. Coding theory uses techniques that can help find the errors. However if there are too many errors, the techniques may not always work. One of the first techniques is the error detecting codes, which adds a parity check bit to the end of the bit string. The idea is to add an extra

Ersin Esen and A. Aydin Alatan, Member, IEEE Abstract—Video data hiding is still an important research topic due to the design complexities involved. We propose a new video data hiding method that makes use of erasure correction capa- bility of repeat accumulate codes and superiority of forbidden zone data hiding. Selective embedding is utilized in the proposed method to determine host signal samples suitable for data hiding. This method also contains a temporal synchronization

ABSTRACT This paper focus on designing of efficient encoder and decoder blocks which are aimed to reduce the power consumption in Network on Chip. The power consumption in NOC is caused by the links, routers and network interfaces. This is caused because as the number of cores in NOC increases the gap between the links decreases the coupling capacitance value increases due to which the power consumption increases. The proposed scheme does not require any modifications in router and link architecture

frequency division multiplexing (OFDM) system is analyzed over a composite fading channel i.e. generalized K- fading channel. Here, OFDM system is considered which include repetition code to enhance the wireless link performance with simplicity. Symbol error rate (SER) performance is evaluated using binary phase shift keying (BPSK) and 16-qardature amplitude modulation (16-QAM) over generalized-K fading channel. This channel model considers Nakagami-m distribution to define multipath and gamma distribution

and we wish to do this so that we have the ability to detect and correct 1 error if it were to occur. We can use the QRT and send our message as encoded q-relations as well as additional redundant q-relations. If our message contains 2r q-relations and we send 2(r + s) q-relations, then the QRT can correct up to s errors. Thus, we need to send 2 more pieces of redundant data in order to ensure we can correct s = 1 error. We will do this by calculating the q-relations for our original message using

This chapter gives an overview of the literature survey on LDPC block codes and algorithm for LDPC decoder which gives a high throughput, better bit error rate performance with low clock frequency. R G Gallager [1] in his paper, the overview of low density parity check codes are presented. The parity check matrix specifies these codes, which consists of few entries of non-zero elements. The number of non-zero elements in row should be greater than the number of non-zero elements in column. The typical

can get back to the original topic. ECC RAM ECC memory (Error-Correcting Code memory) is a type of storage for computers that can as the name suggest check and correct for errors. This RAM is used in computers for errors can’t be accepted under any circumstances such as computers for banking, scientific purposes, or even a computer mad for calculating pi. ECC memory maintains a system of memory that can be immune to single bit errors. It does this by reading the

the CBIR. There are many applications of Content Based Information Retrieval. Image retrieval is one of the applications of CBIR. Few applications of CBIR are art collections, architectural and engineering design, crime prevention, Defense, Face detection etc. Mostly CBIR is applied on the Multimedia data. CBIR faces some problems. The trouble with the technique is the issue of high dimensionality. With the increase in the dimensionality CBIR becomes time consuming system and highly computation bound

turn, can cause a change in the data transmission. As a result of data change or corruption, the idea of channel coding was introduced as a reliable solution to overcome this dilemma. Nowadays, we use some techniques as Forward error correction (FEC) to reduce the errors that might appear during the information transmission over the channel. In this technique, the system adds redundant (extra) bits to identify if a specific bit is corrupted or not and correct it. FEC Channel codes may be classified

we try to derive an approximate PSK constellation. To do so we have to remember how the modulation-based fingerprinting works. Like in several other attacks we use the five characteristics of the signal: frequency error, SYNC correlation, I/Q origin offset, magnitude error and phase error. All these features are used to state the differences to the ideal constellation given in the 802.11 specifications. We extract this features from a captured signal and use them afterward to manipulate the frame we