Dynamic Soft Buffer Allocation for Wireless Device Memory
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current soft buffer management in wireless communication systems is inefficient due to fixed allocation per HARQ process, leading to unused buffers, limited incremental redundancy for large transport blocks, and increased UE costs, particularly in MIMO operations.
Innovation Solution
Implement dynamic soft buffer handling by allocating a specified number of maximum-sized code blocks, allowing flexible allocation per code block independently of HARQ processes, and determining the number of code blocks based on the number of unsuccessfully decoded blocks to optimize memory usage and reduce computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If fixed soft buffer allocation per HARQ process is used, then buffer management is simplified, but soft buffer size increases and memory is wasted due to unused buffers
Solution Approach 1:
The patent implements dynamic soft buffer allocation where the soft buffer size is adjusted based on the actual number of unsuccessfully decoded code blocks. Instead of fixed allocation per HARQ process, the buffer dynamically adapts its size to match the actual storage needs, eliminating wasted memory while maintaining simplified management through automated adjustment mechanisms.
2Device complexity
If fixed soft buffer allocation per HARQ process is used, then buffer management is simplified, but UE costs increase due to larger memory requirements
Solution Approach 1:
The patent reduces UE costs by implementing dynamic soft buffer allocation that adjusts buffer size based on actual storage requirements. The buffer expands only when needed to store unsuccessfully decoded code blocks and contracts when not needed, significantly reducing the overall memory capacity required in the UE while maintaining automated management.
3Ease of operation
If fixed soft buffer allocation is used, then allocation is straightforward, but incremental redundancy is limited for large transport blocks
Solution Approach 1:
The patent enables effective incremental redundancy for large transport blocks through dynamic buffer allocation that automatically expands to accommodate additional redundancy information. The buffer size is adjusted based on the number of unsuccessfully decoded code blocks, allowing the system to maintain ease of operation while significantly improving adaptability for handling large transport blocks with multiple retransmissions.
Data Source
AI summary
A method performed by a wireless device (120) for handling a first transport block received from a transmitting device (101) is provided herein. The first transport block comprises a first set of code blocks. At least a first subset of code blocks has been unsuccessfully decoded by the wireless device (120). The wireless device (120) and the transmitting device (101) operate in a wireless communications network (100). The wireless device (120) determines (802), based on a first number of unsuccessfully decoded code blocks, a second number of code blocks to be allocated in a first memory (1111) of the wireless device (120), to store the unsuccessfully decoded code blocks. The wireless device (120) also allocates (803) the determined second number of code blocks. The wireless device (120) then initiates (805) storage of the unsuccessfully decoded code blocks in the first set, in the allocated determined second number of code blocks.


