Clemson University
New Analytical Bounds on the Probability of Code-Word Error for Convolution Codes with Viterbi Decoding
Abstract
dc:description.abstractNew 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Electrical and Computer Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Tomar, Shweta
- Contributors dc:contributor
-
- Noneaker, Daniel L
- Pursley , Michael B
- Russell , Harlan B
Subjects
dc:subject × 4Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_theses/1250