• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.57-61
• /
• 2015

This paper describes the basic principles of 3D broadcast system and proposes new 3D broadcast technology that reduces the amount of data by applying CS(Compressed Sensing). Differences between Sampling theory and the CS technology concept was described. CS algorithm SS-CoSaMP(Single-Space Compressive Sampling Matched Pursuit) and AMP(Approximate Message Passing) was described. Image data compressed and restored by these algorithm was compared. Calculation time of the algorithm having a low complexity is determined.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.395-408
• /
• 2003

Common Channel Signaling(CCS) networks need special controls to avoid overload of signaling networks and degradation of call process-ing rate, since they play an important role of controlling communication transfer networks. Congestion control and flow control mechanisms are well described in ITU-T recommendation on Signaling System No.7(SS7). For the practical provisions, however, we need an analysis on the relation among service objects, system requirements and implementation of congestion control algorithms. SS7 provides several options for controlling link congestion in CCS networks. In this paper we give a general queueing model of congestion control algorithm which covers both the international and national options. From the queuing model, we obtain the performance parameters such as throughput, message loss rate and mean delay for the international option. To show the performance of the algorithm, some numerical results are also given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2679-2686
• /
• 1996

In this paper, we propsoed the two methods to improve the conventional decision feedback interference canceller in DS/SS communication systems. The data bit is obtained by correlating the PN sequence with the received signals to the present time k, and thus the errors in the reference signal can be reduced by newly deciding all the reference signals with the resultant data bit. Additionally the cancelled signals are computed with less weight for initial reference signals of low processing gain, and highly weighted as the processing gain goes up. the resulting interference canceller outperforms the existing ones. By simulation, we found the proposed algorithm has "2-3 dB" performance gain at BER 10$^{-3}$ compared to the conventional descision feedback algorithm.algorithm.

• Korean Journal of Remote Sensing
• /
• v.22 no.2
• /
• pp.87-99
• /
• 2006

The Median Resolution Sensors (MRSs) for land observation such as Landsat-ETM+ and SPOT-HRV are more effective than Ocean Color Sensors (OCSs) for studying of detailed ecological and biogeochemical components of the coastal waters. In this study, we developed suspended sediment algorithm for Landsat TM/ETM+ by considering the spectral response curve of each band. To estimate suspended sediment concentration (SS) from satellite image data, there are two difference types of algorithms, that are derived for enhancing the accuracy of SS from Landsat imagery. Both empirical and remote sensing reflectance model (hereafter referred to as $R_{rs}$ model) are used here. This study tried to compare two algorithm, and verified using in situ SS data. It was found that the empirical SS algorithm using band 2 produced the best result. $R_{rs}$ model-based SS algorithm estimated higher values than empirical SS algorithm. In this study we used $R_{rs}$ model developed by Ahn (2000) focused on the Mediterranean coastal area. That's owing to the difference of oceanic characteristics between Mediterranean and Korean coastal area. In the future we will improve that $R_{rs}$ model for the Korean coastal area, then the result will be advanced.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.1028-1031
• /
• 1997

The SS (Semi-solid) diecasters usually cany out the SS d~ecastmg experiments before producing new products. At the SS diecasting stages, the runner-gate part is always repeatedly corrected, which leads to a lengthened processing time and increased processing cost. The SS diecasting die design should consider component system factors. such as runner, gate, biscuit, overflow and airvent. A large amount of experience is essential in manual assessment and if the design is defective, much time and a great deal of efforts will be wasted in the modification of the d~e. Thus human negligence should be minimized. In this study, die design system for SS diecasting process has been developed to present algonthm of die design, especially runner-gate system. In addition, specific rules and equations for runner-gate system have been presented to avoid too many trials and errors with expensive equipment. It is possible for engineers to be efficient die design of SS diecasting and it will result in reduction of expense and time to be required. And we developed CAD system for SS diecasting die design by AutoLISP language under AutoCAD using proposed algorithm and the database. In addition, we developed the vector analysis program for filling pattern of SS metals.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.388-390
• /
• 2005

IEEE 802.16은 BWA (Broadband Wireless Access) 시스템의 표준으로 현재 많은 연구와 함께 상용 제품에 대한 연구가 진행중인 분야이다. IEEE 802.16에서는 QoS를 제공하기 위하여 BS (Base Station)와 SS(Subscriber Station)간의 QoS 협상 과정을 정의하고 있으며, BS 및 SS에서의 효율적인 QoS 보장을 위해 4가지의 서비스 클래스를 정의하고 있다. 이러한 서비스 클래스는 UGS, rtPS, nrtPS, 그리고 BE 이다. 하지만 표준에서는 이러한 서비스 클래스를 어떻게 이용할 것인지에 태한 언급이 없으며, 이에 따라 효율적인 packet scheduling에 관한 않은 연구가 진행되어 왔다. 기존 연구에서는 주로 BS에서의 효율적인 scheduling에 초점을 맞추어 연구가 진행되었으며, SS에서의 scheduling에 대한 연구는 거의 되어 있지 않다. 하지만 BS에서 SS에게 대역폭을 할당할 때 GPSS (Grants per subscriber station) mode로 대역폭을 할당한다면 SS에서는 할당 받은 대역폭을 효율적으로 사용하기 위하여 scheduling이 필요하다. 본 논문에서는 SS에서 효율적인 대역폭 사용을 가능하도록 하기 위한 scheduling 알고리즘을 제안하고자 한다. 제안하는 알고리즘은 SS의 상황에 맞추어서 주어진 대역폭을 보다 더 효과적으로 이용하는데 초점을 맞추고 있다. 성능 명가를 통하여 제안하는 알고리즘이 기존 알고리즘에 비해서 보다 더 효율적으로 대역폭을 사용함을 알 수 있다.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.391-393
• /
• 2005

IEEE 802.16은 BWA (Broadband Wireless Access) 시스템의 표준으로 현재 많은 연구와 함께 상용 제품에 대한 연구가 진행중인 분야이다. IEEE 802.16에서는 QoS를 제공하기 위하여 BS (Base Station)와 SS(Subscriber Station)간의 QoS 협상 과정을 정의하고 있으며, BS 및 SS에서의 효율적인 QoS 보장을 위해 4가지의 서비스 클래스를 정의하고 있다. 이러한 서비스 클래스는 UGS, rtPS, nrtPS, 그리고 BE 이다. 하지만 표준에서는 이러한 서비스 클래스를 어떻게 이용할 것인지에 대한 언급이 없으며, 이에 따라 효율적인 packet scheduling에 관한 많은 연구가 진행되어 왔다. 기존의 연구에서는 주로 BS에서의 효율적인 Scheduling에 초점을 맞추어 연구가 진행되었으며, SS에서의 Scheduling에 대한 연구는 거의 되어 있지 않다. 하지만 BS에서 SS에게 대역폭을 할당할 때 GPSS (Grants per subscriber station) mode로 대역폭을 할당한다면 SS에서는 할당 받은 대역폭을 효율적으로 사용하기 위하여 scheduling이 필요하다. 본 논문에서는 SS에서의 scheduling architecture를 제안하고자 한다. 제안하는 scheduling architecture는 기존의 scheduling algorithm과는 달리 각 서비스 클래스에 대해서 효과적인 scheduling이 가능하도록 함으로써 시스템의 성능을 높이는데 기여할 것이다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.4
• /
• pp.638-644
• /
• 2006

In this paper, a QT_ss protocol is proposed for identifying all the tags within the identification range. The proposed QT_ss protocol revises the QT protocol, which has a memoryless property. In the QT_ss protocol, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. While the tags are sending their identification codes, if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the QT_ss protocol outperforms the QT protocol in terms of the number of response bits.