登录
首页 » Verilog » FIR

FIR

于 2019-06-19 发布
0 315
下载积分: 1 下载次数: 1

代码说明:

说明:  一个1MHz的FIR低通滤波器。 ① 时钟信号频率16MHz; ② 输入信号位宽8bits,符号速率16MHz; ③ 要求在Matlab软件中进行FIR滤波器浮点和定点仿真,并确定FIR滤波器抽头系数; ④ 写出测试仿真程序。(A 1MHz FIR low pass filter. (1) The clock signal frequency is 16MHz; (2) The input signal has a bit width of 8 bits and a symbol rate of 16 MHz; (3) Floating-point and fixed-point simulation of FIR filter is required in Matlab software, and tap coefficients of FIR filter are determined. (4) Write the test simulation program.)

文件列表:

FIR, 0 , 2019-05-31
FIR\10.7.3.PNG, 101935 , 2018-05-24
FIR\10.7.4.PNG, 93562 , 2018-05-24
FIR\caculator.v, 1490 , 2018-05-01
FIR\FIR-MATLAB, 0 , 2019-05-31
FIR\FIR-MATLAB\filt.cr.mti, 527 , 2018-05-24
FIR\FIR-MATLAB\filt.mpf, 79129 , 2018-05-24
FIR\FIR-MATLAB\filter.v, 23962 , 2018-05-24
FIR\FIR-MATLAB\filter_compile.do, 25 , 2018-05-24
FIR\FIR-MATLAB\filter_tb.v, 289570 , 2018-05-24
FIR\FIR-MATLAB\filter_tb_compile.do, 43 , 2018-05-24
FIR\FIR-MATLAB\filter_tb_sim.do, 313 , 2018-05-24
FIR\FIR-MATLAB\vsim.wlf, 409600 , 2018-05-24
FIR\FIR-MATLAB\work, 0 , 2019-05-31
FIR\FIR-MATLAB\work\filter, 0 , 2019-05-31
FIR\FIR-MATLAB\work\filter\verilog.asm, 134624 , 2018-05-24
FIR\FIR-MATLAB\work\filter\verilog.rw, 15185 , 2018-05-24
FIR\FIR-MATLAB\work\filter\_primary.dat, 16764 , 2018-05-24
FIR\FIR-MATLAB\work\filter\_primary.dbs, 24018 , 2018-05-24
FIR\FIR-MATLAB\work\filter\_primary.vhd, 6723 , 2018-05-24
FIR\FIR-MATLAB\work\filter_tb, 0 , 2019-05-31
FIR\FIR-MATLAB\work\filter_tb\verilog.asm, 676392 , 2018-05-24
FIR\FIR-MATLAB\work\filter_tb\verilog.rw, 26181 , 2018-05-24
FIR\FIR-MATLAB\work\filter_tb\_primary.dat, 257964 , 2018-05-24
FIR\FIR-MATLAB\work\filter_tb\_primary.dbs, 182643 , 2018-05-24
FIR\FIR-MATLAB\work\filter_tb\_primary.vhd, 681 , 2018-05-24
FIR\FIR-MATLAB\work\_info, 998 , 2018-05-24
FIR\FIR-MATLAB\work\_temp, 0 , 2018-05-24
FIR\FIR-MATLAB\work\_vmake, 26 , 2018-05-24
FIR\FIR.cr.mti, 1612 , 2018-05-24
FIR\FIR.mpf, 81063 , 2018-05-24
FIR\FIR.v, 778 , 2018-05-01
FIR\FIR_tb.v, 366 , 2018-05-01
FIR\shift_register.v, 904 , 2018-05-01
FIR\vsim.wlf, 81920 , 2018-05-24
FIR\work, 0 , 2019-05-31
FIR\work\@f@i@r, 0 , 2019-05-31
FIR\work\@f@i@r\_primary.dat, 795 , 2018-05-24
FIR\work\@f@i@r\_primary.dbs, 1207 , 2018-05-24
FIR\work\@f@i@r\_primary.vhd, 292 , 2018-05-24
FIR\work\@f@i@r_tb, 0 , 2019-05-31
FIR\work\@f@i@r_tb\_primary.dat, 436 , 2018-05-24
FIR\work\@f@i@r_tb\_primary.dbs, 720 , 2018-05-24
FIR\work\@f@i@r_tb\_primary.vhd, 72 , 2018-05-24
FIR\work\caculator, 0 , 2019-05-31
FIR\work\caculator\_primary.dat, 1158 , 2018-05-24
FIR\work\caculator\_primary.dbs, 2039 , 2018-05-24
FIR\work\caculator\_primary.vhd, 1450 , 2018-05-24
FIR\work\filter, 0 , 2019-05-31
FIR\work\filter\_primary.dat, 16764 , 2018-05-24
FIR\work\filter\_primary.dbs, 24018 , 2018-05-24
FIR\work\filter\_primary.vhd, 6723 , 2018-05-24
FIR\work\filter_tb, 0 , 2019-05-31
FIR\work\filter_tb\_primary.dat, 257964 , 2018-05-24
FIR\work\filter_tb\_primary.dbs, 182643 , 2018-05-24
FIR\work\filter_tb\_primary.vhd, 681 , 2018-05-24
FIR\work\mul_addtree, 0 , 2019-05-31
FIR\work\mul_addtree\_primary.dat, 756 , 2018-05-24
FIR\work\mul_addtree\_primary.dbs, 1206 , 2018-05-24
FIR\work\mul_addtree\_primary.vhd, 284 , 2018-05-24
FIR\work\shift_register, 0 , 2019-05-31
FIR\work\shift_register\_primary.dat, 875 , 2018-05-24
FIR\work\shift_register\_primary.dbs, 1372 , 2018-05-24
FIR\work\shift_register\_primary.vhd, 810 , 2018-05-24
FIR\work\_info, 2924 , 2018-05-24
FIR\work\_temp, 0 , 2018-05-24
FIR\work\_vmake, 26 , 2018-05-24
FIR\波形图-MATLAB.png, 76976 , 2018-07-01
FIR\波形图.PNG, 73948 , 2018-05-24
FIR\题目三.docx, 581361 , 2018-07-02

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • ana
    蚁群算法是一种求解组合最优化问题的新型通用启发式方法,该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型,基于故障过电流的配电网故障定位变为一种非线性全局寻优问题(Ant colony algorithm is a combinatorial optimization problem to solve a new type of general-purpose heuristic method, the method has positive feedback, distributed computing and constructive greedy heuristic search features. Through the establishment of appropriate mathematical model, based on the fault over-current distribution network fault location into a nonlinear global optimization problem)
    2007-08-20 16:20:26下载
    积分:1
  • pvbattery
    说明:  光伏电池模型仿真,可以对光伏电池的开路电压,短路电流,最大功率点电压电流进行参数设计(Photovoltaic cell model simulation)
    2019-04-14 22:17:08下载
    积分:1
  • wbym
    网吧管理软件,希望能给大家点帮助,里面有些地方须大家给检查一下(Internet management software, we hope that they will help point, where some of the areas that need to check everyone)
    2007-05-15 19:50:29下载
    积分:1
  • wjj
    Can automatically organize the file box to search for files
    2012-03-11 04:07:51下载
    积分:1
  • attributes
    说明:  CUB_鸟类数据标注,每张图312特征,共计200分类(class_attribute_labels_continuous)
    2020-06-22 18:40:01下载
    积分:1
  • 编写的MATLAB处理语音信号的软件界面,能够实现显示输入语音信号的混音,重放,以及波形的时域和频域显示...
    编写的MATLAB处理语音信号的软件界面,能够实现显示输入语音信号的混音,重放,以及波形的时域和频域显示-MATLAB signal plot
    2022-02-21 00:55:38下载
    积分:1
  • 两级的网页下拉菜单代码
    两级的网页下拉菜单代码,圆角风格,鼠标悬停于主菜单时,向下滑出二级菜单,类似于下拉式菜单,这种简洁大方的风格,同样来自于一个国外CSS达人的网站。
    2022-07-14 03:47:39下载
    积分:1
  • VMD1
    说明:  VMD程序,适用于振动信号,不适用于宽频信号(Realize standard FFT transform. FFT is used to get the spectrum of the signal, which is not suitable for wideband signal)
    2020-06-23 16:23:17下载
    积分:1
  • YOLO
    说明:  将一幅图像分成 SxS 个网格(grid cell),如果某个 object 的中心落在这个网格中,则这个网格就负责预测这个 object。(Divide an image into SxS grid cells. If the center of an object falls in the grid, the grid is responsible for predicting the object.)
    2020-06-21 11:40:02下载
    积分:1
  • 局部搜索图着色
    说明:  图着色局部搜索,图着色问题(Graph Coloring Problem, GCP) 又称着色问题,是最著名的NP-完全问题之一。道路着色问题(Road Coloring Problem)是图论中最著名的猜想之一。 数学定义:给定一个无向图G=(V, E),其中V为顶点集合,E为边集合,图着色问题即为将V分为K个颜色组,每个组形成一个独立集,即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)
    2021-04-01 16:49:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载