登录
首页 » Others » Key Technologies for 5G Wireless Systems

Key Technologies for 5G Wireless Systems

于 2020-12-06 发布
0 181
下载积分: 1 下载次数: 6
我要下载

代码说明：

5G无线通信系统关键技术（剑桥大学出版社） 2017年出版 对于5G所有最新技术进行了详细说明 很全的工具书Key Technologies for5G Wireless SystemsVINCENT W. S, WONGUniversity of British ColumbiaROBERT SCHOBERUniversity of Erlangen-NurembergDERRICK WING KWAN NGUniversity of New South WalesLI-CHUN WANGNational Chiao-Tung University即CAMBRIDGEUNIVERSITY PRESSCAMBRIDGEUNIVERSITY PRESSUniversity Printing House. Cambridge CB2 SBS. United KindomOne Liberty Plaza, 20h Floor New York, NY I(H0X, USA477 williamstown Road, port Melbourne, yic 3207 australia48424, 2nd Floor, Ansar Rod, Daryaganj. Delhi- I l4XH2, India79 Anson Road, #o6-(/ 00, Singapore 079%MCambridge University Press is part of the Lniversity of CambridgeIt furthers the University s mission by disseminating knowledge in the pursuit ofeducation, leaming and research at the highest international levels of excellence.www.cermbrid吧eInformtiononthistitlewww.cambridgeorg/978110713241810,1017③781316771655C Cambridge University Press 2017This puhlication is in copyright. Subjcct to sututonry exceptionand to the provisions of relewant collective licensing agreementsno reproduction of any part may take place without the writtenpermission of Cutmbridgre University Press.First published 2(117Printed in the United Kingdom by TJ International Ltd. Padstow, CornwallA catalogue recor for this pudlieafiove is aailable fromm the British LibraryLibrary of Congress Cataloging- in Pi hlicaiomz dataNames: Wong, Vincent W.S., editorTitle: Key technologies for 5G wireless systems/edited by Vincent W.S. Wong [and 3 otherOther titles key technologies for five g wireless svstemsDescription: Carmbrisige: New York, NY: Cambridge Lniversity Press, 2017.Identifiers: l CCN 2016045220)1 ISBN 9781 172418 (hardback)Subjects: LCSH: Wireless communication systems, I Machine-to-machinecommunications. Internet of things.Classitication: LCC TKs1032K49 2(17 DDC 621.38450-dc23LcrecordavailaBleathttps://lccnioc-gov/2016m5220)ISBN 978-1-107-17241- HardbackCambridge University Press has no responsibility for the persistence or accuracy ofURLs for extermal or third-party Internet websites referred to in this puhlication,and does not guarantee that any content on such websites is, or will remainaccurate of appropriateContentsList of Contributorspage xvIPrefaceKXIOverview of New Technolog ies for 5G SystemsVincent W S, Wong, Robert Schober, Derrick Wing Kwan Ng, and Li-Chun Wang1.1 Introduction1.2 Cloud Radio Access Networks1.3 Cloud Computing and Fog Computing1. 4 Non-orthogonal Multiple Access1. 5 Flexible Physical Layer Design334.4671. 6 Massive MIMo1. 7 Full-Duplex Communications1. 8 Millimeter wave1.9 Mobile Data Offloading, LTE-Unlicensed, and Smart Data Pricing131. 10 IoT M2M. and D2D1. I1 Radio Resource Management, Interference Mitigation, and Caching61. 12 Energy Harvesting Communications1. 13 Visible Light Communication19Acknowledgments20ReferencesPart I Communication Network Architectures for 5G Systems25Cloud Radio Access Networks for 5G Systems27Chih-Lin I, Jinn Huang, Xueyan Husang, Rongwved Ren, and Yami. Chen2.1 Rethinking the Fundamentals for 5G Systems272 User- Centric Networks2923 C-RAN Basics292.3.1 C-RAN Challenges Toward SGI302.4 Next Generation Fronthaul Interface (NGFI: The FH Solutionfor SGC-RAN312. 4.1 Proof-of-Concept Development of NGFI33Contents2.5 Proof-of-Concept Verification of Virtualized C-RAN2.5.1 Data packets3725.2 Test Procedure382.5.3 Test Results392. 6 Rethinking the Protocol Stack for C-RAN2.6.1 Motivation402.6.2 Multilevel Centralized and Distributed Protocol Stack402.7 Conclusion45AcknowledgmentsReferencesFronthaul-Aware Design for Cloud Radio Access Networks48Liang Liu, Wei Yu, and Osvaldo Simeone3. 1 Introduction483.2 Fronthaul-Aware Cooperative Transmission and Reception493. 2.1 Uplink513.2.2 Downlink573.3 Fronthaul-Aware Data Link and Physical layers61.3. I Uplink633.3.2 Downlink693.4 Conclusion73Acknowledgments74References74MobEdge computing76Ben Liang4.1 Introduction764.2 Mobile Edge Computing774.3 Reference architecture794.4 Benefits and Application Scenarios804 4.1 User-Oriented Use cases4. 4.2 Operator-Oriented Use Ca814 5 Research challenges824.5.1 Computation Offloading824.5.2 Communication Access to Computational Resources834.5.3 Multi-resource Schedulin844.5 4 Mobility Management854.5.5 Resource Allocation and Pricing4.5.6 Network functions virtualization864.5, 7 Security and Pri864.5.8 Integration with Emerging Technologies874.6 Conclusion88ReferencesContentsDecentralized Radio Resource Management for Dense HeterogeneousWireless networksAbolfazl Mehhodniya and Fumiyuki Adach5.1 Introduction925.2 System Model935.2.1 SINR Expression5.2.2 Load and Cost Function Expressions955.3 Joint BSCSA/UECSA ON/OFF Switching Scheme965.3.1 StrateTy Selection and Beacon Transmission53.2 UE AssocIation5.3.3 Proposed Channel Segregation Algorithms985.3.4 Mixed-Strategy Update3.4 Computer Simulation5.5 Conclusion104Acknowledgments04References105Part ll Physical Layer Communication Techniques107Non-Orthogonal Multiple Access(NOMA)for 5G Systems109Wei Llang, Zhiguo Ding, and H. Vincent Poor6.1 Introduction1106.2 NOMA in Single-Input Single-Output(SISO)Systems1126.2.1 The basics of nomaI126. 2. 2 Impact of User Pairing on NOMA136.2,3 Cognitive Radio Inspired NOMA6. 3 NOMA in MIMO Systems1206.3.1 System Model for MIMO-NOMA Schemes1216.3.2 Design of Precoding and Detection Matrices with Limited CSIT 1236.3.3 Design of Precoding and Detection Matrices with Perfect CSIT 1266.4 Summary and Future Directions128ReferencesFlexible Physical Layer Design133Maximilian Matthe, Martin Danneberg, Dan Zhang, and Gerhard Fettweis7.1 Introduction1337. 2 Generalized Frequency Division Multiplexing357.3 Software-Defined waveform1377. 3. 1 Time Domain Processing1387.3.2 Implementation Architecture1387.4 GFDM Receiver Design14174 Synchronization unit1427. 4.2 Channel Estimation Unit1474.3 MIMo-GFDM Detection Unit145Contents7.5 Summary and Outlook147Acknowledgments148References488Distributed Massive MIMO in Cellular Networks15IMichail Matthaiou and Shi Jin8. I Introduction15l8. 2 Massive MIMO: Basic Principles1528.2.1 Uplink Downlink Channel Models1538.2.2Favorable Propagation1548.3 Performance of Linear Receivers in a Massive MIMO Uplink1548.4 performance of linear precoders in a massive mimo downlink1578. s Channel estimation in massive mimo systems1588.5.1 Uplink Transmission1598.5.2 Downlink Transmission1608.6 Applications of Massive MIMO Technology1618.6.1 Full-Duplex Relaying with Massive Antenna Arrays1618.6.2 Joint Wireless Information Transfer and Energy Transfer forDistributed massive mimo1638.7 Open Future Research Directions1678. 8 Conclusionl68References169Full-Duplex Protocol Design for 5G Networks172Tanelf Ahonen and Risto wichman9.1 Introduction1729. 2 Basics of Full-Duplex Systems1739.2.1 In-Band Full-Duplex Operation Mode1739.2.2 Self-Interference and Co-channel Interference1749.2.3 Full-Duplex Transceivers in Communication Links1759. 2. 4 Other Applications of Full-Duplex Transceivers1789.3 Design of Full-Duplex Protocols1799.3, 1 Challenges and Opportunities in Full-Duplex Operation1799.3.2 Full-Duplex Communication Scenarios in 5G NetworksR9.4 Analysis of Full-Duplex Protocols1829.4.1 Operation Modes in Wideband Fading Channels1829. 4, 2 Full- Duplex Versus Half-Duplex in Wideband Transmission1849.5 Conclusion1849.5.1 Prospective Scientific Research DirectionsI849.5.2 Full-Duplex in Commercial 5G Networks185RLItrtncekl8610Millimeter Wave Communications for 5G Networks188Jiho Song, Miguel R Castellanos, and David J. LoweContentsⅸx10.1 Motivations and Opportunities18810.2 Millimeter Wave Radio Propagation18910. 2.1 Radio Attenuation1890. 2. 2. Free-Space Path LOSs19I10.2.3 Severe shadow19310.2 4 Millimeter Wave Channel model19310.2.5 Link Budget Analysis19410.3 Beamforming Architectures19510.3, Analog beamforming solutions19610.3.2 Hybrid Beamforming Solutions20010.3.3 Low-Resolution Receiver Architecture2010.4 Channel Acquisition Techniques20110.4.1 Subspace Sampling for Beam Alignment20210.4.2 Compressed Channel estimation Techniques20510.5 Deployment Challenges and Applications20710.5.1 EM Exposure at Millimeter Wave Frequencies20710.5.2 Heterogeneous and Small-Cell Networks208Acknowledgments209References209Interference Mitigation Techniques for Wireless Networks214Koralia N Pappi and George K, Karag annidis1 1.1 Introduction21411.2 The Interference Management Challenge in the 5G vision21411. 2. 1 The 5G Primary Goals and Their Impact on Interference2141 1.2.2 Enabling Technologies for Improving Network Efficiencyand Mitigating Interference21611.3 Improving the Cell-Edge User Experience: Coordinated Multipoint218I 1.3.1 Deployment Scenarios and Network Architecture2181 13. 2 CoMP Techniques for the Uplink22011.3.3 CoMP Techniques for the Downlink2211 1.4 Interference Alignment: Exploiting Signal Space Dimensions2231 1.4.1 The Concept of Linear Interference Alignment224L1. 4.2 The Example of the X-Channel225I 1. 4.3 The K-User Interference Channel and Cellular NetworksAsymptotic Interference Alignment22611.4.4 Cooperative Interferenee Networks22711.4.5 Insight from IA into the Capacity Limits of Wireless Networks 22711.5 Compute-and-Forward Protocol: Cooperation at the ReceiverSide for the Uplink22811.5.1 Encoding and Decoding of the CoF Protocol22811.5.2 Achievable-Rate Region and Integer Equation Selection23011.5.3 Advantages and Challenges of the CoF Protocol232IL6 Conclusion233References233

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • 基于VGA和FPGA实现的打砖块（反弹球）游戏设计
    数字逻辑设计课程大作业。3人合作完成用VHDL语言实现，内含实验报告和源代码。游戏特点有：不同难度级别、计分功能、生命值、绚丽结束画面、砖块形转方便修改、随机发射速度、挡板不同位置反射角不同、小球速度、挡板宽度可变通过FPGA实验板和VGA测试。
    2020-12-06下载
    积分：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
  • Visio 模具大全
    Visio网络拓扑图大全模具（含Cisco、IBM等常用拓扑图标），无毒，绿色的，很实用
    2020-12-06下载
    积分：1
  • MATLAB下求两幅图像的峰值信噪比（PSNR）
    MATLAB下求两幅图像的峰值信噪比（PSNR）。讨厌在网上下到骗分的东西。小程序，保证能运行。
    2020-06-24下载
    积分：1
  • 基于STM32的俄罗斯方块
    基于STM32触摸屏的俄罗斯方块设计 可完成俄罗斯方块的所有基本功能
    2021-05-07下载
    积分：1
  • 电动汽车整车控制器软硬件开发及控制策略
    包括控制器硬件原理图和软件源代码，控制策略以及说明书。
    2020-12-06下载
    积分：1
  • 神经网络时间序列预测源代码（适合初学者）
    先加载excel文件中的数据，再训练，最后预测出未来几步的数据走势。预测步数可以自己设定。文本和程序注释有详细说明。
    2020-12-06下载
    积分：1
  • 一篇关于图像拼接的比较好的硕士论文
    这是一篇关于图像拼接的比较好的硕士论文，是中科院的研究生做的，里面有详细的步骤和参数，具有很大的参考价值
    2020-12-10下载
    积分：1
  • 基于echarts的大屏信息展示
    基于echarts 实现的可视化大屏展示，十种不同模板：上市公司全景预览等。我会不定期把积分调成5,已便于大家使用下载。
    2020-12-12下载
    积分：1
  • s变换的matlab程序
    s变换的MATLAB程序，s变换广泛用于地震监测和参数估计，具有重要的研究价值
    2020-12-05下载
    积分：1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2024 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！