This paper presents an efficient time slot assignment algorithm for an SS/TDMA system. The technique utilized in thealgorithm is a systematic method of finding distinct representatives from the row sets of a traffic matrix. The assignment efficiency resulting from the algorithm is 100% for any traffic matrix. The number of switching modes generated .by the algorithm is bounded by n* -2n + 2 for an n x n traffic matrix.The computational procedures are illustrated by an example for the Advanced WESTAR system. Alsq included in the paper are the computer simulation results on the numbers of required switching modes for various simulated traffic matrices.

No abstract

No abstract

No abstract

No abstract