#### Filter Results:

- Full text PDF available (27)

#### Publication Year

2004

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Giulio Colavolpe, Alan Barbieri, Giuseppe Caire
- IEEE Journal on Selected Areas in Communications
- 2005

—We present two new iterative decoding algorithms for channels affected by strong phase noise and compare them with the best existing algorithms proposed in the literature. The proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori probability mass function of the information… (More)

- Alan Barbieri, Dario Fertonani, Giulio Colavolpe
- 2008 IEEE International Symposium on Information…
- 2008

We investigate the spectral efficiency of continuous phase modulations (CPMs). To this end, we need an effective bandwidth definition for a CPM signal, whose power spectral density has in principle an infinite support. The definition we adopt is based on the spacing between adjacent carriers in a frequency division multiplexed CPM system. We consider the… (More)

- Alan Barbieri, Aleksandar Damnjanovic, +5 authors Gavin Horn
- IEEE Journal on Selected Areas in Communications
- 2011

- Alan Barbieri, Peter Gaal, +4 authors F. Xue
- 2012 Information Theory and Applications Workshop
- 2012

In this paper we assess how coordination among base stations can be exploited to improve downlink capacity in fourth generation (4G) cellular networks. We focus on heterogeneous networks where low-power pico cells are deployed within the coverage area of an existing macro network with the aim of offloading traffic from the (potentially congested) macro… (More)

- Alan Barbieri, Amina Piemontese, Giulio Colavolpe
- IEEE Trans. Wireless Communications
- 2009

—We consider a terrestrial wireless channel, whose statistical model under flat-fading conditions is due to Clarke. A lot of papers in the literature deal with receivers for this scenario, aiming at estimating and tracking the time-varying channel, possibly with the aid of known (pilot) symbols. A common approach to derive receivers of reasonable complexity… (More)

- Alan Barbieri, Giulio Colavolpe
- IEEE Trans. Communications
- 2011

—We investigate the information rate of channels affected by phase noise, aiming at predicting the ultimate performance limits in this scenario. Moreover, a closed-form upper bound is also derived for phase shift keying (PSK) modulations. Finally, we consider the design of nonsystematic irregular repeat-accumulate (RA) codes for this channel trying to give… (More)

- A. Barbieri, A. Piemontese, G. Colavolpe
- 2007 IEEE International Symposium on Information…
- 2007

We consider a terrestrial wireless channel, whose statistical model under flat-fading conditions is due to Clarke. A lot of papers in the literature deal with receivers for this scenario, aiming at estimating and tracking the time-varying channel, possibly with the aid of known (pilot) symbols. A common approach to derive receivers of reasonable complexity… (More)

- Giulio Colavolpe, Alan Barbieri
- IEEE Communications Letters
- 2005

— In this letter, the well-known problem of a transmission over an additive white Gaussian noise channel affected by known intersymbol interference is considered. We show that the maximum a posteriori (MAP) symbol detection strategy, usually implemented by using the Forney observation model, can be equivalently implemented based on the samples at the output… (More)

- Alan Barbieri, Dario Fertonani, Giulio Colavolpe
- IEEE Trans. Communications
- 2009

— We investigate the spectral efficiency, achievable by a low-complexity symbol-by-symbol receiver, when linear modulations based on the superposition of uniformly time-and frequency-shifted replicas of a base pulse are employed. Although orthogonal signaling with Gaussian inputs achieves capacity on the additive white Gaussian noise channel, we show that,… (More)

- Dario Fertonani, Alan Barbieri, Giulio Colavolpe
- ICC
- 2006

— We propose novel techniques to reduce the complexity of the well known BCJR algorithm when it is employed as detection algorithm in turbo equalization schemes. In particular, by also considering an alternative formulation of the BCJR algorithm, which results much more suitable than the original one for deriving reduced-complexity techniques, we describe… (More)