• Title/Summary/Keyword: Current matching

Search Result 496, Processing Time 0.027 seconds

RICCI CURVATURE, CIRCULANTS, AND EXTENDED MATCHING CONDITIONS

  • Dagli, Mehmet;Olmez, Oktay;Smith, Jonathan D.H.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.1
    • /
    • pp.201-217
    • /
    • 2019
  • Ricci curvature for locally finite graphs, as proposed by Lin, Lu and Yau, provides a useful isomorphism invariant. A Matching Condition was introduced as a key tool for computation of this Ricci curvature. The scope of the Matching Condition is quite broad, but it does not cover all cases. Thus the current paper introduces extended versions of the Matching Condition, and applies them to the computation of the Ricci curvature of a class of circulants determined by certain number-theoretic data. The classical Matching Condition is also applied to determine the Ricci curvature for other families of circulants, along with Cayley graphs of abelian groups that are generated by the complements of (unions of) subgroups.

Design of Low Noise Amplifier Utilizing Input and Inter Stage Matching Circuits (다양한 매칭 회로들을 활용한 저잡음 증폭기 설계 연구)

  • Jo, Sung-Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.6
    • /
    • pp.853-856
    • /
    • 2021
  • In this paper, a low noise amplifier having high gain and low noise by using input and inter stage matching circuits has been designed. A current-reused two-stage common-source topology is adopted, which can obtain high gain and low power consumption. Deterioration of noise characteristics according to the source inductive degeneration matching is compensated by adopting additional matching circuits. Moreover trade-offs among noise, gain, linearity, impedance matching, and power dissipation have been considered. In this design, 0.18-mm CMOS process is employed for the simulation. The simulated results show that the designed low noise amplifier can provide high power gain and low noise characteristics.

Optimal Search Patterns for Fast Block Matching Motion Estimation (고속 블록정합 움직임 추정을 위한 최적의 탐색 패턴)

  • 임동근;호요성
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.39-42
    • /
    • 2000
  • Motion estimation plays an important role for video coding. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of block shape and size, we can find an optimal search pattern for initial motion estimation. The proposed idea, which has been verified experimentally by computer simulations, can provide an analytical basis for the current MPEG-2 proposals. In order to choose a more compact search pattern for BMA, we exploit the statistical relationship between the motion and the frame difference of each block.

  • PDF

An equivalent Circuit Model of Transformer Coupled Plasma Source (축전 용량이 고려된 평판형 유도 결합 플라즈마 원의 등가회로 모델)

  • Kim, Jeong-Mi;Kwon, D.C.;Yoon, N.S.
    • Proceedings of the KIEE Conference
    • /
    • 2002.07c
    • /
    • pp.1760-1762
    • /
    • 2002
  • In this work we develop an equivalent circuit model of TCP(transformer coupled plasma) source and investigate matching characteristic. The developed circuit model includes transmission line, standard-type impedance matching network and displacement current in the plasma source. The impedance of TCP is calculated by previously developed program for various source parameters and dependance of components of matching impedance on the value of source impedance is investigated.

  • PDF

A Fast Normalized Cross Correlation-Based Block Matching Algorithm Using Multilevel Cauchy-Schwartz Inequality

  • Song, Byung-Cheol
    • ETRI Journal
    • /
    • v.33 no.3
    • /
    • pp.401-406
    • /
    • 2011
  • This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm.

Reduced-bit transform based block matching algorithm via SAD (영상의 저 비트 변환을 이용한 SAD 블록 정합 알고리즘)

  • Kim, Sang-Chul;Park, Soon-Yong;Chien, Sung-Il
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.1
    • /
    • pp.107-115
    • /
    • 2014
  • The reduced-bit transform based bit-plane matching algorithm (BPM) can obtain the block matching result through its simple calculation and hardware design compared to the conventional block matching algorithms (BMAs), but the block matching accuracy of BPMs is somewhat low. In this paper, reduced-bit transform based sum of the absolute difference (R-SAD) is proposed to improve the block matching accuracy in comparison with the conventional BPMs and it is shown that the matching process can be obtained using the logical operations. Firstly, this method transforms the current and the reference images into their respective 2-bit images and then a truth table is obtained from the relation between input and output 2-bit images. Next, a truth table is simplified by Karnaugh map and the absolute difference is calculated by using simple logical operations. Finally, the simulation results show that the proposed R-SAD can obtain higher accuracy in block matching results compared to the conventional BPMs through the PSNR analysis in the motion compensation experiments.

A Stereo Matching Technique using Multi-directional Scan-line Optimization and Reliability-based Hole-filling (다중방향성 정합선 최적화와 신뢰도 기반 공백복원을 이용한 스테레오 정합)

  • Baek, Seung-Hae;Park, Soon-Young
    • The KIPS Transactions:PartB
    • /
    • v.17B no.2
    • /
    • pp.115-124
    • /
    • 2010
  • Stereo matching techniques are categorized in two major schemes, local and global matching techniques. In global matching schemes, several investigations are introduced, where cost accumulation is performed in multiple matching lines. In this paper, we introduce a new multi-line stereo matching techniques which expands a conventional single-line matching scheme to multiple one. Matching cost is based on simple normalized cross correlation. We expand the scan-line optimization technique to a multi-line scan-line optimization technique. The proposed technique first generates a reliability image, which is iteratively updated based on the previous reliability measure. After some number of iterations, the reliability image is completed by a hole-filling algorithm. The hole-filling algorithm introduces a disparity score table which records the disparity score of the current pixel. The disparity of an empty pixel is determined by comparing the scores of the neighboring pixels. The proposed technique is tested using the Middlebury and CMU stereo images. The error analysis shows that the proposed matching technique yields better performance than using conventional global matching algorithm.

Current-Mode Electronically Tunable Universal Filter Using Only Plus-Type Current Controlled Conveyors and Grounded Capacitors

  • Minaei, Shahram;Turkoz, Sait
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.292-296
    • /
    • 2004
  • In this paper we present a new current-mode electronically tunable universal filter using only plus-type current controlled conveyors (CCCII+s) and grounded capacitors. The proposed circuit can simultaneously realize lowpass, bandpass, and highpass filter functions - all at high impedance outputs. The realization of a notch response does not require additional active elements. The circuit enjoys an independent current control of parameters $\omega_0$ and $\omega_0/Q$. No element matching conditions are imposed. Both its active and passive sensitivities are low.

  • PDF

LED Backlight Driving Circuits and Dimming Method

  • Kwon, Oh-Kyong;Jung, Young-Ho;Lee, Yong-Hak;Cho, Hyun-Suk;Nam, Ki-Soo;In, Hai-Jung
    • Journal of Information Display
    • /
    • v.11 no.4
    • /
    • pp.173-181
    • /
    • 2010
  • In this paper, light-emitting-diode (LED) backlight driving circuits and dimming method for medium-sized and large liquid crystal displays (LCDs) are proposed. The double loop control method, the intelligent-phase-shifted PWM dimming method, the fast-switching current regulator, and the current matching techniques are proposed to improve not only the current regulation characteristics and the power efficiency but also the current matching characteristics and the transient response of the LED current. The brightness of the backlight using the proposed local dimming method was determined from the histogram of the local block to reduce the power consumption of the backlight without image distortion. The measured maximum power efficiency of the LED backlight driving circuit for medium-sized LCDs was 90%, and the simulation results showed an 88% maximum power efficiency of the LED backlight driving circuit for large LCDs. The maximum backlight power-saving ratio of the proposed dimming method was 41.7% in the simulation with a high-contrast image. The experiment and simulation results showed that the performance of LEDs as LCD backlight units (BLUs) improved with the proposed circuits and method.

A Full- Search Block-Matching Algorithm With Early Retirement of Processing Elements (단위 처리기를 조기 은퇴시키는 완전탐색 블록정합 알고리듬)

  • 남기철;채수익
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.11
    • /
    • pp.1417-1423
    • /
    • 1995
  • In this paper, we propose a full-search block-matching algorithm with early retirement, which can be applied to a 1-D systolic array of processing elements (PE's) for fast motion estimation. In the proposed algorithm, a PE is retired when its current accumulated sum is equal to or larger than the current minimum MAD. If all PE's are retired, the MAD calculation is stopped for the current array position and is started for the next one in the search window. Simulation results show that the optimum motion vector is always found with less computation, the total computation cycles for motion estimation are decreased to about 60%, and the power dissipation in the PE's is reduced to about 40-60%.

  • PDF