{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81044"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81044","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Sparse Solutions to Structured Underdetermined Systems in the Presence of Small Noise","abstract":"In addition, we provide an upper bound on the magnitude of the small noise to guarantee the correct determination of the number of nonzero entries of our unknown sparse vector, as well as an upper bound on the magnitude of the small noise to guarantee the correct localization of these nonzero entries. Simulations suggest that the first bound is very tight and that the two proposed algorithms outperform existing analytical schemes in the literature. Furthermore, we prove, in the case of real-number DFT codes, that if a fixed number of bits is available for the representation of real numbers, then these bits must be allocated uniformly among the entries of the codeword to optimize performance. Finally, we generalize the types of matrices our recovery algorithms can handle in the presence of small noise.","abstract_html":"In addition, we provide an upper bound on the magnitude of the small noise to guarantee the correct determination of the number of nonzero entries of our unknown sparse vector, as well as an upper bound on the magnitude of the small noise to guarantee the correct localization of these nonzero entries. Simulations suggest that the first bound is very tight and that the two proposed algorithms outperform existing analytical schemes in the literature. Furthermore, we prove, in the case of real-number DFT codes, that if a fixed number of bits is available for the representation of real numbers, then these bits must be allocated uniformly among the entries of the codeword to optimize performance. Finally, we generalize the types of matrices our recovery algorithms can handle in the presence of small noise.","abstract_has_math":false,"creators":["Takos, Georgios"],"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":["Christoforos N. Hadjicostis"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:09:23Z","date_published":"2015-09-25T20:09:23Z","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)AAI3290396"],"render_values":[{"text":"(MiAaPQ)AAI3290396","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81044","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Christoforos N. Hadjicostis"]},{"key":"dc:creator","label":"Author","values":["Takos, Georgios"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:09:23Z","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/81044","(MiAaPQ)AAI3290396"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In addition, we provide an upper bound on the magnitude of the small noise to guarantee the correct determination of the number of nonzero entries of our unknown sparse vector, as well as an upper bound on the magnitude of the small noise to guarantee the correct localization of these nonzero entries. Simulations suggest that the first bound is very tight and that the two proposed algorithms outperform existing analytical schemes in the literature. Furthermore, we prove, in the case of real-number DFT codes, that if a fixed number of bits is available for the representation of real numbers, then these bits must be allocated uniformly among the entries of the codeword to optimize performance. Finally, we generalize the types of matrices our recovery algorithms can handle in the presence of small noise.","Made available in DSpace on 2015-09-25T20:09:23Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290396.pdf: 2753076 bytes, checksum: afb1f2b4a92261c8df4c5956b8e9fc36 (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 82326 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","128 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."]},{"key":"dc:title","label":"Title","values":["Sparse Solutions to Structured Underdetermined Systems in the Presence of Small Noise"]}]}],"canonical_facts":{"dc:contributor":["Christoforos N. Hadjicostis"],"dc:creator":["Takos, Georgios"],"dc:date":["2015-09-25T20:09:23Z","10000-01-01","2007"],"dc:description":["In addition, we provide an upper bound on the magnitude of the small noise to guarantee the correct determination of the number of nonzero entries of our unknown sparse vector, as well as an upper bound on the magnitude of the small noise to guarantee the correct localization of these nonzero entries. Simulations suggest that the first bound is very tight and that the two proposed algorithms outperform existing analytical schemes in the literature. Furthermore, we prove, in the case of real-number DFT codes, that if a fixed number of bits is available for the representation of real numbers, then these bits must be allocated uniformly among the entries of the codeword to optimize performance. Finally, we generalize the types of matrices our recovery algorithms can handle in the presence of small noise.","Made available in DSpace on 2015-09-25T20:09:23Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3290396.pdf: 2753076 bytes, checksum: afb1f2b4a92261c8df4c5956b8e9fc36 (MD5) Previous issue date: 2007","Embargo set by: Seth Robbins for item 82326 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","128 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007."],"dc:identifier":["http://hdl.handle.net/2142/81044","(MiAaPQ)AAI3290396"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Sparse Solutions to Structured Underdetermined Systems in the Presence of Small Noise"],"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"}