• Title/Summary/Keyword: Locking Control

Search Result 166, Processing Time 0.031 seconds

A Study on the Wide-band Fast-Locking Digital PLL Design (광대역 고속 디지털 PLL의 설계에 대한 연구)

  • Ahn, Tae-Won
    • 전자공학회논문지 IE
    • /
    • v.46 no.1
    • /
    • pp.1-6
    • /
    • 2009
  • This paper presents the digital PLL architecture and design for improving the frequency detection range and locking time for wide-band frequency synthesizer applications. In this research, a wide-range digital logic quadricorrelator is used for wide-band and fast frequency detector and sigma-delta modulator with 2-bit up-down counter is adopted for DCO control. The proposed digital PLL reduces the phase noise from quantization effect and is suitable for implementation of wide-band fast-locking as well as low power features, which is in high demand for mobile multimedia applications.

Self-injection-locked Divide-by-3 Frequency Divider with Improved Locking Range, Phase Noise, and Input Sensitivity

  • Lee, Sanghun;Jang, Sunhwan;Nguyen, Cam;Choi, Dae-Hyun;Kim, Jusung
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.4
    • /
    • pp.492-498
    • /
    • 2017
  • In this paper, we integrate a divide-by-3 injection-locked frequency divider (ILFD) in CMOS technology with a $0.18-{\mu}m$ BiCMOS process. We propose a self-injection technique that utilizes harmonic conversion to improve the locking range, phase-noise, and input sensitivity simultaneously. The proposed self-injection technique consists of an odd-to-even harmonic converter and a feedback amplifier. This technique offers the advantage of increasing the injection efficiency at even harmonics and thus realizes the low-power implementation of an odd-order division ILFD. The measurement results using the proposed self-injection technique show that the locking range is increased by 47.8% and the phase noise is reduced by 14.7 dBc/Hz at 1-MHz offset frequency with the injection power of -12 dBm. The designed divide-by-3 ILFD occupies $0.048mm^2$ with a power consumption of 18.2-mW from a 1.8-V power supply.

Remote-controlled micro locking mechanism for plate-type nuclear fuel used in upflow research reactors

  • Jin Haeng Lee;Yeong-Garp Cho;Hyokwang Lee;Chang-Gyu Park;Jong-Myeong Oh;Yeon-Sik Yoo;Min-Gu Won;Hyung Huh
    • Nuclear Engineering and Technology
    • /
    • v.55 no.12
    • /
    • pp.4477-4490
    • /
    • 2023
  • Fuel locking mechanisms (FLMs) are essential in upward-flow research reactors to prevent accidental fuel separation from the core during reactor operation. This study presents a novel design concept for a remotely controlled plate-type nuclear fuel locking mechanism. By employing electromagnetic field analysis, we optimized the design of the electromagnet for fuel unlocking, allowing the FLM to adapt to various research reactor core designs, minimizing installation space, and reducing maintenance efforts. Computational flow analysis quantified the drag acting on the fuel assembly caused by coolant upflow. Subsequently, we performed finite element analysis and evaluated the structural integrity of the FLM based on the ASME boiler and pressure vessel (B&PV) code, considering design loads such as dead weight and flow drag. Our findings confirm that the new FLM design provides sufficient margins to withstand the specified loads. We fabricated a prototype comprising the driving part, a simplified moving part, and a dummy fuel assembly. Through basic operational tests on the assembled components, we verified that the manufactured products meet the performance requirements. This remote-controlled micro locking mechanism holds promise in enhancing the safety and efficiency of plate-type nuclear fuel operation in upflow research reactors.

Concurrency Control for Updating a Large Spatial Object (큰 공간 객체의 변경을 위한 동시성 제어)

  • Seo Young Duk;Kim DongHyun;Hong Bong Hee
    • Journal of KIISE:Databases
    • /
    • v.32 no.1
    • /
    • pp.100-110
    • /
    • 2005
  • The update transactions to be executed in spatial databases usually have been known as interactive and long duration works. To improve the parallelism of concurrent updates, it needs multiple transactions concurrently update a large spatial object which has a spatial extensions larger than workspace of a client. However, under the existing locking protocols, it is not possible to concurrently update a large spatial object because of conflict of a write lock This paper proposes a partial locking scheme of enabling a transaction to set locks on parts of a big object. The partial locking scheme which is an exclusive locking scheme set by user, acquires locks for a part of the big object to restrict the unit of concurrency control to a partial object of a big object. The scheme gives benefits of improving the concurrency of un updating job for a large object because it makes the lock control granularity finer.

An Experimental Study of an Anti-lock Brake System (미끄럼 방지 제동시스템에 대한 실험적 고찰)

  • Kang, Sung-Hwang;Kim, Jae-Ho
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.14 no.5
    • /
    • pp.17-24
    • /
    • 2006
  • Anti-lock brake system(ABS) are designed to prevent wheel lock on all wheels of the vehicle by sensing wheel angular speed, processing the speed sensor signals in suitable digital electronic control circuits and comanding electrohydraulic actuators to control brake pressure. This study considers a control of ABS using wheel circumferential acceleration thresholds which avoids dangerous wheel locking due to excessive brake pressure during the vehicle braking and discusses the 3-channels, 3-sensors ABS system that employs "independent control" technique for the front wheels and "select low" technique for the rear wheels. The validities of the ABS such as vehicle stability, steerability and stopping distance during braking are assured through the vehicle tests on uniform asphalt straight roads.

The Study for Performance Analysis of Concurrency Control using Deferred Blocking (지연된 블록킹 방법을 사용한 동시성 제어 기법의 성능 분석에 관한 연구)

  • 남태희;박재운;위승민
    • KSCI Review
    • /
    • v.1 no.2
    • /
    • pp.95-107
    • /
    • 1995
  • The concurrency control can be critical to the performance of transaction processing systems. Conventional locking takes the blocking phenomenon, where waiting transactions continue to hold locks and block other transactions from progressing. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. The transaction execution can be divided into a nonblocking phase where transactions wait for locks but do not block other transactions and a blocking phase as in conventional locking. However data accessed during the nonblocking phase can lead to transaction abort. By properly balancing the blocking and abort effects, the proposed scheme can lead to better performance than either the conventional locking or the optimistic concurrency control(OCC) scheme at all data and resource contention levels.

  • PDF

Improvement of Unicast Traffic Performance in High-availability Seamless Redundancy (HSR) Using Port Locking (PL) Algorithm (Port Locking (PL) 알고리즘을 이용한 HSR (High-availability Seamless Redundancy)의 유니캐스트 트래픽 성능개선)

  • Abdulsam, Ibraheem Read;Kim, Se Mog;Choi, Young Yun;Rhee, Jong Myung
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.1
    • /
    • pp.51-56
    • /
    • 2014
  • High-availability seamless redundancy (HSR) is a protocol for fault-tolerant Ethernet (FTE) networks. It provides two frame copies and each copy is forwarded on a separate physical path, which provides zero fail-over time. Therefore, the HSR is becoming a potential candidate for various real-time FTE applications. However, the generation and circulation of unnecessary frames due to the duplication of every sending frame is inherent drawback of HSR. Such drawback degrades the performance of the network and may deplete its resources. In this paper, we present a new algorithm called port locking (PL) based on the media access control (MAC) address to solve the abovementioned problem in popular connected-rings network. Our approach makes the network gradually learn the locations of the source and the destination nodes without relying on network control frames. It then prunes all the rings that do not contain the destination node by locking corresponding rings' entrance ports. With the PL algorithm, the traffic can be significantly reduced and therefore the network performance will be greatly enhanced specially in a large scale connected-rings network. Analytical results are provided to validate the PL algorithm.

List Locking Protocol for XML Data Sharing (XML 데이터 공유를 위한 리스트 잠금 프로토콜)

  • Lee Eunjung
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1367-1374
    • /
    • 2004
  • For sharing XML data by many users, a way of concurrency and access control is required for isolating update actions such as inserting and deleting subtrees. Exisiting locking mechanisms as 2PL or MGL suffer low concurrency when applied to tree structures. In this paper, list data subtrees model is proposed based on the semantics expressed in DTD. In this model, tree updating actions such as inserting and deleting subtrees are considered only for the repetitive parts of XML trees. The proposed model guarantees that the result XML tree after applying a tree updating action is always valid, even when multiple users access the tree at the same time. Also, a new locking mechanism called list lock-ing protocol is proposed. The new locking protocol is expected to show better accessility with less number of locking objects compared to the Helmer's OO2PL model. Since update actions on a shared XML tree usually applied to the repetitive parts of the tree, the proposed model is expected to provide a useful way for efficient data sharing when combined with previous locking methods on terminal node data.

A Distributed Altruistic Locking Scheme For Multilevel Secure Database in Wireless Mobile Network Environments (무선 이동 네트워크 환경에서 다단계 보안 데이터베이스를 위한 분산 이타적 잠금 기법)

  • Kim, Hee-Wan;Park, Dong-Soon;Rhee, Hae-Kyung;Kim, Ung-Mo
    • The KIPS Transactions:PartD
    • /
    • v.9D no.2
    • /
    • pp.235-242
    • /
    • 2002
  • We propose an advanced transaction scheduling protocol for concurrency control of multilevel secure databases in wireless mobile network environment. Wireless communication is characterized by frequent spurious disconnections. So short-lived transaction must quickly access database without any delay by long-lived one. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure databases in wireless mobile network environment. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of a1truism has also been deployed for extended a1truistic locking. This is in a way that scope of data to he early released is enlarged to include even data initially not intended to be donated. Our protocol is based on extended altruistic locking, but a new method, namely bi-directional donation locking for multilevel secure databases (MLBiDL), is additionally used in order to satisfy security requirements and concurrency. We showed the Simulation experiments that MLBiDL outperforms the other locking protocols in terms of the degree of throughput and average waiting time.

Optimal design of robot for inspection and maintenance of pressurizer in the nuclear power plant (원자력발전소 가압기 점검보수 로봇의 최적화 설계)

  • 엄재섭;정승호;김승호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1696-1699
    • /
    • 1997
  • The robot mainpulator for inspection of pressurizer in the nuclear power plant has been developed, which consists of four parts : 2 arms, movable gripper, base frame, contorl console. To extract the damaged electric heating rod inside pressurizer, the gripper has been developed using wire lope and self-locking mechanism. for the examination of the structural stability of the robot manipulator, stress analysis is performed by using the ANSYS code.

  • PDF