Span-Based PDCCH Scheduling for UE Processing Reduction

The patent introduces a span-based timeline as an intermediary reference point between the PDCCH and the scheduled channel. Instead of directly measuring from the PDCCH last symbol to the scheduled channel first symbol, the system uses the span boundary (last symbol of the span containing the PDCCH) as a mediator. This span-based reference reduces processing complexity while maintaining scheduling flexibility, as the UE only needs to identify the span boundary rather than precisely locate the PDCCH last symbol.

The patent changes the reference parameter from PDCCH-specific timing to span-based timing. By defining the timeline relationship based on span boundaries rather than individual PDCCH positions, the system transforms a complex per-PDCCH calculation into a simpler span-level calculation. This parameter change reduces the processing burden on the UE while preserving the ability to flexibly schedule channels.

The span boundary serves as an intermediary reference that simplifies the timing determination process. Instead of requiring the UE to precisely identify the last symbol of the PDCCH (which varies in position), the UE only needs to identify the span boundary, which is a fixed, known reference point. This intermediary approach maintains sufficient timing accuracy for scheduling while significantly reducing processing complexity.

The patent segments the time domain into spans with fixed boundaries. By organizing the timeline into discrete span units with predetermined boundaries, the system allows the UE to use these fixed span boundaries as reference points rather than calculating variable PDCCH positions. This segmentation approach maintains timing precision while reducing the computational burden of identifying channel positions.