搜索

x
中国物理学会期刊

基于符号时间序列方法的开关变换器离散映射算法复杂度分析

CSTR: 32037.14.aps.59.3756

Arithmetic complexity of discrete map of converter based on symbol time series

CSTR: 32037.14.aps.59.3756
PDF
导出引用
  • 开关变换器与其符号序列拓扑共轭,这使得开关变换器系统特性的研究可以归于符号序列的研究,从而得到更一般的结论.采用基于符号时间序列的算法复杂度来分析开关变换器的复杂行为,从具体内在结构得到开关变换器的本质特征.与统计复杂度不同,算法复杂度还可以定量地描述开关变换器的突变点和工作周期,为深入了解开关变换器的特性和混沌行为的利用提供理论依据.

     

    The converter topologically conjugates with its symbol time series. The research of converter can be reduced to the research of symbol time series, and more common results can be gotten. The complexity of converter is studied based on arithmetic complexity of symbol time series, characteristics are gotten from its inner structure. Compared with statistics complexity, arithmetic complexity can describe working cycling and catastrophe point, thus the theoretical basis for understanding the complexity characteristics of converter is provided.

     

    目录

    /

    返回文章
    返回