登录
首页 » Others » LS信道估计的仿真

LS信道估计的仿真

于 2020-12-10 发布
0 274
下载积分: 1 下载次数: 11

代码说明:

采用基于梳状导频的信道估计,并且采用QPSK调制。IFFT和FFT的点数为128,子载波个数为100,每符号上的比特数为2,每桢的OFDM符号数为12,导频之间的间隔为7,保护间隔长度为8,每比特信噪比为16,信噪比间隔为2。信道模型为带多普勒频移的瑞利衰落信道。多普勒频移为100,多径数为3,采样周期T=1。

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

发表评论

0 个回复

  • Qt 中读写Excel
    实现了Qt下的Excel的读写功能,都在线程中实现,有兴趣的可以看看。
    2020-11-28下载
    积分:1
  • UFS2.0标准协议
    标准的UFS2.0协议文档,带一些注释和说明,很完整,很清晰。
    2020-12-09下载
    积分:1
  • 飞利浦生命体征监护仪数据接口序(网络)demo
    从国外网站找来的开源代码。飞利浦生命体征监护仪网络数据接口程序Demo,可直接运行,并从指定IP的监护仪上读取相关数据。配合对应的数据接口文档来理解更有帮助。也欢迎做同类项目的朋友一起交流。
    2021-05-06下载
    积分:1
  • C++远监控软件源码
    C++编写适用于windows的远程监控软件源码,结构简明清晰,有远程即时监控鼠键控制上传文件远程shell执行等功能,非常适合学习研究
    2020-12-11下载
    积分:1
  • 多目标柔性车间调度的Pareto 混合禁忌搜索算法
    【实例简介】针对最小化最大完成时间、总机床负荷及最大机床负荷的多目标柔性作业车间调度问题, 提出了一种 带有Pareto 档案集的混合禁忌搜索算法。该算法为每次迭代产生的邻域解集进行Pareto 非支配排序, 选择第一前 沿的解用于Par et o 档案集更新, 并给出了一种Par eto 档案集快速更新算法。为减小邻域搜索空间, 结合问题特征, 设计了基于公共关键块结构的插入邻域和交换邻域。通过3 个经典算例的实验仿真, 以及与其他算法的比较, 验 证了该算法的可行性和有效性。
    2021-10-30 00:33:12下载
    积分:1
  • 车型识别系统
    1.首先单击载入图像菜单项(载入背景和前景图像),图像在image文件夹下面。2.然后单击车辆提取菜单项,依次进行图像做差、二值化、开运算、图像去噪、图像填充处理。3.再单击轮廓提取菜单项,提取车辆轮廓。4.最后单击车型识别菜单项,对车辆进行识别。
    2020-12-01下载
    积分:1
  • 微电网下垂控制
    微电网power sharing下垂控制MATLAB仿真,带虚拟电阻
    2021-05-06下载
    积分:1
  • PDF转WORD软件
    完全免费,解决PDF转WORD功能。
    2020-12-03下载
    积分:1
  • Concepts in Programming Languages.pdf
    Concepts in Programming Languages by John Mitchell.一本国外经典教材,看了之后对编程语言更加理解。费了很多劲才找到的。Concepts in Programming LanguagesThis textbook for undergraduate and beginning graduate students explains and examines the central concepts used in modern programminglanguages, such as functions, types, memory management, and controlThe book is unique in its comprehensive presentation and comparisonof major object-oriented programming languages. Separate chapters ex-amine the history of objects, Simula and Smalltalk, and the prominentanguages c++ and JavaThe author presents foundational topics, such as lambda calculus anddenotational semantics, in an easy-to-read, informal style, focusing on themain insights provided by these theories. Advanced topics include concurrency and concurrent object-oriented programming. A chapter on logicprogramming illustrates the importance of specialized programming meth-ods for certain kinds of problemsThis book will give the reader a better understanding of the issuesand trade-offs that arise in programming language design and a betterappreciation of the advantages and pitfalls of the programming languagesthey useJohn C. mitchell is Professor of Computer Science at Stanford University,where he has been a popular teacher for more than a decade. Many of hisformer students are successful in research and private industry. He received his ph D. from mit in 1984 and was a member of technical staff atat&T Bell Laboratories before joining the faculty at Stanford. Over thepast twenty years, Mitchell has been a featured speaker at internationalconferences; has led research projects on a variety of topics, includingprogramming language design and analysis, computer security, and applications of mathematical logic to computer science; and has written morethan 100 research articles. His previous textbook, Foundations for Pro-gramming Languages(MIT Press, 1996), covers lambda calculus, typesystems, logic for program verification, and mathematical semantics ofprogramming languages. Professor Mitchell was a member of the programming language subcommittee of the ACM/ieEE Curriculum 2001standardization effort and the 2002 Program Chair of the aCm principlesof programming languages conferenceCONCEPTS NPROGRAMMINGLANGUAGESJohn c. mitchellStanford UniversityCAMBRIDGEUNIVERSITY PRESSPUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGEThe Pitt Building, Trumpington Street, Cambridge, United KingdomCAMBRIDGE UNIVERSITY PRESSThe Edinburgh Building, Cambridge CB2 2RU, UK40 West 20th Street, New York, NY 10011-4211 USA477 Williamstown Road, Port Melbourne vic 3207, AustraliaRuiz de alarcon 13, 28014 Madrid, spainDock House, The Waterfront, Cape Town 8001, South Africahttp://www.cambridge.orgo Cambridge university press 2004First published in printed format 2002isBN 0-511-03492-X eBook(adobe readerISBN 0-521-78098-5 hardbackContentsPrefacepage IxPart 1 functions and foundations1 Introduction1.1 Programming Languages1.2 Goals1.3 Programming Language History3561.4 Organization: Concepts and Languages2 Computability2. 1 Partial Functions and computability102.2 Chapter SummaryExercises163 Lisp: Functions, Recursion, and Lists3.1 Lisp History183.2 Good Language design203. 3 Brief Language overview223.4 Innovations in the Design of Lisp253.5 Chapter Summary: Contributions of LispExercises404 Fundamentals484.1 Compilers and syntax484.2 Lambda calculus4.3 Denotational semantics4.4 Functional and Imperative Languages4.5 Chapter SummaryExercisesContentsPart 2 Procedures, Types, Memory Management, and Control5 The algol Family and ML5.1 The Algol Family of Programming Languages5.2 The Development of C5.3 The LCF System and ml5.4 The Ml Programming Language1035.5 Chapter summary121Exercises1226 Type Systems and Type Inference1296.1 Types in Programming1296.2 Type Safety and Type Checking1326.3 Type Inference1356.4 Polymorphism and Overloadin1456.5 Type Declarations and Type Equality1516.6 Chapter Summary155Exercises1567 Scope, Functions, and storage Management1627.1 Block-Structured Languages1627.2 In-Line blocks1657.3 Functions and procedures1707.4 Higher-Order functions1827.5 Chapter summary190Exercises1918 Control in Sequential Languages2048.1 Structured control2048.2 Exceptions2078.3 Continuations2188.4 Functions and evaluation order2238.5 Chapter summary227Exercises8Part 3 Modularity, Abstraction, and object-Oriented Programming9 Data Abstraction and Modularity2359.1 Structured Programming2359.2 Language Support for Abstraction2429.3 Modules9.4 Generic Abstractions2599.5 Chapter Summary269Exercises27110 Concepts in Object-Oriented Languages27710.1 Object-Oriented design27710.2 Four Basic concepts in object-Oriented languages278Contents10.3 Program Structure28810.4 Design Patterns29010.5 Chapter summary29210.6 Looking Forward: Simula, SmalltalkC++Java293Exercises29411 History of objects: Simula and smalltalk30011.1 Origin of Objects in Simula30011.2 Objects in Simula30311.3 Subclasses and Subtypes in Simula30811.4 Development of smalltalk31011.5 Smalltalk Language features31211.6 Smalltalk flexibilit31811.7 Relationship between Subtyping andInheritance2211.8 Chapter SummaryExercises32712 objects and Run-Time Efficiency: C++33712.1 Design goals and Constraints33712.2 Overview of c++34012.3 Classes. Inheritance and Virtual functions34612.4 Subtyping35512.5 Multiple inheritance12.6 Chapter summary366Exercises36713 Portability and Safety: Java38413.1 Java language overview38613.2 Java Classes and Inheritance38913.3 Java Types and Subtyping39613.4 Java System architecture40413.5 Security Features41213.6 Java summary417Exercises420Part 4 Concurrency and Logic Programming14 Concurrent and Distributed Programming43114.1 Basic Concepts in Concurrency43314.2 The actor model44114.3 Concurrent ML14.4 Java concurrency45414.5 Chapter Summary466Exercises469Contents15 The Logic Programming Paradigm and Prolog47515. 1 History of logic Programming15.2 Brief Overview of the logic Programming Paradigm4715. 3 Equations solved by Unification as Atomic Actions15.4 Clauses as Parts of procedure declarations48215.5 Prologs Approach to Programming48615.6 Arithmetic in Prolog49215.7 Control, Ambivalent Syntax, and Meta-Variables49615.8 Assessment of Prolog50515.9 Bibliographic remarks50715.10 Chapter Summary507Appendix a Additional Program Examples509A 1 Procedural and Object-Oriented organization509Glossary521Index525
    2020-12-09下载
    积分:1
  • carsim2017
    CarSim 2017破解版 v2017.1
    2021-05-06下载
    积分:1
  • 696518资源总数
  • 106235会员总数
  • 12今日下载