Algebraic Constructions of High Performance and Efficiently Encodable Non-Binary Quasi-Cyclic LDPC Codes (2008)
Abstract / truncated to 115 words
This dissertation presents a general method and eight algebraic methods for constructing high performance and efficiently encodable non-binary quasi-cyclic LDPC codes based on arrays of special circulant permutation matrices. Two design techniques, array masking and array dispersion, for constructing both regular and irregular LDPC codes with desired specifications are also proposed. Codes constructed based on these methods perform very well over the AWGN channel and flat fading channels. With iterative decoding using a Fast Fourier Transform based sum-product algorithm, they achieve significantly large coding gains over Reed-Solomon codes of the same lengths and rates decoded with either algebraic hard-decision Berlekamp- Massey algorithm or algebraic soft-decision K¨otter-Vardy algorithm. Also presented is a class of asymptotically optimal ...
First few pages / click to enlarge
The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.
The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.