Dieter-Michael Arnold

Learn More
We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) algorithm. Lower bounds on the girth of PEG Tanner graphs and on the minimum distance of the resulting low-density parity-check (LDPC) codes are(More)
The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum-product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general(More)
We propose a general method for constructing Tanner graphs with large girth by progressively establishing edges or connections between symbol and check nodes in an edge–by–edge manner, called progressive edge–growth (PEG) construction. Lower bounds on the girth and on the minimum distance of the resulting low-density parity-check (LDPC) codes are derived in(More)
Efficient implementations of the sum-product algorithm (SPA) for decoding low-density parity-check (LDPC) codes using loglikelihood ratios (LLR) as messages between symbol and parity-check nodes are presented. Various reduced-complexity derivatives of the LLRSPA are proposed. Both serial and parallel implementations are investigated, leading to trellis and(More)
The classical Blahut–Arimoto algorithm (BAA) is a well-known algorithm that optimizes a discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in order to maximize the mutual information between channel input and output. This paper considers the problem of optimizing finite-state machine sources (FSMSs) at the input of(More)
  • 1