Decoding and Equalization with Analog Non‐linear Networks
- 1 November 1999
- journal article
- telecommunication transmission
- Published by Wiley in European Transactions on Telecommunications
- Vol. 10 (6) , 659-680
- https://doi.org/10.1002/ett.4460100610
Abstract
Using analog, non‐linear and highly parallel networks, we attempt to perform decoding of block and convolutional codes, equalization of certain frequency‐selective channels, decoding of multi‐level coded modulation and reconstruction of coded PCM signals. This is in contrast to common practice where these tasks are performed by sequentially operating processors. Our advantage is that we operate fully on soft values for input and output, similar to what is done in 'turbo' decoding. However, we do not have explicit iterations because the networks float freely in continuous time. The decoder has almost no latency in time because we are only restricted by the time constants from the parasitic RC values of integrated circuits. Simulation results for several simple examples are shown which, in some cases, achieve the performance of a conventional MAP detector. For more complicated codes we indicate promising solutions with more complex analog networks based on the simple ones. Furthermore, we discuss the principles of the analog VLSI implementation of these networks.Keywords
This publication has 24 references indexed in Scilit:
- Optimal and near-optimal encoders for short and moderate-length tail-biting trellisesIEEE Transactions on Information Theory, 1999
- BiCMOS circuits for analog Viterbi decodersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1998
- An artificial neural net Viterbi decoderIEEE Transactions on Communications, 1996
- Codes and iterative decoding on general graphsEuropean Transactions on Telecommunications, 1995
- Iterative correction of intersymbol interference: Turbo‐equalizationEuropean Transactions on Telecommunications, 1995
- A nonalgorithmic maximum likelihood decoder for trellis codesIEEE Transactions on Information Theory, 1993
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- A new multilevel coding method using error-correcting codesIEEE Transactions on Information Theory, 1977
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962