88,832 research outputs found
Imprecise Markov Models for Scalable and Robust Performance Evaluation of Flexi-Grid Spectrum Allocation Policies
The possibility of flexibly assigning spectrum resources with channels of
different sizes greatly improves the spectral efficiency of optical networks,
but can also lead to unwanted spectrum fragmentation.We study this problem in a
scenario where traffic demands are categorised in two types (low or high
bit-rate) by assessing the performance of three allocation policies. Our first
contribution consists of exact Markov chain models for these allocation
policies, which allow us to numerically compute the relevant performance
measures. However, these exact models do not scale to large systems, in the
sense that the computations required to determine the blocking
probabilities---which measure the performance of the allocation
policies---become intractable. In order to address this, we first extend an
approximate reduced-state Markov chain model that is available in the
literature to the three considered allocation policies. These reduced-state
Markov chain models allow us to tractably compute approximations of the
blocking probabilities, but the accuracy of these approximations cannot be
easily verified. Our main contribution then is the introduction of
reduced-state imprecise Markov chain models that allow us to derive guaranteed
lower and upper bounds on blocking probabilities, for the three allocation
policies separately or for all possible allocation policies simultaneously.Comment: 16 pages, 7 figures, 3 table
Linear Precoding for MIMO Channels with QAM Constellations and Reduced Complexity
In this paper, the problem of designing a linear precoder for Multiple-Input
Multiple-Output (MIMO) systems in conjunction with Quadrature Amplitude
Modulation (QAM) is addressed. First, a novel and efficient methodology to
evaluate the input-output mutual information for a general Multiple-Input
Multiple-Output (MIMO) system as well as its corresponding gradients is
presented, based on the Gauss-Hermite quadrature rule. Then, the method is
exploited in a block coordinate gradient ascent optimization process to
determine the globally optimal linear precoder with respect to the MIMO
input-output mutual information for QAM systems with relatively moderate MIMO
channel sizes. The proposed methodology is next applied in conjunction with the
complexity-reducing per-group processing (PGP) technique, which is
semi-optimal, to both perfect channel state information at the transmitter
(CSIT) as well as statistical channel state information (SCSI) scenarios, with
high transmitting and receiving antenna size, and for constellation size up to
. We show by numerical results that the precoders developed offer
significantly better performance than the configuration with no precoder, and
the maximum diversity precoder for QAM with constellation sizes , and
and for MIMO channel size
Interpolated-DFT-Based Fast and Accurate Amplitude and Phase Estimation for the Control of Power
The quality of energy produced in renewable energy systems has to be at the
high level specified by respective standards and directives. The estimation
accuracy of grid signal parameters is one of the most important factors
affecting this quality. This paper presents a method for a very fast and
accurate amplitude and phase grid signal estimation using the Fast Fourier
Transform procedure and maximum decay sidelobes windows. The most important
features of the method are the elimination of the impact associated with the
conjugate's component on the results and the straightforward implementation.
Moreover, the measurement time is very short - even far less than one period of
the grid signal. The influence of harmonics on the results is reduced by using
a bandpass prefilter. Even using a 40 dB FIR prefilter for the grid signal with
THD = 38%, SNR = 53 dB and a 20-30% slow decay exponential drift the maximum
error of the amplitude estimation is approximately 1% and approximately 0.085
rad of the phase estimation in a real-time DSP system for 512 samples. The
errors are smaller by several orders of magnitude for more accurate prefilters.Comment: in Metrology and Measurement Systems, 201
Run Time Approximation of Non-blocking Service Rates for Streaming Systems
Stream processing is a compute paradigm that promises safe and efficient
parallelism. Modern big-data problems are often well suited for stream
processing's throughput-oriented nature. Realization of efficient stream
processing requires monitoring and optimization of multiple communications
links. Most techniques to optimize these links use queueing network models or
network flow models, which require some idea of the actual execution rate of
each independent compute kernel within the system. What we want to know is how
fast can each kernel process data independent of other communicating kernels.
This is known as the "service rate" of the kernel within the queueing
literature. Current approaches to divining service rates are static. Modern
workloads, however, are often dynamic. Shared cloud systems also present
applications with highly dynamic execution environments (multiple users,
hardware migration, etc.). It is therefore desirable to continuously re-tune an
application during run time (online) in response to changing conditions. Our
approach enables online service rate monitoring under most conditions,
obviating the need for reliance on steady state predictions for what are
probably non-steady state phenomena. First, some of the difficulties associated
with online service rate determination are examined. Second, the algorithm to
approximate the online non-blocking service rate is described. Lastly, the
algorithm is implemented within the open source RaftLib framework for
validation using a simple microbenchmark as well as two full streaming
applications.Comment: technical repor
- …