Efficient near-optimum softbit source decoding for sources with inter- and intra-frame redundancy

• Published in: 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing Vol. 4; p. iv
• Main Authors: Adrat, M., Picard, J.-M., Vary, P.
• Format: Conference Proceeding
• Language: English
• Published: Piscataway, N.J IEEE 2004
• Subjects: Applied sciences; Coding, codes; Computational complexity; Decoding; Delay; Detection, estimation, filtering, equalization, prediction; Encoding; Exact sciences and technology; Image processing; Information, signal and communications theory; Parameter estimation; Performance loss; Redundancy; Signal and communications theory; Signal processing; Signal, noise; Speech codecs; Speech processing; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Transmission and modulation (techniques and equipments); Video compression; Video coding; Performance evaluation; Parameter estimation; Audio signal processing; Source coding; Redundancy; Coding circuit; Artefact; Decoding; Acoustic signal processing; Algorithm; Computational complexity; Video signal processing; Codec; Audio coding; A priori estimation; Delay time; Error correction; Modem; Transmission error
• ISBN: 9780780384842; 0780384849
• ISSN: 1520-6149; 2379-190X
• DOI: 10.1109/ICASSP.2004.1326911

The source codec parameters determined by modern speech, audio, or video encoders are, especially at high compression rates, highly sensitive to transmission errors and they usually exhibit natural residual redundancy due to delay and complexity limitations in the encoding process. Error concealment techniques like softbit source decoding (SBSD) utilize the residual redundancy as a priori knowledge for parameter estimation. Therewith, the annoying artifacts of transmission errors can considerably be concealed. But, the optimal utilization of all terms of residual redundancy requires large computational complexity. In this paper, we derive a new efficient, nearly optimal version to SBSD. Significant complexity savings become possible by exploiting the intra-frame and inter-frame redundancy separately using two nested forward-backward algorithms. Compared to the optimal joint evaluation, the performance loss is negligibly small.