VIDEO
HIGHLIGHT
Log InSign up
Verificación por redundancia cíclica CRC
SummaryTranscriptChat

Verificación por redundancia cíclica CRC

Verificación por Redundancia Cíclica (CRC)

In this section, Alberto Medrano introduces the concept of Cyclic Redundancy Check (CRC) as an error detection code commonly used in digital networks and storage devices.

Introduction to CRC

  • CRC was proposed by Peterson in 1961 and involves a gate for its operations.
  • The output of the computation follows specific patterns based on input values.
  • CRC is effective in detecting errors caused by noise in transmission channels.

Ejemplo de cálculo de CRC

This part delves into a practical example of calculating CRC using a known generator value for both transmitter and receiver devices.

Calculating CRC

  • Add zeros to the data based on the generator polynomial size minus one.
  • Perform polynomial division using XOR gates iteratively.
  • Complete the division process until reaching the base polynomial size of the generator.

Verificación de la Información Recibida

Here, the focus shifts to verifying transmitted data integrity at the receiver end using the known generator value.

Data Verification

  • The receiver compares combined data with residue against the known generator value.
Video description

Una breve descripción como realizar una Verificación por redundancia cíclica (Cyclic redundancy check - CRC), video clase a petición del Prof. Jesús A. Calderón Vielma para la materia Transmisión de Datos en Ambientes Industriales, asignatura del Postgrado de Telecomunicaciones en la Universidad de Los Andes (ULA).