登录
首页 » matlab » ABCD2PI

ABCD2PI

于 2014-10-07 发布 文件大小:2KB
0 104
下载积分: 1 下载次数: 3

代码说明:

   This function obtains the pi model of a transmission line the ABCD constants of the line.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • chapter10
    小波分析理论与MATALB R2007 实现第十章演示代码(Wavelet analysis theory and MATALB R2007 A Chapter demo code)
    2012-05-27 11:16:19下载
    积分:1
  • AlphaControl-v8.41-FS
    AlphaControl v8.41 FullSource〖含全部源码和DEMO,支持D5-XE4〗
    2014-12-09 22:44:20下载
    积分:1
  • ga1
    使用matlab软件编程遗传算法在不规则自由空间中的路径规划(Matlab software programming using genetic algorithms in irregular free space path planning)
    2015-03-08 11:42:51下载
    积分:1
  • matlab
    MATLAB实现数字FIR的高通_和带通等滤波器的源程序(MATLAB implementation of digital FIR high-pass and band-pass filters _ source program)
    2012-01-04 10:44:13下载
    积分:1
  • maichongxiangyingfa
    系统辨识作业,输入信号为M序列,利用互相关函数及脉冲响应法求出系统的传递函数。(Identification of the operating system, the input signal for the M series, the transfer function of the system is obtained using cross-correlation function and impulse response method.)
    2021-03-10 21:19:26下载
    积分:1
  • ldpc_generate
    matlab源代码,可能对研究LDPC码的同仁是有很大帮助的(matlab source code, may be the study of Tongren LDPC code is of great help)
    2008-07-07 14:37:57下载
    积分:1
  • Navigation
    捷联惯导系统解算程序,并包含有kalman滤波组合导航、组合对准程序 演示程序 (SINS solver, and includes integrated navigation kalman filtering, combined demonstration program aimed at program)
    2011-11-09 00:58:52下载
    积分:1
  • 果蝇优化算法在pid寻优中的应用 foa-pid
    果蝇优化算法在pid寻优中的应用,这个方法很好(Drosophila optimization algorithm optimization of pid, this method is very good)
    2015-07-27 15:56:43下载
    积分:1
  • Gozaresh-Seminar(H.Ghadirian)
    call matlab function from C++.zip
    2013-07-29 18:55:36下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载