Dynamic channel resource allocation in frequency hopped wireless communication systems

In a conventional TDMA wireless system, the blocking probability is affected by the worst case interference statistics. Modifying the system to a frequency-hopped CDMA (CDMA-FH) system can change the blocking probability to be determined by average statistics. Hopping patterns can be implemented easily using Latin squares. A system using Latin squares of size n guarantees no users in the same cell share any slots and a user and all users in different cells share only one out of every n slots. Channel coding over hops then suppresses the worst interference. Further improvements may be obtained by allowing users to occupy M out of N slots where M⩽N. Centralized and distributed dynamic channel allocation (DCA) algorithms which allow users to have different SIR requirements have been developed to maximize the capacity of the system under a desired blocking probability