• Title/Summary/Keyword: Multi-cycle path

Search Result 21, Processing Time 0.026 seconds

Low Area and High Performance Multi-mode 1D Transform Block Design for HEVC (HEVC를 위한 저면적 고성능 다중 모드 1D 변환 블록 설계)

  • Kim, Ki-Hyun;Ryoo, Kwang-Ki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.1
    • /
    • pp.78-83
    • /
    • 2014
  • This paper suggest an effective idea to implement an low area multi-mode one dimension transform block of HEVC(High Efficiency Video Coding). The time consuming multiplier path is designed to operate on low frequency. Normal multipliers dealing with variable operands are replaced with smaller constant multipliers which do the product with constant coefficient and variable only using shifters and adders. This scheme increases total multiplier counts but entire areas are reduced owing to smaller area of constant multiplier. Idle cycles caused by doubled multipliers enable to use multi-cycle paths on the cycle eating multiplier data path. Operating frequency is lowered by multi-cycle path but total throughput is maintained. This structure is implemented with TSMC 0.18 CMOS process library, and operated on 186MHz frequency to process a 4k($3840{\times}2160$) image. Max operating frequency is 300MHz.

Computation of the Shortest distance and Forecasting movement distance for Y/T Multi-Cycle System (Multi-Cycle 작업을 위한 Y/T 최단거리 및 예상 이동거리 계산)

  • Park, Tae-jin;Kim, Han-soo;Kim, Cheeyong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.127-130
    • /
    • 2009
  • In this paper, we introduce a Y/T(Yard Tractor) Multi-Cycle System on the basis of RTLS that improves a low efficient loading and unloading. In the proposed approach, we apply the best suited algorithm looking for seeking of the optimum path and the shortest movement distance. In this paper, Our experiment results show that rate of a driving distance is reduced more than 12% compared to the average value, and that is reduced more than 23% compared to the maximum value.

  • PDF

A study on the low power architecture of multi-giga bit synchronous DRAM's (Giga Bit급 저전력 synchronous DRAM 구조에 대한 연구)

  • 유회준;이정우
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.11
    • /
    • pp.1-11
    • /
    • 1997
  • The transient current components of the dRAM are analyzed and the sensing current, data path operation current and DC leakage current are revealed to be the major curretn components. It is expected that the supply voltage of less than 1.5V with low VT MOS witll be used in multi-giga bit dRAM. A low voltage dual VT self-timed CMOS logic in which the subthreshold leakage current path is blocked by a large high-VT MOS is proposed. An active signal at each node of the nature speeds up the signal propagation and enables the synchronous DRAM to adopt a fast pipelining scheme. The sensing current can be reduced by adopting 8 bit prefetch scheme with 1.2V VDD. Although the total cycle time for the sequential 8 bit read is the same as that of the 3.3V conventional DRAM, the sensing current is loered to 0.7mA or less than 2.3% of the current of 3.3V conventional DRAM. 4 stage pipeline scheme is used to rduce the power consumption in the 4 giga bit DRAM data path of which length and RC delay amount to 3 cm and 23.3ns, respectively. A simple wave pipeline scheme is used in the data path where 4 sequential data pulses of 5 ns width are concurrently transferred. With the reduction of the supply voltage from 3.3V to 1.2V, the operation current is lowered from 22mA to 2.5mA while the operation speed is enhanced more than 4 times with 6 ns cycle time.

  • PDF

Design of a multipath routing protocol for energy-efficiency and low-delay in duty-cycled wireless sensor networks (듀티사이클 무선센서네트워크에서 저전력과 저지연을 위한 다중경로 라우팅 프로토콜의 설계)

  • Lee, Hyungkeun
    • Journal of IKEEE
    • /
    • v.24 no.1
    • /
    • pp.326-332
    • /
    • 2020
  • This paper presents the design of a routing metric for energy-efficient and low-delay path selection and a new routing protocol utilizing the metric in duty-cycyled wireless sensor networks. The new routing metric based on duty cycle, EDW, can reduce the energy and delay of transmission paths, which represents total waiting time from source to destination due to duty cycle. Therefore, in this paper, we propose a new multipath routing protocol based on cross-layer information utilizing the new routing metric, and simulation results show that the proposed protocol shows better performance of end-to-end delay and energy consumption.

Strong Connection Clustering Scheme for Shortest Distance Multi-hop Transmission in Mobile Sensor Networks (모바일 센서 네트워크에서 최단거리 멀티홉 전송을 위한 강한연결 클러스터 기법)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.6
    • /
    • pp.667-677
    • /
    • 2018
  • Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

Stability-based On-demand Multi-path Distance Vector Protocol for Edge Internet of Things

  • Dongzhi Cao;Peng Liang;Tongjuan Wu;Shiqiang Zhang;Zhenhu Ning
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.10
    • /
    • pp.2658-2681
    • /
    • 2023
  • In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

Computation of the Shortest Distance of Container Yard Tractor for Multi-Cycle System (다중 사이클 시스템을 위한 실시간 위치 기반 컨테이너 야드 트랙터 최단거리 계산)

  • Kim, Han-Soo;Park, Man-Gon
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.1
    • /
    • pp.17-29
    • /
    • 2010
  • A container terminal productivity is maximized by a minimized time for processing containers. So, we have been elevated the container terminal productivity through an improvement of computing system, but there are a limitation because of problems for transportation management and method. A Y/T(Yard Tractor), which is a representative transportation, is able to do only one process, loading or unloading, at one time. So if the Y/T can do loading and unloading step by step at a same time, the processing time would be shortened. In this paper, we proposed an effective operating process of Y/T(Yard Tractor) Multi-Cycle System by applying RTLS(Real Time Location System) to Y/T(Yard Tractor) in order to improve the process of loading and unloading at the container terminal. For this, we described Multi-Cycle System. This system consists of a real time location of Y/T based on RTLS, an indicating of Y/T location in real time with GIS technology, and an algorithm(Dijkstra's algorithm) of the shortest distance. And we used the system in container terminal process and could improve the container terminal productivity. As the result of simulation for the proposed system in this paper, we could verify that 9% of driving distance was reduced compared with the existing rate and 19% of driving distance was reduced compared with the maximum rate. Consequently, we could find out the container performance is maximized.

A Tier-Based Duty-Cycling Scheme for Forest Monitoring

  • Zhang, Fuquan;Gao, Deming;Joe, In-Whee
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1320-1330
    • /
    • 2017
  • Wireless sensor networks for forest monitoring are typically deployed in fields in which manual intervention cannot be easily accessed. An interesting approach to extending the lifetime of sensor nodes is the use of energy harvested from the environment. Design constraints are application-dependent and based on the monitored environment in which the energy harvesting takes place. To reduce energy consumption, we designed a power management scheme that combines dynamic duty cycle scheduling at the network layer to plan node duty time. The dynamic duty cycle scheduling is realized based on a tier structure in which the network is concentrically organized around the sink node. In addition, the multi-paths preserved in the tier structure can be used to deliver residual packets when a path failure occurs. Experimental results show that the proposed method has a better performance.

Modeling and Simulation of Evolutionary Dynamic Path Planning for Unmanned Aerial Vehicles Using Repast (Repast기반 진화 알고리즘을 통한 무인 비행체의 동적 경로계획 모델링 및 시뮬레이션)

  • Kim, Yong-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.101-114
    • /
    • 2018
  • Several different approaches and mechanisms are introduced to solve the UAV path planning problem. In this paper, we designed and implemented an agent-based simulation software using the Repast platform and Java Genetic Algorithm Package to examine an evolutionary path planning method by implementing and testing within the Repast environment. The paper demonstrates the life-cycle of an agent-based simulation software engineering project while providing a documentation strategy that allows specifying autonomous, adaptive, and interactive software entities in a Multi-Agent System. The study demonstrates how evolutionary path planning can be introduced to improve cognitive agent capabilities within an agent-based simulation environment.

An Al Approach with Tabu Search to solve Multi-level Knapsack Problems:Using Cycle Detection, Short-term and Long-term Memory

  • Ko, Il-Sang
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.37-58
    • /
    • 1997
  • An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

  • PDF