Event Details
Efficient Decoding of Low Density Parity Check Codes and Irregular Repeat Accumulate Codes over GF(2m)
Presenter: Michael Bandsmer
Supervisor:
Date: Fri, November 16, 2001
Time: 09:30:00 - 10:30:00
Place: EOW 230
ABSTRACT
ABSTRACT
In order to achieve reliable communications over noisy channels, the technique of error control coding is used. Among the most powerful error control codes available are binary Low Density Parity Check (LDPC) codes and Irregular Repeat Accumulate (IRA) codes. Recent work has shown that these codes can perform even better when extended to non-binary fields. In this presentation, we develop a new decoding algorithm for irregular LDPC codes and IRA codes over fields GF(q=2m). Our new algorithm decreases the decoding complexity from O(N q2) to O(N q log q), where N is the number of edges in the Tanner graph for the code. This results in significant time savings even for codes over GF(4). Simulation results for IRA codes over GF(2m) are also presented.
Contact Information:
Michael Bandsmer, M.A.Sc student
Dept. of Electrical and Computer Engineering
University of Victoria
Tel: (250) 721-6043
Email: mbandsme@ece.uvic.ca