虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

DFT

  • The emphasis of this book is on real-time application of Synopsys tools, used to combat various pro

    The emphasis of this book is on real-time application of Synopsys tools, used to combat various problems seen at VDSM geometries. Readers will be exposed to an effective design methodology for handling complex, submicron ASIC designs. Significance is placed on HDL coding styles, synthesis and optimization, dynamic simulation, formal verification, DFT scan insertion, links to layout, physical synthesis, and static timing analysis. At each step, problems related to each phase of the design flow are identified, with solutions and work-around described in detail. In addition, crucial issues related to layout, which includes clock tree synthesis and back-end integration (links to layout) are also discussed at length. Furthermore, the book contains in-depth discussions on the basics of Synopsys technology libraries and HDL coding styles, targeted towards optimal synthesis solution.

    标签: application real-time Synopsys emphasis

    上传时间: 2017-07-05

    上传用户:waitingfy

  • Getting to Know the FFT What is the FFT? FFT = Fast Fourier Transform. The FFT is a faster version

    Getting to Know the FFT What is the FFT? FFT = Fast Fourier Transform. The FFT is a faster version of the Discrete Fourier Transform (DFT). The FFT utilizes some clever algorithms to do the same thing as the DTF, but in much less time.

    标签: FFT the Transform Getting

    上传时间: 2017-07-15

    上传用户:com1com2

  • FFT

    FFT,即为快速傅氏变换,是离散傅氏变换的快速算法,它是根据离散傅氏变换的奇、偶、虚、实等特性,对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现,但是对于在计算机系统或者说数字系统中应用离散傅立叶变换,可以说是进了一大步。 设x(n)为N项的复数序列,由DFT变换,任一X(m)的计算都需要N次复数乘法和N-1次复数加法,而一次复数乘法等于四次实数乘法和两次实数加法,

    标签: FFT

    上传时间: 2013-12-29

    上传用户:13517191407

  • 信号处理的几种算法

    信号处理的几种算法,都经过调试成功后的,包括FFT,IRFFT,DFT,R2FFT,SRFFT,R2FFT.

    标签: 信号处理 算法

    上传时间: 2017-09-03

    上传用户:Late_Li

  • 混合基DFTc语言实现

    c语言实现的DFT,不需要修改,可以直接使用,里面有testbench,亲测有效

    标签: 代码

    上传时间: 2016-03-05

    上传用户:GaoxingACE

  • 程佩青 数字信号处理 第3版答案

    程佩青的数字信号处理答案,里面包含了DFT,z变换, FFT等的资源的答案,非常经典!

    标签: 数字信号处理

    上传时间: 2020-02-23

    上传用户:hainu_hzh

  • Hybrid+Analog-Digital+Precoding

    In this paper we revisit hybrid analog-digital precoding systems with emphasis on their modelling and radio-frequency (RF) losses, to realistically evaluate their benefits in 5G system implementations. For this, we decompose the analog beamforming networks (ABFN) as a bank of commonly used RF components and formulate realistic model constraints based on their S-parameters. Specifically, we concentrate on fully-connected ABFN (FC-ABFN) and Butler networks for implementing the discrete Fourier transform (DFT) in the RF domain. The results presented in this paper reveal that the performance and energy efficiency of hybrid precoding systems are severely affected, once practical factors are considered in the overall design. In this context, we also show that Butler RF networks are capable of providing better performances than FC-ABFN for systems with a large number of RF chains.

    标签: Analog-Digital Precoding Hybrid

    上传时间: 2020-05-27

    上传用户:shancjb

  • OFDM+Wireless+LANS

    Before delving into the details of orthogonal frequency division multiplexing (OFDM), relevant background material must be presented first. The purpose of this chapter is to provide the necessary building blocks for the development of OFDM principles. Included in this chapter are reviews of stochastic and random process, discrete-time signals and systems, and the Discrete Fourier Transform (DFT). Tooled with the necessary mathematical foundation, we proceed with an overview of digital communication systems and OFDM communication systems. We conclude the chapter with summaries of the OFDM wireless LAN standards currently in existence and a high-level comparison of single carrier systems versus OFDM.

    标签: Wireless OFDM LANS

    上传时间: 2020-05-31

    上传用户:shancjb

  • fft信号分析

    快速傅里叶变换,fft应用实例。供学习,供参考。 原理:快速傅里叶变换 (fast Fourier transform), 即利用计算机计算离散傅里叶变换(DFT)的高效、快速计算方法的统称,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。

    标签: fft 信号分析

    上传时间: 2021-07-14

    上传用户:hhh4321

  • CPU可测试性设计

    可测试性设计(Design-For-Testability,DFT)已经成为芯片设计中不可或缺的重要组成部分。它通过在芯片的逻辑设计中加入测试逻辑提高芯片的可测试性。在高性能通用 CPU 的设计中,可测试性设计技术得到了广泛的应用。本文结合几款流行的 CPU,综述了可应用于通用 CPU 等高性能芯片设计中的各种可测试性方法,包括扫描设计(Scan Design),内建自测试(Built-In Self-Test,BIST),测试点插入(Test Point Insertion),与 IEEE 1149.1标准兼容的边界扫描设计(Boundary Scan Design,BSD)等技术。

    标签: 可测试性设计 CPU

    上传时间: 2021-10-15

    上传用户: