Individual files are available in the following links:
Bessjy -- Bessel functions Jn and Yn for real argument and integer or real order.
Bessik -- modified Bessel function In and Kn for real argument and integer or real order.
CBessjy -- Bessel functions Jv and Yv for real or complex arguments and real order.
CBessik -- modified Bessel functions Iv and Kv for complex arguments and real order.
* DEFINITION
* This is the header file for a library module used to calculate the median
* of a list of values. It finds the value that would be in the center if
* the list were sorted. If the list contains an even number of values, the
* lower of the two center values is reported. The values themselves are not
* sorted or modified in any way. This algorithm can be used as a filtering
* tool for rejecting noisy data.
This code was used for making the practical measurements in section 2.3 of my thesis. This Matlab code allows an OFDM signal to be generated based on an input data file. The data can be random data, a grey scale image, a wave file, or any type of file. The generated OFDM signal is stored as a windows wave file, allowing it to be viewed, listened to and manipulated in other programs. The modified wave file can then be decoded by the receiver software to extract the original data. This code was developed for the experiments that I performed in my honours thesis, and thus has not been fully debugged.
This is the original code developed for the thesis and so has several problems with it. The BER performance given by the simulations is infact Symbol Error Rate.
％WAVETEST Example Matlab script for WAVELET, using NINO3 SST dataset
％
％ See "http://paos.colorado.edu/research/wavelets/"
％ Written January 1998 by C. Torrence
％
％ modified Oct 1999, changed Global Wavelet Spectrum (GWS) to be sideways,
％ changed all "log" to "log2", changed logarithmic axis on GWS to
％ a normal axis.
In a preemptive priority based RTOS, priority inversion
problem is among the major sources of deadline
violations. Priority inheritance protocol is one of the
approaches to reduce priority inversion. Unfortunately,
RTOS like uC/OS can’t support priority inheritance
protocol since it does not allow kernel to have multiple
tasks at the same priority. Although it has different ways
to avoid priority inversion such as priority ceiling
protocol, developers still have some difficulties in
programming real time applications with it. In this paper,
we redesign the uC/OS kernel to provide the ability to
support round robin scheduling and implement priority
inheritance semaphore on the modified kernel. As result,
we port new kernel with priority inheritance semaphore to
evaluation board, and evaluate the execution time of each
of the kernel service as well as verify the operations of
our implementation.
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.
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.
Synthesizable FIFO Model
This example describes a synthesizable implementation of a FIFO. The FIFO depth and FIFO width in bits can be modified by simply changing the value of two parameters, `FWIDTH and `FDEPTH. For this example, the FIFO depth is 4 and the FIFO width is 32 bits.
μC/OS-II Goals
Probably the most important goal of μC/OS-II was to make it backward compatible with μC/OS (at least from an
application’s standpoint). A μC/OS port might need to be modified to work with μC/OS-II but at least, the application
code should require only minor changes (if any). Also, because μC/OS-II is based on the same core as μC/OS, it is just
as reliable. I added conditional compilation to allow you to further reduce the amount of RAM (i.e. data space) needed
by μC/OS-II. This is especially useful when you have resource limited products. I also added the feature described in
the previous section and cleaned up the code.
Where the book is concerned, I wanted to clarify some of the concepts described in the first edition and provide
additional explanations about how μC/OS-II works. I had numerous requests about doing a chapter on how to port
μC/OS and thus, such a chapter has been included in this book for μC/OS-II.
This program simulates plant identification using frequency block least mean square (FBLMS) alogrithm
reference: 《LMS算法的頻域快速實現(xiàn)》 LMS is modified by XXX in XXX place, see details in XXX relevant document
