Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDai, Lin
dc.description.abstractThis project considers the iterative decoding of turbo product codes (TPC) with eBCH codes (TPC/eBCH) based on the belief propagation (BP) over magnetic recording channels. The existence of many short cycles in the code graph of eBCH codes seriously degrades the performance of iterative decoding. Hence, the conventional sum-product algorithm (SPA) does not perform well for eBCH codes; while the optimal a posteriori probability (APP) decoding has a high computational complexity. In order to overcome the issue caused by cycles, several approaches have been developed in this project to improve the bit-error-rate (BER) performance. For example, a procedure is introduced to perform the SPA over a binary parity check matrix that adapts based on the Gaussian Elimination (GE). Hence, the procedure is termed the Adaptive Belief Propagation (ABP) algorithm.en_US
dc.format.extent71 p.en_US
dc.rightsNanyang Technological University
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systemsen_US
dc.titleIterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channelsen_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorGoh Wang Lingen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeBachelor of Engineeringen_US
item.fulltextWith Fulltext-
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)
Files in This Item:
File Description SizeFormat 
  Restricted Access
Main article1.61 MBAdobe PDFView/Open

Page view(s)

Updated on Dec 11, 2023


Updated on Dec 11, 2023

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.