CCFI Coding for Non-Integer Lengths in Wireless Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for coding the Control Channel Format Indicator (CCFI) channel are inadequate when the total coded length is not an integer multiple of three, as they rely on (3,2) codewords that are only suitable for integer multiples of three, limiting their applicability.
Innovation Solution
A method involving the concatenation of repeated (3,2) codewords and uncoded CCFI bits is proposed, where a length-3 component codeword is repeated and concatenated with original CCFI bits to generate a longer codeword, allowing for coding when the total length is not an integer multiple of three, and additional codebooks are generated through permutation to optimize resource mapping.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If (3,2) codewords are used for CCFI channel coding, then coding efficiency is improved for integer multiple cases, but the method becomes inapplicable when total coded length is not an integer multiple of three
Solution Approach 1:
The patent segments the CCFI bits into two parts: those that can be fully covered by (3,2) codewords and those that remain as uncoded bits. This segmentation allows the system to handle any total length, whether it is an integer multiple of three or not, by processing the bits in chunks and leaving remainder bits uncoded. The segmentation principle resolves the contradiction by making the coding method adaptable to any length while maintaining efficiency for the codable portion.
Solution Approach 2:
The patent creates a universal coding approach that works for both integer multiple cases (using repeated (3,2) codewords) and non-integer multiple cases (using a combination of repeated codewords and uncoded bits). The same basic mechanism of repeating (3,2) codewords is extended to handle all cases, making the system multi-functional and applicable to any CCFI length without requiring separate methods for different scenarios.
2Reliability
If repeated (3,2) codewords are used, then error correction is improved, but the method fails when total length is not an integer multiple of three
Solution Approach 1:
The patent applies partial action by using repeated (3,2) codewords only for the portion of CCFI bits that can be fully coded, and accepts that some bits will remain uncoded when the total length is not an integer multiple of three. This partial application of coding maintains error correction capability for the coded portion while adapting to the limitation of non-integer lengths, resolving the contradiction between reliability and adaptability.
3Ease of manufacture
If CCFI bits are coded using standard methods, then coding is simplified, but resource utilization is inefficient when total length is not an integer multiple of three
Solution Approach 1:
The patent changes the parameter of coding application from a rigid requirement of integer multiples to a flexible approach that accommodates any length. By adjusting the number of repeated (3,2) codewords based on the actual CCFI length, the system optimizes resource utilization. The parameter change allows the system to use coding resources efficiently for the portion that can be coded while accepting the limitation for remainder bits, resolving the contradiction between simplicity and efficiency.
Data Source
AI summary
A method of transmitting a control channel format indicator (CCFI), also known as PCFICH (Physical Control Format Indicator Channel), in case where the length of a coded CCFI is not an integer multiple of three, including mapping a plurality of two-bit CCFI into a codebook with each component codeword having three bits; generating a sequence of codewords selected from the codebook by repeating the selected component codeword for predetermined times; generating a codeword by concatenating the sequence of the selected component codewords with the original CCFI bits; and transmitting the codeword carrying information of CCFI. The method further includes a step of generating a permutation of each of the four codewords by assigning K repetitions of the three-bit component codeword to the number of K resource units respectively and mapping remaining K bits of each of the four codewords separately to the number of K resource units.