Digital radios have undergone an astonishing evolution in the last century. Born as a set of simple and
power-hungry electrical and electromechanical devices for low data rate transmission of telegraph data
in the Marconi age, they have transformed, thanks to substantial advances in electronic technology,
into a set of small, reliable and sophisticated integrated devices supporting broadband multimedia
communications. This, however, would not have been possible unless significant progress had been
made in recent decades in the field of signal processing algorithms for baseband and passband signals.
In fact, the core of any modern digital radio consists of a set of algorithms running over programmable
electronic hardware. This book stems from the research and teaching activities of its co-authors in
the field of algorithmic techniques for wireless communications. A huge body of technical literature
has accumulated in the last four decades in this area, and an extensive coverage of all its important
aspects in a single textbook is impossible. For this reason, we have selected a few important topics
and, for ease of reading, organized them into two parts.
The use of FPGAs for cryptographic applications is highly attractive for a variety of reasons but at the same time there are many open issues related to the general security of FPGAs. This contribution attempts to provide a state-of-the-art description of this topic. First, the advantages of reconfigurable hardware for cryptographic applications are discussed from a systems perspective. Second, potential security problems of FPGAs are described in detail, followed by a proposal of a some countermeasure. Third, a list of open research problems is provided. Even though there have been many contributions dealing with the algorithmic
aspects of cryptographic schemes implemented on FPGAs, this contribution appears to be the first comprehensive treatment of system and security aspects.
The 4.0 kbit/s speech codec described in this paper is based on a
Frequency Domain Interpolative (FDI) coding technique, which
belongs to the class of prototype waveform Interpolation (PWI)
coding techniques. The codec also has an integrated voice
activity detector (VAD) and a noise reduction capability. The
input signal is subjected to LPC analysis and the prediction
residual is separated into a slowly evolving waveform (SEW) and
a rapidly evolving waveform (REW) components. The SEW
magnitude component is quantized using a hierarchical
predictive vector quantization approach. The REW magnitude is
quantized using a gain and a sub-band based shape. SEW and
REW phases are derived at the decoder using a phase model,
based on a transmitted measure of voice periodicity. The spectral
(LSP) parameters are quantized using a combination of scalar
and vector quantizers. The 4.0 kbits/s coder has an algorithmic
delay of 60 ms and an estimated floating point complexity of
21.5 MIPS. The performance of this coder has been evaluated
using in-house MOS tests under various conditions such as
background noise. channel errors, self-tandem. and DTX mode
of operation, and has been shown to be statistically equivalent to
ITU-T (3.729 8 kbps codec across all conditions tested.
Much of Game Theory has developed within the community of Economists,
starting from the book “Theory of Games and Economic behavior” by Mor-
genstern and Von Neumann (1944). To a lesser extent, it has had an impact on
biology (with the development of evolutionarygames) and on road traffic Engi-
neering (triggered by the concept of Wardrop equilibrium introduced already
in 1952 along with the Beckmann potential approach introduced in 1956).
Since 1999 game theory has had a remarkable penetration into computer sci-
ence with the formation of the community of algorithmic game theory.
