#### Filter Results:

#### Publication Year

2004

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—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)

—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, Peter Gaal, Stefan Geirhofer, Tingfang Ji, Durga Malladi, Yongbin Wei +1 other
- ITA
- 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)

—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)

—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)

— 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)

— 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)

—We present a new algorithm for joint detection and decoding of iteratively decodable codes transmitted over channels affected by a time-varying phase noise (PN) and a constant frequency offset. The proposed algorithm is obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori distribution of the… (More)

— 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)