• Title/Summary/Keyword: Constraint Resource

Search Result 207, Processing Time 0.028 seconds

FPGA Design of Turbo Code based on MAP (MAP 기반 터보코드의 FPGA 설계)

  • Seo, Young-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.306-313
    • /
    • 2007
  • In this paper, we efficiently implemented turbo code algorithm in FPGA H/W(hardware) resource. The used turbo code algorithm has the characteristics; the size of constraint is 3, encoder type is 1/3, the size of random interleaver is 2048. The proposed H/W consists of MAP block for calculating alpha and delta using delta value, storing buffer for each value, multiplier for calculating lamda, and lamda buffer. The proposed algorithm and H/W architecture was verified by C++ language and was designed by VHDL. Finally the designed H/W was programmed into FPGA and tested in wireless communication environment for field availability. The target FPGA of the implemented H/W is VERTEX4 XC4VFX12-12-SF363 and it is stably operated in 131.533MHz clock frequency (7.603ns).

Dynamic Management of Service Execution Contexts in Network-based Robots (네트워크 기반 로봇의 서비스 실행 컨텍스트 동적 관리)

  • Park, Jeong-Min;Lee, Jung-Jae;Yu, Beom-Jae
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.489-500
    • /
    • 2009
  • Robots have limited computing resources and robot services have different requirement such as sensors, actuators, computational capabilities and timeliness. In this paper, we propose a dynamic management method of service execution contexts to perform various services efficiently and to meet the time constraint of service in network-based robots. The proposed method is tested in the real network-based robot system. The results show that the real-time requirement for services is satisfied and the resource utilization is improved. The proposed method provides the extendability and flexibility of sensors and services by aptly modifying service execution contexts and increases the reusability of service.

FGS Coding-based Mobile IPTV Transmission System over WiMAX Network (와이맥스 망에서 FGS 코딩 기반의 모바일 IPTV 전송 시스템)

  • Joo, Hyun-Chul;Song, Hwang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8A
    • /
    • pp.625-632
    • /
    • 2009
  • This paper presents the mobile IPTV system for the transmission of FGS-encoded video stream over WiMAX network. The proposed system is implemented to provide more subscribers with an improved mobile IPTV service considering the scarce resource constraint. The proposed system pursues an efficient tradeoff between the number of subscribers that receive the enhancement layer stream and their IPTV service quality. In the proposed system, some parts of the enhancement layer are transmitted with the modulation scheme and the coding rate adaptive to wireless link states of subscribers. Finally, experimental results are provided to show the performance of proposed mobile IPTV system.

A genetic-algorithm-based high-level synthesis for partitioned bus architecture (유전자 알고리즘을 이용한 분할 버스 아키텍처의 상위 수준 합성)

  • 김용주;최기영
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.3
    • /
    • pp.1-10
    • /
    • 1997
  • We present an approach to high-level synthesis for a specific target architecture-partitioned bus architecture. In this approach, we have specific goals of minimizing data transfer length and number of buses in addition to common synthesis goals such as minimizing number of control steps and satisfying given resource constraint. Minimizing data transfer length and number of buses can be very important design goals in the era of deep submicron technology in which interconnection delay and area dominate total delay and area of the chip to be designed. in partitioned bus architecture, to get optimal solution satisfying all the goals, partitioning of operation nodes among segments and ordering of segments as well as scheduling and allocation/binding must be considered concurrently. Those additional goals may impose much more complexity on the existing high-level synthesis problem. To cope with this increased complexity and get reasonable results, we have employed two ideas in ur synthesis approach-extension of the target architecture to alleviate bus requirement for data transfer and adoption of genetic algorithm as a principal methodology for design space exploration. Experimental results show that our approach is a promising high-level synthesis mehtodology for partitioned bus architecture.

  • PDF

Energy Efficiency Maximization for Energy Harvesting Bidirectional Cooperative Sensor Networks with AF Mode

  • Xu, Siyang;Song, Xin;Xia, Lin;Xie, Zhigang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2686-2708
    • /
    • 2020
  • This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

Mixed-Integer programming model for scheduling of steelmaking processes (철강 공정의 일정계획을 위한 혼합정수계획 모델)

  • Bok, Jin-Gwang;Lee, Dong-Yeop;Park, Seon-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.6
    • /
    • pp.714-723
    • /
    • 1999
  • This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

  • PDF

Implementation of IEEE 802.15.4 Protocol Stack on the Texas Instrument CC2530 (텍사스 인스트루먼트의 CC2530 상에 IEEE 802.15.4 프로토콜 스택 구현)

  • Kim, Byung-Soon
    • Journal of Digital Contents Society
    • /
    • v.13 no.3
    • /
    • pp.353-358
    • /
    • 2012
  • Wireless sensor networks consist of resource constraint devices which typically send data measured by sensors attached to the end devices towards a coordinator. The most often used medium access control protocol used in wireless sensor networks is the standard IEEE 802.15.4, where it is wireless standard introduced for low power, low cost wireless communication with moderate data rates. In this paper, we present implementation of both the IEEE 802.15.4 protocol stack and UART interface on the TI CC2530. We show that data via UART of our implemented IEEE 802.15.4 board are transmitted correctly in terms of captured frames.

Multiple-Phase Energy Detection and Effective Capacity Based Resource Allocation Against Primary User Emulation Attacks in Cognitive Radio Networks

  • Liu, Zongyi;Zhang, Guomei;Meng, Wei;Ma, Xiaohui;Li, Guobing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1313-1336
    • /
    • 2020
  • Cognitive radio (CR) is regarded as an effective approach to avoid the inefficient use of spectrum. However, CRNs have more special security problems compared with the traditional wireless communication systems due to its open and dynamic characteristics. Primary user emulation attack (PUEA) is a common method which can hinder secondary users (SUs) from accessing the spectrum by transmitting signals who has the similar characteristics of the primary users' (PUs) signals, and then the SUs' quality of service (QoS) cannot be guaranteed. To handle this issue, we first design a multiple-phase energy detection scheme based on the cooperation of multiple SUs to detect the PUEA more precisely. Second, a joint SUs scheduling and power allocation scheme is proposed to maximize the weighted effective capacity of multiple SUs with a constraint of the average interference to the PU. The simulation results show that the proposed method can effectively improve the effective capacity of the secondary users compared with the traditional overlay scheme which cannot be aware of the existence of PUEA. Also the good delay QoS guarantee for the secondary users is provided.

A Fault-tolerant Scheme for Clustering Routing Protocols (클러스터 기반 라우팅 프로토콜을 위한 결함허용기법)

  • Min, Hong;Kim, Bong-Jae;Jung, Jin-Man;Kim, Seuk-Hyun;Yoon, Jin-Hyuk;Cho, Yoo-Kun;Heo, Jun-Young;Yi, Sang-Ho;Hong, Ji-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.668-672
    • /
    • 2010
  • In wireless sensor networks, a fault-tolerant scheme that detects the failure of sensor nodes and improves the reliability of collected information must be considered. Resource-constraint sensor nodes expose vulnerability and cannot use existing checkpointing schemes that do not consider a feature of sensor networks. In this paper, we propose a fault-tolerant scheme for clustering routing protocols that support the recovery of a head node.

A Study on Periodic Buffer Allocation for Program Master Schedule (프로그램 공정계획을 위한 주기적 버퍼 설치에 관한 고찰)

  • Koo Kyo-Jin
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • autumn
    • /
    • pp.81-87
    • /
    • 2001
  • In a dynamically changing environment, the manager of a maintenance and remodeling (M/R) program is confronted with an increasing complexity of coordinating and cooperating multi-resource constrained multiple projects. The root causes of the complexity, uncertainty and interdependence, cause an internal disruption of an activity and chain reactions of disturbance propagation that deteriorate the stability and manageability of the program. This paper evaluates previous endeavors to apply production control and management techniques to the construction industry, and investigates the possibility of applying other management concepts and theories to organizational program management. In particular, this paper proposes a buffer allocation model by which periodic buffers are allocated in the flows of program constraint resources to stabilize a program master schedule instead of protecting individual activities. Comparative experiments by Monte Carlo simulations illustrate improved performance of the proposed model in terms of program's goals: productivity, flexibility, and long-term stability.

  • PDF