Complexity and performance analysis of turbo decoders for wireless communication systems Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/5x21tj42b

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • The quest to achieve reliable communication has always existed. Error Correcting codes have made communication systems even more reliable under high signal to noise ratios. A new class of codes called Turbo codes have proved to be more effective compared to the other classes of codes and achieve performance close to the maximum theoretical limits. The iterative decoding schemes employed in turbo decoding enable us to tradeoff the bit error rate to the complexity of decoding by increasing or decreasing the number of iterations. Two classes of turbo decoders exist, one tries to estimate the transmit sequence and the other class of decoder tries to estimate the symbol transmitted at each time instant. The complexity of both the algorithms are different and we try to analyze the performance vs complexity of both classes of decoders at different conditions. We find the suitability of these algorithms for wireless personal communication systems. In this thesis, we find which class of algorithm performs well, given a fixed amount of processing power and under what conditions.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Submitted by Kaylee Patterson (kdpscanner@gmail.com) on 2012-08-24T21:06:56Z No. of bitstreams: 1 RangarajuluSuresh2001.pdf: 682245 bytes, checksum: f73001ec6f15580f73db637b505410a7 (MD5)
  • description.provenance : Made available in DSpace on 2012-08-24T22:18:54Z (GMT). No. of bitstreams: 1 RangarajuluSuresh2001.pdf: 682245 bytes, checksum: f73001ec6f15580f73db637b505410a7 (MD5) Previous issue date: 2001-04-13
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-24T22:18:54Z (GMT) No. of bitstreams: 1 RangarajuluSuresh2001.pdf: 682245 bytes, checksum: f73001ec6f15580f73db637b505410a7 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-24T22:16:58Z (GMT) No. of bitstreams: 1 RangarajuluSuresh2001.pdf: 682245 bytes, checksum: f73001ec6f15580f73db637b505410a7 (MD5)

Relationships

In Administrative Set:
Last modified: 08/15/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items