Joint source-channel list sequence decoding

نویسندگان

  • Carl Fredrik Leanderson
  • Carl-Erik W. Sundberg
چکیده

In this paper we evaluate the performance of list sequence (LS) maximum a posteriori probability (MAP) decoding on the additive white Gaussian noise (AWGN) channel and the fully interleaved flat Rayleigh fading channel. In particular, we focus on the frame error rate (FER) of LS-MAP decoding with genie-assisted error detection. It is demonstrated that LS-MAP decoding yields significant performance improvements relative to single sequence MAP decoding on the AWGN channel as well as the fully interleaved flat Rayleigh fading channel. Furthermore, feedback convolutional codes have been observed to have the potential to yield improved FER performance with both single sequence MAP and LS-MAP decoding, compared to feedforward convolutional codes. Based on these performance improvements, we propose a joint source-channel LS decoding scheme. The scheme is based on the Max-Log List Algorithm for simultaneous soft symbol and LS decoding of convolutional codes. In existing systems where a cyclic redundancy check for error mitigation is concatenated with a convolutional code for error correction, this scheme can be implemented in a fully backward compatible receiver.

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

ثبت نام

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

منابع مشابه

An algebraic approach to source coding with side information using list decoding

Existing literature on source coding with side information (SCSI) mostly uses the state-ofthe-art channel codes namely LDPC codes, turbo codes, and their variants and assume classical unique decoding. In this paper, we present an algebraic approach to SCSI based on the list decoding of the underlying channel codes. We show that the theoretical limit of SCSI can be achieved in the proposed list ...

متن کامل

Joint Source-Channel Coding and Guessing with Application to Sequential Decoding

We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense t...

متن کامل

Iterative List Decoding of Concatenated Source-Channel Codes

Whenever variable-length entropy codes are used in the presence of a noisy channel, any channel errors will propagate and cause significant harm. Despite using channel codes, some residual errors always remain, whose effect will get magnified by error propagation. Mitigating this undesirable effect is of great practical interest. One approach is to use the residual redundancy of variable-length...

متن کامل

Robust transmission of variable-length encoded sources

Digital communications systems commonly use compression (source coding) and error control (channel coding) to allow efficient and robust transmission of data over noisy channels. When compression is imperfect, some residual redundancy remains in the transmitted data and can be exploited at the decoder to improve the decoder’s probability-of-error performance. A new approach to joint source-chan...

متن کامل

Distortion Exponent in MIMO Fading Channels with Time-Varying Source Side Information

Transmission of a Gaussian source over a timevarying multiple-input multiple-output (MIMO) channel is studied under strict delay constraints. Availability of a correlated side information at the receiver is assumed, whose quality, i.e., its correlation with the source signal, also varies over time. A block-fading model is considered for the states of the time-varying channel and side informatio...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2002