New Iterative Inference Algorithms for Source Coding based on Markov Random Fields

Aladin Research Commons

New Iterative Inference Algorithms for Source Coding based on Markov Random Fields

Show simple item record

dc.contributor.advisor Regalia, Phillip A en_US
dc.contributor.author Fernandez, Jose Manuel en_US
dc.contributor.other Namazi, Nader en_US
dc.contributor.other Arozullah, Mohammed en_US
dc.contributor.other Nieh, Sen en_US
dc.contributor.other Lade, Poul en_US
dc.date.accessioned 2012-02-15T20:53:19Z
dc.date.available 2012-02-15T20:53:19Z
dc.date.created 2012 en_US
dc.date.issued 2012-02-15T20:53:19Z
dc.identifier.other Fernandez_cua_0043A_10267 en_US
dc.identifier.uri http://hdl.handle.net/1961/10132
dc.description Degree awarded: Ph.D. Electrical Engineering and Computer Science. The Catholic University of America en_US
dc.description.abstract New Iterative Inference Algorithms For Source Coding Based On Markov Random FieldsJose M. Fernandez, Ph.D.Director: Phillip Regalia, Ph.D.The global deployment of wireless communication systems poses significant challenges for system designers which have to accommodate an ever-increasing number of users while simultaneously meet demands for increased levels of security and privacy. Many of these problems involve aspects of lossy source coding that are yet to be well understood. For instance, the nature and combined effectiveness of sparse graphs and message-passing algorithms in source coding continues to be the subject of debate and active research. This is in stark contrast to the channel coding case where specific capacity-approaching codes (i.e. Turbo Codes, Low-Density Parity Check Codes, etc.) and classical message-passing schemes (i.e. Belief Propagation) are clearly understood, widely accepted, and increasingly in use. Furthermore, the emergence of cavity methods drawn from statistical physics (i.e. Survey Propagation) gave rise to the widespread assumption that the source coding problem could not be solved by simple Belief Propagation-based iterations over Markov Random Fields. This notion is challenged heretofore by the introduction of two novel message-passing algorithms. These two simple schemes, namely Truthiness Propagation and Modified Truthiness Propagation, are developed based upon modified Bethe free energy approximations (equivalent to log-partition function approximations) and shown to be closely related to Belief Propagation, thus situating them on firm theoretical ground. The new algorithms exhibit rate-distortion performance near the Shannon limit even for modest codeword lengths when combined with both regular and irregular Low-Density Generator Matrix Codes. This feature offers a distinct advantage not seen with other message-passing schemes. Furthermore, their complexity is manageable since the decimation steps prevalent in other recently proposed techniques are not required. Finally, these modified instantiations of Belief Propagation are applied to a number of applications relevant to the codeword quantization problem (i.e. general decoding problem) via simple examples in dirty paper coding, data hiding, secrecy coding, and wireless sensor networks. en_US
dc.format.extent 198 p. en_US
dc.format.mimetype application/pdf en_US
dc.publisher The Catholic University of America en_US
dc.subject Electrical engineering en_US
dc.title New Iterative Inference Algorithms for Source Coding based on Markov Random Fields en_US
dc.type Text en_US
dc.type Dissertation en_US


Files in this item

Files Size Format View
Fernandez_cua_0043A_10267display.pdf 4.887Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics