2026-09-18T21:44:35Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/422512022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Gregory W. Wornell and Christopher Yu.
Boyle, Kevin P. (Kevin Patrick)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2008-09-03T15:04:49Z
2008-09-03T15:04:49Z
2007
2007
http://hdl.handle.net/1721.1/42251
231635249
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 141-143).
In this thesis we examine two different rateless codes and create a rateless unequal error protection code, all for the additive white Gaussian noise (AWGN) channel. The two rateless codes are examined through both analysis and simulation with the hope of developing a better understanding of how the codes will perform and pushing the codes further toward implementation. After analyzing and simulating the rateless codes by themselves, we compare using a rateless code to two different forms of hybrid automatic repeat request (HARQ), namely Chase combining HARQ and incremental redundancy HARQ. We find that the rateless codes compare favorably to both forms of HARQ. In addition, we develop a code that has both rateless and unequal error protection (UEP) properties. A rateless code adapts to the quality of the channel and achieves capacity but all of the information bits are decoded at the same time and thus the bitstream cannot be prioritized. In addition, if only a finite number of retransmissions is allowed, the range of available rates that a rateless code can provide is limited. In contrast, a UEP code provides a prioritization of the bitstream, and an arbitrary range of rates but does not achieve capacity. The rateless UEP code, or RUEP code for short, provides the prioritization of a bitstream that UEP provides, and also adapts to the quality of the channel as a rateless code does. The RUEP code provides bitstream prioritization while being more efficient than a traditional UEP code and is capacity achieving for some channel realizations. In addition, the RUEP code provides a larger range of available rates than a rateless code when only a finite number of retransmissions is allowed.
by Kevin P. Boyle.
S.M.
143 p.
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.
Rateless and rateless unequal error protection codes for Gaussian channels
Rateless and RUEP codes for Gaussian channels
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6683bda6-14f9-4345-9565-3a93e28fc477">
<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>Rateless and rateless unequal error protection codes for Gaussian channels</Title>
<Subtitle>Rateless and RUEP codes for Gaussian channels</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2007</PublicationDate>
<Authors>
<Author>
<DisplayName>Boyle, Kevin P. (Kevin Patrick)</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>In this thesis we examine two different rateless codes and create a rateless unequal error protection code, all for the additive white Gaussian noise (AWGN) channel. The two rateless codes are examined through both analysis and simulation with the hope of developing a better understanding of how the codes will perform and pushing the codes further toward implementation. After analyzing and simulating the rateless codes by themselves, we compare using a rateless code to two different forms of hybrid automatic repeat request (HARQ), namely Chase combining HARQ and incremental redundancy HARQ. We find that the rateless codes compare favorably to both forms of HARQ. In addition, we develop a code that has both rateless and unequal error protection (UEP) properties. A rateless code adapts to the quality of the channel and achieves capacity but all of the information bits are decoded at the same time and thus the bitstream cannot be prioritized. In addition, if only a finite number of retransmissions is allowed, the range of available rates that a rateless code can provide is limited. In contrast, a UEP code provides a prioritization of the bitstream, and an arbitrary range of rates but does not achieve capacity. The rateless UEP code, or RUEP code for short, provides the prioritization of a bitstream that UEP provides, and also adapts to the quality of the channel as a rateless code does. The RUEP code provides bitstream prioritization while being more efficient than a traditional UEP code and is capacity achieving for some channel realizations. In addition, the RUEP code provides a larger range of available rates than a rateless code when only a finite number of retransmissions is allowed.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>