MPPM Encoder Coefficient Calculation With Pascal Triangle LUTs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional pulse-position modulation (PPM) encoders face challenges with large block sizes and high pulse counts due to the exponential increase in look-up table (LUT) size, leading to memory and processing power inefficiencies, making it unfeasible for efficient data transmission.
Innovation Solution
The use of Pascal's Triangle and recurrence relations to efficiently calculate coefficients for pulse-position modulation, allowing for quick determination of pulse positions without storing every value in the LUT, thereby reducing memory requirements and enabling efficient data encoding and decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional PPM encoders use large block sizes and high pulse counts, then data encoding capacity increases, but LUT size increases exponentially causing memory and processing power inefficiencies
Solution Approach 1:
The patent segments the LUT into multiple smaller sub-LUTs, each storing coefficients for a specific range of pulse positions. Instead of one large exponential-sized LUT, the system uses multiple manageable sub-LUTs that can be accessed sequentially or in parallel, reducing peak memory requirements while maintaining the ability to encode large block sizes and high pulse counts.
Solution Approach 2:
The patent introduces a new dimension to the LUT structure by organizing coefficients in a hierarchical manner with multiple levels of indexing. The first dimension indexes sub-LUTs based on pulse position ranges, while subsequent dimensions index specific coefficients within each sub-LUT. This multi-dimensional organization allows efficient access to required coefficients without storing all possible combinations in a single flat structure.
2Productivity
If conventional PPM encoders use large block sizes and high pulse counts, then data encoding capacity increases, but processing power requirements increase due to exponential LUT size
Solution Approach 1:
The patent extracts and pre-calculates only the necessary binomial coefficients and stores them in sub-LUTs, rather than computing them on-demand during encoding. By extracting the computationally intensive coefficient calculations and storing results in a structured format, the system reduces real-time processing power requirements while maintaining high encoding capacity for large blocks and pulse counts.
Solution Approach 2:
The patent performs preliminary calculation and storage of binomial coefficients in the sub-LUTs before the actual encoding operation. This preliminary action eliminates the need for complex real-time computations during data encoding, allowing the system to handle large block sizes and high pulse counts with reduced processing power demands during critical encoding operations.
3Quantity of substance
If Pascal's Triangle and recurrence relations are used to calculate coefficients, then memory usage decreases, but calculation complexity increases
Solution Approach 1:
The patent applies local quality by storing pre-calculated coefficients only in the specific regions where they are needed, organized in sub-LUTs. Rather than using a uniform approach of either full pre-computation or full on-demand calculation, the system pre-calculates and stores coefficients locally in sub-LUTs for specific pulse position ranges, reducing overall memory usage while avoiding the complexity of real-time calculations during encoding.
Data Source
AI summary
A method, system, and apparatus for calculating coefficients for inputs and corresponding output sequences for a pulse-position modulation encoder using a stored structure; wherein the structure is a subset of the values of Pascal's Triangle.