Analysis of a switch matrix for an SS/TDMA system

Abstract

Time slot scheduling problem for a satellite switched/time-division multiple access (SS/TDMA) system is discussed and an algorithm called Greedy Algorithm is presented. This algorithm guarantees a most efficient utilization of a frame period with n2- n (n is the number of beams) number of switchings at most. Another problem discussed in this paper is the choice of the type of microwave switch matrix to be put on board the satellite. A switch-matrix structure called rearrangeable multistage matrix is shown to have high reliability and low-insertion-loss characteristics. Also brief discussions are made on the experimental results of an engineering model SS/TDMA system.