• Title/Summary/Keyword: Fast adaptive algorithm

Search Result 431, Processing Time 0.027 seconds

Modified 3-step Search Motion Estimation Algorithm for Effective Early Termination (효과적인 조기 중단 기법을 위한 변형된 3단계 탐색 움직임 추정 알고리즘)

  • Yang, Hyeon-Cheol;Lee, Seong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.7
    • /
    • pp.70-77
    • /
    • 2010
  • Motion estimation occupies most of the required computation in video compression, and many fast search algorithms were propsoed to reduce huge computation. SAD (sum-of-absolute difference) calculation is the most computation-intensive process in the motion estimation. Early termination is widely used in SAD calculation, where SAD calculation is terminated and it proceeds to next search position if partial SAD during SAD calculation exceeds current minimum SAD. In this paper, we proposed a modified 3-step search algorithm for effective early termination where only search order of search positions are adaptive rearranged. Simulation results show that the proposed motion estimation algorithm reduces computation by 17~30% over conventional 3-step search algorithm without extra computation, while maintaining same performance.

Design of adaptive array antenna utilizing modified on-off algorithm and its real-time implementation on a general-purpose DSP (개선된 On-Off 앨고리듬을 이용한 적응 배열 안테나의 설계와 범용 DSP를 이용한 실시간 구현)

  • 염재흥;안성수;최승원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.4
    • /
    • pp.997-1005
    • /
    • 1998
  • This paper presents a modified on-off algorithm based on the gradient method for providing the phase of each antenna element more accurately and simply compared to the conventional on-off algorithm. The sup4erisority of theproposed method is due to the fact that the proposed method finds the increase and decrease of the array output power more accurately by utilizing the gradient of array output power with respect to the instantaneous phase of array element. The array antenna adopting to the proposed method formsmaximum beam-pattern along the direction of the desired signal by aligning the phase of every antenna enement. The proposed method is applied to both linear and two-dimentional aray for analyzing the result. The capability of the real-time processing of the proposed technique is confirmed by implementing the proposed algorithm with TMS320C30 Evaluation Module. Since the computational load required to form the beam-pattern per snapshot is small, the proposed method is suitable for the mobile communication system of which the response must be fast. By the results obtained from the application of the proposed method to the CDMA mobile communication environment, it is vreified that the performance of the received signal is consideralbly improved.

  • PDF

Performance Analysis of NM-MMA Adaptive Equalization Algorithm in Nonconstant Modulus Signal (Nonconstant Modulus 신호에서 NM-MMA 적응 등화 알고리즘의 성능 해석)

  • Lim, Seung Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.113-118
    • /
    • 2017
  • This paper propose the NM-MMA (Novel Mixed-MMA) that is possible to improving the convergence speed of current MMA algorithm and reducing the high MSE of SE-MMA algorithm, and its equalization performance were analyzed. The cost function of the NM-MMA configured as the sum of appropriate weights of gradient vector of current MMA and SE-MMA, and then it used for the updating the tap coefficient of equalizer. The computer simulation was performed applying the same environment in the channel, step size and signal to noise ratio, and the same performance index in equalizer output signal constellation, residual isi, MSE, SER was used. As a result of computer simulation, the proposed NM-MMA has fast convergence time than MMA, and less in MSE and SER performance compared to SE-MMA.

Adaptive Search Range Decision for Accelerating GPU-based Integer-pel Motion Estimation in HEVC Encoders (HEVC 부호화기에서 GPU 기반 정수화소 움직임 추정을 고속화하기 위한 적응적인 탐색영역 결정 방법)

  • Kim, Sangmin;Lee, Dongkyu;Sim, Dong-Gyu;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.699-712
    • /
    • 2014
  • In this paper, we propose a new Adaptive Search Range (ASR) decision algorithm for accelerating GPU-based Integer-pel Motion Estimation (IME) of High Efficiency Video Coding (HEVC). For deciding the ASR, we classify a frame into two models using Motion Vector Differences (MVDs) then adaptively decide the search ranges of each model. In order to apply the proposed algorithm to the GPU-based ME process, starting points of the ME are decided using only temporal Motion Vectors (MVs). The CPU decides the ASR as well as the starting points and transfers them to the GPU. Then, the GPU performs the integer-pel ME. The proposed algorithm reduces the total encoding time by 37.9% with BD-rate increase of 1.1% and yields 951.2 times faster ME against the CPU-based anchor. In addition, the proposed algorithm achieves the time reduction of 57.5% in the ME running time with the negligible coding loss of 0.6%, compared with the simple GPU-based ME without ASR decision.

Multi-Constant Modulus Algorithm for Blind Decision Feedback Equalizer (블라인드 결정 궤환 등화기를 위한 다중 계수 알고리즘)

  • Kim, Jung-Su;Chong, Jong-Wha
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.6
    • /
    • pp.709-717
    • /
    • 2002
  • A new multi constant modulus algorithm (MCMA) for a blind decision feedback equalizer is proposed. In order to avoid the error propagation problem in the conventional DFE structure, Feed-Back Filter coefficients are updated only after Feed-Forward Filter coefficients are sufficiently converged to the steady state. Therefore, it has the problem of slow convergence speed characteristics. To overcome this drawback, the proposed MCMA algorithm uses not only new cost function considering the minimum distance between the received signal and the representative value containing the statistical characteristics of the transmitted signal, but also adaptive step-size according to the equalizer outputs to fast convergence speed of FBF. Simulations were carried out under the certified communication channel environment to evaluate a performance of the proposed equalizer. The simulation results show that the proposed equalizer has an improved convergence and SER performance compared with previous methods. The proposed techniques offer the possibility of practical equalization for cable modem and terrestrial HDTV broadcast (using 8-VSB or 64-QAM) applications.

Performance Evaluation of Channel Estimation Algorithm for Pilot Symbol-Assisted IMT-2000 System over Multipath Rayleigh Fading Channel (다중경로 레일레이 페이딩 채널에서 파일럿 심볼 구조의 IMT-2000 시스템의 채널추정 알고리즘 성능평가)

  • 구제길;최형진
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.7
    • /
    • pp.1128-1138
    • /
    • 2000
  • This paper presents two different approaches for channel estimation of IMT-2000 pilot symbol-assisted W-CDMA reverse link over Rayleigh fading channels of one and two paths. By obtaining BER performance through computer simulations, the proposed algorithms of 2-point second-order interpolation and IDD BWMA are compared with the performance of existing interpolation and adaptive algorithms. The BER performance of the proposed algorithms is superior to WMSA, linear and second-order Gaussian interpolation, LMS, and RLS algorithm in fast fading channels. In particular, the BER performance of the IDD BWMA algorithm is nearly insensitive for Doppler frequency within simulation range $E_b/N_0$ = 28 dB. The two proposed algorithms also have relatively simple structure and similar processing delay in comparison to the existing algorithms. Therefore, these algorithms are more suitable for high-speed mobile communication environments.

  • PDF

A Study on Optimal Bit Loading Algorithms for Discrete MultiTone ADSL (DMT 변조방식을 사용하는 ADSL에서의 최적 비트 할당 방식 연구)

  • 이철우;박광철;윤기방;장수영;김기두
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.4
    • /
    • pp.395-402
    • /
    • 2002
  • In the conventional public switched telephone network(PSTN), there are various types of modulation that can be used in ADSL to offer fast data communication, two of which are CAP(Carrierless Amplitude Phase) and DMT(Discrete MultiTone). As we consider the current situation, DMT is getting more predominant in the market than CAP. One of the reasons is that it gives high performance in spite of its high complexity Since DMT divides the full range of bandwidth into 256 sub-channels, it can be highly adaptive in the circumstances, where the problems of attenuation and noise caused by the propagation distance are very crucial. In this paper, a new bit loading algorithm for DMT modulation is proposed. The proposed algorithm can be efficiently implemented in a way that it requires less computation than the conventional modulation techniques. In contrast to the conventional algorithms which perform sorting processing, the proposed algorithm uses look-up tables to reduce the repetition of calculation. Consequently, it is shown that less processing time and lower complexity can be achieved.

A Nonlinear Speed Control of a Permanent Magnet Synchronous Motor Using a Sequential Parameter Auto-Tuning Algorithm for Servo Equipments (서보 설비를 위한 순차적 파라미터 자동 튜닝 알고리즘을 사용한 영구자석 동기전동기의 비선형 속도 제어)

  • Kim, Kyeong-Hwa
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.19 no.2
    • /
    • pp.114-123
    • /
    • 2005
  • A nonlinear speed control of a PMSM using a sequential parameter auto-tuning algorithm for servo equipments is presented. The nonlinear control scheme gives an undesirable output performance under the mismatch of the system parameters and load conditions. Recently, to improve the performance, an adaptive linearization scheme, a sliding mode control and an observer-based technique have been reported. Although a good performance can be obtained, the performance is not satisfactory any more under specific conditions such as a large inertia variation, a fast speed transient or an increased sampling time. The simultaneous estimation of principal parameters giving a direct influence on speed dynamics is generally not simple. To overcome this problem, a a sequential parameter auto-tuning algorithm at start-up is proposed, where dominant parameters are estimated in a prescribed regular sequence based on the method that one parameter is estimated during each interval. The proposed scheme is implemented on a PMSM using DSP TMS320C31 and the effectiveness is verified through simulations and experiments.

Fast Motion Estimation for Variable Motion Block Size in H.264 Standard (H.264 표준의 가변 움직임 블록을 위한 고속 움직임 탐색 기법)

  • 최웅일;전병우
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.209-220
    • /
    • 2004
  • The main feature of H.264 standard against conventional video standards is the high coding efficiency and the network friendliness. In spite of these outstanding features, it is not easy to implement H.264 codec as a real-time system due to its high requirement of memory bandwidth and intensive computation. Although the variable block size motion compensation using multiple reference frames is one of the key coding tools to bring about its main performance gain, it demands substantial computational complexity due to SAD (Sum of Absolute Difference) calculation among all possible combinations of coding modes to find the best motion vector. For speedup of motion estimation process, therefore, this paper proposes fast algorithms for both integer-pel and fractional-pel motion search. Since many conventional fast integer-pel motion estimation algorithms are not suitable for H.264 having variable motion block sizes, we propose the motion field adaptive search using the hierarchical block structure based on the diamond search applicable to variable motion block sizes. Besides, we also propose fast fractional-pel motion search using small diamond search centered by predictive motion vector based on statistical characteristic of motion vector.

Fast Object Detection with DPM using Adaptive Bilinear Interpolated Image Pyramid (적응적 쌍선형 보간 이미지 피라미드를 이용한 DPM 기반 고속 객체 인식 기법)

  • Han, Gyu-Dong;Kim, Eung-Tae
    • Journal of Broadcast Engineering
    • /
    • v.25 no.3
    • /
    • pp.362-373
    • /
    • 2020
  • Recently, as autonomous vehicles and intelligent CCTV are growing more interest, the efficient object detection is essential technique. The DPM(Deformable Part Models) which is basis of this paper have used a typical object system that represents highly variable objects using mixtures of deformable part for object. Although it shows high detection performance by capturing part shape and configuration of object model, but it is limited to use in real application due to the complicated algorithm. In this paper, instead of image feature pyramid that takes up a large amount of computation in one part of the detector, we propose a method to reduce the computation speed by reconstructing a new image feature pyramid that uses adaptive bilinear interpolation of feature maps obtained on a specific image scale. As a result, the detection performance for object was lowered a little by 2.82%, however, the proposed detection method improved the speed performance by 10% in comparison with original DPM.