Convergence Speed and Throughput of Analog Decoders

Author

Hemati, Saied ; Banihashemi, Amir H.

Author_Institution

Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont.

Volume

55

Issue

5

fYear

2007

fDate

5/1/2007 12:00:00 AM

Firstpage

833

Lastpage

836

Abstract

This letter is concerned with the implementation of iterative decoding algorithms in analog integrated circuits. We study the convergence speed and the throughput of analog decoders for low-density parity-check codes, and show that they depend on the code, the decoding algorithm, the signal-to-noise ratio, and the average time constant of the analog circuit interconnections. However, they are not a function of the variance of the time constants. The analysis presented here can be used for selecting suitable codes and decoding algorithms for analog decoding. Furthermore, it can be used to estimate the throughput of an analog decoder, if the average time constant of the analog circuit is known

Keywords

analogue integrated circuits; iterative decoding; parity check codes; analog decoders; analog integrated circuits; average time constant; iterative decoding algorithms; low-density parity-check codes; signal-to-noise ratio; Algorithm design and analysis; Analog circuits; Analog integrated circuits; Convergence; Integrated circuit interconnections; Iterative algorithms; Iterative decoding; Parity check codes; Signal to noise ratio; Throughput; Analog iterative decoder; belief propagation (BP); convergence speed; low-density parity-check (LDPC) codes; min-sum (MS) decoding; throughput; turbo codes;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2007.895978

Filename

4200947