Broadcast Data Packet Encoding for Faster Error Recovery

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In broadcast networks, existing data transmission mechanisms like DSMCC are inefficient as they require receivers to wait for complete retransmission of modules in case of errors, leading to increased time for data correctness and completeness, especially for application program files where minor errors can prevent execution.

Innovation Solution

A method involving data segmentation into blocks and encoding using a coefficient matrix to generate encoded data modules, allowing receivers to reconstruct data from any N or more of the transmitted packages, reducing the time required for complete data reception while maintaining correctness, using matrix transformation and Galois Field theory.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If DSMCC transmission mechanism is used to transmit data modules in broadcast networks, then data can be transmitted in a uni-direction cyclic manner, but the receiver must wait for complete retransmission of modules in case of errors, increasing the time for data correctness and completeness

Engineering Contradiction:
Improvedata correctnessVSAvoiddata reception time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The original data is divided into N data blocks, and through matrix encoding, M encoded data blocks are generated where M > N. This segmentation allows the receiver to reconstruct original data from any N blocks out of M received blocks, eliminating the need to wait for complete retransmission and significantly reducing data reception time while maintaining reliability

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transforms the transmission parameter from traditional modular transmission to matrix-encoded block transmission. By changing the encoding parameter from simple modular segmentation to matrix multiplication with full column rank, the system enables flexible reconstruction where any N blocks can recover the original data, resolving the contradiction between reliability and time efficiency

Inventive Principle:
Principle #35Parameter changes

2Ease of manufacture

If traditional modular transmission is used, then the transmission mechanism is simple and compatible with existing systems, but the receiver cannot request retransmission in a uni-direction broadcast network, requiring waiting for next transmission cycle

Engineering Contradiction:
Improvesystem compatibilityVSAvoiddata transmission efficiency
Core Design Contradiction:
Ease of manufactureVSProductivity

Solution Approach 1:

The matrix encoding scheme is designed to be universally compatible with existing DSMCC systems. The encoded data blocks can be transmitted through the same broadcast network infrastructure, maintaining system compatibility while adding the functionality of efficient error recovery that eliminates the need for retransmission requests

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

Solution Approach 2:

The patent performs preliminary matrix encoding at the transmitter side before transmission, creating M encoded blocks from N original blocks. This preliminary action ensures that sufficient redundant information is prepared in advance, allowing the receiver to immediately reconstruct data from any N received blocks without waiting for retransmission, thus improving productivity

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS8179919B2Method and apparatus for data package in broadcast networks
Publication Date: 2012.05.15 IND TECH RES INST
  • US8179919B2 patent drawing
  • US8179919B2 patent drawing
  • US8179919B2 patent drawing

AI summary

Disclosed relates to a method and apparatus for data transmission in broadcast networks, in which N×K pieces of inputted application data are segmented into a matrix BN×K formed by N blocks B1-BN. Each of N blocks contains K pieces of application data, and both N and K are greater than 1. A matrix CM×N with full column rank N is selected, where M≧N. After that, an encoded data module consisting of M row matrix E1-EM is generated by performing a matrix multiplication on CM×N and BN×K. Then, for each I, 1≦I≦M, two row matrixes CI and EI are packaged, and all of the M packaged data (CI, EI) are sent out.