搜索结果
找到约 6 项符合
benchmarks 的查询结果
单片机开发 The DHRY program performs the dhrystone benchmarks on the 8051. Dhrystone is a general-performanc
The DHRY program performs the dhrystone benchmarks on the 8051.
Dhrystone is a general-performance benchmark test originally
developed by Reinhold Weicker in 1984. This benchmark is
used to measure and compare the performance of different
computers or, in this case, the efficiency of the code
gener ...
技术书籍 嵌入式系统编程的电子书
·详细说明：一些嵌入式系统编程的电子书，包括嵌入式的C编程，TI的RTOS以及LINUX文件列表: DSPBIOS 5.30 Textual Configuration.pdf DSPBIOS Driver.pdf DSPBIOS Timing Benchmarks for.pdf dspRTOS.pdf&nbs
加密解密 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an
加密算法
Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives:
- To generate an RSA key
cryptest g
- To encrypt and decrypt a string using RSA
cryptest r
- To calculate MD5, SHS, and RIPEMD-160 message digests:
cryptest m file
- To encrypt and decrypt a string using DES-E ...
压缩解压 zlibyou can found an optimized version of Zlib 1.1.4 that you can embed into every Delphi executable
zlibyou can found an optimized version of Zlib 1.1.4 that you can embed into every Delphi executable without use external dlls.
Further I have build a little example hoping to aid "young" Delphi programmers getting in trouble with streams...
Please let me know if you ll discover errors.
These obje ...
VHDL/FPGA/Verilog Stereo-Vision circuit description, Aug 2002, Ahmad Darabiha This design contains four top level ci
Stereo-Vision circuit description, Aug 2002,
Ahmad Darabiha
This design contains four top level circuits: sv_chip0.vhd, sv_chip1.vhd, sv_chip2.vhd and
sv_chip3.vhd each of them built by one Virtex2000E fpga chip. This design is hierarchical and the
sub-circuits can be used as smaller benchmarks.
数学计算 This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FF
This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by pe ...