HARQ Memory Pooling for Fragmentation-Free Retransmissions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional HARQ communication systems face memory space constraints and fragmentation due to fixed queue sizes, limiting the number of bursts and retransmissions, which restricts data throughput and reliability.
Innovation Solution
Implementing a dynamic memory management system using a location table to store and combine bursts, allowing for unlimited retransmissions and adaptive queue sizing, which records memory addresses and information for bursts, enabling efficient storage and retrieval of retransmitted data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a fixed number of queues with fixed size are used for data transfer, then memory management is simplified, but memory space fragmentation occurs and the number of retransmissions is limited
Solution Approach 1:
The patent implements dynamic queue sizing where the size of queues is not fixed but adjusts based on the actual number of bursts and retransmissions needed. The memory is organized into a pool of blocks that can be dynamically allocated to queues as needed, allowing the system to adapt to varying transmission requirements without being constrained by predetermined queue sizes.
Solution Approach 2:
The patent creates a universal memory pool that serves multiple queues simultaneously. Instead of dedicating fixed memory spaces to each queue, a single memory pool is shared across all queues, allowing any block to be allocated to any queue that needs it. This multi-functional memory structure eliminates fragmentation and enables unlimited retransmissions.
2Device complexity
If a fixed number of queues with fixed size are used for data transfer, then device complexity is reduced, but memory space is wasted due to fragmentation
Solution Approach 1:
The patent implements dynamic queue sizing where the size of queues is not fixed but adjusts based on the actual number of bursts and retransmissions needed. The memory is organized into a pool of blocks that can be dynamically allocated to queues as needed, allowing the system to adapt to varying transmission requirements without being constrained by predetermined queue sizes.
Solution Approach 2:
The patent merges multiple fixed queues into a single unified memory pool. Instead of having separate fixed-size queues that cannot share memory blocks, the system combines them into one pool where blocks can be freely allocated and deallocated. This merging eliminates the fragmentation problem that arises from fixed queue boundaries.
3Duration of action of stationary object
If older bursts are stored for longer duration, then more retransmissions can be accommodated, but memory space constraints increase
Solution Approach 1:
The patent implements dynamic queue sizing where the size of queues is not fixed but adjusts based on the actual number of bursts and retransmissions needed. The memory is organized into a pool of blocks that can be dynamically allocated to queues as needed, allowing the system to adapt to varying transmission requirements without being constrained by predetermined queue sizes.
Solution Approach 2:
The patent changes the parameter of queue size from fixed to dynamic. By making the queue size a variable parameter that adjusts based on actual usage, the system can store bursts for longer durations and accommodate more retransmissions without linearly increasing memory requirements. The memory pool efficiently utilizes available space regardless of how many bursts are stored.
Data Source
AI summary
A method and system for managing memory using Hybrid Automatic Repeat Request in a communication system is provided. The method includes storing a retransmitted burst in a memory. The retransmitted burst includes plurality of bits. One or more of memory address of the retransmitted burst and the information corresponding to the retransmitted burst is recorded in a location table. The location table records memory addresses and the information corresponding to a plurality of bursts stored in the memory. The method further includes determining one or more preceding bursts corresponding to the retransmitted burst stored in the memory using location table. Thereafter, a combined burst is generated using the retransmitted burst and one or more preceding burst, if one or more preceding bursts corresponding to the retransmitted burst are stored in the memory. The combined burst includes the plurality of bits.


