Narrow-Basis Dictionary Selection for Low-Complexity Matching Pursuits
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current matching pursuits dictionaries with wide bases increase computational cost and complexity due to the 'repair' stage in signal compression, where residuals require multiple atoms, leading to inefficiencies in data compression and transmission.
Innovation Solution
A low complexity dictionary with reduced maximum base width, such as 14, is used to minimize computational costs and bit rate, allowing for more efficient inner product calculations and bit rate savings, while maintaining fidelity through a process of selecting optimal bases based on inner product sums and signal-to-noise ratios.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If wide bases are used in matching pursuits dictionaries, then signal representation accuracy is improved, but computational complexity increases
Solution Approach 1:
The patent changes the parameter of base width from wide to narrow (maximum width of 14 samples), fundamentally altering the dictionary structure to reduce computational complexity while maintaining signal representation accuracy through optimized atom selection and iterative refinement processes
2Measurement precision
If wide bases are used in matching pursuits dictionaries, then signal representation accuracy is improved, but bit rate increases
Solution Approach 1:
By changing the base width parameter to a maximum of 14 samples, the patent reduces the number of bits required to represent each atom's position and amplitude, thereby lowering the overall bit rate while maintaining faithful signal representation through the matching pursuits algorithm
3Device complexity
If narrow bases are used in matching pursuits dictionaries, then computational complexity is reduced, but signal representation accuracy deteriorates
Solution Approach 1:
The patent applies preliminary actions by pre-defining a structured dictionary of narrow bases with specific properties (maximum width of 14 samples, organized by frequency and time support), which enables efficient matching pursuits processing while maintaining the ability to accurately represent signals through iterative atom selection and residual minimization
4Reliability
If optimal dictionaries are created using traditional methods, then dictionary quality is improved, but computational time becomes unrealistic
Solution Approach 1:
The patent changes the optimization approach by imposing a maximum base width parameter (14 samples) and using a structured dictionary organization method, which transforms the computationally intractable optimal dictionary creation problem into a feasible process that achieves high-quality dictionaries in practical timeframes
Data Source
AI summary
Embodiments related to utilizing substantially optimal entries for a relatively low complexity dictionary for matching pursuits coding is disclosed. In various embodiments, methods are invoked for determining a substantially optimal entry from a bases dictionary comprising a plurality of entries; and utilizing the substantially optimal entry in a relatively low complexity matching pursuits data coding. In various embodiments, a system is provided comprising a bases dictionary comprising a plurality of entries each with a width of 15 or less; a signal to be coded; and a selection module configured to receive at least one of the plurality of entries from the bases dictionary, to calculate an inner product between the at least one of the plurality of entries and the signal to be coded, and to select the entry from the at least one of the plurality of entries that produces a maximum inner product for use in at least partially coding the signal to be coded. In various embodiments, instructions for the invoked methods are stored in computer-readable media.