Low latency joint source-channel coding using overcomplete expansions and residual source redundancy

Jörg Kliewer, Alfred Mertins

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In this paper, we present a joint source-channel coding method which employs quantized overcomplete frame expansions that are binary transmitted through noisy channels. The frame expansions can be interpreted as real-valued block codes that are directly applied to waveform signals prior to quantization. At the decoder, first the index-based redundancy is used by a soft-input soft-output source decoder to determine the a posteriori probabilities for all possible symbols. Given these symbol probabilities, we then determine least-squares estimates for the reconstructed symbols. The performance of the proposed approach is evaluated for code constructions based on the DFT and is compared to other decoding approaches as well as to classical BCH block codes. The results show that the new technique is superior for a wide range of channel conditions, especially when strict delay constraints for the transmission system are given.

Original languageEnglish (US)
Title of host publicationGLOBECOM'05
Subtitle of host publicationIEEE Global Telecommunications Conference, 2005
Pages2390-2394
Number of pages5
DOIs
StatePublished - 2005
Externally publishedYes
EventGLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States
Duration: Nov 28 2005Dec 2 2005

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference
Volume4

Other

OtherGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
CountryUnited States
CitySt. Louis, MO
Period11/28/0512/2/05

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Low latency joint source-channel coding using overcomplete expansions and residual source redundancy'. Together they form a unique fingerprint.

Cite this