DocumentCode
763185
Title
An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders
Author
Bongiovanni, G. ; Coppersmith, D. ; Wong, C.K.
Author_Institution
IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
Volume
29
Issue
5
fYear
1981
fDate
5/1/1981 12:00:00 AM
Firstpage
721
Lastpage
726
Abstract
In this paper we consider an SS/TDMA system with 
uplink beams, 
downlink beams, and 
transponders. An optimal time slot assignment algorithm for any 
and any traffic matrix is presented, where optimality means achieving the minimal possible total duration for the given traffic matrix. The number of switching matrices generated by the algorithm is bounded above by 
for 
and 
otherwise. Extensive simulation results on randomly generated matrices are carried out, showing that the average number of switching matrices generated is substantially lower than the bounds.
uplink beams, downlink beams, and transponders. An optimal time slot assignment algorithm for any and any traffic matrix is presented, where optimality means achieving the minimal possible total duration for the given traffic matrix. The number of switching matrices generated by the algorithm is bounded above by for and otherwise. Extensive simulation results on randomly generated matrices are carried out, showing that the average number of switching matrices generated is substantially lower than the bounds.Keywords
Satellite communication, multiaccess; Artificial satellites; Attenuation measurement; Frequency; Millimeter wave propagation; Polarization; Rain; Satellite broadcasting; Statistical distributions; Time division multiple access; Transponders;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOM.1981.1095028
Filename
1095028
Link To Document