Advanced information of parity bits for the A * DecodingAlgorithm
博士 === 國立臺灣大學 === 電信工程學研究所 === 102 === The A* algorithm for decoding linear block codes is known to be an efficient tree-search method for decoding short linear block codes. The A* decoding algorithm and its modified methods can be applied to either maximum-likelihood (ML) soft-decision decoding or...
Main Authors: | Chia-Fu Chang, 張家輔 |
---|---|
Other Authors: | 林茂昭 |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/82746070042650356953 |
Similar Items
-
Bit-Flipping Decoding Algorithms for Product Low-Density Parity-Check Codes
by: TSAO, CHING-CHENG, et al.
Published: (2014) -
Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes
by: Shu-wei Zhang, et al.
Published: (2007) -
Low-density Parity-Check decoding Algorithms
by: Pirou, Florent
Published: (2004) -
Reliability-Ratio Based Weighted Bit-Flipping Decoding for Low-Density Parity Check Codes
by: Guo, F., et al.
Published: (2004) -
A* Decoding for Noncoherent Block Coded MPSK
by: Ga-Fu Chang, et al.
Published: (2004)