eagle_tut.pdf (application/pdf Object)

bias.pdf (application/pdf Object)

sloa058.pdf (application/pdf Object)

good intro to C/C++ topics.
by Philip Machanick

Linear dn228f.pdf (application/pdf Object)

CEL an1047.pdf (application/pdf Object)

National Semi AN-1057.pdf (application/pdf Object)

Paper on the technique Shazam (et al?) uses for music recognition.

really good low-level DMX information

MULTISIM_Tutorial09.pdf (application/pdf Object)

As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenance algorithms for balanced trees. In terms of code simplicity, our algorithms compare favourably with those for deterministic and probabilistic skip lists.

In this article, we examine the history and implementation of branch prediction in several popular modern microprocessors and its effect on the way code is written.

As CPU cores become both faster and more numerous, the limiting factor for most programs is
now, and will be for some time, memory access. Hardware designers have come up with ever
more sophisticated memory handling and acceleration techniques–such as CPU caches–but
these cannot work optimally without some help from the programmer. Unfortunately, neither
the structure nor the cost of using the memory subsystem of a computer or the caches on CPUs
is well understood by most programmers. This paper explains the structure of memory subsystems in use on modern commodity hardware, illustrating why CPU caches were developed, how
they work, and what programs should do to achieve optimal performance by utilizing them.