Decoding of half-rate wavelet codes; Golay code and more

نویسندگان

  • Faramarz Fekri
  • Steven W. McLaughlin
  • Russell M. Mersereau
  • Ronald W. Schafer
چکیده

The primary goal of this paper is to give examples of the recently developed (finite-field) wavelet coding method by studying the encoder and decoder for some half-rate codes. We propose a decoding methodology based on estimating the polyphase components of the channel error pattern. To demonstrate the striking computational savings of the wavelet coding method over alternatives, we show that bounded-distance decoding of the (24,12,8) Golay code requires only weight computations (or at the worst case, it needs a cyclic lookup table of table size 12). The simplicity and computational savings that finite field wavelets offer for the encoding and decoding of wavelet block codes indicate their powerful capacities for error control coding applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes

An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.

متن کامل

Title Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes

An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.

متن کامل

Reed-Muller Codec Simulation Performance

The approach to error correction coding taken by modern digital communication systems started in the late 1940’s with the ground breaking work of Shannon, Hamming and Golay. ReedMuller (RM) codes were an important step beyond the Hamming and Golay codes because they allowed more flexibility in the size of the code word and the number of correctable errors per code word. Whereas the Hamming and ...

متن کامل

Decoding by sequential code reduction

A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.

متن کامل

Acyclic Tanner Graphs and Maximum-Likelihood Decoding of Linear Block Codes

The maximum-likelihood decoding of linear block codes by the Wagner rule decoding is discussed. In this approach, the Wagner rule decoding which has been primarily applied to single parity check codes is employed on acyclic Tanner graphs. Accordingly, a coset decoding equipped with the Wagner rule decoding is applied to the decoding of a code C having a Tanner graph with cycles. A subcode C1 of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001