代码搜索：Fast

找到约 10,000 项符合「Fast」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/112765/15477474

c fft.c

/* * fft.c * * Version 2.6 by Steve Sampson, Public Domain, November 1988 * * This program produces a Frequency Domain display from the Time Domain * data input; using the Fast Fourier Transform
·
www.eeworm.com/read/112297/15489879

h rtl8139.h

/* This file contain the register map of RTL8139 and what the bits of the register stand for. The data is copied form data sheet of "Realtek Single Chip Fast Ethernet Controller" ,date 199
·
www.eeworm.com/read/111083/15519099

html fft.html

Data Structures and Algorithms: Fast Fourier Transforms
·
www.eeworm.com/read/108548/15584353

c fft.c

/* * fft.c * * Version 2.6 by Steve Sampson, Public Domain, November 1988 * * This program produces a Frequency Domain display from the Time Domain * data input; using the Fast Fourier Tra
·
www.eeworm.com/read/108548/15584357

c ufft.c

/* * fft.c * * Unix Version 2.4 by Steve Sampson, Public Domain, September 1988 * * This program produces a Frequency Domain display from the Time Domain * data input; using the Fast Fouri
·
www.eeworm.com/read/105552/15665216

c fft.c

/* * fft.c * * Version 2.6 by Steve Sampson, Public Domain, November 1988 * * This program produces a Frequency Domain display from the Time Domain * data input; using the Fast Fourier Transform
·
www.eeworm.com/read/102302/15787079

h 21kflags.h

/* * Defines the status registers of the 210x0 as bitfields. * This is most usefull for code which doesn't need to be fast. */ register union { struct { unsigned :15; unsigned rn
·
www.eeworm.com/read/101996/15795512

cpp idct.cpp

#include "StdAfx.h" /* idct.c, inverse fast discrete cosine transform */ /* Copyright (C) 1996, MPEG Software Simulation Group. All Rights Reserved. */ /* * Disclaim
·
www.eeworm.com/read/100612/15868945

cpp mueller.cpp

// // Program to generate Modular Polynomials, as required for fast // implementations of the Schoof-Elkies-Atkins algorithm // for counting points on an elliptic curve Y^2=X^3 + A.X + B mod p //
·
www.eeworm.com/read/100612/15868964

c mrfast.c

/* * MIRACL fast fourier multiplication routine, using 3 prime method. * mrfast.c - only faster for very high precision multiplication * of numbers > about 4096 bits (see bel
·