虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

ISI-CASE

  • 本文提出在数字移动通信中子带滤波器组处理可以提高不同阵元信号的相关性

    本文提出在数字移动通信中子带滤波器组处理可以提高不同阵元信号的相关性,从而能改善自适应阵列抑制码间干扰(ISI)和共信道干扰(CCI)的能力.在文[6]的基础上,本文研究了子带滤波器组在宽带自适应天线旁 瓣相消中的应用,对其原理进行了理论分析,提出了有效的子带处理方法.经研究表明,子带滤波器组处理能有效增加主、辅助天线信号的相关性,从而提高系统干扰相消比.而且适当的过采样能使系统干扰相消比进一步提高.计算机仿真结果和实测雷达数据处理结果证实了子带处理方法的有效性和理论分析的正确性.

    标签: 数字移动 信号 通信 滤波器

    上传时间: 2013-12-08

    上传用户:wang0123456789

  • Memory Management—Algorithms and implementation in C/C++ Introduction Chapter 1 - Memory Manag

    Memory Management—Algorithms and implementation in C/C++ Introduction Chapter 1 - Memory Management Mechanisms Chapter 2 - Memory Management Policies Chapter 3 - High-Level Services Chapter 4 - Manual Memory Management Chapter 5 - Automatic Memory Management Chapter 6 - Miscellaneous Topics Index List of Figures List of Tables List of Case Studies List of Sidebars

    标签: Memory implementation Introduction Management

    上传时间: 2013-12-25

    上传用户:541657925

  • 用pascal编一个年历具体要求是:设计电子月历的程序 一、任务内容(task) 1.设计的程序应具有以下功能: (1)任意输入某年的某一月份

    用pascal编一个年历具体要求是:设计电子月历的程序 一、任务内容(task) 1.设计的程序应具有以下功能: (1)任意输入某年的某一月份,屏幕应能显示该月的月历; (2)应允许多次从键盘输入某月份,并自行设置结束标志。 (3)如在屏幕上输入2007年12月份的信息,屏幕的显示形式如下: month Sun. Mon. Tue. Wed. Thu. Fri. Sat. 12 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 (4)备注:输出界面也可以是其它形式,另外还可对输出界面进行必要的修饰(如:加入表格线)。 2.程序设计要求: 1)采用结构化的程序设计方法进行编程; 2)用case控制语句实现选择分支结构; 3)用while \repeat…until\for语句实现循环结构; 4)利用标准过程readkey实现程序执行暂停; 5)利用标准过程 clrscr实现清屏操作。

    标签: pascal task 程序 电子

    上传时间: 2014-01-07

    上传用户:franktu

  • isual Chat 1.91 Developer Edition - Customize the Visual Chat code regarding your own requirement

    isual Chat 1.91 Developer Edition - Customize the Visual Chat code regarding your own requirements - Use customchatdev.html for developing / testing - Create .jar and .cab-files containing client-specific .class-files and the images-folder (use zip and cabarc compressing tools) - Adapt the customchat.html file - Upload all the files to your webserver - Start the ChatServer by invoking java at.ac.uni_linz.tk.vchat.ChatServer [port [server-key]] from your commandline - I kindly ask you to leave copyright and credit information in the InfoPanel.class as it is - but you are invited to add your own text. In case of violations I will consider excluding this class from the source in the future.

    标签: Chat requirement Developer Customize

    上传时间: 2017-01-27

    上传用户:iswlkje

  • 用java语言实现的四则运算

    用java语言实现的四则运算,采用的是case语句,选择运算符,作相应的运算

    标签: java 语言 四则运算

    上传时间: 2017-01-30

    上传用户:kiklkook

  • this procedure is simulated document management system disk space management, Disk Management, direc

    this procedure is simulated document management system disk space management, Disk Management, directory management (single-level directory) of a simulation program, as well as university computer courses on operating system design a case, we only reference

    标签: management Management procedure simulated

    上传时间: 2017-02-05

    上传用户:zhuoying119

  • 本程序仿真一个从卫星到区域数据中心的下行链路(由一组6个载波构成)

    本程序仿真一个从卫星到区域数据中心的下行链路(由一组6个载波构成),评估热噪声,交调(IM)失真、由滤波器造成的码间干扰(ISI)以及邻频干扰对下行链路性能的影响。

    标签: 程序 仿真 下行链路 卫星

    上传时间: 2017-02-08

    上传用户:zhenyushaw

  • Free open-source disk encryption software for Windows Vista/XP, Mac OS X, and Linux Main Features:

    Free open-source disk encryption software for Windows Vista/XP, Mac OS X, and Linux Main Features: * Creates a virtual encrypted disk within a file and mounts it as a real disk. * Encrypts an entire partition or storage device such as USB flash drive or hard drive. * Encrypts a partition or drive where Windows is installed (pre-boot authentication). * Encryption is automatic, real-time (on-the-fly) and transparent. * Provides two levels of plausible deniability, in case an adversary forces you to reveal the password: 1) Hidden volume (steganography) and hidden operating system. 2) No TrueCrypt volume can be identified (volumes cannot be distinguished from random data). * Encryption algorithms: AES-256, Serpent, and Twofish. Mode of operation: XTS. Further information regarding features of the software may be found in the:http://www.truecrypt.org/

    标签: open-source encryption Features software

    上传时间: 2013-12-20

    上传用户:123啊

  • This book uses the Python language to teach pro - gramming concepts and problem -solving skills,

    This book uses the Python language to teach pro - gramming concepts and problem -solving skills, without assuming any previous program- ming experience. With easy-to-understand examples, pseudocode, flowcharts, and other tools, the student learns how to design the logic of programs and then implement those programs using Python. This book is ideal for an introductory programming course or a programming logic and design course using Python as the language. As with all the boolts in the Starting Out With series, the hallmark of this text is its clear, friendly, and easy -to-understand writing. In addition, it is rich in example programs that are concise and practical. The programs in this book include short examples that highlight specific programming topics, as well as more involved examples that focus on problem solving. Each chapter provides one or more case studies that provide step -by-step analysis of a specific problem and shows the student how to solve it.

    标签: language gramming concepts problem

    上传时间: 2014-01-12

    上传用户:独孤求源

  • Instead of finding the longest common subsequence, let us try to determine the length of the LCS.

    Instead of finding the longest common subsequence, let us try to determine the length of the LCS. 􀂄 Then tracking back to find the LCS. 􀂄 Consider a1a2…am and b1b2…bn. 􀂄 Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. 􀂄 Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn 􀂄 Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. 􀂄 Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.

    标签: the subsequence determine Instead

    上传时间: 2013-12-17

    上传用户:evil