Journal ArticleDOI
Unified design of iterative receivers using factor graphs
Andrew P. Worthen,Wayne E. Stark +1 more
Reads0
Chats0
TLDR
A unified approach based on factor graphs for deriving iterative message-passing receiver algorithms for channel estimation and decoding, and Canonical distributions provide a new, general framework for handling continuous variables.Abstract:
Iterative algorithms are an attractive approach to approximating optimal, but high-complexity, joint channel estimation and decoding receivers for communication systems. We present a unified approach based on factor graphs for deriving iterative message-passing receiver algorithms for channel estimation and decoding. For many common channels, it is easy to find simple graphical models that lead directly to implementable algorithms. Canonical distributions provide a new, general framework for handling continuous variables. Example receiver designs for Rayleigh fading channels with block or Markov memory, and multipath fading channels with fixed unknown coefficients illustrate the effectiveness of our approach.read more
Citations
More filters
Journal ArticleDOI
The Factor Graph Approach to Model-Based Signal Processing
TL;DR: The message-passing approach to model-based signal processing is developed with a focus on Gaussian message passing in linear state-space models, which includes recursive least squares, linear minimum-mean-squared-error estimation, and Kalman filtering algorithms.
The Factor Graph Approach to Model-Based Signal Processing Factor graphs can model complex systems and help to design effective algorithms for detection and estimation problems.
TL;DR: In this paper, the message-passing approach to model-based signal processing is developed with a focus on Gaussian message passing in linear state-space models, which includes recursive least squares, linear minimum-mean-squared-error estimation, and Kalman filtering algorithms.
Journal ArticleDOI
Algorithms for iterative decoding in the presence of strong phase noise
TL;DR: Two new iterative decoding algorithms for channels affected by strong phase noise are presented and their results show that they achieve near-coherent performance at very low complexity without requiring any change to the existing DVB-S2 standard.
Journal ArticleDOI
Channel Estimation for OFDM
TL;DR: This survey will first review traditional channel estimation approaches based on channel frequency response (CFR) and Parametric model (PM)-based channel estimation, which is particularly suitable for sparse channels, will be also investigated in this survey.
Journal ArticleDOI
Message Passing Algorithms for Scalable Multitarget Tracking
Florian Meyer,Thomas Kropfreiter,Jason L. Williams,Roslyn A. Lau,Franz Hlawatsch,Paolo Braca,Moe Z. Win +6 more
TL;DR: This tutorial paper advocates a recently proposed paradigm for scalable multitarget tracking that is based on message passing or, more concretely, the loopy sum–product algorithm, which provides a highly effective, efficient, and scalable solution to the probabilistic data association problem, a major challenge in multitargettracking.
References
More filters
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Journal ArticleDOI
Factor graphs and the sum-product algorithm
TL;DR: A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.
Proceedings ArticleDOI
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
TL;DR: In this article, a new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed.
Journal ArticleDOI
A recursive approach to low complexity codes
TL;DR: It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities.