Proceedings Article10.1109/ITW.2001.955159
Analog decoding and beyond
Hans-Andrea Loeliger
- 02 Sep 2001
- pp 126-127
TL;DR: The author feels confident that analog decoders will eventually find their way into applications, and offers some thoughts on "the bigger picture"- the underlying principles, motivations, and possible directions of future research.
read more
Abstract: In 1998, Hagenauer and Loeliger et al. independently proposed to decode error correcting codes by analog electronic networks. In contrast to previous work on analog Viterbi decoders, the work both by Hagenauer and by Loeliger et al. was inspired by turbo-style decoding of codes described by graphs. Large gains, in terms of speed or power consumption, over digital implementations were envisaged. Since 1998, much effort has been spent towards turning these ideas into working chips. While only decoders of "toy" codes have so far been successfully manufactured, extensive simulations of such circuits have not revealed any fundamental problems. Some progress has also been made in analyzing the effects of transistor mismatch. While much remains to be learned, the author feels confident that analog decoders will eventually find their way into applications. The present paper, rather than reporting on circuit details, offers some thoughts on "the bigger picture"- the underlying principles, motivations, and possible directions of future research.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Explicit Loss Inference in Multicast Tomography
TL;DR: The purpose of this note is to demonstrate a new estimator for link-loss rates that is computationally simple, being an explicit function of the measurements, and that has the same asymptotic variance as the MLE, to first order in the link- loss rates.
35
Full cmos min-sum analog iterative decoder
Saied Hemati,Amir H. Banihashemi +1 more
- 15 Sep 2003
TL;DR: Analog iterative decoders are provided that are based on the so-called min-sum algorithm that can be used to decode powerful coding schemes such as low-density parity-check (LDPC) codes and turbo codes and can be implemented by standard CMOS technology, which means lower fabrication cost and/or simpler design compared to previously reported analog iterativedecoders.
32
Synchronization of Pseudorandom Signals by Forward-Only Message Passing With Application to Electronic Circuits
Benjamin Vigoda,Justin Dauwels,M. Frey,Neil Gershenfeld,Tobias Koch,Hans-Andrea Loeliger,P. Merkli +6 more
TL;DR: A connection is established between statistical state estimation and the phenomenon of entrainment of dynamical systems, which opens the prospect of deriving dynamical Systems with strong entrainments capabilities from more powerful message passing algorithms.
Patent
Analog computation using numerical representations with uncertainty
Benjamin Vigoda,William Bradley,Shawn Hershey,Jeffrey G. Bernstein +3 more
- 02 Mar 2010
TL;DR: In this article, a group of variables satisfies a set of one or more constraints, and each variable is specified as a decomposition into a group with each constituent having a set M (e.g., M < N) possible constituent values that can be determined based on the variable values.
13
Patent
Belief propagation processor
David C. Reynolds,Benjamin Vigoda +1 more
- 11 Jan 2011
TL;DR: In this article, an analog module is coupled to the first and second memory modules to update at least some of the second set of storage values in each operation cycle of at least one iteration.
10
References
•Book
Analog VLSI and Neural Systems
Carver A. Mead
- 01 Jan 1989
TL;DR: This chapter discusses a simple circuit that can generate a sinusoidal response and calls this circuit the second-order section, which can be used to generate any response that can be represented by two poles in the complex plane, where the two poles have both real and imaginary parts.
2.8K
•Book
Analog VLSI implementation of neural systems
Carver A. Mead,Mohammed Ismail +1 more
- 13 Oct 2011
TL;DR: A Neural Processor for Maze Solving and Issues in Analog VLSI and MOS Techniques for Neural Computing are discussed.
1.6K
Codes and iterative decoding on general graphs
TL;DR: A general framework, based on ideas of Tanner, for the description of codes and iterative decoding (“turbo coding”) is developed, which clarifies, in particular, which a priori probabilities are admissible and how they are properly dealt with.
367
Codes and iterative decoding on general graphs
Niclas Wiberg,Hans-Andrea Loeliger,R. Kotter +2 more
- 17 Sep 1995
TL;DR: The main thesis of the present paper is that, with respect to iterative decoding, the natural way of describing a code is by means of a Tanner graph, which may be viewed as a generalized trellis.
256
Probability propagation and decoding in analog VLSI
Hans-Andrea Loeliger,F. Lustenberger,M. Helfenstein,F. Tarkoy +3 more
- 16 Aug 1998
TL;DR: The sum-product algorithm (belief/probability propagation) can be naturally mapped into analog transistor circuits, which enable the construction of analog-VLSI decoders for turbo codes, low-density parity-check codes, and similar codes.