• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.329-332
• /
• 2000

This paper proposed resource allocation algorithm for the minimum power consumption of functional unit in high level synthesis process as like DSP which is circuit to give many functional unit. In this paper, the proposed method though high level simulation find switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To used the switching activity find the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.01a
• /
• pp.283-284
• /
• 2021

본 논문에서는 서로 다른 진화 전략의 병렬화를 구현하기 위해 섬 모델을 도입하고 자원 간의 균형을 유지하기 위해 Monod 모델을 활용하는 PDE-EM이라는 생태 모델 알고리즘을 기반으로 한 새로운 병렬 DE를 제안하도록 한다. 각 섬은 동일한 자원으로 서로 다른 전략으로 진화한다. 지정된 세대 수마다 섬의 진화 정도에 따라 등급이 매겨지고, Monod 모델을 활용하여 각 섬에 다양한 자원이 할당된다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1426-1437
• /
• 1999

The introduction of fast packet switching networks such as the ATM leads to the possibility of video services with constant quality. However, the fixed traffic descriptor(TD), which is defined by ATM Forum and ITU-T, can not simultaneously satisfy network efficiency and video quality. This paper presents fast resource reallocation protocol (FRRP) which can provide an effective compromise between network efficiency and video quality. This protocol reallocates the network resources and then adapts the traffic to the reallocated resources. In the proposed method, a video session is divided into several time-intervals according to its generated traffic and TD is calculated which well characterizes the traffic during the specific subdivided interval. In addition, a system model, where MPEG coding algorithm and network control are unified, is proposal and the performance of the FRRP in terms of cell loss rate(CLR) is evaluated though the simulation using real video traffic(Star Wars). Simulation results show that the FRRP has only 5 ~35% CLR of the fixed TD.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.61-67
• /
• 2000

Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.1-7
• /
• 2012

Cognitive radio, a new paradigm for wireless communication, is being recently expected to support various types of multimedia traffics. To guarantee Quality of Service (QoS) from SUs, a static packet priority policy can be considered. However, this approach can easily satisfy Quality of Service of high priority application while that of lower priority applications is being degraded. In the paper, we propose a fuzzy-based dynamic packet scheduling algorithm to support multimedia traffics in which the dynamic packet scheduler modifies priorities of packets according to Fuzzy-rules with the information of priority and delay deadline of each packet, and determines which packet would be transmitted through the channel of the primary user in the next time slot in order to reduce packet loss rate. Our simulation result shows that packet loss rate can be improved through the proposed scheme when overall traffic load is not heavy.

• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.146-151
• /
• 2017

This paper proposes a transmission algorithm that optimizes transmission power and sub-channel allocation to maximize energy efficiency considering characteristics of the channel impedance of power lines in power line communication systems. Since the received power at the receiver is influenced by the characteristics of the power line channel, it is necessary to consider channel characteristics when developing a transmission strategy in a power line communication systems. In addition, the energy efficiency should be optimized while meeting the practical constraints, such as the maximum transmission power limit of the transmitter and minimum quality of service for each user. In the computer simulation, we confirm that the energy efficiency of the proposed algorithm is improved compared to baseline schemes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.125-128
• /
• 2001

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. PON architecture is very simple but it requires MAC protocol for control of upstream traffic. This paper proposes a MAC protocol for a broadband access network using an ATM Passive Optical Network supporting CBR/rtVBR, nrtVBR, ABR aild UBR traffic. For the proposed MAC scheme, we present grant field format, minislot format, and bandwidth allocation algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.119-127
• /
• 2006

In this two-part paper, we consider dynamic resource allocation in orthogonal frequency division multiple access(OFDMA). To reduce the reverse link overhead for channel quality information(CQI) feedback, a set of sub-carriers are tied up to a sub-channel to be used as the unit of CQI feedback, user-multiplexing and the corresponding power/rate allocation. Specifically, we focus on two sub-channel structures, either aggregated or distributed, where the SNR distribution over a sub-channel is modeled as Ricean in general, and the channel quality of a sub-channel is summarized as the mean and variance of channel gain envelop divided by noise standard deviation. Then, we develop a generalized two step channel/resource allocation algorithm, which uses the two statistical measurements, and analyze the spectral efficiency of the OFDMA system in terms of average frequency utilization. An extension to proportional fair algorithm will also be addressed. As confirmed by numerical results, the aggregated structure is preferred especially when intending aggressive link adaptation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6A
• /
• pp.603-610
• /
• 2006

This paper considers the problem of mitigating CCI(Co-channel Interference) in cellular OFDMA downlink systems. The users in the cell-edge area suffer from large CCIs, and their SINR requirements are hard to be maintained. To guarantee their QoS, we propose a new exclusive sub-carrier allocation and power control algorithm. The performance of the proposed two-step algorithm is simulated in SUI-A path-loss model, and it is compared with that of the conventional algorithm. The simulation results show that the data transmission rate in the cell-edge area was increased by 600Kbps within the same power constraint. The results indicate that with proposed algorithm, the data rate stability can be achieved independently of the user location in the cell.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1142-1150
• /
• 2009

In this paper, we propose an novel bandwidth scheduling algorithm for the MAC protocol employed by the Data Over Cable Service Interface Specifications (DOCSIS) 3.0 compliant cable networks. The proposed algorithm statistically improves the chances of request piggybacking to minimize the access delay. It utilizes the piggyback request feature of the segment packets that has been newly specified in DCOSIS 3.0. In DOCSIS 3.0, a bandwidth request can be granted to several upstream channels within an upstream bonding group. The grant on each individual channel is treated as a segment packet. We find the optimal segment placement to minimize the access delay in the proposed algorithm. We also use a self-similar traffic model for simulation and analysis to evaluate the performance of the proposed algorithm.