gps产生、解调 simulink

用克鲁斯卡尔算法实现最小生成树有算法思想 源代码 流程图 试验结果

【实例简介】U盘电路图:收集了8种U盘原理图，包括OTI 6808系列、AU9384(5)方案U盘电路图、icreate5062原理图、pp2201方案U盘电路图、安国AU9380方案U盘电路图、安国AU9384主控U盘电路图、SD卡U盘电路图 等

代码里面有tree view的节点操作，包括添加，当前点击检查，遍历等。具体介绍见： Qt树形控件QTreeView使用1——节点的添加删除操作

基于LDA文本分类的python实现版本

不可得的学习资料，详细介绍AE开发技术……esrChinaBEIJING内部文档,请勿外传刷定及修订记录版本完成日期编写/修订纪要编写者备注文档目录结林雪淋构刘宇完善控件介绍和空间数刘宇据库的介绍完善柵格数刘宇据介绍完善符号化刘宇介绍完善网络分刘宇析功能完善参考系刘宇的介绍完善儿何对刘宇象的介绍esrChinaBEIJING内部文档,请勿外传目录介绍和开发相关的知识三.使用控件创建第一个桌面应用程序四.空间数据库五.几何对象和空间参考六.矢量数据空间分析七.符号化八.栅格数据分析九.编辑十.地图输出十实战十二安装部署esrChinaBEIJING内部文档,请勿外传介绍软件架构ArcPadArcGIs标准测览器MobileEngineArcGISExplorerArclnfoPArcEditorOnline GisNetworkArcviewArcReaderArCGIS ServerArcImsArcsDE文件DBMS是在全面整合了与数据库、软件程、人Ⅰ智能、网络技术及其它多方面的计算机主流技术之后,成功地推出了代表最高技术水平的全系列产品是一个全面的,可伸缩的平台,为用户杓建一个完善的系统提供完整的解决方案的基本体系能够让用户在任何需要的地方部署功能和业务逻辑,无论是在桌面、服务器、还是在野外:桌面(桌面软件产品是用来编辑、设计、共享、管理和发布地理信息和概念。桌面可伸缩的产品结构,从,向上扩展到和。目前被公认为是功能最强大的产品。通过一系饥的可选的软件扩展模块,产品的能力还可以进一步得到扩展嵌入式(是一个完整的嵌入式组件库和工具包,开发者能用它创建一个新的、或扩展原有的可定制的桌面应用程序。使用开发者能将功能嵌入到已有的应用程序中,如基于工业标准的产品以及一些商业应用,也可以创建自定义的应用程序,为组织机构中esrChinaBEIJING内部文档,请勿外传的众多用户提供功能。服务器(和用丁创建和管理基丁服务的应用程序在大型机构和互联网上众多用户之间共享地理信息是一个中心应用服务器,它包含一个可共享的软件对象库,能在企业和计算框架中建立服务器端的应用。是通过开放的协议发布地图、数据和元数据的可伸缩的网络地图服务器。是在各种关系型数据库管理系统中管理地理信息的高级空门数据服务器。栘动(支持的无线移动设备,越来越多地应用在野外数据采集和信息访问中。桌面和可以运行在使携式电脑或平板电脑上,用户可以在野外进行数据采集、分析和乃至制定决策。介绍是一组完备的并且打包的嵌入式组件库和工具斥,开发人员可用来创建新的或扩展已有的桌面应用程序。使用开发人员可以将功能嵌入刭已有的应用软件中,如自定义行业专用产品:或嵌入到业生产应用软件中,如和;还可以创建集中式自定义应用软件,并将其发送给机构内的多个用户由两个产品组成:构建软件所用的开发工具包以及使已完成的应用程序能够运行的可再发布的(运行时环境)。开发工具包是一个基于组件的软件开发产品,可用于构建自定义和制图应用软件。它并不是一个终端用户产品,而是软件开发人员的工具包,适于为或用户构建基础制图和综合动态应用软件是一个使终端用户软件能够运行的核心组件产品,并且将被安装在每一台运行应用程序的计算机上◆ Arcgis engine是基于COM技术的可嵌入的组件库和工具包, ArcGis engine可以帮助我们很轻松的构建自定义应用程序esrChinaBEIJING内部文档,请勿外传令使用 ArcGIS Engine,开发人员可以将(iS功能嵌入到已有的应用软件中,如自定义行业专用产品;或嵌入到业生产应用软仵中,如 Mirosoftf Word和 Excel;还可以创建集中式自定义应用软件,并将其发送给机构内的多个用户ArcGis Engine由两个产品组成:◇面向开发人员的软件开发包(ArcG| S Engine developer kit面向最终用户的运行时( ArcGIs Engine Runtime开发工具包是一个基于组件的软件开发产品,可用于构建自定义和制图应用软件。它并不是一个终端用户产品,而是软件开发人员的工具包,支持四种开发环境(十十,以及),适于为用户构建基础饲图和综合动态应用软件。是一个使终端用户软件能够运行的核心组件产品,并且将被安装在每一台运行应用程序的计算机上reGIS Engine的逻辑体系结构包含了 ArcGIS Engine中最核心的 ArcObjects组件,几乎所有的GS组件需要调用它们,如 Geometry| Extensions和 Display等DeveloperComponents包含了访问矢量或栅格数据的 GeoDatabase所有的接口和类组件。MapPresentationData包含了GiS应用程序用于数据显示、数据符号化、要素标注和专题图制作等需要的接凵和类组件AccessBaseServices包含了进行快速开发所需要的全部可视化控件,如和控件等,除了这些,该库还包括大量可以有调用的内置它们可以极大地简化二次开发工作。在图中我们可看出的开发体系是一条纵线,功能丰富,层次清晰。最上层的esrChinaBEIJING内部文档,请勿外传包含了许多高级开发功能,如、空间分析、维分析、网络分析、逻缉示意图以及数据与操作等。标准版并不包含这些许可,他们只能作为扩展存在,需要特定的才能运行。扩展模块3D三维分析Spatial空间分析Network网络分析Maplex智能标注Data Interoperability数据互操作Schematics逻辑示意图Tracking跟踪分析Geostatistical地理统计分析注意:运行时有多种版木级别,从标准版木一直到全业版木。标准的运行时提供所有应用程序的核心功能。这个级别的运行时可以操作几种不同的栅格和矢量格式、进行地图表达和创建以及通过执行各种空间或属性查询查找要素。这个级别的运行时还可以进行基本数据创建、编辑和简单的个人地理数据库(及分析但是如果遇到企业级数据库数据库的编辑以及复杂数捱模型的创建网络拓扑就需要运行时的标准许可相当于桌面级别的功能而许可相当于桌面级别的功能esrChinaBEIJING内部文档,请勿外传中的类库开发中,为了更好的管理这些对象,将这些对象放在不同的组件库中,而他们被物理的防盜目录下的中,而逻辑上被分散到不同的命名空间中下面我们详细对一些类库进行介绍库是新出来的一个类库,该类库包含了将独立应用程厅绑定到特定的系列产品的函数和方法该类库是在运行的应用程序的时侯库是架构中最底层的库。该库包含了暴露组成的其它库所使用的服务的组件。库中定义了许多接口,它们可以由开发者来实现。对象在中定义;所有开发者必须使用该对象在使用功能的应用程序中初始化和开发者不扩展该库,但可以通过实现其中的接口来扩展系统。库中包含了可在屮扩展的用户界面组件的接口定义,包括和接口。开发者使用这些接口来扩展组件。该库所包含的对象是对象,开发者可用于简化某些用户界面的开发。开发者不扩展该库,但可以通过实现其中的接口来扩展系统。库处理存储在特征类其它图形要素中的特征的或大多数用户交互的基本几何对象有。除了这些顶层的实体,还有作为和构建模块的几何体这些是组成几何体的基元它们是由形成一条的依次相连的组成包含两个不同的点,起点和终点,和一个定义从起点到终点的曲线的要素类型。这种有和所有的几何对象都可以有与它们顶点相关的、和esrChinaBEIJING内部文档,请勿外传基本的几何对象都支持几何操作,如和开发者不可以扩展几何基元。中的实体是指现实世界中的特征:这些现实世界中的特征的位置由具有空间参考的几何体來定义。投影和地理坐标系统的空间参考对象都包含在库中。开发者可以通过在空间参考间添加新的空间参考和投影来扩展空间参考系统库包含了用于数据显示的对象。除了负责实际图像输出的主要显示对象,该库屮还包含了表示颜色和符号的对象,这些颜色和符号用于控制显示上所绘制实体的属性。库中也包含了为用户在与显示交互时提供可视化反馈的对象。开发者大都通过类似于或对象提供的视图与显示交互。该库的所有部分都可以被扩展,常被扩展的有符号、颜色和显示反馈库被用于创建图形输出到设备,如打印杋、绘图仪和硬拷仄格式,如增强型图元文件和栅格影像格式、等。开发者使用该库和系统其它部分中的对象来创建图形输岀。通常这些是和厍中的对象。开发者可以扩展库用于定制的设备和输出格式。库提供了用于的编程是一个构建在标准工业关系和对象数据库技术基础上的地理数据储存库。库中的对象为攴持的所有数据源提供了统一的编稈模型。库定义了许多由架构中较高层次数据源提供者实现的接口。开发者可以扩展来支持特殊的数据对象等类型。此外,还可以使用对象添加自定义的矢量数据源。支持的数据类型不可以被扩展库包含用于基于文件数据源的的实现。这些基于文件的数据源包括N和开发者不能扩展库包含了用于数据库数据源的的实现。这些数据源包括软件支持的开发者不能扩展库

凸优化理论在信号处理以及通信系统中的应用 比较经典的通信系统凸优化入门教程ContentsList of contributorspage IxPrefaceAutomatic code generation for real- time convex optimizationJacob Mattingley and stephen Boyd1.1 Introduction1.2 Solvers and specification languages61. 3 Examples121. 4 Algorithm considerations1.5 Code generation261.6 CVXMOD: a preliminary implementation281.7 Numerical examples291. 8 Summary, conclusions, and implicationsAcknowledgments35ReferencesGradient-based algorithms with applications to signal-recoveryproblemsAmir beck and marc teboulle2.1 Introduction422.2 The general optimization model432.3 Building gradient-based schemes462. 4 Convergence results for the proximal-gradient method2.5 A fast proximal-gradient method2.6 Algorithms for l1-based regularization problems672.7 TV-based restoration problems2. 8 The source-localization problem772.9 Bibliographic notes83References85ContentsGraphical models of autoregressive processes89Jitkomut Songsiri, Joachim Dahl, and Lieven Vandenberghe3.1 Introduction893.2 Autoregressive processes923.3 Autoregressive graphical models983. 4 Numerical examples1043.5 Conclusion113Acknowledgments114References114SDP relaxation of homogeneous quadratic optimization: approximationbounds and applicationsZhi-Quan Luo and Tsung-Hui Chang4.1 Introduction1174.2 Nonconvex QCQPs and sDP relaxation1184.3 SDP relaxation for separable homogeneous QCQPs1234.4 SDP relaxation for maximization homogeneous QCQPs1374.5 SDP relaxation for fractional QCQPs1434.6 More applications of SDP relaxation1564.7 Summary and discussion161Acknowledgments162References162Probabilistic analysis of semidefinite relaxation detectors for multiple-input,multiple-output systems166Anthony Man-Cho So and Yinyu Ye5.1 Introduction1665.2 Problem formulation1695.3 Analysis of the SDr detector for the MPsK constellations1725.4 Extension to the Qam constellations1795.5 Concluding remarks182Acknowledgments182References189Semidefinite programming matrix decomposition, and radar code design192Yongwei Huang, Antonio De Maio, and Shuzhong Zhang6.1 Introduction and notation1926.2 Matrix rank-1 decomposition1946.3 Semidefinite programming2006.4 Quadratically constrained quadratic programming andts sdp relaxation201Contents6.5 Polynomially solvable QCQP problems2036.6 The radar code-design problem2086.7 Performance measures for code design2116.8 Optimal code design2146.9 Performance analysis2186.10 Conclusions223References226Convex analysis for non-negative blind source separation withapplication in imaging22Wing-Kin Ma, Tsung-Han Chan, Chong-Yung Chi, and Yue Wang7.1 Introduction2297.2 Problem statement2317.3 Review of some concepts in convex analysis2367.4 Non-negative, blind source-Separation criterion via CAMNS2387.5 Systematic linear-programming method for CAMNS2457.6 Alternating volume-maximization heuristics for CAMNS2487.7 Numerical results2527.8 Summary and discussion257Acknowledgments263References263Optimization techniques in modern sampling theory266Tomer Michaeli and yonina c. eldar8.1 Introduction2668.2 Notation and mathematical preliminaries2688.3 Sampling and reconstruction setup2708.4 Optimization methods2788.5 Subspace priors2808.6 Smoothness priors2908.7 Comparison of the various scenarios3008.8 Sampling with noise3028. 9 Conclusions310Acknowledgments311References311Robust broadband adaptive beamforming using convex optimizationMichael Rubsamen, Amr El-Keyi, Alex B Gershman, and Thia Kirubarajan9.1 Introduction3159.2 Background3179.3 Robust broadband beamformers3219.4 Simulations330Contents9.5 Conclusions337Acknowledgments337References337Cooperative distributed multi-agent optimization340Angelia Nedic and asuman ozdaglar10.1 Introduction and motivation34010.2 Distributed-optimization methods using dual decomposition34310.3 Distributed-optimization methods using consensus algorithms35810.4 Extensions37210.5 Future work37810.6 Conclusions38010.7 Problems381References384Competitive optimization of cognitive radio MIMO systems via game theory387Gesualso Scutari, Daniel P Palomar, and Sergio Barbarossa11.1 Introduction and motivation38711.2 Strategic non-cooperative games: basic solution concepts and algorithms 39311.3 Opportunistic communications over unlicensed bands411.4 Opportunistic communications under individual-interferenceconstraints4151.5 Opportunistic communications under global-interference constraints43111.6 Conclusions438Ackgment439References43912Nash equilibria: the variational approach443Francisco Facchinei and Jong-Shi Pang12.1 Introduction44312.2 The Nash-equilibrium problem4412. 3 EXI45512.4 Uniqueness theory46612.5 Sensitivity analysis47212.6 Iterative algorithms47812.7 A communication game483Acknowledgments490References491Afterword494Index49ContributorsSergio BarbarossaYonina c, eldarUniversity of rome-La SapienzaTechnion-Israel Institute of TechnologyHaifaIsraelAmir beckTechnion-Israel instituteAmr El-Keyiof TechnologyAlexandra universityHaifEgyptIsraelFrancisco facchiniStephen boydUniversity of rome La sapienzaStanford UniversityRomeCaliforniaItalyUSAAlex b, gershmanTsung-Han ChanDarmstadt University of TechnologyNational Tsing Hua UniversityDarmstadtHsinchuGermanyTaiwanYongwei HuangTsung-Hui ChangHong Kong university of scienceNational Tsing Hua Universityand TechnologyHsinchuHong KongTaiwanThia KirubarajanChong-Yung chiMcMaster UniversityNational Tsing Hua UniversityHamilton ontarioHsinchuCanadaTaiwanZhi-Quan LuoJoachim dahlUniversity of minnesotaanybody Technology A/sMinneapolisDenmarkUSAList of contributorsWing-Kin MaMichael rebsamenChinese University of Hong KongDarmstadt UniversityHong KonTechnologyDarmstadtAntonio de maioGermanyUniversita degli studi di napoliFederico iiGesualdo scutariNaplesHong Kong University of Sciencealyand TechnologyHong KongJacob MattingleyAnthony Man-Cho SoStanford UniversityChinese University of Hong KongCaliforniaHong KongUSAJitkomut songsinTomer michaeliUniversity of californiaTechnion-Israel instituteLoS Angeles. CaliforniaogyUSAHaifaMarc teboulleTel-Aviv UniversityAngelia NedicTel-AvUniversity of Illinois atIsraelUrbana-ChampaignInoSLieven VandenbergheUSAUniversity of CaliforniaLos Angeles, CaliforniaUSAAsuman OzdaglarMassachusetts Institute of TechnologyYue WangBoston massachusettsVirginia Polytechnic InstituteUSAand State UniversityArlingtonDaniel p palomarUSAHong Kong University ofScience and TechnologyYinyu YeHong KongStanford UniversityCaliforniaong-Shi PangUSAUniversity of illinoisat Urbana-ChampaignShuzhong zhangIllinoisChinese university of Hong KongUSAHong KongPrefaceThe past two decades have witnessed the onset of a surge of research in optimization.This includes theoretical aspects, as well as algorithmic developments such as generalizations of interior-point methods to a rich class of convex-optimization problemsThe development of general-purpose software tools together with insight generated bythe underlying theory have substantially enlarged the set of engineering-design problemsthat can be reliably solved in an efficient manner. The engineering community has greatlybenefited from these recent advances to the point where convex optimization has nowemerged as a major signal-processing technique on the other hand, innovative applica-tions of convex optimization in signal processing combined with the need for robust andefficient methods that can operate in real time have motivated the optimization commu-nity to develop additional needed results and methods. The combined efforts in both theoptimization and signal-processing communities have led to technical breakthroughs ina wide variety of topics due to the use of convex optimization This includes solutions tonumerous problems previously considered intractable; recognizing and solving convex-optimization problems that arise in applications of interest; utilizing the theory of convexoptimization to characterize and gain insight into the optimal-solution structure and toderive performance bounds; formulating convex relaxations of difficult problems; anddeveloping general purpose or application-driven specific algorithms, including thosethat enable large-scale optimization by exploiting the problem structureThis book aims at providing the reader with a series of tutorials on a wide varietyof convex-optimization applications in signal processing and communications, writtenby worldwide leading experts, and contributing to the diffusion of these new developments within the signal-processing community. The goal is to introduce convexoptimization to a broad signal-processing community, provide insights into how convexoptimization can be used in a variety of different contexts, and showcase some notablesuccesses. The topics included are automatic code generation for real-time solvers, graphical models for autoregressive processes, gradient-based algorithms for signal-recoveryapplications, semidefinite programming(SDP)relaxation with worst-case approximationperformance, radar waveform design via SDP, blind non-negative source separation forimage processing, modern sampling theory, robust broadband beamforming techniquesdistributed multiagent optimization for networked systems, cognitive radio systems viagame theory, and the variational-inequality approach for Nash-equilibrium solutionsPrefaceThere are excellent textbooks that introduce nonlinear and convex optimization, providing the reader with all the basics on convex analysis, reformulation of optimizationproblems, algorithms, and a number of insightful engineering applications. This book istargeted at advanced graduate students, or advanced researchers that are already familiarwith the basics of convex optimization. It can be used as a textbook for an advanced graduate course emphasizing applications, or as a complement to an introductory textbookthat provides up-to-date applications in engineering. It can also be used for self-study tobecome acquainted with the state of-the-art in a wide variety of engineering topicsThis book contains 12 diverse chapters written by recognized leading experts worldwide, covering a large variety of topics. Due to the diverse nature of the book chaptersit is not possible to organize the book into thematic areas and each chapter should betreated independently of the others. a brief account of each chapter is given nextIn Chapter 1, Mattingley and Boyd elaborate on the concept of convex optimizationin real-time embedded systems and automatic code generation. As opposed to genericsolvers that work for general classes of problems, in real-time embedded optimization thesame optimization problem is solved many times, with different data, often with a hardreal-time deadline. Within this setup the authors propose an automatic code-generationsystem that can then be compiled to yield an extremely efficient custom solver for theproblem familyIn Chapter 2, Beck and Teboulle provide a unified view of gradient-based algorithmsfor possibly nonconvex and non-differentiable problems, with applications to signalrecovery. They start by rederiving the gradient method from several different perspectives and suggest a modification that overcomes the slow convergence of the algorithmThey then apply the developed framework to different image-processing problems suchas e1-based regularization, TV-based denoising, and Tv-based deblurring, as well ascommunication applications like source localizationIn Chapter 3, Songsiri, Dahl, and Vandenberghe consider graphical models for autore-gressive processes. They take a parametric approach for maximum-likelihood andmaximum-entropy estimation of autoregressive models with conditional independenceconstraints, which translates into a sparsity pattern on the inverse of the spectral-densitymatrix. These constraints turn out to be nonconvex. To treat them the authors proposea relaxation which in some cases is an exact reformulation of the original problem. Theproposed methodology allows the selection of graphical models by fitting autoregressiveprocesses to different topologies and is illustrated in different applicationsThe following three chapters deal with optimization problems closely related to SDPand relaxation techniquesIn Chapter 4, Luo and Chang consider the SDP relaxation for several classes ofquadratic-optimization problems such as separable quadratically constrained quadraticprograms(QCQPs)and fractional QCQPs, with applications in communications and signal processing. They identify cases for which the relaxation is tight as well as classes ofquadratic-optimization problems whose relaxation provides a guaranteed, finite worstcase approximation performance. Numerical simulations are carried out to assess theefficacy of the SDP-relaxation approach

本设计将实现一个简单计算器。其类似于Windows附件中自带的计算器。这个计算器不仅实现了简单的四则运算功能，还实现了高级的科学计算功能，而且具有简洁大方的图文外观。它的设计按软件工程的方法进行,系统具有良好的界面、必要的交互信息和较好的健壮性使用人员能快捷简单地进行操作。即时准确地获得需要的计算的结果，充分降低了数字计算的难度和节约了时间，对人们的生活有一定的帮助。在课程设计中，系统开发平台为Windows 2000XP，程序设计设计语言采用Visual C++，在程序设计中，采用了结构化与面向对象两种解决问题的方法。

esp8266-12E的说明书，PDF文档，其他地方不大容易找的。EsP-12E规格书目录1.产品概述21.1.特点1.2.主要参数………垂4由非垂·······:·2.接口定义……4573.外型与尺寸……4.功能描述41. MCU4.2.存储描述99994.3.晶振4.4.接口说明………………104.5.最大额定值4.6.建议工作环境……114.7.数字端口特征115.RF参数126.功耗……………137.倾斜升温……148.原理图…非垂非9.产品试用16深圳市安信可科技有限公司http://www.ai-thinker.comEsP-12E规格书1.产品概述ESP-12EWFⅰ模块是由安信可科技开发的,该模块核心处理器ESP8266在较小尺寸封装中集成了业界领先的 Tensilica l106超低功耗32位微型McU,带有16位精简模式,主频支持80MHz和160MHz,支持RTOS,集成Wi- FI MAC/BB/RF/ PA/LNA,板载天线。该模块攴持标准的IE802.11b/g/n协议,完整的τcPP协议栈。用户可以使用该模块为现有的设备添加联网功能,也可以构建独立的网络控制器ESP8266是高性能无线SOC,以最低成本提供最大实用性,为WⅰFi功能嵌入其他系统提供无限可能。射频MAC接口接收模拟接收匚寄存器」SPI射频CPU内核发射模拟发射心成帧器GPIO加速器12C锁相环H(co)12锁相环电源管理晶振偏置电路SRAM电源管理图1ESP8266EX结构图ESP8266EX是一个完整且自成体系的WF网络解决方案,能够独立运行,也可以作为从机搭载于其他主机McU运行。ESP8266EⅩ在搭载应用并作为设备中唯一的应用处理器时,能够直接从外接闪存中启动。内置的高速缓冲存储器有利于提高系统性能,并减少內存需求。另外一种情况是,ESP8266EX负责无线上网接入承担WiFi适配器的任务时,可以将其添加到任何基于微控制器的设计中,连接简单易行,只需通过SPI/SDO接口或I2 C/UART口即可。ESP8266EX强大的片上处理和存储能力,使其可通过GPIO口集成传感器及其他应用的特定设备,实现了最低前期的开发和运行中最少地占用系统资源。ESP8266EⅩ高度片内集成,包括天线开关 balerη、电源管理转换器,因此仅需极少的外部电路,且包括前端模组在內的整个解决方案在设计时将所占PCB空间降到最低。深圳市安信可科技有限公司http://www.ai-thinker.com2EsP-12E规格书有ESP8266EⅩ的系统表现出来的领先特征有:节能在睡眠/唤醒模式之间的快速切换、配合低功率操作的自适应无线电偏置、前端信号的处理功能、故障排除和无线电系统共存特性为消除蜂窝/蓝牙/DDR/ LVDS/LCD干扰。11.特点80211b/g/n·内置 Tensilica l106超低功耗32位微型McU,主频攴持80MHz和160MHz,支持RTOS·内置10bit高精度ADC内置TCPP协议栈内置TR开关、 balun、LNA、功率放大器和匹配网络内置PL、稳压器和电源管理组件,802.11b模式下+20dBm的输岀功率A-MPDU、A-MSDU的聚合和0.45的保护间隔WiFi@2.4GHz,支持 WPA/WPA2安全模式支持AT远程升级及云端OTA升级支持 STA/AP/STA+AP工作模式支持 Smart Config功能(包括 Android和iOs设备)HSPI、UART、I2C、I2S、 IR Remote Control、PWM、GPIo深度睡眠保持电流为10uA,关断电流小于5uA2ms之内唤醒、连接并传递数据包·待机状态消耗功率小于1.0mW(DTM3)工作温度范围:-40℃-125°C深圳市安信可科技有限公司http://www.ai-thinker.com3EsP-12E规格书12.主要参数表1介绍了该模组的主要参数。表1参数表类别参数说明无线标准80211b/g/n无线参数频率范围24GHz-25GHz(2400M24835M)数据接口UART/HSPL/I2C/I2S/Ir Remote ContorlGPIO/PWM工作电压30~36V(建议3.3V)工作电流平均值:80mA工作温度40°~125硬件参数存储温度常温封装大小16mm x 24mm x 3mm外部接口N/A无线网络模式station/softAP/SoftAP+station安全机制WPA/WPA2加密类型WEP/TKIP/AES升级固件本地串口烧录/云端升级/主机下载烧录支持客户自定义服务器软件开发软件参数提供SDK给客户二次开发Ipv4, Tcp/udp/Http/ftp网络协议AT+指令集,云端服务器, Android/iOS APP用户配置深圳市安信可科技有限公司http://www.ai-thinker.com4EsP-12E规格书2.接口定义ESP-12E共接出18个接口,表2是接口定义。图2ESP-12E管脚图. RXDEN(CH-PD..GPIOSGPIO16.a.. GPIO4ESP-12EGPIO14..D GPIOOGPIo12·。◆GPIo2GPIO13.aD GPIO15ESP 12E表2ESP-12E管脚功能定义序号Pin脚名称功能说明1RST复位模组ADOA/D转换结果。输入电压范围0~1V,取值范围:0~1024EN芯片使能端,高电平有效4IO16GPIO16;接到RST管脚时可做 deep sleep的唤醒5IO14GPIO14: HSPI CLKIO12GPIO 12, HSPI MISOIO13GPIO13 HSPI MOSI: UARTO CTSVCC33V供电CSO片选10MISO从机输出主机输入深圳市安信可科技有限公司http://www.ai-thinker.com5EsP-12E规格书109GPIo912IO10GBIO1013MOSI主机输出从机输入14SCLK时钟15GNDGND16IO15GPIO15: MTDO: HSPICS: UARTO RTS17102GPIo2: UART1 TXD18IOOGPIOO19IO4GPIO420IO5GPIO521RXDUARTO RXD: GPIO322TXDUARTO TXD: GPIO1表3引脚模式模式GPIO15GPIOG PIO2UART下载模式低低局Flash boot模式表4接收灵敏度参数最小小值典型值最大值单位输入频率24122484MHZ输入电阻输入反射-10dB72.2Mbps下,PA的输出功率141516d Bm深圳市安信可科技有限公司http://www.ai-thinker.com6EsP-12E规格书11b模式下,PA的输出功率17.518.519.5d Bm灵敏度DSSS, 1 Mbps98d BmCCK, 11 Mbps-91d Bm6 Mbps(1/2 BPSK93d Bm54 Mbps (3/4 64-QAM)75d BmHT20, MCS7(65 Mbps, 72.2 Mbps)72d Bm邻频抑制OFDM, 6 Mbps37dBOFDM, 54 Mbps21dHT20, MCSO37dBHT20. MCS7dB3.外型与尺寸ESP-12E贴片式模组的外观尺寸寸为16mm*24mm*3mm(如图3所示〉该模组采用的是容量为4MB,封装为SOP-210mi的 SPI Flash。模组使用的是3DBⅰ的PCB板载天线。深圳市安信可科技有限公司http://www.ai-thinker.comEsP-12E规格书图3ESP-12E模组外观CAr个ESP-12E5m2mt3mm图4ESP-12E模组尺寸平面面图表5ESP-12E模组尺寸对照表长宽PAD尺寸(底部)Pin脚间距16 mm24 mm3 mm0.9 mm x 1.7 mm 2 mm深圳市安信可科技有限公司http://www.ai-thinker.com8

MODIS数据是以一种新型的投影方式，正弦投影组织的。这种投影方式，尚未被广泛采用，MRT tools 可以把 正弦投影转换为我们熟悉的投影方式！●

最新淘宝秒杀插件 绿色软件 免安装 植入浏览器直接运行