• 한국전자파학회논문지
• /
• 제21권6호
• /
• pp.681-689
• /
• 2010

본 논문에서는 분산 소자 형태의 마이너스 군지연 회로를 이용함으로써 피드포워드 증폭기의 효율 개선 및 구현의 용이성을 증대시킬 수 있는 새로운 구조의 피드포워드 증폭기를 제안한다. 피드포워드 증폭기의 지연 소자에 의한 삽입 손실은 심각한 시스템의 효율 저하를 유발한다. 일반적으로 이러한 손실을 줄이기 위하여 고출력 동축 케이블 또는 지연 선로 여파기를 사용하지만, 그러한 소자들의 삽입 손실조차도 무시할 수 없어서 피드포워드 증폭기의 제약 사항으로 작용한다. 제안하는 마이너스 군지연 회로를 이용함으로써 광대역 선형화를 위해 혼변조 왜곡 신호 상쇄 루프에 사용되는 지연 소자를 제거할 수 있다. 중심 주파수가 2.14 GHz인 WCDMA 하향 대역에서 -9 ns의 군지연, 0.2 dB의 삽입 손실, 그리고 30 MHz의 대역폭을 갖도록 제작된 2단 분산 소자 마이너스 군지연 회로를 이용하여 제작된 제안하는 구조의 피드포워드 증폭기는 평균 출력 전력이 44 dBm 일 때 -53.2 dBc의 인접 채널 누설비(Adjacent Channel Leakage Ratio: ACLR)를, 19.4 %의 전력 부가 효율(Power Added Efficiency: PAE)을 갖는 것으로 측정되었다.

• 한국IT서비스학회지
• /
• 제10권4호
• /
• pp.259-268
• /
• 2011

A robot education system by emulation based on Web can be efficiently used for understanding concept of robot assembly practice and control mechanism of robot by control programming. It is important to predict the path of the line tracer robot which has to be decided by the robot. Shortest Path Algorithm is a well known algorithm which searches the most efficient path between the start node and the end node. There are two related typical algorithms. Dijkstra Algorithm searches the shortest path tree from a node to the rest of the other nodes. $A^*$ Algorithm searches the shortest paths among all nodes. The delay time caused by turning the direction of navigation for the line tracer robot at the crossroads can give big differences to the travel time of the robot. So we need an efficient path determine algorithm which can solve this problem. Thus, It is necessary to analyze the overhead of changing direction of robot at multi-linked node to determine the next direction for efficient routings. In this paper, we reflect the real delay time of directional changing from the real robot. A speed based Dijkstra algorithm is proposed and compared with the previous ones to analyze the performance.

• Journal of Biosystems Engineering
• /
• 제12권3호
• /
• pp.42-49
• /
• 1987

The threshing action of the head-fed type threshing unit occurs mainly by the impact between threshing tooth and grains. It may be therefore the most fundamental step to calculate the time and order of the occurrance of impact by the tooth for predicting the performance of threshing unit. The threshing teeth arrangement was defined by length and diameter of threshing dram, number of spiral arrays, number of threshing teeth by kind per one spiral array, number of windings of spiral array around the threshing drum, delay angle of impact line. The linear equations for locus of left and right margin of paddy bundle, spiral array, impact line on the development figure of the threshing drum were expressed by fastors of the threshing teeth arrangement. In the computer program, the teeth which inflict impact were searched successively along the impact line. Searching range and impact condition were defined by the relation between four linear equations. If the impacting tooth was found, time and the kind of threshing tooth was derived from the coordinate of the threshing tooth. At this time the unit torque curve was accumulated on the array of computer memory. At last the completed torque curve of threshing drum shaft was described on the computer screen. Remarkably the peack valae and fluctuation of torque curve was decreased by adopting the delay angle of impact line.

• Journal of electromagnetic engineering and science
• /
• 제13권4호
• /
• pp.224-232
• /
• 2013

This paper describes composite cavity-backed crossed scythe-shaped dipoles with wide-beam circularly polarized (CP) radiation for use in Global Navigation Satellite Systems. Each branch of the dipole arm contains a meander line, with the end shaped like a scythe to achieve a significant reduction in the size of the radiator. For dual-band operation, each dipole arm is divided into two branches of different lengths. The dipoles are crossed through a $90^{\circ}$ phase delay line of a vacant-quarter printed ring to achieve CP radiation. The crossed dipoles are incorporated with a cavity-backed reflector to make the CP radiation unidirectional and to improve the CP radiation beamwidth. The proposed antennas have broad impedance matching and 3-dB axial ratio bandwidths, as well as right-hand CP radiation with a wide-beamwidth and high front-to-back ratio.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권4호
• /
• pp.387-394
• /
• 2016

This paper presents a fully digital delay locked loop (DLL) that can acquire lock in four clock cycles with a resolution of a 1/4 NAND-delay. The proposed DLL with a multi-dither-free phase detector acquires the initial lock in four clock cycles with 1/2 NAND-delay. Then, it utilizes a multi-dither-free phase detector, a region accumulator, and phase blenders, to improve the resolution to a 1/4 NAND-delay. The region accumulator which continuously steers the control registers and the phase blender, adaptively controls the tracking bandwidth depending on the amount of jitter, and effectively suppresses the dithering jitter. Fabricated in a 65 nm CMOS process, the proposed DLL occupies $0.0432mm^2$, and consumes 3.7 mW from a 1.2-V supply at 2 GHz.

• 정보처리학회논문지C
• /
• 제12C권1호
• /
• pp.105-110
• /
• 2005

멀티미디어 그룹 애플리케이션들이 증가함에 따라, QoS 요구사항을 만족하는 멀티캐스트 트리를 생성하는 것은 매우 중요한 문제로 부각되고 있다. 본 논문에서는 NP-complete ans제인 지연시간 제한과 지연변이 제한을 만족하는 멀티캐스트 트리(DVBMT : delay- and delay variation-bounded multicast tree) 문제를 다루겠다. 이 문제는 목적노드들을 포함하는 신장 트리를 생성하는 것으로, 이들 목적노드들은 최소화된 멀티캐스트 지연변이를 가지며, 시작노드에서 각 목적노트로의 경로상의 지연시간은 제한된 지연시간을 만족한다. 이러한 문제의 해법은 온라인 게임이나 쇼핑, 또는 원격 회의와 같은 실시간 통신 서비스를 제공하는데 필요하다. 지금까지 DVBMT 문제를 이상적으로 다루었다고 알려진 DDVCA보다 본 논문에서 제시한 알고리즘이 더욱 효율적이라는 것은 성능 평가를 통해 확인할 수 있다. 이를 통해 확인된 성능 향상은 DDVCA를 normalized surcharge로 계산 했을 때, 약 $3.6{\%}$에서 $11.1{\%}$에 이른다. 본 논문에서 제안한 알고리즘의 시간복잡도는 $O(mn^2)$이다.

• 전자공학회논문지
• /
• 제51권9호
• /
• pp.182-189
• /
• 2014

탭 딜레이(tapped delay) 방식은 field-programmable gate arrary(FPGA) 내부 리소스를 이용한 설계에 적합하여 FPGA기반 시간-디지털 변환기(time-to-digital converter)로 널리 사용되고 있다. 그런데 이 방식의 시간-디지털 변환기에서는 지연 소자로 사용하는 전용 캐리체인(dedicated carry chain)의 탭 당 지연시간 차이가 정밀도 저하의 가장 큰 원인이 되고 있다. 본 논문에서는 일반적인 구형파 대신 고정된 시간 폭을 가지는 펄스신호를 지연 소자로 인가하고 상승과 하강 엣지에서 두 번의 시간 측정을 통해 전용 캐리체인내 지연시간의 불균일성을 보상하고 정밀도를 향상하는 시간-디지털 변환기 구조를 제안한다. 제안한 구조는 두 번의 시간 측정을 위해 2개 구역의 전용 캐리체인을 필요로 한다. Dual 엣지 보상 전 두 전용 캐리체인에서 탭 당 지연시간의 평균은 각각 17.3 ps, 16.7 ps에서 보상 후 평균은 11.2 ps, 10.1 ps으로 감소하여 각각 35%, 39% 이상 향상되었다. 가장 중요한 탭 당 최대지연 시간은 41.4 ps, 42.1 ps에서 20.1 ps, 20.8 ps 로 50% 이상 감소하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(1)
• /
• pp.271-274
• /
• 2000

In this paper, the distortion of an electrical pulse with rise/fall time resulting from dispersion and reflection as it propagates along a tapered microstrip line is investigated, and the delay time and distortion rate with respect to input and load impedances are analyzed on triangular and exponential tapered lines and analyzed the influence of the reflection and frequency dispersion on the distorted voltage wave in the tapered lines. The observed overshoot in front of the distorted wave is caused due to the frequency dispersion and the sustained tail of that comes from the reflection in the tapered line.

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.58-65
• /
• 1994

A recursive on-line algorithm for orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters time delay and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursiveform by using new functions of two dimensional autocorrelations and crosscorrelations of inputs and outputs. This proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.58-63
• /
• 1993

A recursive on-line algorithm with orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters, time delay, and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursive form by using new functions of two dimensional autocorrelations and cross-correlations of inputs and outputs. The proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.