D
D.M. Arnold
Researcher at IBM
Publications - 19
Citations - 3619
D.M. Arnold is an academic researcher from IBM. The author has contributed to research in topics: Channel capacity & Communication channel. The author has an hindex of 11, co-authored 19 publications receiving 3422 citations. Previous affiliations of D.M. Arnold include ETH Zurich.
Papers
More filters
Journal ArticleDOI
Regular and irregular progressive edge-growth tanner graphs
TL;DR: Simulation results show that the PEG algorithm is a powerful algorithm to generate good short-block-length LDPC codes.
Journal ArticleDOI
Simulation-Based Computation of Information Rates for Channels With Memory
TL;DR: 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.
Proceedings ArticleDOI
Progressive edge-growth Tanner graphs
TL;DR: It is shown how to exploit the PEG graph construction to obtain LDPC codes that allow linear time encoding and the advantages of PEG Tanner graphs over randomly constructed graphs are demonstrated by extensive simulation results on code performance.
Proceedings ArticleDOI
Efficient implementations of the sum-product algorithm for decoding LDPC codes
TL;DR: By exploiting the inherent robustness of LLRs, it is shown, via simulations, that coarse quantization tables are sufficient to implement complex core operations with negligible or no loss in performance.
Proceedings ArticleDOI
On the information rate of binary-input channels with memory
D.M. Arnold,Hans-Andrea Loeliger +1 more
TL;DR: The entropy rate of a finite-state hidden Markov model can be estimated by forward sum-product trellis processing of simulated model output data to compute information rates of binary-input AWGN channels with memory.