Programmable Hardware Scheduler for Wireless Baseband Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current digital processing systems face inefficiencies in job scheduling for complex algorithms, particularly in baseband processing for wireless communications, due to high power consumption, resource usage, and slow response times in software-based solutions, which fail to adapt flexibly to evolving standards and protocols.
Innovation Solution
A programmable hardware scheduler module that manages job scheduling through a hardware entity programmed by control software, utilizing a system of command queues and arbitrators to dynamically allocate tasks among digital signal processors and hardware accelerators, optimizing timing and resource utilization without requiring continuous software intervention.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If software-based scheduling is used on a dedicated DSP or CPU, then flexibility to adapt to evolving standards and protocols is improved, but power consumption increases and response time to external events slows down
Solution Approach 1:
The scheduling system is segmented into multiple independent hardware schedulers, each dedicated to specific job types or protocols. This allows parallel processing of different scheduling tasks in hardware while maintaining flexibility through programmable control logic, thereby reducing power consumption compared to a single software-based scheduler while preserving adaptability.
Solution Approach 2:
The patent replaces the software-based scheduling mechanism with hardware-based scheduling logic implemented in programmable hardware devices. This substitution provides faster response times and lower power consumption while maintaining flexibility through programmable control, directly addressing the contradiction between software adaptability and hardware efficiency.
2Adaptability or versatility
If software-based scheduling is used on a dedicated DSP or CPU, then flexibility to adapt to evolving standards and protocols is improved, but response time to external events slows down
Solution Approach 1:
The patent replaces software-based scheduling with hardware-based scheduling logic that can respond to external events in real-time. The programmable hardware schedulers implement scheduling algorithms in hardware, providing nanosecond-level response times while maintaining adaptability through programmable control logic that can be reconfigured for different standards and protocols.
Solution Approach 2:
The hardware schedulers are pre-configured with scheduling logic and algorithms that enable immediate response to external events. The programmable nature allows these preliminary configurations to be adapted to different standards and protocols without requiring software interpretation, thus maintaining both speed and flexibility.
3Productivity
If multiple hardware schedulers are implemented, then job scheduling efficiency and resource utilization are improved, but device complexity increases
Solution Approach 1:
The patent merges multiple hardware schedulers into a unified programmable hardware device that can dynamically allocate and manage multiple scheduling contexts. This consolidation maintains the productivity benefits of multiple schedulers while reducing device complexity through shared hardware resources and unified control logic.
Solution Approach 2:
The programmable hardware schedulers are designed with universal functionality to handle multiple job types and protocols simultaneously. This multi-functionality allows a single hardware scheduler to perform the work of multiple dedicated schedulers, thereby improving scheduling efficiency without proportionally increasing device complexity.
Data Source
AI summary
Method and system embodying the method for programmable scheduling encompassing: enqueueing at least one command into one of a plurality of queues having a plurality of entries; determining a category of the command at the head entry of each of the plurality of queues; processing each determined non-job category command by a non-job command arbitrator; and processing each determined job category command by a job arbitrator and assignor, is disclosed.


