|
News:
The Trapping Set Ontology is now online
Error Floors, Trapping Sets and Pseudo-codewords
Iterative message passing algorithms for decoding LDPC codes operate by passing messages along the edges of a graphical representation of the code known as the Tanner graph. These algorithms are optimal when the underlying graph is a tree, but in the presence of cycles, the decoding becomes sub-optimal and there exist low-weight patterns known as near codewords or trapping sets uncorrectable by the decoder. It is now well established that the trapping sets lead to error floor in the high SNR region.
Members
Bane Vasic, Michael Marcellin, Shashi Kiran Chilappagari, Dung Viet Nguyen and Shiva Kumar Planjery
Collaborators
Sundararajan Sankaranarayanan, Milos Ivkovic, Lucile Sassatelli, David Declercq, Misha Chertkov and Misha Stepanov
|