M-Algorithm Multiuser Detector with Correlation-Based Pruning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multiuser detection algorithms face computational inefficiencies and impracticality for real-time operation due to high complexity in processing co-channel interfering digital signals, especially in systems with a large number of users or severe intersymbol interference.
Innovation Solution
A multiuser detector system employing correlation-based pruning, which includes a parameter estimation module, an S-matrix module, and a multiuser detector module that processes estimated signature waveforms using an unnormalized cross-correlation matrix to dynamically prune hypotheses based on signal-to-interference ratios (SIR), thereby reducing computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If maximum likelihood detection is used to achieve optimal performance, then detection accuracy is improved, but computational complexity increases making real-time operation impractical
Solution Approach 1:
The patent segments the exhaustive search space of all possible bit sequences into manageable subsets using a tree structure. The detection process is divided into multiple stages where hypotheses are generated and pruned incrementally, rather than evaluating all possibilities simultaneously. This segmentation enables the algorithm to achieve near-maximum likelihood performance with reduced computational complexity by focusing resources on the most promising hypotheses at each stage.
2Productivity
If the number of users or severity of intersymbol interference increases, then system capacity is improved, but computational complexity increases making real-time operation impossible
Solution Approach 1:
The patent implements dynamic hypothesis pruning where the number of hypotheses M is adjusted based on interim metrics calculated at each stage of the decision tree. The algorithm dynamically adapts to the actual interference conditions and signal characteristics encountered during detection, keeping more hypotheses when interference is severe and pruning more aggressively when conditions are favorable. This dynamic approach allows the system to maintain real-time operation while handling varying numbers of users and interference levels.
3Device complexity
If conventional tree-pruning is used to reduce complexity, then computational complexity is reduced, but detection performance degrades as pruning factor M is decreased
Solution Approach 1:
The patent performs preliminary ordering of users based on their signature waveform correlations before the actual detection process. By pre-calculating and sorting users according to their correlation characteristics, the algorithm ensures that the most interfering users are processed first in the decision tree. This preliminary action optimizes the pruning process by ensuring that hypotheses involving highly correlated users are evaluated and pruned more effectively, maintaining detection performance even with reduced M values.
Data Source
AI summary
A multiuser detector system with correlation based pruning including a parameter estimation module adapted to receive complex signals, and to produce estimated signature waveforms for each of K co-channel interfering signals. Pre-processing the estimated signature waveforms using an S-matrix module and producing a more valid set of hypotheses, wherein the S-matrix module uses apriori knowledge of an unnormalized cross correlation matrix, and processing the more valid set of hypotheses for pruning with an M-algorithm in a multiuser detector module. An improvement to the M-algorithm in which the interference structure based on the signal correlation matrix used during the optimization process aids in selecting a better subset of hypotheses to test. This approach has the benefit of reducing computational complexity and improving performance over the existing M-algorithm.