• Login
    View Item 
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Detection and Decoding: New Learning-Based Algorithms and Their Fundamental Limits

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_etd_21533_sip1_m.pdf
    Size:
    34.03Mb
    Format:
    PDF
    Download
    Author
    Adiga, Sudarshan
    Issue Date
    2024
    Advisor
    Tandon, Ravi
    
    Metadata
    Show full item record
    Publisher
    The University of Arizona.
    Rights
    Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction, presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
    Abstract
    The ever-increasing demand for low-latency, higher reliability, and enhanced coverage in next-generation mobile communications, particularly for applications such as the Internet of Things and autonomous driving, necessitates the development of new algorithms that improve performance or reduce the complexity of contemporary approaches. Achieving these objectives relies on advancements in areas such as low-complexity modulation, coding and decoding schemes, detection algorithms, and beamforming methods. This thesis aims to address these needs through innovations in machine learning for channel coding and detection. First, we theoretically investigate neural belief propagation (NBP) decoders' ability to enhance decoding performance. Our theoretical and empirical analysis reveals the dependence of NBP decoders' generalization capabilities on factors such as code parameters, decoding iterations, and training dataset size. These insights are crucial for optimizing the design and training of NBP decoders for practical applications. Second, we propose Sparse Matrix Codes (SMC), a novel channel coding technique tailored for ultra-reliable low-latency communications. SMC maps message bits to a sparse matrix, which is then multiplied by a spreading matrix and transmitted over the communication channel. By adopting tools from compressed sensing, we derive a low-complexity decoding algorithm to effectively recover the message from the channel output. Lastly, we introduce DRE-CUSUM, a machine learning-based change detection method for high-dimensional data with unknown distribution parameters. The core idea is to estimate the density ratio before and after a split point in a time series, using a non-parametric model to detect changes. We provide theoretical justification and accuracy guarantees for the proposed approach, highlighting its robustness and reliability.
    Type
    Electronic Dissertation
    text
    Degree Name
    Ph.D.
    Degree Level
    doctoral
    Degree Program
    Graduate College
    Electrical & Computer Engineering
    Degree Grantor
    University of Arizona
    Collections
    Dissertations

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.