Wireless Node Dynamic RE Allocation for Code Block Sets

The patent implements dynamic resource element set selection by determining the target RE set based on the actual number of bits in the code block set. When the number of bits exceeds a first threshold, the first RE set is selected; when it exceeds a second threshold, the second RE set is selected. This dynamic adaptation resolves the contradiction by making resource allocation flexible rather than fixed, improving utilization efficiency while maintaining manageable complexity through threshold-based decision logic.

The patent changes the parameter of RE set selection based on the number of bits in the code block set. By using the bit count as a determining parameter and comparing it against predefined thresholds, the system selects appropriate RE sets (first or second) to match the actual data volume. This parameter-driven approach improves resource utilization by matching allocation size to actual needs while keeping the allocation mechanism relatively simple.

The patent adjusts the time-frequency resources (RE set size) based on the parameter of code block set bit count. When bits exceed the first threshold, the first RE set is used; when bits exceed the second threshold, the second RE set is used. This parameter-based adaptation ensures sufficient resources for reliable transmission when needed while avoiding resource waste when the data volume is small, thus resolving the contradiction between reliability and resource efficiency.

The patent applies partial resource allocation by selecting different RE sets based on actual needs. Rather than always allocating maximum resources, the system allocates partial resources (first or second RE set) appropriate to the code block size, ensuring adequate transmission reliability while minimizing resource waste through conditional allocation.

The patent implements dynamic RE set selection with multiple configured RE sets (first and second) that are chosen based on the code block set bit count. The system maintains multiple RE sets for flexibility but uses simple threshold comparisons to dynamically select the appropriate one, achieving adaptability while controlling complexity through rule-based selection logic.

The patent segments the resource allocation space into multiple discrete RE sets (first RE set, second RE set) with different sizes. Each RE set is optimized for specific data volume ranges. By segmenting resources and using threshold-based selection, the system achieves flexible adaptation to different code block sizes while maintaining manageable complexity through clear segmentation boundaries.