Memory efficient and low complexity scalable soft VLC decoding for the video transmission

Liu, Tsu-Ming; Wang, Sheng-Zen; Peng, Wen-Hsiao; Lee, Chen‐Yi

doi:10.1109/apccas.2004.1412967

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, when used on variable length codes, MAP decoding is costly due to the lack of synchronization between symbol sequences and coded bit sequences, resulting in algorithms with prohibitive complexity. The problem of reducing this high complexity has been addressed in several works [5]- [7].…”

Section: Introductionmentioning

confidence: 99%

Low complexity decoding of variable length source-channel codes

Mercier

Wasae

Labeau

2014

2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

Soft source decoders, in conjunction with error correcting channel codes, can be used to improve the error resilience of digital communication systems based on variable length codes. In this paper, we present a novel approach to reduce the complexity of maximum a posteriori variable length decoders implemented on a bit-symbol trellis. The decoding algorithm is implemented in a narrow corridor along the trellis diagonal to reduce the decoder complexity. Furthermore, by periodically adjusting the corridor boundaries, a significant reduction in complexity is achieved at the price of a small degradation in decoding performance.Index Terms-Exponential Golomb Code, variable length joint source-channel decoder, maximum a posteriori algorithm, bit-symbol trellis, corridor decoding.

show abstract

Section: Introductionmentioning

confidence: 99%