Iterative Decoding of Serially Concatenated Arithmetic and Channel Codes With JPEG 2000 Applications

Grangetto, Marco; Scanavino, B.; Olmo, Gabriella; Benedetto, S.

doi:10.1109/tip.2007.896612

Cited by 29 publications

(26 citation statements)

References 43 publications

(72 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Performance is further improved if soft information is iteratively exchanged between source and channel decoder. The proposed schemes in [7], [8], [9], [10] consider state machine representation of arithmetic decoding to apply channel decoding techniques like Viterbi, list-Viterbi, and other sequential search techniques. In [7] stack algorithm and M-algorithm was applied for maximum a posteriori (MAP) error correction decoding of arithmetic codes with forbidden symbol.…”

Section: Introductionmentioning

confidence: 99%

“…In [7] stack algorithm and M-algorithm was applied for maximum a posteriori (MAP) error correction decoding of arithmetic codes with forbidden symbol. The proposed approach in [8] enables iterative decoding of arithmetic codes by means of soft-input soft-output (SISO) decoder based on suboptimal search and pruning of a binary tree. Authors in [11] propose a low complexity SISO decoder for arithmetic codes using softoutput Viterbi algorithm principle and a trellis description of arithmetic codes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Accumulator Aided Decoding of Low Complexity SISO Arithmetic Codes with Image Transmission Application

Majumder¹,

Verma²

2013

IJCA

View full text Add to dashboard Cite

In this paper, we address Joint Source-Channel (JSC) decoding with low decoding complexity over wireless channel. We propose a unity rate accumulator based design for soft-input soft-out decoding for low complexity Chase-like decoding of arithmetic codes. Chase-like decoding is a low complexity algorithm, where a maximum a posteriori sequence estimation criterion is employed for maximum likelihood decoding of variable length codes like arithmetic codes. Previous contributions propose iterative decoding SISO arithmetic codes with convolutional codes and LDPC codes. We propose application of unity rate accumulator as inner encoder and decoder in the system, which improves the bit error performance of the system by 1.25 dB with same number of decoding iterations. We evaluate the performance of the proposed scheme for image transmission application.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Accumulator Aided Decoding of Low Complexity SISO Arithmetic Codes with Image Transmission Application

Majumder¹,

Verma²

2013

IJCA

View full text Add to dashboard Cite

show abstract

“…Recent contributions proposed to exploit the efficiency of turbo decoding by integrating the arithmetic decoder in an iterative decoding process [13,[16][17][18]. These contributions used finite-state machine representations for the AC to apply Soft-Input Soft-Output (SISO) decoding algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…Iterative decoding is then performed by concatenating the ACs with a Recursive Systematic Convolutional Code (RSCC). It is worth pointing out that the techniques introduced in [13,16] were applied for JPEG 2000 compressed image transmission. We notice that all the proposed techniques rely on specific trellis constructions with eventually pruning, which results in various efficiencies in terms of error correction performance.…”

Section: Introductionmentioning

confidence: 99%

Joint source/channel iterative arithmetic decoding with JPEG 2000 image transmission application

Zaïbi

Zribi

Pyndiah

et al. 2012

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

Motivated by recent results in Joint Source/Channel coding and decoding, we consider the decoding problem of Arithmetic Codes (AC). In fact, in this article we provide different approaches which allow one to unify the arithmetic decoding and error correction tasks. A novel length-constrained arithmetic decoding algorithm based on Maximum A Posteriori sequence estimation is proposed. The latter is based on soft-input decoding using a priori knowledge of the source-symbol sequence and the compressed bit-stream lengths. Performance in the case of transmission over an Additive White Gaussian Noise channel is evaluated in terms of Packet Error Rate. Simulation results show that the proposed decoding algorithm leads to significant performance gain while exhibiting very low complexity. The proposed soft input arithmetic decoder can also generate additional information regarding the reliability of the compressed bit-stream components. We consider the serial concatenation of the AC with a Recursive Systematic Convolutional Code, and perform iterative decoding. We show that, compared to tandem and to trellis-based Soft-Input Soft-Output decoding schemes, the proposed decoder exhibits the best performance/ complexity tradeoff. Finally, the practical relevance of the presented iterative decoding system is validated under an image transmission scheme based on the JPEG 2000 standard and excellent results in terms of decoded image quality are obtained.

show abstract

“…To construct robust decoding method, soft decoding of ERAC [6] is implemented by the M-BCJR algorithm, which is obtained following the standard approach of the BCJR algorithm [7]. The performance of soft decoding of ERAC and iterative decoding concatenated with other channels codes for JPEG2000 image transmission [8] is studied. A joint source-channel decoding scheme of image transmission [9] is proposed, whose iterative decoding is completed by concatenating ERAC and LDPC.…”

Section: Introductionmentioning

confidence: 99%

A new adaptive Soft-in Soft-out decoding method of error resilient arithmetic codes

Pang

Wen

Yang

2010

2010 Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (PrimeAsia)

View full text Add to dashboard Cite

Iterative Joint Source Channel Decoding(IJSCD) is an effective technique to improve the overall performance of communication systems. However, it is based on Soft-in Soft-out (SISO) decoding of error correcting codes. In this paper, a new SISO decoding method of error resilient arithmetic codes (ERAC) is proposed, which is based on the conventional BCJR algorithm but sequentially prune nodes according to the channel conditions. The performance of this decoding method across AWGN channel is evaluated. Simulation results show that there are about 1.2dB gains with respect to the performance of traditional decoding of arithmetic codes, and its performance is even better than the existing SISO decoding method of ERAC implemented by the M-BCJR algorithm.

show abstract

Iterative Decoding of Serially Concatenated Arithmetic and Channel Codes With JPEG 2000 Applications

Cited by 29 publications

References 43 publications

Accumulator Aided Decoding of Low Complexity SISO Arithmetic Codes with Image Transmission Application

Accumulator Aided Decoding of Low Complexity SISO Arithmetic Codes with Image Transmission Application

Joint source/channel iterative arithmetic decoding with JPEG 2000 image transmission application

A new adaptive Soft-in Soft-out decoding method of error resilient arithmetic codes

Contact Info

Product

Resources

About