Excitation Pulse Coding Using Distribution Identifiers to Cut Bit Redundancy
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing algebraic codebook pulse coding methods in vector coding technology face inefficiencies due to increased bits required for encoding multiple pulses, leading to redundancy and waste of coding bits, especially as the number of coding pulses on a track increases.
Innovation Solution
A coding method that breaks down multiple pulses into fewer pulses, using a distribution identifier to simplify the coding index and reduce redundancy, thereby minimizing the number of bits required for encoding and improving coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the number of coding pulses on a track increases, then the coding capability is improved, but the number of bits required for encoding increases and coding redundancy increases
Solution Approach 1:
The patent segments the coding process by dividing pulses into different groups based on their positions on the track. Instead of encoding all pulses uniformly, it separates them into segments (e.g., first group and second group) with different encoding schemes. This segmentation allows the system to handle multiple pulses efficiently without linearly increasing the total bit requirement, as each segment can be encoded with optimized bit allocation.
Solution Approach 2:
The patent introduces a new dimension to the coding scheme by utilizing the spatial distribution of pulses along the track as an additional coding parameter. By encoding pulse positions in a multi-dimensional space (combining position indices with group identifiers), the system can represent more pulse configurations without proportionally increasing the total bit count, effectively moving from a one-dimensional to a multi-dimensional coding approach.
2Adaptability or versatility
If the number of coding pulses on a track increases, then the coding capability is improved, but coding redundancy increases causing waste of coding bits
Solution Approach 1:
The patent applies local quality by using different encoding strategies for different regions or groups of pulses on the track. Instead of a uniform encoding scheme, it tailors the coding approach to local characteristics - for example, using fewer bits for pulses in less critical positions or groups, and more bits for pulses in critical positions. This local optimization reduces overall coding redundancy while maintaining necessary coding capability.
Solution Approach 2:
The patent dynamically changes coding parameters based on the pulse configuration. By adjusting the number of bits allocated to different pulse groups according to their positions and importance, the system can adapt the coding scheme to minimize redundancy. This parameter change approach allows the encoder to optimize bit allocation in real-time, reducing waste while preserving essential information.
3Ease of operation
If a recursion-like coding method is applied to break down coding pulses, then the coding process becomes more manageable, but the coding process becomes more complex
Solution Approach 1:
The patent performs preliminary actions by pre-defining pulse groups and their encoding schemes before the actual coding process. Instead of using complex recursive breakdown during encoding, it establishes the grouping structure and encoding rules in advance. This preliminary organization simplifies the actual coding operation, as the encoder only needs to follow predetermined rules rather than performing complex recursive analysis in real-time.
Solution Approach 2:
The patent uses copying by creating standardized encoding templates for different pulse groups. Once an encoding scheme is developed for a particular group configuration, it can be copied and applied to similar configurations, reducing the need for complex recursive processing. This template-based approach maintains manageability while reducing overall process complexity through repetition of proven encoding patterns.
Data Source
Figure 1~3
Figure 4
Figure 5
AI summary
A coding method, a decoding method, a coder, and a decoder are disclosed herein. A coding method includes: obtaining pulse distribution about how all the pulses to be encoded on a track are distributed on the track; determining a distribution identifier for identifying the pulse distribution according to the pulse distribution; and generating a coding index that carries the distribution identifier. A decoding method includes: receiving a coding index; extracting the distribution identifier from the coding index, where the distribution identifier identifies the pulse distribution about how all the pulses encoded on a track are distributed on the track; determining the pulse distribution about how all the pulses encoded on a track are distributed on the track according to the distribution identifier; and reconstructing the pulse order on the track according to the pulse distribution.