| 摘要 |
A scheme for pseudo DCH allocation of shared channels in a UTRA 3GPP TDD communication system, by: first allocating (710) shared channel resources among users; determining (740) which of the users have recently been active; and second allocating (750, 760) in a queued round robin fashion an amount of shared channel resources unallocated by the first allocating step as dedicated channel resources among those users which have recently been active but have not been requested resource in the current round. This provides the following advantages: <SL> <LI>```Latency experienced in networks employing shared channels can be substantially improved while maintaining an efficient shared channel allocation strategy which maximizes overall throughput. <LI>```Due to the concept of only allocating speculatively to recently active users the invention most efficiently allocates resources. </SL> |
