{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/8920"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/8920","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Unequal Erasure Protection Techniques for Scalable Multi-Streams","abstract":"<p>This thesis presents a novel unequal erasure protection (UEP) strategy for the transmission of scalable data, formed by interleaving independently decodable and scalable streams, over packet erasure networks. The technique, termed multi-stream unequal erasure protection (M-UEP) differs from UEP by placing separate streams in separate packets to establish independence and using permuted systematic Reed-Solomon codes to enhance the distribution of message symbols amongst the packets. M-UEP improves upon UEP by ensuring that all received source symbols are decoded. The R-D optimal redundancy allocation problem for M-UEP is formulated and its globally optimal solution is shown to have a time complexity of O(2^N N(L+1)^(N+1)), where N is the number of packets and L is the packet length. To address the high complexity of the globally optimal solution, an efficient sub-optimal algorithm which runs in O(N^2 L^2) time is formulated. The additional side information necessary for M-UEP at the decoder is discussed and an upper bound on the amount of side information is derived. To mitigate the necessary side information, a technique termed (FM-UEP) is presented. A constrained optimal algorithm for generating N substreams from P primary substreams (P > N) is formulated, where the placement of primary substreams into N groups is constrained to a fixed-order. Four possible fixed-orders are proposed: raster scan, zig-zag scan, dispersed dot dithered and subband dispersed. Experiments performed on SPIRT coded images (with appropriate grouping of wavelet coefficient) validate the superiority of M-UEP and FM-UEP over UEP, with peak improvements of 0.6 and 0.5 dB, respectively. Additionally, our tests reveal that M-UEP is more robust than UEP in adverse, unpredictable and varying channel conditions.</p>","abstract_html":"&lt;p&gt;This thesis presents a novel unequal erasure protection (UEP) strategy for the transmission of scalable data, formed by interleaving independently decodable and scalable streams, over packet erasure networks. The technique, termed multi-stream unequal erasure protection (M-UEP) differs from UEP by placing separate streams in separate packets to establish independence and using permuted systematic Reed-Solomon codes to enhance the distribution of message symbols amongst the packets. M-UEP improves upon UEP by ensuring that all received source symbols are decoded. The R-D optimal redundancy allocation problem for M-UEP is formulated and its globally optimal solution is shown to have a time complexity of O(2^N N(L+1)^(N+1)), where N is the number of packets and L is the packet length. To address the high complexity of the globally optimal solution, an efficient sub-optimal algorithm which runs in O(N^2 L^2) time is formulated. The additional side information necessary for M-UEP at the decoder is discussed and an upper bound on the amount of side information is derived. To mitigate the necessary side information, a technique termed (FM-UEP) is presented. A constrained optimal algorithm for generating N substreams from P primary substreams (P &gt; N) is formulated, where the placement of primary substreams into N groups is constrained to a fixed-order. Four possible fixed-orders are proposed: raster scan, zig-zag scan, dispersed dot dithered and subband dispersed. Experiments performed on SPIRT coded images (with appropriate grouping of wavelet coefficient) validate the superiority of M-UEP and FM-UEP over UEP, with peak improvements of 0.6 and 0.5 dB, respectively. Additionally, our tests reveal that M-UEP is more robust than UEP in adverse, unpredictable and varying channel conditions.&lt;/p&gt;","abstract_has_math":false,"creators":["RIVERS, KEITH GEOFFREY"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Dumitrescu, Sorina","Shirani, Shahram"],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-06","date_published":"2009-06","updated_at":"2026-11-18T19:39:49Z","subjects":["Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/24118"],"render_values":[{"text":"https://doi.org/10.71548/24118","href":"https://doi.org/10.71548/24118","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/4089","5108","2013026"],"render_values":[{"text":"opendissertations/4089","href":null,"code":true},{"text":"5108","href":null,"code":true},{"text":"2013026","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/8920","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/8920","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F8920","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Dumitrescu, Sorina","Shirani, Shahram"]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["RIVERS, KEITH GEOFFREY"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:44:40Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:44:40Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-05-13"]},{"key":"dc:date.issued","label":"Date","values":["2009-06"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/4089","5108","2013026"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/8920","https://doi.org/10.71548/24118"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>This thesis presents a novel unequal erasure protection (UEP) strategy for the transmission of scalable data, formed by interleaving independently decodable and scalable streams, over packet erasure networks. The technique, termed multi-stream unequal erasure protection (M-UEP) differs from UEP by placing separate streams in separate packets to establish independence and using permuted systematic Reed-Solomon codes to enhance the distribution of message symbols amongst the packets. M-UEP improves upon UEP by ensuring that all received source symbols are decoded. The R-D optimal redundancy allocation problem for M-UEP is formulated and its globally optimal solution is shown to have a time complexity of O(2^N N(L+1)^(N+1)), where N is the number of packets and L is the packet length. To address the high complexity of the globally optimal solution, an efficient sub-optimal algorithm which runs in O(N^2 L^2) time is formulated. The additional side information necessary for M-UEP at the decoder is discussed and an upper bound on the amount of side information is derived. To mitigate the necessary side information, a technique termed (FM-UEP) is presented. A constrained optimal algorithm for generating N substreams from P primary substreams (P > N) is formulated, where the placement of primary substreams into N groups is constrained to a fixed-order. Four possible fixed-orders are proposed: raster scan, zig-zag scan, dispersed dot dithered and subband dispersed. Experiments performed on SPIRT coded images (with appropriate grouping of wavelet coefficient) validate the superiority of M-UEP and FM-UEP over UEP, with peak improvements of 0.6 and 0.5 dB, respectively. Additionally, our tests reveal that M-UEP is more robust than UEP in adverse, unpredictable and varying channel conditions.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Applied Science (MASc)"]},{"key":"dc:title","label":"Title","values":["Unequal Erasure Protection Techniques for Scalable Multi-Streams"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Dumitrescu, Sorina","Shirani, Shahram"],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["RIVERS, KEITH GEOFFREY"],"dc:date.accessioned":["2014-06-18T16:44:40Z"],"dc:date.available":["2014-06-18T16:44:40Z"],"dc:date.created":["2011-05-13"],"dc:date.issued":["2009-06"],"dc:description.abstract":["<p>This thesis presents a novel unequal erasure protection (UEP) strategy for the transmission of scalable data, formed by interleaving independently decodable and scalable streams, over packet erasure networks. The technique, termed multi-stream unequal erasure protection (M-UEP) differs from UEP by placing separate streams in separate packets to establish independence and using permuted systematic Reed-Solomon codes to enhance the distribution of message symbols amongst the packets. M-UEP improves upon UEP by ensuring that all received source symbols are decoded. The R-D optimal redundancy allocation problem for M-UEP is formulated and its globally optimal solution is shown to have a time complexity of O(2^N N(L+1)^(N+1)), where N is the number of packets and L is the packet length. To address the high complexity of the globally optimal solution, an efficient sub-optimal algorithm which runs in O(N^2 L^2) time is formulated. The additional side information necessary for M-UEP at the decoder is discussed and an upper bound on the amount of side information is derived. To mitigate the necessary side information, a technique termed (FM-UEP) is presented. A constrained optimal algorithm for generating N substreams from P primary substreams (P > N) is formulated, where the placement of primary substreams into N groups is constrained to a fixed-order. Four possible fixed-orders are proposed: raster scan, zig-zag scan, dispersed dot dithered and subband dispersed. Experiments performed on SPIRT coded images (with appropriate grouping of wavelet coefficient) validate the superiority of M-UEP and FM-UEP over UEP, with peak improvements of 0.6 and 0.5 dB, respectively. Additionally, our tests reveal that M-UEP is more robust than UEP in adverse, unpredictable and varying channel conditions.</p>"],"dc:description.degree":["Master of Applied Science (MASc)"],"dc:identifier.other":["opendissertations/4089","5108","2013026"],"dc:identifier.uri":["http://hdl.handle.net/11375/8920","https://doi.org/10.71548/24118"],"dc:subject":["Electrical and Computer Engineering"],"dc:title":["Unequal Erasure Protection Techniques for Scalable Multi-Streams"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:39:49Z"}