VaR

qpsk modulation in matlab

基于遗传算法的matlab程序，有详细注解，可以帮助遗传算法使用者应用实践(Matlab genetic algorithm-based procedures, are detailed notes to help users of the application of genetic algorithm in practice)

agent oriented software engineering

matlab 中求besselj导数的根，可以根据需要，改变输入值得到不同的根 ( seek besselj derivative of the root in matlab. you may change the input to found the different answer.)

说明：  用Matlab绘制TEQC结果图形的程序(The results using Matlab graphics rendering procedures TEQC)

Direct sequence spread spectrum (DSSS) communication systems has been widely used in these years for its advantage of wide spectrum, low working Signal-to-Noise ratio (SNR), anti-interference, anti-multipath effect and capability of LPI and LPD. They are increasingly replacing conventional communication forms and obtaining extensively applications in modern military and commercial communication systems, for example, CDMA communication system, GPS , measuring and control system, satellite chain, identification of friend or foe and etc. Therefore, corresponding DSSS electronic counter technique becomes a big problem to solve in electronic warfare domain. DSSS electronic counter technique including blind detection, blind parameter estimation and spreading sequences estimation. For the issue of DSSS electronic counter technique of DSSS/QPSK signal damaged by strong additive white Gaussian noise (AWGN), the main research content in this dissertation as follow.

this is the inverter model DC-to- AC in order to be used in a simulink model

基于四阶统计量的盲源分离算法（它是特征矩阵联合对角化的简称）在特定情况下具有普遍的适用性(Fourth-order statistics-based blind source separation algorithm (which is the characteristic matrix joint diagonalization short) in a particular case of universal applicability)

说明：  matlab仿真的，功能是实现相关峰值的提取。能够在低信噪比下得到效果较好的相关峰(matlab simulation, feature extraction is to achieve correlation peak. Able to get better low SNR correlation peak)

The primary objective of the QRD-M detector is to identify the candidate list. The QRD-M algorithm is a breadth-first tree search. It views all the branches it will ever consider for a given stage of the detection tree and then rejects all but the Mi best nodes at the i-th detection stage before continuing on to the next stage.