On the Parallel Optimum Block Code Decoding Algorithm
碩士 === 國立中央大學 === 通訊工程研究所碩士在職專班 === 96 === By A*-branch and bound algorithm, parallel optimum block code decoding is an artificial intelligent searching method, which is used to solve the shortest path within a graph with branch and bound approach to determine the metric of each vertex in a tree. Ap...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/71297920544954171630 |