Iterative Data Symbol Sequence Detection in Time-Varying Channels
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for detecting data symbol sequences in time-variable transmission channels are computationally intensive and introduce additional interference, especially when using maximum likelihood methods, which struggle with real-time estimation due to the complexity of trellis diagrams and the need for frequent channel impulse response estimation.
Innovation Solution
A method that iteratively calculates the path metric and channel impulse response, reducing the number of estimates required and using recursive calculations with a priori and a posteriori errors to simplify the trellis diagram analysis, allowing for both breadth-first and depth-first search approaches to optimize data symbol sequence estimation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If maximum likelihood methods are used for detecting data symbol sequences, then detection accuracy is improved, but computational complexity increases significantly
Solution Approach 1:
The patent segments the channel impulse response estimation into multiple discrete time points within a symbol period. Instead of estimating the impulse response continuously or at a single point, the method divides it into N time points (h(0), h(1), ..., h(N-1)), allowing selective processing and reducing the overall computational burden while maintaining detection accuracy through the iterative Viterbi algorithm.
Solution Approach 2:
The patent implements a dynamic approach by iteratively updating the channel impulse response estimates within the Viterbi algorithm. The impulse response is not fixed but is continuously refined through N time points, with each iteration providing updated estimates that improve subsequent detection decisions. This dynamic estimation adapts to channel variations without requiring full maximum likelihood computation.
2Measurement precision
If the number of channel impulse response estimates is increased to improve detection accuracy, then measurement precision is improved, but processing time increases
Solution Approach 1:
The patent applies periodic action by evaluating the channel impulse response at N discrete time points within each symbol period rather than continuously. This periodic sampling approach (at times t=0, 1, 2, ..., N-1) captures the essential channel characteristics while avoiding the computational burden of continuous estimation, thus reducing processing time while maintaining adequate estimation accuracy.
Solution Approach 2:
The patent uses partial action by selecting a limited number of critical time points (N points) for impulse response estimation rather than estimating at every possible time instant. This partial sampling provides sufficient information for accurate detection without the excessive computational effort of complete continuous estimation, achieving an optimal balance between accuracy and processing time.
3Device complexity
If trellis diagram states are reduced to lower computational complexity, then device complexity is reduced, but detection accuracy deteriorates
Solution Approach 1:
The patent performs preliminary action by pre-calculating and storing the channel impulse response estimates at N time points before executing the Viterbi algorithm. This preliminary estimation prepares the necessary data structures and metric values in advance, allowing the subsequent detection phase to proceed with reduced real-time computational complexity while maintaining full detection accuracy through the use of these pre-computed estimates.
Data Source
AI summary
The invention relates to a method and to a device for detecting several data symbol sequences (d 1