Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels
This 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....
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/50036 |
| _version_ | 1811693052832514048 |
|---|---|
| author | Dai, Lin |
| author2 | Goh Wang Ling |
| author_facet | Goh Wang Ling Dai, Lin |
| author_sort | Dai, Lin |
| collection | NTU |
| description | This 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. |
| first_indexed | 2024-10-01T06:45:33Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/50036 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T06:45:33Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | ntu-10356/500362023-07-07T16:33:00Z Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels Dai, Lin Goh Wang Ling School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems This 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. Bachelor of Engineering 2012-05-29T03:26:39Z 2012-05-29T03:26:39Z 2012 2012 Final Year Project (FYP) http://hdl.handle.net/10356/50036 en Nanyang Technological University 71 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems Dai, Lin Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels |
| title | Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels |
| title_full | Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels |
| title_fullStr | Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels |
| title_full_unstemmed | Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels |
| title_short | Iterative decoding of turbo product codes based on the sum-product algorithm for magnetic recording channels |
| title_sort | iterative decoding of turbo product codes based on the sum product algorithm for magnetic recording channels |
| topic | DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems |
| url | http://hdl.handle.net/10356/50036 |
| work_keys_str_mv | AT dailin iterativedecodingofturboproductcodesbasedonthesumproductalgorithmformagneticrecordingchannels |