... 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:

      Design Services: Consultants, Design Co's, Programmers

      Looking for engineers or designers? eg3.com's new "eg3 connect" service puts people who NEED TALENT in touch with people who HAVE TALENT. So if you are looking for an outside consultant or design company to help you get your project done quickly and under budget, check out this new online resource. Free.
      http://www.eg3.com/connect/

      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

      X5-400M

      PCIe XMC Module - Two 400 MSPS, 14-bit TI ADS5474 ADCs and Two 500 MSPS, 16-bit DACs, Virtex5 FPGA and 512 MB Memory. The X5-400M is an XMC IO module featuring two 14-bit, 400 MSPS A/D and two 16-bit, 500 MSPS DAC channels with a Virtex5 FPGA computing core and PCI Express host interface on a standard XMC module. A Xilinx Virtex5 SX95T FPGA with 512 MB DDR2 DRAM and 4MB QDR-II memory provide a very high performance DSP core for demanding applications such as emerging wireless standards. The close integration of the analog IO, memory and host interface with the FPGA enables real-time signal processing at extremely high rates exceeding 300 GMACs per second.
      http://www.innovative-dsp.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

      DSP/FPGA Co-Processing Demonstrates 20X Acceleration using Software-to-Hardware Design Flow

      Impulse Accelerated Technologies Inc. and 3L Limited today announced a technology partnership allowing DSP application developers to create accelerated algorithms for high-performance embedded systems, using software development methods for both DSP and FPGA devices. To demonstrating this capability, 3L engineers created an accelerated signal correlation application using the 3L Diamond and Impulse CoDeveloper tools, and targeting a
      http://www.impulsec.com/PR_Impulse_3L.pdf

      X5-GSPS

      PCI Express XMC Module with Two 8-bit National ADC08D1500 A/Ds, Virtex5 FPGA and 512 MB Memory. The X5-GSPS is an XMC I/O module featuring two 8-bit, National Semiconductor 1.5 GSPS ADC08D1500 A/Ds with a Virtex5 FPGA computing core, DRAM and SRAM memory, and eight lane PCI Express host interface. A Xilinx Virtex5 SX95T with 512 MB DDR2 DRAM and 4MB QDR-II memory provide a very high performance DSP core for demanding applications such as emerging wireless standards. The close integration of the analog IO, memory and host interface with the FPGA enables real-time signal processing at extremely high rates exceeding 300 GMACs per second.
      http://www.innovative-dsp.com

      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

      C Algorithms for Real-Time DSP

      Basic principles of digital signal processing and C programming. Succeeding chapters introduce the basic real-time DSP programming techniques and typical programming environments used with DSP microprocessors; cover the basic real-time filtering techniques; and present several real-time DSP applications, including speech compression, music signal processing, radar signal processing, and adaptive signal processing techniques.
      http://www.amazon.com

      Firecracker Development and Reference Design Platform

      Introducing the FireCracker! Based on Analog Devices popular Blackfin embedded processor, Silica has developed the FireCracker Development and Reference Design Platform for audio and video applications. FireCracker is a unique concept of a hybrid between a development board and a reference design that enables design engineers to bring embedded computing solutions from concept to production in record time.
      http://www.eg3.com

      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

      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:

Life would be infinitely happier if we could only be born at the age of eighty and gradually approach eighteen.
- Autobiography with Letters, Phelps