• Journal of Electrical Engineering and Technology
• /
• v.6 no.3
• /
• pp.418-422
• /
• 2011

For low-power sensor networks, a compact design of advanced encryption standard (AES) algorithm is needed. A very small AES core for ZigBee devices that accelerates computation in AES algorithms is proposed in this paper. The proposed AES core requires only one S-Box, which plays a major role in the optimization. It consumes less power than other block-wide and folded architectures because it uses fewer logic gates. The results show that the proposed design significantly decreases power dissipation; however, the resulting increased clock cycles for 128-bit block data processing are reasonable for IEEE 802.15.4 standard throughputs.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.901-914
• /
• 1999

In [6] Schensted constructed the Schensted algorithm giving a bijection between permutations and pairs of Young standard tableaux. After knuth generalized it to column strict tableaux in [3] various analogs of the Schensted algorithm came. In this paper we describe the bumping algorithm on the shifted rim hook tableaux which is the basic building block of the Schensted algorithm for shifted rim book tableaux.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.731-736
• /
• 2017

In this paper, we propose a simplified tag collection algorithm to improve the performances of ISO/IEC 18000-7, which is a standard for an active RFID system. The proposed algorithm modifies the collection command that enables to start a tag collection round. The modified collection command includes the results of the listen period response for the previous collection round. Tags that receive the collection command check the collision status for their responses. If there is no collision, tags transmit their additional data and go into the sleep mode without the point-to-point read command and sleep command. A collection round for the standard consists of a collection command and response, a read command and response, and sleep command. On the other hand, in the proposed algorithm, a collection round consists of a collection command and response. The simulation results showed that the proposed algorithm can improve the identification delay about 16% compared with the standard when the number of tags are 300.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8B
• /
• pp.809-818
• /
• 2002

In this paper, we propose a fast cell search algorithm keeping compatible with the standard cell search algorithm of the WCDMA system. The proposed algorithm can acquire the synchronization of slot and frame times, and the code group identification using only one synchronization channel while the standard algorithm employs two synchronization channels called P-SCH and S-SCH. The proposed synchronization channel structure is the same as the P-SCH structure of the WCDMA system. However, the P-SCH is modulated with a specific polarization code, which is one element of new code group codes. The proposed algorithm can reduce both the BS' transmission power and the complexity of receiver as compared with the conventional one since only on synchronization channel is used. It is shown through the computer simulation that the proposed algorithm yields a significant improvement in terms of cell search time compared with the standard especially in low SNR environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2881-2894
• /
• 2014

In complicated environment, context information plays an important role in image segmentation/labeling. The recently proposed auto-context algorithm is one of the effective context-based methods. However, the standard auto-context approach samples the context locations utilizing a fixed radius sequence, which is sensitive to large scale-change of objects. In this paper, we present a scale invariant auto-context (SIAC) algorithm which is an improved version of the auto-context algorithm. In order to achieve scale-invariance, we try to approximate the optimal scale for the image in an iterative way and adopt the corresponding optimal radius sequence for context location sampling, both in training and testing. In each iteration of the proposed SIAC algorithm, we use the current classification map to estimate the image scale, and the corresponding radius sequence is then used for choosing context locations. The algorithm iteratively updates the classification maps, as well as the image scales, until convergence. We demonstrate the SIAC algorithm on several image segmentation/labeling tasks. The results demonstrate improvement over the standard auto-context algorithm when large scale-change of objects exists.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.5
• /
• pp.902-907
• /
• 2008

Shape of the pulse waveform is affected by the visco-elasticity characteristics of the arterial wall and the reflection waves generated at the bifurcations of arterial branches. This study was designed to improve the accuracy for the extraction of pulse wave features, then proved the superiority of the developed algorithm by clinical evaluation. Upstroke point of the pulse wave was used as an extraction feature since it is minimally affected by the waveform variation. R-peak of the ECG was used as a reference to decide the minimum level, then intersection of the least squares of regression line was used as an upstroke point. Developed algorithm was compared with the existing minimum value detection algorithm and tangent-intersection algorithm using data obtained from 102 subjects. Developed algorithm showed the least standard deviation of $0.29{\sim}0.44\;m/s$ compared with that of the existing algorithms, $0.91{\sim}3.66\;m/s$. Moreover, the rate of standard deviation of more than 1.00m/s for the PWV values reduced with the range of $29.0{\sim}42.4%$, which proved the superiority of the newly developed algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2541-2546
• /
• 2009

In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other DFSA algorithms. However, the standard does not define an optimized parameter value for adjusting the frame size. In this paper, we propose the optimized parameter values for minimizing the identification time by various computer simulations.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.172-176
• /
• 2011

In the Gen-2 Q-algorithm, the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not optimized in the standard. However, the standard suggests that the reader uses small values of C when the slot-count is large and larger values of C when the slot-count is small. In this case, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round. Through various computer simulations, it is demonstrated that the proposed scheme achieves more stable performances than Gen-2 Q-algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.2
• /
• pp.138-143
• /
• 2006

In this paper, we have presented a Sequential Agglomerative Hierarchical Nested (SAHN) algorithm-based data clustering method in fuzzy inference system to achieve optimal performance of fuzzy model. SAHN-based algorithm is used to give possible range of number of clusters with cluster centers for the system identification. The axes of membership functions of this fuzzy model are optimized by using cluster centers obtained from clustering method and the consequence parameters of the fuzzy model are identified by standard least square method. Finally, in this paper, we have observed our model's output performance using the Box and Jenkins's gas furnace data and Sugeno's non-linear process data.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.10
• /
• pp.720-726
• /
• 2004

The data transmission over MVB(Multifunction Vehicle Bus) of TCN(Train Communication Network) is divided into the periodic transmission phase and the sporadic transmission phase. TCN standard recommends the event-polling method as the message transfer in the sporadic phase. However, since the event-polling method does not use pre-scheduling to the priority of the messages, it is inefficient for the real-time systems. To schedule message transmission, a master node should know the priority of message to be transmitted by a slave node prior to the sporadic phase, but the existing TCN standard does not support any protocol for this. This paper proposes the slave frame bit-stuffing algorithm, with which a master node gets the necessary information for scheduling and includes the simulation results of the event-polling method and the proposed algorithm.