Sergio Callegari

Sergio Callegari

Auto-generated profile, based on publicly available information

Sergio Callegari

ARCES/DEI, University of Bologna, Italy

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 January 2005 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SCS. Callegari
S. Callegari
RRRiccardo Rovatti
Riccardo Rovatti
GSG. Setti
G. Setti
We present a true random number generator which, contrary to other implementations, is not based on the explicit observation of complex micro-cosmic processes but on standard signal processing primitives, freeing the designer from the need for dedicated hardware. The system can be implemented from now ubiquitous analog-to-digital converters building blocks, and is therefore well-suited to embedding. On current technologies, the design permits data rates in the order of a few tens of megabits per second. Furthermore, the absence of predictable, repeatable behaviors increases the system security for cryptographic applications. The design relies on a simple inner model based on chaotic dynamics which, in ideal conditions, can be formally proven to generate perfectly uncorrelated binary sequences. Here, we detail the design and we validate the quality of its output against a couple of test suites standardized by the U.S. National Institute of Standards and Technology, both in the ideal case and assuming implementation errors.

7 August 2002 in Proceedings of the IEEE
Verified
Journal Article
Closed access
GSG. Setti
G. Setti
GMG. Mazzini
G. Mazzini
RRRiccardo Rovatti
Riccardo Rovatti
SCS. Callegari
S. Callegari
The application of chaotic dynamics to signal processing tasks stems from the realization that its complex behavior becomes tractable when observed from a statistical perspective. Here we illustrate the validity of this statement by considering two noteworthy problems-namely, the synthesis of high-electromagnetic compatibility clock signals and the generation of spreading sequences for direct-sequence code-division communication systems, and by showing how the statistical approach to discrete-time chaotic systems can be applied to find their optimal solution. To this aim, we first review the basic mathematical tools both intuitively and formally; we consider the Perron-Frobenius operator its spectral decomposition and its tie to the correlation properties of chaotic sequences. Then, by leveraging on the modeling/approximation of chaotic systems through Markov chains, we introduce a matrix/tensor-based framework where statistical indicators such as high-order correlations can be quantified. We underline how, for many particular cases, the proposed analysis tools can be reversed into synthesis methodologies and we use them to tackle the two above mentioned problems. In both cases, experimental evidence shows that the availability of statistical tools enables the design of chaos-based systems which favorably compare with analogous nonchaos-based counterparts.

1 August 2006 in Sensors and Actuators A: Physical
Verified
Journal Article
Closed access
SCS. Callegari
S. Callegari
MZMichele Zagnoni
Michele Zagnoni
AGA. Golfarelli
A. Golfarelli
MTM. Tartagni
M. Tartagni
ATA. Talamelli
A. Talamelli
ARA. Rossetti
A. Rossetti

21 January 2005 in International Journal of Circuit Theory and Applications
Verified
Journal Article
Closed access
PDF file
SCS. Callegari
S. Callegari
RRRiccardo Rovatti
Riccardo Rovatti
GSG. Setti
G. Setti

1 September 2005 in Sensors and Actuators A: Physical
Verified
Journal Article
Closed access
MZMichele Zagnoni
Michele Zagnoni
AGA. Golfarelli
A. Golfarelli
SCS. Callegari
S. Callegari
ATA. Talamelli
A. Talamelli
VBV. Bonora
V. Bonora
MTM. Tartagni
M. Tartagni

26 September 2014
Verified
Conference Paper
Closed access
SCS. Callegari
S. Callegari
GSG. Setti
G. Setti
PLP.J. Langlois
P.J. Langlois
This paper describes the design of a modified tent map characterized by a uniform probability density function. The use of this map is proposed as an alternative to the tent map and the Bernoulli shift. It is shown that practical circuits implementing the latter two maps may possess parasitic stable equilibria, fact which would prevent the desired chaotic behavior of the system. On the other hand, commonly used strategies to avoid the parasitic equilibria onset also affect the uniformity of the probability density function. Conversely, the use of the proposed tailed tent map allows to assure a certain degree of parameter deviation robustness, without compromising on the statistical properties of the system