Cyclic redundancy encoder for error detection in communication channels
Cyclic Redundancy Check is one of the most powerful methods of error detection in blocks for digital communications signals. I t involves a division of the transmined message block by a constant called the generator polynomial. The quotient is discarded, and the remainder is...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/5910/ http://irep.iium.edu.my/5910/ http://irep.iium.edu.my/5910/ http://irep.iium.edu.my/5910/1/01411112.pdf |
| id |
iium-5910 |
|---|---|
| recordtype |
eprints |
| spelling |
iium-59102012-04-03T08:04:26Z http://irep.iium.edu.my/5910/ Cyclic redundancy encoder for error detection in communication channels Khalifa, Othman Omran Islam, Md. Rafiqul Khan, Sheroz T Technology (General) Cyclic Redundancy Check is one of the most powerful methods of error detection in blocks for digital communications signals. I t involves a division of the transmined message block by a constant called the generator polynomial. The quotient is discarded, and the remainder is transmitted as the Block check Character or Frame Check Sequence. The receiving station performs the same computation on the received message block. The computed remainder, FCS is compared to the remainder received from the transmitter. If the two match, no errors have been detected in the message block. If the two do not match, either a request for retransmission is made by the receiver or the errors are corrected through use of special coding technique. This paper describes the methodology used and the implementation of the Cyclic Redundancy Check (CRC) algorithm using Ci+ programming. The technique gained its popularity because it combines three advantages: Extreme error detection capabilities, little overhead and ease of implementation. The CRC is calculated by performing a modulo 2 division of the data by a generator polynomial and recording the remainder atler division. The mnst commonly used polynomials are implemented. The conclusions and analysis results were shown and presents that the Cyclic Redundancy Check Encoder is used i n error detection for digital signals due to the ability to quickly determine if errors are present. The redundancy bits produced by the cyclic encoder enable the receiver to quickly determine if an error was produced and different types of polynomials are used i n CRC. 2004 Conference or Workshop Item PeerReviewed application/pdf en http://irep.iium.edu.my/5910/1/01411112.pdf Khalifa, Othman Omran and Islam, Md. Rafiqul and Khan, Sheroz (2004) Cyclic redundancy encoder for error detection in communication channels. In: 2004 RF and Microwave Conference, 5 - 6 October 2004, Subang, Selangor. http://dx.doi.org/10.1109/RFM.2004.1411112 doi:10.1109/RFM.2004.1411112 |
| repository_type |
Digital Repository |
| institution_category |
Local University |
| institution |
International Islamic University Malaysia |
| building |
IIUM Repository |
| collection |
Online Access |
| language |
English |
| topic |
T Technology (General) |
| spellingShingle |
T Technology (General) Khalifa, Othman Omran Islam, Md. Rafiqul Khan, Sheroz Cyclic redundancy encoder for error detection in communication channels |
| description |
Cyclic Redundancy Check is one of the
most powerful methods of error detection in blocks for
digital communications signals. I t involves a division
of the transmined message block by a constant called
the generator polynomial. The quotient is discarded,
and the remainder is transmitted as the Block check
Character or Frame Check Sequence. The receiving
station performs the same computation on the received
message block. The computed remainder, FCS is
compared to the remainder received from the
transmitter. If the two match, no errors have been
detected in the message block. If the two do not match,
either a request for retransmission is made by the
receiver or the errors are corrected through use of
special coding technique. This paper describes the
methodology used and the implementation of the
Cyclic Redundancy Check (CRC) algorithm using
Ci+ programming. The technique gained its
popularity because it combines three advantages:
Extreme error detection capabilities, little overhead
and ease of implementation. The CRC is calculated by
performing a modulo 2 division of the data by a
generator polynomial and recording the remainder
atler division. The mnst commonly used polynomials
are implemented. The conclusions and analysis results
were shown and presents that the Cyclic Redundancy
Check Encoder is used i n error detection for digital
signals due to the ability to quickly determine if errors
are present. The redundancy bits produced by the
cyclic encoder enable the receiver to quickly determine
if an error was produced and different types of
polynomials are used i n CRC. |
| format |
Conference or Workshop Item |
| author |
Khalifa, Othman Omran Islam, Md. Rafiqul Khan, Sheroz |
| author_facet |
Khalifa, Othman Omran Islam, Md. Rafiqul Khan, Sheroz |
| author_sort |
Khalifa, Othman Omran |
| title |
Cyclic redundancy encoder for error detection in communication channels |
| title_short |
Cyclic redundancy encoder for error detection in communication channels |
| title_full |
Cyclic redundancy encoder for error detection in communication channels |
| title_fullStr |
Cyclic redundancy encoder for error detection in communication channels |
| title_full_unstemmed |
Cyclic redundancy encoder for error detection in communication channels |
| title_sort |
cyclic redundancy encoder for error detection in communication channels |
| publishDate |
2004 |
| url |
http://irep.iium.edu.my/5910/ http://irep.iium.edu.my/5910/ http://irep.iium.edu.my/5910/ http://irep.iium.edu.my/5910/1/01411112.pdf |
| first_indexed |
2023-09-18T20:14:43Z |
| last_indexed |
2023-09-18T20:14:43Z |
| _version_ |
1777407710859362304 |