Lab Home | Phone | Search
Center for Nonlinear Studies  Center for Nonlinear Studies
 Home 
 People 
 Current 
 Affiliates 
 Visitors 
 Students 
 Research 
 ICAM-LANL 
 Publications 
 Conferences 
 Workshops 
 Sponsorship 
 Talks 
 Colloquia 
 Colloquia Archive 
 Seminars 
 Postdoc Seminars Archive 
 Quantum Lunch 
 CMS Colloquia 
 Q-Mat Seminars 
 Q-Mat Seminars Archive 
 Archive 
 Kac Lectures 
 Dist. Quant. Lecture 
 Ulam Scholar 
 Colloquia 
 
 Jobs 
 Students 
 Summer Research 
 Visitors 
 Description 
 Past Visitors 
 Services 
 General 
 
 History of CNLS 
 
 Maps, Directions 
 CNLS Office 
 T-Division 
 LANL 
 
Tuesday, November 24, 2009
10:30 AM - 11:30 AM
CNLS Conference Room (TA-3, Bldg 1690)

Seminar

On Trapping Sets for Repeat Multiple Accumulate Codes

Joerg Kliewer
Klipsch School of Electrical and Computer Engineering, New Mexico State University

The talk considers repeat multiple accumulate (RMA) codes which are obtained by serially concatenating a repetition code with two or more accumulators. Such a code has the advantage of a very low encoding complexity and is therefore well suited for error correction in power limited environments, for example in sensor or ad-hoc networks. Decoding can be either carried out by using belief propagation (BP) on a graph or via iterative decoding. Furthermore, it has been shown that for RMA codes the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length if the number of accumulators is at least two. Recently, for LDPC codes, the notion of trapping sets has been introduced to estimate the performance of these codes under polynomial time decoding schemes as BP. In this talk, we address similar questions for the RMA ensemble. First, we consider simple Zyablov-Pinsker bitflipping decoding on the RMA graph and derive asymptotic expressions for the normalized minimum trapping distance. In particular, we answer the question whether the minimum trapping distance for the RMA ensemble exhibits asymptotic growth with block length. Then, we consider BP decoding and present a closed form finite length ensemble average trapping set enumerator for repeat multiple accumulate codes by creating a trellis representation of trapping sets. For this case, we also obtain asymptotic expressions and evaluate them numerically. Finally, we briefly consider the effect of absorbing sets on the decoder performance.

Host: Misha Chertkov