Dynamically compressing ARQ data based upon available memory

There is determined an amount of available memory that is allocated for storage of automatic repeat-request data. 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 embodiment each of the received data transmissions is associated with one HARQ process, and the nth compression level is selected by comparing an amount of memory needed to store the respective received data transmission and all other received data transmissions representing parallel HARQ processes when compressed according to the nth compression level against the determined amount of available memory. In one arrangement an algorithm iteratively checks the amount of memory needed for each of the N possible compression levels, from least compressed to most compressed.