资源列表
[VHDL编程] Vending-Machine-using-Moore
说明：Vending Machine simulation using Moore sequence<Japerski> 在 2024-11-15 上传 | 大小：45kb | 下载：0
[VHDL编程] Basic_Examples
说明：Basic syntax and codes used in VHDL<Japerski> 在 2024-11-15 上传 | 大小：1kb | 下载：0
[VHDL编程] VHDL-Design-of-31-bit-Pipelined-Adder
说明：The design runs at 316.46 MHz and uses 125 LEs.<hooman hematkhah> 在 2024-11-15 上传 | 大小：215kb | 下载：0
[VHDL编程] 8-bit-Multiplier
说明：Multiplication is performed in three stages. After reset, the 8-bit operands are “loaded” and the product register is set to zero. In the second stage, s1, the actual serial-parallel multiplication takes place. In the th<hooman hematkhah> 在 2024-11-15 上传 | 大小：189kb | 下载：0
[VHDL编程] 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 i<hooman hematkhah> 在 2024-11-15 上传 | 大小：224kb | 下载：0
[VHDL编程] Anderson--Algorithm
说明：We assume that denominator and numerator are normalized as, for instance, typical for floating-point mantissa values, to the interval 1 ≤ N, D < 2. This normalization step may require essential addition resources (lea<hooman hematkhah> 在 2024-11-15 上传 | 大小：194kb | 下载：0
[VHDL编程] Circular-CORDIC-in-Vectoring-Mode
说明：The first iteration rotates the vectors the second or third quadrant to the first or fourth, respectively. The shift sequence is 0,0,1, and 2. The rotation angle of the first four steps becomes: arctan(∞) = 90◦ , ar<hooman hematkhah> 在 2024-11-15 上传 | 大小：274kb | 下载：0
[VHDL编程] arctan-Function-Approximation
说明：If we implement the arctan(x) using the embedded 9 × 9 bit multipliers we have to take into account that our values are in the range − 1 ≤ x < 1. We therefore use a fractional integer representation in a 1.8 form<hooman hematkhah> 在 2024-11-15 上传 | 大小：313kb | 下载：0