 with multiuser channel sharing. When each of these users is scheduled by L1 control signaling, the control channel overhead can become the bottleneck of VoIP system perfor- mance. In that case the dynamic packet scheduler is unable to fully exploit the PDSCH air interface capacity, and some of the PDSCH resources remain unused while the control channel capacity is already exhausted. One attractive technique with a fully dynamic scheduler to improve VoIP capacity within control channel limitations is to bundle multiple VoIP packets together at L1 in one transmission for a user. Packet bundling is CQI based, which means that PS decides whether to utilize it or not for a user based on the user's channel conditions. Packet bundling is described in more detail in Section 10.6.2.1. An alternative way of addressing the control overhead problem is semipersistent scheduling, which, instead of scheduling each transmission individually, relies on long-term allocations. Semi-persistent scheduling is discussed in more detail in Section 10.6.2.2. 10.4.3.2 Proposed Fully Dynamic Packet Scheduling Algorithm for VolP The following packet scheduling algorithm aims to address the particulars of the VoIP service listed in Section 10.4.3.1. The proposed user selection procedure relies on the concept of the scheduling candidate set (SCS) [14,16], which classifies the schedulable users into three groups. These three groups in the SCS are dynamically updated in each TTI. The groups are further ordered in the following priority: Users with pending retransmissions in their HARQ manager Users whose head-of-line (HOL) packet delay is close enough to the delay budget, where HOL delay is the delay of the oldest unsent packet in the (e)NodeB buffer 3. Remaining users (other than the retransmission users and HOL users). The priority metric used for ordering users within each group is a relative CQI metric. The relative CQI metric for each user is given by CQI_instICQI_avg, where CQI_inst is the instantaneous CQI calculated over the full bandwi