Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Ferrari 0001
Person information
- affiliation (PhD 2000): Politecnico di Milano, CNR-IEIIT, Milan, Italy
Other persons with the same name
- Marco Ferrari — disambiguation page
- Marco Ferrari 0002
![[0000-0002-3310-7715]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-3310-7715")
— University of Brescia, Italy - Marco Ferrari 0003 — University of L'Aquila, Italy
- Marco Ferrari 0004 — University of Genoa, DISTAV, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
A Sphere Packing Bound for Vector Gaussian Fading Channels Under Peak Amplitude Constraints. IEEE Trans. Inf. Theory 69(1): 238-250 (2023)- [c23]Fardad Vakilipoor, Abdulhamid N. M. Ansari, Marco Ferrari, Maurizio Magarini:
Estimation of Source Direction with Spherical Array Receiver in Molecular Communication. ISMICT 2023: 1-6 - 2022
- [j18]Marco Ferrari, Fardad Vakilipoor, Eric Regonesi, Mariangela Rapisarda, Maurizio Magarini:
Channel Characterization of Diffusion-Based Molecular Communication With Multiple Fully-Absorbing Receivers. IEEE Trans. Commun. 70(5): 3006-3019 (2022) - [j17]Fardad Vakilipoor, Marco Ferrari, Maurizio Magarini:
Asymptotic MIMO Channel Model for Diffusive MC With Fully-Absorbing Receivers. IEEE Wirel. Commun. Lett. 11(8): 1634-1638 (2022) - [c22]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
The Capacity of Fading Vector Gaussian Channels Under Amplitude Constraints on Antenna Subsets. ITW 2022: 178-183 - [i6]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
The Capacity of Fading Vector Gaussian Channels Under Amplitude Constraints on Antenna Subsets. CoRR abs/2207.01266 (2022) - 2021
- [c21]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
The Capacity of the Amplitude-Constrained Vector Gaussian Channel. ISIT 2021: 426-431 - [i5]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
The Capacity of the Amplitude-Constrained Vector Gaussian Channel. CoRR abs/2101.08643 (2021) - [i4]Marco Ferrari, Fardad Vakilipoor, Eric Regonesi, Mariangela Rapisarda, Maurizio Magarini:
Channel Characterization of Diffusion-based Molecular Communication with Multiple Fully-absorbing Receivers. CoRR abs/2111.12181 (2021) - [i3]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
A Sphere Packing Bound for Vector Gaussian Fading Channels under Peak Amplitude Constraints. CoRR abs/2111.13179 (2021) - [i2]Fardad Vakilipoor, Marco Ferrari, Maurizio Magarini:
Asymptotic MIMO Channel Model for Diffusive MC with Fully-absorbing Receivers. CoRR abs/2112.04046 (2021) - 2020
- [c20]Marco Ferrari, Ramon Marenzi, Luca Barletta:
Message Flow Analysis in Practical LDPC Decoders for the Interpretation of Absorbing Set Thresholds. ISIT 2020: 327-332 - [c19]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
Capacity Bounds for Amplitude-Constrained AWGN MIMO Channels with Fading. ISIT 2020: 2032-2037 - [c18]Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
A Sphere Packing Bound for AWGN MIMO Fading Channels under Peak Amplitude Constraints. ITW 2020: 1-5 - [c17]Alberto Tarable, Marco Ferrari, Luca Barletta:
Two is Better than One: Reducing the Loss of the Window Decoder for SC-LDPC Codes. ITW 2020: 1-5 - [c16]Eric Regonesi, Mariangela Rapisarda, Maurizio Magarini, Marco Ferrari:
Relative angle estimation of an interferer in a diffusion-based molecular communication system. NANOCOM 2020: 14:1-14:7
2010 – 2019
- 2019
- [j16]Marco Ferrari, Alessandro Tomasoni, Ramon Marenzi, Sandro Bellini:
Thresholds of Absorbing Sets Under Scaled Min-Sum LDPC Decoding. IEEE Trans. Commun. 67(10): 6643-6651 (2019) - 2018
- [c15]Marco Ferrari, Paolo Amato, Christophe Laurent, Marco Sforzin, Luca Barletta, Sandro Bellini:
Ultra-Fast Error Correction and Detection for Low-Latency Storage Applications with Emerging Memories. ISCAS 2018: 1-5 - 2017
- [j15]Alessandro Tomasoni, Sandro Bellini, Marco Ferrari:
Thresholds of Absorbing Sets in Low-Density Parity-Check Codes. IEEE Trans. Commun. 65(8): 3238-3249 (2017) - [c14]Marco Ferrari, Alessandro Tomasoni, Sandro Bellini:
Analysis of practical LDPC decoders in tanner graphs with absorbing sets. ITW 2017: 141-145 - 2016
- [j14]Paolo Amato, Sandro Bellini, Marco Ferrari, Christophe Laurent, Marco Sforzin, Alessandro Tomasoni:
Fast Decoding ECC for Future Memories. IEEE J. Sel. Areas Commun. 34(9): 2486-2497 (2016) - 2015
- [j13]Marco Ferrari, Sandro Bellini, Alessandro Tomasoni:
Safe Early Stopping for Layered LDPC Decoding. IEEE Commun. Lett. 19(3): 315-318 (2015) - 2014
- [i1]Alessandro Tomasoni, Sandro Bellini, Marco Ferrari:
Thresholds of absorbing sets in Low-Density-Parity-Check codes. CoRR abs/1401.8168 (2014) - 2013
- [j12]Sandro Bellini, Alessandro Tomasoni, Marco Ferrari:
On the Constrained Capacity of Block Differential Modulation and Detection. IEEE Trans. Commun. 61(7): 2840-2852 (2013) - [j11]Alessandro Tomasoni, Devis Gatti, Sandro Bellini, Marco Ferrari, Massimiliano Siti:
Efficient OFDM Channel Estimation via an Information Criterion. IEEE Trans. Wirel. Commun. 12(3): 1352-1362 (2013) - 2012
- [j10]Alessandro Tomasoni, Massimiliano Siti, Marco Ferrari, Sandro Bellini:
Hardware oriented, quasi-optimal detectors for iterative and non-iterative MIMO receivers. EURASIP J. Wirel. Commun. Netw. 2012: 62 (2012) - [j9]Sandro Bellini, Marco Ferrari, Alessandro Tomasoni:
On the Reduction of Additive Complexity of Cyclotomic FFTs. IEEE Trans. Commun. 60(6): 1465-1468 (2012) - [j8]Marco Ferrari, Sandro Bellini, Alessandro Tomasoni:
Low-Complexity Z4 LDPC Code Design under a Gaussian Approximation. IEEE Wirel. Commun. Lett. 1(6): 589-592 (2012) - [c13]Alessandra Bianchi, Stefano Bregni, Irene Crimaldi, Marco Ferrari:
Analysis of a Hurst parameter estimator based on the modified Allan variance. GLOBECOM 2012: 1716-1721 - [c12]Alessandro Tomasoni, Sandro Bellini, Marco Ferrari, Devis Gatti, Massimiliano Siti:
Efficient OFDM channel estimation via an information criterion. ICC 2012: 3936-3941 - 2011
- [j7]Sandro Bellini, Marco Ferrari, Alessandro Tomasoni:
On the Structure of Cyclotomic Fourier Transforms and Their Applications to Reed-Solomon Codes. IEEE Trans. Commun. 59(8): 2110-2118 (2011) - 2010
- [j6]Alessandro Tomasoni, Massimiliano Siti, Marco Ferrari, Sandro Bellini:
Low Complexity, Quasi-Optimal MIMO Detectors for Iterative Receivers. IEEE Trans. Wirel. Commun. 9(10): 3166-3177 (2010) - [c11]Alessandro Tomasoni, Marco Ferrari, Sandro Bellini, Massimiliano Siti, Teo Cupaiuolo:
A Hardware Oriented, Low-Complexity LORD MIMO Detector. ICC 2010: 1-5
2000 – 2009
- 2009
- [j5]Marco Ferrari, Sandro Bellini:
Rate Variable, Multi-Binary Turbo Codes with Controlled Error-Floor. IEEE Trans. Commun. 57(5): 1209-1214 (2009) - [c10]Alessandro Tomasoni, Massimiliano Siti, Marco Ferrari, Sandro Bellini:
A K-Best Version of the Turbo-LORD MIMO Detector in Realistic Settings. ICC 2009: 1-5 - [c9]Giuseppe Caire, Sandro Bellini, Alessandro Tomasoni, Marco Ferrari:
On the selection of semi-orthogonal users for zero-forcing beamforming. ISIT 2009: 1100-1104 - 2008
- [c8]Marco Ferrari, Sandro Bellini:
Maximum Likelihood Decoding of Turbo Codes on the Binary Erasure Channel. ICC 2008: 1144-1149 - [c7]Marco Ferrari, Sandro Bellini, Marcel Adrian Ambroze, Martin Tomlinson:
A II-HARQ scheme for BEC models with ML decoding of Turbo Codes. ITW 2008: 76-80 - 2007
- [j4]Marco Ferrari, Sandro Bellini, Fabio Osnato, Massimiliano Siti, Stefano Valle:
Information Theory Performance of Reed-Solomon codes in concatenated schemes with nonideal interleaving. Eur. Trans. Telecommun. 18(7): 693-703 (2007) - [c6]Alessandro Tomasoni, Massimiliano Siti, Marco Ferrari, Sandro Bellini:
Turbo-LORD: A MAP-Approaching Soft-Input Soft-Output Detector for Iterative MIMO Receivers. GLOBECOM 2007: 3504-3508 - 2006
- [c5]Alessandro Tomasoni, Marco Ferrari, Devis Gatti, Fabio Osnato, Sandro Bellini:
A Low Complexity Turbo MMSE Receiver for W-LAN MIMO Systems. ICC 2006: 4119-4124 - 2005
- [j3]Marco Ferrari, Sandro Bellini:
Weight spectrum evaluation for multi-binary tailbiting turbo codes. IEEE Commun. Lett. 9(7): 640-642 (2005) - [c4]Andrea Dell'Acqua, Marco Ferrari, Marco Marcon, Augusto Sarti, Stefano Tubaro:
Colored visual tags: a robust approach for augmented reality. AVSS 2005: 423-427 - 2004
- [j2]Marco Ferrari, Sandro Bellini:
Refinements and asymptotic performance of bandwidth-efficient turbo product codes. IEEE Trans. Commun. 52(6): 866-870 (2004) - 2003
- [j1]Marco Ferrari, Sandro Bellini:
Existence and uniqueness of the solution for turbo decoding of parallel concatenatedsingle parity check codes. IEEE Trans. Inf. Theory 49(3): 722-725 (2003) - 2002
- [c3]Marco Ferrari, Francesco Scalise, Sandro Bellini:
Prunable S-random interleavers. ICC 2002: 1711-1715 - 2001
- [c2]Marco Ferrari, Fabio Osnato, Massimiliano Siti, Stefano Valle, Sandro Bellini:
Performance of concatenated Reed-Solomon and turbo codes with non ideal interleaving. GLOBECOM 2001: 911-915 - [c1]Marco Ferrari, Sandro Bellini:
Importance sampling simulation of turbo product codes. ICC 2001: 2773-2777
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
