"Data transmitted across a full-surface channel is referenced by a two-dimensional index set. Demodulation algorithms with an element of randomness such as the soft output greedy algorithm can be used to demodulate the full-surface data in the presence of noise and intersymbol interference across both rows and columns.
By using the greedy algorithm and by applying the Shannon-McMillan-Breimann theorem, the entropy rate h(r) of the output of a full-surface channel can be estimated. The entropy rate associated with the noise is given by h(r | u) = h0 = (1/2)log2 2π σ2e, and the capacity of a full-surface channel can be estimated by C ≈ h(r) - h(r | u), where the entropy rates are defined in the usual way.
In general, the estimated capacity increases continuously with the increase in signal-to-noise ratio, reaching the value of unity, the maximum achievable capacity at a signal-to-noise ratio of around 9 dB"--Abstract, page iii.
Moss, Randy Hays, 1953-
Kosbar, Kurt Louis
Electrical and Computer Engineering
M.S. in Electrical Engineering
University of Missouri--Rolla
vii, 36 pages
© 2003 Asif Iqbal Mohammad, All rights reserved.
Thesis - Restricted Access
Optical storage devices -- Mathematical models
Print OCLC #
Link to Catalog Record
Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.http://merlin.lib.umsystem.edu/record=b5086563~S5
Mohammad, Asif Iqbal, "Estimating the capacity of two-dimensional channels" (2003). Masters Theses. 2426.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.