"Turbo coding is one of the best channel coding procedures presented to the coding community in the recent history of channel coding. The efficient error correcting capability of turbo codes is attributed to its decoding method. The purpose of this thesis is to design and implement a novel decoding method which is simpler than the existing decoding methods thereby reducing the decoding complexity to a reasonable level. The novel method of decoding is based on a greedy algorithm which involves the search of proper error patterns that aims at reducing the overall global metric. This novel method is implemented for a convolutional encoder and then for the turbo encoder with both recursive and the non-recursive component structures. It is found that this new method of decoding is simpler than older methods and also gives encouraging performance"--Abstract, page iii.
Weeks, William IV
Kosbar, Kurt Louis
Beetner, Daryl G.
Electrical and Computer Engineering
M.S. in Electrical Engineering
University of Missouri--Rolla
viii, 62 pages
© 2002 Venkat Mandagulathur Pattabhiraman, All rights reserved.
Thesis - Restricted Access
Print OCLC #
Link to Catalog Record
Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.http://merlin.lib.umsystem.edu/record=b4972226~S5
Pattabhiraman, Venkat Mandagulathur, "Implementation of low-complexity suboptimal turbo decoders using greedy algorithms" (2002). Masters Theses. 2245.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.