NB-IoT UE Scheduling via Lookup Tables

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The existing NB-IoT scheduling methods are inefficient, particularly for low-cost and low-power-consumption user equipment (UE), as they require extensive calculations within a limited time frame to determine available subframes for NPDCCH, leading to heavy computational loads and memory usage challenges.

Innovation Solution

A scheduling method that involves synchronizing with a cell, receiving system information parameters, establishing sub-lists based on system information distributions, assigning sub-list codes, calculating the total number of elements, and creating a list with indexed available subframes to directly identify NPDCCH candidate subframes, reducing the need for iterative checks and optimizing memory usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If conventional NB-IoT scheduling methods are used to determine available subframes for NPDCCH, then scheduling accuracy is maintained, but computational load and memory usage increase significantly for low-cost UE

Engineering Contradiction:
Improvescheduling accuracyVSAvoidcomputational load
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent pre-calculates and stores the mapping relationships between subframe indices and NPDCCH candidate subframes in lookup tables during system initialization. This preliminary action eliminates the need for complex real-time iterative calculations, reducing computational load while maintaining scheduling accuracy. The lookup tables contain pre-determined available subframe information that can be directly queried during operation.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates simplified copy representations of the scheduling information through lookup tables that store essential mapping relationships. Instead of performing complete iterative subframe checks, the UE queries pre-stored copy data structures that replicate the scheduling decisions, significantly reducing computational complexity while preserving the essential scheduling functionality.

Inventive Principle:
Principle #26Copying

2Measurement precision

If iterative subframe checks are performed to identify NPDCCH candidate subframes, then scheduling precision is maintained, but the time required to complete calculations exceeds the limited subframe time frame

Engineering Contradiction:
Improvescheduling precisionVSAvoidcalculation time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent performs the time-consuming subframe identification and validation processes during system initialization, pre-calculating which subframes are available for NPDCCH transmission. These results are stored in lookup tables that can be queried in constant time during actual operation, eliminating the need for iterative checks during the limited subframe time frame while maintaining scheduling precision.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent replaces the mechanical iterative checking process with a direct table lookup operation. Instead of sequentially examining and validating each subframe through complex iterative algorithms, the system substitutes this mechanical process with a simple memory access operation that retrieves pre-computed scheduling information, dramatically reducing calculation time.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Measurement precision

If extensive iterative calculations are performed to determine NPDCCH subframes, then scheduling accuracy is maintained, but memory usage increases for low-cost UE

Engineering Contradiction:
Improvescheduling accuracyVSAvoidmemory usage
Core Design Contradiction:
Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential scheduling information needed for NPDCCH subframe identification and stores it in compact lookup tables. By taking out only the critical mapping relationships between subframe indices and available NPDCCH candidates, the system maintains scheduling accuracy while using minimal memory resources suitable for low-cost UE with limited memory capacity.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent segments the scheduling information into structured lookup tables that organize available subframe data by subframe index and NPDCCH candidate relationships. This segmentation allows efficient storage and retrieval of scheduling information in a compact format, reducing overall memory usage while maintaining the ability to accurately identify NPDCCH candidate subframes.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS11438914B2Scheduling method and schedule list establishing method for user equipment end of narrowband Internet of Things
Publication Date: 2022.09.06 REALTEK SEMICON CORP
  • US11438914B2 patent drawing
  • US11438914B2 patent drawing
  • US11438914B2 patent drawing

AI summary

A scheduling method and a method for establishing a schedule list for user equipment (UE) of NB-IoT are provided. The method for establishing the schedule list includes the following steps: synchronizing to a cell; receiving at least one system information parameter from the cell, the at least one system information parameter including at least one system information type and a narrowband system information block type; establishing multiple sub-lists according to the distributions of the at least one system information type and the narrowband system information block type, each element of the sub-lists representing an available subframe; assigning a sub-list code to each sub-list; calculating the number of elements for each sub-list; and establishing a list according to the at least one system information parameter, the sub-list codes, and the numbers of the elements.