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
