{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81031"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81031","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Equalization Using Graphical Models","abstract":"We examine the use of graphical models for the equalization of digital communication channels with memory. Graphical models provide a framework in which the structure of large systems can be exploited to derive efficient estimation algorithms. Furthermore, properties of a graph on which an algorithm is based can be used for analysis. We use factor graphs to develop efficient implementations of various equalization algorithms, including an unconstrained and a constrained linear minimum mean squared error equalizer and a generalized decision feedback equalizer. In addition to providing practical algorithms, the factor graph framework yields insight into their mechanics and interrelationships. We then consider algorithms for turbo equalization, using both graphical models and an algebraic approach to derive appropriate equalizers. In all cases, associated graphs are used for performance analysis. Finally, we consider universal piecewise linear equalization, adapting the well-known context-tree weighting algorithm. In addition, we generalize this approach by introducing context graphs that allow for a trade-off between modeling power and computational complexity. Although we focus primarily on equalization algorithms, many of the approaches considered are more general and can be applied to a wide variety of estimation problems.","abstract_html":"We examine the use of graphical models for the equalization of digital communication channels with memory. Graphical models provide a framework in which the structure of large systems can be exploited to derive efficient estimation algorithms. Furthermore, properties of a graph on which an algorithm is based can be used for analysis. We use factor graphs to develop efficient implementations of various equalization algorithms, including an unconstrained and a constrained linear minimum mean squared error equalizer and a generalized decision feedback equalizer. In addition to providing practical algorithms, the factor graph framework yields insight into their mechanics and interrelationships. We then consider algorithms for turbo equalization, using both graphical models and an algebraic approach to derive appropriate equalizers. In all cases, associated graphs are used for performance analysis. Finally, we consider universal piecewise linear equalization, adapting the well-known context-tree weighting algorithm. In addition, we generalize this approach by introducing context graphs that allow for a trade-off between modeling power and computational complexity. Although we focus primarily on equalization algorithms, many of the approaches considered are more general and can be applied to a wide variety of estimation problems.","abstract_has_math":false,"creators":["Drost, Robert James"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Singer, Andrew C."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:09:18Z","date_published":"2015-09-25T20:09:18Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Engineering, Electronics and Electrical"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3290223"],"render_values":[{"text":"(MiAaPQ)AAI3290223","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81031","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Singer, Andrew C."]},{"key":"dc:creator","label":"Author","values":["Drost, Robert James"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:09:18Z","10000-01-01","2007"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81031","(MiAaPQ)AAI3290223"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We examine the use of graphical models for the equalization of digital communication channels with memory. Graphical models provide a framework in which the structure of large systems can be exploited to derive efficient estimation algorithms. Furthermore, properties of a graph on which an algorithm is based can be used for analysis. We use factor graphs to develop efficient implementations of various equalization algorithms, including an unconstrained and a constrained linear minimum mean squared error equalizer and a generalized decision feedback equalizer. In addition to providing practical algorithms, the factor graph framework yields insight into their mechanics and interrelationships. We then consider algorithms for turbo equalization, using both graphical models and an algebraic approach to derive appropriate equalizers. In all cases, associated graphs are used for performance analysis. Finally, we consider universal piecewise linear equalization, adapting the well-known context-tree weighting algorithm. In addition, we generalize this approach by introducing context graphs that allow for a trade-off between modeling power and computational complexity. Although we focus primarily on equalization algorithms, many of the approaches considered are more general and can be applied to a wide variety of estimation problems.","Made available in DSpace on 2015-09-25T20:09:18Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290223.pdf: 4549148 bytes, checksum: 62a3cf24129789ffb61bded428faf977 (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 82313 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","169 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."]},{"key":"dc:title","label":"Title","values":["Equalization Using Graphical Models"]}]}],"canonical_facts":{"dc:contributor":["Singer, Andrew C."],"dc:creator":["Drost, Robert James"],"dc:date":["2015-09-25T20:09:18Z","10000-01-01","2007"],"dc:description":["We examine the use of graphical models for the equalization of digital communication channels with memory. Graphical models provide a framework in which the structure of large systems can be exploited to derive efficient estimation algorithms. Furthermore, properties of a graph on which an algorithm is based can be used for analysis. We use factor graphs to develop efficient implementations of various equalization algorithms, including an unconstrained and a constrained linear minimum mean squared error equalizer and a generalized decision feedback equalizer. In addition to providing practical algorithms, the factor graph framework yields insight into their mechanics and interrelationships. We then consider algorithms for turbo equalization, using both graphical models and an algebraic approach to derive appropriate equalizers. In all cases, associated graphs are used for performance analysis. Finally, we consider universal piecewise linear equalization, adapting the well-known context-tree weighting algorithm. In addition, we generalize this approach by introducing context graphs that allow for a trade-off between modeling power and computational complexity. Although we focus primarily on equalization algorithms, many of the approaches considered are more general and can be applied to a wide variety of estimation problems.","Made available in DSpace on 2015-09-25T20:09:18Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290223.pdf: 4549148 bytes, checksum: 62a3cf24129789ffb61bded428faf977 (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 82313 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","169 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."],"dc:identifier":["http://hdl.handle.net/2142/81031","(MiAaPQ)AAI3290223"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Equalization Using Graphical Models"],"dc:type":["text"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:15Z"}