• Title/Summary/Keyword: optimization scheme

Search Result 1,157, Processing Time 0.03 seconds

A Novel Zero-Crossing Compensation Scheme for Fixed Off-Time Controlled High Power Factor AC-DC LED Drivers

  • Chang, Changyuan;Sun, Hailong;Zhu, Wenwen;Chen, Yao;Wang, Chenhao
    • Journal of Power Electronics
    • /
    • v.16 no.5
    • /
    • pp.1661-1668
    • /
    • 2016
  • A fixed off-time controlled high power factor ac-dc LED driver is proposed in this paper, which employs a novel zero-crossing-compensation (ZCC) circuit based on a fixed off-time controlled scheme. Due to the parasitic parameters of the system, the practical waveforms have a dead region. By detecting the zero-crossing boundary, the proposed ZCC circuit compensates the control signal VCOMP within the dead region, and is invalid above this region. With further optimization of the parameters KR and Kτ of the ZCC circuit, the dead zone can be eliminated and lower THD is achieved. Finally, the chip is implemented in HHNEC 0.5μm 5V/40V HVCMOS process, and a prototype circuit, delivering 7~12W of power to several 3-W LED loads, is tested under AC input voltage ranging from 85V to 265V. The test results indicate that the average total harmonic distortion (THD) of the entire system is approximately 10%, with a minimum of 5.5%, and that the power factor is above 0.955, with a maximum of 0.999.

Opportunistic Scheduling and Power Control for Cross-Layer Design of Ad Hoc Networks (Ad Hoc네트워크의 Cross-Layer설계를 위한 Opportunistic Scheduling과 Power Control기법)

  • Casaquite Reizel;Ham Byung-Woon;Hwang Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9A
    • /
    • pp.856-867
    • /
    • 2006
  • This paper proposes a new algorithm for opportunistic scheduling that take advantage of both multiuser diversity and power control. Motivated by the multicast RTS and priority-based CTS mechanism of OSMA protocol, we propose an opportunistic packet scheduling with power control scheme based on IEEE 802.11 MAC protocol. The scheduling scheme chooses the best candidate receiver for transmission by considering the SINR at the nodes. This mechanism ensures that the transmission would be successful. The power control algorithm on the other hand, helps reduce interference between links and could maximize spatial reuse of the bandwidth. We then formulate a convex optimization problem for minimizing power consumption and maximizing net utility of the system. We showed that if a transmission power vector satisfying the maximum transmission power and SINR constraints of all nodes exist, then there exists an optimal solution that minimizes overall transmission power and maximizes utility of the system.

Optimal Reservoir Operation Models for Paddy Rice Irrigation with Weather Forecasts (II) -Model Development- (기상예보를 고려한 관개용 저수지의 최적 조작 모형(II) -모형의 구성-)

  • 김병진;박승우
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.36 no.2
    • /
    • pp.44-55
    • /
    • 1994
  • This paper describes the development of real-time irrigation reservoir operation models that adequately allocate available water resources for paddy rice irrigation. Water requirement deficiency index(WRDI) was proposed as a guide to evaluate the operational performance of release schemes by comparing accumulated differences between daily release requirements for irrigated areas and actual release amounts. Seven reservoir release rules were developed, which are constant release rate method (CRR), mean storage curve method(MSC), frequency analysis method of reservoir storage rate(FAS), storage requirement curve method(SRC), constant optimal storage rate method (COS), ten-day optimal storage rate method(TOS), and release optimization method(ROM). Long-term forecasting reservoir operation model(LFROM) was formulated to find an optimal release scheme which minimizes WRDIs with long-term weather generation. Rainfall sequences, rainfall amount, and evaporation amount throughout the growing season were to be forecasted and the results used as an input for the model. And short-term forecasting reservoir operation model(SFROM) was developed to find an optimal release scheme which minimizes WRDIs with short-term weather forecasts. The model uses rainfall sequences forecasted by the weather service, and uses rainfall and evaporation amounts generated according to rainfall sequences.

  • PDF

A Generalized Markovian Based Framework for Dynamic Spectrum Access in Cognitive Radios

  • Muthumeenakshi, K.;Radha, S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1532-1553
    • /
    • 2014
  • Radio spectrum is a precious resource and characterized by fixed allocation policy. However, a large portion of the allocated radio spectrum is underutilized. Conversely, the rapid development of ubiquitous wireless technologies increases the demand for radio spectrum. Cognitive Radio (CR) methodologies have been introduced as a promising approach in detecting the white spaces, allowing the unlicensed users to use the licensed spectrum thus realizing Dynamic Spectrum Access (DSA) in an effective manner. This paper proposes a generalized framework for DSA between the licensed (primary) and unlicensed (secondary) users based on Continuous Time Markov Chain (CTMC) model. We present a spectrum access scheme in the presence of sensing errors based on CTMC which aims to attain optimum spectrum access probabilities for the secondary users. The primary user occupancy is identified by spectrum sensing algorithms and the sensing errors are captured in the form of false alarm and mis-detection. Simulation results show the effectiveness of the proposed spectrum access scheme in terms of the throughput attained by the secondary users, throughput optimization using optimum access probabilities, probability of interference with increasing number of secondary users. The efficacy of the algorithm is analyzed for both imperfect spectrum sensing and perfect spectrum sensing.

A Bi-Target Based Mobile Relay Selection Algorithm for MCNs

  • Dai, Huijun;Gui, Xiaolin;Dai, Zhaosheng;Ren, Dewang;Gu, Yingjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5282-5300
    • /
    • 2017
  • Multi-hop cellular networks (MCNs) reduce the transmit power and improve the system performance. Recently, several research studies have been conducted on MCNs. The mobile relay selection scheme is a rising issue in the design of MCNs that achieves these advantages. The conventional opportunistic relaying (OR) is performed on the single factor for maximum signal-to-interference-plus-noise ratio (SINR). In this paper, a comprehensive OR scheme based on Bi-Target is proposed to improve the system throughput and reduce the relay handover by constraining the amount of required bandwidth and SINR. Moreover, the proposed algorithm captures the variability and the mobility that makes it more suitable for dynamic real scenarios. Numerical and simulation results show the superiority of the proposed algorithm in both enhancing the overall performance and reducing the handover.

Robust Stability Analysis and Design of Fuzzy Model Based Feedback Linearization Control Systems (퍼지 모델 기반 피드백 선형화 제어 시스템의 강인 안정성 해석과 설계)

  • 박창우;이종배;김영욱;성하경
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.79-90
    • /
    • 2004
  • Systematical robust stability analysis and design scheme for the feedback linearization control systems via fuzzy modeling are proposed. It is considered that uncertainty and disturbances are included in the Takagi-Sugeno fuzzy models representing the nonlinear plants. Robust stability of the closed system is analyzed by casting the systems into the diagonal norm bounded linear differential inclusions and by converting the analysis and design problems into the linear matrix inequality optimization, a numerical method for finding the maximum stable ranges of the fuzzy feedback linearization control gains is also proposed. To verify the effectiveness of the proposed scheme, the robust stability analysis and control design examples are given.

A OFDM PAPR Reduction Scheme Using Sub-sequence Phase Optimization (서브 시퀀스 위상 최적화 (SPO)를 이용한 OFDM 신호의 PAPR 저감 방법)

  • Yoon, Yeo-Jong;Lim, Sun-Min;Eun, Chang-Soo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.117-126
    • /
    • 2005
  • In this paper, we present a new method for the reduction of the PAPR (peak to average power ratio) of OFDM signals. The idea behind the proposed method is that IFFT is implemented often with software for a digital signal processor such that we may avoid the repeated calculations to reduce the computational operations: we define sub-sequences in the IFFT process and then multiply the optimum phase rotation factors to them to minimize the PAPR. The PAPR reduction performance of the proposed method is equal to that of the interleaved partition scheme of the PTS (partial transmit sequence) method with only 1/3 computational operations of it.

The Optimization of Timing Recovery Loop for an MQASK All Digital Receivers (MQASK 디지털 수신기 타이밍 복원 루프 구조의 최적화 연구)

  • Seo, Kwang-Nam;Kim, Chong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1C
    • /
    • pp.40-44
    • /
    • 2010
  • The timing error detector(TED) employed in the closed loop type timing synchronization scheme for an MQASK all digital receiver suffers from the selfnoise-induced timing jitter. To eliminate the timing jitter a prefilter can be added in front of the TED. The prefilter method, however, degrades the stability and timing acquisition performance due to the loop delay and increases the complexity of the synchronizer. This paper proposes a polyphase filter type resampler approach to optimize the performance and architecture of the synchronizer simultaneously. The proposed scheme uses two resamplers which performs matched filtering and matched prefiltering so that the loop delay is minimized with minimal hardware resources. Simulation results showed an excellent acquisition performance with reduced timing jitter.

Fast Cooperative Sensing with Low Overhead in Cognitive Radios

  • Dai, Zeyang;Liu, Jian;Li, Yunji;Long, Keping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.58-73
    • /
    • 2014
  • As is well known, cooperative sensing can significantly improve the sensing accuracy as compared to local sensing in cognitive radio networks (CRNs). However, a large number of cooperative secondary users (SUs) reporting their local detection results to the fusion center (FC) would cause much overhead, such as sensing delay and energy consumption. In this paper, we propose a fast cooperative sensing scheme, called double threshold fusion (DTF), to reduce the sensing overhead while satisfying a given sensing accuracy requirement. In DTF, FC respectively compares the number of successfully received local decisions and that of failed receptions with two different thresholds to make a final decision in each reporting sub-slot during a sensing process, where cooperative SUs sequentially report their local decisions in a selective fashion to reduce the reporting overhead. By jointly considering sequential detection and selective reporting techniques in DTF, the overhead of cooperative sensing can be significantly reduced. Besides, we study the performance optimization problems with different objectives for DTF and develop three optimum fusion rules accordingly. Simulation results reveal that DTF shows evident performance gains over an existing scheme.

Virtual Resource Allocation in Virtualized Small Cell Networks with Physical-Layer Network Coding Aided Self-Backhauls

  • Cheng, Yulun;Yang, Longxiang;Zhu, Hongbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3841-3861
    • /
    • 2017
  • Virtualized small cell network is a promising architecture which can realize efficient utilization of the network resource. However, conventional full duplex self-backhauls lead to residual self-interference, which limits the network performance. To handle this issue, this paper proposes a virtual resource allocation, in which the residual self-interference is fully exploited by employing a physical-layer network coding (PNC) aided self-backhaul scheme. We formulate the features of PNC as time slot and information rate constraints, and based on that, the virtual resource allocation is formulated as a mixed combinatorial optimization problem. To solve the problem efficiently, it is decomposed into two sub problems, and a two-phase iteration algorithm is developed accordingly. In the algorithm, the first sub problem is approximated and transferred into a convex problem by utilizing the upper bound of the PNC rate constraint. On the basis of that, the convexity of the second sub problem is also proved. Simulation results show the advantages of the proposed scheme over conventional solution in both the profits of self-backhauls and utility of the network resource.