Change search
ReferencesLink to record
Permanent link

Direct link
Recursive interference cancellation based on simplified belief propagation
University of South Australia. (Institute for Telecommunications Research)ORCID iD: 0000-0001-7182-9543
Chalmers University of Technology.
2008 (English)In: 2008 AUSTRALIAN COMMUNICATIONS THEORY WORKSHOP, 2008, 45-50 p.Conference paper (Refereed)
Abstract [en]

For practical implementation of multiuser detection, interference cancellation schemes of minimal complexity are almost exclusively of interest. In this paper, we derive a recursive cancellation scheme based on simplified belief propagation. The simplifications follow from Gaussian and large-system approximations, and lead to a structure of the same order of complexity as simple parallel cancellation. The resulting scheme can be interpreted as a recursive update of a noise hypothesis, filtered across iterations. The performance of the proposed detector is compared to competing cancellation schemes of the same order of complexity, and improvements are observed for larger system loads.

Place, publisher, year, edition, pages
2008. 45-50 p.
National Category
URN: urn:nbn:se:kth:diva-62619DOI: 10.1109/AUSCTW.2008.4460820ISI: 000256382900009ISBN: 978-1-4244-2037-7OAI: diva2:480794
9th Australian Communication Theory Workshop. Christchurch, NEW ZEALAND. JAN 30-FEB 01, 2008
QC 20120120Available from: 2012-01-19 Created: 2012-01-19 Last updated: 2012-01-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Rasmussen, Lars Kildehöj

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 9 hits
ReferencesLink to record
Permanent link

Direct link