VTechWorks staff will be away for the Thanksgiving holiday beginning at noon on Wednesday, November 27, through Friday, November 29. We will resume normal operations on Monday, December 2. Thank you for your patience.
 

Advances in Iterative Probabilistic Processing for Communication Receivers

Simple item page
dc.contributor.authorJakubisin, Daniel Josephen
dc.contributor.committeechairBuehrer, R. Michaelen
dc.contributor.committeememberMcGwier, Robert W.en
dc.contributor.committeememberBatra, Dhruven
dc.contributor.committeememberKim, Inyoungen
dc.contributor.committeememberda Silva, Claudio R. C. M.en
dc.contributor.departmentElectrical and Computer Engineeringen
dc.date.accessioned2016-06-28T08:01:07Zen
dc.date.available2016-06-28T08:01:07Zen
dc.date.issued2016-06-27en
dc.description.abstractAs wireless communication systems continue to push the limits of energy and spectral efficiency, increased demands are placed on the capabilities of the receiver. At the same time, the computational resources available for processing received signals will continue to grow. This opens the door for iterative algorithms to play an increasing role in the next generation of communication receivers. In the context of receivers, the goal of iterative probabilistic processing is to approximate maximum a posteriori (MAP) symbol-by-symbol detection of the information bits and estimation of the unknown channel or signal parameters. The sum-product algorithm is capable of efficiently approximating the marginal posterior probabilities desired for MAP detection and provides a unifying framework for the development of iterative receiver algorithms. However, in some applications the sum-product algorithm is computationally infeasible. Specifically, this is the case when both continuous and discrete parameters are present within the model. Also, the complexity of the sum-product algorithm is exponential in the number of variables connected to a particular factor node and can be prohibitive in multi-user and multi-antenna applications. In this dissertation we identify three key problems which can benefit from iterative probabilistic processing, but for which the sum-product algorithm is too complex. They are (1) joint synchronization and detection in multipath channels with emphasis on frame timing, (2) detection in co-channel interference and non-Gaussian noise, and (3) joint channel estimation and multi-signal detection. This dissertation presents the advances we have made in iterative probabilistic processing in order to tackle these problems. The motivation behind the work is to (a) compromise as little as possible on the performance that is achieved while limiting the computational complexity and (b) maintain good theoretical justification to the algorithms that are developed.en
dc.description.degreePh. D.en
dc.format.mediumETDen
dc.identifier.othervt_gsexam:7719en
dc.identifier.urihttp://hdl.handle.net/10919/71640en
dc.publisherVirginia Techen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectIterative Receiversen
dc.subjectFactor Graphsen
dc.subjectBelief Propagationen
dc.titleAdvances in Iterative Probabilistic Processing for Communication Receiversen
dc.typeDissertationen
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

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

Collections

Doctoral Dissertations