| Paper: | SPCOM-P4.5 | ||
| Session: | Iterative Decoding Algorithms and Architectures | ||
| Time: | Wednesday, May 19, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing for Communications: Compression, Coding, and Modulation | ||
| Title: | EFFICIENT NEAR-OPTIMUM SOFTBIT SOURCE DECODING FOR SOURCES WITH INTER- AND INTRA-FRAME REDUNDANCY | ||
| Authors: | Marc Adrat; Aachen University (RWTH) | ||
| Jean-Marc Picard; Aachen University (RWTH) | |||
| Peter Vary; Aachen University (RWTH) | |||
| Abstract: | 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. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops