Yao Qi, Raja Das, et al.
ISSTA 2009
The interval between the “0” level and “1” level of a binary channel with Gaussian noise is subdivided to provide n = 2g levels per symbol. The channel capacity is computed as a function of g and of the signal-noise ratio D of the original binary channel. For a sufficiently large, fixed value of D, if we increase 9 indefinitely, the channel capacity approaches the logarithm of D, as can be expected from continuous channel. For a fixed value of g, if we increase D indefinitely, the channel capacity approaches g. For a given value of D, there is a certain value of g, beyond which the channel capacity does not appreciably increase any longer by increasing g. The problem is first solved by a simplifying model, and then the error introduced by this simplification is estimated. © 1957 IEEE. All rights reserved.
Yao Qi, Raja Das, et al.
ISSTA 2009
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Daniel M. Bikel, Vittorio Castelli
ACL 2008
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989