Skip to main content

Interpolation by convolutional codes, overload distortion, and the erasure channel

Publication ,  Journal Article
Calderbank, AR; Duel-Hallen, A; Fishburn, PC; Rabinovich, A
Published in: IEEE Transactions on Information Theory
December 1, 1999

This paper investigates how closely randomly generated binary source sequences can be matched by convolutional code codewords. What distinguishes it from prior work is that a randomly chosen subsequence with density A is to be matched as closely as possible. The so-called marked bits of the subsequence could indicate overload quantization points for a source sample generated from the tails of a probability distribution. They might also indicate bits where the initial estimate is considered reliable, as might happen in iterated decoding. The capacity of a convolutional code to interpolate the marked subsequence might be viewed as a measure of its ability to handle overload distortion. We analyze this capacity using a Markov chain whose states are sets of subsets of trellis vertices of the convolutional code. We investigate the effect of memory on the probability of perfect interpolation and calculate the residual rate on the unmarked bits of the binary source sequence. We relate our interpolation methodology to sequence-based methods of quantization and use it to analyze the performance of convolutional codes on the pure erasure channel. © 1999 IEEE.

Duke Scholars

Published In

IEEE Transactions on Information Theory

DOI

ISSN

0018-9448

Publication Date

December 1, 1999

Volume

45

Issue

1

Start / End Page

94 / 105

Related Subject Headings

  • Networking & Telecommunications
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R., Duel-Hallen, A., Fishburn, P. C., & Rabinovich, A. (1999). Interpolation by convolutional codes, overload distortion, and the erasure channel. IEEE Transactions on Information Theory, 45(1), 94–105. https://doi.org/10.1109/18.746774
Calderbank, A. R., A. Duel-Hallen, P. C. Fishburn, and A. Rabinovich. “Interpolation by convolutional codes, overload distortion, and the erasure channel.” IEEE Transactions on Information Theory 45, no. 1 (December 1, 1999): 94–105. https://doi.org/10.1109/18.746774.
Calderbank AR, Duel-Hallen A, Fishburn PC, Rabinovich A. Interpolation by convolutional codes, overload distortion, and the erasure channel. IEEE Transactions on Information Theory. 1999 Dec 1;45(1):94–105.
Calderbank, A. R., et al. “Interpolation by convolutional codes, overload distortion, and the erasure channel.” IEEE Transactions on Information Theory, vol. 45, no. 1, Dec. 1999, pp. 94–105. Scopus, doi:10.1109/18.746774.
Calderbank AR, Duel-Hallen A, Fishburn PC, Rabinovich A. Interpolation by convolutional codes, overload distortion, and the erasure channel. IEEE Transactions on Information Theory. 1999 Dec 1;45(1):94–105.

Published In

IEEE Transactions on Information Theory

DOI

ISSN

0018-9448

Publication Date

December 1, 1999

Volume

45

Issue

1

Start / End Page

94 / 105

Related Subject Headings

  • Networking & Telecommunications
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0801 Artificial Intelligence and Image Processing