Dynamic Programming and Travelling Salesman Problem Using Octave GNU Tool . 1. Introduction Dynamic programming was developed by Richard Bellman (see the [1], [2]) in the fifties of the twentieth century and occupies an important place for solving optimization problems,… Read More
Monte Carlo Method Using Octave GNU Tool 1. Abbreviation 2. Introduction The Monte Carlo method is a numerical method for solving mathematical problems by modeling random variables using pseudo random numbers. I used the Octave Tool for my calculations. See… Read More
Overview of Search with C Source Code 1. Introduction A common task in programming is to search for some record in memory. This task is called data search. In the classical formulation of the problem, there are entries in computer… Read More
Bose–Chaudhuri–Hocquenghem (BCH) code: (15, 5, 7) and C Implementation Using the Octave GNU Tool 1. Abbreviation 2. Introduction This article is a continuation of the article: “Hamming Code and C Implementation Using the Octave GNU Tool” and “Hadamard Codes and… Read More
Hadamard Codes and C Implementation Using the Octave GNU Tool 1. Abbreviation 2. Introduction This article is a continuation of the article: “Hamming Codes and C Implementation Using the Octave GNU Tool”. Hamming codes, despite their elegance, can only fix… Read More
Hamming Codes and C Implementation Using the Octave GNU Tool 1. Abbreviation 2. Introduction It is necessary often to ensure reliable data transmission or storage in Digital Signal Processing applications. Data will be understood messages (code words) containing zeros (0)… Read More
Digital Integrators with an Examples. C Code and Octave Script 1. Abbreviation 2. Introduction It follows from (2) that the transfer function of the analog ideal integrator: or in the frequency space of (7), (10): Then the magnitude… Read More
The Numerical Solution of Partial Differential Equations with an Example. C Code and Octave Script 1. Abbreviation 2. Introduction Most partial differential equations cannot be solved analytically (in exact) form, therefore numerical (approximate) solution methods are used. In… Read More
The Runge-Kutta and Hamming Methods for Numerical Solution of Ordinary Differential Equations with an Example. C Code and Octave Script 1. Abbreviation 2. Introduction Most differential equations cannot be solved analytically (in exact) form, so various numerical (approximate)… Read More
Modal Synthesis Method for Control Systems with an Example. C Code and Octave Script 1. Abbreviation 2. Introduction The modal synthesis method is based on the selection of suitable roots of a characteristic linear differential equation for a closed loop… Read More