http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Stator flux oriented sensorless DTFC for IPMSMs using pseudo‑random HF signal injection
Junlei Chen,Xiang Wu 전력전자학회 2023 JOURNAL OF POWER ELECTRONICS Vol.23 No.12
In this article, a stator flux oriented sensorless control method is proposed for interior permanent magnet synchronous motor (IPMSM) drives based on the direct torque and flux control (DTFC) and pseudo-random high-frequency signal injection (PR-HFSI) in the zero-low speed range. The DTFC for IPMSMs is introduced briefly and the conventional high-frequency signal injection (HFSI) method, which requires an additional transformation, is also introduced. Then the stator flux oriented PR-HFSI is proposed comprising injection mode and rotor observation, with the aim of noise reduction and easy implementation. Furthermore, the high-frequency noise in HFSI and the mechanisms of noise suppression in PR-HFSI are analyzed based on current spectrums. Meanwhile, the optimal noise reduction frequency combination of n kinds frequency injections is also analyzed. Finally, the performance of the proposed stator flux oriented PR-HFSI method is confirmed with experiments on a 60 kW IPMSM test bench.
The Top-K QoS-aware Paths Discovery for Source Routing in SDN
( Xi Chen ),( Junlei Wu ),( Tao Wu ) 한국인터넷정보학회 2018 KSII Transactions on Internet and Information Syst Vol.12 No.6
Source routing is the routing scheme that arranges the whole path from source to target at the origin node that may suit the requirements from the upper layer applications’ perspective. The centralized control in SDN (Software-Defined Networking) networks enables the awareness of the global topology at the controller. Therefore, augmented source routing schemes can be designed to achieve various purposes. This paper proposes a source routing scheme that conducts the top-K QoS-aware paths discovery in SDN. First, the novel non-invasive QoS over LLDP scheme is designed to collect QoS information based on LLDP in a piggyback fashion. Then, variations of the KSP (K Shortest Paths) algorithm are derived to find the unconstrained/constrained top-K ranked paths with regard to individual/overall path costs, reflecting the Quality of Service. The experiment results show that the proposed scheme can efficiently collect the QoS information and find the top-K paths. Also, the performance of our scheme is applicable in QoS-sensitive application scenarios compared with previous works.