This experiment uses the Blackfi n BF533/BF537 EZ-KIT to run a simple FIR fi lter on stereo channels at a sampling frequency of 48 kHz. The CYCLE register is embedded in the main program ( process_data.c) to benchmark the time needed to process two FIR fi lters. A background telemetry channel (BTC) is set up to display the cycle count.
標(biāo)簽： experiment Blackfi EZ-KIT channe
上傳時(shí)間： 2013-12-27
上傳用戶：baiom
A bad thing never dies. 遺臭萬年。 A bad workman always blames his tools. 不會(huì)撐船怪河彎。 A bird in the hand is worth than two in the bush. 一鳥在手勝過雙鳥在林。 A boaster and a liar are cousins-german. 吹牛與說謊本是同宗。 A bully is always
標(biāo)簽： bad workman always blames
上傳時(shí)間： 2013-12-20
上傳用戶：iswlkje
Linux下視頻捕捉的例子，使用video for linux two API編寫，可以提供一個(gè)簡單的流程，供以后加深。
上傳時(shí)間： 2014-01-06
上傳用戶：葉山豪
In the last decade the processing of polygonal meshes has emerged as an active and very productive research area. This can basically be attributed to two developments: Modern geometry acquisition devices, like laser scanners and MRT, easily produce raw polygonal meshes of ever growing complexity Downstream applications like analysis tools (medical imaging), computer aided manufacturing, or numerical simulations all require high quality polygonal meshes as input. The need to bridge the gap between raw triangle soup data and high-quality polygon meshes has driven the research on ecient data structures and algorithms that directly operate on polygonal meshes rather than on a (most often not feasible) intermediate CAD representation.
標(biāo)簽： processing productive the polygonal
上傳時(shí)間： 2017-06-03
上傳用戶：TF2015
System will automatically delete the directory of debug and release, so please do not put files on these two directory.
標(biāo)簽： automatically directory release System
上傳時(shí)間： 2014-01-15
上傳用戶：hwl453472107
Please read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory.
標(biāo)簽： automatically describe package Please
上傳時(shí)間： 2014-01-17
上傳用戶：爺?shù)臍赓|(zhì)
Please read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory.
標(biāo)簽： automatically describe package Please
上傳時(shí)間： 2013-11-28
上傳用戶：lizhizheng88
Please read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory.
標(biāo)簽： automatically describe package Please
上傳時(shí)間： 2014-01-16
上傳用戶：jennyzai
Please read your package and describe it at least 40 bytes. System will automatically delete the directory of debug and release, so please do not put files on these two directory.
標(biāo)簽： automatically describe package Please
上傳時(shí)間： 2014-01-13
上傳用戶：sssl
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
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
