(32,k) Block Coding Matrix for Variable-Length Channel Bits
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mobile communication systems, finding an optimal format for channel-coding variable-length information bits using block codes is challenging due to the need for varying bit lengths, which complicates the search for efficient coding performances.
Innovation Solution
The method involves reusing and modifying existing code generation matrices from conventional systems, such as the (32,10) TFCI code and (20,14) PUCCH code, to generate (32,k) block codes that support variable bit lengths by puncturing or adding columns, thereby increasing the minimum distance between codewords and improving system performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional block codes with fixed lengths are used for channel coding, then the coding structure is simple and implementation is straightforward, but the system cannot efficiently handle variable-length information bits
Solution Approach 1:
The code generation matrix is segmented into multiple columns representing different code rates. By selecting different numbers of columns (k values), the system can accommodate various information bit lengths without changing the overall matrix structure, thus handling variable-length information while maintaining a systematic approach
Solution Approach 2:
A single code generation matrix is designed to serve multiple functions by supporting different code rates (k values from 5 to 14). This universal matrix can be used for various information bit lengths, eliminating the need for multiple separate coding schemes and reducing overall system complexity
2Productivity
If the code rate is increased to improve transmission efficiency, then the throughput increases, but the error correction capability deteriorates
Solution Approach 1:
The code rate is made dynamic by allowing flexible selection of k values (number of information bits) from 5 to 14 within the same code generation matrix framework. This enables the system to adapt the code rate according to channel conditions, achieving both high transmission efficiency when channel quality is good and robust error correction when channel quality is poor
3Reliability
If multiple different block codes are designed for different information bit lengths, then each code can be optimized for its specific length, but the overall system complexity and difficulty in finding optimal formats increase
Solution Approach 1:
Instead of designing multiple separate block codes for different information bit lengths, a single universal code generation matrix is created that can generate codes for any k value from 5 to 14. This approach maintains optimized coding performance for each length while significantly reducing the complexity of managing multiple code formats
Solution Approach 2:
Multiple code generation capabilities are merged into a single code generation matrix. By combining the functionality of what would otherwise be separate codes into one unified structure, the system achieves optimized performance across all information bit lengths without the overhead of maintaining multiple independent code definitions
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.