{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21085"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21085","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Adaptive methods for meteor burst communications","abstract":"We investigate various methods for making efficient use of the time-varying power received by radio reflection from meteor trails, including applications of variable-rate coding and variable-rate transmission. For variable-rate coding, the code rate is changed periodically during the life of the trail in an attempt to match the rate to the instantaneous signal power. For a system that employs packet transmissions, we develop an algorithm that determines the number of codewords and the rate for each codeword that maximize the probability of successful decoding for the packet. The optimal packet configuration is a function of the length of the message and the underdense trail decay constant. It is shown that the signal power required to obtain a given probability of success is significantly smaller for optimal variable-rate coding than for fixed-rate coding.","abstract_html":"We investigate various methods for making efficient use of the time-varying power received by radio reflection from meteor trails, including applications of variable-rate coding and variable-rate transmission. For variable-rate coding, the code rate is changed periodically during the life of the trail in an attempt to match the rate to the instantaneous signal power. For a system that employs packet transmissions, we develop an algorithm that determines the number of codewords and the rate for each codeword that maximize the probability of successful decoding for the packet. The optimal packet configuration is a function of the length of the message and the underdense trail decay constant. It is shown that the signal power required to obtain a given probability of success is significantly smaller for optimal variable-rate coding than for fixed-rate coding.","abstract_has_math":false,"creators":["Sandberg, Stuart Daniel"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Pursley, Michael B."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1990,"date_issued":"1990","date_published":"1990","updated_at":"2026-07-22T22:25:17Z","subjects":["Engineering, Electronics and Electrical","Computer Science"],"languages":["eng"],"rights":["Copyright 1990 Sandberg, Stuart Daniel"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9021751","(UMI)AAI9021751"],"render_values":[{"text":"AAI9021751","href":null,"code":true},{"text":"(UMI)AAI9021751","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21085","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Pursley, Michael B."]},{"key":"dc:creator","label":"Author","values":["Sandberg, Stuart Daniel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1990","2011-05-07T12:57:55Z","10000-01-01"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1990 Sandberg, Stuart Daniel"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9021751","(UMI)AAI9021751","http://hdl.handle.net/2142/21085"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We investigate various methods for making efficient use of the time-varying power received by radio reflection from meteor trails, including applications of variable-rate coding and variable-rate transmission. For variable-rate coding, the code rate is changed periodically during the life of the trail in an attempt to match the rate to the instantaneous signal power. For a system that employs packet transmissions, we develop an algorithm that determines the number of codewords and the rate for each codeword that maximize the probability of successful decoding for the packet. The optimal packet configuration is a function of the length of the message and the underdense trail decay constant. It is shown that the signal power required to obtain a given probability of success is significantly smaller for optimal variable-rate coding than for fixed-rate coding.","We also consider the incorporation of variable-rate coding in automatic-repeat-request (ARQ) protocols. A variation of type-I hybrid ARQ called variable-rate type-I hybrid ARQ is introduced. For one implementation, measurements of the trail parameters are used to select the code rate, while, for another, the selection is based on previous decoding outcomes. The throughput for each implementation is compared with the throughput for optimal variable-rate type-I hybrid ARQ. It is shown that each implementation gives significantly larger throughput than fixed-rate type-I hybrid ARQ and ARQ without forward-error-correction. For type-II hybrid ARQ, code rate variation is inherent in the coding scheme. On the first transmission, the code is effectively of high rate, but if an additional transmission is required, additional redundant symbols are sent, and the code rate is effectively lower for each subsequent transmission. The throughput for type-II hybrid ARQ is compared with the throughput for variable-rate type-I hybrid ARQ. For variable-rate transmission, the pulse length is changed periodically, based on measurements of the signal power at the destination. We have determined the maximum reliable throughput that can be obtained for variable-rate transmission, when the source and destination have perfect knowledge of the signal power and can choose from an infinite number of pulse lengths for each pulse.","Made available in DSpace on 2011-05-07T12:57:55Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9021751.pdf: 4699750 bytes, checksum: 0fadf78fbad37e2886594ee0b39557fa (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:48:23Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:21:54-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Adaptive methods for meteor burst communications"]}]}],"canonical_facts":{"dc:contributor":["Pursley, Michael B."],"dc:creator":["Sandberg, Stuart Daniel"],"dc:date":["1990","2011-05-07T12:57:55Z","10000-01-01"],"dc:description":["We investigate various methods for making efficient use of the time-varying power received by radio reflection from meteor trails, including applications of variable-rate coding and variable-rate transmission. For variable-rate coding, the code rate is changed periodically during the life of the trail in an attempt to match the rate to the instantaneous signal power. For a system that employs packet transmissions, we develop an algorithm that determines the number of codewords and the rate for each codeword that maximize the probability of successful decoding for the packet. The optimal packet configuration is a function of the length of the message and the underdense trail decay constant. It is shown that the signal power required to obtain a given probability of success is significantly smaller for optimal variable-rate coding than for fixed-rate coding.","We also consider the incorporation of variable-rate coding in automatic-repeat-request (ARQ) protocols. A variation of type-I hybrid ARQ called variable-rate type-I hybrid ARQ is introduced. For one implementation, measurements of the trail parameters are used to select the code rate, while, for another, the selection is based on previous decoding outcomes. The throughput for each implementation is compared with the throughput for optimal variable-rate type-I hybrid ARQ. It is shown that each implementation gives significantly larger throughput than fixed-rate type-I hybrid ARQ and ARQ without forward-error-correction. For type-II hybrid ARQ, code rate variation is inherent in the coding scheme. On the first transmission, the code is effectively of high rate, but if an additional transmission is required, additional redundant symbols are sent, and the code rate is effectively lower for each subsequent transmission. The throughput for type-II hybrid ARQ is compared with the throughput for variable-rate type-I hybrid ARQ. For variable-rate transmission, the pulse length is changed periodically, based on measurements of the signal power at the destination. We have determined the maximum reliable throughput that can be obtained for variable-rate transmission, when the source and destination have perfect knowledge of the signal power and can choose from an infinite number of pulse lengths for each pulse.","Made available in DSpace on 2011-05-07T12:57:55Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9021751.pdf: 4699750 bytes, checksum: 0fadf78fbad37e2886594ee0b39557fa (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:48:23Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:21:54-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9021751","(UMI)AAI9021751","http://hdl.handle.net/2142/21085"],"dc:language":["eng"],"dc:rights":["Copyright 1990 Sandberg, Stuart Daniel"],"dc:subject":["Engineering, Electronics and Electrical","Computer Science"],"dc:title":["Adaptive methods for meteor burst communications"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:17Z"}