代码搜索：sequence
找到约 10,000 项符合「sequence」的源代码
代码结果 10,000
www.eeworm.com/read/493206/6398522
m hmm_evaluation.m
function P = HMM_evaluation(a, b, V)
% Find the probability of a finite state in a Markov chain
%
% Inputs:
% a - Transition probability matrix
% b - Output generator matrix
% V -
www.eeworm.com/read/488270/6491142
m p1_1.m
% Program P1_1
% Generation of a Unit Sample Sequence
clf;
% Generate a vector from -10 to 20
n = -10:20;
% Generate the unit sample sequence
u = [zeros(1,10) 1 zeros(1,20)];
% Plot the unit s
www.eeworm.com/read/410924/11264910
m hmm_evaluation.m
function P = HMM_evaluation(a, b, V)
% Find the probability of a finite state in a Markov chain
%
% Inputs:
% a - Transition probability matrix
% b - Output generator matrix
% V -
www.eeworm.com/read/405069/11472218
m hmm_evaluation.m
function P = HMM_evaluation(a, b, V)
% Find the probability of a finite state in a Markov chain
%
% Inputs:
% a - Transition probability matrix
% b - Output generator matrix
% V -
www.eeworm.com/read/258131/11882847
m pngenerator.m
function sequence = PnGenerator( sequence_length, g )
% PnGenerator creates a PN sequence using polynomial g
%
% The calling syntax is:
% sequence = PnGenerator( sequence_length, g )
%
%
www.eeworm.com/read/151090/12235778
m goldseq.m
% Program CDMA-5
%
% goldseq.m
%
% The generation function of Gold sequence
%
function [gout] = goldseq(m1,m2,n)
% --------------------------------------------------------
% m1 : M-se
www.eeworm.com/read/131588/14136287
m hmm_evaluation.m
function P = HMM_evaluation(a, b, V)
% Find the probability of a finite state in a Markov chain
%
% Inputs:
% a - Transition probability matrix
% b - Output generator matrix
% V -
www.eeworm.com/read/129915/14217699
m hmm_evaluation.m
function P = HMM_evaluation(a, b, V)
% Find the probability of a finite state in a Markov chain
%
% Inputs:
% a - Transition probability matrix
% b - Output generator matrix
% V -
www.eeworm.com/read/226667/14455760
m mseq.m
function seq = mseq(N)
% usage: seq = mseq(N)
% where: seq = m-sequence of length 2^N -1
% N = order of the m-sequence (max of 14)
% Generates a (+1,-1) maximal-length PN sequence of orde
www.eeworm.com/read/223481/14639253
m pngenerator.m
function sequence = PnGenerator( sequence_length, g )
% PnGenerator creates a PN sequence using polynomial g
%
% The calling syntax is:
% sequence = PnGenerator( sequence_length, g )
%
%