In this paper an algorithm for optimizing coefficients of a Finite Impulse Response (FIR) filter, so as to reduce power dissipation of its implementation on a programmable Digital Signal Processor is presented. We then present an algorithm that optimizes coefficients so as to minimize the Hamming distance and signal toggling. Two such techniques „Steepest descent‟ and „Genetic Algorithm‟ are pr...

We enumerate possible topologies of pseudoknots in single-stranded RNA molecules. We use a steepest-descent approximation in the large N matrix field theory, and a Feynman diagram formalism to describe the resulting pseudoknot structure. An RNA molecule is a heteropolymer strand made up of four types of nucleotides, uracil (U), adenine (A), guanine (G), and cytosine (C). The sequence of these n...

An algorithm is proposed for training the single-layered perceptron. The algorithm follows successive steepest descent directions with respect to the perceptron cost function, taking care not to increase the number of misclassified patterns. The problem of finding these directions is stated as a quadratic programming task, to which a fast and effective solution is proposed. The resulting algori...

A general framework is proposed for the study of real-time algorithms. The framework uniies previous algorithmic deenitions of real-time computation. In it, state space traversal is used as a model for computational problems in a real-time environment. The proposed framework also employs a paradigm, known as discrete steepest descent, for algorithms designed to solve these problems. Sequential ...