A Further Study on Modified-t Algorithm for Linear Block Codes
碩士 === 國立臺北科技大學 === 電機工程系研究所 === 99 === For an (n, k) linear block code, maximum likelihood decoding attains the best error performance. However, the decoding complexity and the hardware requirements grow with the dimension of the code, causing a huge amount of calculating time. Therefore, we may re...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/3th524 |