CORESET Block Interleaving With Fewer Null Entries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current block interleaving solutions for wireless communication, particularly in New Radio (NR) systems, face inefficiencies due to the need for dummy entries and complex computations, especially when the condition CR=NREGCORESET/L is not met, leading to suboptimal performance in generating and decomposing interleaver sequences.
Innovation Solution
A method for generating and decomposing interleaver sequences for control resource sets in NR systems, which involves determining and minimizing the number of null entries in the interleaving matrix, allowing for efficient interleaving operations by selecting the number of rows such that the number of null entries does not exceed the number of columns, and using specific formulas to compute the interleaving sequences, such as f(j) = g((j+nshift) mod (NREGCORESET/L)) to optimize the interleaving process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional block interleaving methods are used in NR systems, then control resource set configuration can be achieved, but computational complexity increases and efficiency decreases due to dummy entries and complex computations
Solution Approach 1:
The patent extracts and eliminates the dummy entries from the interleaving matrix by optimizing the relationship between the number of rows (R), columns (C), and total resource element groups (N). By ensuring that R×C exactly equals N through proper selection of R and C values, the system removes the need for dummy entries that caused computational overhead in traditional methods.
Solution Approach 2:
The patent changes the parameters of the interleaving matrix by introducing specific constraints on the number of rows and columns. The method selects R and C such that they are factors of N and satisfy additional conditions (R ≤ N/2, C ≤ N/2), which optimizes the interleaving process and eliminates the need for complex dummy entry handling.
2Adaptability or versatility
If the condition CR=NREGCORESET/L is not met in traditional interleaving, then flexibility in configuration is maintained, but the interleaving process becomes suboptimal requiring dummy entries
Solution Approach 1:
The patent introduces dynamic parameter selection where the number of rows (R) and columns (C) are chosen based on the specific values of N (total REGs), L (REG bundle size), and the desired aggregation level. This dynamic approach allows the system to adapt to different configurations while maintaining optimal interleaving performance without requiring dummy entries.
Solution Approach 2:
The patent performs preliminary selection of R and C values before the interleaving process begins. By pre-determining the matrix dimensions to satisfy the conditions (R×C=N, R≤N/2, C≤N/2, and both being factors of N), the system prepares an optimal interleaving structure in advance, eliminating the need for subsequent dummy entry additions and improving overall performance.
Data Source
AI summary
Apparatuses and methods are disclosed for block interleaving. In one embodiment, a method includes generating an interleaver sequence for a control resource set, CORESET, configuration for a physical downlink control channel, the interleaver sequence associated with an interleaving matrix; optionally, for each one of an allowed value of number of rows for the interleaving matrix, determining a number of null entries to be added to the interleaving matrix; and selecting a number of rows, R, for the interleaving matrix such that the number of null entries to be added to the interleaving matrix is: no more than a number of columns, C, of the interleaving matrix; and optionally, the smallest among the numbers of null entries determined for each of the allowed values of number of rows for the interleaving matrix. In another embodiment, a method includes decomposing the interleaver sequence.