Codeword Segmentation for Reduced Computational Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for encoding and decoding information signals, such as factorial packing and concatenation codes, face challenges in reducing computational complexity and improving error resilience, particularly due to the sensitivity of bit errors affecting multiple codewords and requiring complex multi-precision operations.
Innovation Solution
The method involves splitting codewords into Most Significant Bits (MSB) and Least Significant Bits (LSB) parts, combining MSBs using short-length operations, and concatenating LSBs to form a multiplexed codeword, which reduces computational complexity and bit-error sensitivity by confining decoding errors to individual codewords.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multi-precision operations are used to combine codewords, then complete information segregation is achieved, but computational complexity increases
Solution Approach 1:
The patent divides codewords into Most Significant Bits (MSB) and Least Significant Bits (LSB) segments. This segmentation allows different parts of the codeword to be processed separately using simpler operations, avoiding the need for complex multi-precision operations while maintaining complete information segregation between different data constituents.
Solution Approach 2:
The patent replaces complex multi-precision arithmetic operations with simpler bitwise operations and concatenation. Instead of using resource-intensive multi-precision multiplication and division, the system uses bit shifting, masking, and concatenation operations that are computationally less demanding while achieving the same information segregation goal.
2Loss of information
If conventional encoding methods are used, then information is fully represented, but bit errors affect multiple codewords
Solution Approach 1:
By segmenting codewords into MSB and LSB parts and using concatenation to combine them, the patent ensures that bit errors are confined to specific segments rather than propagating across multiple codewords. This segmentation strategy maintains complete information representation while improving error resilience through localized error containment.
Solution Approach 2:
The patent applies different processing strategies to different parts of the codeword structure. MSB parts are handled with one approach while LSB parts are handled with another, allowing each segment to be optimized for its specific function. This local quality approach ensures that errors in one segment do not compromise the integrity of other segments.
3Loss of information
If addition and multiplication functions are used to combine codewords, then complete codeword formation is achieved, but information segregation decreases
Solution Approach 1:
The patent substitutes arithmetic operations (addition and multiplication) with logical and bitwise operations (concatenation, bit shifting, masking). These alternative operations achieve complete codeword formation while preserving information segregation, as they do not cause the mixing of information that occurs with arithmetic combinations.
Solution Approach 2:
The patent uses concatenation to combine codeword segments, which essentially creates a structured copy arrangement where each segment maintains its identity and position. This copying approach through concatenation ensures complete codeword formation while maintaining clear boundaries that preserve information segregation between different data constituents.
Data Source
AI summary
A system (100) and method (200) of combining codewords is provided. The system can include a splitter (120) for splitting a first codeword (110) into a most significant bits part MSP (112) and a least significant bits part LSP (114), a combiner (130) for combining the MSP of the first codeword with a second codeword to produce a first group (132), and a concatenator (140) for concatenating the first group with the LSP to produce a second group (134), and multiplexing the first group with the second group to produce a multiplexed codeword (150). Bit-errors in the LSP correspond to decoding errors only in a codeword associated with the LSP, and not to decoding errors in other codewords.