{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-2250"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-2250","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"New Analytical Bounds on the Probability of Code-Word Error for Convolution Codes with Viterbi Decoding","abstract":"New analytical bounds are developed for the probability of code-word error in a communication system with convolutional coding and soft-decision Viterbi decoding. The bounds are applicable to communications in channels with asynchronous interferers which are modeled as independent, partial-time white Gaussian interference sources. This model is often used in simulations to reflect the circumstances encountered in many packet radio communication networks. The new results include both purely analytical bounds and offline-simulation-aided bounds that permit implementation of accurate communication-link models with much lower online computational and storage requirements than are required with traditional Monte Carlo simulations of link performance. They significantly improve the trade-off that has previously existed between model fidelity and simulation complexity in Monte Carlo simulations of large-scale wireless communication networks with links employing convolutional coding.","abstract_html":"New analytical bounds are developed for the probability of code-word error in a communication system with convolutional coding and soft-decision Viterbi decoding. The bounds are applicable to communications in channels with asynchronous interferers which are modeled as independent, partial-time white Gaussian interference sources. This model is often used in simulations to reflect the circumstances encountered in many packet radio communication networks. The new results include both purely analytical bounds and offline-simulation-aided bounds that permit implementation of accurate communication-link models with much lower online computational and storage requirements than are required with traditional Monte Carlo simulations of link performance. They significantly improve the trade-off that has previously existed between model fidelity and simulation complexity in Monte Carlo simulations of large-scale wireless communication networks with links employing convolutional coding.","abstract_has_math":false,"creators":["Tomar, Shweta"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Noneaker, Daniel L","Pursley , Michael B","Russell , Harlan B"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:08:14Z","subjects":["bounds","convolutional code","patial-time white Gaussian Interference","Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/1250","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/1250","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-2250","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Noneaker, Daniel L","Pursley , Michael B","Russell , Harlan B"]},{"key":"dc:creator","label":"Author","values":["Tomar, Shweta"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-09-30T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["bounds","convolutional code","patial-time white Gaussian Interference","Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/1250"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["New analytical bounds are developed for the probability of code-word error in a communication system with convolutional coding and soft-decision Viterbi decoding. The bounds are applicable to communications in channels with asynchronous interferers which are modeled as independent, partial-time white Gaussian interference sources. This model is often used in simulations to reflect the circumstances encountered in many packet radio communication networks. The new results include both purely analytical bounds and offline-simulation-aided bounds that permit implementation of accurate communication-link models with much lower online computational and storage requirements than are required with traditional Monte Carlo simulations of link performance. They significantly improve the trade-off that has previously existed between model fidelity and simulation complexity in Monte Carlo simulations of large-scale wireless communication networks with links employing convolutional coding."]},{"key":"dc:title","label":"Title","values":["New Analytical Bounds on the Probability of Code-Word Error for Convolution Codes with Viterbi Decoding"]}]}],"canonical_facts":{"dc:contributor":["Noneaker, Daniel L","Pursley , Michael B","Russell , Harlan B"],"dc:creator":["Tomar, Shweta"],"dc:date.available":["2015-09-30T07:00:00Z"],"dc:date.created":["2011-12-01T08:00:00Z"],"dc:description.abstract":["New analytical bounds are developed for the probability of code-word error in a communication system with convolutional coding and soft-decision Viterbi decoding. The bounds are applicable to communications in channels with asynchronous interferers which are modeled as independent, partial-time white Gaussian interference sources. This model is often used in simulations to reflect the circumstances encountered in many packet radio communication networks. The new results include both purely analytical bounds and offline-simulation-aided bounds that permit implementation of accurate communication-link models with much lower online computational and storage requirements than are required with traditional Monte Carlo simulations of link performance. They significantly improve the trade-off that has previously existed between model fidelity and simulation complexity in Monte Carlo simulations of large-scale wireless communication networks with links employing convolutional coding."],"dc:identifier":["https://open.clemson.edu/all_theses/1250"],"dc:subject":["bounds","convolutional code","patial-time white Gaussian Interference","Electrical and Computer Engineering"],"dc:title":["New Analytical Bounds on the Probability of Code-Word Error for Convolution Codes with Viterbi Decoding"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:08:14Z"}