TY - JOUR

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

AU - Honig, Michael L.

AU - Steiglitz, Kenneth

AU - Gopinath, B.

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023725882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023725882&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0023725882

SN - 0736-7791

SP - 1862

EP - 1865

JO - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

JF - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

ER -