Dynamics of analog decoders for different message representation domains

Authors:
Saied Hemati;Abbas Yongacoglu
Affiliations:
Department of Electrical and Computer Engineering, McGill University, Montreal, Quebec, Canada and School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada;School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 4
Cited 1

The geometry of turbo-decoding dynamics

IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
Probability propagation and decoding in analog VLSI

IEEE Transactions on Information Theory
Nonlinear dynamics of iterative decoding systems: analysis and applications

IEEE Transactions on Information Theory

On the dynamics of analog min-sum iterative decoders: an analytical approach

IEEE Transactions on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study analog decoders in an abstract level and show that their dynamic equations can change with message representation domain. This result, which is in contrast with the behavior of conventional discrete-time iterative decoders, is derived based on continuity requirement for messages that are passed between processing nodes in analog decoders. In this letter, this requirement is met by assigning low-pass filters between processing nodes that remain unchanged for different message representation domains.