当前位置:网站首页>IP核:PLL
IP核:PLL
2022-07-26 00:07:00 【刘颜儿】
前言
软件版本:Quartus17.1
正文
一、配置
注:我这里配置的PLL输出时钟没有涉及倍频和分频,如果要配置倍频和分频时钟,可以参考 野火 - B站视频 - PLL分频倍频









二、调用
找到创建好的文件夹里的IP核
打开后:
ly_pll ly_pll_inst (
.areset ( areset_sig ),
.inclk0 ( inclk0_sig ),
.c0 ( c0_sig ),
.c1 ( c1_sig ),
.c2 ( c2_sig ),
.locked ( locked_sig )
);
将上面的代码复制到顶层,并更改连接端口后:
ly_pll ly_pll_inst
(
.areset (~sys_rst_n ),
.inclk0 (sys_clk ),
.c0 (clk_125m ),
.c1 (clk_125m_shift ),
.c2 (clk_25m ),
.locked (locked1 )
);
边栏推荐
- 获得JD商品详情原数据 API
- Unity -- Euler angle, quaternion
- appium 从启动到测试再到结束流程梳理
- Responsibility chain model of behavioral model
- Redirection and request forwarding
- Detailed explanation of kubernetes network plug-ins - calico chapter - Overview
- Pytorch学习记录(一):Pytorch 简介
- 如何让你的 JS 代码写得更漂亮
- Cherish time and improve efficiency
- 链表相关方法
猜你喜欢
随机推荐
The GUI interface of yolov3 (3) -- solve the out of memory problem and add camera detection function
Jd.com API for obtaining recommended product list
SQLZOO——Nobel Quiz
06_ UE4 advanced_ Set up a large map using the terrain tool
BOM browser object model
Solid smart contract development - 3.2-solid syntax array, structure, mapping
Basic syntax of MySQL DDL, DML and DQL
bond网卡模式配置
二叉树——104. 二叉树的最大深度
二叉树相关知识
Find the intermediate node of the linked list
Binary tree - 404. Sum of left leaves
Get JD product details original data API
二叉树——110. 平衡二叉树
Redirection and request forwarding
JSON data development
Binary tree -- 222. Number of nodes of a complete binary tree
Js理解之路:什么是原型链
Binary tree -- 104. Maximum depth of binary tree
Jd.com searches for product API instructions by keyword









