Equalisation with adaptive time lag

In an adaptive equaliser, the time lag is an important parameter that significantly influences the performance. Only with the optimum time lag that corresponds to the best minimum-mean-square-error (MMSE) performance, can there be best use of the available resources. Many designs, however, choose the time lag either based on preassumption of the channel or simply based on average experience. The relation between the MMSE performance and the time lag is investigated using a new interpretation of the MMSE equaliser, and then a novel adaptive time lag algorithm is proposed based on gradient search. The proposed algorithm can converge to the optimum time lag in the mean and is verified by the numerical simulations provided.

Second-Order Training of Adaptive Critics for Online Process Control

A new algorithm for training of nonlinear optimal neuro-controllers (in the form of the model-free, action-dependent, adaptive critic paradigm). Overcomes problems with existing stochastic backpropagation training: need for data storage, parameter shadowing and poor convergence, offering significant benefits for online applications.

Making doors open: caring for families of children with severe cerebral palsy

Cerebral palsy is a relatively rare condition affecting approximately 2-2.5 children in every 1,000 (Parkes et al 2001). It is a leading cause of physical disability in childhood and is often associated with severe motor and other impairments (Table 1). Improved survival of small and premature babies who are particularly at risk of developing the condition raises concerns about increasing numbers of children with cerebral palsy possibly with more severe forms. In the UK, information about the number and needs of children with CP is not collected routinely. The most reliable sources of information on CP in the UK comes from five dedicated case registers which have monitored live births in their respective geographically defined areas since the 1960s and 1970s. These registers have formed a collaborative network called the United Kingdom Collaboration of Cerebral Palsy Registers (or UKCP) and are listed in Table 2. All five registers are currently funded and all are active in surveillance activities and research.

Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems

A new search-space-updating technique for genetic algorithms is proposed for continuous optimisation problems. Other than gradually reducing the search space during the evolution process with a fixed reduction rate set ‘a priori’, the upper and the lower boundaries for each variable in the objective function are dynamically adjusted based on its distribution statistics. To test the effectiveness, the technique is applied to a number of benchmark optimisation problems in comparison with three other techniques, namely the genetic algorithms with parameter space size adjustment (GAPSSA) technique [A.B. Djurišic, Elite genetic algorithms with adaptive mutations for solving continuous optimization problems – application to modeling of the optical constants of solids, Optics Communications 151 (1998) 147–159], successive zooming genetic algorithm (SZGA) [Y. Kwon, S. Kwon, S. Jin, J. Kim, Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Computers and Structures 81 (2003) 1715–1725] and a simple GA. The tests show that for well-posed problems, existing search space updating techniques perform well in terms of convergence speed and solution precision however, for some ill-posed problems these techniques are statistically inferior to a simple GA. All the tests show that the proposed new search space update technique is statistically superior to its counterparts.

Virtex FPGA Implementation of a Pipelined Adaptive LMS Predictor for Electronic Support Measures Receivers

High-speed field-programmable gate array (FPGA) implementations of an adaptive least mean square (LMS) filter with application in an electronic support measures (ESM) digital receiver, are presented. They employ "fine-grained" pipelining, i.e., pipelining within the processor and result in an increased output latency when used in the LMS recursive system. Therefore, the major challenge is to maintain a low latency output whilst increasing the pipeline stage in the filter for higher speeds. Using the delayed LMS (DLMS) algorithm, fine-grained pipelined FPGA implementations using both the direct form (DF) and the transposed form (TF) are considered and compared. It is shown that the direct form LMS filter utilizes the FPGA resources more efficiently thereby allowing a 120 MHz sampling rate.

Fairness measurement for adaptive packet schedulers

An equation is presented for calculating the fairness of dynamically adaptive packet schedulers such as dynamic weighted fair queuing (DWFQ). The fairness of static packet schedulers such as weighted fair queue (WFQ) can be found using the widely accepted Worst-case Fair Index. The fairness of DWFQ can be measured using an Adapted Worst-case Fairness Index (AWFI). The AWFI enables a direct comparison of fairness properties of the DWFQ or other dynamically adaptive schedulers with static/non-adaptive schedulers.