• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.458-465
• /
• 2007

Wireless Sensor Network(WSN) is a special network that collects measured data by sensor nodes in the predefined sensor field and forwards them to the base station in a distance using their own routing scheme. WSN requires routing techniques to maximize energy efficiency because sensor nodes have non-rechargeable and thus limited energy. Characteristics of WSN are various according to applications, many of routing algorithms have been proposed. This paper proposes an algorithm called A-PEGASIS that basically bases on PEGASIS and enhances in two aspects - an elegant chain generation algorithm and periodical update of chains. We compare performance of the previous algorithm of LEACH, PEGASIS, PEDAP and PEDAP-PA with ours through simulation. It confirms that the A-PEGASIS is most superior in terms of average WSN lifetime and high probability of node survival rate during WSN life time.

• Journal of Positioning, Navigation, and Timing
• /
• v.6 no.4
• /
• pp.167-179
• /
• 2017

In this paper, a simplified Cubature Kalman Filter (SCKF) is proposed to reduce the computation load of CKF, which is then used as a filter for transfer alignment of shipboard INS. CKF is an approximate Bayesian filter that can be applied to non-linear systems. When an initial estimation error is large, convergence characteristic of the CKF is more stable than that of the Extended Kalman Filter (EKF), and the reliability of the filter operation is more ensured than that of the Unscented Kalman Filter (UKF). However, when a system degree is large, the computation amount of CKF is also increased significantly, becoming a burden on real-time implementation in embedded systems. A simplified CKF is proposed to address this problem. This filter is applied to shipboard inertial navigation system (INS) transfer alignment. In the filter design for transfer alignment, measurement type and measurement update rate should be determined first, and if an application target is a ship, lever-arm problem, flexure of the hull, and asynchronous time problem between Master Inertial Navigation System (MINS) and Slave Inertial Navigation System (SINS) should be taken into consideration. In this paper, a transfer alignment filter based on SCKF is designed by considering these problems, and its performance is validated based on simulations.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.2
• /
• pp.103-113
• /
• 2001

This paper described a design and implementation of a single-chip encoder/decoder using the LZSS algorithm and entropy coding in 0.6${\mu}{\textrm}{m}$ CMOS technology. Dictionary storage for the dictionary search processor(DISP) used a 2K$\times$8bit on-chip memory with 50MHz clock speed. It performs compression on byte-oriented input data at a data rate of one byte per clock cycle except when one out of every 33 cycles is used to update the string window of dictionary. In result, the average compression ratio is 46% by applied entropy coding of the LZSS codeword output. This is to improved on the compression performance of 7% much more then LZSS.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.8
• /
• pp.3997-4001
• /
• 2016

Background: Cancer is a worldwide health problem and pain is among the most common and unpleasant effects affecting well-being of cancer patients. Accurate description of pain can help physicians to improve its management. Many English tools have been developed to assess pain. Onkly a limited number of these are applied in Arab countries. Our aim was to assess the quality, the nature and the severity of pain using the short McGill Pain Questionnaire (SF-MPQ) on cancer patients in the National Institute of Oncology (NIO) in Rabat, Morocco. Materials and Methods: The tool used is the SF-MPQ inspired from the Arabic version of the MPQ. The subjects were cancer patients (N=182) attending the NIO, from 24th October 2015 to 8th January 2016, aging ${\geq}18$ years old, experiencing pain and coming to have or to update their pain medication. Results: The rate of participation was 96.3%. Eight patients had difficulties to express their pain using descriptors, but could use the Visual Analogue Scale (VAS) and the body diagram. The most frequent sensory descriptors were 'Throbbing', 'Shooting', 'Hot-Burning'. The most used affective descriptor was 'Tiring-Exhausting'. The mean VAS was 6.6 (2.4). The mean score of all items was 11.9 (7.8). The patients were suffering from severe pain. The internal consistency of the form was s acceptable. Conclusions: The findings indicate that most of the patients attending the pain center of the NIO could use the descriptors of the SF-MPQ to describe their pain. They indicate the usefulness of the SF-MPQ to assess the nature and the severity of pain in cancer patients. This tool should be tested in other Moroccan and Arabic contexts associated with other tools in clinical trials.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.10
• /
• pp.35-43
• /
• 2004

An arbitration method is proposed to resolve a collision and arbitrate beacon transmissions in an indoor Positioning system consisting of multiple beacons and listeners. Although two or more beacons may compete to transmit signals simultaneously, a single winner in the competition is determined autonomously through the arbitration process while they are transmitting. So, it can continue to send its data, but the others give up their transmissions during the arbitration process. As a consequence, update rate for location information and channel utilization can be improved by avoiding that all beacons fail due to a collision. Once a beacon succeeds in transmitting its signal, a low-level priority is assigned to it. And a high-level priority is allocated to a beacon which gave up its transmission during arbitration process. This will guarantee every beacon has fair transmission opportunity with the arbitration method. As no centralized control is required among beacons, a Positioning system can still be easily deployed and expanded with this arbitration method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1051-1059
• /
• 2013

This paper proposes a complexity reduced list sphere decoding (LSD) scheme for joint iterative soft detection scheme for coded MIMO system. The conventional LSD scheme is based on searching the candidates with a fixed radius. However, once the candidate list is full, it is highly probable that the radius can be reduced. By reducing the radius, the complexity can be also reduced. We propose a simple and efficient radius update method for complexity reduction of list version sphere decoding and its application to iterative soft MIMO detection. We evaluate the performance of the proposed scheme with a joint soft-input-soft-ouput iterative MIMO detection in combination with turbo codes. Simulation results show that the proposed methods provide substantial complexity reduction while achieving similar bit error rate (BER) performance as the conventional LSD scheme.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.261-268
• /
• 2003

Conventional acoustic echo cancellers using ES algorithm have simple structure and fast convergence speed compared with those using NLMS algorithm, but they are very weak to external noise because ES algorithm updates the adaptive filter taps based on average energy reduction rate of room impulse response in specific acoustical condition. To solve this problem, in this paper, a new update algorithm for acoustic echo canceller with stepsize matrix generator is proposed. A set of stepsizes is determined based on residual error energy which is estimated by two moving average operators, and applied to the echo canceller in matrix from, resulting in improved convergence speed. Simulations in various noise condition show that the proposed algorithm improves the robustness of acoustic echo canceller to external noise.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2E
• /
• pp.58-67
• /
• 1994

Hidden Markov Model (HMM)-based algorithms have been used successfully in many speech recognition systems, especially large vocabulary systems. Although general purpose processors can be employed for the system, they inevitably suffer from the computational complexity and enormous data. Therefore, it is essential for real-time speech recognition to develop specialized hardware to accelerate the recognition steps. This paper concerns with a real-time implementation of an isolated word recognition system based on HMM. The speech recognition system consists of a host computer (PC), a DSP board, and a prototype Viterbi scoring board. The DSP board extracts feature vectors of speech signal. The Viterbi scoring board has been implemented using three field-programmable gate array chips. It employs a hardware-efficient Viterbi scoring architecture and performs the Viterbi algorithm for HMM-based speech recognition. At the clock rate of 10 MHz, the system can update about 100,000 states within a single frame of 10ms.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.45-52
• /
• 2012

In this paper, an crowd density in elevator estimation method based on multi-class Adaboost classifier is proposed. The SOM (Self-Organizing Map) based conventional methods have shown insufficient performance in practical scenarios and have weakness for low reproducibility. The proposed method estimates the crowd density using multi-class Adaboost classifier with texture features, namely, GLDM(Grey-Level Dependency Matrix) or GGDM(Grey-Gradient Dependency Matrix). In order to classify into multi-label, weak classifier which have better performance is generated by modifying a weight update equation of general Adaboost algorithm. The crowd density is classified into four categories depending on the number of persons in the crowd, which can be 0 person, 1-2 people, 3-4 people, and 5 or more people. The experimental results under indoor environment show the proposed method improves detection rate by about 20% compared to that of the conventional method.

• KDI Journal of Economic Policy
• /
• v.37 no.sup
• /
• pp.33-63
• /
• 2015

This paper attempts to investigate the Korean households' inflation expectations with particular attention to information rigidity. For this purpose, we derive an empirical model from a sticky information model $\acute{a}$ la Mankiw and Reis (2002) and estimate it. In addition, it is also examined whether the expectation formation is state-dependent on macroeconomic conditions. The main findings of this paper are as follows. First, it turns out that the information rigidity in Korean households' inflation expectations is very high. In a month, most of the households simply keep their inflation expectations the same as before instead of updating them based on newly arrived information. Furthermore, when updating their expectations, the households tend to rely on the backward-looking information such as actual inflation rates in the past rather than on the forward-looking forecasts by experts. Second, it is found that the expectation formation is varying as inflation rate changes. Specifically, when the inflation is high, the sensitivity of the households' inflation expectations to actual inflation increases and the gap between inflation expectations and actual inflation shrinks. It implies that Korean households update their expectations more frequently when the inflation matters than not.