Académique Documents
Professionnel Documents
Culture Documents
I. INTRODUCTION
Error detection and correction is an important process in
the modern communication systems to ensure reliable data
communication. The idea behind achieving error detection
and correction is to add some redundancy (i.e., some extra
data) to a message, which the receivers can use to check the
reliability of the received message, and to recover data that is
corrupted. Error detection is most generally done using a
suitable checksum algorithm. It adds a fixed-length tag to a
message, which enables the receivers to verify the received
message by recomputing the tag and comparing it with the one
provided.
A class of codes called binary oriented codes has been
studied intensively in the literature. One of the main reasons
for this is the fact that integer codes have weak error control
capabilities [1], that their ability to correct single errors of
given types could be interesting for some specific
applications, but not for error control coding [2].
The work done by Aleksandar Radonjic and Vladimir
Vujicic [1] reported that the concept of integer codes can be
improved, i.e., that it is possible to construct codes which can
correct any burst of length l within a b-bit byte (1< l < b).
Further, these codes have very simple encoding/decoding
procedures, and the look-up table (LUT)-based error control
procedure requires relatively small memory resources.
According to Aleksandar Radonjic and Vladimir Vujicic,
these codes could be used in various practical situations,
especially in cases where network nodes represent computers
or other processor-based devices [1].
In this work these integer codes are applied on run length
coded data for error detection and correction. The remainder
(1)
1+
C2.
2]
32
1+
C2.
2]
B. Decoding
Fig. 3 shows the decoding simulation using modelsim for
the data given below.
Received Cb = 134 Syndrome = 0 (without error)
By introducing error in 13th and 14th bit,
B1= 11010111, B2= 10001111, C1=7, C2=9
Received Cb =233 Syndrome = 99 (with error)
The output is corrected by using LUT.
Fig. 1. block diagram of the proposed approach for error detection and
correction of run length coded data.
Power
(mW)
Area
(No. of gates)
Delay
(nS)
9358
31.235
29
9570
31.235
29
9186
31.260
29
9222
31.260
30
33
The analysis result shows that the carry select adder and
Wallace tree multiplier combination consumes less power and
the propagation delay is also reduced which improves the
speed of operation.
C. Run Length Compression with error correction
In this module the following data are used and the
simulation results are shown in Fig. 4.
B1= 11010111 B2= 10000011 C1=7 C2=9
The received check byte value is 10000110=(134)10
Encoding output is 110101111000001110000110.
After run length compression the output is
0101010101 1243541112.
The output is decompressed and decoded output is
110101111000001110000110.
If error will occur in first and second bit position it will be
corrected by using LUT.
V. CONCLUSION
A look up table based error detecting and correcting integer
codes for run length coded data is presented in this paper. This
approach is tested on run length encoded data. The encoding
and decoding processes are simple yet efficient in terms of
memory requirement.
REFERENCES
[1]
[2]
[3]
[4]
34