Choose a country or area to see content specific to your location
White Papers
Adding redundancy bits to the transmitted information using an algorithm achieves forward error correction. A redundant bit may be a complex function of many original bits. A simplistic example of FEC is to transmit each data bit three times.
An error in any one of the three samples is corrected by what you could call a “majority vote.” This triple modular redundancy above is widely used, but it is a somewhat inefficient form of FEC. Efficient FEC codes typically examine the last several dozen or several hundred bits received and then determine how to decode a small handful of bits (typically in groups of two to eight bits).
Unlock Content
Sign up for free
*Indicates required field
Thank you.
Your form has been successfully submitted.
Note: Clearing your browser cache will reset your access. To regain access to the content, simply sign up again.
×
Please have a salesperson contact me.
*Indicates required field
Thank you.
A sales representative will contact you soon.