Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

Performance of EGPRS incremental redundancy in interference limited environments

Mzyece, M. and Dunlop, J. (2002) Performance of EGPRS incremental redundancy in interference limited environments. In: 5th International Symposium on Wireless Personal Multimedia Communications, 2002-10-27 - 2002-10-30.

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

Incremental Redundancy (IR), an established Hybrid-ARQ technique, has been proposed as an adaptive link level mechanism in third-generation and evolved second-generation wireless systems such as the Enhanced General Packet Radio Service (EGPRS). In this paper, three alternative EGPRS Incremental Redundancy ARQ algorithms of low (IR-ARQ1), medium (IR-ARQ2) and high (IR-ARQ3) computational complexity are specified. The relative downlink performance of the specified algorithms is evaluated for interference-limited mobile radio environments with pedestrian (5 km/h) and vehicular (50 km/h) mobile speeds, using a high-speed link level simulator. For comparison, a basic Selective-Repeat ARQ algorithm (SR-ARQ) is also implemented. The algorithms are compared in terms of their throughput performance, transmission delay performance, and processing requirements. It is shown that the most significant performance improvement is from SR-ARQ to IR-ARQ1 (up to about 2dB at 5 km/h, and 5 dB at 50 km/h). The performance gains from IR-ARQ1 to IR-ARQ2, and from IR-ARQ2, to IR-ARQ3 are negligible. Overall, the results suggest that implementing a low-complexity Incremental Redundancy ARQ algorithm gives the optimal performance/complexity trade-off.