APF资料-APF、SVG simulink源程使用说明
我室(南京悦能科技工作室)推出的低压有源滤波器（APF）和静止无功发生器（SVG）产品为三电平结构模块化设计，完全自主研发、性能优异、价格合理。 我是做技术的，我们的有源滤波器采用目前最先进的控制技术（自我独创），实现产品的高性能高稳定性，在多个工程中已有应用。我室刚开展业务，诚心寻找合作伙伴，合作方式多样，以深入的技术合作为主，也可代理销售本工作室授权公司生产的APF、 SVG成品。若贵公司有这方面的业务需求欢迎联系参观合作。:负载建模Three load棖据实际负载情况设置负载参数,下图分别为三相三线制和三相四线制仿真的负载连接C三相三线值负载为:三相整流负载。Three LoadI模块展开「mm「三相四线值负载为:单相整流负载。四:有源滤波器主回路建模如下图,各AP主回路模块接口图。注意图中有以下区别1,三柱三线制AFF的强电输入为A,B、C三根电源线:三四线制APF的强电输入为A、B、C、N四根电源线2,APF_2 level_3p3的调旨系数为3路,产生驱动脉冲6谘PWM信号APF2 level_3p4L的阗亐系数为4路,产生驱动脉冲8路PWM信号;APF3 level3p3L和APF3 level3p4L的凋节系数都为3路,产生驱动脉冲12路PWM信号;3,在AP回路,四种APF都需婁采集3路APF电流信号;但是APF2 leyel3p3L和APF2 elevel3p4L直流母线电压只有一路,只采集一路,APF3levl3p3L和APF3 dlevel_3puL直流母线电压有两路,采集两路yd- char geCnangevdc lpwmInVuuVdr m出gAl changhnresA onAFF2|乳Lapf leve 4LFF3Eve孔以下匹图,分别为APF2 level_3p3L、APP2leel3p4L、APF3 level3p3LAPF3lvel3p4L的拓扑结构」APF2eve3p3主拓扑逆APF2eve3p4L宇拓扑本本4本本本本本本本本TadTAPF3evel3p3主拓扑本本x本小本本本本小本CrrtiCYF本本山本本时本La 2 LeI」APF_3leve3p4L主拓扑APF2 level3p3主叫路建模如下图,APF2leve3p仅多一路线IGBT和进线电抗PMM領电流检测的直流突波容甲容滤波回路主电抗模拟杂数电感APF_2leve1_3p3L主回路建模AFF3evl建模如下图,APF3evel3p3和APF3 level3p4L网别在于装置N点是否连接电网N线。电流检测PW_an主电抗0.0013·1均压电阻宰牛C=9220uF和幸+∞苧滤波板GB逆变回路0直流电压检测APF3leve1主回路建模五:电压、电流检测回路建模电压、电流信号釆集电路实昒在数据釆集板或滮波板(50A模块)上,包括3路电源电压釆集SV、直流母线电压CV釆集(两电平1路,三电平2路)、3路AP电流AI采集3路负载电流II采集。1,电网电压SvV采样处理如下图,采用原副边电压比为300707380V系统的电压互感器。PT changESv changer07300res n2,直流母线电压〔V釆样处理如下图,额定电压375V(三电平,两路路)或750V(两电平,一路)的直流母线电压,通过R1电阻网络转化为75mA左右的电流信号,通过L25P(原副边电流比为15)转换,再通过主控板上的200欧接收电阻R转化为电压信号(此电玉信号为375V左右,若追求更精准可调节主控板上的运放电阻,使其进入AD转换芯片时变为7V左右的信号)。-E SenT1c2751150002三宅平直流母线采样两路vocc ant日=2HaT〓n11两电平直流母线采样-路3,APF电流AI釆样处理如下图,50A模块釆用原副边电流比为10001)的电流传感器IP-128:控制板上接收电阻为50欧。Rcang=ChangCXchange50re-311090(50A only)4,负载电流I釆样处理如下图, CTl change为负载现场安装的互感器图中为100045A的,CT2 change为滤波板模块釆用原副边电流比为10004)的电流传感器IP-128:滤波板上通过接收2000欧电阻转为电压信号CHange2000n2.I0arno六:主控板控制部分建模61概述妇下图,APF内部控制主要包括模块 APF RIFI(主要作月是得AFF给定电流信号、APF反缋电流信号、电网电压信号)、闭环控制模块ⅣI,两电平三相四线制还多一个N线调节系数产生模块APF RIF 2记rY ntLrGsAl ntAPF21eve1_3p3L和APF31eve1内部控制框图N通可LLI intad res川finAl inAPF_21evel_3p4L内部控制框图62:主控板控制部分模块 APF RIF作用模块 APF RIFI作用如下1,对所有集量进行量化处理;2,对采样到得AFF电流信号进行合适的数字滤波、限幅等处理,获得AF反馈电流信号 Al res;对采样到得电网电压信号进行合适的数字滤波、限塥等处理,获电网
- 2020-12-08下载
- 积分：1
LeetCode cpp最新中文题解.pdf
LeetCode cpp最新中文题解.pdfLeetCode cpp最新中文题解.pdfLeetCode cpp最新中文题解.pdf目录3.4 Add binary615.1.5 Binary Tree Level Or-3.5 Longest Palindromic Substring. 62der traversal il3.6 Regular Expression Matching665.1.6 Binary Tree Zigzag3.7 Wildcard Matching67Level Order traversal. 963.8 Longest Common Prefix5.1.7 Recover Binary Search3. 9 Valid Number70Tree983.10 Integer to roman725. 1. 8 Same Tree3. 11 Roman to Integer735.1.9 Symmetric Tree1003.12 Count and Say745.1.10 Balanced Binary Tree.. 1023. 13 Anagrams755.1.11 Flatten Binary Tree to3. 14 Simplify Path76Linked List1033. 15 Length of Last Word775.1. 12 Populating Next RightPointers in each node ii 105第4章栈和队列7952二叉树的构建10641栈795.2.1 Construct Binary Tree4Valid Parentheses79from Preorder and In4.1.2 Longest valid Parenorder Traversa106theses805.2.2 Construct Binary Tree4.1.3 Largest Rectangle infrom Inorder and posHistogram82torder Traversal1074.1.4 Evaluate reverse pol-53二叉查找树108ish notation845.3. 1 Unique Binary Search4.2队列85Trees.1085.3.2 Unique Binary Search第5章树86Trees li.1105.1二叉树的遍历865.3.3 Validate Binary Search5.1.1 Binary Tree PreorderTreeTraversal865.3. 4 Convert Sorted array to5.1.2 Binary Tree InorderBinary Search Tree...112Traversal885.3.5 Convert Sorted List to5.1. 3 Binary Tree PostorderBinary Search Tree113Traversal9054二叉树的递归.1145. 1. 4 Binary Tree Level Or5.4.1 Minimum Depth of Bider traversal)2nary lree115目录5.4.2 Maximum Depth of Bi8.3.,2重新实现 next permunary Tree116tation1425.4.3 Path Sum11783.3递归.1435.4 4 Path Sum il118 8.4 Permutations II1445.4.5 Binary Tree Maximum8.4.1 next permutation... 144Path Suum11984.2重新实现 next permu5.4.6 Populating Next Righttation144Pointers in each node 120843递归1445.4.7 Sum Root to Leaf num8.5 Combinations146bers2185.1递归1468.5.2迭代147第6章排序1238.6 Letter Combinations of a phone6.1 Merge Sorted Array123umber1476.2 Merge Two Sorted Lists12486.1递归1486.3 Merge k Sorted Lists124862迭代96.4 Insertion Sort List125第9章广度优先搜索1506.5 Sort list1269.1 Word Ladder1506.6 First Missing Positive1279.2 Word Ladder il1546.7 Sort Colors1289.3 Surrounded regions162第7章查找94小结16413194.l适用场景1647.1 Search for a range131942思考的步骤7.2 Search Insert Position.13294.3代码模板1657. 3 Search a 2D Matrix133第10章深度优先搜索173第8章暴力枚举法13510.1 Palindrome Partitioning1738.1 Subsets13510.2 Unique Paths1768.1.1递归1350.2.1深搜1768.1.2迭代.1371022备忘录法.1768.2 Subsets il13810.23动规177821递归13810.24数学公式1788.2.2迭代.14110.3 Unique Paths Il1798. 3 Permutations14210.3.1备忘录法1798.3.1 next permutation14210.3.2动规.180目录10.4 N-Queens1813.4 Maximal rectangle21310.5 N-Queens II18413.5 Best Time to Buy and Sell Stock10.6 Restore ip addresses186.21410.7 Combination Sum18813.6 Interleaving String21510.8 Combination Sum Il18913.7 Scramble String21710.9 Generate Parentheses.19013. 8 Minimum Path Sum.22210.10 Sudoku solver19213.9 Edit Distance22410.11 Word Search.19313. 10 Decode Ways.22610.12小结19513. 11 Distinct sub22710.12.1适用场景19513. 12 Word Break22810.122思考的步骤19513 13 Word Break il2300.12.3代码模板197第14章图23210.12.4深搜与回溯法的区別.19714. 1 Clone Graph23210.12.5深搜与递归的区别..197第15章细节实现题235第11章分治法19915.1 Reverse Integer2351.1 Pow(x, n)19915.2 Palindrome Number.23611. 2 Sqrt(x)20015.3 Insert Interval237第12章贪心法20115.4 Merge Intervals23812.1 Jump game20115.5 Minimum Window Substring23912.2 Jump game II15.6 Multiply Strings24112. 3 Best Time to buy and Sell stock 20415.7 Substring with Concatenation12. 4 Best Time to buy and sell stock l205of all words24412. 5 Longest Substring Without re15.8 Pascal,s Triangle245peating Characters20615.9 Pascals Triangle Il24612.6 Container with Most Water.. 207 15.10 Spiral Matrix24715.11 Spiral matrix II248第13章动态规划20915.12 ZigZag Conversion25013. 1 Triangle20915.13 Divide Two Integers25113.2 Maximum Subarray15. 14 Text Justification25313.3 Palindrome Partitioning II1215.15 Max Points on a line255目录第1章编程技巧在判断两个浮点数a和b是否相等时,不要用a==b,应该判断二者之差的绝对值fabs(a-b)是否小于某个阈值,例如1e-9。判断一个整数是否是为奇数,用x%2!=0,不要用x%2=1,因为ⅹ可能是负用char的值作为数组下标(例如,统计字符串中每个字符岀现的次数),要考虑到char可能是负数。有的人考虑到了,先强制转型为 unsigned int再用作下标,这仍然是错的。正确的做法是,先强制转型为 unsigned char,再用作下标。这涉及C十整型提升的规则,就不详述了。以下是关于STL使用技巧的,很多条款来自《 Effective STL》这本书。vector和 string优先于动态分配的数组首先,在性能上,由于 vector能够保证连续内存,因此一旦分配了后,它的性能跟原始数组相当;其次,如果用new,意味着你要确保后面进行孓 delete,一旦忘记了,就会出现BUG,且这样需要都写一行 delete,代码不够短再次,声明多维数组的话,只能一个一个new,例如int** ary = new int*[row_num];for(int i=0: i< row num; ++1)ary [i] new int [col_num]用 vector的话一行代码搞定vectorary(row_num, vector(col_num, 0))使用 reserve来避免不必要的重新分配第2章线性表这类题目考察线性表的操作,例如,数组,单链表,双向链表等。2数组2.1.1 Remove Duplicates from Sorted array描述Given a sorted array, remove the duplicates in place such that each element appear only onceand return the new lengthDo not allocate extra space for another array, you must do this in place with constant memoryFor example, Given input array A =[1, 1, 2Your function should return length =2, and a is now [1, 2]分析无代码1/ LeetCode, Remove Duplicates from Sorted Array//时间复杂度0(n),空间复杂度0(1)class Solution tublicint removeDuplicates(vector& nums)tif (nums empty o) return 0;int index =ofor (int i =1: i nums size: 1++ iif (nums [index] ! nums [i])nums [++index]= nums [i]return index 12.1数组代码2//LeetCode, Remove Duplicates from Sorted Array/使用STL,时间复杂度0(n),空间复杂度0(1)class Solution ipublicint removeDuplicates(vector& nums)treturn distance(nums begin(), unique(nums begin(), nums end ())代码3/ LeetCode, Remove Duplicates from Sorted Array/使用STL,时间复杂度0(n),空间复杂度0(1)lass Solution fublicint removeDuplicates(vector& nums)treturn distance(nums begin(, removeDuplicates(nums begin(, nums end(), nums begintemplateOutIt removeDuplicates(InIt first, InIt last, OutIt output)thile (first last)i*output++ = *firstfirst upper_bound(first, last, *firstreturn output相关题目Remove Duplicates from Sorted Array I,见§2.1.22.1.2 Remove Duplicates from Sorted Array II描述Follow up for"Remove Duplicates " What if duplicates are allowed at most twice?For example, Given sorted array a =[1, 1, 1, 2, 2, 3]Your function should return length=5, and A is now [1, 1, 2, 2, 3分析加一个变量记录一下元素出现的次数即可。这题因为是已经排序的数组,所以一个变量即可解决。如果是没有排序的数组,则需要引入一个 hashmap来记录出现次数。4第2章线性表代码1// Leet Code, Remove Duplicates from Sorted Array II//时间复杂度0(n),空间复杂度0(1)//qauthorhex108(https://github.com/hex108)class Solution tublicint removeDuplicates(vector& nums)tif (nums size(
- 2020-12-04下载
- 积分：1
|
联系客服（QQ：3324461878）
