Michael Lentmaier (pictured), Daniel J. Costello Jr. (pictured), Arvind Sridharan, and Kamil Sh. Zigangirov submitted a winning paper for the ComSoc & Information Theory Society Joint Paper Awards competition.
Paper title: “Iterative Decoding Threshold Analysis for LDPC Convolutional Codes,” IEEE Transactions on Information Theory, Vol. 56, No. 10, October
2010, pp. 5274 – 5289.
In the paper, they were able to demonstrate, for the first time, that ensembles of regular low-density parity-check (LDPC) convolutional codes have iterative decoding thresholds that converge to the maximum likelihood (ML) decoding threshold as the block length gets large. Since iterative decoding complexity grows only linearly with block length, whereas ML decoding complexity grows exponentially, this work was considered a major advance in realizing practically realizable, capacity approaching code performance. Potential applications range from deep space communication to emerging wireless standards.
Dr. Costello chose to have his award presented at the ISIT 2012 conference in Cambridge, MA. Presenting the award was Gerhard Kramer (pictured), the current IT Society awards committee chair.