搜索资源列表
n栏栅解密算法
- 此小程序为N栏栅解密算法的一种，对某一N值加密过的密文进行解密，此时只要确定N值即可解密。作者：万艳良 单位：武汉理工大学-the procedure is one of n bit palisade decrypt arithmetic,if decrypting the file which has been encrypted with N that one of the number,at this time ,if you know the N value ,you can
add_full_n
- 该程序实现的是n位全加器，首先用与非门实现一位全家器，最后实现n位的全加器。-the program is to achieve the n-bit full adder, first using the door with non-realization of a family - and finally realize the full n-bit adder.
sub_full_n
- 该程序实现的N位全减器，首先实现一位的减法器，之后实现N位全减器。-Program of the N-bit-wide reduction, the first realization of a subtraction for, after all N-reduction devices.
MoShiPiPei
- 有一串10000位数的主串由1、2、3、4四位数随机获得，n位模式串是指有4的n次方个模式串，如2位模式串有：11、12、13、14、21、22、23、24、31、32、33、34、41、42、43、44等16个数组成。现在进行模式匹配，假设主串为：431324113122341324132等等，则第一次比较是43，第二次比较是31，第三次比较是13，依此类推，每比较一次则落得模式串中的一个，当所有模式串（有4的n次方个）都被找到时，记得所比较的次数，则这个次数就是这次匹配的结果。程序执行了
n
- DELPHI实现图象处理,实现灰度转换,可能有点小错误,需要少作修改-DELPHI image processing, Grayscale conversion, may be a bit small, less need for change
adderN
- N位加法器源代码，通用的，通过xilinx验证，希望对大家有用。-N-bit adder source code, a common, through Xilinx certification, useful for all.
25093950538
- Von Neuman在1940年提出了平方取中法，其原理是将一个给定的2n比特的数平方，然后高位补0得到4n比特的数，再截取中间的2n位进行下次迭代，并得到一个随机数序列。这种方法无论是在硬件实现上，还是在仿真测试上都比较容易实现，但是它的周期受初始值的影响很大，如果初始值选得不好，会严重影响随机数序列的质量和周期，而且其最大周期不会超过22n 随机数生成-Von Neuman in the 1940 square from France, Its principle is to be a
给定n 位正整数a，去掉其中任意k≤n 个数字后
- 给定n 位正整数a，去掉其中任意k≤n 个数字后，剩下的数字按原次序排列组成一个新的正整数。对于给定的n位正整数a 和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。 对于给定的正整数a，编程计算删去k个数字后得到的最小数。 ,Given n-bit positive integer a, which removed any k ≤ n digits, the remaining number of the original order to form a new po
fuperm
- 应用JBuilder环境开发，输入一个正整数n,输出1~n的组成的全排列-JBuilder application development environment, enter a positive integer n, output 1 ~ n the composition of the entire array
lab7
- 在這個實習當中，我們學習利 用 Hierarchical VHDL code 的方式，來 實現一 個n-bit 的ripple-carry adder，並學習使用package。-In this practice among the profit we can learn to use Hierarchical VHDL code the way to achieve an n-bit future of the ripple-carry adder, and lea
m-operand-n-bit-adder
- n bit m operand adder
Exhaustive-N-binary-system-number
- 列举N位二进制数，的分治递归算法，由C语言写成，附带运行，生成文件-Enumerate the N-bit binary number, divide and conquer recursive algorithm, written in C, with run to generate the file
n-bit
- n bit parity generator is a versatile program that adds parity bits for any length of data the user enters . It accurately adds parity bits on the MSB and solves the problem during any kind of digital communication protocol
N---Bit-Full-SUBSTRUCTURE
- VHDL program for “N Bit Substructure” behavioral design in Xilinx integrated software environment
N-DtoA-VHDL-AMS
- 下面是一个混合信号的例子,是一个N位D/A转换器的VHDL-AMS描述-The following is an example of a mixed signal that is a N bit D/A converter described in VHDL-AMS
8-bit-Restoring-Divider
- Division is performed in four stages. After reset, the 8-bit numerator is “loaded” in the remainder register, the 6-bit denominator is loaded and aligned (by 2N− 1 for a N bit numerator), and the quotient register is set to zero. In the second a
N-BitComparator
- N-Bit Comparator Between X and Y
N-BitParallelLoadShifRegister
- N Bit ParallelLoadShiftRegister
n-bit adder
- n-bit optimized adder using VHDL
穷举n位二进制数
- 输入一个小于20的正整数n，要求按从小到大的顺序输出所有的n位二进制数，每个数占一行。(Enter a positive integer that is less than 20, and you want to output all of the n-bit binary Numbers in the order of small to large, each of which is a row.)