Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Irregular RepeatAccumulate Codes 1 Hui Jin, Aamod Khandekar, and Robert McEliece
 

Summary: Irregular Repeat­Accumulate Codes 1
Hui Jin, Aamod Khandekar, and Robert McEliece
Department of Electrical Engineering, California Institute of Technology
Pasadena, CA 91125 USA
E-mail: {hui, aamod, rjm}@systems.caltech.edu
Abstract: In this paper we will introduce an
ensemble of codes called irregular repeat-accumulate
(IRA) codes. IRA codes are a generalization of the
repeat-accumluate codes introduced in [1], and as such
have a natural linear-time encoding algorithm. We
shall prove that on the binary erasure channel, IRA
codes can be decoded reliably in linear time, using
iterative sum-product decoding, at rates arbitrarily
close to channel capacity. A similar result appears
to be true on the AWGN channel, although we have
no proof of this. We illustrate our results with nu-
merical and experimental examples.
Keywords: repeat-accumulate codes, turbo-codes,
low-density parity-check codes, iterative decoding.
1. INTRODUCTION

  

Source: Abu-Mostafa, Yaser S. - Department of Mechanical Engineering & Computer Science Department, California Institute of Technology
McEliece, Robert J. - Department of Electrical Engineering, California Institute of Technology

 

Collections: Computer Technologies and Information Sciences; Engineering