摘要 |
There is determined an amount of available memory that is allocated for automatic repeat-request data. Then for each of a plurality of received data transmissions, an nth compression level is selected, in dependence at least in part on the amount of available memory, from among N possible compression levels for storing the respective received data transmission. In one specific embodiment each of the received data transmissions represents one HARQ process, and the nth compression level is selected from comparing an amount of memory needed to store the respective received data transmission and all other received data transmissions representing parallel HARQ processes as compressed according to the nth compression level against the determined amount of available memory. An algorithm iteratively checks the amount of memory needed for each of the N possible compression levels, from least compressed to most compressed in this specific embodiment.
|