Anky_Glass25cube_website

电子技术基础 模拟部分（第四版）康光华 本书是电子版，方便大家下载学习(Basic analog electronics part (fourth edition) Kang Guanghua electronic book is to facilitate you to download study)

为了提高通信系统的信息传输速率，人们提出了UWB通信系统，即Ultra-Wideband 通信系统。在UWB系统中，信号的带宽一般都在GHz的量级，这么宽的带宽造成了UWB系统和现有的通信系统频谱的重叠。为了降低对现有通信系统的影响，UWB信号的设计需要满足一定的频谱模板。如果一个信号的频谱基本满足频谱模板的规定（即在绝大部分频段内功率小于规定区间的上限），我们可以认定其为一个UWB信号。(In order to improve communication systems, information transmission rate of UWB communications systems have been proposed, namely, Ultra-Wideband communication systems. In the UWB system, the signal bandwidth will generally be in the order of GHz, caused such a wide bandwidth of UWB system and the existing communications system spectrum overlap. In order to reduce the impact of the existing communication systems, UWB signal design needs to meet certain spectral mask. If a signal spectrum can basically meet the spectral mask (that is, in most of the provisions of band power is less than the maximum range), we can assume it as a UWB signal.)

a MATLAB GUI platform for determination and evaluation of biologically significant motifs

The source code for analysis of 3d edge cracks using extended Isogeometric method.

本仿真是基于matlab的capon波束形成，包含3个仿真(The simulation is based on Matlab capon beamforming, contains three simulation)

matlab implementation of wimax downlink

对于混沌系统进行李雅普诺夫指数计算以及其指数谱仿真(chaos system lyapunov)

sar图像滤波（kuan lee）sar图像滤波（kuan lee）(sar image filtering (kuan lee) sar image filtering (kuan lee))

线性方程迭代解法的matlab程序，可作为数值分析等的学习工具。(Iterative method for solving linear equations matlab program, can be used as numerical analysis , and other learning tools.)

k-d树的matlab程序，包含了KDTREE, KDTREEIDX and KDRANGEQUERY functions。提供了两个Demo scripts(kdtree_demo.m & kdrange_demo.m),很实用( This distribution contains the KDTREE, KDTREEIDX and KDRANGEQUERY functions. Included are the source code files in kdtree/src, as well as precompiled mex files for the following systems: - Mac OS X (Matlab 6.5) - Redhat Linux (Matlab 6.5) - Windows (Matlab 6.1) Two demo scripts are provided (kdtree_demo.m & kdrange_demo.m). The new features added June 2004: + You can now use N dimensional data points, where N>3. + Use KDTREEIND to return the index value to the closest point, instead of the closest point values. + KDRANGEQUERY can now return these index values as well. Written by/send comments or suggestions to : Guy Shechter guy at jhu dot edu June 2004 )