By Topic

Dynamic channel resource allocation in frequency hopped wireless communication systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. C. Wang ; Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA ; G. J. Pottie

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

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994