Fixed Codebook Pulse Position Search Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional pulse position search methods in codebooks face challenges in reducing calculation complexity as the number of pulses increases, leading to performance deterioration.
Innovation Solution
A pulse position searching apparatus and method that employs a sequential optimization approach, using multiple searching sections to perform preliminary selections and searches across candidate groups, reducing the number of calculations required without compromising coding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional multiplexed loop search is used, then coding performance is maintained, but calculation complexity increases significantly as the number of pulses increases
Solution Approach 1:
The patent divides the codebook search process into multiple stages: preliminary selection stage and final search stage. In the preliminary selection stage, a reduced set of candidate positions is identified using simplified calculations. In the final search stage, the multiplexed loop search is applied only to these pre-selected candidates. This segmentation reduces the overall calculation complexity while maintaining coding performance by limiting the expensive multiplexed loop operations to a smaller search space.
Solution Approach 2:
The patent performs preliminary selection of candidate pulse positions before executing the full multiplexed loop search. This preliminary action identifies a reduced set of promising candidates based on initial evaluation criteria, thereby reducing the number of positions that require computationally intensive multiplexed loop processing. This approach maintains coding performance by ensuring the true optimum remains in the candidate set while significantly reducing calculation complexity.
2Measurement precision
If the number of pulses in fixed codebook increases, then coding performance improves, but the amount of calculation increases exponentially
Solution Approach 1:
The patent segments the pulse position search into two distinct phases: a preliminary selection phase that rapidly filters candidate positions, and a final optimization phase that performs detailed search only on pre-selected candidates. This segmentation allows the system to handle increased numbers of pulses without exponential calculation growth, as the expensive operations are confined to a reduced search space while still evaluating sufficient candidates to maintain coding performance.
Solution Approach 2:
The patent performs preliminary selection of candidate positions using computationally efficient criteria before applying the full search algorithm. This preliminary action reduces the effective search space size, allowing the system to accommodate more pulses in the fixed codebook while keeping the actual computational burden manageable. The preliminary selection ensures that enough candidates are evaluated to maintain coding performance without requiring exhaustive search of all possible positions.
Data Source
AI summary
A pulse location search device (400) is equipped with: a first search unit (401) that obtains a first location where a first pulse is located by conducting a first preliminary selection with respect to a first candidate group, and conducting a first search; a second search unit (402) that obtains a second location where a second pulse is located by using the first location and conducting a second search with respect to all of the location candidates of a second candidate group of locations where the second pulse is located; and a third search unit (403) that obtains a third location where the first pulse is located by using the second location and conducting a second preliminary selection with respect to the first candidate group, and conducting a third search with respect to the result of the second preliminary selection.