baizaos

802.11 SIMULATION REPORT AND SOURCE CODE

Hard Disk Drive Servo Systems

[X,Y,Z] = k_clique(k,A) Inputs: k - clique size A - adjacency matrix Outputs: X - detected communities Y - all cliques (i.e. complete subgraphs that are not parts of larger complete subgraphs) Z - k-clique matrix(k-clique algorithm as defined in the paper Uncovering the overlapping community structure of complex networks in nature and society - G. Palla, I. Derényi, I. Farkas, and T. Vicsek- Nature 435, 814–818 (2005))

MIMO-有关差分编码,用matlab书写,(MIMO-related differential coding, using Matlab writing,)

模拟nakagami-m信道，m值可改。(Simulation of Nakagami-m channel, m value can be changed.)

颜色量化算法，在HSV空间将颜色量化为128维(colorhist algorithm，the color is divided 128)

MUSIC algoritm for circular array anten

OFDM_basic, Wireless communication

Levenberg-Marquardt 算法的 Matlab 实现，附例子代码(Levenberg-Marquardt Algorithm implement in Matlab. )

The Hamming codes (described in the previous section) are suitable for detecting random bit errors in a sequence of transmitted bits. If the communication medium is prone to burst errors (channel errors affecting contiguous blocks of bits), then the Hamming code may not be suitable. Reed Solomon Codes are linear block codes, a subset of the BCH codes called non-binary BCH. The (n, k) RS code contains k data symbols and n-k parity symbols. RS Codes are also cyclic codes since the cyclic shift of any codeword will result in another valid RS codeword.