• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.547-549
• /
• 2014

In RFID systems, the performance for the tag identification is closely related with the tag collision, which is caused by the simultaneous transmission. The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. This algorithm uses the fixed frame size at every scan. Therefore, it is anticipated that the performance of PS algorithm can be variously shown according to the number of tags, frame size, and power level increase. In this paper, we analize the performance of PS algorithm according to the frame length and power level increase.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.807-812
• /
• 2015

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred as anti-collision algorithm. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. In this paper, we propose a STAC/PS algorithm that the PS algorithm is applied in the STAC protocol. Through simulations, it is demonstrated that the collision rate for the proposed algorithm is about 50% lower than STAC protocol. Therefore, the STAC/PS algorithm can achieve faster tag identification speed compared with STAC protocol due to the low collision rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.615-617
• /
• 2014

The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. This algorithm uses the fixed frame size at every scan. Therefore, it has problems that the performance of PS algorithm can be variously shown according to the number of tags, frame size, and power level increase. In this paper, we propose an EPS algorithm that allocates the optimal frame size by estimating the number of tags at each scan.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.712-714
• /
• 2016

The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In this paper, we propose a STAC/PS algorithm that the PS algorithm is applied in the STAC protocol. The simulation results show that the STAC/PS algorithm can achieve faster tag identification speed compared with STAC protocol due to the low collision rate.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.6
• /
• pp.871-875
• /
• 2008

This paper deals with the feature selection for multiple k-nearest neighbor (k-NN) classifiers using Genetic Algorithm with Varying reputation Size (GAVaPS). Because we use multiple k-NN classifiers, the feature selection problem for them is vary hard and has large search region. To solve this problem, we employ the GAVaPS which outperforms comparison with simple genetic algorithm (SGA). Further, we propose the efficient combining method for multiple k-NN classifiers using GAVaPS. Experiments are performed to demonstrate the efficiency of the proposed method.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.1-9
• /
• 2009

In this paper, A pipeline structured-degree computationless modified Euclidean (PS-DCME) algorithm is proposed, which can be used for a RS(23,17) decoder for MB-OFDM system. PS-DCME algorithm requires a state machine instead of the degree computation and comparison circuits, so that the hardware complexity of the decoder can be reduced and high-speed decoder can be implemented. We have implemented a RS(23,17) decoder with PS-DCME using Verilog HDL and synthesized with Samsung 65nm library. From synthesis results, it can operate at clock frequency of 250MHz, and gate count is 19,827.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.931-936
• /
• 2016

The PS algorithm divides the number of tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. It limits the number of responding tags by grouping the tags within the identification range of the reader, and thus can reduce the probability of tag collision. Also, in the PS algorithm, the reader takes advantages of the difference of identification ranges. This algorithm uses the fixed frame size at every scan. Therefore, it has problems that the performance can be shown variously according to the number of tags and frame size. In this paper, we propose an EPS algorithm that allocates the optimal frame size by estimating the number of tags at each scan, and apply it into the STAC protocol. The simulation results showed that STAC/EPS algorithm can improve the identification delay about 45% compared with STAC protocol. Also, it provides a stable identification delay regardless of power level increase.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1784-1785
• /
• 2011

PS(Phase Shift) 방식을 이용하여 3차원 이미지 형상복원 시스템을 구현하였다. PS 방식은 위상을 이동시켜서 얻어진 강도를 arctan 시킴으로써 $-{\pi}{\sim}{\pi}$ 범위의 접혀진(wrapped) 위상을 얻을 수 있으며, 이러한 wrapped 위상을 위상 펼침(unwrapping) 알고리즘을 이용하여 불연속을 제거할 수 있다. 얻어진 위상 정보는 물체의 높이 정보에 비례하기 때문에 위상 분포로써 3차원 형상을 복원할 수 있다. Unwrapping 알고리즘에는 다양한 방식이 있지만 본 연구에서는 LabVIEW 프로그램을 이용하여 Goldstein 알고리즘을 구현하였으며, 감마(Gamma) 효과에 의한 노이즈를 줄이기 위하여 프로젝트와 카메라의 보정(calibration) 프로그램을 개발 및 적용하였다. 이와 같은 실험을 통하여 효과적으로 3차원 형상 정보를 얻을 수 있었다.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.661-668
• /
• 2009

The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver's auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency

• Geophysics and Geophysical Exploration
• /
• v.13 no.1
• /
• pp.109-117
• /
• 2010

To enable high-performance computing (HPC) for applications with large datasets using a $Sony^{(R)}$ $PLAYSTATION^{(R)}$ 3 ($PS3^{TM}$) video game console, we configured a hybrid system consisting of a $Windows^{(R)}$ PC and a $PS3^{TM}$. To validate this system, we implemented the real-time multiplet identifier (RTMI) application, which identifies multiplets of microearthquakes in terms of the similarity of their waveforms. The cross-correlation computation, which is a core algorithm of the RTMI application, was optimised for the $PS3^{TM}$ platform, while the rest of the computation, including data input and output remained on the PC. With this configuration, the core part of the algorithm ran 69 times faster than the original program, accelerating total computation speed more than five times. As a result, the system processed up to 2100 total microseismic events, whereas the original implementation had a limit of 400 events. These results indicate that this system enables high-performance computing for large datasets using the $PS3^{TM}$, as long as data transfer time is negligible compared with computation time.