Parallel turbo decoding

dc.contributor.advisorKelley, Brian
dc.contributor.authorHuang, Szu-Hao
dc.contributor.committeeMemberJohn, Eugene
dc.contributor.committeeMemberAkopian, David
dc.descriptionThis item is available only to currently enrolled UTSA students, faculty or staff. To download, navigate to Log In in the top right-hand corner of this screen, then select Log in with my UTSA ID.
dc.description.abstractTurbo codes, which are the most considerable important research in the coding theory in recent years, were proposed by Berrou, Glovieux, and Thitimajshima in 1993. It has a near-capacity bit error rate performance at low signal-to-noise ratios with acceptable computation complexity. A turbo decoder consists of two SISO decoders which connected by an interleaver and a deinterleaver with each other. Two decoding algorithms, MAP (Maximum a posteriori probability) and SOVA (Soft Output Viterbi Algorithm) are applied in SISO decoders and presented in this thesis. In order to reduce processing time and achieve high throughput decoding, a sliding window approach is proposed and several parameters are defined to analysis the trade-off of the parallel turbo decoding architectures scheme which implemented in practice.
dc.description.departmentElectrical and Computer Engineering
dc.format.extent71 pages
dc.subject.classificationElectrical engineering
dc.titleParallel turbo decoding
dcterms.accessRightspq_closed and Computer Engineering of Texas at San Antonio of Science


Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
403.07 KB
Adobe Portable Document Format