代码搜索:convolution

找到约 1,402 项符合「convolution」的源代码

代码结果 1,402
www.eeworm.com/read/162603/10292192

m pgain.m

% MATLAB SIMULATION OF NSA FS-1016 CELP v3.2 % COPYRIGHT (C) 1995-99 ANDREAS SPANIAS AND TED PAINTER % % This Copyright applies only to this particular MATLAB implementation % of the FS-1016 CELP
www.eeworm.com/read/424063/10502182

m gfconv.m

function c = gfconv(a, b, p) %GFCONV GF(P) polynomial convolution or GF(P^M) element multiplication. % C = GFCONV(A, B) computes the convolution between two GF(2) % polynomials A and B.
www.eeworm.com/read/468647/6986190

m idwt2.m

function w = Idwt(x,h,L); % % Input: % x : data (square matrix) % h : lowpass filter % L : number of levels (2^L must divide the size of x) % if omitted, max possible level is used. % Out
www.eeworm.com/read/457960/7314912

c circular.c

#include #include int m,n,x[30],h[30],y[30],i,j,temp[30],k,x2[30],a[30]; void main() { printf(" enter the length of the first sequence\n"); scanf("%d",&m); print
www.eeworm.com/read/299178/7881123

m conv.m

function c = conv(a, b) %CONV Convolution and polynomial multiplication. % C = CONV(A, B) convolves vectors A and B. The resulting % vector is length LENGTH(A)+LENGTH(B)-1. % If A and B are
www.eeworm.com/read/331444/12827833

m corrdn.m

% RES = corrDn(IM, FILT, EDGES, STEP, START, STOP) % % Compute correlation of matrices IM with FILT, followed by % downsampling. These arguments should be 1D or 2D matrices, and IM % must be larger (
www.eeworm.com/read/323831/13314144

h temporalconvolution.h

// Copyright (C) 2003 Ronan Collobert (collober@idiap.ch) // // This file is part of Torch 3. // // All rights reserved. // // Redistribution and use in source and binary forms,
www.eeworm.com/read/322425/13380486

m corrdn.m

% RES = corrDn(IM, FILT, EDGES, STEP, START, STOP) % % Compute correlation of matrices IM with FILT, followed by % downsampling. These arguments should be 1D or 2D matrices, and IM % must be larg
www.eeworm.com/read/313956/13578194

m gfconv.m

function c = gfconv(a, b, p) %GFCONV GF(P) polynomial convolution or GF(P^M) element multiplication. % C = GFCONV(A, B) computes the convolution between two GF(2) % polynomials A and B.
www.eeworm.com/read/483783/6595055

tex channel coding(simulation and conclusion).tex

\documentclass[10pt,a4paper]{article} \usepackage{amsmath, mathrsfs} \usepackage{amssymb, graphicx, epsfig, subfigure} \title{\textbf{Channel coding}} \author{Jinkyu Kang} \date{2008.01.20}