A cyclic redundancy check (https://ccm.net)
W.
Wesley Peterson created
a cyclic redundancy check (CRC) in 1961 (Revolvy, 2018). Then, Peterson had
published his works that related to CRC in 1975 and won Japan Prize in 1999. CRC
is one of well-known technique for checking the burst
error in communication. It is popular because CRC is a simple method to be
implemented in binary hardware and a good technique to detect errors caused by
noise in the channels during communication.
As described by
Sang (2015) that by using CDC, check bits could be attached with sending
messages, then receiver could agree or not with data sending or determine
whether data have error or not or data have been corrupted or not. If the receiver
found error in transmission, then receiver would ask the sender to re-send the
messages. In addition to digital networks, CDC can also be applied in storage
devices.
Both sender and
receiver apply the same a 16- or 32-bit polynomial for transmission and appending
data (Rouse, 2010). Data will be sent and received successfully, if both sender
and receiver reach agreement, if not, the receiver will ask sender to send the
data again, and again until accomplish the goal of transmission.
Now, if there is
question “why the CRC is put in the trailer rather than in the header of the
frame?” The answer is that by being put in the trailer, the computation of CRC
is less expensive when the bits of packet arrive. Another advantage that
hardware could determine whether the CRC is correct or not, so transmission
could be faster and without delaying.
References
Revolvy. 2018. W. Wesley Peterson.
Retrieved from https://www.revolvy.com/main/index.php?s=W.%20Wesley%20Peterson
Rouse, M. 2010. cyclic redundancy
checking. Retrieved from http://searchnetworking.techtarget.com/definition/cyclic-redundancy-checking
Sang, SJ. 2015. Design and
implementation of cyclic redundancy check in algorithm. Part of publication
in Computing, Control, Information and
Education Engineering. Taylor and Francis group, London. Pp.405-409
www.lintasview.ga
ReplyDeleteI just visit your page.
DeleteThank you to visit my article: Technique for Checking the Burst Error
Technique for Checking the Burst Error
ReplyDeleteTechnique, for Checking the Burst Error
ReplyDeleteTechnique, for, Checking the Burst Error
ReplyDeleteTechnique, for, Checking, the Burst Error
ReplyDeleteTechnique, for, Checking, the, Burst Error
ReplyDeleteTechnique, for, Checking, the, Burst, Error
ReplyDeleteTechnique for Checking the Burst Error
ReplyDeleteTechnique for Checking the Burst Error
ReplyDeleteA cyclic redundancy check (https://ccm.net)
Technique for Checking the Burst Error
ReplyDeleteW. Wesley Peterson created a cyclic redundancy check (CRC) in 1961
Technique for Checking the Burst Error
ReplyDeleteThen, Peterson had published his works that related to CRC in 1975 and won Japan Prize in 1999.
Technique for Checking the Burst Error
ReplyDeleteCRC is one of well-known technique for checking the burst error in communication.
Technique for Checking the Burst Error
ReplyDeleteIt is popular because CRC is a simple method to be implemented in binary hardware and a good technique to detect errors caused by noise in the channels during communication.
Technique for Checking the Burst Error
ReplyDeleteAs described by Sang (2015) that by using CDC, check bits could be attached with sending messages, then receiver could agree or not with data sending or determine whether data have error or not or data have been corrupted or not.
Technique for Checking the Burst Error
ReplyDeleteIf the receiver found error in transmission, then receiver would ask the sender to re-send the messages.
Technique for Checking the Burst Error
ReplyDeleteIn addition to digital networks, CDC can also be applied in storage devices.
Technique for Checking the Burst Error
ReplyDeleteBoth sender and receiver apply the same a 16- or 32-bit polynomial for transmission and appending data (Rouse, 2010).