Packet CRC Error Detection Using Segmented Polynomial Division

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current packet-based communication systems face challenges in accurately detecting transmission errors, particularly due to the limitations of cyclic redundancy check (CRC) codes in identifying errors caused by channel-induced alterations during data transmission.

Innovation Solution

The method involves processing data packets by modifying segments, performing polynomial division to determine a remainder sequence, and using a CRC generator polynomial to assess transmission errors, allowing for effective error detection and correction by appending and verifying CRC check sequences.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If serial bit-by-bit computation of remainder sequence is used, then device complexity is reduced, but processing time increases

Engineering Contradiction:
Improvecomplexity of error detection apparatusVSAvoidtime to compute remainder sequence
Core Design Contradiction:
Device complexityVSLoss of time

Solution Approach 1:

The data packet is divided into multiple segments that can be processed in parallel. Each segment is processed by a separate polynomial division unit, allowing simultaneous computation of remainder sequences for multiple segments, thus reducing total processing time while maintaining manageable device complexity through modular architecture

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transitions from sequential one-dimensional processing to parallel multi-dimensional processing by introducing multiple polynomial division units that operate simultaneously on different segments, effectively adding a parallel processing dimension to the computation

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Measurement precision

If polynomial division is performed on entire data packet, then measurement precision of error detection is improved, but device complexity increases

Engineering Contradiction:
Improveaccuracy of error detectionVSAvoidcomplexity of polynomial division apparatus
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The data packet is segmented into multiple smaller portions, each processed by dedicated polynomial division units. This segmentation allows the system to maintain high detection precision through comprehensive polynomial division while managing device complexity through distributed, modular processing units rather than a single complex apparatus

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Multiple polynomial division units are employed that can process different segments simultaneously, providing universal error detection capability across the entire data packet while distributing the computational complexity across multiple standardized modules

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Reliability

If CRC check sequence is appended to each segment, then reliability of error detection is improved, but loss of information increases due to overhead

Engineering Contradiction:
Improvereliability of transmission error detectionVSAvoiddata overhead from CRC sequences
Core Design Contradiction:
ReliabilityVSLoss of information

Solution Approach 1:

The data packet is divided into segments with CRC check sequences appended to each. This segmentation approach improves reliability by enabling localized error detection in each segment while the overall system maintains acceptable data efficiency through controlled segment size and optimized CRC polynomial selection

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS8892983B2Method and apparatus for error detection in a communication system
Publication Date: 2014.11.18 WSOU INVESTMENTS LLC
  • US8892983B2 patent drawing
  • US8892983B2 patent drawing
  • US8892983B2 patent drawing

AI summary

A method processes a data packet in a first sequence of disjoint original segments of the same length. The method includes modifying a first of the original segments of the first sequence by modifying one or more symbols therein. A start of the data packet is located in the first of the original segments and is positioned after a first digital data symbol therein. The method also includes modifying a last of the original segments of the first sequence by modifying one or more digital data symbols therein. An end of the data packet is located in the last of the original segments and is located before the last digital data symbol therein. The method also includes determining a remainder sequence by effectively performing a polynomial division on a second sequence of disjoint segments that are derived from the first sequence. Each segment of the second sequence corresponds to and is derived from one of the original segments of the first sequence. The segments of the second sequence have the length of the original segments of the first sequence. A first of the derived segments of the second sequence is the modified first of the original segments. A last of the derived segments of the second sequence is derived from the modified last of the original segments.