Reduced-State Soft Output Decoding for Candidate Path Pruning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Soft output viterbi algorithms (SOVA) in communication channels require extensive processing of candidate sequences, which can be computationally intensive and inefficient, particularly in reducing error events and determining the most likely path in data transmission.
Innovation Solution
A channel detector with a path generator, state reducer, and branch metric calculator is used to produce candidate sequences, compare and reduce them based on reliability information, and perform branch metric calculations to select the most likely path, thereby reducing processing complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If SOVA processes all candidate sequences to determine the most likely path, then reliability of data transmission is improved, but processing complexity and computational load increase
Solution Approach 1:
The patent segments the candidate sequences into multiple groups based on their metric values. Instead of processing all sequences uniformly, the system divides them into a first plurality and a second plurality, applying different processing strategies to each group. This segmentation allows the system to maintain reliability by thoroughly processing high-priority sequences while reducing complexity by applying simplified processing to lower-priority sequences.
Solution Approach 2:
The patent applies different processing qualities to different candidate sequences based on their individual characteristics. High-priority sequences receive full, rigorous processing to ensure accuracy, while low-priority sequences receive reduced processing. This local differentiation of processing quality maintains overall system reliability while significantly reducing total computational complexity.
2Measurement precision
If SOVA processes all candidate sequences, then accuracy in identifying the most likely path is improved, but processing time increases
Solution Approach 1:
The patent performs preliminary sorting and grouping of candidate sequences based on their metric values before the main processing stage. By pre-organizing sequences into priority groups, the system can quickly identify which sequences require full processing and which can be processed more simply. This preliminary action reduces processing time while maintaining accuracy for the most critical sequences.
Solution Approach 2:
The patent applies partial processing to certain candidate sequences based on their priority level. Instead of applying the same exhaustive processing to all sequences, the system performs full processing only on high-priority sequences while using reduced processing for lower-priority ones. This partial action approach maintains path identification accuracy for critical sequences while significantly reducing overall processing time.
3Productivity
If the number of candidate sequences is reduced, then processing efficiency is improved, but risk of eliminating the correct path increases
Solution Approach 1:
The patent changes the processing parameters (such as metric thresholds and processing depth) based on the priority grouping of candidate sequences. High-priority sequences are processed with stringent parameters to ensure reliability, while low-priority sequences use relaxed parameters to improve efficiency. This parameter adaptation allows the system to maintain reliability for critical paths while achieving high processing efficiency overall.
Data Source
AI summary
Devices, methods, and systems of a communications channel detector are disclosed that can compare a plurality of candidate sequences of bits and decisions to identify unlikely error events. The detector may then discard at least one candidate sequence based on an unlikely error event to produce a set of remaining paths. A branch metric calculator may be adapted to calculate metrics for a set of remaining paths.