Error exponents for multipath fading channels : a strong coding theorem
Name
51974125-MIT.pdf
Description
Full printable version
Size
186.82 KB
Format
Adobe PDF
Checksum (MD5)
687a64187525fdab1c6924c52d5b0347
Author(s)
Lun, Desmond S. (Desmond Siu Men), 1979-
Advisor(s)
Muriel Médard.
Date Issued
2002
Publisher
Massachusetts Institute of Technology
Abstract
We derive upper and lower bounds on the probability of error (the exponents of which are the error exponents) with "peaky" signaling -- the signaling strategy that achieves the capacity of the multipath fading channel under an average power constraint in the limit of infinite bandwidth. These bounds constitute a strong coding theorem for the channel as they not only delimit the range of achievable rates, but also give us a relationship among the error probability, data rate, bandwidth, "peakiness", and fading parameters such as the coherence time. They can be used to compare peaky signaling to other large bandwidth systems over fading channels, such as ultrawide band (UWB) radio and wideband CDMA. We first derive an upper bound for general fading, then specialize to the case of Rayleigh fading where we obtain upper and lower bounds that are exponentially tight and therefore yield the reliability function. We study the behavior of the reliability function and the upper and lower error probability bounds numerically.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
Includes bibliographical references (leaves 43-45).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
