代码搜索：协方差矩阵
找到约 10,000 项符合「协方差矩阵」的源代码
代码结果 10,000
www.eeworm.com/read/483026/6607730
m rey.m
function H=rey(Nt,Nr)%瑞利衰减信道矩阵模型，Nt为放射天线个数，Nr为接收天线个数
H=zeros(Nr,Nt);
R=eye(Nr*Nt);
X=randn(Nr*Nt,1)/sqrt(2)+j*randn(Nr*Nt,1)/sqrt(2);
H=resh
www.eeworm.com/read/483034/6607925
asv rey.asv
function h=rey(Nt,Nr)%瑞利衰减信道矩阵模型，Nt为发射天线个数，Nr为接收天线个数
h=zeros(Nr,Nt);
R=eye(Nr*Nt);
X=randn(Nr*Nt,1)/sqrt(2)+j*randn(Nr*Nt,1)/sqrt(2);
h=resh
www.eeworm.com/read/483034/6607926
m rey.m
function h=rey(Nt,Nr)%瑞利衰减信道矩阵模型，Nt为发射天线个数，Nr为接收天线个数
h=zeros(Nr,Nt);
R=eye(Nr*Nt);
X=randn(Nr*Nt,1)/sqrt(2)+j*randn(Nr*Nt,1)/sqrt(2);
h=resh
www.eeworm.com/read/483034/6607931
m rey.m
function H=rey(Nt,Nr)%瑞利衰减信道矩阵模型，Nt为放射天线个数，Nr为接收天线个数
H=zeros(Nr,Nt);
R=eye(Nr*Nt);
X=randn(Nr*Nt,1)/sqrt(2)+j*randn(Nr*Nt,1)/sqrt(2);
H=resh
www.eeworm.com/read/482469/6625110
m rey.m
function H=rey(Nt,Nr)%瑞利衰减信道矩阵模型，Nt为放射天线个数，Nr为接收天线个数
H=zeros(Nr,Nt);
R=eye(Nr*Nt);
X=randn(Nr*Nt,1)/sqrt(2)+j*randn(Nr*Nt,1)/sqrt(2);
H=resh
www.eeworm.com/read/263113/11375254
m quling.m
function y=quling(a) % 该程序把矩阵中全为0的行和列删掉
[m,n]=size(a);
jihao1=[];
jihao2=[];
for k=n:-1:1
if a(:,k)==0
jihao2=[jihao2,k];
else
break;
end
end
for k=m:-1:1
www.eeworm.com/read/400885/11567320
m dmdecode.m
function x = DMdecode(y, a)
%函数DMdecode为解码程序，y为要解码的预测误差矩阵，a为预测系数，当a默认时，a = 1。
error(nargchk(1, 2, nargin));
if nargin < 2
a = 1;
end
[m, n] = size(y);
x = zeros(m, n + 1);
for j = 1: n
www.eeworm.com/read/400885/11567327
m jpegdecode.m
function x = jpegdecode(y)
%jpegdecode函数，jpegencode的解码程序
error(nargchk(1, 1, nargin)); %检查输入参数
m = [16 11 10 16 24 40 51 61 %JPEG量化步长矩阵
12 12 14 19 26 58 60 55
14 13 16 24 40
www.eeworm.com/read/347816/11634772
cpp simplex.cpp
#include
#include
using namespace std;
#define M 100000
//全局变量
float **kernel;//核心矩阵表
int m=0,n=0,t=0;//m:结构向量的个数
//n:约束不等式个数
//t:目标函数类型：－1代表
www.eeworm.com/read/157936/11654678
cpp graph.cpp
#include "StdAfx.h"
#include "Graph.h"
//图的邻接矩阵表示,任意两个顶点最短路径算法
#include "assert.h"
#include "queue.h"
#include "Sqlist.h"
//#include "MinSpanTree.h"
extern CSqlist VerticesList; //顶点表