当前位置:网站首页>A 64 bit 8-stage pipelined adder based on FPGA
A 64 bit 8-stage pipelined adder based on FPGA
2022-07-28 02:36:00 【QQ_ seven hundred and seventy-eight million one hundred and thi】
Use verilog Realization ,qurartus Create engineering and simulation ;
Principle that
64 position 8 Stage pipeline adder , That is, will 64 The position is divided into 8 individual 8 Bit operation , The final will be 8 individual 8 The result of bit operation is added to get the final sum and carry . use 8 Stage pipeline performs addition operation , Then from the first clock when two addends are input for the first time , You need the 8 The sum of clock cycles is output , Then input the addend continuously , Zehe also keeps outputting , As shown in the figure below :
8 The stage pipeline needs to split the addition operation into 8 Two clock cycles to complete , Each clock cycle requires the sum of the previous calculations 、 The addends that have not been calculated are cached , thus , For example 1 individual 8 The sum of bits needs to be cached 7 Time , The first 2 individual 8 The sum of bits needs to be cached 6 Time , And so on . meanwhile , Also cache the addends that have not been calculated , such as [63:56] This 8 Bit requires caching 7 Time ,[55:48] This 8 Bit requires caching 6 Time .
The first 1 Clock cycles : Computation first 1 individual 8 The sum of bits , And add the carry of the previous . Cache the previous sum 、 Addends not calculated
The first 2 Clock cycles : Computation first 2 individual 8 The sum of bits , And add the carry of the previous . Cache the previous sum 、 Addends not calculated
The first 3 Clock cycles : Computation first 3 individual 8 The sum of bits , And add the carry of the previous . Cache the previous sum 、 Addends not calculated
The first 4 Clock cycles : Computation first 4 individual 8 The sum of bits , And add the carry of the previous . Cache the previous sum 、 Addends not calculated
The first 5 Clock cycles : Computation first 5 individual 8 The sum of bits , And add the carry of the previous . Cache the previous sum 、 Addends not calculated
The first 6 Clock cycles : Computation first 6 individual 8 The sum of bits , And add the carry of the previous . Cache the previous sum 、 Not calculated
边栏推荐
- Compile and use Qwt in qt|vs2017
- Soft test - database (2) relational model
- Get the difference data of two sets
- 【愚公系列】2022年07月 Tabby集成终端的使用
- Plato Farm在Elephant Swap上铸造的ePLATO是什么?
- The virtual host website cannot access the self-test method
- In practical work, how do I use postman for interface testing?
- 重要安排-DX12引擎开发课程后续直播将在B站进行
- 小程序毕设作品之微信校园浴室预约小程序毕业设计成品(1)开发概要
- 0动态规划中等 LeetCode873. 最长的斐波那契子序列的长度
猜你喜欢

作业7.27 IO进程

Lock mechanism in MySQL database InnoDB storage engine (glory Collection Edition)

Read Plato & nbsp; Eplato of farm and the reasons for its high premium

重要安排-DX12引擎开发课程后续直播将在B站进行

Understand the "next big trend" in the encryption industry - ventures Dao

Learn this trick and never be afraid to let the code collapse by mistake

小程序毕设作品之微信校园浴室预约小程序毕业设计成品(1)开发概要

借助Elephant Swap打造的ePLATO,背后的高溢价解析

MySQL 中的 INSERT 是怎么加锁的?(荣耀典藏版)

Hardware standard
随机推荐
TypeScript(零) —— 简介、环境搭建、第一个实例
MySQL数据库InnoDB存储引擎中的锁机制(荣耀典藏版)
Xiaomi website homepage big module - small module + navigation (floating case)
[understanding of opportunity -53]: Yang Mou stands up and plots to defend himself
网络必知题目
【LeetCode】13. Linked List Cycle·环形链表
When iPhone copies photos to the computer, the device connection often fails and the transmission is interrupted. Here's the way
Manual installation of Dlib Library
[hcip] BGP features
这个操作可能不值钱,但却值得学习 | 【图片批量裁剪】
Deep Residual Learning for Image Recognition浅读与实现
剑指offer专项突击版第12天
基于stm32的恒功率无线充电
Sword finger offer special assault edition day 12
【HCIP】BGP 特性
How MySQL uses indexes (glory Collection Edition)
[深入研究4G/5G/6G专题-42]: URLLC-14-《3GPP URLLC相关协议、规范、技术原理深度解读》-8-低延时技术-2-基于slot的调度与Slot内灵活的上下行符号配比
Canvas 从入门到劝朋友放弃(图解版)
"Risking your life to upload" proe/creo product structure design - seam and buckle
重要安排-DX12引擎开发课程后续直播将在B站进行