The Hilbert Transform is an important component in communication systems, e.g. for single sideband modulation/demodulation, amplitude and phase detection, etc. It can be formulated as filtering operation which makes it possible to approximate the Hilbert Transform with a digital filter. Due to the non-causal and infinite impulse response of that filter, it is not that easy to get a good approximation with low hardware resource usage. Therefore, different filters with different complexities have been implemented. The detailed discussion can be found in "Digital Hilbert Transformers or FPGA-based Phase-Locked Loops" (http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4629940). The design is fully pipelined for maximum throughput.
標簽： e.g. communication Transform important
上傳時間： 2017-06-25
上傳用戶：gxf2016
E book for Linux Device Driver
上傳時間： 2014-01-08
上傳用戶：Thuan
bayesian networks. a n e book for starting the understanding of bayes theory and applications
標簽： understanding applications bayesian networks
上傳時間： 2017-07-13
上傳用戶：ZJX5201314
This is an e-book for integral mathematics formulae in pdf format
標簽： mathematics integral formulae e-book
上傳時間： 2017-07-14
上傳用戶：iswlkje
E-book for XNA 3.0 programming
標簽： programming E-book 3.0 for
上傳時間： 2014-12-08
上傳用戶：lvzhr
a E book for MAtlab Programming
標簽： Programming MAtlab book for
上傳時間： 2014-01-08
上傳用戶：refent
數據結構課程設計 數據結構B+樹 B+ tree Library
上傳時間： 2013-12-31
上傳用戶：semi1981
its visual basic e-book for learn. its language turkish.
標簽： its language turkish e-book
上傳時間： 2017-09-08
上傳用戶：xc216
E-Book For Java Basic Creating Mobile Games.
標簽： Creating E-Book Mobile Basic
上傳時間： 2013-11-29
上傳用戶：lmeeworm
Floyd-Warshall算法描述 1)適用范圍： a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權可正可負 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法結束：dis即為所有點對的最短路徑矩陣 3)算法小結：此算法簡單有效，由于三重循環結構緊湊，對于稠密圖，效率要高于執行|V|次Dijkstra算法。時間復雜度O(n^3)。 考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
標簽： Floyd-Warshall Shortest Pairs Paths
上傳時間： 2013-12-01
上傳用戶：dyctj
