The way of neutral point to earth via full compensation arc suppression coil can solve the problem of residual current compensation in coal mine power network effectively. Based on the analysis on the grounding curren...The way of neutral point to earth via full compensation arc suppression coil can solve the problem of residual current compensation in coal mine power network effectively. Based on the analysis on the grounding current detection results of Xieqiao coal mine, the conclusion that harmonic component of grounding current is dominated by higher harmonics with complex harmonic sources in coal mine power network system was obtained. The influences of harmonic source type and fault point position on harmonic voltage and harmonic current were analyzed theoretically. The influences of earthed fault feeder detection result and the estimation errors of parameters to earth on residual current compensation were analyzed. A new thought of residual current prediction and the selections of model method and control method were proposed on this basis. The simulation results prove that harmonic amplitudes of zero sequence voltage and zero sequence current are determined by harmonic source type as well as fault point position in coal mine power network, and also prove that zero sequence voltage detection can avoid the unstable problem of coal mine power network system caused by undercompensation of capacitive current. Finally, the experimental device of full compensation arc suppression coil is introduced.展开更多
Klapper(1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over GF(2), but these sequences have very low linear complexities when con...Klapper(1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over GF(2), but these sequences have very low linear complexities when considered as sequences over GF(p)(p is an odd prime). This linear complexity of a binary sequence when considered as a sequence over GF(p) is called GF(p) complexity. This indicates that the binary sequences with high GF(2) linear complexities are inadequate for security in the practical application, while,their GF(p) linear complexities are also equally important, even when the only concern is with attacks using the Berlekamp-Massey algorithm [Massey, J. L., Shift-register synthesis and bch decoding, IEEE Transactions on Information Theory, 15(1), 1969, 122–127]. From this perspective, in this paper the authors study the GF(p) linear complexity of Hall's sextic residue sequences and some known cyclotomic-set-based sequences.展开更多
基金The financial support from the National Natural Science Foundation of China (No. 51107143)
文摘The way of neutral point to earth via full compensation arc suppression coil can solve the problem of residual current compensation in coal mine power network effectively. Based on the analysis on the grounding current detection results of Xieqiao coal mine, the conclusion that harmonic component of grounding current is dominated by higher harmonics with complex harmonic sources in coal mine power network system was obtained. The influences of harmonic source type and fault point position on harmonic voltage and harmonic current were analyzed theoretically. The influences of earthed fault feeder detection result and the estimation errors of parameters to earth on residual current compensation were analyzed. A new thought of residual current prediction and the selections of model method and control method were proposed on this basis. The simulation results prove that harmonic amplitudes of zero sequence voltage and zero sequence current are determined by harmonic source type as well as fault point position in coal mine power network, and also prove that zero sequence voltage detection can avoid the unstable problem of coal mine power network system caused by undercompensation of capacitive current. Finally, the experimental device of full compensation arc suppression coil is introduced.
基金supported by the National Natural Science Foundation of China(Nos.61202007,U1509213)Top Priority of the Discipline(Information and Communication Engineering)Open Foundation of Zhejiang+1 种基金the Postdoctoral Science Foundation(No.2013M540323)the Outstanding Doctoral Dissertation in Nanjing University of Aeronautics and Astronautics(No.BCXJ 13-17)
文摘Klapper(1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over GF(2), but these sequences have very low linear complexities when considered as sequences over GF(p)(p is an odd prime). This linear complexity of a binary sequence when considered as a sequence over GF(p) is called GF(p) complexity. This indicates that the binary sequences with high GF(2) linear complexities are inadequate for security in the practical application, while,their GF(p) linear complexities are also equally important, even when the only concern is with attacks using the Berlekamp-Massey algorithm [Massey, J. L., Shift-register synthesis and bch decoding, IEEE Transactions on Information Theory, 15(1), 1969, 122–127]. From this perspective, in this paper the authors study the GF(p) linear complexity of Hall's sextic residue sequences and some known cyclotomic-set-based sequences.
