設定a為N(0,1)的500個隨機數(shù)和i長為500，以n=8、16、64.分別調(diào)用u_pcm.m ，從中計算量化誤差f=a-a_quan并繪圖，分別輸出各樣值的量化誤差圖形。
上傳時間： 2014-01-17
上傳用戶：偷心的海盜
Multirate filters provide a practical approach to designing and implementing finite response (FIR) filters with narrow spectral constraints. By changing the input data rate at one or more intermediate points the filter lengths and computational rates can be greatly reduced when compared to a standard single-rate filter implementation.
標簽： implementing Multirate designing practical
上傳時間： 2016-07-01
上傳用戶：dengzb84
This is a simple GPS tracer developed for Window Mobile 2005/2003 on Compact Framework 2.0 SDK. So first of all, you need VisualStudio 2005 and Windows Mobile CE 5 SDK. You can develop it on emulator devices or on a real device. As you can see in that photo, I developed that application on a read device: the great Asus MyPal 636N.
標簽： Framework developed Compact Mobile
上傳時間： 2016-08-11
上傳用戶：gxf2016
The literature of cryptography has a curious history. Secrecy, of course, has always played a central role, but until the First World War, important developments appeared in print in a more or less timely fashion and the field moved forward in much the same way as other specialized disciplines. As late as 1918, one of the most influential cryptanalytic papers of the twentieth century, William F. Friedman’s monograph The Index of Coincidence and Its Applications in Cryptography, appeared as a research report of the private Riverbank Laboratories [577]. And this, despite the fact that the work had been done as part of the war effort. In the same year Edward H. Hebern of Oakland, California filed the first patent for a rotor machine [710], the device destined to be a mainstay of military cryptography for nearly 50 years.
標簽： cryptography literature has Secrecy
上傳時間： 2016-12-08
上傳用戶：fxf126@126.com
made by: kangkai data:2008.11.23 this one is used to test arm7 str71x. use a led to test GPIO. a---------P0.0 b---------P0.1 c---------P0.2 d---------P0.3 e---------P0.4 f---------P0.5 g---------P0.6 just run it and you will see the led to show 0-9 all the time.
上傳時間： 2016-12-16
上傳用戶：moerwang
【歐拉算法】 微分方程的本質(zhì)特征是方程中含有導數(shù)項,數(shù)值解法的第一步就是...歐拉(Euler)算法是數(shù)值求解中最基本、最簡單的方法,但其求解精度較低,一般不在...對于常微分方程: dy/dx=f(x,y),x∈[a,b] y(a)=y0 可以將區(qū)
上傳時間： 2014-01-09
上傳用戶：www240697738
編寫具有如下函數(shù)原型的遞歸與非遞歸兩種函數(shù)f，負責判斷數(shù)組a的前n個元素是否從大到小完全有序了，是則返回true，否則返回false。并編制主函數(shù)對它們進行調(diào)用，以驗證其正確性。 bool f(int a[], int n) 提示： （1）非遞歸函數(shù)中只需逐對地判斷各a[i]與a[i+1]是否都已從大到小有序排列（i = 0，1，…，n-2）。 （2）遞歸函數(shù)中將問題分解處理為：若n=1（即只有1個元素時）則返回true而遞歸出口；n>1時，若最后一對元素不順序則返回false，否則進行遞歸調(diào)用（傳去實參a與 n-1，去判斷前n-1個元素的順序性），并返回遞歸調(diào)用的結(jié)果（與前n-1個元素的是否順序性相同）。
上傳時間： 2017-01-02
上傳用戶：清風冷雨
A novel met hod t o p artially compensate sigma2delta shap ed noise is p rop osed. By injecting t he comp en2 sation cur rent int o t he p assive loop f ilte r during t he delay time of t he p hase f requency detect or ( PFD) , a maximum reduction of t he p hase noise by about 16dB can be achieved. Comp a red t o ot he r compensation met hods , t he tech2 nique p rop osed he re is relatively simple and easy t o implement . Key building blocks f or realizing t he noise cancel2 lation , including t he delay va riable PFD and comp ensation cur rent source , a re sp ecially designed. Bot h t he behavior level and circuit level simulation results a re p resented.
標簽： sigma2delta compensate injecting artially
上傳時間： 2013-12-18
上傳用戶：qlpqlq
（一）基本任務：單頻正弦波模擬信號的簡單數(shù)字化。即對一個單頻正弦波模擬信號進行抽樣、均勻量化、PCM二進制自然編碼。 1、主要步驟和要求： （1）單頻正弦波模擬信號的抽樣實現(xiàn)。要求輸入信號的幅度A、頻率F和相位P可變；要求仿真時間從0到2/F，抽樣頻率為Fs=20F；要求給出抽樣信號samp的波形圖。 （2）單頻正弦波模擬信號均勻量化的實現(xiàn)。要求對抽樣信號sampl歸一化后再進行均勻量化；要求量化電平數(shù)D可變；要求輸出信號為平頂正弦波；要求給出量化輸出信號quant的波形圖，并與抽樣信號samp畫在同一圖形窗口中進行波形比較。 （3）單頻正弦波模擬信號PCM二進制自然編碼的實現(xiàn)。要求按量化序號給出PCM二進制自然編碼；要求給出編碼后的數(shù)字序列pcm。
上傳時間： 2013-12-07
上傳用戶：無聊來刷下
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標簽： contains Output convex planar
上傳時間： 2017-02-19
上傳用戶：wyc199288
