Are you David L. Neuhoff?

Claim your profile

Publications (6)0 Total impact

  • Source
    Article: Joint And Tandem Source-Channel Coding with Complexity and Delay Constraints
    Jongtae Lim, David L. Neuhoff
    [show abstract] [hide abstract]
    ABSTRACT: Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. complexity and distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint source-channel strategy; transform coding plus Reed-Solomon coding is the tandem strategy. For each strategy, formulas for the mean-squared error, computational complexity and delay are found and used to minimize distortion subject to constraints on complexity and delay, for source data modeled as Gauss-Markov. The results of such optimizations suggest there is a complexity threshold such that when the number of operations per data sample available for encoding and decoding is greater than this threshold, tandem coding is better, and when less, channel-optimized transform coding is better. Similarly, the results suggest there is also a delay threshold such that tandem coding is better than joint when only when the permissible encoding and decoding delay is greater than this threshold. Index Terms: source coding, channel coding, transform coding, Reed-Solomon coding, channel-optimized source coding, complexity threshold, delay threshold 1 This work was supported by ARO MURI Grant DAAH04-96-1-0337. Portions of this work were presented at IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 2000, and at IEEE ICASSP, Salt Lake City, UT, May 2001. 1 I.
    07/2001;
  • Source
    Article: Joint and Tandem Source-Channel Coding with Delay Constraints
    Jongtae Lim, David L. Neuhoff
    [show abstract] [hide abstract]
    ABSTRACT: Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint source-channel coding strategy; transform coding with Reed-Solomon coding is the tandem strategy. For each strategy, formulas for the mean-squared error and delay are found and used to minimize distortion subject to a delay constraint, for data modeled as Gauss-Markov. The results of such optimizations suggest there is a threshold such that when the permissible delay is above this threshold, tandem coding is better, and when below the threshold, channel-optimized transform coding is better.
    04/2001;
  • Article: Joint And Tandem Source-Channel Coding
    Jongtae Lim, David L. Neuhoff
    [show abstract] [hide abstract]
    ABSTRACT: Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint sourcechannel coding strategy; transform coding with Reed-Solomon coding is the tandem strategy. For each strategy, formulas for the mean-squared error and delay are found and used to minimize distortion subject to a delay constraint, for data modeled as Gauss-Markov. The results of such optimizations suggest there is a threshold such that when the permissible delay is above this threshold, tandem coding is better, and when below the threshold, channel-optimized transform coding is better.
    03/2001;
  • Source
    Article: Source-Channel Coding Strategies: Tandem Coding vs. Channel-Optimized Quantization
    Jongtae Lim, David L. Neuhoff
    [show abstract] [hide abstract]
    ABSTRACT: Two common source-channel coding strategies, tandem coding and channel-optimized quantization, are compared on the basis of distortion vs. complexity by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Transform coding is used in each strategy, and Reed-Solomon codes are added to form the tandem code. For each strategy, formulas for the mean-squared error and complexity are found and used to optimize it so as to minimize distortion subject to a complexity constraint, for data modeled as Gauss-Markov. The results of such optimizations suggest there is a complexity threshold such that when the number of available operations per sample is above this threshold, tandem coding is better, and when below the threshold, channel-optimized transform coding is better. 1. Introduction Two commonly cited strategies for communicating analog data samples across a binary symmetric channel are: (1) tandem coding, in which a qu...
    10/1999;
  • Article: Allocating Complexity Between Source and Channel Coding
    Jongtae Lim, David L. Neuhoff, Troy C. Nolan
    [show abstract] [hide abstract]
    ABSTRACT: Given an available number of arithmetic operations per data sample, the tandem connection of a transform source code and a Reed-Solomon channel code is optimized to minimize meansquared error when transmitting Gauss-Markov data across a binary symmetric channel. The goal is to learn how well-designed systems allocate complexity, i.e. arithmetic operations, between source and channel coding. The tandem system considered here is chosen to be as representative as possible. For the range of source and channel parameters tested, it is found that when at least moderate complexity is available, a well-designed system allocates 10 to 35% of its complexity to the source code. 1. Introduction Ever since Shannon showed that one can optimally communicate data over a channel using the tandem connection of independently designed source and channel codes, a division of labor has occurred. Much effort has been devoted to designing source codes with good performance and low complexity (i.e. low cost,...
    02/1999;
  • Article: Presented at the Workshop on Data Compression Processing Techniques, Huntsville, AL, Dec. 1998
    Jongtae Lim, David L. Neuhoff, Troy C. Nolan
    [show abstract] [hide abstract]
    ABSTRACT: Given an available number of arithmetic operations per data sample, the tandem connection of a transform source code and a Reed-Solomon channel code is optimized to minimize meansquared error when transmitting Gauss-Markov data across a binary symmetric channel. The goal is to learn how well-designed systems allocate complexity, i.e. arithmetic operations, between source and channel coding. The tandem system considered here is chosen to be as representative as possible. For the range of source and channel parameters tested, it is found that when at least moderate complexity is available, a well-designed system allocates 10 to 35% of its complexity to the source code. 1. Introduction Ever since Shannon showed that one can optimally communicate data over a channel using the tandem connection of independently designed source and channel codes, a division of labor has occurred. Much effort has been devoted to designing source codes with good performance and low complexity (i.e. low cost,...
    02/1999;