C++练习题及答案

离散Fourier变换（简称DFT）为离散信号的分析从理论上提供了变换工具，但由于计算时间较长而难以实现，快速Fourier变换（简称FFT）则是一种减少计算时间的有效算法。本文在对DFT计算量进行分析的基础上指出了FFT的实现途径与计算方法，针对FFT算法进行了程序设计并给出了应用实例。-Discrete Fourier transform (referred to as DFT) analysis for discrete signal theory provides a transform tool, but due to a computational time and difficult to realize, fast Fourier transform (the FFT) is a reduction in the effective algorithm to calculate time. In this paper, DFT calculation was carried out on the basis of the analysis points out the ways and realize the FFT calculation of FFT algorithm for program design and application examples are given.

将dxf转化tab文档-will dxf file conversion tab

读取文件内容并以二进制显示-read the contents of the documents and binary show

this document is very important for vhdl code

简易通讯录c语言版-simple directory c language version

收集了很多好的风格及代码的指导准则供参考，遵守这些代码风格及代码指导准则可以提高VHDL程序的可读性，且易于修改。-collected a lot of good style and code guidelines for reference, compliance with these codes and code style guidelines VHDL procedures can improve the readability and easy to change.

vb实例,很好很好用的哦,处学者的天堂这是第四部分-vb example, the good good, oh Department scholars paradise This is the fourth part of

噪声对室内听觉距离感知的影响研究.rar-Auditory distance perception of indoor noise impact study. Rar

* 用拉格朗日插值法依据N个已知数据点即使函数值 * 输入: n--已知数据点的个数N-1 * x--已知数据点第一坐标的N维列向量 * y--已知数据点第二坐标的N维列向量 * xx-插值点第一坐标 * 输出: 函数返回值所求插值点的第二坐标 -* Use Lagrange interpolation method based on N-known data points even function* Input : n-- known data points the number N-1* x-- known data points of the first N-dimensional coordinates listed Vector* y-- Known number stronghold of the second N-dimensional coordinates listed Vector* xx-point first interpolation* Coordinate output : function return values for the second interpolation point coordinates