Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/11786
Title: IMPLEMENTATION OF LDPC DECODER
Authors: satti, Kishore Kumar
Keywords: ELECTRONICS AND COMPUTER ENGINEERINGe;ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING
Issue Date: 2007
Abstract: Novel communication and information services are being introduced almost daily and the demand for higher data rates continues to grow. Error correcting codes insert redundancy into the transmitted data stream so that the receiver can detect and possibly correct errors that occur during transmission. This poses a challenge to find an optimal coding scheme that has good performance and can be efficiently implemented in hardware. The Low-Density Parity-Check (LDPC) codes are among the most powerful forward error correcting codes, since they enable to get as close as a fraction of a dB from the Shannon limit. This astonishing performance combined with their relatively simple decoding algorithm makes these codes very attractive for the digital communication systems. Inherent parallelism of the sum-product algorithm (used for decoding LDPC codes) makes it very suitable to implement on hardware platforms like field programmable gate array (FPGA). In this dissertation the modified sum-product algorithm is considered for implementation of LDPC decoder. The Quasi-cyclic LDPC codes which are more amenable to VLSI implementation are used. (8176, 7154) quasi-cyclic LDPC encoder is implemented which produces 1022 parity bits in the codeword. This codeword is decoded by the LDPC decoder which is synthesized using hardware description language
URI: http://hdl.handle.net/123456789/11786
Other Identifiers: M.Tech
Research Supervisor/ Guide: Mehra, D. K.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECDG13581.pdf6.23 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.