On the capacity of the Gaussian channel with a finite number of input levels

An analytic confirmation of an observation made by G. Ungerboeck (1965) that approximately optimal performance on a Gaussian channel with capacity C can be obtained with about 2/sup C+1/ levels is given. In particular, the results imply that by using about 2/sup C-1/ levels, a rate of nearly C-1 bit...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1990-11, Vol.36 (6), p.1426-1428
Main Authors: Ozarow, L.H., Wyner, A.D.
Format: Article
Language:English
Subjects:
Applied sciences
Channel capacity
Decoding
Distributed computing
Exact sciences and technology
Gaussian channels
Grid computing
Information theory
Information, signal and communications theory
Mutual information
Performance analysis
Random variables
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An analytic confirmation of an observation made by G. Ungerboeck (1965) that approximately optimal performance on a Gaussian channel with capacity C can be obtained with about 2/sup C+1/ levels is given. In particular, the results imply that by using about 2/sup C-1/ levels, a rate of nearly C-1 bit can be achieved, and that by using 2/sup C+1/ levels a rate of about C-0.4 bits can be achieved.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.59937