{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/16891"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/16891","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Error exponents for multipath fading channels : a strong coding theorem","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Lun, Desmond S. (Desmond Siu Men), 1979-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Muriel Médard."],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002","date_published":"2002","updated_at":"2026-07-22T22:21:06Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/16891","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Muriel Médard."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Lun, Desmond S. (Desmond Siu Men), 1979-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-05-19T15:10:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-05-19T15:10:48Z"]},{"key":"dc:date.issued","label":"Date","values":["2002"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/16891"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Error exponents for multipath fading channels : a strong coding theorem"]}]}],"canonical_facts":{"dc:contributor.advisor":["Muriel Médard."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Lun, Desmond S. (Desmond Siu Men), 1979-"],"dc:date.accessioned":["2005-05-19T15:10:48Z"],"dc:date.available":["2005-05-19T15:10:48Z"],"dc:date.issued":["2002"],"dc: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."],"dc:description.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."],"dc:description.degree":["S.M."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/16891"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Error exponents for multipath fading channels : a strong coding theorem"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:06Z"}