Estimating the capacity of two-dimensional channels

Author

Asif Iqbal Mohammad

Abstract

"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) = h₀ = (1/2)log₂ 2π σ²e, 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.

Advisor(s)

Weeks, William

Committee Member(s)

Moss, Randy Hays, 1953-
Kosbar, Kurt Louis

Department(s)

Electrical and Computer Engineering

Degree Name

M.S. in Electrical Engineering

Publisher

University of Missouri--Rolla

Publication Date

Fall 2003

Pagination

vii, 36 pages

Note about bibliography

Includes bibliographical references (page 35).

Rights

© 2003 Asif Iqbal Mohammad, All rights reserved.

Document Type

Thesis - Restricted Access

File Type

text

Language

English

Subject Headings

Optical storage devices -- Mathematical models

Thesis Number

T 8389

Print OCLC #

55133205

Recommended Citation

Mohammad, Asif Iqbal, "Estimating the capacity of two-dimensional channels" (2003). Masters Theses. 2426.
https://scholarsmine.mst.edu/masters_theses/2426