hcc

对学习tinyos的初学者很有帮助，有助于进一步地学习wsn(Useful for beginners learning tinyos help further learning wsn)

Orthogonal Frequency Division Multiplexing (OFDM) is a spectrally efficient multicarrier modulation technique for high speed data transmission over multipath fading channels. High Peak-to-Average Power Ratio (PAPR), which leads to power inefficiency in the RF portion of the transmitter, is a major drawback of OFDM.

关于CORBA 通信的描述和开发，原理和 概念 ，中文版 (The description on the CORBA communication and development, principles and concepts, the Chinese version)

目前我见过分析最为全面的2PSK系统的基于MATLAB的仿真分析M文件(At present I have seen of the most comprehensive 2PSK system simulation analysis based on MATLAB M file)

Considered a 16QAM communication system. The information rate is 2 Mb/s and the carrier frequency is 12 GHz. Assumed perfect synchronization. a) Simulated the system if the channel is AWGN and draw bit error rate of the system versus Eb/No. Compare the results with what you obtain in theory. b) Considered (15,11) Hamming code. Apply this code into the above system. Compare the results with what you obtain in theory. c) Simulated uncoded system if we have a Doppler Spread due to mobile movement in the channel. Simulate and draw the bit error rate of the system for maximum mobile speed 42.3 Km/Hour. No equalizer is used in the system. d) Applied coding of part (b) into the system of part (c). Simulate the system and discuss the results. e) Designed an interleaver for the system of part (d) to improve the coded performance results. Simulated the system.

信号1维和2维周期性双正交基的小波分析，主要是用作滤波方面，可构造非对称滤波器。(Wavelet analysis signal a 2-dimensional and two-dimensional periodic orthogonal basis, mainly used for filtering, the filter can be constructed asymmetric.)

codewarrior使用指南.Guide to the use of codewarrior.(Guide to the use of codewarrior.rar)

语音信号处理中挺实用的程序，用MATLAB实现LPC谱的分析，对初学者很有用处。(Very useful program in speech signal processing, with MATLAB implementation LPC spectrum analysis, useful for beginners.)

a simple way to detect and analyse Abnormal crowd

Conceptually, a merge sort works as follows Divide the unsorted list into n sublists, each containing 1 element (a list of 1 element is considered sorted). Repeatedly merge sublists to produce new sorted sublists until there is only 1 sublist remaining. This will be the sorted list.