Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guido di Blasio

dblp:62/481 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Theory of computation · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Information theory · 62% Coding theory · 38%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
trellis codes
0.011997
Performance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding · IEEE Trans. Commun. 1997
Coding theory › trellis codes
trellis code design
0.011997
Performance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding · IEEE Trans. Commun. 1997
Information theory
estimation theory
0.011995
Recursive filtering and smoothing for reciprocal Gaussian processes-pinned boundary case · IEEE Trans. Inf. Theory 1995
Information theory › probability theory › stochastic processes
gaussian processes
0.011995
Recursive filtering and smoothing for reciprocal Gaussian processes-pinned boundary case · IEEE Trans. Inf. Theory 1995
Information theory
hypothesis testing
0.011991
Modified Q-functions and their use in detection analysis · IEEE Trans. Inf. Theory 1991
Information theory
probability theory
0.011991
Modified Q-functions and their use in detection analysis · IEEE Trans. Inf. Theory 1991
Information theory
q function
0.011991
Modified Q-functions and their use in detection analysis · IEEE Trans. Inf. Theory 1991
Information theory › hypothesis testing
signal detection
0.011991
Modified Q-functions and their use in detection analysis · IEEE Trans. Inf. Theory 1991

Methods — techniques the papers use, named apart from their topics

upper bound analysis · 0.0discrete memoryless channel · 0.0least-squares estimation · 0.0innovations approach · 0.0probabilistic interpretation · 0.0complex analysis · 0.0
YearPublicationVenuePosition
1997 On the modelling of GMSK binary transmission over time-variant TDMA/FDD macrocellular radio channels with derotation-based coherent demodulation
abstract
GMSK is an efficient modulation technique for digital mobile communications. In this paper a simple solution to the modeling and simulation of GMSK systems impaired by fading channels and additive white Gaussian noise is given, and its effects on the channel characteristics are also considered. The modeling is based on the well-known linearized representation of phase-modulated signals. The analysis is not only useful for modeling and simulation purposes, but also gives a tool for the design of simple receivers.
Enzo Baccarelli, Roberto Cusani, Guido di Blasio, Stefano Galli
ISCC3
1997 Performance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding
abstract
A new tight analytical upper bound is presented for the performance of finite-delay symbol-by-symbol (SBS) Abend-Fritchman-like decoding of trellis-encoded data crossing arbitrary (eventually time-varying) discrete memoryless channels (DMCs). On the basis of this bound, a related criterion for the optimal design of trellis codes with SBS decoding is then proposed. It gives rise to an effective procedure for the construction of good trellis codes (generally time varying and nonlinear) with assigned decoding complexity.
Enzo Baccarelli, Roberto Cusani, Guido di Blasio
IEEE Trans. Commun.3
1995 Recursive filtering and smoothing for reciprocal Gaussian processes-pinned boundary case
abstract
The least square estimation problem for pinned-to-zero discrete-index reciprocal Gaussian processes in additive white noise is solved, thus completing and extending some previous results available in the literature. In particular, following the innovations approach a (finite) set of recursive equations is obtained for the filter and for the three standard classes of smoothers (fixed-point, fixed-interval, fixed-lag). Recursive expressions for the mean square performance of the proposed estimators are also given.>
Enzo Baccarelli, Roberto Cusani, Guido di Blasio
IEEE Trans. Inf. Theory3
1991 Modified Q-functions and their use in detection analysis
abstract
The Marcum's Q-function is extended to complex arguments. In particular, a set of modified generalized Q-functions for imaginary values of one or both arguments are defined and their properties are investigated. An extended probabilistic interpretation for the modified Q-functions is given appealing to a proposed generalization of the concept of random variable. Complex pseudo-random variables, pseudo-events, and pseudo-probability measures are defined, which formally obey the usual rules of composition of probability measures of independent events. The modified Q-functions are then used to derive the Rayleigh multivariate multidimensional distribution function and the error probability for partially coherent detection of equicorrelated signals.>
Guido di Blasio, Alessandro Neri 0001
IEEE Trans. Inf. Theory1