VTechWorks staff will be away for the winter holidays starting Tuesday, December 24, 2024, through Wednesday, January 1, 2025, and will not be replying to requests during this time. Thank you for your patience, and happy holidays!
 

Massively Parallel Hidden Markov Models for Wireless Applications

Simple item page
dc.contributor.authorHymel, Shawnen
dc.contributor.committeechairReed, Jeffrey H.en
dc.contributor.committeememberEllingson, Steven W.en
dc.contributor.committeememberAkbar, Ihsanen
dc.contributor.departmentElectrical and Computer Engineeringen
dc.date.accessioned2014-03-14T20:49:10Zen
dc.date.adate2012-01-03en
dc.date.available2014-03-14T20:49:10Zen
dc.date.issued2011-12-05en
dc.date.rdate2012-01-03en
dc.date.sdate2011-12-08en
dc.description.abstractCognitive radio is a growing field in communications which allows a radio to automatically configure its transmission or reception properties in order to reduce interference, provide better quality of service, or allow for more users in a given spectrum. Such processes require several complex features that are currently being utilized in cognitive radio. Two such features, spectrum sensing and identification, have been implemented in numerous ways, however, they generally suffer from high computational complexity. Additionally, Hidden Markov Models (HMMs) are a widely used mathematical modeling tool used in various fields of engineering and sciences. In electrical and computer engineering, it is used in several areas, including speech recognition, handwriting recognition, artificial intelligence, queuing theory, and are used to model fading in communication channels. The research presented in this thesis proposes a new approach to spectrum identification using a parallel implementation of Hidden Markov Models. Algorithms involving HMMs are usually implemented in the traditional serial manner, which have prohibitively long runtimes. In this work, we study their use in parallel implementations and compare our approach to traditional serial implementations. Timing and power measurements are taken and used to show that the parallel implementation can achieve well over 100Ã speedup in certain situations. To demonstrate the utility of this new parallel algorithm using graphics processing units (GPUs), a new method for signal identification is proposed for both serial and parallel implementations using HMMs. The method achieved high recognition at -10 dB Eb/N0. HMMs can benefit from parallel implementation in certain circumstances, specifically, in models that have many states or when multiple models are used in conjunction.en
dc.description.degreeMaster of Scienceen
dc.identifier.otheretd-12082011-204951en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-12082011-204951/en
dc.identifier.urihttp://hdl.handle.net/10919/36017en
dc.publisherVirginia Techen
dc.relation.haspartHymel_SR_T_2011.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectHidden Markov Modelsen
dc.subjectCUDAen
dc.subjectGPUen
dc.subjectGPGPUen
dc.subjectParallel Processingen
dc.subjectSignal Recognitionen
dc.titleMassively Parallel Hidden Markov Models for Wireless Applicationsen
dc.typeThesisen
thesis.degree.disciplineElectrical and Computer Engineeringen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Hymel_SR_T_2011.pdf
Size:
3.33 MB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses