登录
首页 » Others » 通信天线建模与MATLAB仿真分析(原书配套光盘)

通信天线建模与MATLAB仿真分析(原书配套光盘)

于 2020-12-08 发布
0 361
下载积分: 1 下载次数: 5

代码说明:

通信天线建模与MATLAB仿真分析(原书配套光盘)希望对学习天线和用matlab建模的有用!!

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

发表评论

0 个回复

  • opencv计算机视觉编程攻略图片集
    opencv计算机视觉编程攻略第二版的图片集,代码大家很容易下载到就不上传了
    2020-12-08下载
    积分:1
  • 基于pca+lda+粗糙集+模糊神经网络的人脸识别程序
    pca+lda+粗糙集+模糊神经网络saveORLimage.m将ORL人脸库分为测试集ptest和训练集pstudy存为imagedata.mat1.savelda.m将人脸库先进行pca降维,再用lda进行特征提取,得到新的测试集ldatest和训练集ldastudy存为imageldadata.mat2.对ldastudy进行离散化(discretimage.m),得到离散化矩阵disdata,存入到imagedisdata.mat3.将disdata组成决策表(savers.m),通过对disdata的条件属性进行约简,得到其一个约简,组成新的测试集rstest和训练集rss
    2021-05-07下载
    积分:1
  • 各种最小二乘法总结(算法+matlab源码)
    10种最小二乘法总结,算法+源码一般最小二乘法遗忘因子最小二乘法限定记忆最小二乘递推算法偏差补偿最小二乘法增广最小二乘法广义最小二乘法辅助变量法二步法多级最小二乘法yule-walker辨识算法盛晓婷最小二乘算法总结报告附录、广义最小二乘递推算法附录、辅助变量法附录步法录、多级最小二乘法附录辨识算法图一般最小二乘参数过渡过程图一般最小二乘方差变化过程图遗忘因子法参数过渡过程图遗忘因子法方差变化过程图限定记忆法参数过渡过程图限定记忆法方差变化过程图偏差补偿最小二乘参数过渡过程图偏差补偿最小二乘方差变化过程图增广最小二乘辨识模型图增广最小二乘参数过渡过程图广义最小二乘参数过渡过程图广义最小二乘方差变化过程图辅助变量法参数过渡过程图辅助变量法方差变化过程图二步法参数过渡过程图二步法方差变化过程盛晓婷最小二乘算法总结报告般最小二乘法例考虑如下仿真对象其中,为服从分布的白噪声。输入信号采用序列,幅度为序列由级移位寄存器产生,选择如下的辨识模型观测数据长度取加权阵取A=。一次计算最小二乘算法其中,程序见附录递推最小二乘算法递推最小二乘算法公式:盛晓婷最小二乘算法总结报告初始条件O经过编程计算,各个参数的估计值为程序见附录_。待估参数过渡过程⊥一-⊥图一般最小二乘参数过渡过程盛晓婷最小二乘算法总结报告估计方差变化过程图般最小二乘方差变化过程盛晓婷最小二乘算法总结报告遗忘因子最小二乘算法采用的辨识模型与例相同。次计算法其中,BβBBBβ衰减因子=,数据长度=程序见附录。递推算法遗忘因子递推最小二乘算法公式+盛晓婷最小二乘算法总结报告其中,≤4≤为遗忘因子,此处取数据长度,初始条件日经过编程计算,各个参数的估计值为程序见附录。待估参数过渡过程图遗忘因子法参数过渡过程盛晓婷最小二乘算法总结报告估计方差变化讨程图遗忘因子法方差变化过程盛晓婷最小二乘算法总结报告限定记忆最小二乘递推算法辨识模型与例相同。限定记忆最小二乘算法:6++=0++++6+初始条件O经过编程计算,各个参数的估计值为程序见附录
    2020-12-07下载
    积分:1
  • asp旅行网网站(完整版源码)
    这是为其它公司做的网站,现在把源码完全贡献个爱学习爱编程的各位同僚,希望大家喜欢!~别忘了评论咯,大家说道说道! 旅行社网站功能列表模块类型 模块名称 模块描述首 页 推荐线路!` 热门线路推荐 线路查询!` 线路查询 航班查询! 航班查询,济南出港 航空客货! 航空客货相关信息 目的地推荐! 优秀目的地推荐 酒店推荐!` 签约酒店推荐 企业动态!` 企业动态 行业新闻!` 行业动态 旅游模拟------- 用flash模拟旅游的业务流程 导游预定! 导游预定、导游风采 分支信息!` 分支机构的联络方式 问卷调查! 问卷调查 留言咨询! 留言反馈,建议投诉
    2020-12-03下载
    积分:1
  • 基于DSP的恒压频比控制SVPWM方式的研究和实现
    利用数字信号处理器TMS320F240产生基于恒压频比控制的对称SVPWM调制波形。第23卷第4李等:基于ISP的恒压频比掉制 SVPWM方式的饼究和实现69平衡,引起较大的电流谐波4方法一软作编写较复杂但儿始三相电流平衡,电流谐波较小,响DSP的强大处理能力及运行速度能实现复杂时算法和具有良好的实时性,某于上述根据1le和电北的速度汗6考虑因此本文采用力法实现 SVPWM波形的产生。3基于TMS320240的SPwM波形的产根拈江,的角用亡所有内象压生本文采用TI公司专为电机控制而推出的一种定点数舶腴躯到案菠,出≤n(Th[A)eo5(l字信号处坦器TMS32F240,产生恒压频比制下SⅤPwM波形计銲mr门d-相分量事件管理模块是整个控制系统的关键,首先更对它进;算山n,亡约过行正确的配置。本系统选取丛HWM的截波频率为1∠kHz处区时间为32us,与 SVPWM波形产生相关的EV(事件管算I1,21的玫值弹)模块的初始化如图6所示m的据值是根据电机的u/∫曲线来确定,采用∫的指令值求出vn的幅值am的相根据un所在的区,裁全较打图位变化2可由定时器T:的定时周期T(TwmM)和电机角速度a1求出。根据角判断m所在的象限,为减少所占据的程序存储空问,只配备0~90的正弦函数表找出9角在第一象限的对应角度,并求解出x的dq轴分量和图7SHWM生成子彩序凉程图L。根据式(4)求解T1,T2,其中U1∠、U2分别为主辋矢4结论量的d轴分量,L1、21为主辅矢量的q轴分量。uU图8为本文实验时输出的 SVPWM词制波(调制波为TPWMl Ud Ua]=Iti t2 x(4)3OHZ,酸波为12kz)经滤波后所得波形可以看出,SVP则T0=Trw“T1“T2,根据vm所在的扇区,分别把0wM的调制波相当于在原正弦波上叠加了一个三次谐波25Tc,0.25T0+0.571,0.25T+0,5T1+0.572装载CM和准优化PWM有异曲冋工之处,其实质也是一种带谐波注入的调制方法PR1CMPR2、CMPR3。初始化比较控制寄存器 COMCON1、SCM321=11,输出为PW牒式FCOMIPCE=1,金比铰輪出使舱ACTRLO10=00,下激时重装载A4、D1000下设时重装戴CMPR5、比按使能 CENAELE初始化全比较动作控制寄存器ACTR设意引脚输出授性(1、3、5为低有效,2、4、6有效医8SⅤPWM调铜波始化死区控制寄存舞 DErCO、使鹿死区足时器PB3:j=111参考文献改置死区定时器的预定标因于 DBTPS:0=1设置死区时间DBr70=目,本系统设置死区时间为32s11 BROECK H W, Analysis and Realization of a pulsewidth mocu[J IEEE TrA初始化通用定时器1的挖制寄存器TON198,24(1):142~150设置计数擲式为连续增、减Tmod21:0=10!2]王研,杜军红,陶佧宜,等基于LP的空间电压矢量法的研究[J]电机与控制学报,200,2:98调制频半设为K出(Te=83),因此设置T】PR=34h「3韩安太,峙飞黄海LSP控剖器原理及其在运奷控制系统中的应用M]北京:清华大学出版社,2003「4.王潞刚基于DP的异步电动机 SVPWM系统研究[D],东工业大学硕二沦文,2002图6与 SVPWM生成相关的EV初始化r5 Spacc-Vcctor PWM wita TMS320C24X/F24x Using lardand ssedR]. TI I产生SⅥwM波形的子程序流程图如图7所示。March 199916] Using Coustant V H Principle Space Vector PWM Techor Ac InsteonⅣ otor cth’C240R]T!i
    2020-12-08下载
    积分:1
  • modbus串口从机程序基于libmodbus,《MODBUS软件开发实战指南》源代码
    在win7下采用vs2015编程的modbus从机程序,c++程序,是《MODBUS软件开发实战指南》源代码2,下载后可直接运行,对使用libmodbus入门有很大帮助,在此基础上可参考libmodbus例程及其它资料实现modbus tcp编程。含libmodbus的使用方法、虚拟串口工具及《MODBUS软件开发实战指南》。
    2020-12-12下载
    积分:1
  • 三维点云数据,内含6个点云数据
    本人所做点云数据实验用到的一些点云,适合用于演示等操作,如有需求还可提供其他的。
    2020-11-28下载
    积分:1
  • 北斗伪距单点定位程序
    北斗伪距单点定位程序,在VS2012下运行,可以读取最新的RINEX3格式的混合文件,精度在十米左右。
    2020-11-30下载
    积分:1
  • Finite-Dimensional Vector Spaces - P. Halmos (Springer, 1987)
    在学习代数学之余,值得一看的代数学书籍。里面介绍了更为丰富的代数学概念和结论。PREFACEMy purpose in this book is to treat linear transformations on finite-dimensional vector spaces by the methods of more general theories. Theidea is to emphasize the simple geometric notions common to many partsof mathematics and its applications, and to do so in a language that givesaway the trade secrets and tells the student what is in the back of the mindsof people proving theorems about integral equations and Hilbert spaces.The reader does not, however, have to share my prejudiced motivationExcept for an occasional reference to undergraduate mathematics the bookis self-contained and may be read by anyone who is trying to get a feelingfor the linear problems usually discussed in courses on matrix theory orhigher"algebra. The algebraic, coordinate-free methods do not lose powerand elegance by specialization to a finite number of dimensions, and theyare, in my belief, as elementary as the classical coordinatized treatmentI originally intended this book to contain a theorem if and only if aninfinite-dimensional generalization of it already exists, The temptingeasiness of some essentially finite-dimensional notions and results washowever, irresistible, and in the final result my initial intentions are justbarely visible. They are most clearly seen in the emphasis, throughout, ongeneralizable methods instead of sharpest possible results. The reader maysometimes see some obvious way of shortening the proofs i give In suchcases the chances are that the infinite-dimensional analogue of the shorterproof is either much longer or else non-existent.A preliminary edition of the book (Annals of Mathematics Studies,Number 7, first published by the Princeton University Press in 1942)hasbeen circulating for several years. In addition to some minor changes instyle and in order, the difference between the preceding version and thisone is that the latter contains the following new material:(1) a brief dis-cussion of fields, and, in the treatment of vector spaces with inner productsspecial attention to the real case.(2)a definition of determinants ininvariant terms, via the theory of multilinear forms. 3 ExercisesThe exercises(well over three hundred of them) constitute the mostsignificant addition; I hope that they will be found useful by both studentPREFACEand teacher. There are two things about them the reader should knowFirst, if an exercise is neither imperative "prove that.., )nor interrogtive("is it true that...?" )but merely declarative, then it is intendedas a challenge. For such exercises the reader is asked to discover if theassertion is true or false, prove it if true and construct a counterexample iffalse, and, most important of all, discuss such alterations of hypothesis andconclusion as will make the true ones false and the false ones true. Secondthe exercises, whatever their grammatical form, are not always placed 8oas to make their very position a hint to their solution. Frequently exer-cises are stated as soon as the statement makes sense, quite a bit beforemachinery for a quick solution has been developed. A reader who tries(even unsuccessfully) to solve such a"misplaced"exercise is likely to ap-preciate and to understand the subsequent developments much better forhis attempt. Having in mind possible future editions of the book, I askthe reader to let me know about errors in the exercises, and to suggest im-provements and additions. (Needless to say, the same goes for the text.)None of the theorems and only very few of the exercises are my discovery;most of them are known to most working mathematicians, and have beenknown for a long time. Although i do not give a detailed list of my sources,I am nevertheless deeply aware of my indebtedness to the books and papersfrom which I learned and to the friends and strangers who, before andafter the publication of the first version, gave me much valuable encourage-ment and criticism. Iam particularly grateful to three men: J. L. Dooband arlen Brown, who read the entire manuscript of the first and thesecond version, respectively, and made many useful suggestions, andJohn von Neumann, who was one of the originators of the modern spiritand methods that I have tried to present and whose teaching was theinspiration for this bookP、R.HCONTENTS的 FAPTERPAGRI SPACESI. Fields, 1; 2. Vector spaces, 3; 3. Examples, 4;4. Comments, 55. Linear dependence, 7; 6. Linear combinations. 9: 7. Bases, 108. Dimension, 13; 9. Isomorphism, 14; 10. Subspaces, 16; 11. Calculus of subspaces, 17; 12. Dimension of a subspace, 18; 13. Dualspaces, 20; 14. Brackets, 21; 15. Dual bases, 23; 16. Reflexivity, 24;17. Annihilators, 26; 18. Direct sums, 28: 19. Dimension of a directsum, 30; 20. Dual of a direct sum, 31; 21. Qguotient spaces, 33;22. Dimension of a quotient space, 34; 23. Bilinear forms, 3524. Tensor products, 38; 25. Product bases, 40 26. Permutations41; 27. Cycles,44; 28. Parity, 46; 29. Multilinear forms, 4830. Alternating formB, 50; 31. Alternating forms of maximal degree,52II. TRANSFORMATIONS32. Linear transformations, 55; 33. Transformations as vectors, 5634. Products, 58; 35. Polynomials, 59 36. Inverses, 61; 37. Mat-rices, 64; 38. Matrices of transformations, 67; 39. Invariance,7l;40. Reducibility, 72 41. Projections, 73 42. Combinations of pro-jections, 74; 43. Projections and invariance, 76; 44. Adjoints, 78;45. Adjoints of projections, 80; 46. Change of basis, 82 47. Similarity, 84; 48. Quotient transformations, 87; 49. Range and null-space, 88; 50. Rank and nullity, 90; 51. Transformations of rankone, 92 52. Tensor products of transformations, 95; 53. Determinants, 98 54. Proper values, 102; 55. Multiplicity, 104; 56. Triangular form, 106; 57. Nilpotence, 109; 58. Jordan form. 112III ORTHOGONALITY11859. Inner products, 118; 60. Complex inner products, 120; 61. Innerproduct spaces, 121; 62 Orthogonality, 122; 63. Completeness, 124;64. Schwarz e inequality, 125; 65. Complete orthonormal sets, 127;CONTENTS66. Projection theorem, 129; 67. Linear functionals, 130; 68. P aren, gBCHAPTERtheses versus brackets, 13169. Natural isomorphisms, 138;70. Self-adjoint transformations, 135: 71. Polarization, 13872. Positive transformations, 139; 73. Isometries, 142; 74. Changeof orthonormal basis, 144; 75. Perpendicular projections, 14676. Combinations of perpendicular projections, 148; 77. Com-plexification, 150; 78. Characterization of spectra, 158; 79. Spec-ptral theorem, 155; 80. normal transformations, 159; 81. Orthogonaltransformations, 162; 82. Functions of transformations, 16583. Polar decomposition, 169; 84. Commutativity, 171; 85. Self-adjoint transformations of rank one, 172IV. ANALYSIS....17586. Convergence of vectors, 175; 87. Norm, 176; 88. Expressions forthe norm, 178; 89. bounds of a self-adjoint transformation, 17990. Minimax principle, 181; 91. Convergence of linear transformations, 182 92. Ergodic theorem, 184 98. Power series, 186APPENDIX. HILBERT SPACERECOMMENDED READING, 195INDEX OF TERMS, 197INDEX OF SYMBOLS, 200CHAPTER ISPACES§L. FieldsIn what follows we shall have occasion to use various classes of numbers(such as the class of all real numbers or the class of all complex numbers)Because we should not at this early stage commit ourselves to any specificclass, we shall adopt the dodge of referring to numbers as scalars. Thereader will not lose anything essential if he consistently interprets scalarsas real numbers or as complex numbers in the examples that we shallstudy both classes will occur. To be specific(and also in order to operateat the proper level of generality) we proceed to list all the general factsabout scalars that we shall need to assume(A)To every pair, a and B, of scalars there corresponds a scalar a+called the sum of a and B, in such a way that(1) addition is commutative,a+β=β+a,(2)addition is associative, a+(8+y)=(a+B)+y(3 there exists a unique scalar o(called zero)such that a+0= a forevery scalar a, and(4)to every scalar a there corresponds a unique scalar -a such that十(0(B)To every pair, a and B, of scalars there corresponds a scalar aBcalled the product of a and B, in such a way that(1)multiplication is commutative, aB pa(2)multiplication is associative, a(Br)=(aB)Y,( )there exists a unique non-zero scalar 1 (called one)such that al afor every scalar a, and(4)to every non-zero scalar a there corresponds a unique scalar a-1or-such that aaSPACES(C)Multiplication is distributive with respect to addition, a(a+n)If addition and multiplication are defined within some set of objectsscalars) so that the conditions(A),B), and (c)are satisfied, then thatset(together with the given operations) is called a field. Thus, for examplethe set Q of all rational numbers(with the ordinary definitions of sumand product)is a field, and the same is true of the set of all real numberaand the set e of all complex numbersHHXERCISIS1. Almost all the laws of elementary arithmetic are consequences of the axiomsdefining a field. Prove, in particular, that if 5 is field and if a, and y belongto 5. then the following relations hold80+a=ab )Ifa+B=a+r, then p=yca+(B-a)=B (Here B-a=B+(a)(d)a0=0 c=0.(For clarity or emphasis we sometimes use the dot to indi-cate multiplication.()(-a)(-p)(g).If aB=0, then either a=0 or B=0(or both).2.(a)Is the set of all positive integers a field? (In familiar systems, such as theintegers, we shall almost always use the ordinary operations of addition and multi-lication. On the rare occasions when we depart from this convention, we shallgive ample warningAs for "positive, "by that word we mean, here and elsewherein this book, "greater than or equal to zero If 0 is to be excluded, we shall say"strictly positive(b)What about the set of all integers?(c) Can the answers to these questiong be changed by re-defining addition ormultiplication (or both)?3. Let m be an integer, m2 2, and let Zm be the set of all positive integers lessthan m, zm=10, 1, .. m-1). If a and B are in Zmy let a +p be the leastpositive remainder obtained by dividing the(ordinary) sum of a and B by m, andproduct of a and B by m.(Example: if m= 12, then 3+11=2 and 3. 11=9)a) Prove that i is a field if and only if m is a prime.(b What is -1 in Z5?(c) What is囊izr?4. The example of Z, (where p is a prime)shows that not quite all the laws ofelementary arithmetic hold in fields; in Z2, for instance, 1 +1 =0. Prove thatif is a field, then either the result of repeatedly adding 1 to itself is always dif-ferent from 0, or else the first time that it is equal to0 occurs when the numberof summands is a prime. (The characteristic of the field s is defined to be 0 in thefirst case and the crucial prime in the second)SEC. 2VECTOR SPACES35. Let Q(v2)be the set of all real numbers of the form a+Bv2, wherea and B are rational.(a)Ie(√2) a field?(b )What if a and B are required to be integer?6.(a)Does the set of all polynomials with integer coefficients form a feld?(b)What if the coeficients are allowed to be real numbers?7: Let g be the set of all(ordered) pairs(a, b)of real numbers(a) If addition and multiplication are defined by(a月)+(,6)=(a+y,B+6)and(a,B)(Y,8)=(ary,B6),does s become a field?(b )If addition and multiplication are defined by(α,月)+⑦,b)=(a+%,B+6)daB)(,b)=(ay-6a6+的y),is g a field then?(c)What happens (in both the preceding cases)if we consider ordered pairs ofcomplex numbers instead?§2. Vector spaceWe come now to the basic concept of this book. For the definitionthat follows we assume that we are given a particular field s; the scalarsto be used are to be elements of gDEFINITION. A vector space is a set o of elements called vectors satisfyingthe following axiomsQ (A)To every pair, a and g, of vectors in u there corresponds vectora t y, called the aum of a and y, in such a way that(1)& ddition is commutative,x十y=y十a(2)addition is associative, t+(y+2)=(+y)+a(3)there exists in V a unique vector 0(called the origin) such thata t0=s for every vector and(4)to every vector r in U there corresponds a unique vector -rthat c+(-x)=o(B)To every pair, a and E, where a is a scalar and a is a vector in u,there corresponds a vector at in 0, called the product of a and a, in sucha way that(1)multiplication by scalars is associative, a(Bx)=aB)=, and(2 lz a s for every vector xSPACESSFC B(C)(1)Multiplication by scalars is distributive with respect to vectorddition, a(+y=a+ ag, and2)multiplication by vectors is distributive with respect to scalar ad-dition, (a B )r s ac+ Bc.These axioms are not claimed to be logically independent; they aremerely a convenient characterization of the objects we wish to study. Therelation between a vector space V and the underlying field s is usuallydescribed by saying that v is a vector space over 5. If S is the field Rof real number, u is called a real vector space; similarly if s is Q or if gise, we speak of rational vector spaces or complex vector space§3. ExamplesBefore discussing the implications of the axioms, we give some examplesWe shall refer to these examples over and over again, and we shall use thenotation established here throughout the rest of our work.(1) Let e(= e)be the set of all complex numbers; if we interpretr+y and az as ordinary complex numerical addition and multiplicatione becomes a complex vector space2)Let o be the set of all polynomials, with complex coeficients, in avariable t. To make into a complex vector space, we interpret vectoraddition and scalar multiplication as the ordinary addition of two poly-nomials and the multiplication of a polynomial by a complex numberthe origin in o is the polynomial identically zeroExample(1)is too simple and example (2)is too complicated to betypical of the main contents of this book. We give now another exampleof complex vector spaces which(as we shall see later)is general enough forall our purposes.3)Let en,n= 1, 2,. be the set of all n-tuples of complex numbers.Ix=(1,…,轨)andy=(m1,…,n) are elements of e, we write,,bdefinitionz+y=〔1+叽,…十物m)0=(0,…,0),-inIt is easy to verify that all parts of our axioms(a),(B), and (C),52, aresatisfied, so that en is a complex vector space; it will be called n-dimenaionalcomplex coordinate space
    2020-12-05下载
    积分:1
  • 110kv变电站电气一次设计
    本科毕业设计必备!!毕业设计轻松通过 超值
    2020-11-05下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载