代码搜索：constructing
找到约 784 项符合「constructing」的源代码
代码结果 784
www.eeworm.com/read/470720/1446786
c cvt6.c
// Build don't link:
// GROUPS passed conversions
// cvt file
// Message-Id:
// From: bilmes@media.mit.edu
// Subject: gcc (g++) 2.2.2 constructing nested c
www.eeworm.com/read/470693/1458732
c cvt6.c
// Build don't link:
// GROUPS passed conversions
// cvt file
// Message-Id:
// From: bilmes@media.mit.edu
// Subject: gcc (g++) 2.2.2 constructing nested c
www.eeworm.com/read/190666/5174577
c cvt6.c
// Build don't link:
// GROUPS passed conversions
// cvt file
// Message-Id:
// From: bilmes@media.mit.edu
// Subject: gcc (g++) 2.2.2 constructing nested c
www.eeworm.com/read/340665/3275233
c cvt6.c
// Build don't link:
// GROUPS passed conversions
// cvt file
// Message-Id:
// From: bilmes@media.mit.edu
// Subject: gcc (g++) 2.2.2 constructing nested c
www.eeworm.com/read/440906/1776865
c cvt6.c
// Build don't link:
// GROUPS passed conversions
// cvt file
// Message-Id:
// From: bilmes@media.mit.edu
// Subject: gcc (g++) 2.2.2 constructing nested c
www.eeworm.com/read/430037/1942712
m bmsq.m
%constructing binary m-sequence, memory given;
function d=bmsq(n); %input variable is memory;
f=gfprimdf(n,2); N=2^n-1; %primitive polynomial and length of sequence;
d=[1 zeros(1,N-1)]; %initializa
www.eeworm.com/read/430037/1942720
m bmsq.m
%constructing binary m-sequence, memory given;
function d=bmsq(n); %input variable is memory;
f=gfprimdf(n,2); N=2^n-1; %primitive polynomial and length of sequence;
d=[1 zeros(1,N-1)]; %initializa
www.eeworm.com/read/430037/1942729
m bmsq.m
%constructing binary m-sequence, memory given;
function d=bmsq(n); %input variable is memory;
f=gfprimdf(n,2); N=2^n-1; %primitive polynomial and length of sequence;
d=[1 zeros(1,N-1)]; %initializa
www.eeworm.com/read/430037/1942736
m bmsq.m
%constructing binary m-sequence, memory given;
function d=bmsq(n); %input variable is memory;
f=gfprimdf(n,2); N=2^n-1; %primitive polynomial and length of sequence;
d=[1 zeros(1,N-1)]; %initializa
www.eeworm.com/read/430037/1942752
m bmsq.m
%constructing binary m-sequence, memory given;
function d=bmsq(n); %input variable is memory;
f=gfprimdf(n,2); N=2^n-1; %primitive polynomial and length of sequence;
d=[1 zeros(1,N-1)]; %initializa