登录
首页 » matlab » BLIND-IDENTIFICATION-OF-LINEAR-CHANNELS-USING-THE

BLIND-IDENTIFICATION-OF-LINEAR-CHANNELS-USING-THE

于 2014-02-20 发布 文件大小:323KB
0 193
下载积分: 1 下载次数: 2

代码说明:

  BLIND IDENTIFICATION OF LINEAR CHANNELS USING THE DATA CONSTELLATION

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

发表评论

0 个回复

  • threetimestruelspline
    基于三次自然样条的算法实现,实现曲线的拟合,效果很好。(three times natruel spline)
    2010-06-11 23:21:41下载
    积分:1
  • IA
    说明:  通过免疫算法解决旅行商问题,在matlab下实现(Through the immune algorithm to solve traveling salesman problem, in under matlab)
    2008-04-28 20:43:13下载
    积分:1
  • new-high-order-butterworth-
    说明:  针对传统Butterworth低通滤波器存在检测精度、稳定性和响应时间之间的矛盾问题,提出了一种新型高阶 Butterworth低通滤波器 (Butterworth low-pass filter for the existence of traditional detection accuracy, stability, and contradictions between the response time, a new high order Butterworth low-pass filter)
    2011-03-09 21:35:28下载
    积分:1
  • ditfft&dft
    说明:  用MATLAB语言编写的基2 DIT FFT子程序& 用简单的速度很低的方法计算DFT(using MATLAB prepared by the two-DIT FFT routines)
    2006-03-12 11:05:55下载
    积分:1
  • 4--interpolation-routines
    数值计算-插值【matlab例程】经典算法直接应用方便快捷(Numerical calculation- interpolation routines] [classical algorithm matlab convenient direct application)
    2014-01-20 13:37:33下载
    积分:1
  • 使用matlab语言实现的时域有限差分算法-fdtd
    说明:  使用matlab语言实现的时域有限差分算法(finite differentiate time domain)
    2020-06-21 20:40:02下载
    积分:1
  • DMC_simulink
    simulink模块实现的DMC仿真程序(simulink realization of the DMC simulation program module)
    2020-09-09 17:38:01下载
    积分:1
  • seghough
    K均值聚类法基于lab颜色空间分割图像,并用霍夫变换检测圆(K means clustering method is based on lab color space segmentation image and Hough transform to detect circles with)
    2011-04-23 15:29:36下载
    积分:1
  • LDPC MATLAB工具箱ldpc_toolkit_1_1
    LDPC MATLAB工具箱,提供LDPC编解码程序(LDPC MATLAB Toolbox provides procedures LDPC Codec)
    2021-04-21 16:18:49下载
    积分:1
  • M
    说明:  字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
    2013-11-29 14:28:52下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载