M
Marco Chiani
Researcher at University of Bologna
Publications - 379
Citations - 10975
Marco Chiani is an academic researcher from University of Bologna. The author has contributed to research in topics: Low-density parity-check code & Fading. The author has an hindex of 47, co-authored 358 publications receiving 10143 citations. Previous affiliations of Marco Chiani include University of Hawaii & Philips.
Papers
More filters
Journal ArticleDOI
New exponential bounds and approximations for the computation of error probability in fading channels
TL;DR: New exponential bounds for the Gaussian Q function and its inverse are presented and a quite accurate and simple approximate expression given by the sum of two exponential functions is reported for the general problem of evaluating the average error probability in fading channels.
Journal ArticleDOI
On the capacity of spatially correlated MIMO Rayleigh-fading channels
TL;DR: A concise closed-form expression is derived for the characteristic function (c.f.) of MIMO system capacity with arbitrary correlation among the transmitting antennas or among the receiving antennas in frequency-flat Rayleigh-fading environments, and an exact expression for the mean value of the capacity for arbitrary correlation matrices is derived.
Journal ArticleDOI
Network localization and navigation via cooperation
Moe Z. Win,Andrea Conti,Santiago Mazuelas,Yuan Shen,Wesley M. Gifford,Davide Dardari,Marco Chiani +6 more
TL;DR: This article presents an exploration of cooperative network localization and navigation from a theoretical foundation to applications, covering technologies and spatiotemporal cooperative algorithms.
Proceedings ArticleDOI
Protograph LDPC Codes Design Based on EXIT Analysis
Gianluigi Liva,Marco Chiani +1 more
TL;DR: The proposed EXIT analysis takes into account edge connections, permitting the decoding convergence evaluation for protograph-based and multi- edge type low-density parity-check codes, allowing the design of highly-structured capacity approaching LDPC codes.
Journal ArticleDOI
Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
TL;DR: In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC), and a bipartite graph representation of the SIC process, resembling iterative decoding of generalized low-density parity check codes over the erasure channel, is exploited to optimize the selection probabilities of the component erasure correction codes via density evolution analysis.