Iterative Decoder Buffering With Confidence-Based Early Stopping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing iterative decoders in digital communication systems face challenges in increasing decoding throughput without significantly increasing power consumption and design complexity, as higher iteration numbers improve accuracy but burden computational resources.

Innovation Solution

A high-speed decoder with a buffer system that processes Q encoded data frames, generating confidence results and stopping decoding after a predetermined number of iterations, operates at a clock frequency based on average iterations needed for a target confidence level, and includes a second buffer for decoded frames, compatible with various communication standards.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the number of decoding iterations is increased to improve decoding accuracy and reduce bit error rate, then decoding throughput is improved, but computational burden, power consumption, and design complexity increase

Engineering Contradiction:
Improvedecoding accuracyVSAvoidcomputational burden
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent implements dynamic iteration control where the number of decoding iterations is adjusted based on confidence levels rather than using a fixed high iteration count. The decoder monitors confidence metrics during decoding and terminates early when sufficient accuracy is achieved, making the iteration process adaptive and condition-dependent rather than static and uniform.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of iteration count from a fixed high value to a variable parameter that depends on confidence level thresholds. By dynamically adjusting the number of iterations based on measured confidence metrics, the system achieves high decoding accuracy only when necessary, reducing overall computational burden while maintaining reliability.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If the number of decoding iterations is increased to reduce bit error rate, then decoding accuracy is improved, but power consumption increases

Engineering Contradiction:
Improvebit error rateVSAvoidpower consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent implements dynamic iteration control where the number of decoding iterations is adjusted based on confidence levels rather than using a fixed high iteration count. The decoder monitors confidence metrics during decoding and terminates early when sufficient accuracy is achieved, making the iteration process adaptive and condition-dependent rather than static and uniform.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of iteration count from a fixed high value to a variable parameter that depends on confidence level thresholds. By dynamically adjusting the number of iterations based on measured confidence metrics, the system achieves high decoding accuracy only when necessary, reducing overall computational burden while maintaining reliability.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If the number of decoding iterations is increased to improve decoding accuracy, then bit error rate is reduced, but design complexity increases

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

Solution Approach 1:

The patent implements dynamic iteration control where the number of decoding iterations is adjusted based on confidence levels rather than using a fixed high iteration count. The decoder monitors confidence metrics during decoding and terminates early when sufficient accuracy is achieved, making the iteration process adaptive and condition-dependent rather than static and uniform.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of iteration count from a fixed high value to a variable parameter that depends on confidence level thresholds. By dynamically adjusting the number of iterations based on measured confidence metrics, the system achieves high decoding accuracy only when necessary, reducing overall computational burden while maintaining reliability.

Inventive Principle:
Principle #35Parameter changes

4Productivity

If clock frequency is increased to maintain decoding throughput with higher iterations, then decoding throughput is maintained, but power consumption and design complexity increase

Engineering Contradiction:
Improvedecoding throughputVSAvoiddesign complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent implements dynamic iteration control where the number of decoding iterations is adjusted based on confidence levels rather than using a fixed high iteration count. The decoder monitors confidence metrics during decoding and terminates early when sufficient accuracy is achieved, making the iteration process adaptive and condition-dependent rather than static and uniform.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of iteration count from a fixed high value to a variable parameter that depends on confidence level thresholds. By dynamically adjusting the number of iterations based on measured confidence metrics, the system achieves high decoding accuracy only when necessary, reducing overall computational burden while maintaining reliability.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS7577892B1High speed iterative decoder
Publication Date: 2009.08.18 MARVELL ASIA PTE LTD
  • US7577892B1 patent drawing
  • US7577892B1 patent drawing
  • US7577892B1 patent drawing

AI summary

A high-speed decoder includes a buffer that includes buffer space for Q encoded data frames, where Q is a rational number greater than or equal to two. An iterative decoder receives the data frames from the buffer, generates a confidence result with each decoding iteration, and completes decoding a data frame when at least one of the number of iterations reaches a predetermined maximum number of iterations and the confidence result is greater than or equal to a predetermined confidence level. The iterative decoder stops decoding the Q data frames after a predetermined total number of iterations that is less than Q times the predetermined maximum number of iterations.