用于电弧检测的电力专用SoC设计

针对传统的电弧电路故障检测结果不准确的问题,设计用于电弧检测的SoC系统,并且在55nm工艺下进行流片验证。采用包含两种结构的模数转换器的片上电压源,设计了锁相环以及复位电路,精度最高可达8.67 bit。验证结果表明,本设计可提高电弧检测的准确性。     

超宽带大功率合成器设计北大核心CSCD

在80 MHz~1 GHz频段,单个功率管输出功率能达到100 W以上,为研制输出功率400 W的功率放大器,文中设计了四路功率合成器。该合成器需要实现功率容量大、工作频带宽、体积小的设计目标。在功率容量方面,文中采用悬置带状线结构,其功率容量远远大于微带线结构;在工作频带方面,采用切比雪夫九节阻抗变换器,将工作带宽拓宽为80 MHz~1 GHz;在体积方面,文中合成器的功率合成部分采用Y型节级联实现四路功率合成,阻抗变换部分采用切比雪夫阻抗变换器进行阻抗变换,该结构相较于磁环巴伦功率合成器,不但具有损耗小、平坦度高的优点,而且通过将阻抗变换器设计成曲折的形状,进一步缩小了合成器体积。仿真与实测结果显示该合成器在80 MHz~1 GHz范围内还具有较高的平坦度,合成效率可达90%以上。     

An active balancer with rapid bidirectional charge shuttling and adaptive equalization current control for lithium-ion battery strings

This article proposes an active balancer, which features bidirectional charge shuttling and adaptive equalization current control, to fast counterbalance the state of charge (SOC) of cells in a lithium-ion battery (LIB) string. The power circuit consists of certain bidirectional buck-boost converters to transfer energy among the different cells back and forth. Owing to the characterization of the open-circuit voltage (OCV) vs SOC in LIB being relatively smooth near the SOC middle range, the SOC-inspected balance strategy can achieve more precise and efficient equilibrium than the voltage-based control. Accordingly, a compensated OCV-based SOC estimation is put forward to take into account the discrepancy of SOC estimation. Besides, the varied-duty-cycle (VDC) and curve-fitting modulation (CFM) methods are devised herein to tackle the problems of slow equalization rate and low balance efficacy, which arise from the diminution in balancing current as the SOC difference between the cells decreases in the later duration of equalization especially. The proposed strategies have taken the battery nonlinear characteristic and circuit parameter nonideality into account and can adaptively modulate the duty cycle with the SOC difference to keep balancing current constant throughout the balancing cycle. Simulated and experimental results are given to demonstrate the feasibility and effectiveness of the same prototype constructed. Compared with the fixed duty cycle and the VDC methods, the proposed CFM has the best balancing efficiency of 81.4%, and the balance time is shortened by 27.1% and 18.6%, respectively.     

A new design strategy for DC/DC LLC resonant converter: Concept,modeling, and fabrication

In this paper, a new design procedure for LLC converter has been introduced. In fact, this method is a computer-based design algorithm based on a numerical technique. In the process of designing, the value of the resonant element is obtained by solving the LLC converter fundamental equation. This converter will be controlled by using state feedback, such as output voltage variable. As a matter of fact, in a control system, the change of output voltage (because of load variation) will affect the switching frequency, so the output voltage will be tuned. In the designing process, the fundamental equations of LLC converter are obtained, and the value of the resonant elements is calculated. Also, a comparison analysis is carried out between the proposed and typical methods. The simulation is done to investigate the validity of the proposed method. Moreover, a prototype is manufactured, and the experimental test is done to evaluate its applicability.     

An engineering method for complex structural optimization involving both size and topology design variables

This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization.     

一种适合∑-△A／D转换器的FIR数字滤波器

讨论了一种用于∑-△A／D转换器的固定系数半带（half-band）FIR数字滤波器，分析了其线性相位特性和低通滤波特性，给出了频率仿真结果，以及在Cadence设计系统中的电路和版图实现。     

FF现场总线的网段负载能力的设计及计算

从生产安全运行的管理要求；电压压降和电流的限制及信号的衰减；网络运行时间的要求；系统设计的影响；备用能力的考虑等各个方面，结合上海赛科聚苯乙烯项目的具体设计，分析隔爆条件下FF现场总线的H1网段负载能力的设计，以供大家探讨。     

A New Comb Circular Polarizer Suitable for Millimeter‐Band Application

This letter presents a new polarizer which has a simple comb structure inside a circular waveguide. The electrical performance of the proposed comb polarizer is optimized by a circular waveguide radius and by the physical parameters of the comb plates. This polarizer is suitable for providing good performance in millimeter‐band application because of its simple structure and low fabrication cost. In our experiments the dual‐band comb polarizer designed in band 1(K) and band 2(Ka) showed good electrical performance without any tuning elements.     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.