代码搜索:sequence
找到约 10,000 项符合「sequence」的源代码
代码结果 10,000
www.eeworm.com/read/345936/11779552
h stl_queue.h
/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
www.eeworm.com/read/156653/11786461
m hsolpsav.m
function [y] = hsolpsav(x,h,N)
% High-speed Overlap-Save method of block convolutions using FFT
% --------------------------------------------------------------
% [y] = hsolpsav(x,h,N)
% y = output s
www.eeworm.com/read/345596/11804291
lst isr.lst
C51 COMPILER V7.06 ISR 01/08/2006 12:36:01 PAGE 1
C51 COMPILER V7.06, COMPILATION OF MODULE ISR
OBJECT MODULE PLACED IN ISR
www.eeworm.com/read/154760/11928352
m circonvt.m
function y = circonvt(x1,x2,N)
% N-point circular convlution between x1 and x2 ; (time-domain)
% -----------------------------------------------------------------
% [y] = circonvt(x1,x2,N)
% y = o
www.eeworm.com/read/154760/11929314
m circevod.m
function [xec,xoc] = circevod(x)
% signal decomposition into circular-even and circular-odd parts
% ---------------------------------------------------------------
% [xec,xoc] = circevod(x)
%
if
www.eeworm.com/read/343227/11962828
m hmm_gen.m
function [X, s] = hmm_gen (A, pi0, mu, Sigma, T)
%hmm_gen Generates a sequence of observation given a HMM
% with gaussian state-conditional densities.
% Use : [X,s] = hmm_gen(A,pi0,mu,Sigma,T|s)
www.eeworm.com/read/154202/11983982
asm rfft32br.asm
;========================================================================
;
; File Name : rfft_brc.asm
;
; Originator : Advanced Embeeded Control
; Texas Instruments
;
www.eeworm.com/read/256569/11987159
m get_gold.m
function [gold_seq]=get_gold(connections1,connections2)
sequence1=ss_mlsrs(connections1);
sequence2=ss_mlsrs(connections2);
% cyclically shift the second sequence and add it to the first one
L=2^l
www.eeworm.com/read/342845/11996117
m hsolpsav.m
function [y] = hsolpsav(x,h,N)
% High-speed Overlap-Save method of block convolutions using FFT
% --------------------------------------------------------------
% [y] = hsolpsav(x,h,N)
% y = outp
www.eeworm.com/read/153052/12063332
m sigmult.m
%序列乘
function [y,n] = sigmult(x1,n1,x2,n2)
%完成y(n)=x1(n)*x2(n),其中,n1,n2表示序列的域,n1可以不等于n2;x1表示第一个序列;x2表示第二个序列。
% [y,n] = sigmult(x1,n1,x2,n2)
% y = product sequence over n, which includes n1 and n2