2026-09-23T21:59:33Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/89222022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Amos Lapidoth.
Abou Faycal, Ibrahim C. (Ibrahim Chafik)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-08-23T16:23:23Z
2005-08-23T16:23:23Z
2001
2001
http://hdl.handle.net/1721.1/8922
48971657
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
Includes bibliographical references (leaves 105-108).
The complexity of the optimal receiver for communications over a discrete-time additive Gaussian intersymbol interference channel typically grows exponentially with the duration of the channel impulse response. Consequently, practical sub-optimal receivers are often designed as though the channel impulse response were shorter than it is. While previous studies on the performance of such receivers have mainly focused on bit error rates in uncoded systems, this thesis takes a different approach to the problem. We adopt an information theoretic approach and study the rates that are achievable in the Shannon sense over the true channel with the given, possibly sub-optimal, decoding rule. One can establish that, under such mismatch conditions, the achievable rates are bounded in the Signal-to-Noise Ratio necessitating the use of a linear equalizer at the front end of the decoder. We derive the achievable rates for these schemes and optimize under complexity constraints the design of the equalizer and the receiver. Overall, two ensemble of codes are considered: the Independent Identically Distributed Gaussian ensemble and the "spherical" ensemble, where codewords are uniformly distributed over a sphere.
by Ibrahim C. Abou Faycal.
Ph.D.
108 leaves
5833690 bytes
5833449 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
An information theoretic study of reduced-complexity receivers for intersymbol interference channels
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="953cca9d-c812-4838-a52f-71bfde6bea5e">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>An information theoretic study of reduced-complexity receivers for intersymbol interference channels</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2001</PublicationDate>
<Authors>
<Author>
<DisplayName>Abou Faycal, Ibrahim C. (Ibrahim Chafik)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>The complexity of the optimal receiver for communications over a discrete-time additive Gaussian intersymbol interference channel typically grows exponentially with the duration of the channel impulse response. Consequently, practical sub-optimal receivers are often designed as though the channel impulse response were shorter than it is. While previous studies on the performance of such receivers have mainly focused on bit error rates in uncoded systems, this thesis takes a different approach to the problem. We adopt an information theoretic approach and study the rates that are achievable in the Shannon sense over the true channel with the given, possibly sub-optimal, decoding rule. One can establish that, under such mismatch conditions, the achievable rates are bounded in the Signal-to-Noise Ratio necessitating the use of a linear equalizer at the front end of the decoder. We derive the achievable rates for these schemes and optimize under complexity constraints the design of the equalizer and the receiver. Overall, two ensemble of codes are considered: the Independent Identically Distributed Gaussian ensemble and the "spherical" ensemble, where codewords are uniformly distributed over a sphere.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>