A Study on Modified Graph Decoding for Low‐Density Parity‐Check Convolutional Codes
碩士 === 國立交通大學 === 電信工程研究所 === 104 === If there exist cycle in tanner graph of error-correcting code, the messages for computation in the sum-product algorithm (SPA) are observed to be statistically dependent, thereby degrading the decoding performance from the optimal one. Such performance degradati...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/8s4jcb |