Description: function [X,fval,exitflag,output,lambda]=quadprog(H,f,A,B,Aeq,Beq,lb,ub,X0,options,varargin)
％ X=QUADPROG(H,f,A,b) 求解二次规划:
％ min 0.5*x *H*x + f *x subject to: A*x <= b
％x=quadprog(H,f, A, b, Aeq, beq)求解二次规划：-function [X, fval, exitflag, output, lambda] = quadprog (H, f, A, B, Aeq, Beq, lb, ub, X0, options, varargin)% X = QUADPROG (H, f, A, b) solving quadratic programming : min 0.5% * H * x * x * x f subject to : A * x Platform: |
Size: 4887 |
Author:王志波 |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ... Platform: |
Size: 5507 |
Author:丁如敏 |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ... Platform: |
Size: 10381 |
Author:丁如敏 |
Hits:
Description: 产生一个函数的128个q15数据并把它写在一个x.h的文件里面供dsp读取用-have a function in 128 q15 data and write it on a paper inside the x.h for dsp Reading access Platform: |
Size: 930 |
Author:44 |
Hits:
Description: function [X,fval,exitflag,output,lambda]=quadprog(H,f,A,B,Aeq,Beq,lb,ub,X0,options,varargin)
％ X=QUADPROG(H,f,A,b) 求解二次规划:
％ min 0.5*x *H*x + f *x subject to: A*x <= b
％x=quadprog(H,f, A, b, Aeq, beq)求解二次规划：-function [X, fval, exitflag, output, lambda] = quadprog (H, f, A, B, Aeq, Beq, lb, ub, X0, options, varargin)% X = QUADPROG (H, f, A, b) solving quadratic programming : min 0.5%* H* x* x* x f subject to : A* x Platform: |
Size: 5120 |
Author:王志波 |
Hits:
Description: MPEG4IP提供一个端对端的系统来实现音视频流的传输，支持包括MPEG4/H.261/MPEG2/H.263 MP3/AAC/AMR等不同编码格式。可以应用于linux，windows，Mac OS X平台下。-MPEG4IP provide an end-to-end system to achieve the Music Video transmission, support includes such non MPEG4/H.261/MPEG2/H.263 MP3/AAC/AMR with the coding format. Can be used linux, windows, Mac OS X platform. Platform: |
Size: 4826112 |
Author:ldh |
Hits:
Description: SQLite 3.x的一个C++封装类。基于MFC。SQLite是一种高效的嵌入式数据库。-SQLite 3.x a Class C Packaging. Based on the MFC. SQLite is a high-performance embedded database. Platform: |
Size: 643072 |
Author:辛亚平 |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ... Platform: |
Size: 5120 |
Author:丁如敏 |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ... Platform: |
Size: 10240 |
Author:丁如敏 |
Hits:
Description: H。264中文文档，是关于可伸缩视频编码的。中文版。-H. 264 Chinese documents, is on scalable video coding. Chinese version. Platform: |
Size: 3742720 |
Author:liuyu |
Hits:
Description: 一款可以在verilog和VHDL之间互换的工具，经测试，暂无bug-A verilog and VHDL can be exchanged between the tools, tested, no bug Platform: |
Size: 3962880 |
Author:邵文熙 |
Hits:
Description: LDPC-PEG算法构造H矩阵源码程序，matlab源码程序 clear all;
clc;
%输入编码参数,m:校验节点数目，n:变量节点数目(注意码率R不一定为1/2)
%构造任意码率的LDPC校验矩阵
m=input('The number of check nodes:');
n=input('The number of variable nodes:');
h=zeros(m,n);
%给定变量节点度分布序列 dv=0.38354*x+0.04237*x^2+0.57409*x^3
%为了得到更好的性能，此处的度分布序列采用密度进化理论选取
dv=inline('0.38354*x+0.04237*x.^2+0.57409*x.^3','x');
%计算每个度分布的节点数
indv=quadl(dv,0,1);
a2=round(n*(0.38354/2/indv));
a3=round(n*(0.04273/3/indv));
ds(1:a2)=2;
ds(a2+1:a3+a2)=3;(LDPC-PEG algorithm constructs H matrix source code program, matlab source code program clear all;
CLC;
% Input coding parameters, m: number of check nodes, n: number of variable nodes (note that bit rate R is not necessarily 1/2)
% Constructing LDPC Check Matrix with Arbitrary Bit Rate
M = input ('The number of check nodes:');
N = input ('The number of variable nodes:');
H = zeros (m, n);
% Given variable nodal degree distribution sequence DV = 0.38354*x+0.04237*x^2+0.57409*x^3
% In order to get better performance, the density evolution theory is used to select the degree distribution sequence.
DV = inline ('0.38354 * x + 0.04237 * X. ^ 2 + 0.57409 * X. ^ 3','x');
% Calculate the number of nodes per degree distribution
INDV = quadl (dv, 0, 1);
A2 = round (n* (0.38354/2/indv));
A3 = round (n* (0.04273/3/indv);
DS (1:a2) =2;
DS (a2 + 1: A3 + a2) = 3;) Platform: |
Size: 1024 |
Author:MATLAB编程 |
Hits:
Search - X-H