当前位置:网站首页>FPGA 学习笔记:Vivado 2019.1 工程创建
FPGA 学习笔记:Vivado 2019.1 工程创建
2022-07-03 19:33:00 【张世争】
前言
最近买了一块 【正点原子】达芬奇Pro FPGA开发板,学习下FPGA开发的相关知识
这个FPGA开发基于
Xilinx的xc7a35tfgg484-2,资源比较丰富Xilinx如今推荐的开发IDE 是Vivado,不再推荐使用ISE,我使用Vivado 2019.1,这个软件比较的庞大,占用约50~70G的硬盘
创建工程
创建工程这个部分,流程比较的简单,这里做个笔记
首先要安装好
Vivado 2019.1,打开Vivado 2019.1点击 【Create Project】创建一个新的Vivado 工程

给 Vivado 工程取个名字,注意不要使用中文目录、名字不含有空格、特殊符号

工程的类别,默认常用的:【RTL Project】,所以直接 【Next】即可

这里可以暂时不添加源文件,verilog HDL 的源文件,如
hello.v,可以在创建工程后再加入,也可以选择【VHDL】语言
选择 FPGA 的型号,这个需要选择实际的电路板上的FPGA 型号,我这个开发板是 :
xc7a35tfgg484-2,在 【Search】搜索框里,可以输入 型号,筛选出想要的FPGA 的型号
空的 Vivado FPGA 工程,就创建完成了

空工程如下,后面研究开发FPGA的整个流程

小结
这里先创建一个空的工程,发现就是一路的【Next】,选对 FPGA 型号即可,如果选的不对,后面可以更改
通过了解,Vivado 还支持 命令行,也就是
tcl脚本的开发方式,这个后面再研究后面继续研究 源文件的添加、仿真、综合、实现、生成二进制文件,下载到板子上运行的流程
边栏推荐
- Buuctf's different flags and simplerev
- Ego planner code parsing Bspline_ Optimizer section (1)
- Thesis study - 7 Very Deep Convolutional Networks for Large-Scale Image Recognition (3/3)
- 第一章:拓广同码小数和s(d, n)
- Chapter 1: find the factorial n of n!
- 2022-06-28 网工进阶(十三)IS-IS-路由过滤、路由汇总、认证、影响ISIS邻居关系建立的因素、其他命令和特性
- 第二章:求长方体数组,指定区间内的完全数,改进指定区间内的完全数
- Zhang Fei hardware 90 day learning notes - personal records on day 4, please see my personal profile / homepage for the complete
- [disease identification] machine vision lung cancer detection system based on Matlab GUI [including Matlab source code 1922]
- PR 2021 quick start tutorial, material import and management
猜你喜欢

Chapitre 1: le roi de shehan a mal calculé

PR FAQ: how to set PR vertical screen sequence?

Recommend a GIF processing artifact less than 300K - gifsicle (free download)

Thesis study - 7 Very Deep Convolutional Networks for Large-Scale Image Recognition (3/3)

BUUCTF

Chapter 1: King Shehan miscalculated

第一章:拓广同码小数和s(d, n)

第一章:求所有阶乘和数,大奖赛现场统分程序设计,三位阶乘和数,图形点扫描,递归求n的阶乘n!,求n的阶乘n!,舍罕王失算
![CesiumJS 2022^ 源码解读[7] - 3DTiles 的请求、加载处理流程解析](/img/70/6fd00146418e5d481e951d51428990.png)
CesiumJS 2022^ 源码解读[7] - 3DTiles 的请求、加载处理流程解析

Merge K ascending linked lists
随机推荐
Chapter 2: find the number of daffodils based on decomposition, find the number of daffodils based on combination, find the conformal number in [x, y], explore the n-bit conformal number, recursively
I didn't cancel
Using the visualization results, click to appear the corresponding sentence
EGO Planner代码解析bspline_optimizer部分(3)
Chapter 1: find all factorial sums, Grand Prix site unified programming, three factorial sums, graphic point scanning, recursive factorial n of n!, Find the factorial n of n!, King Shehan miscalculate
2022.2.14 Li Kou - daily question - single element in an ordered array
Chapter 1: King Shehan miscalculated
The space of C disk is insufficient, and the computer becomes stuck. Quickly expand the capacity of C disk to make the system more smooth
Thesis study - 7 Very Deep Convolutional Networks for Large-Scale Image Recognition (3/3)
If the warehouse management communication is not in place, what problems will occur?
Chapter 1: seek common? Decimal and S (D, n)
论文阅读 GloDyNE Global Topology Preserving Dynamic Network Embedding
Ego planner code parsing Bspline_ Optimizer section (1)
Ctrip will implement a 3+2 work system in March, with 3 days on duty and 2 days at home every week
Cesiumjs 2022 ^ source code interpretation [7] - Analysis of the request and loading process of 3dfiles
第二章:求长方体数组,指定区间内的完全数,改进指定区间内的完全数
2022-06-28 advanced network engineering (XIII) IS-IS route filtering, route summary, authentication, factors affecting the establishment of Isis neighbor relations, other commands and characteristics
BUUCTF
[proteus simulation] a simple encrypted electronic password lock designed with 24C04 and 1602LCD
Chapter 1: find the factorial n of n!