-
cuxidingweixiangjiehe
基于粗细定位相结合的车牌识别方法,有别于一般的车牌识别算法,有兴趣的可以研究一下哈~(Based on the combination of coarse and fine positioning plate recognition, license plate recognition algorithm is different from the general, interested can look at Ha ~)
- 2010-06-05 15:13:02下载
- 积分:1
-
chap6
很好的程序,学习的可以看看啊,很不错的啊(Very good program, learning to see, ah, ah very good)
- 2011-04-22 16:26:33下载
- 积分:1
-
strapdown
对准程序,解决了仿真计算和粗对准、精对准过程的数学描述的问题,这样就会得到一个结果的验证(inertial progrmme)
- 2012-03-29 23:04:33下载
- 积分:1
-
S
matlab的S函数例程,是关于滑模变结构的(S function matlab routines, is about Sliding Mode Variable Structure)
- 2013-08-18 10:58:53下载
- 积分:1
-
2177e8d3adb15fabed33322ffd32afc8394a
说明: an investigation on use of chaotic sequence in DS-CDMA. The DS-CDMA systems offer
physical layer security without the need for a significant increase in computation or power requirements. Nowadays, DSCDMA
has been used widely. These systems suffers from multiple access interference because of other users transmitting
in the cell, channel inter symbol interference and additive white Gaussian noise. Codes have an effective role in DSCDMA
system, so M-sequences; gold sequences have been used as spreading codes in DS-CDMA. These sequences by
shift registers and periodic in nature are developed. However, these sequences are not enough and also limit the security.
This paper presents an investigation on use of new type of sequences called chaotic sequences for DS-CDMA system.
These sequences by chaotic maps are generated.
- 2019-03-13 22:41:27下载
- 积分:1
-
mark
添加水印,在图项中添加,matlab,实现图像的保护等等
(Add watermark, add items in the map, matlab, image protection, etc.)
- 2008-12-31 14:18:15下载
- 积分:1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分:1
-
pso-svm
code pso-svm matlab for optimazation.
- 2013-04-14 18:11:03下载
- 积分:1
-
Task2new
This prorgam calculates Bit error rate on awgn channel with a particular Eb/No values and plot the graph of BEP(Bit Error Probability) against Eb/No.
- 2010-08-21 20:16:16下载
- 积分:1
-
pca_2d
MATLAB自已编的二维DLA,基于ORL人脸数据库,效果不错。(MATLAB own series of two-dimensional DLA, based on the ORL face database, good results.)
- 2008-06-19 09:41:08下载
- 积分:1