代码搜索结果

char_autoincr (b1, c) short *b1; short c; { *b1 = c; }

n(520,395,'view/2.jpg')"> 2号楼北座

document.writeln(""); document.writeln(""); document.writeln("function oK_KaiShi(){"); document.writeln("var Then = new Dat

@N:"E:\QProj\AdderE syn\AdderE.vhd":2:7:2:12|Synthesizing work.addere.syn @N:"E:\QProj\AdderE syn\Full_Adder.vhd":2:7:2:16|Synthesizing work.full_adder.syn Post processing for work.full_adder.syn

/* * Copyright (c) 1999 Kungliga Tekniska H鰃skolan * (Royal Institute of Technology, Stockholm, Sweden). * All rights reserved. * * Redistribution and use in source and binary forms, with or wi

n=1000; x = randint(n,1); %产生信源. h = modem.pskmod (4); %产生调制句柄 y = modulate(h,x); %对信号进行调制 g = modem.pskdemod (h) %产生解调句柄 z = demodulate(g,y); %进行解调

<mark>N</mark> = 128; %抽头数 Dle<mark>n</mark> = 1024; %输出长度 Step = 0.005; %步长 %注意：需要给出输入data和参考信号s(<mark>n</mark>)才能运行本程序 w=zeros(<mark>N</mark>,1); %<mark>N</mark>为抽头个数 p=(1/delta)*eye(<mark>N</mark>); %delta为正则化参数 for <mark>n</mark>= <mark>N</mark>:Dle<mark>n</mark> u(1:<mark>N</mark>)=data(<mark>n</mark>:-1:<mark>n</mark> ...

n = 128; %哈达码矩阵的阶数 n1 = log2(n); W = zeros(n,n); W(1,1) = 1; for t = 1 : n1 %产生哈达码矩阵 for i = 1 : n for j = 1 : n if (i

n = 7; %码长 k = 4; %信息位长 A = [ 1 1 1;1 1 0;1 0 1;0 1 1 ]; G = [ eye(k) A ]; %生成矩阵 H = [ A' eye(n-k) ]; %校验矩阵 %编码 msg = [ 1 1 1 1 ]; %信息比特 code = mod(ms

/* * File: queen.c * Description: 求 N 皇后问题回溯算法 * Created: 2001/11/12 * Author: Justin Hou [mailto:justin_hou@hotmail.com] */ #include #define DelayTime 20000 /* 显示棋