Bitstream Decoder Using Shift-XOR Polynomial Recovery

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In data communication, descrambling an unknown bitstream is challenging because the generator polynomial used for scrambling is not known, preventing effective data decoding.

Innovation Solution

A data decoding apparatus and method that derive a generator polynomial by performing bit shifts and exclusive OR operations on the bit signal to generate operation streams, allowing for the removal of spreading codes and data, and then using these streams to calculate a generator polynomial capable of decoding the data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the generator polynomial is unknown in an unknown bitstream, then descrambling cannot be performed, but estimating the generator polynomial requires complex operations

Engineering Contradiction:
Improvedata decoding capabilityVSAvoidpolynomial estimation complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the polynomial estimation process into multiple operational streams. The bit signal is divided into first operation stream (after first bit shift), second operation stream (after removing spreading code), third operation stream (after second bit shift), and fourth operation stream (after removing data). This segmentation allows systematic derivation of the generator polynomial from different stages of the encoding process, making the complex estimation task manageable and reliable

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary actions by pre-calculating multiple operation streams before final polynomial determination. The first operation stream is generated by shifting the bit signal, the second operation stream removes the spreading code in advance, the third operation stream performs another shift, and the fourth operation stream removes the data. These preliminary streams are prepared beforehand to facilitate accurate generator polynomial derivation without waiting for iterative trial-and-error

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If multiple operation streams are generated to derive the generator polynomial, then accurate decoding is achieved, but the processing time increases

Engineering Contradiction:
Improvegenerator polynomial accuracyVSAvoiddecoding processing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent implements self-service by enabling the decoding apparatus to automatically derive the generator polynomial from the unknown bitstream itself without requiring external reference information or manual intervention. The system uses its own received bit signal to generate all necessary operation streams (first through fourth streams) and independently determines the generator polynomial, making the process self-sufficient and eliminating time-consuming external coordination

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11146292B2Data decoding apparatus and method
Publication Date: 2021.10.12 AGENCY FOR DEFENSE DEV
  • US11146292B2 patent drawing
  • US11146292B2 patent drawing

AI summary

A data decoder includes a communication unit receiving a bit signal with encoded data; a first operation unit that bit shifts the bit signal by a first length, corresponding to a length of a spreading code used to encode the data, to generate a first operation stream; a second operation unit generating a second operation stream without the spreading code; a third operation unit that bit shifts the second operation stream by a second length to generate a third operation stream; a fourth operation unit generating a fourth operation stream from which the data is removed using the second operation stream and the third operation stream; and a polynomial generator that decodes the encoded data using the fourth operation stream.