Analysis Of The Effectiveness Of Error Detection In Data Transmission Using Polynomial Code Method
| Autor: | Daniel Owunwanne |
|---|---|
| Rok vydání: | 2011 |
| Předmět: | |
| Zdroj: | International Journal of Management & Information Systems (IJMIS). 14 |
| ISSN: | 2157-9628 1546-5748 |
| DOI: | 10.19030/ijmis.v14i2.835 |
| Popis: | Data transmitted from one location to the other has to be transferred reliably. Usually, error control coding algorithm provides the means to protect data from errors. Unfortunately, in many cases the physical link can not guarantee that all bits will be transferred without errors. It is then the responsibility of the error control algorithm to detect those errors and in some cases correct them so that upper layers will receive error free data. The polynomial code, also known as Cyclic Redundancy Code (CRC) is a very powerful and easily implemented technique to obtain data reliability. As data transfer rates and the amount of data stored increase, the need for simple and robust error detection codes should increase as well. Thus, it is important to be sure that the CRCs in use are as effective as possible. Unfortunately, standardized CRC polynomials such as the CRC-32 polynomial used in the Ethernet network standard are known to be grossly suboptimal for important applications, (Koopman, 2002). This research investigates the effectiveness of error detection methods in data transmission used several years ago when we had to do with small amount of data transfer and data storages compared with the huge amount of data we deal with nowadays. A demonstration of erroneous bits in data frames that may not be detected by the CRC method will be shown. A corrective method to detect errors when dealing with humongous data transmission will also be given. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|