• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.249-254
• /
• 2002

We consider a buffer-constrained adaptive quantization algorithm for image compression. Buffer control algorithm was considered with source coding scheme by some researchers and recently a formal description of the algorithm in terms of rate-distortion has been developed. We propose a buffer control algorithm that incorporates the buffer occupancy into the Lagrange multiplier form in a rate-distortion cost measure. Although the proposed algorithm provides the suboptimal performance as opposed to the optimal Vieterbi algorithm, it can be implemented with very low computaional complexity. In addition stability of this buffer control algorithm has been mentioned briefly using Liapnov stability theory.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.284-286
• /
• 2011

LDPC(low density parity check) 부호는 낮은 복잡성과 Shannon의 한계에 근접하는 오류 정정 능력을 보이기 때문에 turbo 부호와 함께 많은 응용분야에 적용되고 있다. 본 논문에서는 분산 동영상 부호화(distributed video coding: DVC) 시스템을 위한 부호율 적응적인(rate adaptive) LDPC 부호를 설계하기 위하여 패리티 점검 노드를 병합하는 방법을 제안한다. ACE(approximation cycles EMD) 알고리즘을 기반으로 효율적인 LDPC 부호를 설계하고 부호율 적응적인 특성을 갖기 위해 일정한 범위를 지정하고 지정된 범위에 따라 패리티 점검 노드를 병합한다. 그리고 ACE 알고리즘의 계수와 degree distribution을 변화시키면서 성능을 해석한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.467-472
• /
• 2008

One of the maindisadvantages of Orthogonal Frequency Division Multiplexing (OFDM) is the Peak to Average Power Ratio (PAPR) problem. To reduce PAPR and improve the error performance of the OFDM signal over a fading channel, an OFDM system combining an Adaptive Symbol Selection Scheme (ASSS) and channel estimation can be used. Because of the side information of ASSS, however, the data rate decreases in the conventional ASSS OFDM system. In this letter, to overcome this impairment, we propose a technique to transmit side information by using pilot tones, and demonstrate that the proposed technique can give reasonable bit error rate (BER) performance.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2004.07b
• /
• pp.1234-1238
• /
• 2004

A Controlled neural networks are proposed in order to measure nonlinear environments in adaptive and in realtime. The structure of it is similar to recurrent neural networks: a delayed output as the input and a delayed error between tile output of plant and neural networks as a bias input. In addition, we compute the desired value of hidden layer by an optimal method instead of transfering desired values by backpropagation and each weights are updated by RLS(Recursive Least Square). Consequently, this neural networks are not sensitive to initial weights and a learning rate, and have a faster convergence rate than conventional neural networks. This new neural networks is Error Estimated Neural Networks. We can estimate nonlinear models in realtime by the proposed networks and control nonlinear models. To show the performance of this one, we have various experiments. And this controller call prove effectively to be control in the environments of various systems.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.3
• /
• pp.713-723
• /
• 1995

In intelligent machine tools, a computer based control system, which can adapt the machining parameters in an optimal fashion based on sensor measurements of the machining process, should be incorporated. In this paper, the technology for adaptively optimizing the cutting conditions to maximize the material removal rate in face milling operations is proposed using the exterior penalty function method combined with multilayered neural networks. Two neural networks are introduced ; one for estimating tool were length, the other for mapping input and output relations from experimental data. Then, the optimization of cutting conditions is adaptively implemented using tool were information and predicted process output. The results are demonstrated with respect to each level of machining such as rough, fine and finish cutting.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.240-240
• /
• 2000

This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4573-4584
• /
• 2015

The traditional feature extraction algorithms for recognition of communication signals can hardly realize the balance between computational complexity and signals' interclass gathered degrees. They can hardly achieve high recognition rate at low SNR conditions. To solve this problem, a novel feature extraction algorithm based on Holder coefficient was proposed, which has the advantages of low computational complexity and good interclass gathered degree even at low SNR conditions. In this research, the selection methods of parameters and distribution properties of the extracted features regarding Holder coefficient theory were firstly explored, and then interval gray relation algorithm with improved adaptive weight was adopted to verify the effectiveness of the extracted features. Compared with traditional algorithms, the proposed algorithm can more accurately recognize signals at low SNR conditions. Simulation results show that Holder coefficient based features are stable and have good interclass gathered degree, and interval gray relation classifier with adaptive weight can achieve the recognition rate up to 87% even at the SNR of -5dB.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.449-450
• /
• 2006

This paper describes an adaptive hybrid fingerprint matching method using minutiae, filterbank, and the quality of fingerprint. We estimate the quality of each block in the fingerprint image and extract the probability expectation about the quality of each block. By using this expectation, we could achieve the robust matching rate despite of noise distortion. The matching rate of the proposed method is higher than that of other methods. However, the matching speed is similar with that of others as shown in the results.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.83-84
• /
• 2007

Multiple-input multiple-output (MIMO) systems can achieve the increasing of performances by using an adaptive power allocation. The related previous work limited the transmit antenna number because orthogonal space-time block codes (OSTBCs) yield full transmit rate only for two transmit antennas. We extend a robust system under imperfect channel estimation for four transmission antennas with maintaining a full transmission rate.