Simplified decoding techniques for linear block codes

Show simple item record

dc.contributor.advisor Popovici, Emanuel M. en Srivastava, Shraddha 2014-03-10T11:51:14Z 2013 2013
dc.identifier.citation Srivastava, S. 2013. Simplified decoding techniques for linear block codes. PhD Thesis, University College Cork. en
dc.identifier.endpage 136
dc.description.abstract Error correcting codes are combinatorial objects, designed to enable reliable transmission of digital data over noisy channels. They are ubiquitously used in communication, data storage etc. Error correction allows reconstruction of the original data from received word. The classical decoding algorithms are constrained to output just one codeword. However, in the late 50’s researchers proposed a relaxed error correction model for potentially large error rates known as list decoding. The research presented in this thesis focuses on reducing the computational effort and enhancing the efficiency of decoding algorithms for several codes from algorithmic as well as architectural standpoint. The codes in consideration are linear block codes closely related to Reed Solomon (RS) codes. A high speed low complexity algorithm and architecture are presented for encoding and decoding RS codes based on evaluation. The implementation results show that the hardware resources and the total execution time are significantly reduced as compared to the classical decoder. The evaluation based encoding and decoding schemes are modified and extended for shortened RS codes and software implementation shows substantial reduction in memory footprint at the expense of latency. Hermitian codes can be seen as concatenated RS codes and are much longer than RS codes over the same aphabet. A fast, novel and efficient VLSI architecture for Hermitian codes is proposed based on interpolation decoding. The proposed architecture is proven to have better than Kötter’s decoder for high rate codes. The thesis work also explores a method of constructing optimal codes by computing the subfield subcodes of Generalized Toric (GT) codes that is a natural extension of RS codes over several dimensions. The polynomial generators or evaluation polynomials for subfield-subcodes of GT codes are identified based on which dimension and bound for the minimum distance are computed. The algebraic structure for the polynomials evaluating to subfield is used to simplify the list decoding algorithm for BCH codes. Finally, an efficient and novel approach is proposed for exploiting powerful codes having complex decoding but simple encoding scheme (comparable to RS codes) for multihop wireless sensor network (WSN) applications. en
dc.description.sponsorship Science Foundation Ireland (06/MI/006) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher University College Cork en
dc.rights © 2013, Shraddha Srivastava. en
dc.rights.uri en
dc.subject Error correction codes en
dc.subject Reed-Solomon codes en
dc.subject Hermitian codes en
dc.subject BCH codes en
dc.subject Toric codes en
dc.subject Subfield subcodes en
dc.subject Coding theory en
dc.subject.lcsh Wireless sensor networks en
dc.subject.lcsh Error-correcting codes (Information theory) en
dc.title Simplified decoding techniques for linear block codes en
dc.type Doctoral thesis en
dc.type.qualificationlevel Doctoral en
dc.type.qualificationname PHD (Engineering) en
dc.internal.availability Full text not available en
dc.description.version Accepted Version
dc.contributor.funder Science Foundation Ireland en
dc.contributor.funder CSI, Dublin en
dc.description.status Not peer reviewed en Electrical and Electronic Engineering en
dc.check.reason This thesis is due for publication or the author is actively seeking to publish this material en
dc.check.opt-out Not applicable en
dc.thesis.opt-out false
dc.check.entireThesis Entire Thesis Restricted
dc.check.embargoformat Both hard copy thesis and e-thesis en
dc.internal.conferring Autumn Conferring 2013 en

Files in this item

This item appears in the following Collection(s)

Show simple item record

© 2013, Shraddha Srivastava. Except where otherwise noted, this item's license is described as © 2013, Shraddha Srivastava.
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement