• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.313-325
• /
• 1996

This paper presents a new architecture for full-search block-matching motion estimation. The architecture is based on linear systolic arrays. High speed operation is obtained by feeding reference data, search data, and control signals into the linear systolic array in a pipelined fashion. Input data are fed into the linear systolic array at a half of the processor speed, reducing the required data bandwidth to half. The proposed architecture has a good scalability with respect to the number of processors and input bandwidth when the size of reference block and search range change.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.449-451
• /
• 2003

The estimation of time-series data is fundamental process in many data analysis cases. However, the unwanted measurement error is usually added to true data, so that the exact estimation depends on efficient method to eliminate the error components. The wavelet transform method nowadays is expected to improve the accuracy of estimation, because it is able to decompose and analyze the data in various resolutions. Therefore, the wavelet based Kalman filter method for the estimation of time-series data is proposed in this paper. The wavelet transform separates the data in accordance with frequency bandwidth, and the detail wavelet coefficient reflects the stochastic process of error components. This property makes it possible to obtain the covariance of measurement error. We attempt the estimation of true data through recursive Kalman filtering algorithm with the obtained covariance value. The procedure is verified with the fundamental example of Brownian walk process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.471-489
• /
• 2013

Data compression at the transport layer could both reduce transmitted bytes over network links and increase the transmitted application data (TCP PDU) in one RTT at the same network conditions. Therefore, it is able to improve transmission efficiency on Internet, especially on the networks with limited bandwidth or long delay links. In this paper, we propose an on-the-fly TCP data compression scheme, i.e., the TCPComp, to enhance TCP performance. This scheme is primarily composed of the compression decision mechanism and the compression ratio estimation algorithm. When the application data arrives at the transport layer, the compression decision mechanism is applied to determine which data block could be compressed. The compression ratio estimation algorithm is employed to predict compression ratios of upcoming application data for determining the proper size of the next data block so as to maximize compression efficiency. Furthermore, the assessment criteria for TCP data compression scheme are systematically developed. Experimental results show that the scheme can effectively reduce transmitted TCP segments and bytes, leading to greater transmission efficiency compared with the standard TCP and other TCP compression schemes.

• 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.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.10 s.89
• /
• pp.996-1004
• /
• 2004

1-Dimensional Cluster-Based Sequence Equalizer(1-D CBSE) lessens computational load, compared with the classic maximum likelihood sequence estimation(MLSE) equalizers, and has the superiority in the nonlinear channels. In this paper, we proposed an algorithm of searching for optimal training sequence that estimates the cluster centers instead of time-varying multipath fading channel estimation. The proposed equalizer not only resolved the problems in 1-D CBSE but also improved the bandwidth efficiency using the shorten length of taming sequence to improve bandwidth efficiency. In experiments, the superiority of the new method is demonstrated by comparing conventional 1-D CBSE and related analysis.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.125-132
• /
• 2007

Transmission mechanisms that include an available bandwidth estimation algorithm and a packet loss differentiation scheme, in general, exhibit higher TCP performance in wireless networks. TCP New Jersey, known as the best existing scheme in terms of goodput, improves wireless TCP performance using the available bandwidth estimation at the sender and the congestion warning at intermediate routers. Although TCP New Jersey achieves 17% and 85% improvements in goodput over TCP Westwood and TCP Reno, respectively, we further improve TCP New Jersey by exploring improved available bandwidth estimation, retransmission timeout, and recovery mechanisms. Hence, we propose TCP New Jersey PLUS (shortly TCP NJ+), showing that under 1% packet loss rate, it outperforms 3% by TCP New Jersey and 5% by TCP Wes1wood. In 5% packet loss rate, a characteristic of high bit-error-rate wireless network, it outperforms other TCP variants by 19% to 104% in terms of goodput even when the network is in bi-directional congestion.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.6
• /
• pp.365-373
• /
• 2010

For effective underwater digital communications, a frame structure is used, which includes pilots in time and frequency domains for channel estimation at a receiver. To estimate channel precisely, the each pilot should be located less than coherence time and coherence bandwidth. This paper measured underwater communication environments to provide coherence time and coherence bandwidth. Based on the measurement, the paper exhibits the calculated coherence time and coherent bandwidth is adequate by computer simulations.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.7
• /
• pp.37-42
• /
• 2008

In this paper, a real-time multiview video coding system using fast disparity estimation is proposed. In the multiview encoder, adaptive disparity-motion estimation (DME) for an effective 3-dimensional (3D) processing are proposed. That is, by adaptively predicting the mutual correlation between stereo images in the key-frame using the proposed algorithm, the bandwidth of stereo input images can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and adaptive disparity vectors. Also, in multiview decoder, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (DSA) for real-time multiview video processing is proposed. The proposed IVR can reduce a processing time of disparity estimation by selecting adaptively disparity search range. Accordingly, the proposed multiview video coding system is able to increase the efficiency of the coding rate and improve the resolution.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.693-698
• /
• 2000

Aspects of classical information theory, such as rate distortion theory, investigate how to encode and decode information from an independently identically distributed source so that the asymptotic distortion rate between the source and its quantized representation is minimized. However, in most natural dynamics, the source state is highly corrupted by disturbances, and the measurement contains the noise. In recent coder-estimator sequence is developed for state estimation problem based on observations transmitted with finite communication capacity constraints. Unlike classical estimation problems where the observation is a continuous process corrupted by additive noises, the condition is that the observations must be coded and transmitted over a digital communication channel with finite capacity. However, coder-estimator sequence does not provide such a quantitative analysis as a variance for estimation error. In this paper, under the assumption that the estimation error is Gaussian distribution, a variance for coder-estimation sequence is proposed and its fitness is evaluated through simulations with a simple example.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.495-507
• /
• 2005

Measuring the end-to-end available bandwidth in the Internet is a useful tool for distributedapplication services or QoS (Quality-of-Service) guarantee. To measure the end-to-end available bandwidth, Single-hop Gap model-based packet train measurement techniques are well-known. However, the error of packet train output gap can happen by network topologies. This error of the output gap causes the inaccuracy of the available bandwidth measurement. In this paper, we propose a new end-to-end available bandwidth measurement technique with accurate capacity measurement and fast convergence methods. To solve the erroneous capacity measurement problem of the back-to-back packet train transmission, we propose a new available bandwidth measurement method by decoupling the capacity measurement with the initial gap of the packet train. Also, we propose a new technique to predict the proper initial gap of the packet train for faster convergence. We evaluate our proposed method by the simulation in various topologies comparing with previous methods.