Christoph Haederli - Les thÃ¨ses en ligne de l'INP - Institut National ...

More documents

Recommendations

Info

NP Control with Optimal Sequence SVM 129 TABLE 51, POSSIBLE MODULATION SCHEMES MAKING USE OF MODIFIED AND VIRTUAL VECTORS Standard modulation scheme (NTV SVM, carrier based PWM, etc.) Predictive optimal sequence SVM SVM based on alternate triangles (a) (b) (c) (d) Defnition of scheme Replace individual vectors directly by the partner states of a modified or virtual vector. Replace complete sequence within a given triangle by a predetermined sequence making use of modified and virtual vectors. Evaluation of multiple sequence according to the POS (predictive optimal sequence) SVM scheme as proposed in paragraph 6.2 New small triangles can be defined based on the position of the type 1 virtual vectors. Explanations and comments This works fine for modified vector and virtual vectors type 2. Virtual vectors type 1 would still need to be implemented with an alternate algorithm. This scheme is likely to generate high switching losses as it applies CM jumps without considering the rest of the modulation sequence. This approach allows making a pre-selection of modified and virtual vectors to be applied and determines all possible sequences off line. This scheme produces relatively low switching losses as the whole sequence can be optimized and partner states are not applied directly one after another. There is simple application at runtime, once a proper definition of sequences has been made offline. This approach is really an extension of the POS SVM. The systematic inclusion of modified and virtual vectors in the sequences leads to high performance regarding NP and FC control. The calculating effort is even higher than for the pure POS SVM approach. This requires new algorithms to determine application times of states in modified and virtual vectors, as well as algorithms for the choice of modulation type. The implementation of the actual nearest three vector modulation is equivalent to standard SVM. But an optimal choice of a set of vectors to be used is complex. If multiple modified and virtual vectors are used in one triangle, up to 12 states may need to be applied. 6.1.4 Application of modified or virtual vectors Modified or virtual vectors can be applied in different ways as indicated in TABLE 51. The most obvious approach is the use of the modified and virtual vectors as vertices in NTV SVM. However, there is a lot of redundancy. The choice of base vectors to be used is not obvious. An online optimization is quite demanding and does not necessarily result in best performance. Furthermore, a direct application of virtual vectors without specifically integrating the states within a sequence will result in high switching losses due to the jumps in CM. An offline sequence optimization applying modified and virtual vectors according to TABLE 51 (b) offers high performance at reasonable complexity. This approach has been chosen to be implemented for simulation and experimental verification.
130 NP Control with Optimal Sequence SVM 6.1.4.1 Virtual vector sequences generation The development of the virtual vector sequence modulation scheme can be illustrated with the following examples. 100% 96.5% 81% 65% 50% β Hexagon α Regular Vectors Modified Vectors Virtual Vectors 1 Virtual Vectors 2 Figure 91, Sample triangle incorporating three virtual vectors type 1 The blue triangle in Figure 91 can generate the following three virtual vectors type 1: - {432 – 310} VV1 - {310 – 431} VV1 - {431 – 210} VV1 All these vectors can generate a current I NP_b either of zero or the full phase current I out_b. These three virtual vectors could be used for a SVM based on the blue triangle. A NTV algorithm for this small triangle could be applied. Each of the three virtual vectors would get its application time and would need to split it between the partner states. The partner state would then need to be put in an order to be physically applied. A simpler implementation is possible based on the following observation: In all triangles incorporating modified and / or virtual vectors, some of the partner states coincide. This allows for easy optimization regarding losses. The states are simply aligned in ascending order regarding CM voltage. This results in the following sequence for the example from Figure 91: - {210 – 310 – 431 – 432} 3D Only four states instead of 6 need to be applied. These four states describe a regular sequence of 4 of the standard size triangle. The virtual vectors are not visible anymore as such. This chosen approach does not limit the NP control capacity in comparison with a 6 vector sequence. If the redundant states of the 6 vectors are all optimized for the same NP and FC control criteria, they always reduce to only 4 states automatically. In the phase featuring the partner states, only states according to Figure 87 (a) and (b) are chosen to get either maximum or minimum NP current. The calculation of applications times could still be done on the small triangle level. However, it seems more straight forward to do the calculation directly for the standard size triangle.
Page 1 and 2:
THÈSE En vue de l'obtention du DOC
Page 3:
Acknowledgements i ACKNOWLEDGEMENTS
Page 6 and 7:
iv Table of Contents 3.4 Generic ML
Page 8 and 9:
vi Table of Contents 7.1 General mo
Page 10 and 11:
viii Résumé français (French sum
Page 12 and 13:
x Résumé français (French summar
Page 14 and 15:
xii Résumé français (French summ
Page 16 and 17:
xiv Résumé français (French summ
Page 18 and 19:
xvi Résumé français (French summ
Page 20 and 21:
xviii Résumé français (French su
Page 22 and 23:
Introduction 1 2 INTRODUCTION This
Page 24 and 25:
Introduction 3 tighter capacitor di
Page 26 and 27:
Introduction 5 TABLE 1, OPERATING R
Page 28 and 29:
Introduction 7 2.3 Glossary Note th
Page 30 and 31:
Introduction 9 2.4 Nomenclature Not
Page 32 and 33:
Introduction 11 DPC DSP DTC FC FPGA
Page 34 and 35:
ML Converter Topologies 13 3 ML CON
Page 36 and 37:
ML Converter Topologies 15 The four
Page 38 and 39:
ML Converter Topologies 17 Each swi
Page 40 and 41:
ML Converter Topologies 19 size doe
Page 42 and 43:
ML Converter Topologies 21 plus (a)
Page 44 and 45:
ML Converter Topologies 23 N >= 2,
Page 46 and 47:
ML Converter Topologies 25 (a) (b)
Page 48 and 49:
ML Converter Topologies 27 (a) (b)
Page 50 and 51:
ML Converter Topologies 29 In a pra
Page 52 and 53:
ML Converter Topologies 31 reality,
Page 54 and 55:
ML Converter Topologies 33 All cons
Page 56 and 57:
ML Converter Topologies 35 TABLE 16
Page 58 and 59:
ML Converter Topologies 37 TABLE 17
Page 60 and 61:
ML Converter Topologies 39 3.7.4.1
Page 62 and 63:
ML Converter Topologies 41 f C sw =
Page 64 and 65:
ML Converter Topologies 43 A second
Page 66 and 67:
ML Converter Topologies 45 Limitati
Page 68 and 69:
ML Converter Topologies 47 1 K M 2
Page 70:
ML Converter Topologies 49 3.8 Exec
Page 73 and 74:
52 3-L DC Link ML Converter Propert
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100: 78 3-L DC Link ML Converter Propert
Page 110 and 111: NP Control with Carrier based PWM 8
Page 144 and 145: NP Control with Optimal Sequence SV
Page 170 and 171: Application and Verification 149 7
Page 172 and 173: Application and Verification 151 TA
Page 174 and 175: Application and Verification 153 Th
Page 176 and 177: Application and Verification 155 7.
Page 188: Application and Verification 167 7.
Page 191 and 192: 170 Conclusions and Outlook 8.1.2 M
Page 193 and 194: 172 Conclusions and Outlook 8.2 Out
Page 195 and 196: 174 Conclusions and Outlook 8.3 Sum
Page 197 and 198: 176 Appendix I = 1− ) (99) ( C 2
Page 199 and 200: 178 Appendix TABLE 78, FLYING CAPAC
Page 201 and 202:
180 Appendix 9.3 Single phase NP cu
Page 203 and 204:
182 Appendix 9.4 States of the ANPC
Page 205 and 206:
184 Appendix 9.5 NP currents as a f
Page 207 and 208:
186 Appendix 9.5.3 Maximum and mini
Page 209 and 210:
188 Appendix 9.6 NP current functio
Page 211 and 212:
190 Appendix TABLE 91, NP CURRENT I
Page 213 and 214:
192 Appendix TABLE 93, NP CURRENT I
Page 216 and 217:
Bibliography 195 10 BIBLIOGRAPHY [1
Page 218 and 219:
Bibliography 197 [33] P. Steimer,
Page 220 and 221:
Bibliography 199 neutral point bala
Page 222 and 223:
Bibliography 201 [88] J. Pou, J. Za
show all

Christoph Haederli - Les thÃ¨ses en ligne de l'INP - Institut National ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?