Worst-case pattern evaluation of baseband channels

  • Authors:
  • R. Kiwimagi;L. Griffiths;R. Furtney

  • Affiliations:
  • IBM General Products Division laboratory, Boulder, CO;University of Colorado, Boulder, CO;IBM General Products Division laboratory

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1977

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a new method for evaluating the performance of communication systems that use binary-valued signaling formats. This technique permits selection of the best overall code for a particular channel or, alternatively, provides a method for comparing different channels that use the same transmission code. Encoded waveforms at the channel input are presumed to be generated by a constrained-coding procedure, which ensures, for example, that the resulting binary waveform has a certain minimum number of transitions per unit time, limited digital sum variations (DSV), among other characteristics. With this method, one first determines that particular sequence (within the given code constraints) that produces the maximum amount of intersymbol-interference when transmitted through the given channel. A dynamic-programming procedure is used to compute this sequence. Overall channel performance is evaluated by calculating the probability of error and the minimum eye-pattern opening. Numerical examples illustrating the procedure for a synthetic channel are presented and analyzed.