• Journal of Computing Science and Engineering
• /
• v.8 no.1
• /
• pp.43-56
• /
• 2014

Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SS-DRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.897-913
• /
• 2016

Threshold signature is very important in identity authentication and some other applications. In December 2010, Chinese Encryption Administration released the SM2 elliptic curve digital signature algorithm as the first standard of the digital signature algorithm in China. At present, the papers on the threshold signature scheme based on this algorithm are few. A SM2 elliptic curve threshold signature scheme without a trusted center is proposed according to the Joint-Shamir-RSS algorithm, the Joint-Shamir-ZSS algorithm, the sum or diff-SS algorithm, the Mul-SS algorithm, the Inv-SS algorithm and the PM-SS algorithm. The proposed scheme is analyzed from correctness, security and efficiency. The correctness analysis shows that the proposed scheme can realize the effective threshold signature. The security analysis shows that the proposed scheme can resist some kinds of common attacks. The efficiency analysis shows that if the same secret sharing algorithms are used to design the threshold signature schemes, the SM2 elliptic curve threshold signature scheme will be more efficient than the threshold signature scheme based on ECDSA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1797-1805
• /
• 1993

An algorithm for the threshold decision from the maximum mismatching correlation value in a direct-sequence spread-spectrum system is presented. This algorithm is named the TDMMC(Threshold Decision from the Maximum Mismatching Correlation value). The purpose of the algorithm is to set the decision threshold in the system which will provide large probability of signal detection. Using this algorithm, the proper setting of the threshold for various SNRs is possible. An additional block called the Threshold Block is used to improve the system performance. The result from the computer simmulation has shown that appling the TDMMC to the noncoherent DS/SS-CSK system can achieve performance improvement.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.1 s.173
• /
• pp.225-231
• /
• 2000

Dimensional synthesis of planar and spatial mechanisms mostly requires solution-finding, procedure for a system of polynomial equations. In case the system is nonlinear, numerical techniques like Newton-Raphson are often used. But there are no logical ways for finding all possible solutions in such iterative methods. In this paper, algebraic elimination is used to get all solutions for the synthesis of 5-SS spatial mechanism with seven prescribed positions. The proposed algorithm is more suitable for computer implementation and takes less time than existing one. Two numerical examples are given to demonstrate the implemented algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3095-3111
• /
• 2018

Spectrum sensing (SS) is one of the fundamental tasks for cognitive radio. In SS, decisions can be made via comparing the test statistics with a threshold. Conventional adaptive algorithms for SS usually adjust their thresholds according to the radio environment. This paper concentrates on the issue of adaptive SS whose threshold is adjusted based on the Markovian behavior of primary user (PU). Moreover, Bayesian cost is adopted as the performance metric to achieve a trade-off between false alarm and missed detection probabilities. Two novel adaptive algorithms, including Markov Bayesian energy detection (MBED) algorithm and IMBED (improved MBED) algorithm, are proposed. Both algorithms model the behavior of PU as a two-state Markov process, with which their thresholds are adaptively adjusted according to the detection results at previous slots. Compared with the existing Bayesian energy detection (BED) algorithm, MBED algorithm can achieve lower Bayesian cost, especially in high signal-to-noise ratio (SNR) regime. Furthermore, it has the advantage of low computational complexity. IMBED algorithm is proposed to alleviate the side effects of detection errors at previous slots. It can reduce Bayesian cost more significantly and in a wider SNR region. Simulation results are provided to illustrate the effectiveness and efficiencies of both algorithms.

• 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 KSRS Conference
• /
• 2004.10a
• /
• pp.340-343
• /
• 2004

Since the tide embankment construction started in 1991, the coastal environment in and around the Saemangeum area has undergone changes rapidly, there is a need for monitoring the environmental change in this region. Owing to high temporal and spatial heterogeneity of the coastal ecosystem and processes as well as the expense with traditional filed sampling at discrete locations, satellite remote sensing measurements offer a unique perspective on mapping a large region simultaneously because of the synoptic and repeat coverage and that quantitative algorithms used for estimating constituents' concentration in the coastal environments. Thus, the main objectives of the present study are to analyze the retrieved Suspended Sediment (SS) pattern to predict changes after the commencement of the tide embankment construction work in 1991. This is accomplished with a series of the Landsat TM/ETM+ imagery acquired from 1985-2002 (a total of 18 imageries). Instead of a simple empirical algorithm, we implement an analytical SS algorithm, developed by Ahn et al. (2003), which is especially developed for estimating SS concentration (SSC) in Case-2 waters. The results show that there is a significant change in SS pattern, which is mainly influenced by the tide and tidal height after the construction of the embankment work. As the construction progressed, the distribution pattern of SS has greatly changed, and the rate of SS concentration in the gap area of the dyke of post-construction has significantly increased.

• 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.33 no.9A
• /
• pp.874-881
• /
• 2008

This paper presents an automatic frequency control algorithm for RTLS DS-SS modem based on the standard of ISO/IEC 24730-2. The presented automatic frequency control algorithm consists of frequency acquisition mode and frequency tracking mode, and the frequency acquisition mode is divided into the angle estimation step for frequency offset estimation and the verification step for removing the angle ambiguity. In the angle estimation step, three different sub-bit angles are estimated according to the timing intervals, then the estimates are used to re move the angle ambiguity in the verification step. The theoretical analysis and the simulation results of the proposed frequency control algorithm are presented.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.501-504
• /
• 2005

블록 정합 기법(block matching algorithm, BMA) 중에서 가장 널리 알려진 3 단계 탐색(three-step search, 3SS) 알고리즘은 큰 움직임 추정에 적합하지만 고정된 탐색 점으로 인하여 작은 움직임 추정에는 계산 면에서 낭비가 심하고 탐색이 잘못될 경우가 대부분이다. 한편, 효율적인 3 단계 탐색(efficient three-step search, E3SS)은 중앙-편중된 움직임 추정을 작은 다이아몬드 탐색(small diamond search, SDS) 알고리즘으로 보완하여 예측성과 탐색 속도를 향상시킨 알고리즘이다. 본 논문에서는 탐색 초기 단계에서 탐색 점을 최적 배치하고 E3SS 의 SDS 알고리즘을 변형시킨 탐색 알고리즘을 제안한다. 실험 결과는 제안된 탐색 알고리즘이 E3SS 와 비교하여 평균 22% 정도 계산량을 감소시키면서도 MSE(Mean Square Error)의 성능 저하를 거의 보이지 않는 것으로 나타난다.