搜索资源列表
FixMath
- 这是我本人编写的一个32位定点小数运算的函数库。对于没有浮点运算器的场合,可以提供进行小数运算的一种途径-This is my prepared in a 32-bit fixed point decimal computing functions. For no floating point unit occasions, it can provide for fractional arithmetic, as a way to
HugeInt_C++
- 将大数看作一个n进制数组,对于目前的32位系统而言n可以取值为2的32次方,即0x10000000, 假如将一个1024位的大数转化成0x10000000进制,它就变成了32位,而每一位的取值范围就不是0-1 或0-9,而是0-0xffffffff。我们正好可以用一个无符号长整数来表示这一数值。所以1024位的大数 就是一个有32个元素的unsigned long数组。而且0x100000000进制的数组排列与2进制流对于计算机 来说,实际上是一回事,但是我们完全可以针对unsi
bignum
- 由于计算机存储的限制,当其所存储的数大于32位时,就会有溢出,该程序只要是实现大数加法 减法 乘法。-computer storage limitations, when it stored more than 32 a few hours, there will be a spillover, The procedure is as long as the majority addition subtraction multiplication.
3345672Pall_FIR
- DA算法中的使用的查找表模块,本程序先设计查找表,然后设计4*4DA算法模块,之后进行位扩展和字扩展得到32阶滤波器程序.附带4各表,和FIR滤波器序数 -DA,FPGA,LOW FILTER,digital filter
16
- 16位循环冗余校验算法 以及 32位循环冗余校验算法 -16-bit cyclic redundancy check algorithm and 32-bit cyclic redundancy check algorithm
BigNum
- 以10^9为进制,每32位存储9个十进制位,大数类-10 ^ 9 as a decimal, each decimal 32-bit 9-bit storage, large numbers class
Nhuanghoug
- N皇后问题采用位算法来运算,速度很快,但是最多只适合32个皇后的运算-N queens problem by bit algorithm to compute, very fast, but only for a maximum of 32 Queen s operations
How-c-language-FLOAT-are-represented
- c语言中FLOAT 是如何表示的?尾数,阶码是如何在32位上安排的,即哪几位是 尾数,哪几位是阶码,那一位是符号位。-How c language FLOAT are represented? Mantissa, exponent is how 32-bit on the arrangement, that is what several of the mantissa, which is the order of a few yards, then a is the sign bit.
Integer
- 功能相对完整的大整数类,Integer 数据类型提供了针对 32 位处理器的优化性能-Relatively complete integer class, Integer data type provides optimized performance for 32-bit processors
Fibonacci-sequence
- 此程序为C++语言的程序,可以输出斐波那契数列,特点是采用线性表的数据结构处理加法运算,对每一位数进行运算,并进位,解决了由于int或long int甚至unsigned long int(0~2^32-1=4294967295)的精度范围限制,此算法的精度范围主要受项数n(int)的范围(1~2^31-1=2147483647)影响-This program is C++ language program, you can output the Fibonacci sequence, is c
PA4C
- 在1<=n<=10000000个32位整数中选出最小的k个,输出依次为从大到小的最小的k个数字。计算时间2s内,内存使用小于12M。-In the 1 < = n < = 10000000 32-bit integers in a selected minimum k, the output in descending order of the minimum k digits. Calculating time 2s, memory usage is less than 1
MD5_ENCRYPTION
- 基于Visual Basic的16位和32位的MD5加密算法-16 bit and 32 bit MD5 encryption algorithm based on Basic Visual