代码搜索：Decimation
找到约 613 项符合「Decimation」的源代码
代码结果 613
www.eeworm.com/read/273787/10901143
m bfre4.m
% Y = bfre4(A,B,M,N,L,l)
% BFRE -- Branch Frequency Response Evaluation(4_Channel)
% A's columns are h0,h1,h2,h3; B's columns are g0,g1,g2,g3
% M, N are decimation and interpolation factors respec
www.eeworm.com/read/273787/10901253
m polyp1.m
% A = polyp1(x,M)
% Find the type-I polyphase components of signal x.
% x is a column vector. The decimation factor is M.
% The result will be put in the columns of matrix A.
% Also see POLYP2
www.eeworm.com/read/141297/5773208
t gr_freq_xlating_fir_filter_xxx.h.t
/* -*- c++ -*- */
/*
* Copyright 2002,2004 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* GNU Radio is free software; you can redistribute it and/or modify
* it under th
www.eeworm.com/read/141297/5773217
t gr_fir_filter_xxx.h.t
/* -*- c++ -*- */
/*
* Copyright 2004 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* GNU Radio is free software; you can redistribute it and/or modify
* it under the ter
www.eeworm.com/read/264746/11303013
m interpolation.m
function interpolation
%program performs multi-stages interpolation on data in a user-specified data file
clear all;
r = [2 1 1]; % decimation factor array for different stages
l =
www.eeworm.com/read/348198/11606850
c decint.c
/* SigLib - Decimation And Interpolation Example */
#include
#include
#include "GraphFunctions.h"
/* Define constants */
#define SAMPLE_LENGTH ((SLArrayIndex_t)512)
#define DE
www.eeworm.com/read/155163/11892925
c fft.c
/* fft.c -- in-place decimation-in-time FFT */
#include
void shuffle(), dftmerge();
void fft(N, X)
complex *X;
int N;
{
shuffle(N, X);
dftmerge(N, X);
}
www.eeworm.com/read/216722/14995559
m kasami.m
% Kasami codes
%option indicates sequence format
function[codes] = kasami(option)
blarge = 1;
m=8; % m has to be even
N = 2^m -1;
code3 = zeros(1, N); %2 codes for xor with circular shi
www.eeworm.com/read/206291/15297011
c fft.c
/* fft.c -- in-place decimation-in-time FFT */
#include
void shuffle(), dftmerge();
void fft(N, X)
complex *X;
int N;
{
shuffle(N, X);
dftmerge(N, X);
}
www.eeworm.com/read/249021/12526666
h apus_apnode.h
#ifndef APUS_H
#define APUS_H
/*********************************************************************
Filename: APUS.h
Revised: $Date: 2006-07-03 16:50:57 -0700 (Mon, 03 Jul