32-Row Block Code Matrix for Variable-Length Channel Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mobile communication systems, existing channel coding methods for variable-length information bits are inefficient in finding an optimum format for block codes, particularly for (32,A) block codes, as they require checking individual coding performances of various block codes, making it difficult to support variable bit lengths effectively.
Innovation Solution
A method for channel-coding information bits using a code generation matrix with 32 rows and A columns, where additional basis sequences are added to existing matrices to generate codewords with a minimum Hamming distance of 10, allowing for flexible bit lengths by reusing matrices from conventional systems like TFCI and PUCCH, and repeating basis sequences for longer coding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If individual coding performances of various block codes are checked to find an optimum format, then coding performance can be optimized, but the complexity of the coding process increases significantly
Solution Approach 1:
The patent changes the parameter of code format selection from exhaustive checking to direct application of a specific (32,A) block code format. By defining a standardized code structure with 32 rows and A columns where A varies based on information bit length, the system achieves optimal coding performance without the complexity of evaluating multiple code formats.
Solution Approach 2:
The patent creates a universal (32,A) block code that can handle multiple information bit lengths (A=10, 11, 12, 13, 14) using a single code structure. This multi-functional code format eliminates the need to check and switch between different code formats, reducing processing complexity while maintaining optimal performance across variable bit lengths.
2Ease of manufacture
If conventional block codes are used for variable length information, then implementation is straightforward, but the minimum distance between codewords is insufficient
Solution Approach 1:
The patent segments the code structure into 32 rows with A columns, where each column represents a basis sequence. This segmentation allows the code to achieve a minimum distance of 10 by carefully designing the basis sequences, while maintaining ease of implementation through the structured matrix format that can be systematically constructed.
3Ease of operation
If the code structure is fixed for specific bit lengths, then coding is simple, but adaptability to variable bit lengths is poor
Solution Approach 1:
The patent implements a dynamic code structure where the number of columns A can vary (10, 11, 12, 13, 14) based on the information bit length, while maintaining a fixed 32-row structure. This dynamic adaptability allows the same coding methodology to be applied across different bit lengths, achieving both simplicity and versatility.
Solution Approach 2:
The (32,A) block code serves as a universal structure that can encode information bits of varying lengths by adjusting A. The same 32 basis sequences are used across all configurations, making the coding process simple and consistent while adapting to different information bit lengths from 10 to 14 bits.
Data Source
Figure 1
Figure 2
AI summary
A channel coding method of variable length information using block code is disclosed. A method for channel-coding information bits using a code generation matrix including 32 rows and A columns corresponding to length of the information bits includes, channel-coding the information bits having "A" length using basis sequences having 32-bit length corresponding to columns of the code generation matrix, and outputting the channel-coded result as an output sequence. If "A" is higher than 10, the code generation matrix is generated when (A-10) additional basis sequences were added as column-directional sequences to a first or second matrix. The first matrix is a TFCI code generation matrix composed of 32 rows and 10 columns used for TFCI coding. The second matrix is made when at least one of an inter-row location or an inter-column location of the first matrix was changed. The additional basis sequences satisfy a value 10 of a minimum Hamming distance.