1,Check data in two files and report the error 2,Calculate the pay and report.
上传时间： 2016-05-06
上传用户：wanghui2438
There are two files in the zip folder. bpsk_spread.m and jakesmodel.m Steps for simulation: 1] Run jakesmodel.m first 2] Then run bpsk_spread.m . 3] Note that during the first run bpsk_spread.m has no rayleigh fading.This is because the corresponding code has been commented 4] The resulting performance is stored in BER_awgn. 5] Now uncomment the Rayleigh Fading code in bpsk_spread.m file. 6] Same time comment BER_awgn (line 112) and uncomment BER_ray variable. 7] Run the simulation. To compare the perfromances of the receiver using DSSS plot the BER_awgn and BER_ray
标签： bpsk_spread jakesmodel simulation folder
上传时间： 2016-05-19
上传用户：ynsnjs
经典原版教材 Computer.Architecture.-.A.Quantitative.Approach.4th.ed.-.J.Hennessy,.D.Patterson.(Elsevier,.2007)
标签： Architecture Quantitative Patterson Computer
上传时间： 2016-05-20
上传用户：上善若水
快速傅里叶变换（FFT）算法。FFT - Fast Fourier transform. The length of X must be a power of two, for a fast radix-2 fast-Fourier transform algorithm is used
标签： FFT transform Fourier length
上传时间： 2013-12-19
上传用户：sy_jiadeyi
杭电 ACM 1002 I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
标签： integers problem calcul simple
上传时间： 2014-01-12
上传用户：dave520l
it includes two codes,they can recode the keyborad information
标签： information includes keyborad recode
上传时间： 2014-01-01
上传用户：WMC_geophy
java Labyrinth game；Provides two kinds to produce map s way stochastically: The stochastic distribution point method and the chart depth first traversal the law two kinds.It can searches the shortest way to demonstrate automatically
标签： stochastically stochastic Labyrinth distribut
上传时间： 2016-06-13
上传用户：qilin
Thinking in Java, 3rd ed. 即JAVA编程思想第三版，很经典的书。包括pdf格式的和chm格式的。
上传时间： 2013-12-27
上传用户：alan-ee
Wiley-Beginning Linux Programming, 3rd Ed (891 pages) - 2004 !! - (By Laxxuss)这本书上所有的源代码
标签： Wiley-Beginning Programming Laxxuss Linux
上传时间： 2014-01-17
上传用户：yimoney
中南赛区ACM竞赛题 Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle.
标签： two-dimensional Description negative integers
上传时间： 2013-12-22
上传用户：lijianyu172
