Detection of Errors in Digital Systems
In Detection of Errors in Digital Systems, you'll learn ...
- How errors are introduced in data transmission and retrieval
- The basic approach of error detection and correction
- The purpose and function of a parity bit
- Checksum and cyclic redundancy check (CRC) methods
- How a cryptographic hash function works and when it should be employed
We are exposed to a lot of information every day, from viewing content on a website on the Internet to listening to a song on our smart phone. This information (or data) is constantly stored, transmitted and processed. It is important that the data is correct or relatively error-free. Some amount of error is acceptable, depending on the application. For example, a few bit errors in a music data file in an MP3 format are acceptable, but a few bit errors in the data being transferred to the flight controls of a rocket could be catastrophic.
Information theory is a branch of applied mathematics and electrical engineering involving the quantification of information. When Claude Shannon developed information theory in 1948, thus ushering in the information age, he introduced the concept of entropy to information. This entropy or shortage of information in a message is what gives rise to errors in the data. Most communication systems and data storage and processing systems are unreliable to some degree, which means that errors may be introduced in the communications channel or while retrieving data from a memory device. These errors must be controlled.
The purpose of this course is to describe four different error detection techniques and to discuss the advantages and disadvantages of each. This course describes the parity check method as well as the checksum and cyclic redundancy check (CRC) methods. It describes hash functions and when they should be employed. The course also briefly discusses error correction techniques.
Specific Knowledge or Skill Obtained
This course teaches the following specific knowledge and skills:
- Four different error detection techniques
- How to compute odd parity and even parity for a sequence of bits
- How to compute a checksum for a given block of data
- How to compute a CRC for a given block of data
- The benefits and drawbacks of a parity check, checksum and CRC
- How a cryptographic hash function is used to ensure the integrity of a software program or electronic document
Certificate of Completion
You will be able to immediately print a certificate of completion after passing a multiple-choice quiz consisting of 15 questions. PDH credits are not awarded until the course is completed and quiz is passed.
|This course is applicable to professional engineers in:|
|Alabama (P.E.)||Alaska (P.E.)||Arkansas (P.E.)|
|Delaware (P.E.)||Florida (P.E. Area of Practice)||Georgia (P.E.)|
|Idaho (P.E.)||Illinois (P.E.)||Illinois (S.E.)|
|Indiana (P.E.)||Iowa (P.E.)||Kansas (P.E.)|
|Kentucky (P.E.)||Louisiana (P.E.)||Maine (P.E.)|
|Maryland (P.E.)||Michigan (P.E.)||Minnesota (P.E.)|
|Mississippi (P.E.)||Missouri (P.E.)||Montana (P.E.)|
|Nebraska (P.E.)||Nevada (P.E.)||New Hampshire (P.E.)|
|New Jersey (P.E.)||New Mexico (P.E.)||New York (P.E.)|
|North Carolina (P.E.)||North Dakota (P.E.)||Ohio (P.E. Self-Paced)|
|Oklahoma (P.E.)||Oregon (P.E.)||Pennsylvania (P.E.)|
|South Carolina (P.E.)||South Dakota (P.E.)||Tennessee (P.E.)|
|Texas (P.E.)||Utah (P.E.)||Vermont (P.E.)|
|Virginia (P.E.)||West Virginia (P.E.)||Wisconsin (P.E.)|