An Efficient SS/TDMA Time Slot Assignment Algorithm
Thomas Inukai · IRE Transactions on Communications Systems · 1979
This paper presents an efficient time slot assignment algorithm for an SS/TDMA system. The technique utilized in the algorithm 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 byn^{2} - 2n + 2for ann \times ntraffic matrix. The computational procedures are illustrated by an example for the Advanced WESTAR system. Also included in the paper are the computer simulation results on the numbers of required switching modes for various simulated traffic matrices.