• 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

    Concatenation of punctured convolutional codes.

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_td_9307654_sip1_m.pdf
    Size:
    3.532Mb
    Format:
    PDF
    Description:
    azu_td_9307654_sip1_m.pdf
    Download
    Author
    Bienz, Richard Alan.
    Issue Date
    1992
    Keywords
    Dissertations, Academic.
    Digital communications.
    Electrical engineering.
    Committee Chair
    Schooley, Larry C.
    
    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 or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
    Abstract
    The cascading or concatenation of error control codes is a well-established technique in digital communications. This type of code can yield excellent bit error rate performance. Concatenated codes that contain short memory convolutional codes are applicable to many communication links. The applications include the various combinations of modulations with memory, channels with memory and coding with memory. The Viterbi decoder is the decoder of choice for these concatenated coding schemes. Unfortunately, Viterbi decoders produce only hard decisions. The Viterbi decoders near the channel (inner decoders) therefore do not send all the available symbol information (soft decisions) to the outer decoders. Also, there are no practical decoders that produce this symbol information. The result is an unrealized coding gain. The principal contribution of this dissertation is to present a new decoder design that can be used as an inner decoder in a concatenated convolutional coding scheme. This decoder is a modified Viterbi decoder that generates soft decisions. The decoder has been named the Maximum Likelihood Paths Comparison (MLPC) decoder. The MLPC decoder uses a subset of the operations performed by a normal Viterbi decoder and therefore it is practical. The performance of the new decoder in a communication link is determined by simulation. The link uses a concatenated code that contains two convolutional codes. Both codes have a base code constraint length of 7 and rates of 1/2. The outer code is punctured to a few higher rates. Various results from these simulations are presented. The bit error rate performance of the code is excellent. The code performance also matches the theoretical upper bit error rate bound very closely for the signal-noise-ratios simulated. The complexity of the overall concatenated code system is compared to the complexity of a single convolutional code with equal performance. Using certain reasonable assumptions, the complexity of the concatenated code is roughly an order of magnitude less than the complexity of the single code.
    Type
    text
    Dissertation-Reproduction (electronic)
    Degree Name
    Ph.D.
    Degree Level
    doctoral
    Degree Program
    Electrical and Computer Engineering
    Graduate College
    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.