资源列表

« 1 2 ... .35 .36 .37 .38 .39 1240.41 .42 .43 .44 .45 ... 28522 »

[matlab例程powerspectrum

说明:使用小波包变换分析两个信号的特征向量和各频率成分的功率谱-the analysis of two signals eigenvector and power spectrum using wavelet-packet transform
<刘戈> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程hamming

说明:Hamming code in matlab.
<Weronika> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程adc2correct

说明:make a transversal channel take a three tap chanel [1,1/4 1/2] and data generate by BPSK(1 or -1)-make a transversal channel take a three tap chanel [1,1/4 1/2] and data generate by BPSK(1 or-1)
<yasir> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程adc3

说明:take a input vector which is no of users of b[kx1] and code vector which will be a matrix now s=[Nxk],where then give to matched filter,non-correlating detector, by randomised sequence.-take a input vector whic
<yasir> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程adc4

说明:with channel, take a input vector which is no of users of b[kx1] and then give to matched filter,non-correlating detector, and non-adaptive mmse,see the results by hadamard by randomised sequence.
<yasir> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程adc5

说明:compare both MF-MMSE and LMS by giving input the randomised
<yasir> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程rls$lms

说明:rls and kalman comparison with giving input and with a channel
<yasir> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[数学计算/工程计算Gauss

说明:In linear algebra, Gaussian elimination is an algorithm for solving systems of linear equations, finding the rank of a matrix, and calculating the inverse of an invertible square matrix. Gaussian elimination is named aft
<dima> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程FM_Mod_Demod

说明:FM modulator Code Matlab
<lynxz3> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[matlab例程mseq

说明:此函数用来生成最大长度线性移位寄存器序列 connections为特征多项式向量,registers为初始值向量 len为所需序列长度,若为0则输出一个周期-the function to engenerate m sequence
<Andy> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[数据结构常用算法CLOSESTPAIR

说明:最近点对问题,求解平面上n个点的集合中距离最近的两点的距离。-Nearest point of the problem, solving the plane the set of n points in the distance between the nearest two points.
<hyqin> 在 2025-01-23 上传 | 大小:1kb | 下载:0

[数据结构常用算法knapsack

说明:背包问题,每类物品个数不限,使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
<hyqin> 在 2025-01-23 上传 | 大小:1kb | 下载:0
« 1 2 ... .35 .36 .37 .38 .39 1240.41 .42 .43 .44 .45 ... 28522 »

源码中国 www.ymcn.org