搜索结果
找到约 482 项符合
fixed-point 的查询结果
软件设计/软件工程 This is a Power Point Presentation i created for explaining the power of Unix Shell Scripting.
This is a Power Point Presentation i created for explaining the power of Unix Shell Scripting.
matlab例程 it could make a point on the map , which is the image you edit
it could make a point on the map , which is the image you edit
其他 AudioRouting.cpp : Defines the entry point for the DLL application. Audio Routing Service
AudioRouting.cpp : Defines the entry point for the DLL application.
Audio Routing Service
软件设计/软件工程 voronoi algorithm presentations power point presentation
voronoi algorithm presentations power point presentation
通讯编程文档 A Comparison of Point Target Spectra Derived
A Comparison of Point Target Spectra Derived
其他书籍 This paper shows the development of a 1024-point radix-4 FFT VHDL core for applications in hardware
This paper shows the development of a 1024-point
radix-4 FFT VHDL core for applications in hardware signal processing, targeting low-cost FPGA technologies. The developed core is targeted into a Xilinx庐 Spartan鈩?3 XC3S200 FPGA with the inclusion of a VGA display interface and an external 16-bit da ...
其他书籍 Fast Fourier Transform power point The rectangular window introduces broadening of any frequency co
Fast Fourier Transform power point
The rectangular window introduces broadening of any frequency components [`smearing鈥? and sidelobesthat may overlap with other frequency components [`leakage鈥?.
鈥he effect improves as Nincreases
鈥owever, the rectangle window has poor properties and better c ...
语音压缩 ITU-T G.729 Annex C+ - Reference C code for floating point implementation of G.729 at 6.4/8/11.8
ITU-T G.729 Annex C+ - Reference C code for floating point
implementation of G.729 at 6.4/8/11.8 kbit/s with DTX functionality
(integration of Annexes B, D and E)
3G开发 无线网络的安装和配置:Access Point 简称AP
无线网络的安装和配置:Access Point
简称AP,直译为“无线接入点”,在此我们称作“无线收发器”
数学计算 A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is
A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P.
One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wr ...