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 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.
上傳時間： 2017-07-15
上傳用戶：com1com2
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
c語言實現的DFt，不需要修改，可以直接使用，里面有testbench，親測有效
標簽： 代碼
上傳時間： 2016-03-05
上傳用戶：GaoxingACE
程佩青的數字信號處理答案，里面包含了DFt，z變換， FFT等的資源的答案，非常經典！
標簽： 數字信號處理
上傳時間： 2020-02-23
上傳用戶：hainu_hzh
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
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.
上傳時間： 2020-05-31
上傳用戶：shancjb
快速傅里葉變換，fft應用實例。供學習，供參考。 原理：快速傅里葉變換 (fast Fourier transform), 即利用計算機計算離散傅里葉變換（DFt)的高效、快速計算方法的統稱，簡稱FFT。快速傅里葉變換是1965年由J.W.庫利和T.W.圖基提出的。采用這種算法能使計算機計算離散傅里葉變換所需要的乘法次數大為減少，特別是被變換的抽樣點數N越多，FFT算法計算量的節省就越顯著。
上傳時間： 2021-07-14
上傳用戶：hhh4321
可測試性設計（Design-For-Testability，DFt）已經成為芯片設計中不可或缺的重要組成部分。它通過在芯片的邏輯設計中加入測試邏輯提高芯片的可測試性。在高性能通用 CPU 的設計中，可測試性設計技術得到了廣泛的應用。本文結合幾款流行的 CPU，綜述了可應用于通用 CPU 等高性能芯片設計中的各種可測試性方法，包括掃描設計（Scan Design），內建自測試（Built-In Self-Test，BIST），測試點插入（Test Point Insertion），與 IEEE 1149.1標準兼容的邊界掃描設計（Boundary Scan Design，BSD）等技術。
上傳時間： 2021-10-15
上傳用戶：
