-
The ability to write efficient, high-speed arithmetic routines ultimately depends
upon your knowledge of the elements of arithmetic as they exist on a computer. That
conclusion and this book are the result of a long and frustrating search for
information on writing arithmetic routines for real-time embedded systems.
With instruction cycle times coming down and clock rates going up, it would
seem that speed is not a problem in writing fast routines. In addition, math
coprocessors are becoming more popular and less expensive than ever before and are
readily available. These factors make arithmetic easier and faster to use and
implement. However, for many of you the systems that you are working on do not
include the latest chips or the faster processors. Some of the most widely used
microcontrollers used today are not Digital Signal Processors (DSP), but simple
eight-bit controllers such as the Intel 8051 or 8048 microprocessors.
標(biāo)簽：
arithmetic
high-speed
ultimately
efficient
上傳時間：
2014-11-30
上傳用戶：lizhen9880
-
Carrier-phase synchronization can be approached in a
general manner by estimating the multiplicative distortion (MD) to which
a baseband received signal in an RF or coherent optical transmission
system is subjected. This paper presents a unified modeling and
estimation of the MD in finite-alphabet digital communication systems. A
simple form of MD is the camer phase exp GO) which has to be estimated
and compensated for in a coherent receiver. A more general case with
fading must, However, allow for amplitude as well as phase variations of
the MD.
We assume a state-variable model for the MD and generally obtain a
nonlinear estimation problem with additional randomly-varying system
parameters such as received signal power, frequency offset, and Doppler
spread. An extended Kalman filter is then applied as a near-optimal
solution to the adaptive MD and channel parameter estimation problem.
Examples are given to show the use and some advantages of this scheme.
標(biāo)簽：
synchronization
Carrier-phase
multiplicativ
approached
上傳時間：
2013-11-28
上傳用戶：windwolf2000
-
Rao-Blackwellised Particle Filters (RBPFs) are a class of Particle
Filters (PFs) that exploit conditional dependencies between
parts of the state to estimate. By doing so, RBPFs can
improve the estimation quality while also reducing the overall
computational load in comparison to original PFs. However,
the computational complexity is still too high for many
real-time applications. In this paper, we propose a modified
RBPF that requires a single Kalman Filter (KF) iteration per
input sample. Comparative experiments show that while good
convergence can still be obtained, computational efficiency is
always drastically increased, making this algorithm an option
to consider for real-time implementations.
標(biāo)簽：
Particle
Filters
Rao-Blackwellised
exploit
上傳時間：
2016-01-02
上傳用戶：refent
-
This a large book, and your class will probably cover only a portion of its material. We
have tried, However, to make this a book that will be useful to you now as a course textbook
and also later in your career as a mathematical desk reference or an engineering handbook
標(biāo)簽：
probably
material
portion
large
上傳時間：
2016-01-14
上傳用戶：wendy15
-
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.
標(biāo)簽：
represented
integers
group
items
上傳時間：
2016-01-17
上傳用戶：jeffery
-
OpenSVM was developped under Visual C++ 6.0 SP6,
You can open the workspace file(*.dsw) in the opensvm-src folder.
The folder include the svm.h and svm.cpp which in the libsvm (Copyright (c) 2000-2007 Chih-Chung Chang and Chih-Jen Lin All rights reserved) in the opensvm-src\libsvm.
However, the files svm.h and svm.cpp codes were copied/merged into stdafx.h and stdafx.cpp in order to support the development, and OpenSVM still use other codes of libsvm.
So you can see the libsvm package in the source package.
You can open and build it with Visual C++ 6.0.
Note: the problems must be in LIBSVM format.
OpenSVM project page:
http://sourceforge.net/projects/opensvm
If you had any question, please mail to:
cloudbyron@gmail.com
標(biāo)簽：
developped
the
workspace
OpenSVM
上傳時間：
2016-01-30
上傳用戶：asdfasdfd
-
ASP開發(fā)指南,里面的西很不錯的喲.This book is for anyone who wants to learn about using .NET for web interface design. Beginner or
hobbyist .NET developers can certainly get a good foundation of .NET web interface design by going
through this book from cover to cover. However, more seasoned .NET professionals, especially if they
tend to steer away from the GUI of their projects, can also pick up a thing or two by focusing on certain
chapters that appeal to them. This book is meant to take a reader from the beginning of a project to the
completion of the interface design. Along the way, concepts are illustrated to show how the different
pieces play together. So, anyone who really wants to understand the concepts presented in this book will
be able to do so by reading the entire thing. However, this book should also serve as a good reference
after you have read it or, in some cases, in place of reading it.
標(biāo)簽：
for
interface
anyone
about
上傳時間：
2016-02-16
上傳用戶：sjyy1001
-
This template file is used to completely describe a system in a generalized
％ state space format useable by the ReBEL inference and estimation system.
％ This file must be copied, renamed and adapted to your specific problem. The
％ interface to each function should NOT BE CHANGED However.
標(biāo)簽：
generalized
completely
template
describe
上傳時間：
2014-01-10
上傳用戶：hustfanenze
-
Obtain the CDF plots of PAPR from an OFDM BPSK transmission specified per IEEE 802.11a specification
Per the IEEE 802.11a specifications, we 52 have used subcarriers. Given so, the theoretical maximum expected PAPR is 52 (around 17dB). However, thanks to the scrambler, all the subcarriers in an OFDM symbol being equally modulated is unlikely.
Using a small script, the cumulative distribution of PAPR from each OFDM symbol, modulated by a random BPSK signal is obtained
標(biāo)簽：
specification
transmission
specified
Obtain
上傳時間：
2016-04-24
上傳用戶：haoxiyizhong
-
移動ip書籍，很有用。
Third Generation (3G) mobile offers access to broadband multimedia services - and in the future most of these, even voice and video, will be IP-based. However 3G networks are not based on IP technologies, rather they are an evolution from existing 2G networks. Much work needs to be done to IP QoS and mobility protocols and architectures for them to be able to provide the functionality 3G requires.
標(biāo)簽：
移動
書籍
上傳時間：
2013-12-16
上傳用戶：moerwang
