• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.403-410
• /
• 2003

Design issues of multi-beam satellite transponders have been actively studied. Multi-beam satellite transponders can be used in the first SS/TDMA system for satellite interactive multi-media services in Korea. To be used in SS/TDMA systems, a satellite transponder must have either base-band OBP(On-board Processor) or MSM(Microwave Switching Matrix) on-board switch those are capable to provide inter-connections to many earth stations in different beam coverages or different frequencies, i.e., Ka and Ku band. The use of MSM is considered proper due to a substantial developing cost and the required high techniques in base-band OBP. In this paper, we present a designed scheme of transponder being optimally suitable to the targeted SS/TDMA satellite systems, also analysis the performance.

• Journal of Satellite, Information and Communications
• /
• v.4 no.1
• /
• pp.14-20
• /
• 2009

This paper describes synchronization concept and algorithm of the reverse DS-SS/TDMA control channel to handle satellite terminals which are distributed through the mission area. Military satellite control channel should have ECCM capabilities and handle more than several hundreds satcom terminals simultaneously. DS-SS/TDMA control channel can satisfy these demand but it spend much synchronization time. Proposed algorithm insert the preamble which is divided with several short sub bins prior to control data and use the parallel matched filtering searcher for each sub bin. As a result of the test, proposed algorithm can acquire most of control channel packet successfully within several milliseconds in severe jamming environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11B
• /
• pp.1725-1731
• /
• 2010

In this paper, we proposed preamble structure and code acquisition method to improve code acquisition performance for DS-SS/TDMA packet communication systems. Proposed algorithm changes the short PN code position depending on the sub slot number. Proposed algorithm also saves position differences between short PN codes and position offsets between short PN codes and data starting position of the TDMA packet. By using the position difference table, proposed algorithm can find out exact data starting position even though some sub slots were defected. As a result of simulation, we concluded that proposed algorithm has at least 5dB gain compared to conventional method when same short PN code is used. Moreover, proposed algorithm shows same code acquisition performance only with 1/4 shortened short PN code compared to conventional method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.13-20
• /
• 1994

We consider the satellite cluster scheduling problem which is one of the most interesting problems in satellite communication scheduling area. This problem is known to be NP-complete and a couple of heuristic algorithms had been developed. In this paper, we suggest another algorithm for this problem which has the same computational complexity as the best existing one and provides much better solution quality. Extensive computational simulation results are reported.

• IE interfaces
• /
• v.12 no.1
• /
• pp.19-25
• /
• 1999

The time slot scheduling problem for a satellite cluster with an arbitrary number of satellite is considered, which is one of the most interesting problems in the satellite communication scheduling area. This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, a new efficient algorithm is suggested, which has lower computational complexity and provides much better solution than other existing algorithms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.21-29
• /
• 2003

The traffic scheduling problem for a satellite cluster with an arbitrary number of satellites is considered. which is one of the most interesting problems in the satellite communication scheduling area. This problem is to find a time slot assignment maximizing the transponder utilization for a satellite cluster This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, we suggest new efficient algorithms for this problem, which have less time complexity than the best existing one and provide much better solution quality. Extensive simulation results are reported.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.85-85
• /
• 2000

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.47-53
• /
• 2016

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.33-40
• /
• 2015

The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs $n{\times}n$ ground station data traffic switching has been known NP-hard problem. This paper suggests $O(n^2)$ time complexity algorithm for TSAP of a satellite that performs $n^2{\times}n^2$ ground station data traffic switching. This problem is more difficult than $n{\times}n$ TSAP as NP-hard problem. Firstly, we compute the average traffic for n-transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to $D_{LB}$ traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in $D_{LB}$, then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.