Error Detection And Correction with Diagonal Hamming based multi-bit error

Advance Encryption Standard detection and correction technique is

Cryptography For Secured proposed to identify errors 1 bit error for
Communication one row .
The proposed scheme is implemented with
Abstract - On behalf of technology scaling, Data Security By using Advance Encryption
on-chip memories in a die undergoes bit Standard Cryptography. was simulated and
errors because of single events or multiple synthesized using Xilinx implemented in
cell upsets by the ecological factors such as Verilog HDL.
cosmic radiation, alpha, neutron particles or
due to maximum temperature in space, leads Index Terms—Space Applications, Diagonal
to data corruption. Error detection and Hamming, Multibit error correction,
correction techniques (ECC) recognize and Random bit errors and correction
rectify the corrupted data over techniques.
communication channel. In this paper, an
advanced error correction 2-dimensional 1. INTRODUCTION
code based on divide-symbol is proposed to
weaken radiation-induced MCUs in memory BINARY information is stored in a
for space applications. For encoding data storage space called memory. This binary
bits, diagonal bits, parity bits and check bits data is stored within metal-oxide
were analyzed by XOR operation. To semiconductor memory cells on a silicon
recover the data, again XOR operation was integrated circuit memory chip. Memory cell
performed between the encoded bits and the is a combination of transistors and
recalculated encoded bits. After analyzing, capacitors where capacitor charging is
verification, selection and correction process considered as 1 and discharging considered
takes place. as 0 and this can store only one bit. Errors
Temporary errors which are classified under which are temporary or permanent are
soft errors are created because of created in the memory cells and need to be
fluctuations in the voltage or external eliminated. Single bit error correction is
radiations. These errors are very common most commonly used technique which is
and obvious in memories. In this paper, capable of correcting up to one bit. Since
technology is increasing rapidly, there are
more probabilities of getting multiple errors
[1]. Use of Diagonal Hamming method
leads to efficient correction of errors in the
memories. Memory was divided as SRAM,
DRAM, ROM, PROM, EPROM, EEPROM
and flash memory. Main advantages of
semiconductor memory is easy to use, less
in cost, and have high bits per square
micrometers. Temporary errors are called
transient errors which are caused because of
fluctuations in potential level. Permanent
errors are caused because of defects during
manufacturing process or large number of
radiations.
For detection and correction of these
soft errors, various methods have been
proposed . In this paper, memory bits which
are affected by errors are recognized and
rectified using Diagonal Hamming based
multi-bit error detection and correction
technique. The aim of this method is to
detect effectively up to 8 bit errors and
correcting them. In this paper, Section-II
gives overview of other coding techniques.
The advantages and disadvantages of
different coding techniques are discussed.
II. RELATED WORKS
Information in the form of binary digits is
stored in a space called memory. Errors
occur in memory due to voltage fluctuations,
manufacturing process or due to very high
radiations. There are many coding
techniques for error correction and
detection. These techniques can correct from
single to multiple bit errors. Coding methods
like HVD, HVDD, HVPDH, DMC, MDMC,
3D parity check with Hamming are used to
correct bits in memory. The 3-Dimensional
parity check is used for checking and
correcting the errors in message bits and
hamming is used for correction of parity
bits. In HVPDH method, number of parity
bits are reduced and hence reliability is
increased. HVD method is used for
correction of soft error bits and the power
consumption is less in this method. In HVD
method, the parity code uses four different
directions in block of data.
HVDD methods can be used for
correction of bit patterns which is in the
form of equilateral triangle and any irregular
triangle. This method can’t be used for
parallelogram structure. In DMC method
decimal program is used for identification
and correction of errors. The main drawback
in this method is it uses more redundant bits
for reliability of memory. In MDMC less
redundant bits are used and it uses re-
configurable Array Exclusive OR logic for
addition in decimal. If we use pipe-lined
MDMC, the time is saved since multiple
stages of work are done at same time.
Similar methods can be used in ON-chip and
OFF-chip networks. Even there, increase in
parity bits improves the reliability of
communication. Many schemes used for
network communication can also be used for
semi-conductor memories
The internet of things (IoT) are
interlinked with digital machines, computing
devices, physical objects and human beings
which provide a unique identifier for each of
them through internet via clouds. Nowadays
eco-friendly telecommunication
technologies have been a mandate in the
wireless network field. One of the major
problem to face is that of power usage of
these wireless communication networks
which has serious environmental impact.
Networks must be able to transfer data with
high accuracy and reliability. So to retain the
more reliability of these networks, errors
must be detected and corrected with great
efficiency. There are number of error
detecting and correcting codes available but
most of them confront lot of challenges such
as unreliable wireless links, the broadcast
nature of wireless transmissions,
interference, frequent topology changes, and
other effects of wireless channels. These are
encountered if high data rate service, high
throughput, etc. are incorporated on it.
Several numbers of error detection and
correction codes such as Hamming code,
Hsiao code, Revering et al. code and CA-
based error detecting and correcting codes
have been introduced in literature. Each of
these codes has its own advantage to be used
as the channel coding scheme in a specific
communication system. Nowadays, there
have been wide spread of research works
based on these codes. Hamming, Hsiao and
Revering codes are well known binary linear
codes which offer single error correction-
double error detection (SEC-DED)
capability. These codes can correct single
error and detect double error.
Delay, power consumption and area
requirements of these codes are lowered
compared to other existing codes. Cha and
Yoon proposed a technique to design an
ECC processing circuits based on SEC-DED
code for memories. The area complexity of
the ECC processing circuits have been
minimized. On the other hand, the error
correction ability of the low density parity
check (LDPC) code depends on the
codeword length. The decoder gives a better
performance with a larger codeword and
with parity-check matrices. The higher
codeword length coding technique needs
larger memory and complex decoding matrices (H) for SEC-DED and SEC-DED-
architecture. The LDPC codes are unable to DAEC codes. ii) Same H-matrix is
correct errors if the number of errors employed to build the SEC-DED and
occurred are greater than the error correction SECDED-DAEC codes. iii) The SEC-DED
capability of the decoder nevertheless of the and SEC-DED-DAEC codes with message
number of iterations. length of 4-bit, 8-bit and 16-bit have been
designed and implemented for WSN
These codes have lesser complexity and application. iv) Proposed designs are fast
lower memory requirements compared to and power efficient compared to existing
other existing LDPC codes and Reed related designs. v) These codes have simpler
Solomon (RS) codes. The LCPC (9, 4), encoding and decoding processes and lower
LCPC (8, 3) and LCPC (7, 3) codes do not memory size. This paper is organized for
need any iteration in the decoding process remainder portion as follows.
which may reduce the overall circuit 1. 1. Motivation
complexity. The algorithms, flowchart, error Problem Statement Coding theory is
patterns and its syndrome values are interested in providing a reliability and
presented. Alabady et al. codes arenot fully trustiness in each communication system
satisfied single error correction and double over a noisy channel. In the more
error detection functionality in some cases. communication systems, the error correction
Beside this limitation, there are some codes are used to find and correct the
mistakes in flowchart, tables and figure possible bit changing, for example, in
which are rectified. Ming et al. proposed a wireless phones etc. In any environment,
SEC-DED-DAEC code to diminish noise Environmental interference, physical fault
source in memories. These existing codes noise, electromagnetic radiation and other
require more area, power and delay. To kinds of noises and disturbances in the
overcome these challenges, this paper aims communication system affect
to develop a new fault tolerant channel communication direction to corrupted
coding technique. messages, an error in the received codeword
The main contributions of this paper (message) or bit changing might be
are as follows: i) Proposed for a new happened during a transmission of data. So,
technique to construct the parity check the data can be corrupted during a
transmission and dispatching from the
transmitter (sender) to the receiver, but
during a data transmission, it might be
affected by a noise, then the input data or
generated codeword is not the same as
received codeword or output data. The error
or bit changing which is happened in data
bits can change the real value of the bit(s)
from 0 to 1 or vice versa. In the following
simple figure, a base structure
communication system is indicated. And this
figure indicates that how the binary signal
can be affected by a noise or other effects
during a transmission on the
communication channel:
Generally, there are three types of
errors that can be corrupted in data
transmission from the sender to
recipient:  Single bit error: The error is
called single bit error when bit changing, or
an error happens in one bit of the whole data
sequence.
 Multiple bit errors: the occurred
errors are called multiple bit errors, if there
are a bit changing or an error in two or more
than two bits of the sequence of forwarded
data.
 Burst errors: if an errors or bits
changing are happened on the set of bits in
the transmitted codeword, then the burst
error is occurred. The burst error will be
calculated from the first bit which is
changed until the last changed bit. These
of types of errors will be discussed in chapter
three of this report in detail.
1.2. The General Idea
noisy
The main method is using
redundancy (parity) to recover messages
with an error during transmission over a
noisy channel. As a simple example, an
error can happen in human language in both
verbal and written communication. For
instance, if during a reading of this sentence:
“this sentence is mistake”, there is an error
and wrong word in this sentence and the
error should be found that in this sentence in
the which word the mistake is occurred and then
it must be corrected, so two important things
must be achieved here: error detection and
error correction, and the principles that must
be used to achieve these goals are first in
English language the string “miscake” is not
accepted word, so in this point, it is obvious
that the error is occurred, Secondly, the
word “miscake” is closest to the real and
correct word “mistake” in English, so it is
the closest and the best word which can be
used instead of the wrong word [4]. So, it
shows how redundancy can be useful in the
example of human language, but the goal of
this project is how the computers can use
some of the same principles to achieve error
detection and error correction in the digital
communication?
To get the best idea of correction by
using a redundancy in digital
communication, first of all, it is necessary to
model the main scheme contains two main
parts called encoding and decoding like the
following figure and in the next parts all of
these parts will be explained in detail and
implemented in Verilog language.
According to this figure2 first, the
code will be generated by a source, and then
to do encoding part, the parity (redundancy)
bits will be added by the encoder to the data
bits which sent from a source. After that, the
generated codeword which is a combination
of data bits and parity bits will be
transmitted to the receiver side, and during
transmission, the error or bit changing might
be happened in the communication channel
over produced codeword. At the end, the
corrupted error must be detected and
corrected by decoder on the receiver side.
Chapter 2. 2. Literature Review
2.1. Historical Background related to
Hamming Code
One of the proper subset of
information theory is called coding theory,
but the concept of these theories are
completely differen. The main subject is
began from a seminar paper which presented
by Claude Shannon in the mid of 20th
century. And in that paper, he demonstrated
that good code exists, but his assertions were
probabilistic. Source Encoder Channel
Received Message Decoder Receiver
In 1947, Dr Hamming introduced
and invented the first method and generation
of error correction code called hamming
code. Hamming code is capable to correct
one error in a block of the received message
contains binary symbols. After that, Dr
Hamming has published a paper in the Bell
technical journal with a subject of error
detection and error correction code. In 1960,
other methods for error detection and error
correction codes were introduced and
invented by another inventor, for example,
BCH code was invented by Bose, Chaudhuri
and Hocquenghem who are a combination of
the surname of the initial inventors of BCH
code.
Another error detection and error
correction code which presented in 1960
was Reed Solomon (RS) code that invented
by two inventors called Irving Reed and
Gustave Solomon and this method was
developed by more powerful computers and
more efficient algorithm for decoding part.
2.2. Types of Hamming Code
There are three more significant types of
hamming codes which called
1. Standard hamming code,
2. Extended hamming code,
3. Extended hamming product code, but in
this research, the standard hamming code is
used and implemented.
2.2.1. Standard Hamming Code
The standard method of hamming
code is depended on a minimum hamming
distance, it means to design the standard
hamming code, minimum hamming distance
which is three among any two codewords is
needed, for instance, a standard hamming
code with a dimension of H (7, 4) which
four data bits are encoded into 7 bits by
appending 3 redundancy bits [10]. In the
next chapter, this kind of hamming code will
be explained in detail.
2.2.2. Extended Hamming Code :
In this type of hamming code (EH), the
minimum distance will be increased to have
one more than the standard form of
hamming code, so the minimum distance is
equal to four among every two codewords.
The main frame and structure of the
Hamming code is the same for both binary
and extended Hamming code. In fact, in the
extended Hamming code there is an extra bit
which is added to the redundant (parity) bit
that allows the decoder to recognize between
single and double bit errors. Afterwards, on
the receiver side, the decoder can detect and
correct an error with one bit changing and a
double bit errors can be detected (not
corrected) at the same time, and if there is
no attempting by a decoder to correct this
single bit error, then it also can detect
maximum three errors. In the last example
above, the extended hamming code defined
as H (8, 4) and here there are 4 parity bits
which are calculated by a subscription
among 8 total bits and 4 data bits.
2.2.3. Extended Hamming Product
Codes
Extended Hamming product codes is
a code which is built based on the extended
Hamming code (EH). This kind of code is
consisted of the new algorithms and
outcomes. The more important issue which
is so significant for both researchers and
designers is low error rate for the evaluation
of efficiency for channel coding scheme.
Also, there are two remarkable values called
BER (bit error rate) and FER (frame error
rate) which some fresh digital radio links are
designed for them, because nowadays, using
wireless multimedia applications are going
to be extended and low-error-rates are so
important issue for these applications. There
are two more important schemes for coding
which has a special performance and
proficiency that is very close to Shannon
limit, and they are called turbo codes, And
low-density parity check codes. So the
product codes can be more competitive,
therewith, this kind of codes can be used for
the implementation of the fast parallel
decoder. The turbo codes is a special
technique and method of the coding theory
which used to prepare a reliable and
reputable communication over a noisy or
messy communication channel. The turbo
codes are a special class of FEC (forward
error correction) codes, and they are used in
3G or 4G mobile communications, for
instance, in LTE. The turbo codes gain their
considerable efficiency and performance
with relatively low complication algorithms
for encoding and decoding parts. The turbo
codes can attain BER or bit-error-rate levels
which should be around 10−5 at the code
rate which is completely close to the
specifically related capacity with advisable
complexity and convolution for decoding.
And the most important key that made it to
the successful algorithm was using decoding
algorithm which is called soft-in soft-out.
In this method (turbo codes), the
main goal is preparing a perfect and
complete set of techniques and analytical
methods to have the performance related to
the low-error rate for the extended Hamming
product codes. For doing analytical
approximation three important parameters
are required which must be evaluated for the
extended Hamming (EH) product codes,
these parameters are called the code
performance at low-error-rates, the exact
knowledge of the code minimum distance
and its multiplicities, respectively.
2.2.3.1. Binary linear code
Linear codes are determined by the
special alphabets called Σ which are finite
fields. All over, it will be denoted by 𝐹𝑞
which means the finite fields with q
elements (q is a primer power and 𝐹𝑞 is {0,
1, . . . , q − 1}) [16]. If a required field is Σ
and C ⊂ Σ 𝑛 is a subset of Σ , then C will be
called a linear code. And because C is a
subset, so there are several basis c (like: c1,
c2, . . . , 𝑐𝑘 which k is a dimension of the
subset), and each generated codeword can
be declared as the linear combination of
these basis vectors and these vectors can be
written In the dominant of proper matrix as
the columns of a n×k matrix and this proper
matrix is called G matrix (generator
matrix) .
According to the binary linear code
which is written in the form of C (n, k), also
there are some values which are described in
the following: There are k data bits or
information frame and r parity bits, also, n is
the total number of bits of a codeword where
n = (k + r). A particular symbol (. ) is the
Hamming weight of a vector . u = (𝑢1, 𝑢2,
… , 𝑢𝑘) c = (𝑐1, 𝑐2, … , 𝑐𝑛) c = (u | P)
where the first k bits are a data bits which is
generated by u and P is a specific vector
which is contained r parity bits and these
parity bits will be placed after the first k data
bits .
A Weight Enumerating Functions
(WEF) Weight enumerating function (WEF)
admits the superlative description and
complete information for a weight structure.
The turbo codes consist of weight
enumerating function of the component
codes, for instance, the traditional trellis
search.
There are three distinguished WEF
for a code the weight enumerating function
is like the following formula: 𝑊𝐶 (𝑦) = ∑ 𝑦
(𝐶) = ∑ 𝐴𝑖𝑦 𝑛 𝑖 𝑐∈C 𝑖=0 Where 𝐴𝑖 is the
number of codewords in which the weight is
𝑊𝐻(𝑐) = i. And another significant formula
will be I𝑊𝐶 (𝑦) which is called the
information weight of an enumerating
function and it will be written like the
downward formula with some changed
parameters in comparison to above formula :
I𝑊𝐶 (𝑦) = ∑ 𝑊𝐻(𝑢)𝑦 𝑤𝐻(𝐶) = ∑ 𝑊𝑖𝑦 𝑛 𝑖
𝑐∈C 𝑖=0 In this formula 𝑊𝑖 is a data
(information) multiplicity and it used instead
of 𝐴𝑖 because it’s the summation of the
Hamming weights of 𝐴𝑖 and u is a specific
data frame which the codeword with a
weight of 𝑊𝐻(𝑐) = i will be generated by it.
The third significant function is
IOWEF (or the input output weight
enumerating function) which is written like
the underneath formula: IO𝑊𝐶(𝑥, 𝑦, 𝑋, 𝑌) =
∑ 𝑥 𝑘−𝑊𝐻(𝑢) 𝑦𝑊𝐻(𝑢) 𝑋 𝑟−𝑊𝐻(𝑃)𝑌
𝑊𝐻(𝑃) 𝑐∈C In this formula the number of
codewords c = (u | P) which 𝑊𝐻(𝑢) is equal
to w and 𝑊𝐻(𝑃) is equal to p, so if we
replace w and p instead of 𝑊𝐻(𝑢) and
𝑊𝐻(𝑃) in above formula, respectively [16],
then the result will be like the following
formula called IO𝑊𝐶(𝑥, 𝑦, 𝑋, 𝑌): IO𝑊𝐶(𝑥,
𝑦, 𝑋, 𝑌) = ∑ ∑ 𝐴(𝑤𝑝) 𝑟 𝑝=0 𝑘 𝑤=0 𝑥 𝑘−𝑤𝑦
𝑤𝑋 𝑟−𝑝𝑌 𝑝 So, the minimum non zero 𝐴𝑖 =
∑𝑤 + 𝑝 = 𝑖 𝐴(𝑤𝑝) and 𝑤𝑖 = w. ∑𝑤 + 𝑝 = 𝑖
𝐴(𝑤𝑝)
BER and FER Performance for
Maximum Likelihood Decoding: In this
part, the main foundation related to the
evaluation of analytical code performance is
at the SNR like, low error rates. According
to the binary linear codes C (n, k) which can
be transmitted by a binary averse
constellation, for example, a 2-PAM, Gray
labeled 4-PSK and etc. upon the increasable
White Gaussian Noise channel. So it will be
so clear that BER and FER performance for
maximum likelihood decoding which are
corresponded to the specific ratio among the
energy of data bits and the spectral density.
The bit error rate or BER is the
number of bits containing an errors in each
time, so the ratio of bit error will be
calculated by the number of bits containing
an error over the total number of bits which
are transferred over a communication
channel during the time interval (the result
can be expressed as a percentage). The
frame error rate (FER) is a ratio of errors for
a received data bits, it can be used for
evaluating a quality of the signal connection.
If the result of FER is so high, it means there
are lots of errors among the whole received
bits, and in this situation, the connection can
be rejected and dropped. FER < = ∑ 1 2 𝐴𝑖
𝑛 𝑖=𝑑𝑚𝑖𝑛 𝑒𝑟𝑓𝑐 (√𝑖 𝑘 𝑛 𝐸𝑏 𝑁0 ) BER < = ∑
1 2 𝑤𝑖 𝑘 𝑛 𝑖=𝑑𝑚𝑖𝑛 𝑒𝑟𝑓𝑐 (√𝑖 𝑘 𝑛 𝐸𝑏 𝑁0 )
Where 𝐸𝑏 is the energy of each data
(information) bit and 𝑁0 is the noise of
spectral density and the ratio between them
(𝐸𝑏 𝑁0 ) is significant and related to the
BER and FER performance for maximum
likelihood decoding.
2.2.4. Extended Hamming code vs.
Extended Hamming product code
3. Theoretical Description of
Hamming Code
3.1. Description of Hamming Code
A hamming code is a simple method of error
detection and error correction which is used
frequently . A hamming code always check
the error for all the bits which exist in the
codeword (in fact, it checks all bits of a
codeword from the first bit to the last
available bit) . And exactly for this reason
the hamming code is called linear code for
error detection and error correction that can
detect maximum two synchronic bit errors
and it is capable to correct only single bit
error ( can correct just one bit error) . This
method works by appending a special bits
called parity or redundancy bits. Several
piece of these extra bits is installed and
inserted among the data bits at the desired
positions, but the number of these extra bits
is depend on the number of data bits.
The hamming code initially
introduced code that enclosed, for example,
to construct the Hamming (7, 4) that the
total bits are equal to seven, which four bits
are data bits into seven bits by adding three
parity bits. And the number of each bit must
start from one, like 1, 2, 3, 4, 5, 6, 7 and to
write them in binary: 001, 010, 011, 100,
101, 110, 111. The parity bits are calculated
at the proper positions that are calculated by
powers of two: 1, 2, 4 and etc. And the data
bits must be located at another remained
positions which in this example are: 3, 5, 6,
7. Each data bit is contained in the
calculation of two or more parity bits. In
particular, parity bit one (r1) is calculated
from those bits that their positions has the
least considerable or important set of bits
which are: 1, 3, 5 and 7 (or in binary 001,
011, 101 and 111). Parity bit two or r2 (at
index two, or 10 in binary) is calculated
from the bits that their index has the second
least important set of bits which are: 2, 3, 6,
7 (or 010, 011, 110, 111 in binary). Parity
bit three or r3 (which must be located at
position four or 100 in binary) is calculated
from the bits where their positions has the
third least considerable set of bits which are:
4, 5, 6 and 7 (or 100, 101, 110, 111). The
code sends message bits padded with
specific parity or redundancy bits in the
form of is the block size or a whole number
of bits and k is the number of data bits in the
generated codeword. All the procedure
which is required for adding parity bits to
the data bits to encode and create a proper
codeword will be explained in next parts of
this report. In the following table, all the
possible Hamming codes are indicated:
According to table 1, if there are r
parity bits, it can cover bits from 1 up to 2 𝑟
− 1 which called total bits (or n), and also
the number of parity bits should be more
than one (r > 1). For each dimension of
hamming code, there is a rate which is equal
to a division of the number of data bits and
number of total bits (rate = ) and always its
result will be less than 1, another important
factor is called overhead factor which is
calculated by a division among total bits or n
and data bits or k (overhead factor = 𝑛 𝑘 ),
and its result is always more than one.
 3.2. An Alternative Description of
the Hamming Code
In the following figure which
indicated another description of the
Hamming code. There are three nested
circles in this figure and they are related to
In the upper figure which describe
the three parity equation defining the
[7, 4] Hamming code, graphically, each
Hamming code, also there are seven areas
parity bits can cover just its adjacent bit
among these available circles in this figure
positions which can be common with other
that are related to the seven bits in a final
parity bits in this figure: For instance, parity
codeword . The number of the circle can be
bit 1 (r1) covers data bits: k1, k2, k4. And
extended for each dimension of hamming
parity bit 2 (r2) covers data bits: k1, k3, k4.
code. When the single bit error happens,
And parity bit 3 (r3) covers data bits: k2, k3,
during a transmission process, this error will
k4
be fixed by flipping this bit (single bit) in
the proper area, related to the position where
3.3. Theoretical Description for
the error happens.
Encoding Part of Hamming Code
Hamming code is a specific linear
code which can correct just one error by
adding r parity bits to k data bits that
generated by the source to have a codeword
with a length of n which is equal to k + r.
And the data bits or k is equal to 2 𝑟 − 𝑟 − 1
to generate a codeword with a length of 2 𝑟
For example: For H (7, 4) which − 1 [1] [6] [7]. General algorithm for the
encodes four data bits by appending three encoding part of hamming code is described
parity or redundancy bits to generate a in the following: 1. r parity or redundancy
proper codeword which is a combination of bits are combined to k data bits to creating a
both parity and data bits. proper codeword which is contains r + k
bits. So the bit position sequence is from the
position number 1 to r + k. In fact, for
decoding part on the receiver side which is where they are not reserved before. And the
contained detection and correction step for data bits will be appended in the same order
an occurred error, extra bits is needed to as they are appeared in the main data bits
send some extra bits with data bits which which generated by source.
called parity (redundant) bits and these
parity bits are added by the sender (by
encoding) and they always removed by the
receiver on the receiver side (by decoding)
[23]

But how to merge the data bits and

parity bits into a codeword? The parity bit
So, the transmitter adds parity bits
positions are always numbered in powers of
through a process that creates a relationship
two, reserved and prepared for the parity bits
between parity bits and specified data bits.
and another bit positions are related to the
Then the receiver will check the two set of
data bits [23]. The first parity bit is located
bits to detect and correct the errors which
in the bit position: 2 0 = 1. The second
will explain in the decoding part [23], but
parity bit is located in a bit position: 2 1 = 2.
the following figure can present the main
The third parity bit is located in a bit
idea of coding that is used in the hamming
position: 2 2= 2 and so on. In the following
code.
simple table, the position of each parity bits
(r) presented in a grey colored cells and they
are reserved for the parity purpose.

After that, the data bits (k) are copied

to the other free and remaining positions
 2. The value of parity bits are two bits are different then the result will be
calculated by XOR operation of some one (according to the following table).
combination of data bits [24]. A
combinational of data bits are indicated in
the downward table which all parity bits and
data bits and their position that should be
calculated according to the rules of encoding
part of the hamming code. For example, for
calculating the value of parity bit number
one which called r1, the XOR calculation The XOR operation in table 4
must begin from r1, then check one bit, and indicates the odd function. If the number of
skip one bit until the last bit which exists in 1’s among the variables X and Y are odd
the sequence of bits in the codeword. number, then the result of XORing among
these two single bits are equal to one,
otherwise if the number of 1’s are even
numbers, then the result will be zero.

4. Diagonal Hamming Code

Design of Diagonal Hamming
method for memory Proposed design of
Diagonal Hamming based multi-bit error
detection and correction technique to the
memory is shown in Fig. 1. Using this
approach of diagonal Hamming bits, the
errors in the message can be recognized and
can be rectified which are saved in the
memory. In encoding technique message
bits are given as input to the Diagonal
Hamming encoder and the Hamming bits are

The result of XOR operation is zero calculated. Message and Hamming bits

if both two bits are the same, otherwise, if (32+24 bits) are saved in the memory after
the encoding technique.
 The message is represented in the form m x
n matrix. The grouping of the message bits
is depicted in Fig. 2. The encoder generates
the hamming bits and the hamming bits are
obtained by grouping the message bits and
the hamming bits are calculated with the
help of hamming code. The message bits are
patterned as shown in Fig. 3. Eight
diagonals are considered in this Diagonal
Hamming method and each diagonal
consists of 4 message bits.

Message bits are grouped as shown

in the Fig. 3 in the specified directions. The
first diagonal consists of m3[7], m3[5],
m2[6], m1[7], the second diagonal has
m3[6], m2[7], m0[1], m1[0], the third
Errors which are occurring in the
diagonal has m0[0], m0[2], m1[1], m2[0],
message bits, are saved in the memory and
the fourth diagonal has m3[4], m2[5],
can be recognized and rectified in the
m1[6], m0[7], the fifth diagonal has m3[3],
decoding technique. B. Design of Diagonal
m2[4], m1[5], m0[6], the sixth diagonal has
Hamming Encoder For example, message of
m3[2], m2[3], m1[4], m0[5], the seventh
32 bits is accounted in the proposed method.
diagonal has m3[1], m2[2], m1[3], m0[4]
and the eight diagonal has m3[0], m2[1],
m1[2], m0[3]. Each one of the diagonals has
four message bits. For the respective groups,
the hamming bits are calculated as shown in
Fig. 4. The hamming bits are shown as R1,
R2, R3, R4, R5, R6, R7, R8 arrays and these
arrays consist of 3 bits. The hamming bits
are calculated as given in equations (1)- (24)
: For the first row:
R1[1] = m1[7] ⊕ m2[6] ⊕ m3[7];
(1) R1[2] = m1[7] ⊕ m3[5] ⊕ m3[7]; (2)
R1[3] = m2[6] ⊕ m3[5] ⊕ m3[7]; (3) For
the second row: R2[1] = m1[0] ⊕ m0[1] ⊕
m3[6]; (4) R2[2] = m1[0] ⊕ m2[7] ⊕
m3[6]; (5) R2[3] = m0[1] ⊕ m2[7] ⊕
m3[6]; (6) For the third row: R3[1] = m2[0]
⊕ m1[1] ⊕ m0[0]; (7) R3[2] = m2[0] ⊕
m0[2] ⊕ m0[0]; (8) R3[3] = m1[1] ⊕
m0[2] ⊕ m0[0]; (9) For the fourth row:
R4[1] = m0[7] ⊕ m1[6] ⊕ m3[4]; (10)
R4[2] = m0[7] ⊕ m2[5] ⊕ m3[4]; (11)
R4[3] = m1[6] ⊕ m2[5] ⊕ m3[4]; (12) For
the fifth row: R5[1] = m0[6] ⊕ m1[5] ⊕
m3[3]; (13) R5[2] = m0[6] ⊕ m2[4] ⊕
m3[3]; (14) R5[3] = m1[5] ⊕ m2[4] ⊕
m3[3]; (15) For the sixth row: R6[1] =
m0[5] ⊕ m1[4] ⊕ m3[2]; (16) R6[2] =
m0[5] ⊕ m2[3] ⊕ m3[2]; (17) R6[3] =
m1[4] ⊕ m2[3] ⊕ m3[2]; (18) For the
seventh row: R7[1] = m0[4] ⊕ m1[3] ⊕
m3[1]; (19) R7[2] = m0[4] ⊕ m2[2] ⊕
m3[1]; (20) R7[3] = m1[3] ⊕ m2[2] ⊕
m3[1]; (21) For the eight row: R8[1] =
m0[3] ⊕ m1[2] ⊕ m3[0]; (22) R8[2] =
m0[3] ⊕ m2[1] ⊕ m3[0]; (23) R8[3] =
m1[2] ⊕ m2[1] ⊕ m3[0]; (24) In the
encoder, the hamming bits are calculated for
message. We get 24 hamming bits in total
for 32-bit message. C. Proposed Diagonal
Hamming Decoder The message bits which
are encoded and kept in memory as a matrix
as shown in Fig. 4, and are given as input to
the decoder. The decoder now segregates
message and hamming bits and it
recalculates the hamming bits and evaluates
syndrome bits. The syndrome bits are
evaluated using the equations given in (25)-
(48) : For first row S1[1] = R1[1] ⊕ m1[7]
⊕ m2[6] ⊕ m3[7]; (25) S1[2] = R1[2] ⊕
m1[7] ⊕ m3[5] ⊕ m3[7]; (26) S1[3] =
R1[3] ⊕ m2[6] ⊕ m3[5] ⊕ m3[7]; (27) For
the second row: S2[1] = R2[1] ⊕ m1[0] ⊕
m0[1] ⊕ m3[6]; (28) S2[2] = R2[2] ⊕
m1[0] ⊕ m2[7] ⊕ m3[6]; (29) S2[3] =
R2[3] ⊕ m0[1] ⊕ m2[7] ⊕ m3[6]; (30) For
the third row: S3[1] = R3[1] ⊕ m2[0] ⊕
m1[1] ⊕ m0[0]; (31) S3[2] = R3[2] ⊕
m2[0] ⊕ m0[2] ⊕ m0[0]; (32) S3[3] =
R3[3] ⊕ m1[1] ⊕ m0[2] ⊕ m0[0]; (33) For
the fourth row: S4[1] = R4[1] ⊕ m0[7] ⊕
m1[6] ⊕ m3[4]; (34) S4[2] = R4[2] ⊕
m0[7] ⊕ m2[5] ⊕ m3[4]; (35) S4[3] = (49) After the position is calculated, the
R4[3] ⊕ m1[6] ⊕ m2[5] ⊕ m3[4]; (36) For error corrector negates the bit corresponding
the fifth row: S5[1] = R5[1] ⊕ m0[6] ⊕ to that position to correct the data bit. This
m1[5] ⊕ m3[3]; (37) S5[2] = R5[2] ⊕ process is done till all the corrupted bits are
m0[6] ⊕ m2[4] ⊕ m3[3]; (38) S5[3] = corrected. Now the output of the decoder
R5[3] ⊕ m1[5] ⊕ m2[4] ⊕ m3[3]; (39) For will be the form of Fig. 2.
the sixth row: S6[1] = R6[1] ⊕ m0[5] ⊕
m1[4] ⊕ m3[2]; (40) S6[2] = R6[2] ⊕
m0[5] ⊕ m2[3] ⊕ m3[2]; (41) S6[3] =
R6[3] ⊕ m1[4] ⊕ m2[3] ⊕ m3[2]; (42) For
the seventh row: S7[1] = R7[1] ⊕ m0[4] ⊕
m1[3] ⊕ m3[1]; (43) S7[2] = R7[2] ⊕
m0[4] ⊕ m2[2] ⊕ m3[1]; (44) S7[3] =
SIMULATIONS AND
R7[3] ⊕ m1[3] ⊕ m2[2] ⊕ m3[1]; (45) For
RESULTS
the eight row: S8[1] = R8[1] ⊕ m0[3] ⊕
m1[2] ⊕ m3[0]; (46) S8[2] = R8[2] ⊕
m0[3] ⊕ m2[1] ⊕ m3[0]; (47) S8[3] =
R8[3] ⊕ m1[2] ⊕ m2[1] ⊕ m3[0]; (48) If
all the syndrome bits are equal to zero, then
it represents that the message bits are not
corrupted and if anyone of the syndrome bits
Fig 1 : 32bit input for Diagonal hamming
in non-zero, then it represents the message grouped in 4 msg signals , mo,m1,m2m,m3
bit(s) are corrupted. These corrupted bits
need correction so, the message bits are sent
to the error correction part. In the correcting
of error part, the location of error is
identified by doing the following
calculations: Suppose if the error is in the
third row of the message organization, then
the error position is calculated as: (S3[3] ∗ Fig 2 : diagonal Arrangement

(22 )) + (S3[2] ∗ (21 )) + (S3[0] ∗ (20 ));

 The input given for this circuit is mo,m1,m2,m3
Fig 3 positioning in the form of hamming codes
and output we get parity bit separate order and
with grouped messged data
final_out .
R1,R2,R3,R4,R5,R6,R7,R8 is the parity bits
Final _out = Parity bits + msg_input
= 8 x 3 ( 8 parities each having 3 bits)
32 bit Diagonal Hamming Encoding :
+ 32 bit
= 56 bits

Error Corrector At Reciever side also called

Decoder

Fig : block diagram For

diagonal Hamming Encoder

Fig : block
Diagram For Decoder
 Fig : Encoding And Decoding
Block
In this the 32bit input is grouped into 8bit
msg_data ie.., m0,m1,m2,m3;
Output is R_m0,R_m1,R_m2,R_m3
(Recived_msg)
Output is also indicating Any_error Occured in
Matching encoding and Decoding Data .

Fig : output Waveform for Error corrector

DIAGONAL HAMMING CODE 32 BIT with

The output we got from encoding block is Cryptography .
final_out 00b73789678f2a . Now , this is sent at
the receiver side .But at the receiver side
suppose the data getting with some Error
Consider that as
in = 01b63709778e2b input for Error corrector
block or Decoding Block
and Here at Output Error will be getting
corrected and Getting Exact data whatever sent
at Transmitter side .
out = 00b73789678f2a.

Encoding And Decoding One Module :

With The Help of ADVANCE ENCRYPTION

STANDARD ,Here Error Correction Codes are
Designed .
In this Encoded Ouput will be the Input for AES
Encryption By using Secured Key .
The Encrypted Output will forwarded to
DecryptBlock with same Secured Key and the
Decrypt Output will be given for Decoding
Which is Decoding the input without any Error
and The Required Data is Retrived At Reciever
Side .

Fig : ECC with Cryptography output waveforms
Advantages :
1. This project Can correct multiple Bit Errors
2. This project aslo eligible for Provideing Security
For Data in Communication System .
Conclusion
[1] Paromita Raha , M. Vinodhini and
N.S Murty,” Horizontal Vertical Parity and
Diagonal Hamming Based Soft errors Detection
and Cor- rection of Memories," in Proc. Int Conf
on Comp Com and Info, 2017.
[2] S.ASAI, “Semi conductor memory
trends," in Proc. of IEEE, Vol.74, 1986.
[3] Shivani Tambatkar, Siddharth
Narayana Menon, Sudarshan.V, M.Vinodhini
and N.S.Murty, “ Error Detection and Correction
in Semiconductor Memories using 3D Parity
Check Code with Hamming Code,” in Proc.
International Conf on Comm and Signal

Diagonal Hamming coding method is Processing, 2017.

proposed in this paper and the main idea [4] Varinder Singh and Narinder

behind this work is to reduce maximum errors Sharma, " A Review on Various Error Detection

during transmission of bits in memory. Diagonal and Correction Methods Used in

Hamming method identifies and corrects up to Communication," American International

maximum of 8bit errors in a row for 32-bit Journal of Research in Science, Technology,

input. Diagonal Hamming method ensures less Engineering and Mathematics, pp. 252 - 257,

area and delay by 91.76 percentage and 84.18 2015.

percentage respectively. Huge amount of error [5] Mostafa Kishani, Hamid R. Zarandi,

correction is possible using this Diagonal Hossein Pedram, Alireza Ta- jary, Mohsen Raji

Hamming method. and Behnam Ghavami, “HVD: Horizontal-

Vertical- Diagonal error detecting and
correcting code to protect against with soft
errors,” Design automation for embedded
systems Journal, Vol. 15, no. 3, pp. 289- 310,
May 2011.
[6] S. Vijayalakshmi and V. Nagarajan
(FEB 2019), “Design and Implementation of Low

REFERENCES Power High-Efficient Transceiver for Body

Channel Communications”, Springer- Journal of
Medical Systems
[7] Md. Shamimur Rahman,
Muhammad Sheikh Sadi, Sakib Ahammed and
Jan Jurjens, ” Soft Error Tolerance using
Horizontal – Vertical Double – Bit Diagonal
Parity Method,” in Proc 2nd IEEE International
Conference on Electrical Engineering and
Information and Commu- nication Technology
(ICEEICT) , 21-23 May 2015.
[8] Jing Guo, Liyi Xiao, Zhigang Mao and
Qiang Zhao, “Enhanced Memory Reliability
against Multiple Cell Upsets Using Decimal
Matrix Code,” IEEE Transactions on Very Large
Scale Integration (VLSI) Systems, Vol. 22,
Issue:1, pp. 127-135, Jan. 2014
[9] Ahilan A. and Deepa P., “Modified
Decimal Matrix Codes in FPGA Configuration
Memory for Multiple Bit Upsets,” in
Proc.International Conference on Computer
Communication and Informatics (ICCCI), pp. 1-
5, Jan. 2015
[10] M.Vinodhini and N.S.
Murty.,"Relible Low Power NoC Intercon- nect,"
Micoprocessor and Microsystems-Embedded
Hardware Design, Vol.57, March 2018.
[11] U. Sai Himaja, M. Vinodhini, N.S.
Murty, "Multi-Bit Low Redundancy Error control
with Parity Sharing for NoC Interconnects," in
Proc. International Conference on
Communication and Electronics Systems, Oct.
2018.