Hidden-Data Message Verification Using Residual Error Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data communication systems face challenges in verifying the accuracy of data with hidden information, especially when receivers are unaware of the hidden data, leading to difficulties in distinguishing between message errors and incompatible table versions, and requiring dedicated bandwidth for schedule position data, which reduces network efficiency.
Innovation Solution
A method that calculates and compares residual errors in multiple messages to verify accuracy, allowing hidden data to be extracted directly from the message stream without additional paths, using techniques such as CRC and checksum protocols to determine and verify the integrity of data blocks, including hidden data, and employing a testing tool with control circuitry to selectively receive and verify data blocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If hidden data is incorporated into CRC calculation, then data verification capability is improved, but receiver ability to detect errors is worsened when hidden data is unknown
Solution Approach 1:
The patent segments the verification process into two distinct phases: first verifying the CRC checksum to detect transmission errors, and then separately extracting and verifying hidden data such as table version identifiers. This segmentation allows receivers to first ensure data integrity through CRC checking, then proceed to interpret hidden data only when error-free, resolving the contradiction between verification capability and error detection capability.
Solution Approach 2:
The patent applies preliminary error checking before hidden data extraction. By performing CRC verification first and only proceeding to extract hidden data when the CRC check passes, the system ensures that hidden data is only processed from valid, error-free messages. This preliminary action prevents misinterpretation of corrupted hidden data while maintaining the benefits of hidden data incorporation.
2Reliability
If table version is explicitly sent in communication signal, then node synchronization is improved, but bandwidth efficiency is worsened
Solution Approach 1:
The patent merges the table version identifier with the data payload by embedding it as hidden data within the message structure. Instead of allocating separate dedicated bits for table version transmission, the version information is combined with the existing data transmission, allowing receivers to extract the version identifier along with the payload data without requiring additional bandwidth resources.
Solution Approach 2:
The patent makes the data message serve multiple functions simultaneously: it carries both the payload data and the table version identifier as hidden data. This multi-functionality eliminates the need for separate dedicated signaling for version information, as the same communication channel efficiently transports both types of information, thereby improving bandwidth utilization while maintaining synchronization capability.
3Quantity of substance
If hidden data method is used for table identifier, then bandwidth efficiency is improved, but ability to distinguish errors from version incompatibility is worsened
Solution Approach 1:
The patent segments the verification process into distinct stages: first performing CRC error detection on the entire message, and only after successful verification, proceeding to extract and compare table version identifiers. This segmentation allows the system to first rule out transmission errors through CRC checking, then confidently attribute any version mismatches to genuine protocol incompatibilities rather than corrupted data, thereby resolving the ambiguity between errors and version issues.
Solution Approach 2:
The patent introduces CRC verification as an intermediary step between receiving hidden data and interpreting it. This intermediary error-checking mechanism acts as a gatekeeper, ensuring that only error-free messages proceed to hidden data extraction and version comparison. This intermediary process eliminates the ambiguity by providing a clear distinction: messages failing CRC are transmission errors, while messages passing CRC but failing version matching are genuine version incompatibilities.
Data Source
AI summary
A method of verifying the accuracy of blocks of data. In one embodiment, a method of verifying the accuracy of data in a message that includes a checking mechanism with hidden data is provided. The method comprises observing two or more initial messages. Comparing the residual error of each of the observed initial messages. If the residual errors of at least two of the initial messages match each other, storing the matched residual error. For subsequent messages, comparing residual errors of the subsequent messages with the stored matched residual error.