... home ...

algorithms: Definition and Recommended Links

Our favorite links for this topic area. Enjoy, fellow researchers! Questions, comments, new links? Email eewindow@aol.com!.

In mathematics, computing, linguistics and related disciplines, an algorithm is a sequence of instructions, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task will, when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness.

A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the 'decision problem') posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define 'effective calculability' (Kleene 1943:274) or 'effective method' (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's 'Formulation I' of 1936, and Alan Turing's Turing machines of 1936-7 and 1939. In mathematics, computing, linguistics and related disciplines, an algorithm is a sequence of instructions, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task will, when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness. A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the 'decision problem') posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define 'effective calculability' (Kleene 1943:274) or 'effective method' (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's 'Formulation I' of 1936, and Alan Turing's Turing machines of 1936-7 and 1939.

Source: Wikipedia (http://en.wikipedia.org/wiki/Algorithm)

other great electronics sites:ee toolbox site

• • algorithms
    • In mathematics, computing, linguistics and related disciplines, an algorithm is a sequence of instructions, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task will, when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness.

      A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the 'decision problem') posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define 'effective calculability' (Kleene 1943:274) or 'effective method' (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's 'Formulation I' of 1936, and Alan Turing's Turing machines of 1936-7 and 1939. In mathematics, computing, linguistics and related disciplines, an algorithm is a sequence of instructions, often used for calculation and data processing. It is formally a type of effective method in which a list of well-defined instructions for completing a task will, when given an initial state, proceed through a well-defined series of successive states, eventually terminating in an end-state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as probabilistic algorithms, incorporate randomness. A partial formalization of the concept began with attempts to solve the Entscheidungsproblem (the 'decision problem') posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define 'effective calculability' (Kleene 1943:274) or 'effective method' (Rosser 1939:225); those formalizations included the Gödel-Herbrand-Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's 'Formulation I' of 1936, and Alan Turing's Turing machines of 1936-7 and 1939.

      Source: Wikipedia (http://en.wikipedia.org/wiki/Algorithm)

      (Note: The Electronic Engineers Toolbox provides an alternative set of featured links for this word at http://www.cera2.com/algorithms.htm)

      Featured Links:

      The MathWorks - DSP/Communication Design Demos

      Video and Image Processing Video Stabilization People Tracking Tracking Cars in Video Analysis & Design Bit Error Rate Analysis Tool Fixed-Point C Development Multistage Design Of Decimators/Interpolators RF Effect of Nonlinear Amplifier on 16-QAM Modulation Designing Impedance Matching Networks Audio and Speech Processing Acoustic Noise Canceller HDL Implementing the Filter Chain of a Digital...
      http://www.mathworks.com/products/dsp_comm/demos.shtml

      Digital Media Processing: DSP Algorithms Using C

      Multimedia processing demands efficient programming in order to optimize functionality. Data, image, audio, and video processing, some or all of which are present in all electronic devices today, are complex programming environments. Optimized algorithms (step-by-step directions) are difficult to create but can make all the difference when developing a new application. This book discusses the most current algorithms available that will...
      http://www.amazon.com

      Algorithms for programmers ideas and source code (Free eBook)

      This is a draft of a text about selected algorithms. The audience in mind are programmers who are interested in the treated algorithms and actually want to create and understand working and reasonably optimized code. The style varies somewhat which I do not consider bad per se: While some topics (as fast Fourier transforms) need a clear and explicit introduction others (like the bit wizardry chapter) seem to be best presented by...
      http://www.jjj.de/fxt/fxtbook.pdf

      Arithmetic Coding revealed - A guided tour from theory to praxis

      This document is an updated and translated version of the German paper Arithmetische Kodierung [BCK02] from 2002. It tries to be a comprehensive guide to the art of arithmetic coding. First we give an introduction to the mathematic principles involved. These build the foun-dation for chapter 3, where we describe the encoding and decoding algorithms for different numerical systems. Here we also mention various problems one can come...
      http://www-users.rwth-aachen.de/Eric.Bodden/files/ac/ac_en.pdf

      dspGuru's (free) DSP Algorithm Library

      DSP algorithms can be tricky to implement. Here, we provide free/open software to implement key DSP algorithms. The following packages provide C source code (unless noted) to implement common DSP algorithms. The code is intended not only to be 'instructive' but also 'useful': most routines are efficient enough to be used as-is in real DSP applications.
      http://www.dspguru.com/sw/opendsp/alglib.htm

      Creating a Consistent Verification Environment from Algorithm to RTL

      Hardware implementations of DSP designs typically start out as algorithms modeled in tools like Matlab(tm). Such tools provide a natural representation of the algorithm and an extensive collection of building blocks used to analyze algorithm performance, both quantitatively (S/N, BER, quantization errors, etc) and qualitatively (spectrum displays, processed image viewing, etc). They can also provide a quantitative analysis of possible fixed...
      http://www.mentor.com/products/esl/techpubs/mentorpaper_31816.cfm

      VOCAL White Papers (Archive)

      Archive of papers on Algorithms - G.gen.bis: G.dmt.bis: G.lite.bis: Does it make sense a G.992.1.bis and G.992.2.bis without advance coding? May 2001 ABSTRACT: This contribution presents discussion about if it makes sense to have a new recommendation without the advance coding improvement. This paper is in the same line that previous document AB-076 and also consider previous document IC-089.
      http://www.vocal.com/white_paper/index.html

      The Data Compression Library - Source Code

      This is a large collection of links to source code for numerous algorithms including compression, image processing, speech processing, and coding.
      http://datacompression.info/SourceCode.shtml

      DSP @ Numerix: Tutorials, Demos, White Papers

      DSP Overview DSP Introduction DSP Abbreviations DSP Glossary Recommended DSP Literature Additional DSP tutorials, including frequency domain signal processing DSP Programming Information Numerix Standard Coding Guidelines - This document discusses how to write highly efficient C code and includes information about the efficient implementation of DSP algorithms, in any language. Real-time C Coding Guidelines - This document...
      http://www.numerix-dsp.com/dsptech.html

      Synopsys System Studio Speeds DSP Algorithm Development With New Matrix Data-Type Support

      Synopsys, Inc. (Nasdaq: SNPS), a world leader in software and IP for semiconductor design, verification and manufacturing, today announced important new capabilities in its System Studio C/C++ model-based analysis and simulation environment, further enhancing algorithm developer efficiency. System Studio now offers matrix and vector data-type support, which significantly reduces the coding and debugging effort necessary to author signal...
      http://synopsys.mediaroom.com

      Explanation: these links are provided as part of our EE glossary project, which seeks to identify the most prominent keywords in embedded systems, embedded software, realtime and rtos, dsp (digital signal processing), system-on-a-chip, microprocessors and microcontrollers, and other constituent elements for embedded systems. While we seek to keep most of the links up-to-date, the user is refered to other primary electronic-based search sites such as: cera2.com, embedded.com, or EDN Magazine. If you have any suggestions of links or definitions, please email!

Mark Twain quote for the day:

In all things she was intense; in her this characteristic was not a mere glow, dispensing warmth, but a consuming fire.
- A Family Sketch