Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke





.......................

.......................


Publications [#235896] of Robert Calderbank

Papers Published

  1. Bennatan, A; Calderbank, AR; Shamai, S, Bounds on the MMSE of "bad" LDPC codes at rates above capacity, 46th Annual Allerton Conference on Communication, Control, and Computing (2008), pp. 1065-1072 [doi]
    (last updated on 2017/12/12)

    Abstract:
    We present bounds on the minimum mean square error (MMSE) of LDPC codes at rates above capacity. One potential application for MMSE estimation involves cooperative communication. A relay following a compress-and-forward (CF) strategy could first compute an estimate of the transmitted codeword, to reduce the level of noise in the retransmitted signal. Our first bound is based on an analysis of the LDPC belief-propagation decoder. A second bound relies on the relationship between the mutual information and the MMSE, which was discovered by Guo et al.. We compute our bounds for "bad" LDPC codes (requiring SNRs that are far above the Shannon limit, for reliable communications to be possible) and show that such codes substantially outperform "good" codes. This advantage of "bad" codes implies an interesting degree of freedom in the design of codes for cooperative communications. © 2008 IEEE.

 

dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320