Dynamic Buffer Allocation for LTE Carrier Aggregation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In LTE multi-carrier systems, the current buffer space allocation method leads to inefficient resource utilization due to a linear increase in concurrent HARQ processes, resulting in buffer waste and the inability to store subsequent HARQ processes when the number of wrong HARQ processes exceeds the buffer limit, limiting the system to only ARQ functionality.
Innovation Solution
The method dynamically allocates buffer space based on the number of aggregated carriers, allowing for flexible division of buffer resources according to the concurrent HARQ processes, using strategies such as equal division based on carrier quantity or bandwidth, to optimize buffer space utilization and support both FDD and TDD systems.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the buffer space is allocated according to the maximum number of HARQ processes supported by terminal equipment, then the buffer can store all possible HARQ processes, but the buffer space utilization rate decreases due to buffer waste when fewer carriers are aggregated
Solution Approach 1:
The patent applies dynamics by making the buffer space allocation adaptive rather than fixed. The buffer is dynamically divided into multiple buffer spaces based on the actual number of aggregated carriers, allowing the system to adjust buffer allocation in real-time according to carrier aggregation configuration, thereby optimizing utilization while maintaining reliability
Solution Approach 2:
The patent changes the parameter of buffer space allocation from a static maximum value to a dynamic value based on the number of aggregated carriers. By varying the buffer allocation parameter according to the actual carrier configuration, the system achieves both high reliability for HARQ process storage and efficient buffer utilization
2Adaptability or versatility
If the number of concurrent HARQ processes increases with the number of aggregated carriers, then more carriers can be supported, but the buffer becomes full and subsequent HARQ processes cannot be stored
Solution Approach 1:
The patent segments the buffer into multiple buffer spaces, where each buffer space corresponds to a specific number of HARQ processes. This segmentation allows the system to accommodate varying numbers of concurrent HARQ processes across different carrier aggregation configurations, preventing buffer overflow while supporting adaptability
Solution Approach 2:
The buffer allocation is made dynamic by adjusting the number of buffer spaces and their sizes according to the actual number of aggregated carriers. This dynamic adjustment ensures that the buffer can always accommodate the current HARQ process requirements without overflowing, maintaining reliability while supporting carrier aggregation versatility
3Ease of manufacture
If the buffer space is divided into fixed allocations for each carrier, then the allocation method is simple, but the buffer waste increases when not all carriers are aggregated
Solution Approach 1:
The patent transitions from fixed buffer allocation to dynamic buffer allocation. The buffer is divided into multiple spaces that can be activated or deactivated based on the number of aggregated carriers, maintaining simplicity in the allocation method while significantly improving buffer space utilization efficiency by avoiding waste when fewer carriers are used
Data Source
Figure 1~2
Figure 3~4
Figure 5~9
AI summary
Disclosed are a buffer space allocation method and a device. The solution of the present invention enables the division of the buffer space in the buffer resource of a terminal equipment according to the currently configured carrier aggregation mode of the terminal equipment, so that the number of buffer spaces in the buffer can be adjusted according to the number of aggregated carriers, thereby improving the utilization rate of the buffer resource. The method is simple, easy to implement, and applicable to both FDD and TDD systems.