Fractali 谢尔宾斯基

用于改善图像中的浓雾效果，包括暗通道算法和retinex算法

应用背景霍夫曼树-C++源码实现：哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。关键技术给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman Tree)。

用C++实现的遗传算法程序，简单易懂，拥有遗传算法的一些经典方法-Implemented using C++ genetic algorithm program, easy to understand, with some of the classical method of genetic algorithms

一元三次方程求解器,用于高冥次的三次方程求解。自己用的。-Unary cubic equation solver for high-Ming times in three equations. Own use.

8皇后问题的c++解决方案-8 Queen of c Solutions

华莱士树乘法器实现基于 vhdl 语言，该项目包括试验台 fileCSA (进位加法器保留） 共轭亚油酸 （进行查找一个头的加法器）

s 变换的vc++源程序代码，需要用到fftw函数库-s Transform vc++ source code necessary to use fftw library

应用背景Massive multiuser MIMO (MISO): ◮ M ≫ K ≫ 1 (think 100 × 10 or 500 × 50) ◮ coherent, but simple, processing ◮ Potential to dramatically improve rate & reliability ◮ Potential to drastically scale down TX power ◮ Not only theory, at least one known testbed (64× ∼10) 关键技术 Massive MIMO Operation Not enough resources for pilots & CSI feedback, so operate in TDD. ◮ On the uplink, ◮ acquire CSI from uplink pilots and/or blindly from data ◮ detect symbols ◮ M ≫ K ⇒ linear processing (MRC, ZF, MMSE) nearly optimal ◮ On the downlink, ◮ use CSI obtained on the uplink ◮ make necessary adjustments based on reciprocity calibration ◮ apply multiuser MIMO precoding ◮ simple precoders desirable (and very good!): MRT, ZF, MMSE, ... ◮ MRC/MRT operation ◮ intracell interference will appear as

Ural(Acm.timus.ru)题解 By Maigo大牛-Ural (Acm.timus.ru) title By Maigo Daniudi Solutions

牛顿下山法-Newton downhill method