Search results for "ALGORITHM"
showing 10 items of 4887 documents
Deconvolution by Regularized Matching Pursuit
2014
In this chapter, an efficient method that restores signals from strongly noised blurred discrete data is presented. The method can be characterized as a Regularized Matching Pursuit (RMP), where dictionaries consist of spline wavelet packets. It combines ideas from spline theory, wavelet analysis and greedy algorithms. The main distinction from the conventional matching pursuit is that different dictionaries are used to test the data and to approximate the solution. In addition, oblique projections of data onto dictionary elements are used instead of orthogonal projections, which are used in the conventional Matching Pursuit (MP). The slopes of the projections and the stopping rule for the …
Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems
2012
SUMMARY The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector multiplication is the most time-consuming operation. The necessity to accelerate this step is motivated by the application of BW to very large matrices used in the linear algebra step of the number field sieve (NFS) for integer factorization. In this paper, we derive an efficient CUDA implementation of this operation by using a newly designed hybrid sparse matrix format. This leads to speedups between 4 and 8 on a single graphics processing unit (GPU) for a number of tested NFS matrices compared with an optimized multicore implementation. We further present…
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
Channel Estimation and Interference Cancellation for MIMO-OFDM Systems
2007
This paper proposes a new channel estimation method and a new interference cancellation scheme for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems in the presence of intersymbol interference (IS1). The proposed channel estimation method uses special training sequences (TSs) to have a desirable crest-factor of the transmitted training signal, and to prevent the influence of ISI on the channel estimation performance. By using the recommended training sequences, the ill-conditioned problem of the least square (LS) filter integrated in the proposed channel estimator can be avoided. The proposed interference cancellation scheme uses the estimated cha…
Performance Analysis of STBC-OFDM Systems in Temporally or Spatially Correlated Fading Channels
2010
This paper analyzes the performance of space-time block coded orthogonal frequency division multiplexing (OFDM) systems. In our analysis, we abandon the usually made assumption of quasi-static channel conditions. Instead of this, we consider the more general and realistic case that the channel envelope changes during two consecutive transmission time slots. In addition, we take the spatial correlation between sub-channels into account. We first present a general formal expression for the bit error probability (BEP), from which we find analytical solutions for the BEP not only for temporally fading channels but also for spatially correlated channels. The knowledge of the obtained analytical …
Design of efficient codes for the AWGN channel based on decomposable binary lattices
1998
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.
The influence of different generations of computer algorithms on diabetes control
1990
With all control schedules, the management of diabetes is possible using Skyler's algorithm. In general, those control algorithms which do not allow the individual adaptation to changing conditions lead to overinsulinisation. So-called meal-related algorithms do usually minimise the fluctuations in blood sugar. The introduction of self-adapting algorithms, detecting peripheral insulin resistance, may further improve metabolic diabetes control.
Real-time estimation of plasma insulin concentration from continuous glucose monitor measurements
2015
Continuous glucose monitors can measure interstitial glucose concentration in real time for closed-loop glucose control systems, known as artificial pancreas. These control systems use an insulin feedback to maintain plasma glucose concentration within a narrow and safe range, and thus to avoid health complications. As it is not possible to measure plasma insulin concentration in real time, insulin models have been used in literature to estimate them. Nevertheless, the significant interand intra-patient variability of insulin absorption jeopardizes the accuracy of these estimations. In order to reduce these limitations, our objective is to perform a real-time estimation of plasma insulin co…
Extensive Assessment of Blood Glucose Monitoring During Postprandial Period and Its Impact on Closed-Loop Performance.
2017
[EN] Background: Closed-loop (CL) systems aims to outperform usual treatments in blood glucose control and continuous glucose monitors (CGM) are a key component in such systems. Meals represents one of the main disturbances in blood glucose control, and postprandial period (PP) is a challenging situation for both CL system and CGM accuracy. Methods: We performed an extensive analysis of sensor¿s performance by numerical accuracy and precision during PP, as well as its influence in blood glucose control under CL therapy. Results: During PP the mean absolute relative difference (MARD) for both sensors presented lower accuracy in the hypoglycemic range (19.4 ± 12.8%) than in other ranges (12.2…
A Multiple Local Models Approach to Accuracy Improvement in Continuous Glucose Monitoring
2011
Continuous glucose monitoring (CGM) devices estimate plasma glucose (PG) from measurements in compartments alternative to blood. The accuracy of currently available CGM is yet unsatisfactory and may depend on the implemented calibration algorithms, which do not compensate adequately for the differences of glucose dynamics between the compartments. Here we propose and validate an innovative calibration algorithm for the improvement of CGM performance.CGM data from GlucoDay(®) (A. Menarini, Florence, Italy) and paired reference PG have been obtained from eight subjects without diabetes during eu-, hypo-, and hyperglycemic hyperinsulinemic clamps. A calibration algorithm based on a dynamic glo…