The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
標(biāo)簽： iterations performs Bailey number
上傳時(shí)間： 2014-01-05
上傳用戶：libenshu01
走馬燈（燈光變幻）程序 內(nèi)容：用DIP的8位開(kāi)關(guān)控制走馬燈的花樣，用SW3控制走馬燈的起/停 運(yùn)行步驟:1.按下一次開(kāi)關(guān)SW3,開(kāi)始燈光變幻,再按下一次則停止 可重復(fù)進(jìn)行 * 2.按下SW3后，撥動(dòng)不同的數(shù)碼開(kāi)關(guān)DIP,就會(huì)出現(xiàn)不同的燈光變幻 * 3.按下"q"或者"Q",退出
上傳時(shí)間： 2017-06-21
上傳用戶：yepeng139
蟻群算法的MATLAB程序，提供變量初始化 C=[1304 2312 3639 1315 4177 2244 3712 1399 3488 1535 3326 1556 3238 1229 4196 1004 4312 790 4386 570 3007 1970 2562 1756 2788 1491 2381 1676 1332 695 3715 1678 3918 2179 4061 2370 3780 2212 3676 2578 4029 2838 4263 2931 3429 1908 3507 2367 3394 2643 3439 3201 2935 3240 3140 3550 2545 2357 2778 2826 2370 2975] m=31 Alpha=1 Beta=5 Rho=0.9 Q=100 NC_max=200
上傳時(shí)間： 2017-07-08
上傳用戶：wangyi39
模擬QPSK發(fā)射和接受的一個(gè)程序，帶I-Q修正，對(duì)于理解QPSK有很好的作用
上傳時(shí)間： 2017-07-12
上傳用戶：tianyi223
數(shù)字下變頻的Verilog程序，測(cè)試可以直接使用，將A/D信號(hào)下變頻為基帶I，Q兩路信號(hào)
標(biāo)簽： Verilog 數(shù)字下變頻 程序
上傳時(shí)間： 2014-01-19
上傳用戶：saharawalker
We are providing the best information available to us as at date of writing and intend to update it at frequent intervals as things change and/or more information becomes available. However we intend this Q&A as a guide only and recommend that users obtain specific information to determine applicability to their specific requirements. (This is another way of saying that we can t be held liable or responsible for the content.)
標(biāo)簽： information providing available writing
上傳時(shí)間： 2017-07-22
上傳用戶：四只眼
RS_latch using vhdl, When using static gates as building blocks, the most fundamental latch is the simple SR latch, where S and R stand for set and reset. It can be constructed from a pair of cross-coupled NOR (Not OR) logic gates. The stored bit is present on the output marked Q. Normally, in storage mode, the S and R inputs are both low, and feedback maintains the Q and Q outputs in a constant state, with Q the complement of Q. If S (Set) is pulsed high while R is held low, then the Q output is forced high, and stays high when S returns to low similarly, if R (Reset) is pulsed high while S is held low, then the Q output is forced low, and stays low when R returns to low.
標(biāo)簽： using fundamental the RS_latch
上傳時(shí)間： 2017-07-30
上傳用戶：努力努力再努力
一個(gè)模擬的心電信號(hào)的matlab程序，其中一共包含了一個(gè)主程序和6個(gè)小程序，小程序分別是q波，s波，u波，p波，t波以及QRS波的模擬，運(yùn)行的時(shí)候直接運(yùn)行主程序complete.m 文件即可，運(yùn)行良好，可以出波形
標(biāo)簽： matlab 模擬 心電信號(hào) 程序
上傳時(shí)間： 2017-08-01
上傳用戶：chenxichenyue
格式為GDF，遺傳算法在大學(xué)排課問(wèn)題中的應(yīng)用，對(duì)畢業(yè)論文有很大的幫助，需要的請(qǐng)下載看吧，需要更多的資料請(qǐng)Q我365191126
標(biāo)簽： GDF
上傳時(shí)間： 2013-12-29
上傳用戶：894898248
實(shí)現(xiàn)了蟻群算法求解TSP問(wèn)題。注釋詳細(xì) function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q) ------------------------------------------------------------------------- 主要符號(hào)說(shuō)明 C n個(gè)城市的坐標(biāo)，n×2的矩陣 NC_max最大迭代次數(shù) m螞蟻個(gè)數(shù) Alpha表征信息素重要程度的參數(shù) Beta表征啟發(fā)式因子重要程度的參數(shù) Rho信息素蒸發(fā)系數(shù) Q信息素增加強(qiáng)度系數(shù) R_best各代最佳路線 L_best各代最佳路線的長(zhǎng)度 =========================================================================
標(biāo)簽： Shortest_Length Shortest_Route function R_best
上傳時(shí)間： 2014-01-17
上傳用戶：lunshaomo
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
