This my phd thesis for the WDM optical network optimization, which employs convex optimization techniques to solve the proposed integer problems. The computation complexity of my optimization framework is very low compared with other existing method and a performance bound is provided at the same time.
标签: optimization employs optical network
上传时间: 2015-12-27
上传用户:dongbaobao
% because we do not truncate and shift the convolved input % sequence, the delay of the desired output sequence wrt % the convolved input sequence need only be the delay % introduced by the ideal weight vector centred at n=5
标签: the convolved truncate sequence
上传时间: 2015-12-27
上传用户:www240697738
We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude modulation, phase-shift keying, and pulse amplitude modulation communications systems.We study the performance of a standard CFO estimate, which consists of first raising the received signal to the Mth power, where M is an integer depending on the type and size of the symbol constellation, and then applying the nonlinear least squares (NLLS) estimation approach. At low signal-to noise ratio (SNR), the NLLS method fails to provide an accurate CFO estimate because of the presence of outliers. In this letter, we derive an approximate closed-form expression for the outlier probability. This enables us to predict the mean-square error (MSE) on CFO estimation for all SNR values. For a given SNR, the new results also give insight into the minimum number of samples required in the CFO estimation procedure, in order to ensure that the MSE on estimation is not significantly affected by the outliers.
标签: frequency-offset estimation quadrature amplitude
上传时间: 2014-01-22
上传用户:牛布牛
An unsatisfactory property of particle filters is that they may become inefficient when the observation noise is low. In this paper we consider a simple-to-implement particle filter, called ‘LIS-based particle filter’, whose aim is to overcome the above mentioned weakness. LIS-based particle filters sample the particles in a two-stage process that uses information of the most recent observation, too. Experiments with the standard bearings-only tracking problem indicate that the proposed new particle filter method is indeed a viable alternative to other methods.
标签: unsatisfactory inefficient property particle
上传时间: 2014-01-11
上传用户:大三三
Source code of J2ME game called Action Soccer. Great for used. Already configurations with JBuilder Source only, no document related.
标签: configurations JBuilder Already Source
上传时间: 2016-01-08
上传用户:fanboynet
A action mobile game called A Last Warrior Great for use and already configuration to build with JBuilder Is source only, no document related
标签: configuration Warrior already action
上传时间: 2014-05-28
上传用户:changeboy
这两个函数 function app_path1:string function socket_rec_line1(socket1:TCustomWinSocket timeout1:integer crlf1:string=#13#10):string 实际上是我的一个公用单元中的函数,大家应该养成建立自己的公用单元的习惯。 socket_rec_line1函数中用了唐晓峰大侠的coolmail中的办法:只是简单的一个一个字节收取,找到结束 标志后就算收完一行了,大家实际应用时可能应该找更好的办法。 这个程序的目的是:flashget在下载象51.net系列[如我的clq.51.net]中的程序时,会因为这些网站上的 自定义错误页面而导致下载的文件出错,具体见“大富翁”上的 “http://www.delphibbs.com/delphibbs/dispq.asp?lid=1170159” 虽然这是一个演示程序,不能下载地址转向的东东。但对于固定地址文件的下载已经很不错了,我的公司 不能装多线程的东东我一直用这个下载我要的大文件,“大富翁”200多M的离线数据这是用它下载的。
标签: function TCustomWinSocket socket_rec_line app_path
上传时间: 2016-01-10
上传用户:hakim
转载一个程序。 This zip file contains a example of using C++ language COM in a Visual C++ program (named example.zip), and a COM component built by comtool of Matlab and used in a Visual C++ program(named mycom.zip). Both projects contain fire_event in COM. But it only works well in the former example. The interface of two COM components looks very similar, and the client program of two projects are almost the same.
标签: contains language example program
上传时间: 2014-08-28
上传用户:爺的气质
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
标签: represented integers group items
上传时间: 2016-01-17
上传用户:jeffery
图形显示技巧,这是其中一段代码 procedure TForm1.Button1Click(Sender: TObject) var newbmp:TBitmap i,bmpheight,bmpwidth:integer //推拉 begin newbmp:=TBitmap.Create newbmp.Width:=image1.Width newbmp.Height:=image1.Height bmpheight:=image1.Height bmpwidth:=image1.Width for i:=0 to bmpheight do begin newbmp.Canvas.CopyRect(Rect(0,bmpheight-i,bmpwidth,bmpheight),image1.Canvas,Rect(0,0,bmpwidth,i)) form1.Canvas.Draw(120,100,newbmp) end newbmp.free end
标签: procedure TBitmap TObject Button
上传时间: 2016-01-18
上传用户:comua