Hybrid Codec Finite-Field Encoding for Reliable Data Transfer

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data transferring techniques face challenges in ensuring reliable decoding of source files due to linear dependency issues in encoded data, leading to increased transmission costs and computational complexity, especially when using smaller finite fields.

Innovation Solution

A hybrid codec apparatus and method that divides a source file into segments, encoding them in a smaller finite field for main data and a larger finite field for additional data, allowing decoding in the smaller field initially and using the larger field's data for assistance when necessary, thereby eliminating linear dependencies and optimizing computation and transmission.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of substance

If encoded data is transmitted using a smaller finite field, then transmission overhead is reduced, but linear dependency issues increase leading to decoding failures

Engineering Contradiction:
Improvetransmission overheadVSAvoiddecoding reliability
Core Design Contradiction:
Loss of substanceVSReliability

Solution Approach 1:

The patent uses a composite encoding scheme combining two different finite fields (GF(2) and GF(2^8)) to create encoded data packets. Some packets are encoded in GF(2) while others are encoded in GF(2^8), creating a diverse set of encoded representations that are more resistant to linear dependency issues while maintaining efficient transmission.

Inventive Principle:
Principle #40Composite materials

Solution Approach 2:

The patent changes the finite field parameter (from GF(2) to GF(2^8)) for different encoded packets to eliminate linear dependency. By varying the encoding field parameter, the system ensures that encoded packets from different fields cannot be linearly combined to produce invalid results, thereby improving decoding reliability.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If encoded data is transmitted using a larger finite field, then linear dependency issues are reduced, but computational complexity increases

Engineering Contradiction:
Improvedecoding reliabilityVSAvoidcomputational complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies different finite field encodings to different portions or types of encoded packets rather than uniformly applying a large finite field to all data. This local differentiation allows the system to use computationally intensive GF(2^8) encoding only where necessary to break linear dependencies, while using simpler GF(2) encoding for other packets.

Inventive Principle:
Principle #3Local quality

3Reliability

If additional encoded data packets are transmitted to compensate for linear dependency, then decoding reliability improves, but transmission overhead increases

Engineering Contradiction:
Improvedecoding reliabilityVSAvoidtransmission overhead
Core Design Contradiction:
ReliabilityVSLoss of substance

Solution Approach 1:

The patent transmits a mixture of encoded packets from two finite fields, where the proportion of GF(2^8) encoded packets is optimized to provide sufficient protection against linear dependency without over-transmitting. This partial application of the more robust encoding scheme achieves the necessary reliability improvement while minimizing the increase in transmission overhead.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS8719657B2Hybrid codec apparatus and method for data transferring
Publication Date: 2014.05.06 IND TECH RES INST
  • US8719657B2 patent drawing
  • US8719657B2 patent drawing
  • US8719657B2 patent drawing

AI summary

In a hybrid codec apparatus for data broadcasting, an encoder divides a source file into N sections, generates N principal encoded data after coding on a first finite field and k additional encoded data after coding on a second finite field, then transmits a group of coefficient encoded data and the N+k encoded data to a decoder. The decoder merges the group of coefficient encoded data and the N+k encoded data, and decodes the N principal encoded data on the first finite field. When the decoder fails to decode the N principal encoded data, the decoder uses the k additional encoded data to assist the data decoding on the second finite field. After the decoding, a recovered source file is produced.