BOUNDS ON MAXIMUM THROUGHPUT FOR DIGITAL COMMUNICATIONS WITH FINITE-PRECISION AND AMPLITUDE CONSTRAINTS.

Michael L. Honig*, Kenneth Steiglitz, B. Gopinath

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

The following problem is discussed: given a channel with known impulse response h(t), a transmitter with an output amplitude constraint, and a receiver that can distinguish between two signals only if they are separated in amplitude at some time t//0 by at least some small positive constant d, then what is the maximum number of messages, N, that can be transmitted in a given time interval left bracket 0,T right bracket ? Upper bounds for arbitrary h(t) are computed by solving linear programs with bounded variables and one equality constraint. Solutions to linear programs in this class can be obtained very fast using, for example, a linear-time algorithm due to C. Witzgall (1980). Numerical results are shown for different impulse responses, including a simulated telephone subscriber loop impulse response. Assuming that the receiver resolution d is small, the upper bound is typically two to three times the lower bound for the cases examined.

Original languageEnglish (US)
Pages (from-to)1862-1865
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
StatePublished - 1988

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'BOUNDS ON MAXIMUM THROUGHPUT FOR DIGITAL COMMUNICATIONS WITH FINITE-PRECISION AND AMPLITUDE CONSTRAINTS.'. Together they form a unique fingerprint.

Cite this