|
 
|
Featured Products:
| 
|
X5-210M
The X5-210M is an XMC IO module featuring four 14-bit 250 MSPS A/Ds with a Virtex5 FPGA computing core, DRAM and SRAM memory, ...
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 ...
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 ...
|
|
|
|
| |
Advertise here! |
eg3 connect
Need talent? If you are looking for engineering or programming talent, consider eg3 connect - a free service that helps OEM project managers, HR, and VP's to locate qualified design engineers and programmers worldwide.
Best of all, it's free!
| |
 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
overview
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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)
Here are the best overviews and tutorials for algorithms:
- tutorial, 5 stars
-
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...
- tutorial, 3 stars
-
Adaptive Signal Processing JAVA Applet
This site contains a tutorial on adaptive signal processing, including noise cancellation, system identification and prediction.
A Java applet is provided to illustrate the concepts interactively.
- tutorial, 3 stars
-
A Tutorial on Convolutional Coding with Viterbi Decoding
This tutorial iintroduces the reader to a forward error correction technique known as convolutional coding with Viterbi decoding.
The page is equipped with definitions of the mathematical algorithms and C source examples.
To browse all sites for 'ALGORITHMS,' click
here
.
| |
