FIR 数字滤波器分布式算法及其FPGA实现

image file is used for image retrieval

说明：  C++STL的一个简单向导,先看看这个,可以先理清学习思路(C++ STL in a simple wizard, look at this, can first sort out learning ideas)

学习编程的经典资料 初学者必备 拥有理论性和实践性 -Programming information for beginners to learn the classic theoretical and practical must-have

在matlab中读取点云数据stl文件并在界面显示(Read the point cloud data STL file in MATLAB and display it on the interface.)

代码中包含了部分作者侯捷的<<STL源码剖析>>一书中的程序实例,有助于理解及应用STL,来进行方便高效的编程(Code contains some of Hou Jie, author of <<STL源码剖析>> one book instance, contribute to the understanding and application of STL, to facilitate the efficient programming)

对stl文件进行解析，并给出图形显示，处理stl文件。(Reading stl files, and give graphics)

stl的一些算法 ，可以参考参考参考，代码可以通过(Some of the algorithms for STL can be referred to as reference, and the code can be passed through)

What s inside :README - this fileINSTALL - installation instructionsstlport - main STLport include directorysrc - source and makefiles for iostreams implementationlib - installation directory for STLport library (if you use STLport iostreams only)test/regression - regression test, using wrapper iostreamstest/eh - exception handling test using STLport iostreamsetc - miscellanous files (ChangeLog, TODO, scripts, etc.) -What s inside :README- this fileINSTALL- installation instructionsstlport- main STLport include directorysrc- source and makefiles for iostreams implementationlib- installation directory for STLport library (if you use STLport iostreams only)test/regression- regression test, using wrapper iostreamstest/eh- exception handling test using STLport iostreamsetc- miscellanous files (ChangeLog, TODO, scripts, etc.)

STL的部分实用技巧，STL的部分实用技巧-STL part of practical skills, STL part of Practical Skills

说明：  求出sliding window的最大最小值(n array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example: The array is [1 3-1-3 5 3 6 7], and k is 3. Window position Minimum value Maximum value [1 3 -1]-3 5 3 6 7 -1 3 1 [3 -1 -3] 5 3 6 7 -3 3 1 3 [-1 -3 5] 3 6 7 -3 5 1 3 -1 [-3 5 3] 6 7 -3 5 1 3 -1 -3 [5 3 6] 7 3 6 1 3 -1 -3 5 [3 6 7] 3 7 Your task is to determine the maximum and minimum values in the sliding window at each position. )