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

In this paper, channel error characteristics are investigated to alleviate the channel error propagation problem of the digital TV transmission systems. First, error propagation problems, which are mainly caused by the inter-frame dependancy and variable length coding of the MPEG-2 baseline encoder, are intensively analyzed. Next, existing channel resilient schemes are systematically classified into two kinds of schemes; one for the encoder and the other for the decoder. By comparing the performance and implementation cost, the encoder side schemes, such as error localization, layered coding, error resilience bit stream generation techniques, are described in this paper. Also, in an effort to consider the parcticality of the real transmission situation, an efficient error detection scheme for a decoder system is proposed by employing a priori information of the bit stream syntas, checking the encoding conditions at the encoder stage, and exploiting the statistics of the image itself. Finally, subsequent error concealment technique based on the DCT coefficient recovery algorithm is adopted to evaluate the performance of the proposed error resilience technique. The computer simulation results show that the quality of the received image is significantly improved when the bit error rate is as high as 10$^{-5}$ .

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.11-25
• /
• 2018

While being believed that decrypting any RSA ciphertext is as hard as factorizing the RSA modulus, it was also shown that, if additional information is available, breaking the RSA cryptosystem may be much easier than factoring. For example, Coppersmith showed that, given the 1/2 fraction of the least or the most significant bits of one of two RSA primes, one can factorize the RSA modulus very efficiently, using the lattice-based technique. More recently, introducing the so called cold boot attack, Halderman et al. showed that one can recover cryptographic keys from a decayed DRAM image. And, following up this result, Heninger and Shacham presented a polynomial-time attack which, given 0.27-fraction of the RSA private key of the form (p, q, d, $d_p$, $d_q$), can recover the whole key, provided that the given bits are uniformly distributed. And, based on the work of Heninger and Shacham, this paper presents a different approach for recovering RSA private key bits from decayed key information, under the assumption that some random portion of the private key bits is known. More precisely, we present the algorithm of recovering RSA private key bits from erased key material and elaborate the formula of describing the number of partially-recovered RSA private key candidates in terms of the given erasure rate. Then, the result is justified by some extensive experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.349-354
• /
• 2005

Several IP autoconfiguration techniques for MANET have been proposed by this time. But most of them concentrate on dealing with address duplication, so they have problems with latency and inefficient address space utilization. In this paper, we proposed a new IP autoconfiguration technique, namely Relational MANET Autoconfiguration Protocol(RMAP). This technique distributes IP addresses effectively by exchanging messages and recovers IP addresses by applying parent-child relationship. Simulation experiments are conducted to demonstrate the enhancement of the proposed algorithm over other known algorithms regarding latency, uniform distribution, and IP address recovery ratio.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.11
• /
• pp.664-670
• /
• 2004

This paper presents a new velocity estimation strategy of a non-salient permanent magnet synchronous motor (PMSM) drive without high frequency signal injection or special PWM pattern. This approach is based on the d-axis current regulator output voltage of the drive system that has the information of rotor position error. The rotor velocity can be estimated through a rotor position tracking PI controller that controls the position error to zero. For zero and low speed operation, PI controller gains of rotor position tracking controller have a variable structure according to the estimated rotor velocity. In order to boost the bandwidth of PI controller around zero speed, a loop recovery technique is applied to the control system. The proposed method only requires the flux linkage of permanent magnet and is insensitive to the parameter estimation error and variation. The designers can easily determine the possible operating range with a desired bandwidth and perform the vector control even at low speeds. The experimental results show the satisfactory operation of the proposed sensorless algorithm under rated load conditions.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.311-315
• /
• 2003

Recently, there is asymmetrical transmission in Internet data stream. The asymmetrical transmission has much more downstream than upstream. Owing to this point, it needs to reduce the acknowledgement as element of the obsrtuction in downstream. In this paper, according to simulation's result, we know that Sack has good performance than New Reno in bottleneck environment Comparing two protocols in packet loss rate, NewReno is lower than Sack. And also comparing two protocols in throughput of ack packet, not only NewReno processes ack packet more quickly than Sack, but also NewReno processes more ack packet than Sack protocol during ten seconds in simulation. As a result, NewReno is batter than Sack in throughput of asymmetrical link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.124-131
• /
• 2007

This paper presents a block loss recovery technique for the image block data corrupted by transmission losses through the employment of fine directional interpolation (FDI). The proposed algorithm introduces a spatial direction vector (SDV). The SDVs are extracted from the edge information of the neighboring image data. Subsequently, the SDVs are adaptively applied to interpolate lost pixels on a pixel-by-pixel basis. This approach improves the capability to more reliably recover high-detailed contents in the corrupted block. Experimental results demonstrate that the FDI method performs better as compared to previous techniques.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.265-273
• /
• 2007

This paper expands an analytical performance model of 802.11 to accurately estimate throughput and energy demand of 802.11-based wireless sensor network (WSN) when sensor nodes employ Reed-Solomon (RS) codes, one of block forward error correction (FEC) techniques. This model evaluates these two metrics as a function of the channel bit error rate (BER) and the RS symbol size. Since the basic recovery unit of RS codes is a symbol not a bit, the symbol size affects the WSN performance even if each packet carries the same amount of FEC check bits. The larger size is more effective to recover long-lasting error bursts although it increases the computational complexity of encoding and decoding RS codes. For applying the extended model to WSNs, this paper collects traffic traces from a WSN consisting of two TIP50CM sensor nodes and measures its energy consumption for processing RS codes. Based on traces, it approximates WSN channels with Gilbert models. The computational analyses confirm that the adoption of RS codes in 802.11 significantly improves its throughput and energy efficiency of WSNs with a high BER. They also predict that the choice of an appropriate RS symbol size causes a lot of difference in throughput and power waste over short-term durations while the symbol size rarely affects the long-term average of these metrics.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.6 s.171
• /
• pp.207-212
• /
• 2005

The purpose of this work is to develop the FES controller that can cope with the muscle fatigue which is one of the most important problems of current FES (Functional Electrical Stimulation). The feasibility of the proposed FES controller was evaluated by simulation. We used a fitness function to describe the effect of muscle fatigue and recovery process. The FES control system was developed based on the biological neuronal system. Specifically, we used PD (Proportional and Derivative) and GC (Gravity Compensation) control, which was described by the neuronal feedback structure. It was possible to control of multiple joints and muscles by using the phase-based PD and GC control method and the static optimization. As a result, the proposed FES control system could maintain the cycling motion in spite of the muscle fatigue. It is expected that the proposed FES controller will play an important role in the rehabilitation of SCI patient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.333-351
• /
• 2008

Transmission control protocols have to overcome common problems in wireless networks. TCP employing both packet loss discrimination mechanism and available bandwidth estimation algorithm, known as the good existing solution, shows significant performance enhancement in wireless networks. For instance, TCP New Jersey which exhibits high throughput in wireless networks intends to improve TCP performance by using available bandwidth estimation and congestion warning. Even though it achieves 17% and 85% improvements in terms of goodput over TCP Westwood and TCP Reno, respectively, we further improve it by exploring maximized available bandwidth estimation, handling bit-error-rate error recovery, and effective adjustment of sending rate for retransmission timeout. Hence, we propose TCP NJ+, showing that for up to 5% packet loss rate, it outperforms other TCP variants by 19% to 104% in terms of goodput when the network is in bi-directional background traffic.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.116-116
• /
• 2017

지하수 인공함양은 수자원확보 및 비상시 용수를 목적으로 세계적으로 연구 및 프로젝트가 진행되고 있다. 인공함양의 방법에는 여러 가지의 방식이 있지만 본 연구는 관정을 통해 주입하는 ASTR(Aquifer Storage Transfer and Recovery)방법을 이용하여 연구하였다. ASTR이란 지표수를 인공적인 방법으로 대수층에 주입시키고, 일정기간 저장시키거나 유하시킨 후 양수하는 방법이다. 염수로 포화된 피압대수층에 담수를 주입하여 염수를 치환할 수 있는 주입-양수 시스템을 연구하였다. 염수로 포화된 대수층에서 인공함양기술을 성공시키기 위해서는 양수정으로 유입되는 염수비율이 0%을 만족하며, 주입으로 인한 수위상승량은 지반변형을 일으키지 않는 최소한의 값을 가지는 것이다. 본 연구는 앞서 언급한 인공함양기술을 성공시키기 위해 지하수 흐름모델과 최적화 모델을 결합한 최적전산모델을 이용하여 모의하였다. 지하수 흐름모델은 경계면모델을, 최적화 기법은 GA(Genetic Algorithm)을 이용하였다. 구축된 목적함수로는 양수정의 담수비율 최대화, 주입정에서의 수위상승량 최소화 그리고 양수개시시간 최소화로 구성하였다. 제약조건으로는 총 주입량 및 양수량 그리고 주입 및 양수정 개수이다. 서술한 목적함수와 제약조건을 만족하는 주입/양수정의 위치 및 유량을 최적전산모델로부터 얻을 수 있다. 기존 지하수 인공함양 및 개발은 사례별 연구 또는 전문가의 주관적 판단에 의존하는 경향이 있었다. 본 연구는 최적화 기법을 통해 복수의 관정에서 정량적인 산정이 가능하다. 현재 모델링에 의존한 연구로써 한계가 있지만, 추후 실제현장에 적용하여 모델 검정을 통해 신뢰도를 높이며 지하수 인공함양 개발에 많은 공헌을 할 수 있을 것으로 예상한다.