This paper examines the asymptotic (large sample) performance of a family of non-data aided feedforward (NDA FF) nonlinear least-squares (NLS) type carrier frequency estimators for burst-mode phase shift keying (PSK) modulations transmitted through AWGN and flat Ricean-fading channels. The asymptotic performance of these estimators is established in closed-form expression and compared with the modified Cram`er-Rao bound (MCRB). A best linear unbiased estimator (BLUE), which exhibits the lowest asymptotic variance within the family of NDA FF NLS-type estimators, is also proposed.
標簽： performance asymptotic examines non-data
上傳時間： 2015-12-30
上傳用戶：225588
In recent years large scientific interest has been devoted to joint data decoding and parameter estimation techniques. In this paper, iterative turbo decoding joint to channel frequency and phase estimation is proposed. The phase and frequency estimator is embedded into the structure of the turbo decoder itself, taking into consideration both turbo interleaving and puncturing. Results show that the proposed technique outperforms conventional approaches both in terms of detection capabilities and implementation complexity.
標簽： scientific parameter interest decoding
上傳時間： 2015-12-30
上傳用戶：894898248
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
上傳用戶：大三三
We present a particle filter construction for a system that exhibits time-scale separation. The separation of time-scales allows two simplifications that we exploit: i) The use of the averaging principle for the dimensional reduction of the system needed to solve for each particle and ii) the factorization of the transition probability which allows the Rao-Blackwellization of the filtering step. Both simplifications can be implemented using the coarse projective integration framework. The resulting particle filter is faster and has smaller variance than the particle filter based on the original system. The convergence of the new particle filter to the analytical filter for the original system is proved and some numerical results are provided.
標簽： construction separation time-scale particle
上傳時間： 2016-01-02
上傳用戶：fhzm5658
轉載一個程序。 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
上傳用戶：爺的氣質
Microsoft.NET測試驅動開發 Test-Driven Development in Microsoft .NET by James W. Newkirk and Alexei A. Vorontsov ISBN:0735619484 Microsoft Press © 2004 Using a wealth of pragmatic examples in C# and other .NET development tools, the two authors of this text demonstrate how to use automated tests to drive lean, efficient coding and better design.
標簽： Microsoft A. W. Development
上傳時間： 2014-01-07
上傳用戶：ynzfm
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
FIST可堆疊文件系統，linux文件系統修改相關的開源軟件，使得對linux文件系統功能的改進很簡單了 The FiST (File System Translator) system combines two methods to solve the above problems in a novel way: a set of stackable file system templates for each operating system, and a high-level language that can describe stackable file systems in a cross-platform portable fashion. Using FiST, stackable file systems need only be described once. FiST s code generation tool, fistgen, compiles a single file system description into loadable kernel modules for several operating systems (currently Solaris, Linux, and FreeBSD). The project demonstrates that with FiST, code size and development time are reduced significantly, while imposing a small performance overhead of only 1-2％. These benefits are achieved, as well as portability, without changing existing operating systems or file system.
上傳時間： 2014-01-10
上傳用戶：xsnjzljj
This the third edition of the Writing Device Drivers articles. The first article helped to simply get you acquainted with device drivers and a simple framework for developing a device driver for NT. The second tutorial attempted to show to use IOCTLs and display what the memory layout of Windows NT is. In this edition, we will go into the idea of contexts and pools. The driver we write today will also be a little more interesting as it will allow two user mode applications to communicate with each other in a simple manner. We will call this the “poor man’s pipes” implementation.
標簽： the articles Drivers edition
上傳時間： 2014-01-16
上傳用戶：ommshaggar
Solving Engineering Problems Using MATLAB C++ Math Library Introduction In the previous article, we studied how can use MATLAB C API to solve engineering problems. In this article I will show you how can use MATLAB C++ math library. The MATLAB® C++ Math Library serves two separate constituencies: MATLAB programmers seeking more speed or complete independence from interpreted MATLAB, and C++ programmers who need a fast, easy-to-use matrix math library. To each, it offers distinct advantages.
標簽： Introduction Engineering Problems previous
上傳時間： 2014-12-02
上傳用戶：13160677563
<button id="8ww8y"></button> <center id="8ww8y"></center>